text:
About Salinger Privacy
Videos, Podcasts and Media Mentions
Our Consulting Services
Privacy by Design advice
Algorithmic Impact Assessment
Privacy Compliance Reviews
Public Courses and Workshops
In-house Privacy Training and Workshops
IAPP Certifications
Training Advisory Services
Privacy Resources
Compliance Kits
Resources on key privacy topics
Anna Johnston
Melanie Casley
Andrea Calleia
Stephen Wilson
Chris Culnane
For NSW Public Sector
For Victorian Public Sector
For Australian Government
Yet another broken anonymity promise
December 21, 2017 , Stephen Wilson
In 2016, the Australian government released, for research purposes, an extract of public health insurance data, comprising the 30-year billing history of ten percent of the population, with medical providers and patients purportedly de-identified. Melbourne University researcher Dr Vanessa Teague and her colleagues famously found quite quickly that many of the providers were readily re-identified. The dataset was withdrawn, though not before many hundreds of copies were downloaded from the government website.
The government's responses to the re-identification work were emphatic but sadly not positive. For one thing, legislation was written to criminalize the re-identification of ostensibly 'anonymised' data, which would frustrate work such as Teague's regardless of its probative value to ongoing privacy engineering (the bill has yet to be passed). For another, the Department of Health insisted that no patient information had been compromised. That was then.
It seems less ironic than inevitable that in fact the patients' anonymity was not to be taken as read. In follow-up work released earlier this week, Teague, with Dr Chris Culnane and Dr Ben Rubinstein, have shown how patients in that data release may indeed be re-identified.
The ability to re-identify patients from this sort of Open Data release is frankly catastrophic. The release of imperfectly de-identified healthcare data poses real dangers to patients with socially difficult conditions. This is surely well understood. What we now need to contend with is the question of whether Open Data practices like this deliver benefits that justify the privacy risks. That's going to be a tricky debate, for the belief in data science is bordering on religious.
It beggars belief that any government official would promise "anonymity" any more. These promises just cannot be kept.
Re-identification has become a professional sport. Researchers are constantly finding artful new ways to triangulate individuals' identities, drawing on diverse public information, ranging from genealogical databases to photos from celebrity gossip sites. But it seems that no matter how many times privacy advocates warn against these dangers, the Open Data juggernaut just rolls on. Concerns are often dismissed as academic, or being trivial compared with the supposed fruits of research conducted on census data, Medicare records and the like.
In "Health Data in an Open World (PDF)" Teague et al warn (not for the first time) that "there is a misconception that [protecting the privacy of individuals in these datasets] is either a solved problem, or an easy problem to solve" (p2). They go on to stress "there is no good solution for publishing sensitive unit-record level data that protects privacy without substantially degrading the usefulness of the data" (p3).
What is the cost-benefit of the research done on these data releases? Statisticians and data scientists say their work informs government policy, but is that really true? Let's face it. "Evidence based policy" has become quite a joke in Western democracies. There are umpteen really big public interest issues where science and evidence are not influencing policy settings at all. So I am afraid statisticians need to be more modest about the practical importance of their findings when they mount bland "balance" arguments that the benefits outweigh the risks to privacy.
If there is a balance to be struck, then the standard way to make the calculation is a Privacy Impact Assessment (PIA). This can formally assess the risk of "de-identified" data being re-identified. And if it can be, a PIA can offer other, layered protections to protect privacy.
So where are all the PIAs?
Open Data is almost a religion. Where is the evidence that evidence-based policy making really works?
I was a scientist and I remain a whole-hearted supporter of publicly funded research. But science must be done with honest appraisal of the risks. It is high time for government officials to revisit their pat assertions of privacy and security. If the public loses confidence in the health system's privacy protection, then some people with socially problematic conditions might simply withdraw from treatment, or hold back vital details when they engage with healthcare providers. In turn, that would clearly damage the purported value of the data being collected and shared.
Big Data-driven research on massive public data sets just seems a little too easy to me. We need to discuss alternatives to Open Data bulk releases. One option is to confine extracted research data to secure virtual data rooms, and grant access only to specially authorised researchers. These people would be closely monitored and audited; they would comprise a small set of researchers; their access would be subject to legally enforceable terms & conditions.
There are compromises we all need to make in research on human beings. Let's be scientific about science-based policy. Let's rigorously test our faith in Open Data, and let's please stop taking "de-identification" for granted. It's really something of a magic spell.
Photograph (c) Shutterstock
If you enjoyed this blog, subscribe to our newsletter to receive more privacy insights and news every month.
Why can't Aunty get the ABCs of privacy right?
Privacy law reform in Australia – the good, the bad and the ugly
Between 7 and 11 lessons you can learn from the latest OAIC privacy case
Privacy and gender: what to ask, when and why
What covid apps can teach us about privacy, utility and trust in tech design
Cat or carrot? Assessing the privacy risks from algorithmic decisions
Not too much identity technology, and not too little
For all the privacy officers caught in the middle of a tug of war
How to earn your social licence: the role of trust in project design
Representative redress required to mop up after asylum seeker data breach
Salinger Privacy can help you navigate the complexity of the regulatory environment, and ensure the trust of your customers.
PO Box 1250, Manly NSW 1655
© Salinger Consulting Pty Ltd
These details will be added to our mailing list to receive the Salinger Privacy eNews and Product News newsletters. You can unsubscribe or adjust your preferences at any time, from the bottom of any newsletter.


The industrial action our members took on 30 June was a success and made clear to the government the extent of anger within the profession.
It had a positive impact on public opinion and in particular exposed as simply untrue attempts by the government to present public sector pensions as unaffordable.
Strike action for any educator is always a last resort. That is why we remain committed to a negotiated solution, if possible, to the dispute over the Teachers' Pension Scheme (TPS).
Following the recent TUC-led discussions, detailed talks will now be held on each public sector scheme including our TPS.
Unfortunately there appears to be a real danger that the government may impose an arbitrary and unfair ceiling on what they are prepared to spend to support teachers' pensions.
In our view, without real negotiations on this key issue, these talks will be a sham - the only issue to be decided being how much more teachers will pay, and how much longer they will have to work to secure inferior benefits.
The government wants to set this limit even while still refusing to provide a new valuation of the Teachers' Pension Scheme. Indeed it is now beginning to consult on the first stage of contribution increases for TPS members.
All education trade unions that are involved in negotiations over TPS (ATL, ASCL, NAHT, NASUWT, NUT, UCAC & UCU) have met today and started the process of drawing up joint campaigning plans for the Autumn. Our aim in all this activity will be simple: to persuade government to negotiate in good faith.
We hope, as we know you hope, that this will result in government listening to teachers and agreeing to genuine negotiations. However if government will not budge from its current position those trade unions who have already taken action (ATL NUT and UCU) will, with regret, need to consider taking further industrial action in November. In that instance unity among staff will be essential if we are to defend our pensions.
The National Association of Head Teachers and UCAC have also already decided to ballot their members for industrial action.
The Government has lost the confidence of the teaching profession over its handling of our pensions. It now has a final chance to listen to reason.
For our part, we will do everything in our power to achieve a negotiated solution without further disruption in our schools, colleges and universities.
We wish all our members a restful summer holiday. Next term, we will return renewed and refreshed and determined once again to protect our pension scheme.


text:
Results: 2,574 results
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
Henshaw, Peter. Mustang (car). Photo available. New York. Chartwell. 2004. 444 pps. folio. Hardcover. First edition. Illustrated in black, white and color. Important reference work. Very scarce in this condition. Fine copy in fine dust jacket (in mylar).
Herbert, Kari. In Search of The South Pole. Photo available. London. Conway. 2011. 192 pps. 4to. Decorated hard cover. First edition. Full number line. Illustrated in black, white and color. Important reference work. Very scarce in this condition. Fine copy.
Herbert, Wally. The Noose of Laurels. Robert E. Peary and the Race to the North Pole. Photo available. New York. Atheneum. 1989. Octavo. Hard cover. First edition. Illustrated. Maps. Important reference work. Very scarce in this condition. Fine copy in fine dust jacket (in mylar).
Herrmann, Georgiana. Monuments of Merv. Traditional Buildings of the Karakum. Photo available. London. The Society of Antiquaries of London. 1999. 243 pps. 4to. Gilt decorated hard cover. Stated first edition. Illustrated in black, white and color. Important reference work. Very scarce in this condition. Fine copy in fine dust jacket (in mylar).
Hertog, Susan. Anne Morrow Lindbergh. Her Life. Photo available. New York. Doubleday. 1999. Octavo. Hard cover. First edition. Illustrated. Important reference work. Very scarce in this condition. Fine copy in fine dust jacket (in mylar).
Hertog, Susan. Anne Morrow Lindbergh. Her Life. Photo available. New York. Doubleday. 1999. Octavo. Hard cover. First edition. Full number line. Illustrated. Important reference work. Very scarce in this condition. Fine copy in fine dust jacket (in mylar).
Herzog, Maurice. Annapurna. Photo available. North Salem. The Adventure Library. 1995. 265 pps. Octavo. Decorated hard cover. First edition thus. Illustrated. Very scarce in this condition. Fine copy.
Hess, Bill. Gift of the Whale. The Inupiat Bowhead Hunt, A Sacred Tradition. Photo available. Seattle. Sasquatch Books. 1999. 228 pps. 4to. Soft cover. First edition. Full number line. Illustrated. Important reference work. Very scarce in this condition. Fine copy
Heuss-Knapp, Elly. Das Blaue Buch vom Rhein. Photo available. Konigstein. Karl Robert Langewiesche Nachfolger. nd. c. 1940. Octavo. Soft cover. First edition. Illustrated. Fine copy.
Heyerdahl, Thor, Sorn Richter & Hj. Riiser-Larsen. Great Norwegian Expeditions. Inscribed. Presentation copy from the Ministry of Defense. Photo available. Oslo. Dreyers Forlag. nd. 232 pps. 4to. Gilt decorated hard cover. First edition. Illustrated in black, white and color. Inscribed "To Lieut. Colonel Perry M. Lusby, U.S.A.F, From The Royal Norwegian Ministry of Defense with much appreciation. Oslo, 22nd April 1958. Finn Walheim? Lieut. Col." Presentation card laid in. Very scarce in this condition. Fine copy.
Heyerdahl, Thor. Aku-Aku. The Secret of Easter Island. Photo available. Chicago. Rand McNally. 1958. 384 pps. Octavo. Hardcover. American edition. Illustrated in black, white and color. Important reference work. Very scarce in this condition. Fine copy in fine (priced clipped) dust jacket (in mylar).
Heyerdahl, Thor. Aku-Aku. The Secret of Easter Island. Photo available. Chicago. Rand McNally. 1958. 384 pps. Octavo. Gilt decorated hard cover. First American edition. Illustrated in black, white and color. Important reference work. Very scarce in this condition. Fine copy.
Heyerdahl, Thor. Early Man and the Ocean. A Search for the Beginnigs of Navigation and Seaborne Civilzations. Photo available. Garden City. Doubleday. 1979. 438 pps. Octavo. Hardcover. First edition. Illustrated. Important reference work. Very scarce in this condition. Fine copy in fine dust jacket (in mylar).
Heyerdahl, Thor. Fatu-Hiva. Back to Nature. Photo available. Garden City. Doubleday. 1974. Octavo. Gilt decorated hard cover. Reprint. Illustrated. Important reference work. Very scarce in this condition. Fine copy in fine dust jacket (in mylar).
Heyerdahl, Thor. Kon-Tiki. A Special Rand McNally Color Edition for Young People. Photo available. Chicago. Rand McNally Co. 1966. 164 pps. 4to. Decorated hard cover. Reprint. Illustrated in black, white and color. Important reference work. Very scarce in this condition. Fine copy.
Heyerdahl, Thor. Kon-Tiki. Across the Pacific by Raft. Photo available. Cuytchogue. Buccaneer Books. 304 pps. Octavo. Hardcover. Reprint. Illustrated. Important reference work. Very scarce in this condition. Fine copy.
Heyerdahl, Thor. Kon-Tiki. Across the Pacific by Raft. Photo available. New York. Rand McNally Co. 1950. 304 pps. Octavo. Gilt decorated hard cover. Reprint. Illustrated. Important reference work. Very scarce in this condition. Fine copy (very light fading to spine).
Heyerdahl, Thor. Kon-Tiki. Across the Pacific by Raft. Photo available. New York. Rand McNally Co. 1951. 304 pps. Octavo. Hardcover. Reprint. Illustrated. Important reference work. Very scarce in this condition. Fine copy in near fine (very light shelf wear) dust jacket (in mylar).
Heyerdahl, Thor. The Kon-Tiki Expedition. Photo available. London. George Allen & Unwin. 1951. 238 pps. Octavo. Hardcover. First edition, thirteenth printing. Illustrated. Important reference work. Very scarce in this condition. Fine (owner name on end paper) copy in edge chipped dust jacket (in mylar).
Heyerdahl, Thor. The RA Expeditions. Photo available. Garden City. Doubleday and Co. 1971. 341 pps. Octavo. Hardcover. First edition, second printing. Illustrated in black, white and color. Important reference work. Very scarce in this condition. Fine copy in near fine (very light shelf wear) dust jacket (in mylar).
Heyerdahl, Thor. The RA Expeditions. Photo available. Garden City. Doubleday and Co. 1971. 341 pps. Octavo. Hardcover. Stated first edition. Illustrated in black, white and color. Important reference work. Very scarce in this condition. Fine copy in fine (price clipped) dust jacket (in mylar).
Heyward, Zan. Things I Remember. Inscribed by the author. South Carolina. Photo available. Columbia. State-Record. 1964. Octavo. Hardcover. Second edition. Illustrated. Inscribed by the author. Important reference work. Very scarce in this condition. Fine copy in fine dust jacket (in mylar).
Hezel, G. Francis X. (ed). A Book of Readings on Micronesian History. Winds of Change. Omnibus Program for Social Studies Cultural Heritage. Photo available. np. np. nd. 538 pps. 4to. Gilt decorated hard cover. First edition. Illustrated. Important reference work. Very scarce in this condition. Fine copy in fine dust jacket (in mylar).
Hibbard, Don. The View from Diamond Head. Royal Residence to Urban Resort. Photo available. Honolulu. Editions Limited. 1986. 4to. Gilt decorated hard cover. First edition. Illustrated in black, white and color. Important reference work. Fine (owner inscription on end paper) copy in fine dust jacket (in mylar).

redpajama_set_name: RedPajamaCommonCrawl


text:
Redmi K30 could leave rivals in the dust with a 144Hz display refresh rate
Xiaomi has been testing out a very high refresh rate on the screen of its newest smartphone − one that's far higher than the best Google or OnePlus can offer.
The general manager of the brand, Lu Weibing, shared a video (embedded below) on Chinese social media site Weibo, demonstrated that the Redmi K30 is capable of running a display refresh rate as high as 144Hz.
Related: Best smartphones
While it is currently in testing, it's not clear yet as to whether this feature will make it to the final device when it's launched near the end of February — but the smartphone is expected to at least offer 120Hz, which is very impressive for a smartphone.
For quite a long while PC gaming monitors have been able to offer 144Hz, yet it's a rarity for smartphones at this time.
Dedicated gaming phones such as the Asus ROG Phone 2 and the Razer Phone 2 can offer refresh rates of 120Hz, while the mainstream market is led by the likes of the Google Pixel 4 and the OnePlus 7T Pro in this regard, which run refresh rates to a maximum of 90Hz.
The vast majority of the smartphone market is still stuck at 60Hz, which remains the industry standard.
On top of the enviable refresh rate, there are other reasons to anticipate the arrival of the Redmi K30. It will run on the Snapdragon 765G chipset and will therefore have 5G connectivity, and on top of that it will pack a formidable 4500mAh battery.
Related: Best Android phones
The cameras also look to be impressive, with four sensors located on the rear, including the main 64-megapixel snapper. In more practical terms, the K30 will fortunately feature NFC for contactless payments and such, along with a handy 3.5mm headphone jack for the audiophiles.
The device is expected to be released in India before the end of February, but we're not yet certain when it will reach the UK.
Previous Google Chrome third-party ad tracking plans will change web browsing forever
Next Netflix says Virgin won the streaming race this Christmas


In this document we will start with a shorter insight into what machine learning is, where in the ecosystem of computer science it belongs and looks at the difference between machine learning and traditional software development. We will present why machine learning has become popular recently, that is, what enabled concrete implementations, and we will also make a brief introduction to why we should pay extra attention to our problem analysis as an effect of this.
Before we talk about the advantages of machine learning, it may be good to put things in perspective to see why machine learning has gained a lot of focus in recent years. If you base your reference points on the current media image for machine learning, it is easy to believe that the entire toolbox is new. Many of the theoretical building blocks needed for machine learning have a solid history. It is the technical maturity, rather than the new algorithms that have recently emerged. Therefore, we will now outline some of the important building blocks that explain why machine learning is possible right now.
Large data volumes, so-called Big Data makes it possible to use algorithms that build a model of the problem at many examples and thus learning patterns. By observing large data volumes, it is possible to build a static model of the problem. The number of systems that have a data set needed to build a good statistical model has become more common in the last ten years.
Increasing computational power enables large data volumes to be processed. It is not enough to store large data volumes if it cannot be processed by the algorithms that machine learning requires. Cloud services such as Amazon Web Services (AWS) make it easy to access the physical resources required without having to administer the hardware itself; which also opens up the market for operators who do not have the financial opportunity to administer server clusters themselves.
The technical maturity together with an increasingly developed toolbox or self-learning algorithms is a combination, which means we are now at the forefront of the future in machine learning. Even on a theoretical level, much is still unclear. With the industry now beginning to build systems based on self-learning algorithms, it has opened up a large, unexplored area of problems that could not be solved by computers.
In 1847, Louis Augustin Cauchy wrote his article on the Academy of Sciences on non-linear gradient methods for optimization problems, a current self-evident building block in machine learning.
The model of how a neural network works was presented by Warren McCulloch and mathematician Walter Pittsa as early as 1943. Close thereafter, in 1949, Donald Hebb wrote his article "The Organisation of Behaviour" which presented an important aspect of strengthening neuron pathways if fired simultaneously. This became a publication of how learning can be modelled theoretically.
To compare theory and practice, we can see where computer science was in the 40s. Electronic Numerical Integrator And Computer (ENIAC) was one of the first, but not the only, complete computer programmable computers at this time. ENIAC was built at the University of Pennsylvania in 1946, financed by the state, and the main purpose was to calculate projectile tracks. What previously took 20 hours, ENIAC now could do in 30 seconds.
In the 50s and 60s, much was happening in research into optimisation problems. The stocastic gradient descent algorithm was explored deeper, and many important building blocks were published; Robbins and Monroc "A Stochastic Approximation Method" and Kiefer and Wolfowitzd "Stochastic Estimation of the Maximum of a Regression Function", to name a few.
As previously presented, it is possible to see how the theoretical models far preceded the technical abilities with dates go back to the 19th century. For a long time, gradient models were also considered problematic from a theoretical and mathematical point of view because there are no guarantees that the optimal solution can be found.
To describe what machine learning is, we began by presenting an overview. In the area of computer science there is an overlap between software development, mathematics and statistics and domain expertise.
The area of computer science can be categorised as in fig 2. In the area of software development we see the traditional craft of programming, commissioning and maintaining a system. In the overlap between mathematics and statistics, we can see how machine learning takes its place in the ecosystem. What makes machine learning complex is precisely the overlap between practical tasks of software development and the theoretical field of mathematics and statistics. The last bit is domain expertise. In a company that runs an individual product, the domain competence, or industry knowledge, is within the company, ie companies that are experts on the problem their product solves. In other companies, such as a consulting company, the expertise needs to come from the customer.
What distinguishes traditional development from machine learning is how the system is built to comply with established rules. In traditional development, the developer needs to explicitly define each decision the system can take and what the result of the given input is. No matter how many times a given situation happens, the system will always do exactly what it is programmed for. A machine-taught model, which is trained on data from the domain, will instead learn these rules. The advantage of a machine-taught model is that it can learn complex rules and situations without the developer having to explicitly program each rule. A model contains weights that define how much emphasis should be placed on different types of data. When a model sees data with great importance, it will perceive this as more important for the problem to be solved. Training a model involves finding the values of these weights by observing many previous examples and correcting the weights. A model traditionally learns the weight of the weights in three steps.
The model is initiated with random weights and performs a qualified guess or hypothesis.
The hypothesis that the model created is corrected against the correct result.
After the correction, the weight of the model is corrected depending on how correct the hypothesis was. In each iteration one measures the accuracy of the model and stops training when all the data is used or when the model's accuracy begins to deteriorate.
This is, of course, a gross simplification of the process and describes what one usually calls supervised learning. We will delve deeper later how this works in reality. What should be noted is the difference between how rules must be explicitly defined in traditional development and how a machine-taught model can be seen more as a black box that is given data and makes the rules itself.
The main resources today are competence and data. In the normal sense, a grounded team with good project management, space for creativity and initiative and humility is needed for their own competencies. This is in no way unique for just machine learning projects and will therefore not be further discussed.
Finding people who are skilled in software development and mathematics and statistics can be difficult. Often it is even more difficult to find people with competence in both software development and mathematics / statistics. In practice, the competencies needs to be held by the same person as opposed to two people who form the role. Therefore, the first natural step is to find people with competence in machine learning.
When skills are available, it is easy for these key people to become a bottleneck for the organisation. It is not unusual that there could be ten projects waiting for a person who can utilise machine learning. It also does not matter how much expertise exists if time is not set aside to implement the project within a reasonable timetable. Therefore, it may be better to buy in consultants who can carry out these tasks.
To build a trained model of the problem, data is needed. Generally speaking, the more data the better. It is also important that the data available is statistically significant, i.e. contains data that includes the problem to be solved. For example, it is not possible to build a machine-learned rain forecast model if the data model trained on does not include examples of days without rain and rainy days. The imbalance in the data also plays a major role. If there are very few examples with days that are rainy, more data will be needed to train the model.
The last piece of the puzzle is domain expertise. This usually includes the expertise of the customer. The same relationship regarding time also applies here when we try to find people with expertise in the specific domain that has time. Let's think of a scenario where a classification system for cancer is to be built. Then it requires the customer to provide expertise that can set aside time to explain how the domain, in this case the cancer care, works. For example, is it better to say that more people have cancer than they actually have or how should we reason in the border cases where our model is not particularly safe? This domain expertise must be available for a feasible project because some decisions cannot be taken by the person writing the code.
Since machine learning is a broad area, it is important that the right questions are asked. In a scenario where the wrong questions are asked, it doesn't matter how good the models are built because the models will answer a question as irrelevant.
In order for the right questions to be asked, a careful analysis of the problem is required. There is no benefit in performing machine learning unless it is the best tool to solve a problem. In order to create a better problem analysis, we therefore want to present the following picture that illustrates the life cycle of new technology.
Right now, machine learning is on an uphill trajectory where we have not yet reached the "peak of inflated expectations". To get a better problem analysis, this should be taken into consideration so that the right tool is used for the right problem. We will return to this chart later in the article series and see how this relates to the type of activity that involves machine learning and how we need to be vigilant so that the work being carried out is constructive. In the upcoming documents, we will deeper into real user cases, see a more concrete picture of the process of a machine learning project and show where the focus should be to increase the chances of a meaningful project.


text:
Андре́й Никола́евич Василю́к (род. 29 августа 1987, Нежин) — украинский шоссейный велогонщик, выступающий на профессиональном уровне с 2010 года. Трёхкратный чемпион Украины в шоссейных гонках с раздельным стартом, участник европейских и мировых первенств. Известен прежде всего по выступлениям за украинскую континентальную команду Kolss.

Биография
Андрей Василюк родился 29 августа 1987 года в городе Нежине Черниговской области Украинской ССР. Впоследствии переехал на постоянное жительство в Киев, проходил подготовку в киевской Школе высшего спортивного мастерства.

Впервые выступил на крупных международных соревнованиях в 2007 году, проехав многодневную гонку первой категории «Тур Хайнаня».

Начиная с 2010 года представлял украинскую континентальную команду Kolss Cycling Team, уже в дебютном сезоне в её составе принял участие в многодневной гонке высшей категории «Тур озера Цинхай», отметился выступлением в «Туре Румынии», стартовал на нескольких крупных гонках в России: «Пять колец Москвы», «Гран-при Москвы», «Кубок мэра», «Гран-при Адыгеи».

В 2011 и 2012 годах продолжал активно выступать в различных соревнованиях, хотя побед в свой послужной список добавил не много. Наиболее значимые достижения в этот период — девятое место в генеральной классификации «Пяти колец Москвы», попадание в десятку сильнейших однодневных гонок «Мемориал Олега Дьяченко», «Гран-при Донецка», «Гран-при Москвы». В числе прочего Василюк полностью проехал «Тур Хайнаня», расположившись на 12 и 13 позициях в генеральной и очковой классификациях.

В 2013 году впервые одержал победу на чемпионате Украины по шоссейному велоспорту в гонке с раздельным стартом. Помимо этого, выиграл прологи «Пяти колец Москвы» и «Тура Румынии», вновь участвовал в «Туре Хайнаня», где на сей раз стал в генеральной классификации двенадцатым. В составе украинской национальной сборной принял участие в шоссейном чемпионате мира в Тоскане.

В 2014 году защитил титул чемпиона Украины в разделке. Занял шестое место в генеральной классификации «Гран-при Адыгеи», проехал «Тур озера Цинхай», побывал на мировом первенстве в Понферраде.

В 2015 году отметился победой на «Туре Подляшье» в Польше, стал седьмым в «Туре озера Цинхай» и девятым «Туре Мерсина», показал седьмой результат на домашней гонке Race Horizon Park. Принял участие в первых Европейских играх в Баку.

В 2016 году в третий раз одержал победу на чемпионате Украины в гонке с раздельным стартом. Выступал на чемпионате Европы в Плюмелеке и чемпионате мира в Дохе. Соревновался на двух многодневных гонках высшей категории: «Тур Хайнаня» и «Тур озера Цинхай». Стал победителем гонки Тур Рибаса.

На чемпионате Украины 2017 года стал в разделке вторым, уступив только Александру Поливоде. Продолжил активно выступать в крупнейших гонках в Китае: занял седьмое место в генеральной классификации «Тура Фучжоу», 17 место в генеральной классификации «Тура Хайнаня», 5 место в генеральной классификации «Тура озера Тайху», тогда как на «Туре озера Цинхай» сошёл с дистанции во время четвёртого этапа. Занял второе место на Туре Украины.

В 2018 году вместе с соотечественником Виталием Буцем перешёл в польскую континентальную команду Team Hurom.

Окончил Харьковскую государственную академию физической культуры.

Примечания

Ссылки

Велогонщики Украины
Мастера спорта Украины
Выпускники Харьковской государственной академии физической культуры

redpajama_set_name: RedPajamaWikipedia


Want to find out more about why we do what we do? Our Manifesto explains our aims and objectives, and highlights the wide range of projects and programmes that SoCo delivers. Read it here.
In June 2017 we filled a city centre park with music and arts, showcasing talent and highlighting the benefits of creativity on wellbeing. Read the Umbrella Arts Festival report here.
In 2014 SoCo embarked on an 18 project to turn an end of life government courthouse building into a vibrant community arts space. Read the report here.
From 2010 to 2015 SoCo delivered a programme of creative adult learning funded through Southampton City Council and European Social Fund. View the evaluation report here.
An evidence review of music making relevant to SEN/D settings resulted in this Evidence Bank. Download here.
SoCo is one of 10 organisations nationally working with Youth Music on their Exchanging Notes progamme, a 4 year study into informal music making for at-risk young people. Read our year one report here.
Supporting schools in Southampton and Eastleigh, we carried out an audit of music opportunities and facilities in secondary mainstream settings. Read the survey results here.
Supporting SEN/D schools in Hampshire, we carried out an audit of music opportunities and facilities in primary and secondary special school settings. Read the survey results here.
Sonic Explorers was SoCo Music Project's music programme for young people in challenging circumstances. This has seen us deliver weekly music-making sessions at Toynbee School HiVis Club (an after school music club for students with visual impairments), Cedar School (a school for young people with complex physical, health and learning difficulties) and Polygon School (a school for boys with complex emotional and behavioural needs. Download evaluation.
Funded by the Children and Adolescent Mental Health Service (CAMHS) in Southampton, our programme at Springwell and Cedar Schools in Southampton has seen us deliver a series of weekly one-to-one and group music-making sessions during school time, but out of main curriculum delivery. Read the report here.
In 2015/16 SoCo Ran a number of free music clubs at The Courthouse, they were supported by Youth Music and included Afrobeat, music tech and songwriting. Read the report here.
SoCo Music Project was awarded funding through Southampton City Council's Community Chest Grant in 2017 to provide creative opportunities for vulnerable adult groups. This has seen us deliver weekly music-making sessions for adults with physical and/or learning disabilities in partnership with local day service groups. Read the report here.


text:
BBC 'censored' play about honour killings
The BBC has been accused of an "extraordinary" act of censorship after ordering a playwright to axe certain lines from a Radio 4 drama about honour killings.
By Rosa Silverman 30 January 2013 • 8:57am
Gurpreet Kaur Bhatti
In an episode for the broadcaster's DCI Stone series, Gurpreet Kaur Bhatti told the story of an investigation into the killing of a 16-year-old Asian girl.
When it turns out the teenager had been the victim of a so-called honour killing, the fictional detective is advised to handle the case "sensitively" because the family is Muslim.
At the end of the episode, called Heart Of Darkness and due to be broadcast in the Afternoon Drama slot this week, a character says: "There is so much pressure in our community, to look right and to behave right."
Bhatti said: "A week before recording I got an email from the producer saying the BBC compliance department had asked them to take lines out.
"It's an extraordinary and awful situation. They said the lines were offensive but they absolutely were not. We live in a fear-ridden culture."
The BBC's alleged "censorship" of Bhatti's work came after her controversial play Behzti was withdrawn from a Birmingham theatre after protests from Sikhs in 2004.
The play featured scenes of rape, abuse and murder inside a Sikh temple and sparked demonstrations outside the Birmingham Rep.
Speaking about the BBC episode at the Index On Censorship conference on artistic freedom of expression in the UK, held at the South Bank, Bhatti said: "Unbelievably, what the compliance department said was if you can find a factual example of community pressure leading to an honour killing, you can have the line.
"But it's a drama, a story. It's a crucial part of that story.
"I was very disappointed given my previous experience of censorship. If you take out the line, the whole thing changes, it's a betrayal of the character and the truth of the unfolding story."
A Radio 4 spokesman told The Independent: "This is a hard-hitting drama about the realities of honour killing in Britain.
"A single line in the script could be taken to infer that the pressure and motivation to commit such a crime in a family comes from the wider Muslim community, potentially misrepresenting majority British Muslim attitudes to honour killing.
"Gurpreet Kaur Bhatti was asked to amend this line in the normal editorial process of script development."
Live Everton vs Aston Villa, Premier League: live updates and latest score
By Luke Slater 22 Jan 2022, 2:15pm
England's uncapped six: Who are the fresh faces Eddie Jones has picked in his Six Nations squad?
By Ben Coles 22 Jan 2022, 2:11pm
Six Nations 2022 fixtures: match dates, TV channel schedule and latest odds


text:
River View Observer
Tag Archives: junior
Live On Stage, Local Live Theater, Our Community
THE THEATER COMPANY PARTNERS WITH CHARITIES DURING ITS RUN OF "RENT"
Broadway Cares/Equity Fights AIDS and Hudson Pride Connections
The Theater Company (TTC) opens with the Broadway musical RENT on February 3, 2010, but instead of just telling the story of seven friends dealing with love, loss and AIDS, the company is also helping to raise money for Broadway Cares/Equity Fights AIDS and Hudson Pride Connections – two organizations whose mission is to assist in the fights against HIV/AIDS and bridge gaps for gay communities. Continue reading THE THEATER COMPANY PARTNERS WITH CHARITIES DURING ITS RUN OF "RENT" →
Adam PascalAIDSAngelAnthony RappBayonneBisexaulBroadwayBroadway Cares/ Equity Fights AIDSBroadway musicalBroadway showBroadwaycares.orgCaitrincastcharactersChris ColumbusDavid ZimmermanDeBaunDeBaun AuditoriumDeBaun Playersfamous playsgameGay Communitieshead coachHIV/AIDSHobokenHoboken Historical MuseumHoboken New JerseyHudson CountyHudson Pirde ConnectionsIdina MenzelJersey CityJonathan LarsonjuniorMonroe Theatrespace hoboken new jerseyMoviesMusicMusicalNew JerseyNew Jersey Theater AllianceNew YorkNJRENTRosario DawsonSowderstagestage musicalStevensStevens Institute of TechnologyThe Theater CompanyTheaterTheater CompanyTheatreTheatre AllianceTom CollinstransgenderwaterfrontWeehawkenwww.brownpapertickets.comwww.hudosn pride.orgwww.thetheatercompnay.org
Stadium Plaza
321 Route 440 Suite 3
https://www.lsfcu.org/loans/lending/
https://riverviewobserver.net/wp-content/uploads/2021/01/NEW-Annette-10-second-spot-2.mp4
Select Article Category
Hudson Happenings
As seen in Bayonne New Jersey
A lifestyle and entertainment publication serving the Jersey City, Hoboken, Bayonne, Weehawken, West New York, North Bergen, Cliffside Park, Edgewater, Secaucus and Guttenberg Waterfront Communities
Hamilton Park Neighborhood Assoc.
Harsimus Cove
Historic Paulus Hook
Newport Neighborhood Assoc.
PowerHouse Arts District
Van Vorst Park
Colleges In Hudson County
Hudson County Community College
St. Peter's College
Steven Tech Hoboken
Dining in Hudson County
NJ Restaurants/ Hudson County
For New Residents & Visitors
Destination Jersey City -For New Residents and Visitors
Hudson County Profile
NJ TRANIST Bus & Trains
NY Waterway Schedule
YourWhiteGloves.com
zootoo.com
Jersey City UEZ
Aart in America Piano
DUMPSTER MAXX
Power Cleanouts
Bayonne Medical Center
Christ Hospital
Jersey City Medical Center
Hotel in Hoboken
Jersey City Hotels
CandlewoodSuties
Court Yard Hotel, Newport
Westin Hotel
Check the weather
Kannekt
Sporting News – All Professional Sports Coverage
Politics-
Chris Piechocki- Weichert Real Estate Agent
David Bartz- Realtor
Exit on the Hudson Realty
MLS GUIDE- real estate in Hudson County
New Jersey Property Tax Consultants
State Wide New Jersey Real Estate
Just Jersery Real Estate
NY NJ Car Service
New Jersey Transit Alerts
StockConsultant
Jobs in Hudson County, NJ
Careerjet, the search engine for jobs
Archives Select Month February 2023 (1) January 2023 (10) December 2022 (4) November 2022 (8) October 2022 (6) September 2022 (5) August 2022 (6) July 2022 (5) June 2022 (10) May 2022 (14) April 2022 (9) March 2022 (23) February 2022 (13) January 2022 (6) December 2021 (1) November 2021 (1) October 2021 (17) September 2021 (8) August 2021 (5) July 2021 (6) June 2021 (19) May 2021 (18) April 2021 (20) March 2021 (18) February 2021 (14) January 2021 (7) December 2020 (11) November 2020 (17) October 2020 (15) September 2020 (21) August 2020 (21) July 2020 (32) June 2020 (42) May 2020 (50) April 2020 (18) March 2020 (6) February 2020 (3) January 2020 (2) December 2019 (4) November 2019 (6) October 2019 (1) September 2019 (4) August 2019 (3) July 2019 (3) June 2019 (8) May 2019 (15) April 2019 (13) March 2019 (6) February 2019 (8) January 2019 (8) December 2018 (11) November 2018 (16) October 2018 (12) September 2018 (13) August 2018 (13) July 2018 (16) June 2018 (19) May 2018 (17) April 2018 (9) March 2018 (19) February 2018 (19) January 2018 (15) December 2017 (11) November 2017 (21) October 2017 (25) September 2017 (24) August 2017 (7) July 2017 (14) June 2017 (14) May 2017 (24) April 2017 (29) March 2017 (47) February 2017 (56) January 2017 (37) December 2016 (14) November 2016 (7) October 2016 (8) September 2016 (3) August 2016 (5) July 2016 (3) June 2016 (2) May 2016 (12) April 2016 (10) March 2016 (5) February 2016 (17) January 2016 (27) December 2015 (12) November 2015 (8) October 2015 (6) September 2015 (7) August 2015 (7) July 2015 (11) June 2015 (16) May 2015 (13) April 2015 (13) March 2015 (12) February 2015 (12) January 2015 (14) December 2014 (16) November 2014 (30) October 2014 (18) September 2014 (16) August 2014 (11) July 2014 (20) June 2014 (7) May 2014 (11) April 2014 (15) March 2014 (14) February 2014 (14) January 2014 (5) December 2013 (13) November 2013 (21) October 2013 (26) September 2013 (19) August 2013 (15) July 2013 (24) June 2013 (12) May 2013 (25) April 2013 (23) March 2013 (25) February 2013 (35) January 2013 (32) December 2012 (19) November 2012 (41) October 2012 (29) September 2012 (24) August 2012 (40) July 2012 (22) June 2012 (30) May 2012 (33) April 2012 (32) March 2012 (28) February 2012 (24) January 2012 (17) December 2011 (14) November 2011 (30) October 2011 (18) September 2011 (14) August 2011 (7) July 2011 (22) June 2011 (10) May 2011 (7) April 2011 (12) March 2011 (13) February 2011 (9) January 2011 (14) December 2010 (12) November 2010 (12) October 2010 (22) September 2010 (23) August 2010 (18) July 2010 (9) June 2010 (17) May 2010 (17) April 2010 (20) March 2010 (21) February 2010 (16) January 2010 (29) December 2009 (19) November 2009 (21) October 2009 (26) September 2009 (18) August 2009 (19) July 2009 (12) June 2009 (15) May 2009 (18) April 2009 (25) March 2009 (12) February 2009 (10) January 2009 (22) December 2008 (19) November 2008 (23) October 2008 (20) September 2008 (35) August 2008 (23) July 2008 (10) June 2008 (2) March 2008 (3) February 2008 (4) November 2007 (8) October 2007 (3) September 2007 (6) August 2007 (15) June 2007 (5) May 2007 (1) April 2007 (1) March 2007 (1) February 2007 (1) January 2007 (1) November 2006 (1) June 2006 (1) March 2006 (1) February 2006 (1) March 2005 (1)


text:
Working Holiday visas reopen
Reopening of Working Holiday visa categories
As part of the 5-step approach to reopening NZ borders, the Government is reopening uncapped Working Holiday schemes from 14 March 2022. On 14 March 2022, the following working holiday schemes will open to applicants from Belgium, Canada, Denmark, Finland, France, Germany, Ireland, Italy, Netherlands, Norway, Sweden, United Kingdom, USA, Japan. All others will open on a rolling basis with all schemes to be reopened by 13 September 2022.
Immigration New Zealand is also reactivating certain Working Holiday visas granted prior to the COVID-19 pandemic.
INZ website
Previously-granted Working Holiday visas
People granted Working Holiday Visa from offshore have been unable to enter New Zealand due to border restrictions. As part of the staged reopening of New Zealand borders, the Government is granting new Working Holiday Visas to about 19,500 people who:
were granted a Working Holiday Visa on or after 20 March 2019, and
are offshore and have been unable to enter New Zealand, and
have not subsequently been granted a new visa under a different category.
If you hold a valid Working Holiday Visa and are offshore, its dates have been extended to allow you to enter New Zealand.
Those who wish to travel to New Zealand on their newly granted or extended Working Holiday Visas can enter until 13 September 2022. Visas are valid for 12 months from the date of first entry.
Categories COVID UPDATES, Immigration
Register for our immigration Newsletter!
Make sure you add [email protected] to your contacts list
Partners of Critical workers get work rights
2023 New Zealand has no COVID restrictions
Major change in immigration settings add occupations to Green list
Variations of conditions now available for AEWV
CNC Machine operator/setter WANTED in NZ


text:
The Different Types of Roulette Wheels
Roulette wheels are the hottest game in casinos. The American version is similar to the European version but comes with an additional double zero and is found in casinos in the Bahamas, Canada, and the Caribbean Islands. It has 38 numbered ball pockets and something zero. The European version has a single zero on each side and alternates between red and black. Its appearance is more elegant and includes a curved wheel. The European wheel is used in a few Europe, as well as in the U.S.
The ball track is the most delicate component of the roulette wheel and is made of non-magnetic materials. A bent shaft causes the rotor to revolve at an angle and may create a bias. The bowl and apron of the wheel also support the spindle, the ball track, and the ball deflectors. A poorly designed or installed ball track could cause a dominant diamond. To avoid this, manufacturers design roulette wheels which have low profiles and have high frets.
Roulette wheels have different colors and shapes to make it more challenging for players to recognize them. They differ in color, however in both types of wheels, the low and high numbers should alternate. The European version of the wheel has a few low numbers and two adjacent high numbers. In the American version, the high and low numbers are close together, and the colors should be alternating between them. A notable exception to the low-high number alternation rule may be the presence of a dominant diamond. The low-high numbers should not be adjacent, and the opposite is true.
The Cammegh wheel may be the oldest wheel in use at the Venetian and MGM. In land-based casinos, the Cammegh Classic may be the most popular. However, modern tools has allowed manufacturers to make slight variations in the roulette wheel design. While these changes can make the game more difficult to beat, there is still an inherent bias in the outcome of roulette. It really is still possible to defeat a roulette system if the ball lands in the right spot, but if you're using the right strategy, you'll be much more likely to win.
Unlike in traditional games, the Cammegh wheel is manufactured by expert engineers and has been crafted to make it as perfect as possible. The high-end Cammegh is the best roulette wheel, but it has a price tag. Aside from its beauty, it also includes a high price tag. Therefore, it is very important to choose a reliable manufacturer. If you don't desire to waste time, try a several more expensive models before you make a final decision.
The roulette wheel will need to have the same dimensions because the other pockets on the wheel. Deep pockets are more common, while shallow ones are less. The end result is that the roulette wheel must have the same size because the other pockets. If you discover a casino with a biased roulette wheel, don't play there. Until recently, the only method to be sure of your winnings would be to play responsibly and avoid losing money to the incorrect hands.
A biased wheel could cause a game to lose money. Fortunately, there are methods to prevent this issue. Check the wheel's level and make certain it is balanced. Most casino operators can make regular checks on the wheel and ensure that it is level. Ideally, the wheel is level whenever a player places a bet. If the wheel has been tilted, he is able to lose money. In case a player leans contrary to the table, the wheel will never be balanced correctly and can lose.
The look of roulette wheels is extremely important. The European and French wheels feature a black zero, as the American version includes a green zero. The American wheel has a red zero, which is like the European version. It is made to make it clear that the zero will sm 카지노 not win on even-money bets. In addition to the black wheel, the French version features a double zero and 36 numbers. A curved wheel might not be very accurate, but it will avoid the ball from jumping from the pocket.
The rotor of a roulette wheel is the only moving section of a roulette wheel. That is in charge of the bias of the wheel. It could be tilted in one direction or another. If the rotor isn't balanced properly, the wheel can result in predictable spins. If the rotor is not balanced, the wheel will undoubtedly be overweight to spin, and the ball will leave the track earlier than it will.


This 3 bedroom, 2 bathroom south facing detached villa built in a large plot has a large private pool and lots of outdoor space. The property is in a secure gated, quiet residential road. Situated in a great location close to bars, resturants and a new good quality supermarket in Playa Flamenca. Walking distance to one of the many blue flag beaches. The fantastic Commercial Centre of Zenia Boulevard is a short drive away. The front terrace leads to steps to a covered in large porch glassed in area. The front door takes you into the spacious lounge that features an open fireplace and built in shelving. The curved design of the lounge and the windows where the outlook is to the amazing private pool offers fabulous light. There is a fully fitted kitchen with a breakfast bar and there is a built in storeroom. Also on the ground floor there 2 double bedrooms and a famiily bathroom. On the first floor there is as double bedroom that has a walk through covered glassed in terraced area and a good sized bathroom. There is also a large solarium to relax in warm summer eveings. The property comes unfurnished. This propety would be a great purchase for a family wanting to live in Spain or just holiday. Motorway connections to Alicante, Murcia and Cartegena, all great cities are close by.


"If there is passion in heart, nothing is impossible" the same belief is found in Miraj Group. Miraj Group is growing by leap & bounds and now its turnover has reached billions. Day after day it is stretching towards the newer path of success." Starting with a simple beginning in year 1987, today MIRAJ Group has marked its presence in various sectors. Starting with a simple beginning in year 1987, today MIRAJ Group has created its presence in various sectors. As years passed MIRAJ established itself as a big business empire with a consolidation of various sectors.
Content provided by Miraj Group, Info Edge India Limited disclaims all warranties against infringement.


text:
\section{Introduction}

Surface adsorption has been a broadly researched topic over the last decades \cite{Privman1994, Kumacheva2002, Fustin2003, Biancaniello2005, Cadilhe2007, Wang2012, Oliveira2014, Araujo2016}. For practitioners, particle adsorption on substrates enables a wide range of applications ranging from photonic crystals, to quantum dots, sensors, and encapsulation \cite{Boerasu2002, Burda2005, Joshi2016}. Theoretically, understanding the kinetics of adsorption poses fundamental challenges to non-equilibrium statistical physics \cite{Evans1993, Bartelt1991b, Talbot2000}. In the limit of irreversible adsorption, the prototypical model is the Random Sequential Adsorption (RSA) model, where adsorption is considered irreversible and particle-particle interactions are excluded volume. Despite simple, RSA provides valuable information about the adsorption kinetics and morphology of the final structure \cite{Evans1993, Cadilhe2007, Privman2000a}.

Different extensions of RSA were proposed to study the role of the particle size \cite{Bartelt91c, Bonnier2001a}, particle shape \cite{Pomeau1980, Swendsen1981, Dias2012}, and particle-particle correlations \cite{Evans1993}. With experimental techniques reaching smaller and smaller length scales came the possibility of engineering substrates featuring patterns in the length scale of the particle size. This paved the way to new experiments and theoretical studies on how to control the morphology of the final structure, using patterns that interact selectively with the particles \cite{Chen2002, Kumacheva2002, Dziomkina2005, Joo2006, Cadilhe2007, Araujo2008, Kelzenberg2010, Marques2012, Katsman2013a, Katsman2013b, Privman2016, Ciesla2017}. So far, for simplicity, these patterns were considered static.

\begin{figure*}[t!]
	\includegraphics[scale=0.6]{Fig1.pdf}
	\caption{\label{Figura1}Schematic representation of the model. (a) Patches (in blue) occupy one site and diffuse on the lattice when they are free. The patch-patch interaction is excluded volume. Particles (in orange) can only adsorb on free patches (b, c, and d) and cannot overlap any previously adsorbed particle (e). A free patch can diffuse underneath a previously adsorbed particle, binding to it (f).}
\end{figure*}

Recently, an experimental protocol was proposed where colloidal particles adsorb irreversibly on the surface of an oil droplet, using DNA-functionalization. The surface of the oil droplet is covered with patches that diffuse on the surface and act as landing sites for the DNA-functionalized colloidal particles. By contrast to particles at interfaces, when the coverage of the surface is mediated by the patches, the strong capillary forces are suppressed. An extension of RSA was proposed to help explaining the experimental results \cite{Joshi2016}. In the model, particles of a certain size attempt adsorption on a substrate with mobile patches. The particles only adsorb on free patches and adsorption is irreversible. A free patch can find a particle adsorbed previously and bind to it. Here, we discuss the kinetics of adsorption and morphology of the final structure for this model.

The paper is organized as follows. The model is described in Section II. In Section III, we study how the competition between timescales affects the kinetics of adsorption and we develop a mean-field calculation that sheds light on the numerical results. We discuss also the morphology of the jammed state. Some conclusions are drawn in Section IV.

\section{Model}

Figure \ref{Figura1} shows a schematic representation of the model, first proposed in Ref. \cite{Joshi2016}. The substrate is described as a one-dimensional lattice with $L$ sites. A fraction $n_{0}$ of the sites is occupied by patches of size one (blue squares). Free patches diffuse with a diffusion coefficient $D$, defined as the rate at which each patch hops to one of its two first neighbors. We consider a patch-patch excluded volume interaction, i.e., a patch cannot move into an occupied site (Fig. \ref{Figura1}a).

Particles are discrete segments of size $ k $, in units of lattice sites (orange rectangles in Fig. \ref{Figura1}). They arrive sequentially to the substrate at random positions with a flux $ F $, defined as the rate of adsorption attempts per unit time and length. If a particle attempts adsorption on a free patch and does not overlap a previously adsorbed particle, the adsorption is successful, forming a particle-patch complex (Figs. \ref{Figura1}b and c) and adsorption fails otherwise (Figs. \ref{Figura1}d and e). The particle-patch complexes are immobile and the adsorption is irreversible, i.e., an adsorbed particle cannot detach from the patch.

For $ k=1 $, the number of adsorbed particles per lattice site saturates asymptotically at $ n_{0} $. Hereafter, we consider the non-trivial case of $ k>1 $. For $ k>1 $, a free patch can diffuse and go underneath a previously adsorbed particle, provided that it does not overlap any other patch (Fig. \ref{Figura1}f). In this case, the patch binds irreversibly to the adsorbed particle. The standard RSA model is recovered in the limit where all sites are occupied by patches ($n_0=1$).

We performed kinetic Monte Carlo simulations considering two processes: adsorption attempts at a rate $ F $ and free-patch diffusion at a rate $ D $. At each iteration, time is incremented by:

\begin{equation}
\Delta t=-(n_{F}F+n_{D}D)^{-1}\log(r),
\end{equation}

\noindent where r is a random number distributed uniformly in the range $ ]0,1] $, and $ n_{F} $ and $n_D$ are the number of possible adsorption and diffusion events, respectively. We performed simulations on a lattice of length $ L=10^{6} $ and results are averaged over $ 10^{4} $ samples. We considered also other system sizes and concluded that, for the considered value of $L$, finite-size effects are negligible.

\section{Results}

We first study the case of dimers ($ k=2 $) and then proceed analyzing the effect of the particle size, considering $ k $-mers ($ k>2 $). We also discuss the dependence on the initial density of patches.

\subsection{Adsorption of dimers}

\begin{figure}[b!]
	\includegraphics[scale=0.5]{Fig2.pdf}
	\caption{\label{Figura3}Time-dependence of the coverage for $ (F,D)=\{(1,1),(3,3),(10,2),(5,1)\} $ and $ n_{0}=0.1 $. Results are averages over $10^{4}$ samples of a one-dimensional lattice with $L=10^{6}$ sites.}
\end{figure}

\begin{figure}[t!]
	\includegraphics[scale=0.5]{Fig3.pdf}
	\caption{\label{Figura4} Jammed-state coverage as a function of a) $ D $ for $ F=\{2,5,10\} $ and $ n_{0}=0.1 $, represented as circles, triangles, and squares, respectively, b) $ F $ for $ D=\{1,2,3\} $ and $ n_{0}=0.1 $, represented as pentagons, rhombus, and inverted triangles, respectively, and c) $ F/D $ for three values of $ F $ and $ D $, considered in a) and b). Results are averages over $10^{4}$ samples of a one-dimensional lattice with $L=10^{6}$ sites.}
\end{figure}

\begin{figure}[b!]
	\includegraphics[scale=0.5]{Fig4.pdf}
	\caption{\label{Figura9} Jammed-state coverage per patch as a function of $ n_{0} $ for different $ F/D $. As $ n_{0} $ increases, $ \theta_{j}/n_{0} $ converges to the RSA of dimers, $ \theta_{j}(n_{0}=1)=1-e^{-2} $ \cite{Flory1939}. Results are averages over $10^{4}$ samples of a one-dimensional lattice with $L=10^{6}$ sites.}
\end{figure}

The adsorption is irreversible and particles can only adsorb on patches. We define coverage as $ \theta=kN/L $, where $ N  $ is the number of adsorbed particles. The coverage is expected to monotonically increase until it saturates for the jammed state, where no more particles can adsorb. In the jammed state there might be some free patches, but they are trapped inside gaps that are smaller than the particle size and, therefore, no particle can adsorb on them. We define $\theta_j$ as the jammed-state coverage.

For very low density of patches ($ n_{0} $), the average distance between patches is such that the adsorption on different patches can be decoupled. In such limit, there will be only one particle per patch in the jammed state and, thus, $\theta_{j}=kn_{0}$. This value sets also an upper bound for the coverage, as it is not possible to have more particles adsorbed than patches.

Figure \ref{Figura3} shows the time evolution for the coverage, for different values of the flux $F$ and diffusion coefficient $D$. The coverage initially increases and saturates asymptotically at $\theta=\theta_{j}$. The kinetics evolves as a competition between two mechanisms: adsorption on and diffusion of free patches. The former occurs with an inter-arrival time $\tau_{F}\propto 1/F$ and the latter occurs in a timescale $\tau_{D}\propto 1/D$. If $\tau_{D}\ll\tau_{F}$, diffusion is much faster than adsorption and thus, in between adsorption events, patches typically have enough time to diffuse and go underneath particles that adsorbed previously (Fig. \ref{Figura1}f). When $\tau_D\gg\tau_F$, diffusion can be neglected and the coverage is maximized. Thus, for constant $F$, the jammed-state coverage $\theta_{j}$ decays with $D$, as shown in Fig. \ref{Figura4}a. In the same way, $\theta_{j}$ increases with $F$ for constant $D$ (see Fig. \ref{Figura4}b). Numerically, a data collapse is obtained when the jammed-state coverage is plotted as a function of $F/D$, as shown in Fig. \ref{Figura4}c. Note that, while the jammed-state coverage solely depends on $F/D$, the kinetics towards the jammed state depends on $F$ and $D$ independently (see Fig. \ref{Figura3}).

The kinetics also depends on the concentration of patches $n_{0}$. To go underneath a previously adsorbed particle (Fig. \ref{Figura1}f), a free patch needs to diffuse over a distance that corresponds to the average separation between particles. The lower the value of $n_{0}$ the larger is that distance. Thus, the number of particles per patch in the jammed state, given by $\theta_{j}/n_{0}$, decays monotonically with $n_{0}$, as shown in Fig. \ref{Figura9} for different ratios of $F/D$. For $n_{0}=1$, every site is occupied by a patch and the results for standard RSA are recovered, independently of $F/D$.

To characterize the morphology of the jammed state, we measured the gap-size distribution function ($ V_{m} $), defined as the probability of finding a sequence of $m$ sites not occupied by particles (gap) in between two particles. Figure \ref{Figura10} shows $ V_{m} $ for different $ n_{0} $. For RSA ($ n_{0}=1 $), all gaps are smaller than the particle size. However, this is not the case for $ n_{0}<1 $. In this case, gaps of size $m>k$ are possible, provided that there is no free patch inside the gap.

\begin{figure}[t!]
	\includegraphics[scale=0.5]{Fig5.pdf}
	\caption{\label{Figura10} Gap-size distribution function at the jammed state for $ n_{0}=\{0.1, 0.5, 0.7, 1.0\} $ (semi-log plot in the inset). In the inset, the three curves are given by $ V_{m}=n_{0}(1-n_{0})^{m} $, with $ n_{0}=\{0.1, 0.5, 0.7\} $. Results are averages over $10^{4}$ samples of a one-dimensional lattice with $L=10^{6}$ sites.}
\end{figure}

The probability of finding a gap $m>k$ decays exponentially with $m$ (Fig. \ref{Figura10}). This can be explained as follows. For simplicity, let us consider the adsorption of monomers. There will be one adsorption per patch and no particle-particle correlations. Thus, the jammed state consists of a lattice with a fraction $n_{0}$ of sites occupied at random. The gap-size distribution function is then $ V_m=n_{0}^{2}(1-n_{0})^{m} $.
Since $ (1-n_{0})<1 $, $ V_{m} $ decays exponentially with $m$. By fitting the data in the inset of Fig. \ref{Figura10}, for $m>k$, with a function $f(m)=a.b^m$, we obtain $b\approx1-n_0$, in line with the predicted $V_m$.

\subsection{Mean-field approach}

Let us now consider a mean-field approach, based on rate equations. We consider a uniform distribution of patches and neglect particle-particle correlations. We define $\rho_{r}$ and $\rho_{p}$ as the density of free patches and adsorbed particles, respectively. Initially, $\rho_{r}(0)=n_{0}$ and $\rho_{p}(0)=0$. The coverage at every time is given by $\theta(t)=k\rho_{p}(t)$, where $k$ is the particle size.

The kinetics can be described by the following rate equations,

\begin{equation}
\label{initial}
\begin{cases}
\dot{\rho_{r}}(t)=-\overline{F}\rho_{r}-\overline{D}\rho_{p}\rho_{r} \  \\
\hspace{5cm} , \\
\dot{\rho_{p}}(t)=\overline{F}\rho_{r} \
\end{cases}
\end{equation}

\noindent where $ \overline{F} $ and $ \overline{D} $ are monotonic increasing functions of the flux $ F $ and the diffusion coefficient $ D $, respectively. In the first equation, the first term on the right-hand side corresponds to the adsorption of particles on free patches (Figs. \ref{Figura1}b and c). The second term is related to free patches going underneath previously adsorbed particles (Fig. \ref{Figura1}f).  In the second equation, the density of particles is only affected by adsorption events (gain term).

This system of equations can be solved exactly for the considered boundary conditions,

\begin{widetext}
\begin{equation}
\label{finalrohr}
\rho_{r}(t)=\frac{\overline{F}+2\overline{D}n_{0}}{\overline{D}+\overline{D}\cosh\bigg[\sqrt{\overline{F}(\overline{F}+2\overline{D}n_{0})} t+2\arctanh\bigg(\sqrt{\frac{\overline{F}}{\overline{F}+2\overline{D}n_{0}}}\bigg)\bigg]} \ ,
\end{equation}

\begin{equation}
\label{finalrohp}
\rho_{p}(t)=\frac{\sqrt{2\overline{F}\overline{D}n_{0}+\overline{F}^{2}}\tanh\bigg\{\frac{1}{2}\bigg[2\arctanh\bigg(\frac{\sqrt{\overline{F}}}{\sqrt{\overline{F}+2\overline{D}n_{0}}}\bigg)+\sqrt{\overline{F}}\sqrt{2\overline{D}n_{0}+\overline{F}}t\bigg]\bigg\}-\overline{F}}{\overline{D}} \ .
\end{equation}
\end{widetext}

The jammed state can be obtained taking the asymptotic limit of Eqs. (\ref{finalrohr}) and (\ref{finalrohp}),

\begin{equation}
\label{assrohr}
\rho_{r}(\infty)=0 \ ,
\end{equation}

\noindent and,

\begin{equation}
\label{assrohp}
\rho_{p}(\infty)=\sqrt{\overline{F}/\overline{D}}\sqrt{2n_{0}+\overline{F}/\overline{D}}-\overline{F}/\overline{D} \ .
\end{equation}

\noindent Equation (\ref{assrohp}) predicts that the jammed-state coverage depends only on $ \overline{F}/\overline{D} $, although for the time evolution, given by Eq. (\ref{finalrohp}), this rescaling is not possible. This is consistent with what was observed numerically (see Figs. \ref{Figura3} and \ref{Figura4}).

\subsection{Adsorption of $ k $-mers}

\begin{figure}[b!]
	\includegraphics[scale=0.5]{Fig6.pdf}
	\caption{\label{Figura12} Jammed-state coverage as a function of the particle size for different initial density of patches, $n_{0}=\{0.1,0.3,0.7,1.0\}$ (symbols as in Fig. \ref{Figura10}) and $ F=D=1 $. The inset shows the probability of finding gaps larger than the particle size, $ V_{m>k} $, for different $ k $. For high values of $ k $, the system converges to the continuum limit of RSA (dashed line) \cite{Renyi1958}. Results are averages over $10^{4}$ samples of a one-dimensional lattice with $L=10^{6}$ sites.}
\end{figure}

We now consider the effect of the particle size. Figure \ref{Figura12} shows the jammed-state coverage as a function of the particle size ($ k $) for different $ n_{0} $. For RSA, the coverage monotonically decreases with the particle size. For larger particles, the gaps where no more particles can adsorb are also large. Consequently, the average gap size will always increase with the particle size. By contrast, for the model considered here, we find a range of parameters where the coverage increases with $ k $.

To shed light on the increase of the coverage with $k$, observed for low values of $n_{0}$, we consider the dependence on $k$ of the average gap size, defined as $ \overline{V}=\sum_{m=0}^{\infty}mV_{m} $ (Fig. \ref{Figura14}). For large values of $k$ all curves converge to the one expected for RSA ($n_{0}=1$). While, for large values of $n_{0}$ the average gap size increases with $k$, for  $n_{0}= 0.1$ and $0.3$, we find an optimal value of $k=k^{*}$ at which the average gap size is minimized. For $ k\ll l $, where $l=1/n_{0}$ is the average distance between free patches, adsorption on different patches can be decoupled and the average number of adsorbed particles converges to the number of patches. In this regime, the distance between adsorbed particles is expected to decrease with $k$. Thus, $k^{*}$ sets the size above which the particle-particle correlations developed during the adsorption process become relevant. Accordingly, $k^{*}$ scales linearly with $1/n_{0}$, as shown in the inset of Fig. \ref{Figura14}. The inset in Fig. \ref{Figura12} shows that the probability of finding gaps larger than the particle size decreases with $ k $. As a consequence, when $k$ increases, patches are more likely to be trapped in a gap smaller than $ k $ and patches also need to diffuse over a smaller distance to bind to a particle adsorbed previously. Thus, as $ V_{m>k} $ goes to zero, the kinetics converges to RSA.

\begin{figure}[t!]
	\includegraphics[scale=0.5]{Fig7.pdf}
	\caption{\label{Figura14} Average gap size as a function of the particle size. Symbols correspond to $n_{0}=\{0.1,0.3,0.7,1.0\}$ (symbols as in Fig. \ref{Figura10}). In the inset is the value of $k$ corresponding to the minimum as a function of $ 1/n_{0} $. Results are averages over $10^{4}$ samples of a one-dimensional lattice with $L=10^{6}$ sites.}
\end{figure}

To measure the crossover between our model and RSA as a function of $ F/D $, we introduce a new parameter $ n_{0}^{*} $. $ n_{0}^{*} $ is defined as the minimum value of $n_{0}$ for which the jammed-state coverage decreases with $k$. As shown in Fig. \ref{Figura13}, $ n_{0}^{*} $ decays with $ F/D $.

As $n_{0}$ increases, $ V_{m>k} $ converges to zero. For small values of $ F/D $, patches are more likely to find particles adsorbed previously before the next adsorption attempt. This favors the formation of gaps larger than $k$, as shown in the inset of Fig. 8. As $F/D$ increases, more adsorption events occur and the typical distance between particles is decreased. Thus $ n_{0}^{*} $ decreases.

\begin{figure}[b!]
	\includegraphics[scale=0.5]{Fig8.pdf}
	\caption{\label{Figura13} Plot of $ n_{0}^{*} $ as a function of $ F/D $. In the inset we have $ V_{m>k} $ as a function of $ F/D $, for $ n_{0}=\{0.1,0.3,0.7\} $ and $ k=2 $. In the inset the symbols and colors represent the same $ n_{0} $ as in Fig. \ref{Figura10}. Results are averages over $10^{4}$ samples of a one-dimensional lattice with $L=10^{6}$ sites.}
\end{figure}

\section{Conclusions}

We studied an extension of the Random Sequential Adsorption model (RSA), where particles can only adsorb on mobile patches. We found that, while the dynamics depends on the flux of particles $F$ and diffusion coefficient of the patches $D$, the jammed-state coverage solely depends on the ratio between the two. Supported by a mean-field calculation, we proposed that this feature results from the competition between two time scales: one related to adsorption and the other to diffusion. We revealed also a change in the functional dependence of the jammed-state coverage as a function of the particle size, depending on the density of patches.

Future studies might consider the effect of particle size dispersion or dimensionality of the substrate. For simplicity, we described patches as monomers. For larger patch sizes, more than one particle can adsorb on the same patch forming an aggregate. How does the size of the aggregates depend on the size of the particles and of the patches are questions of practical interest.

\section{Acknowledgements}

We acknowledge financial support from the Portuguese Foundation for Science and Technology (FCT) under Contracts nos. UID/FIS/00618/2013 and SFRH/BD/131158/2017.

redpajama_set_name: RedPajamaArXiv


text:
Is Mayor Pete Running for Mike Bloomberg's Cabinet?
By Matt McDonald | February 18, 2020, 20:29 EST
Printed from: https://newbostonpost.com/2020/02/18/is-mayor-pete-running-for-mike-bloombergs-cabinet/
Pete Buttagieg (photo by Gage Skidmore, courtesy of Wikipedia) and Michael Bloomberg
A long, damning news story about Michael Bloomberg in The Washington Post this past weekend ends with an odd vignette designed to make the reader think the reporter isn't entirely out to get his subject.
Bloomberg, according to a former colleague, "changed a lot through the '90s" and eventually was "as fair to women as he was to men."
That's after yards of material suggesting Bloomberg often made vulgar and demeaning comments to female employees and criticized them for marrying or getting pregnant.
The headline is that Bloomberg, according to allegations in a 1997 lawsuit, once asked a female employee who had just announced that she was pregnant if she intended to "kill it."
"Plaintiff understood the statements of Bloomberg to mean that she should have an abortion in order to keep her job," the woman's lawyer wrote in an amended complaint (dated February 24, 1998) in a subsequent sex discrimination lawsuit filed in the Southern District of New York of U.S. District Court.
Bloomberg denied the claim during the lawsuit, which he settled in 2000.
The story has been public (though not front-and-center) since Bloomberg first ran for mayor of New York City in 2001.
But The Washington Post added over the weekend comments from a man who worked for Bloomberg's company at the time who says he remembers the incident.
David Zielenziger told the newspaper he had gone to the company's "rather elaborate coffee bar" on the 15th floor of its Manhattan office one afternoon around the same time as a female sales employee, Sekiko Sarrai Garrison, a Japanese citizen who handled lucrative accounts in Japan for the company.
"She had mentioned to some of her girlfriends and others that she was pregnant, and Mike had just gone there, too, to get some coffee. And kind of when she mentioned that, the girlfriends were kind of congratulating her, and Mike said, 'Are you going to kill it?' And that kind of shut everybody up," Zielenziger said, according to an audio recording of his comments posted on the Washington Post web site with the story.
There's a lot more in the lawsuit – claims of vulgar and racially charged comments and financial repercussions for women who got married or had babies.
The Washington Post story (published Saturday, February 15) also has a lot more than just the one lawsuit – references to multiple lawsuits, including claims from former employees that they got squeezed out of their job at Bloomberg's company when they got older or got sick.
But the "kill it" comment jumps off the page.
"Who would say such a thing?" Zielenziger said.
Yes – and what would you say about it, if you were, hypothetically, running as a so-called "moderate" in the Democratic presidential primary? Let's say that the subject of this story were another so-called "moderate" running against you? Let's say this other so-called "moderate" had billions of dollars and had joined the race partly because he thought you and your fellow "moderates" can't win?
And let's say this "moderate" challenger is leading you in the polls in two crucial upcoming states? (Let's call them "Nevada" and "South Carolina.")
Chris Wallace of Fox News this past weekend asked Buttagieg if he were "troubled" by allegations of sexism and racism against Bloomberg, his apparent opponent.
Here's what the other former mayor in the race did with that softball:
"Well, I think he's going to have to answer for that and speak to it," Buttagieg said.
Really? You don't say.
But Pete wasn't done.
"Look, this is a time when voters are looking for a president who can lead us out of the days when it was just commonplace or accepted to have these kinds of sexist and discriminatory attitudes. Right now, this is our chance to do something different," he said.
If you look closely, there's no criticism of Bloomberg in that statement. It's almost as if Pete has hit the fast forward button, and sees a future where he doesn't want to have to walk back any negative comments against the fellow who just nominated him to something.
Instead, Buttagieg quickly shifted to Donald Trump.
"Obviously, there is no comparison to this president and the way that he has treated and talked about women and people of color, and continues to do so to this day," Buttagieg said.
He's right – there is no comparison. There's no evidence Trump ever suggested that any woman who worked for him abort her own baby. This allegation has a unique ugliness.
"But we in our party hold ourselves to the highest standard," Buttagieg continued.
Would that be the standard of Bill Clinton, Ted Kennedy, John Edwards … ?
But here's the money quote:
"And it is going to be critical for us to have a nominee who can authentically lead, and who can show growth on these challenges."
Assuming this means anything – and that's not always a given with Buttagieg – it suggests that the eventual Democratic nominee needn't have clean hands when it comes to sexual harassment and worse, but rather must show he "can authentically lead" and "can show growth."
Could that – theoretically, now – include someone who "changed a lot through the '90s" and eventually was "as fair to women as he was to men"?
First question for Mayor Pete during the Democratic debate on Wednesday night:
"Mr. Buttagieg, are you running against Mike Bloomberg?"


Philippa York would have traded her success as champion professional cyclist Robert Millar to have lived as a woman from a young age.
Glaswegian York, 59, went public in the summer about completing her gender change more than a decade ago.
"I would have transitioned in my teenage years," she told BBC Scotland on her first visit to her home city in 20 years.
Millar won the King of the Mountains jersey in the 1984 Tour de France, finishing fourth overall, and was twice runner-up in the Tour of Spain.
But York admits she would have preferred to have lived a different life, having learned in her 20s that she could transition.
She said: "If I had the information that is available now to me back then, when I was on the cusp of trying to make a decision, I would have chosen to transition and not become a cyclist or whatever I became.
"But I realised it wasn't a practical thing, so I decided to wait until my career was over and, if I still felt the same, I'd do something about it.
York recalls suppressing the urge to change gender even at the height of her fame in the 1980s as Millar.
"There would be days during those years when I would be struggling with it," she said.
"You could be up there representing this powerful image and all the good things about sport but inside I'm a mess. The outside didn't really match the inside.
"I would compartmentalise it. When I did cycling I would do it 100% and that would cover the mental anguish I would have in my personal life.
"In professional sport there is no real place for emotions. That whole emotional system, I just turned it off and I operated like a robot.
"I would turn off my personal life while I did races and when I stopped the races I would have a couple of hours where I could turn back into what I call my normal person.
"I deal with my transition in two parts: Robert was the cyclist and Philippa isn't the athlete – she doesn't do any competitions.
BBC Scotland journalist Rhona McLeod reveals what it took to persuade Philippa York to do her first TV interview.
Robert Millar, quite simply, was a sporting hero of my youth.
I was brought up in a home where cycling was practised and revered.
My parents instilled a respect and admiration for cyclists. In fact, as a baby, I was taught to say "allez allez, Gino Bartali" in support of one of the Italian greats of the '30s and the '40s.
But in the '80s, among the glamour of the Italians, French and Dutch riders, there was a Scot – Robert Millar.
I remember his shyness in interviews and his bobbing style as he dominated the mountain stages of the Tour de France.
Millar was the next stage in my cycling education as my dad explained the phenomenal achievement of winning the polka-dot jersey and being crowned King of the Mountains.
However, despite his success, Millar always had an uneasy air about him.
Some said it was arrogance and a permanent dislike for journalists.
Certainly the on-screen interviews could be painful and there were stories of him swearing at reporters if their questions or manner did not please the reluctant media star.
Then Millar seemed to disappear from public view. His career was over and he become reclusive, with only occasional sightings.
The rumours started about Millar wearing pigtails and having breasts; tabloids attempted to doorstep him at his home in the south of England where he was living with his partner and young daughter.
A book was written, In Search of Robert Millar, but still the mystery was never solved.
That changed this summer when the Scot released a statement revealing his new identity, as a woman – Philippa York.
My interest was aroused once again and I decided to pursue the first television interview with York.
I managed to obtain an email address and we began our little dance.
I approached York, asking for an interview, and she asked for time to consider. I backed off and then, after a couple of weeks, returned to the task.
In the meantime, I believe York was checking me out with Scottish Cycling officials who know me and my work from various sporting events and Commonwealth Games.
The response must have been fair, as York agreed to proceed.
We spoke many times to set up the filming. We spoke of cycling, families, food and also of York's motivation to be interviewed in Glasgow, her home city.
It would be an incredibly emotional homecoming for her as she met one of the key figures from her past in his bike shop.
Billy Bilsland was the coach, mentor and father figure who spotted the talents of teenage Robert and then provided the sage advice to send him on his way to the life of a pro rider in France. Millar gifted his 1984 King of the Mountains jersey to Bilsland and it hangs proudly in his shop.
Bilsland had not met Philippa and for the 70-year-old it was also a tearful reunion.
We later visited the Sir Chris Hoy Velodrome, where Sir Chris himself provided a tour to remember.
Both riders confessed to hero worship of the other – a humbling and emotional experience for both.
From a personal point of view, I greatly enjoyed Philippa's company and found her to be gentle, funny, giving and at all times interesting.
Most surprising to me were the tears and emotion – she seemed genuinely touched and bewildered by the plethora of good wishes and handshakes as we toured the velodrome.
York explained that the transition process was a painful one emotionally and that she felt our society in the 90s and start of the millennium was less prepared for, or tolerant of, people in her situation.
She last visited Scotland 20 years ago and I believe her homecoming was a positive experience for her.


text:
The Hashtag Generation
Tracking world affairs, pop culture, fashion, and financial issues through the eyes of a millennial
The Best of T#G
Jobs & Finance
Who Would Win in a Political Fight: Frank Underwood or Olivia Pope?
Posted in Culture, Politics	by The Hashtag Generation
Now that we've all had a chance to watch the second season of House of Cards (if you haven't, what in the world have you been doing the past two weeks?) and that Scandal has returned, I thought it would be fun to throw Frank Underwood and Olivia Pope into the political ring. Two fictional political heavyweights enter. ONLY ONE LEAVES. Spoilers abound. Don't say I didn't warn you.
Now then, if this was a fight between President Fitz Grant and Frank Underwood (I refuse to refer to that maniacal miscreant as "President"), Frank would win, hands down. Fitz is an idiot. He's reckless, he's irrational, he's got no control over his administration, and he always manages to pick the wrong time to be easily swayed by the circus around him. Frank would play him the same way he played President Walker (Walker is also an idiot, but for different reasons). There wouldn't even be a chance for B613 to eliminate Frank, because Frank would use B613 to his advantage before Fitz ever even found out that B613 existed.
But before we start, there's a question of which "Washington, D.C." each character is in. Are we in the House of Cards version of D.C. (where somehow things are incredibly efficient, political alliances are more about personal gain and seeking revenge than solving problems, and where everyone except Frank and Claire is incredibly naïve and stupid)? Or are we in the Scandal version of D.C. (where Congress basically doesn't exist, everyone is sly as a fox, guns run rampant, and alliances are created to solve crises – not to take down opponents)? In the end, it doesn't really matter because Olivia is 100 times more astute than any of the characters on House of Cards. Even if Frank stepped into the political world that exists in Scandal, he wouldn't be able to survive. Olivia would outsmart him (or Jake – against Olivia's wishes – would send someone in B613 after him).
Reasons Frank could win
Frank knows how to play mind games. Olivia may put on a tough demeanor, but she's got some deep-seeded psychological issues.
Frank has the ability to make certain people disappear mysteriously. Or should I say he had the ability. Now that Doug is dead, who's going to do Frank's dirty work? Maybe he'll hire Pope and Associates. He might blackmail Olivia into helping him by threatening her prison time for her and her entire crew of misfits for aiding and abetting a terrorist or hiding the rigging of an election.
Frank's world apparently lacks security cameras or voice recorders or anyone with a conscience. This would make it easy for Frank to completely destroy Olivia (politically or even physically) without leaving behind any solid evidence.
Frank is extremely persuasive, and he holds a lot of power in Washington. He could cut Olivia off from key players in government. He could convince everyone to refuse to speak to her. He could destroy her entire reputation.
Reasons Olivia could win
She is much more trustworthy than Frank. Although, pretty much anyone in the entire world is more trustworthy than Frank. His lone henchman is long gone, and Olivia still has her team of Gladiators (and sometimes Cyrus).
Olivia isn't stupid like everyone else in the House of Cards world. She wouldn't be easily fooled, and she would probably question everything Frank does and says. She would never trust him.
Olivia isn't afraid of powerful people – even powerful people who could kill her.
She knows how to spin things to the public and the media. She's used to crises (assassination attempts, helping her mother escape the country, dismissing rumors about her relationship with the President, hiding election rigging, etc.).
She's got some insanely impressive investigative skills. Unlike Lucas, a.k.a. the worst-investigative-journalist-in-the-world (Zoe Barnes comes in a close second in that category), Olivia would be smart enough to look at all the security footage of the night Zoe died. She would look at who went into the station, what time they went in, where they walked, blah blah blah. She would easily see Frank conspicuously "hiding" in the construction area (that was the worst/cheesiest incognito outfit I have ever seen. REALLY, BEAU WILLIMON? REALLY?). She would get her team to question the Secret Service agents, she would find medical files on Claire, and the list goes on and on. Frank doesn't know how to do any of that. Nor is he smart enough to cover his tracks in the times when he needs to the most.
And lastly, Olivia could always just hit Frank upside the head with her giant Prada handbag.
But in the end, I suppose it doesn't matter who wins this political battle, because they've both lost the war. By the time it's all said and done, they will have aired so much of each other's dirty laundry that they will both be in prison for a very very long time.
Entertainment, Fashion, Frank Underwood, Gladiators, Government, House of Cards, Netflix, Olivia Pope, Politics, Scandal, Television, Washington	Leave a comment
« Mapping Out the Most-Streamed Musicians Across America
The Best Dressed on the Most Famous Red Carpet of the Year »
My Feelings Toward House of Cards
The Most Annoying Songs of 2014
Out-of-Character Stephen Colbert Explains Where the Other Stephen Colbert Came From
Monday Motivation: Musical Edition
As Clueless As I Ever Was
Monday Motivation: Mind Over Matter
Monday Motivation: Mockingjay
Monday Motivation: When You Try Your Best, But You Don't Succeed
Monday Motivation: Patience, Grasshopper
Follow The Hashtag Generation on WordPress.com
Not a Wordpress blogger? No worries!
Monday Motivation: Perfectionism is Overrated
I'm a Walking Stereotype
Writing Process Blog Tour


Swimming Lessons the Olympic Way!
WEEKEND LESSONS – back by popular demand! In addition to our popular weekday swimming lessons, ECC is offering weekend lessons for those working families and for whom getting to lessons during the week is difficult. ECC's weekend lessons will be 30 minutes in length and take place on Sunday mornings from June 30 to August 18 (8 weeks). All swim lessons are included in the pool membership.
At ECC we follow the Olympic Way form of swimming lessons. The Olympic Way is a dynamic, progressive program that teaches strokes through a logical progression of skills. Its goal is to develop strokes at a competitive level, focusing on front crawl, breaststroke, back crawl and butterfly, while still offering swimmers a fun and educational experience. There are eight performance levels associated with Olympic Way program: White, Yellow, Green, Red, Blue, Bronze, Silver & Gold. For more information on the performance criteria associated with each level, please click HERE.
White, yellow, Green, Red & Blue courses will consist of 4, 30-minute lessons each week (ie., Monday thru Thursday).
Bronze, Silver & Gold courses will consist of 2, 45-minute lessons each week (ie., either Monday & Wednesday or Tuesday & Thursday of each week).
New program returns for 2013: Gold Plus We know that many of our swimmers pass Gold well before they are ready to move into Bronze Star*, the level before Bronze Medallion. Since many of these children end up repeating Gold for lack of any other option, and because of the success we had last year, we've decided to keep the "Gold Plus" level. This will be offered Tuesdays and Thursdays or Mondays and Wednesdays, and is only open to children who have already passed Gold. This will enable the instructor to focus on more advanced technique, and, depending on the age and maturity level of the group, introduce some basic lifesaving concepts. *Although there is no age minimum for Bronze Star, this is a lifesaving course that introduces swimmers to concepts in first aid, recovery and rescue, and CPR techniques.
The summer is divided into two (2), four week sessions. Report cards will be handed out during the last class of each session.
For the second session of the summer, lesson times will be similar to those provided during the first session unless otherwise requested.
As it is difficult to determine from summer to summer how many children will be registering in each level, this year we have decided to build the lessons schedule based on the demand, not on pre-set lessons and time.
The Bronze Star award is the pre-Bronze Medallion training standard and it provides excellent preparation for success in obtaining the Bronze Medallion award. In Bronze Star, participants develop problem-solving and decision-making skills as individuals and as partners. They learn cardiopulmonary resuscitation (CPR), and they develop Water Smart® confidence and the lifesaving skills needed to be their own personal lifeguard. Read details about this program.
The Bronze Medallion award teaches an understanding of the lifesaving principles embodied in the four components of water rescue education: judgment, knowledge, skill, and fitness. Rescuers learn tows and carries, and defence and release methods in preparation for challenging rescues of increased risk, involving conscious and unconscious victims of various types. Participants also develop stroke efficiency and endurance in timed swims. Read details about this program.
The Bronze Cross award is designed for lifesavers who want the challenge of more advanced training, including an introduction to safe supervision in aquatic facilities. Bronze Cross is a prerequisite for all advanced training programs, including National Lifeguard Service® (NLS) and Instructor certification. Read details about this program.
This course will consist of one 30-minute lesson each week. This lesson is for children 12 and under at a minimum level of Blue in their swimming lessons. The purpose of this course is to introduce the child to the game of waterpolo with the intention of recruiting to waterpolo teams.
This course will consist of one 30-minute lesson each week. This lesson is for children 12 and under at a minimum level of Blue in their swimming lessons. The purpose of this course is to introduce the child to the wonders of synchronized swimming with the intention of recruiting to synchro teams.
This course will consist of one 30-minute lesson each week. These courses are open to all children at a minimum level of Green in their swimming lessons.
The lessons schedule for session 1 is not yet ready.
Please discuss with the lifeguards for scheduling requests and updates.


Fully Loaded...the trailer too — Inuktun Services Ltd.
Because who doesn't appreciate a good before and after?
Last week we gave readers a sneak peek of Inuktun's Versatrax 300™ cargo trailer, and now we reveal the fully loaded version. The trailer has been outfitted with an office workstation pre-loaded with ICON (Inuktun Controller Software) and InPRO (Inuktun Playback and Report Generation Software) on dual monitors, a powered winch with over 2,000 metres of tether, and of course the Versatrax 300™ pipe inspection vehicle itself.
Did you notice the pontoons on the Versatrax 300™ crawler? The long ranger was recently hired by Pipe Eye Video Inspection & Services to perform a local pipe inspection in Departure Bay at Nanaimo. The significant flow in the pipe required them to float the vehicle for an assessment running approximately 24 hours. The client came back reporting no problems or issues.
Pipe Eye Video has been using Inuktun's Multi-Mission Modular (IM3) technology since it first started inspecting sewer and water pipes in 1995 with the Versatrax 150™. Owner and operator, Ken Peligren, says it would have been impossible to complete a number of complicated jobs without this equipment. Read more here.
Interested in renting the Versatrax 300™ for your own remote inspection operations? Get in touch with our team to learn how IM3 technology can get the job done on time and budget now!


Stop Your Cravings from Controlling You! Take Action Now!
You're sitting and watching TV after a very long and stressful day, how likely is it that you are thinking of food? According to research, your mind holds lots of stimulus that trigger a response of craving for something.
Food really does affect us in ways we have never understood. It can bring feelings of comfort, sadness, guilt, or even remind us of someone or something in our past. The food you hate will trigger bad memories of why you hate it in the first place, the food you love will bring back memories of how you loved it.
Research has also dug deeper into the origins of cravings when it comes to food and how that might lead you to over indulging. A new Danish Study showed that three main food groups are the most triggering of cravings.
Craved usually when you're stressed or tired, sugar is a comfort food that keeps you happy and gives you a good boost in energy. Usually your body would burn this and digest it quickly. However, consuming too much can disrupt the hormones responsible for keeping you full. Added sugars can also be causing iron deficiency, diabetes, and perhaps even cancer. According to the study, sugar is the most common craving, where men reach 68%, and 97% of women have sugar cravings.
Craved usually when you're stressed too, high-fat foods are considered the reward you provide yourself when you seek comfort. They cause the release of dopamine according to the study. High fat foods are usually helpful to fuel you when you are unable to find carbs and sugar. Fat food helps absorb nutrients in the blood stream. However, too much of one thing can never be too good.
The amino acids in proteins stimulate your taste buds so you tend to crave this food essentially when you smell it. The idea of a sizzling steak or a juicy cheeseburger will start watering your mouth instantly. Protein helps your body in more ways than one and helps keep you full in good calories.
Ask your doctor about eating too much of these foods and how you can restrict your indulgence.
Make sure you consult your doctor before making any dietary changes. Book now!
Daily life activities for the good health & good oral cavity health.
2. Add Indian Gooseberry ( aamla ) in your diet.


text:
package main

import (
	"github.com/enaml-ops/omg-cli/plugins/cloudconfigs/aws/plugin"
	v1 "github.com/enaml-ops/pluginlib/cloudconfigv1"
)

var Version string = "v0.0.0"

func main() {
	v1.Run(&plugin.Plugin{
		PluginVersion: Version,
	})
}

redpajama_set_name: RedPajamaGithub