text
stringlengths 8
5.74M
| label
stringclasses 3
values | educational_prob
listlengths 3
3
|
|---|---|---|
[ { "clientId": "_clientId_0", "name": "core/gallery", "isValid": true, "attributes": { "images": [ { "url": "data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAAEAAAABCAYAAAAfFcSJAAAACklEQVR4nGMAAQAABQABDQottAAAAABJRU5ErkJggg==", "alt": "title" }, { "url": "data:image/jpeg;base64,/9j/2wBDAAMCAgICAgMCAgIDAwMDBAYEBAQEBAgGBgUGCQgKCgkICQkKDA8MCgsOCwkJDRENDg8QEBEQCgwSExIQEw8QEBD/yQALCAABAAEBAREA/8wABgAQEAX/2gAIAQEAAD8A0s8g/9k=", "alt": "title" } ], "columns": 2, "imageCrop": true, "linkTo": "none", "align": "wide" }, "innerBlocks": [], "originalContent": "<div class=\"wp-block-gallery columns-2 is-cropped alignwide\">\n\t<figure class=\"blocks-gallery-image\">\n\t\t<img src=\"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAAEAAAABCAYAAAAfFcSJAAAACklEQVR4nGMAAQAABQABDQottAAAAABJRU5ErkJggg==\" alt=\"title\" />\n\t</figure>\n\t<figure class=\"blocks-gallery-image\">\n\t\t<img src=\"data:image/jpeg;base64,/9j/2wBDAAMCAgICAgMCAgIDAwMDBAYEBAQEBAgGBgUGCQgKCgkICQkKDA8MCgsOCwkJDRENDg8QEBEQCgwSExIQEw8QEBD/yQALCAABAAEBAREA/8wABgAQEAX/2gAIAQEAAD8A0s8g/9k=\" alt=\"title\" />\n\t</figure>\n</div>" } ] | Mid | [
0.6153846153846151,
33,
20.625
]
|
<template> <transition> <svg class="spinner" :class="{ show: show }" v-show="show" width="68px" height="68px" viewBox="0 0 44 44"> <circle class="path" fill="none" stroke-width="4" stroke-linecap="round" cx="22" cy="22" r="20"></circle> </svg> </transition> </template> <script> export default { props: ['show'] } </script> <style lang="scss"> $offset: 126; $duration: 1.4s; .spinner { position: fixed; z-index: 999; transition: opacity .15s ease; animation: rotator $duration linear infinite; animation-play-state: paused; right: 50%; top: 20%; margin-right: -34px; &.show { animation-play-state: running } &.v-enter, &.v-leave-active { opacity: 0; } &.v-enter-active, &.v-leave { opacity: 1; } } @keyframes rotator { 0% { transform: scale(0.5) rotate(0deg); } 100% { transform: scale(0.5) rotate(270deg); } } .spinner .path { stroke: #42b983; stroke-dasharray: $offset; stroke-dashoffset: 0; transform-origin: center; animation: dash $duration ease-in-out infinite; } @keyframes dash { 0% { stroke-dashoffset: $offset; } 50% { stroke-dashoffset: ($offset/2) transform rotate(135deg); } 100% { stroke-dashoffset: $offset transform rotate(450deg); } } </style> | Low | [
0.380352644836272,
18.875,
30.75
]
|
/* * linux/net/sunrpc/gss_spkm3_seal.c * * Copyright (c) 2003 The Regents of the University of Michigan. * All rights reserved. * * Andy Adamson <[email protected]> * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. Neither the name of the University nor the names of its * contributors may be used to endorse or promote products derived * from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESS OR IMPLIED * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE * DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR * BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * */ #include <linux/types.h> #include <linux/jiffies.h> #include <linux/sunrpc/gss_spkm3.h> #include <linux/random.h> #include <linux/crypto.h> #include <linux/pagemap.h> #include <linux/scatterlist.h> #include <linux/sunrpc/xdr.h> #ifdef RPC_DEBUG # define RPCDBG_FACILITY RPCDBG_AUTH #endif const struct xdr_netobj hmac_md5_oid = { 8, "\x2B\x06\x01\x05\x05\x08\x01\x01"}; const struct xdr_netobj cast5_cbc_oid = {9, "\x2A\x86\x48\x86\xF6\x7D\x07\x42\x0A"}; /* * spkm3_make_token() * * Only SPKM_MIC_TOK with md5 intg-alg is supported */ u32 spkm3_make_token(struct spkm3_ctx *ctx, struct xdr_buf * text, struct xdr_netobj * token, int toktype) { s32 checksum_type; char tokhdrbuf[25]; char cksumdata[16]; struct xdr_netobj md5cksum = {.len = 0, .data = cksumdata}; struct xdr_netobj mic_hdr = {.len = 0, .data = tokhdrbuf}; int tokenlen = 0; unsigned char *ptr; s32 now; int ctxelen = 0, ctxzbit = 0; int md5elen = 0, md5zbit = 0; now = jiffies; if (ctx->ctx_id.len != 16) { dprintk("RPC: spkm3_make_token BAD ctx_id.len %d\n", ctx->ctx_id.len); goto out_err; } if (!g_OID_equal(&ctx->intg_alg, &hmac_md5_oid)) { dprintk("RPC: gss_spkm3_seal: unsupported I-ALG " "algorithm. only support hmac-md5 I-ALG.\n"); goto out_err; } else checksum_type = CKSUMTYPE_HMAC_MD5; if (!g_OID_equal(&ctx->conf_alg, &cast5_cbc_oid)) { dprintk("RPC: gss_spkm3_seal: unsupported C-ALG " "algorithm\n"); goto out_err; } if (toktype == SPKM_MIC_TOK) { /* Calculate checksum over the mic-header */ asn1_bitstring_len(&ctx->ctx_id, &ctxelen, &ctxzbit); spkm3_mic_header(&mic_hdr.data, &mic_hdr.len, ctx->ctx_id.data, ctxelen, ctxzbit); if (make_spkm3_checksum(checksum_type, &ctx->derived_integ_key, (char *)mic_hdr.data, mic_hdr.len, text, 0, &md5cksum)) goto out_err; asn1_bitstring_len(&md5cksum, &md5elen, &md5zbit); tokenlen = 10 + ctxelen + 1 + md5elen + 1; /* Create token header using generic routines */ token->len = g_token_size(&ctx->mech_used, tokenlen + 2); ptr = token->data; g_make_token_header(&ctx->mech_used, tokenlen + 2, &ptr); spkm3_make_mic_token(&ptr, tokenlen, &mic_hdr, &md5cksum, md5elen, md5zbit); } else if (toktype == SPKM_WRAP_TOK) { /* Not Supported */ dprintk("RPC: gss_spkm3_seal: SPKM_WRAP_TOK " "not supported\n"); goto out_err; } /* XXX need to implement sequence numbers, and ctx->expired */ return GSS_S_COMPLETE; out_err: token->data = NULL; token->len = 0; return GSS_S_FAILURE; } static int spkm3_checksummer(struct scatterlist *sg, void *data) { struct hash_desc *desc = data; return crypto_hash_update(desc, sg, sg->length); } /* checksum the plaintext data and hdrlen bytes of the token header */ s32 make_spkm3_checksum(s32 cksumtype, struct xdr_netobj *key, char *header, unsigned int hdrlen, struct xdr_buf *body, unsigned int body_offset, struct xdr_netobj *cksum) { char *cksumname; struct hash_desc desc; /* XXX add to ctx? */ struct scatterlist sg[1]; int err; switch (cksumtype) { case CKSUMTYPE_HMAC_MD5: cksumname = "hmac(md5)"; break; default: dprintk("RPC: spkm3_make_checksum:" " unsupported checksum %d", cksumtype); return GSS_S_FAILURE; } if (key->data == NULL || key->len <= 0) return GSS_S_FAILURE; desc.tfm = crypto_alloc_hash(cksumname, 0, CRYPTO_ALG_ASYNC); if (IS_ERR(desc.tfm)) return GSS_S_FAILURE; cksum->len = crypto_hash_digestsize(desc.tfm); desc.flags = CRYPTO_TFM_REQ_MAY_SLEEP; err = crypto_hash_setkey(desc.tfm, key->data, key->len); if (err) goto out; err = crypto_hash_init(&desc); if (err) goto out; sg_init_one(sg, header, hdrlen); crypto_hash_update(&desc, sg, sg->length); xdr_process_buf(body, body_offset, body->len - body_offset, spkm3_checksummer, &desc); crypto_hash_final(&desc, cksum->data); out: crypto_free_hash(desc.tfm); return err ? GSS_S_FAILURE : 0; } | Mid | [
0.5576036866359441,
30.25,
24
]
|
Jasmine's Ocean Resort provides many outdoor activities to adventure seekers and nature lovers. Relax in the sparkling waters of the secluded beach or engage in the many water sports. The resort also offers areas for outdoor picnics where one can feel at one with nature. | Low | [
0.315589353612167,
15.5625,
33.75
]
|
Carboxylated graphene oxide functionalized with β-cyclodextrin-Engineering of a novel nanohybrid drug carrier. In this paper, we selected biocompatible carboxylated graphene oxide (GeneO-COOH) as a base material. The nanohybrid drug carriers composed of GeneO-COOH and cyclodextrin (β-CD), have been successfully synthesized through esterification and self-assembly technique. The nanohybrid drug carriers of GeneO-COO-β-CD were characterized by X-ray diffraction (XRD), fourier infrared spectroscopy (FTIR), thermogravimetric analysis (TG), scanning electron microscopy (SEM), transmission electron microscopy (TEM) and solubility experiments. Results indicated that the nanohybrid was obtained with GeneO-COOH forming the core and a large number of β-CD molecules forming the shell with a special structure. In the nanohybrid, the westerification between GeneO-COOH and β-CD led to the formation of covalent bonds, while adjacent β-CD molecules engineer an outer shell composed of 100 β-CD molecules (ca. 800nm of thickness) in the form of a layer-by-layer self-assembly due to hydrogen-bonding interaction. The obtained novel nanohybrid drug carriers of GeneO-COO-β-CD possessed good dispersibility in water media and the solutions were found to remain stable for 12 months，providing a possibility for further applications in biology, medicine, agriculture and other fields. | High | [
0.6650366748166251,
34,
17.125
]
|
Unbiased Reviews and Undercover Price Research on Local Services Most Delaware Valley area homeowners can save more than $500 a year by switching from their current insurance company to a lower-priced one. Some will save more than $1,000. We collected annual premiums for sample policyholders for the companies that write almost all of the homeowners insurance business in the area. Costs vary significantly from company to company. For instance, our family living in Philadelphia would pay only $1,791 per year with GEICO/Homesite or $1,938 with Plymouth Rock, but pay more than $3,000 per year with Farmers, The Hartford, Lemonade, Travelers, or USAA. Which companies will offer you the lowest rates depends on many factors, but companies increasingly use credit scores to set their rates. With many companies, your credit score will influence the rates you’re offered more than anything else. The prices most companies offer customers with poor credit are double what people with excellent credit get. With some companies, the poor-credit penalty more than triples their rates. And insurers increasingly use other secretive and opaque methods to calculate rates. Because pricing methods and premiums can dramatically change over time, shop around for a better rate every other year or so. But don’t wait until the end of your policy term to shop or switch. If you change insurers, your old company must reimburse you for the unused portion of any payments you’ve made. Although rates for homeowners insurance depend largely on variables you can’t control, there are steps you can take—besides shopping for the best rate—to minimize costs: Choose a high deductible. Avoid buying too much coverage or lousy optional protection. We review these choices. Limit the number of claims you make. Consider buying your home and auto policies from the same company. Many offer discounts to customers who insure both their homes and cars with them. But keep in mind that such discounts are usually small and won’t make a high-priced insurer a good deal. Fortunately, you can choose a low-priced company and still get good claims service. We also report on companies’ claims handling service performance. You won't find anything else like Checkbook Nonprofit and independent Takes no advertising or referral fees Ratings and reviews by surveyed Consumers' Checkbook and Consumer Reports local subscribers Thousands of undercover price comparisons Complaint counts from local consumer agencies and attorney general offices Homeowners Insurance Articles Insurance companies often promote policy features to make their plans seem superior to their competitors’. But most sell roughly the same coverage. Here's a rundown of what’s covered, what isn’t, and what’s optional. If you are a renter or a condo owner, you can purchase insurance similar to homeowners coverage. As with homeowners insurance policies, rates for renters and condo owners vary significantly from company to company, so you’ll want to shop around. To help you identify low-priced insurers, our undercover shoppers collected annual premiums for sample policyholders for the companies that write almost all of the homeowners insurance business in the area. Costs vary significantly from company to company. Because homeowners insurance claims are fairly rare, we advise consumers to shop for the lowest price and put less emphasis on the quality of claims handling and other service issues. But among companies with similar rates, you may want to consider service as well as price. | Mid | [
0.642857142857142,
36,
20
]
|
Woody Allen’s ‘To Rome With Love’ Excels in Limited Release Is it the summer of the prestige indies? After the superlative debut of Wes Anderson’s Moonrise Kingdom, Woody Allen’s similarly fussy and delightful To Rome With Love landed in theaters this past weekend with an approximate $76,000 per-theater average. Last summer, Mr. Allen had his greatest financial success ever with Midnight in Paris, which ended up winning the Best Original Screenplay Oscar; per a Sony Pictures Classics exec’s interview with Deadline, To Rome With Love will be rolled out to theaters across America faster than was Midnight in Paris to capitalize on blockbuster counterprogramming. | Mid | [
0.6259351620947631,
31.375,
18.75
]
|
The prevalence of AIDS, AIDS related complex and HIV seropositivity in a large population of patients with congenital clotting disorders. We have investigated up to the beginning of 1987 114 patients with congenital clotting disorders. 84 had received plasma and/or clotting factors concentrates. 18 out of 84 (21%) had leukopenia, thrombocytopenia, or both. 64 out of 84 (76%) had been infected by hepatitis B virus. The great majority of them (62 out 64) developed adequate immunity (anti Hbs antibodies). Despite this, 47 out 84 (57%) showed persistently elevated transaminases. 17 out of 84 (20%) had HIV-seropositivity. Among them, 7 are free of symptoms related to such a virus up to present time, 8 developed AIDS-related complex and 2 had the full-blown AIDS and died. Non significant difference in HIV seroconversion or its clinical manifestations was noted depending on the administration of factor VIII concentrates versus prothrombin complex concentrates. In contrast, plasma administration appeared to be associated with a lower risk of viral transmission. No abnormality was observed in patients who had never received haemoderivatives, except the presence of anti Hbs antibodies in 1 of them. | High | [
0.66,
33,
17
]
|
News : Another SU300DP Desilter joins the fleet Nearly 3 years since PSD announced the successful launch of the new SU300DP Desilter, the 4th machine of its type has joined the fleet and gone straight out on rental to SPIE FONDATIONS in Marseille. The machine is the latest of PSD’s compact desilters but has an even higher fluid and solids handling capacity than PSD's previous desilters. The first project for the first SU300DP was working downstream of a client’s own desander in support of a diaphragm walling operation. The client, SPIE FONDATIONS, excavated the 45m deep panels at Quai d’Ivry in Paris using a grab through approximately 15m of clay and with a Hydrofraise through the remaining underlying limestone. Emmanuel Perignon of SPIE commented: “We have been very pleased with the SU300DP, it was very efficient and its treatment capacity is much better than other desilters. The SU300 was really important for this job and saved us disposing of a lot of bentonite from the site.” SPIE have gone on to request SU300DP for many projects since. The SU300DP uses a new generation PSD high speed linear motion inverter controlled double deck shaker with in excess of 4.8m2 of screen area spread over the two inclined decks, each of which carry 4 No. interchangeable, pre-tensioned, woven stainless steel wire screen panels which are held in place by pneumatic clamping systems. 12 No. extra-long bodied high performance 5” hydrocyclones are fed by a Metso MM200 pump driven by a 55kW overhead mounted electric motor. The machine has an integral inverter controlled Metso MM200 discharge pump with 30kW motor and a staircase with handrails for access to the shaker module. The unit is capable of handling a flowrate of up to 300m3/hr and the shaker will handle up to 25t/hr of suitable solids with the appropriate screens fitted to the shaker. The SU300DP transports as a single 20’ container sized unit and is ideally suite to a wide range of applications including working downstream of a desander for diaphragm walling or micro-tunnelling work. The 2nd and 3rd machines were built soon after the first and have proved to be a success with clients in the UK and Europe. Click here to download the technical data sheet for the SU300DP. | Mid | [
0.641255605381165,
35.75,
20
]
|
Q: GraphDatabase (Neo4J) vs Relational database (MySql) - query on specific column of a specific table Is it true that relational database, like MySql, performs better than a graph database, like Neo4j, when a query is about to search for specific data within a specific table and a specific column. For instance, if the query is: "search for all events that took place in Paris". Let's assume for simplicity that MySql would have an Event table with an index upon "City" to optimize this kind of query. What about Neo4j? One might think that a graph database has to traverse all graphs to retrieve the concerned events... However it's possible to create some indexes with Neo4j as its documentation precises. Why RDMBS would be faster than it for this kind of analysis/statistics request? A: As you already mentioned: you would create indices for this purpose. The default index provider in Neo4j is lucene, which is very fast and allows fine grained indexing and querying possibilities. Indices can be used for nodes or relationships and (normally) keep track which values have been set on certain properties on nodes or relationships. You normally have to do the indexing in your application code unless you're using neo4j's auto indexing feature that automatically indexes all nodes and/or relationships with given properties. So queries like "search for all events that took place in Paris" are absolutely no problem and are very performant when indices are used. | High | [
0.6737160120845921,
27.875,
13.5
]
|
The invention relates to a method to turn over print products which are transported in a conveyed flow along a conveying path while clamped in along one edge by the clamps of a circulating first conveyor in order to suspend the print products. Following the movement through a turning section, the print products are gripped along the opposite edge by the clamps of an additional, synchronously driven conveyor and are transported further while suspended from the clamps. The invention furthermore relates to an arrangement to turn over print products, transported in a conveyed flow along a conveying path while gripped and suspended, along one edge by the clamps of a circulating transporter or conveyor, the arrangement comprising a first conveyor having successively spaced apart clamps attached to a traction device that is guided around a reversing wheel. The clamps transfer the print products to the clamps of a following, synchronously driven conveyor. The arrangement furthermore comprises a turning section that operatively connects the conveyor and the additional conveyor. In addition to the conveyors, the print products are turned over with the aid of a transfer device and are transferred to the clamps of the additional conveyor with the opposite-arranged edge pointing forward. In contrast, European patent document EP 1 547 950 A1 discloses a method and an arrangement for stabilizing and positioning flat objects, in particular print products, for which the print products, supplied while suspended from one edge so as to be suspended, are stabilized at the exposed, opposite-arranged edge, are turned over and are then transferred to the clamps of a different conveyor. | Mid | [
0.57429718875502,
35.75,
26.5
]
|
domingo, 30 de julio de 2017 Is pharmacogenetic-guided treatment cost-effective? No one size fits all! Posted on July 24, 2017 by Scott D. Grosse, National Center on Birth Defects and Developmental Disabilities and W. Dave Dotson, Office of Public Health Genomics, Centers for Disease Control and Prevention A recently published article by M. Verbelen and colleagues in The Pharmacogenomics Journal is called, “Cost-effectiveness of pharmacogenetic-guided treatment: are we there yet?” As Betteridge’s law of headlines states, any headline that ends in a question mark can be answered by the word No. Regrettably, although that article presents useful information, it ends up by answering that question with a qualified Yes. We argue that applications of pharmacogenetics (PGx) are too diverse, with sparse epidemiological evidence of effectiveness and clinical utility, for assertions of the overall cost-effectiveness of PGx to be of value to decision makers. We suggest that a better way to frame the question is, “When is pharmacogenomic testing cost-effective?” The sample space for Verbelen’s study was limited to the FDA Table of Pharmacogenomic Biomarkers in Drug Labeling, which at the time contained 137 PGx associations. Of these, only germline associations were considered, so that, for example, tumor biomarkers were not included. Verbelen and colleagues reviewed 44 economic evaluations relating to 10 drugs, of which 57% considered PGx testing to be either cost-effective or cost-saving. That conclusion is similar to previously published reviews on this topic, which is not surprising since most of the studies were included in previous reviews. The authors acknowledge that positive findings of cost-effectiveness are more likely to be published. We argue that generalizing about cost-effectiveness based on results from a limited set of economic evaluations that are unlikely to be representative of PGx applications is probably not helpful and could be misleading. Cost-effectiveness depends crucially on evidence of effectiveness, i.e., improved health outcomes. As we have pointed out previously, including an invited commentary on a previous review by Phillips et al., lack of high quality evidence is the Achilles heel in PGx and genetic testing. The absence of clear evidence of effectiveness should call into question published findings of cost-effectiveness. If something is not effective, it cannot be cost-effective! Verbelen et al. acknowledge that most economic evaluations in genomics and PGx are not informed by high-quality clinical evidence. In the absence of such evidence, it is not difficult to make something appear cost-effective, if that is one’s objective, through the careful selection of assumptions. Cost-effectiveness is a fluid concept. Like beauty, cost-effectiveness is in the eyes of the beholder. Stakeholders who have different definitions of cost and cost-effectiveness may reach different conclusions. Also, an intervention may be calculated to be cost-effective relative to doing nothing but not cost-effective compared with another treatment. Or, it may be cost-effective at one set of prices but not cost-effective at another. Verbelen and colleagues suggest that the price of genetic testing is influential in the cost-effectiveness of PGx, pointing out that PGx is more likely to be cost-effective if the cost of testing were to reach zero. However, real-world data summarized by the authors did not confirm the importance of testing costs. Specifically, although genetic testing costs are substantially higher in North America than in Europe, PGx tests were just as likely to be found to be cost-effective in U.S. and Canadian studies. The authors helpfully discuss in detail the example of PGx-guided warfarin dosing, which is the most commonly studied PGx application. They note that most economic evaluations have not found this application to be clearly effective or cost-effective. First, Verbelen et al. note that PGx-guided warfarin dosing does not appear to be cost-effective relative to novel oral anticoagulants. Second, that application appears unlikely to be cost-effective even relative to standard warfarin dosing without PGx, since, “the clinical advantage of genetic-guided dosing over standard dosing appears to be small or even non-existent.” Not all PGx applications have received the same critical scrutiny as warfarin dosing. We urge that stakeholders resist the temptation to reach conclusions about the cost-effectiveness of PGx without both clear evidence of clinical utility as well as thorough documentation of epidemiologic and cost assumptions. It is important that epidemiology not be relegated to a “black box” in economic evaluations of genetic testing. Also, cost-effectiveness analyses should not be seen as “shortcuts” to evidence-based genomic medicine. Posted on July 24, 2017 by Scott D. Grosse, National Center on Birth Defects and Developmental Disabilities and W. Dave Dotson, Office of Public Health Genomics, Centers for Disease Control and Prevention | Low | [
0.48815165876777206,
25.75,
27
]
|
Reflex responses to periodontal and auditory stimulation in human masseter. An investigation was made of the reflex responses evoked in the human masseter by periodontal mechanoreceptors. Weak taps were applied to the labial surface of a central incisor tooth by an electromechanical stimulator with a flexible probe (von Frey hair). Forces as low as 0.2 N evoked inhibitory reflex responses in the surface electromyograms of both masseter muscles. These reflexes were modulated to markedly different extents in different subjects by auditory white noise, which always reduced the amplitude of the inhibition. The reflexes were abolished when local anaesthesia was infiltrated around the stimulated tooth and white noise was played into the ears. Evidence is presented that the sound of the tap on the tooth, transmitted through the air, is in itself sufficient to evoke an inhibitory reflex in masseter which is qualitatively similar to that from the periodontal receptors. Thus, in the absence of auditory masking, the total reflex evoked by tooth taps is the result of the summation of the inputs from both periodontal mechanoreceptors and auditory receptors. | Mid | [
0.623376623376623,
30,
18.125
]
|
You are here Trump and the Middle East cauldron One of the hallmarks of a presidential transition in the United States is a comprehensive policy review, aimed at determining which policies to retain and which to eliminate or change. As President-elect Donald Trump moves towards taking office, he seems eager to make plenty of changes — some more positive than others. Some US policies seem destined not even to receive their day in court. The fate of the 12-country Trans-Pacific Partnership trade agreement seems already to have been sealed, with Trump assuring the public that he would shelve that deal — concluded but not ratified by the US Senate — on his first day in office. This is unfortunate, as the TPP would have revolutionised intellectual property rights and boosted transparency to unprecedented levels, while lowering tariff and non-tariff barriers. But Trump seems unlikely to reverse course. In another crucial policy area, however, change by the incoming Trump administration would be welcome: the Middle East. The incremental approach to the region taken by the last two administrations, under George W. Bush and Barack Obama, has meant that the US has failed to keep pace with events. The Obama administration, in particular, often hesitated to expand its role, anticipating a time when the US would not be absorbed in a region that, to paraphrase Winston Churchill’s line about the Balkans, had produced more history than it has consumed. Nonetheless, Obama understood the value of maintaining a consistent stance in Iraq — something that his critics often fail to recognise. The truth is that it was Bush who, having plunged the US into war in Afghanistan and Iraq, in 2008 signed the Status of Forces Agreement that allotted three years to withdraw all US troops from Iraqi territory. And Iraqi politicians would not agree to postpone that deadline on terms that could be justified to the American people. One can only imagine the reaction of the US Congress, including those who wanted to keep US troops in Iraq as long as they have been in Germany or Japan, had the Obama administration agreed to Iraqi demands that US troops be subject to the Iraqi judicial system. All of this left the Obama administration with little choice but to withdraw US forces — and take the associated blame. Indeed, since that withdrawal was completed, the region’s struggles have only escalated, plunging an ever-larger area into conflict. Trump and his team must now think carefully about what has happened in the Middle East, and what to do about it. This will require not just an investigation into region-wide challenges, such as Sunni radicalism, but also a careful consideration of bilateral policies. Start with the continued export of Sunni radicalism from the Arabian Peninsula, a complex issue that involves Saudi Arabia and other Gulf states. While extremist groups have traditionally received funding from the peninsula, it is not sound policy simply to accuse the Saudis of incubating all that is bad in the Middle East, and punish them accordingly. While the US now enjoys greater energy self-sufficiency, thanks to shale oil and gas, that is not true of its allies in Europe. Would a tougher position towards Saudi Arabia really be in America’s interest? Nor is it wise to blame the Shiites — who are, in many ways, the victims — for the onslaught of Sunni radicalism. The tough-minded Iraqi leader Nouri Al Maliki, who won three terms as prime minister, may not have engaged in sufficient outreach to the country’s Sunnis, but that is only one reason why Sunni radicalism persists in Iraq. Another is that some elements of Iraq’s Sunni minority have refused to accept their status as the only Sunnis in the Arab Middle East to live under a Shiite majority. Then there is Syria, now the main flashpoint of the region’s complex social and political dynamics. The civil war there is not just a matter of a ruthless dictator quelling the aspirations of a democratic-minded opposition. Rather, it is a multi-sided conflict, in which identifying the “good guys” is no easy feat. Daesh is, to be sure, public enemy number one, and Trump has already recognised it as such. But how to eliminate Daesh, not just from Mosul, but from the entire world, will require a thoughtful, subtle and nuanced approach. Trump’s emerging national security team does not seem to understand this. Moreover, defeating Daesh is just the first step. The Trump administration will also have to deal with the external actors involved in Syria. For example, it will need to devise an effective policy towards Turkey, a NATO member with strong interests in Syria — interests that, at times, conflict with America’s. At a time when Turkish democracy is wobbling, and its leaders are less interested in Euro-Atlanticism than in reasserting century-old claims in the Middle East, the US will, again, need to adopt a tactful approach. Then there is Iran. Is walking away from the Iran nuclear deal, as many supporters of the new US administration are demanding, conducive to easing the crisis in the Middle East? Iran may not offer much in the way of solutions; but, if the US abandons it, the country can easily exacerbate the region’s turmoil. As if that were not enough, the US will also need to rethink its policy towards Egypt, which, until recently, often made important contributions to diplomatic efforts in the region. Much of Israel’s security is based on an Egypt than supports the peace process with Palestine. As tattered as that process may look, there is still plenty of room for further deterioration. Trump’s administration has often emphasised its plans to look inwards, focusing on domestic policy and putting America first in foreign policy. But Trump will not be able to avoid playing a role in the Middle East. One hopes that it is a constructive one. The Jordan Times The Jordan Times is an independent English-language daily published by the Jordan Press Foundationsince October 26, 1975. The Jordan Press Foundation is a shareholding company listed on the Amman Stock Exchange. | Mid | [
0.546153846153846,
35.5,
29.5
]
|
Q: Create a radial gradient programmatically Im trying to reproduce the following gradient programmatically. <shape xmlns:android="http://schemas.android.com/apk/res/android"> <gradient android:startColor="@color/startcolor" android:centerColor="#343434" android:endColor="#00000000" android:type="radial" android:gradientRadius="140" android:centerY="45%" /> <corners android:radius="0dp" /> </shape> How can I set programmatically the paramether? Thanks android:centerY="45%" A: http://developer.android.com/reference/android/graphics/drawable/GradientDrawable.html To set that specific parameter (I'm assuming a centerX value as you haven't specified one): yourGradientDrawable.setGradientCenter(1.0f, 0.45f); So to create the above gradient (except with different colors) programatically: GradientDrawable g = new GradientDrawable(Orientation.TL_BR, new int[] { getResources().getColor(R.color.startcolor), Color.rgb(255, 0, 0), Color.BLUE }); g.setGradientType(GradientDrawable.RADIAL_GRADIENT); g.setGradientRadius(140.0f); g.setGradientCenter(0.0f, 0.45f); Note: The orientation is ignored for a radial gradient but is needed for the constructor that takes colors. | High | [
0.704264099037138,
32,
13.4375
]
|
Simple Display Table Here is a simple table made from #2 Pine “Shelving.” Legs were just laminated up and tapered. M&T joints and a solid top. Not bad for $13 worth of lumber. Finished with dark walnut stain and semi-gloss poly. | Low | [
0.392105263157894,
18.625,
28.875
]
|
The LA Galaxy lost to their biggest rival and didn’t show much fight . What does the loss to SJ tell us about the Galaxy’s leadership? COG STUDIOS, Calif. — The LA Galaxy are making the buildup to one of their biggest games this year more than a little uncomfortable. Whereas an excellent performance against the San Jose Earthquakes would have bolstered their resolve heading into the LAFC match, their flattest performance of the year, against a rival, has left more questions than answer. On today’s show, hosts Josh Guesman and Kevin Baxter (back from the women’s World Cup) walk you through the bad result and the even more questionable post-game for the Galaxy. The guys start by breaking down the tactical side of the 3-1 loss. They’ll talk about some of the only bright spots the Galaxy showed, and why even when winning at halftime, the Galaxy knew they were in trouble. The outstanding performance from David Bingham was completely wasted, Rolf Feltschers early goal was completely wasted, and there were no answers for the Galaxy outside the first 15-20 minutes of the game. And afterward, Schelotto didn’t have an answer for the San Jose’s 32 shots and 16 shots on goal. And there was no answer for why the Galaxy attempted just six crosses on the night and why Zlatan Ibrahimovic didn’t have a shot on goal. The Earthquakes completely dominated the game, and their rapid-fire goals in the second half were just more of an illustration of why the Galaxy were outcoached and outmaneuvered at every step. But the bigger question of who this team’s leader was comes to light from the locker room after this loss. And Josh and Kevin do their best to convey the post-game atmosphere and why Feltscher and Joe Corona — neither of whom you’d consider leaders — had to answer for the poor play from so many. This podcast isn’t the happy one you expected leading into the match with LAFC. But it was probably a long time coming. Music provided by Back Pocket Memory SHOW INFO CORNER OF THE GALAXY ITUNESSTITCHERSOUNDCLOUDYOUTUBE BACK POCKET MEMORY ITUNESFACEBOOKTWITTERINSTAGRAM Comments comments | Mid | [
0.616740088105726,
35,
21.75
]
|
Ekanem’s decision is one of two received from in-state prospects by Virginia Tech on national signing day, as WR Joel Caleb (Midlothian) also picked the Hokies. However, there was one prominent in-state prospect that got away, when DT Korren Kirven (Lynchburg) picked Alabama. Ekanem is a 6-3, 235-pounder who tore his ACL late in the season, and thus may be redshirting in 2012. “I knew I had the right school in mind when a month back or two months back, Virginia Tech told me before the that even if you tear your ACL, you’ll have a scholarship no matter what happened,” Ekanem said, per The Roanoke Times. | Mid | [
0.5629139072847681,
31.875,
24.75
]
|
Organic Awesomeness | Vegetable Plots by liesbeth on April 30, 2013 There is absolutely NOTHING that can beat fresh fruit and veggies from your own garden. No chemicals, no week-on-a-boat transportation, no fake ripening. Just pure goodness from your own soil. And when you hold your first, very own, little tomato in your hands, it’s just like when you held your newborn: tiny and wrinkly, but my god is it the most beautiful thing you have ever seen! I made my garden plots 3 years ago. I did not read a tutorial. I am not a builder. I am just a mom who is not afraid to get a bunch of 4×4’s and 6 inch nails and, with a “how-hard-can-it-be” attitude, whack the thing together. It is probably my most rewarding DIY project I have ever done. It works, it looks good and I am dying to plan to plant my third harvest and start seeding this month. And, last but not least, my son actually knows how vegetables get “made” and is part of the process from buying the seeds in the store to harvesting. Is there any better way to make your toddler eat his or her greens? Submitted by: Liesbeth Total Time Required: 3-4 hours Project Costs: $90 (excluding soil, seeds and plants) 4x4x8 outdoor treated wood (6 pcs for one garden plot): $8.73 per piece at Home Depot. Treated Wood 1×8 Lattice for the fencing (3 pcs for one garden plot): $4.86 per piece at Home Depot. Treated Wood 2x2x8 (1 for one garden plot) for the small posts: around $3. Materials & Tools Required 4x4x8 outdoor treated wood Treated Wood 1×8 Lattice (3 pcs for one garden plot). Have the people in the store cut one of them in half so have 2 short parts for the shorter side of your plot (4×1 feet). Treated Wood 2x2x8 (1 for one garden plot) small posts. Have them cut to into 4 pieces (these are your 4 corner posts, each 2 feet long) 6 or 8 inch wooden nails Drill Large Hammer Normal Hammer Project Tutorial Step 1: Pre-drill the corners of your 4x4s (as there is NO way you are going to be able to hammer those huge nails into the beams, plus you would split them anyways). Step 2: Select your perfect spot for your garden plot(s) and make sure your ground is nice and flat. Then dig out a “trench” for your 4×4’s of about an inch and a half deep so they don’t sit on top of the ground but are nicely sunken in the ground. You will have to do some fiddling to dig this little trench evenly. I kept putting the 4 x 4 in and using a level to make sure my trench was the same depth across the entire length. Step 3: lay down your first “layer” of 4×4’s (2 in the length and 2 in the width). Now hammer your second set of 4×4’s on top using the large hammer. This likely will be a little bit of hard work, but hey…you’re knee-deep into it at this point, so don’t give up! Step 4: dig a bit of a hole on each inside corner of your plot immediately next to the 4x4s and stick one little post in each hole. Hammer as deep as you can. Step 5: with smaller wood nails, hammer the fencing sheets to the posts YOUR GARDEN PLOT IS READY! fill with some nice soil, get your seeds, consult the gardening books and off you go. Enjoy! | Mid | [
0.610859728506787,
33.75,
21.5
]
|
List of glaciers in Norway These are the largest glaciers on mainland Norway. However, the 18 largest glaciers in the Kingdom of Norway are on Svalbard, including the second largest glacier in Europe, Austfonna on Nordaustlandet. In total, Norway has around 1,600 glaciers - 900 of these are in North Norway, but 60% of the total glacier area is south of Trøndelag. 1% of mainland Norway is covered by glaciers. List See also List of glaciers References * Glaciers Norway | High | [
0.691415313225058,
37.25,
16.625
]
|
Sheriff John Anderson’s suggestion at Wednesday’s Madera City Council meeting that Madera, the City of Chowchilla and Madera County combine their law-enforcement agencies is a good one and deserves serious study. Here are some of the reasons it may be a good idea: -- Many investigations could be consolidated. Sheriff’s deputies and police officers often carry on parallel investigations of the same criminals, who may commit one crime, such as burglary, in one jurisdiction, and another burglary in a second jurisdiction. Crooks don’t know boundaries, Anderson and Madera Police Chief Michael Kime both told The Tribune’s DJ Becker after the council meeting. “It’s the same crook,” Anderson told the council. “Just a different location, and it happens with burglaries, check cases, robberies, you name it.” -- Communications operations could be combined, speeding up responses in some cases. -- Turf protection would mostly disappear. That is the tendency of law enforcement agencies to protect their own bureaucratic priorities and territories from other agencies, a habit that’s normal, but which often ends up wasting time, money and resources to no good end. -- Scarce resources, such as certain kinds of equipment, special training and special vehicles could be shared, both in cost and use. -- Money probably would be saved, but even if money wasn’t saved, the quality of law enforcement likely would be improved. More emphasis could be put on crime prevention and special investigations. Experiments in cross-jurisdictional law enforcement, such as the multi-agency drug-enforcement team, show the value of such cooperation. Finally, in some cases, cities and counties will combine more than law enforcement, but also fire protection, providing cross-training for people they call public safety officers who respond to many different kinds of emergencies. Something like that may be too far in the future to consider, but there’s little question consolidated law-enforcement is something worth investigating. | High | [
0.7072072072072071,
39.25,
16.25
]
|
Notes: Video begins after Officer Ann Carrizales reports in after being injured. Carrizales catches up to them at the 1:30 mark, and gets close enough that the suspects continue shooting at her at the 4:40 mark. Backup arrives to check her condition at the 7:30 mark.A Stafford police officer was recovering Saturday after being shot twiceby a suspect during a traffic stop. Amazingly, the shooting did not stop her from going after the suspects and helping to capture the gunman.Two other men remain at large. We're learning more about one of them, including his possible involvement with a dangerous gang. According to the Stafford Police Department, the whole thing started when Officer Ann Carrizales stopped a vehicle around 3:30am in the 12700 block of Murphy Road.Inside were three males. "She approached and was speaking with the driver when the passenger inside the vehicle shot her once in the chest and once in the face," SPD Lt. Dustin Claborn said.In spite of her injuries, Carrizales returned fire as the vehicle fled. She then managed to make it back to her patrol car and follow the suspects, chasing them into Houston. "I think it speaks highly of her character, her fortitude," Claborn said.The chase ended outside an apartment complex on Greenfork at Concourse near the Northwest Freeway. The 21-year-old shooter -- identified as Sergio Francisco Rodriguez -- was located and taken into custody by Missouri City police officers, who came to assist with the chase, along with DPS, Sugar Land and Houston officers. Rodriguez is charged with aggravated assault on a peace officer and was being held without bond Saturday night.An active warrant for aggravated assault on a peace officer has been issued for the driver, 28-year-old Freddy Henriquez. Police said Henriquez should be considered armed and dangerous. He is also reportedly a Honduras native wanted by Immigration and Customs Enforcement for illegally re-entering the United States as a violent felon.According to ICE, Henriquez is believed to be a member of a violent gang called Sureno 13 -- a prison gang affiliated with the Mexican Mafia. If you see him or have information on his whereabouts, you're asked to call SPD at 281-261-3950, SPD Detective Henry Garcia at 281-208-6991, or call 911. Investigators are working to identify the third suspect.Carrizales was taken to Memorial Hermann Hospital and was released Saturday night. According to police, her bullet-proof vest saved her life. "Her ballistic vest stopped almost all the shot to the chest, some minor injuries there," Claborn said."Without a doubt, it saved her life. It just illustrates how quickly something can go bad forany officer at any time." Carrizales has been a member of the Stafford Police Department since August of 2010. abclocal.go.com/ktrk/story?section=news/local& ;amp;id=9308510 | Mid | [
0.644444444444444,
36.25,
20
]
|
I once found myself in Paris, Texas, possibly the most curious juxtaposition of place names in America. There was no public hospital in Paris. The local authorities would begrudgingly dispense a bus ticket to Dallas, two hours away, to anyone who couldn't afford private treatment. (Mentally ill people were just given a ticket to the next town; there wasn't even any pretence of caring whether they were treated). I met an elderly woman who couldn't afford to heat her home on winter nights, which of course exacerbated her various ailments, all of which were going untreated because she lived in Paris. She was quite open about her issues, as Americans tend to be, and at one point, I remarked that where I came from, she would at the very least be provided with basic medical care. Well, she said, she'd heard about Canada. And that sort of system, she informed me, is socialism. Taking government help And there it was. The strange and uniquely American cognitive dissonance. I don't know if that old woman is still alive, but if she is, I expect she voted for Donald Trump. Socialized medicine, with all its flaws, was designed precisely for people like that old woman; every other developed country in the world has such an arrangement. But America's conservative establishment, particularly in rural and poor states, has done a superb job of convincing the people who most need government's help that asking for it is shameful — it's socialism and it's evil — and that they should effectively vote against their own economic self-interest. Americans are raised to believe that anything is possible in America if you are pure of heart and willing to work hard, which is nonsense. (John Bazemore/Associated Press) People are told in their churches to vote Republican. I've heard pastors say it from the evangelical pulpit. Congregants are actually told that lower taxes and less government is the Christian way. Americans are raised to believe that anything is possible in America if you are pure of heart and willing to work hard, which is nonsense, and that anyone can become president, which is even more foolish, and that free markets always make the right decision, which is nuts. They are told that rugged individualism is the American way, which it isn't, and that government is never the solution, which it sometimes most definitely is. Demanding cuts Eventually, these national myths cross over into outright delusion; large segments of the populace, people who are dependent on all manner of government programs, come to believe they are not, and freely vote for wealthy politicians who make no secret of their intention to defund or dismantle those programs in the name of Americanism, and Jesus Christ our Lord (see: Planned Parenthood). Anyone who's ever attended a Tea Party rally has seen that phenomenon in operation. People on Medicaid-supplied wheelchairs, living on social security disability or supplementing their income with food stamps, demanding radical cuts to government. Tea Party Republicans are threatening to shut down and bankrupt the government if Barack Obama doesn't agree to dismantle 'Obamacare' 2:36 A woman at one such rally informed me that I might not realize it, but Social Security is not a government program. Which brings us to Donald Trump. In states such as Oklahoma and Arkansas and Louisiana, where working-class people overwhelmingly bought the idea that a Manhattan billionaire would champion them, those people are now slowly, groggily realizing that he surrounded himself with other billionaires, and is intent on cutting all sorts of government programs they like to pretend they don't depend on, but do. The big shock must have been Trump's willingness to throw 24 million people off Medicaid, and drastically reduce coverage for millions of others, breaking his promise to do neither of those things, in order to win passage of a bill to replace Obamacare. The big shock must have been Trump's willingness to throw 24 million people off Medicaid. (Rebecca Cook/Reuters) Not that Trump voters want to keep Obamacare. They don't. They hate Obamacare. But many of them have come to depend on the Affordable Care Act, and would rather it not be changed (The ACA is Obamacare, of course, but in the cognitive dissonance of Trump Nation, that's beside the point). Luckily for them, Trump's replacement bill was shut down by hardline conservative Republicans, who didn't think it went far enough in cutting benefits to the poor. But that doesn't mean their champion won't keep looking for ways to cut social spending so he can Make America Great Again. This past week, the Washington Post went to Oklahoma, which overwhelmingly supported Trump, to chronicle the list of programs Trump would cut in the rural city of Durant: the Boys and Girls Club, the county seniors centre, the Farm Service Centre, programs that coordinate volunteers to do things like drive veterans to VA hospitals, etc. Are people concerned? Well, yes. At least those of them who actually understand those programs are government-funded. But for now at least, Trump remains their champion. Working-class people have bought the idea that a Manhattan billionaire would champion them. (Jae C. Hong/Associated Press) As 79-year-old Clyde Glenn told the Post, the money is needed for a strong military: "If North Korea shoots a missile and it hits the United States and knocks out our power grid, then you'll be saying: 'How come nothing works no more?' " The New York Times, meanwhile, headed to Trumbull County, Ohio, to examine what Trump's proposed cuts will mean there. Trump wants to cut the Housing and Urban Development budget, along with programs like the Appalachian Regional Commission, AmeriCorps, the Legal Services Corporation and the Interagency Council on Homelessness, all of which benefit lower income Ohioans. Duty to country The newspaper visited Tammy and Joseph Pavlic, who live on a shoestring, and relied on government money to mend their crumbling home. Both still support Trump, though. As Joseph Pavlic bravely put it, if the money is needed for the military, so be it: "Keeping the country safe compared to keeping my bathroom safe isn't even a comparison." That, of course, is fine to say in the abstract, while Trump's proposed cuts are still being negotiated with Congress, and haven't yet begun to bite. But they will, presumably. And the desire of working class conservative Americans to teach the damned liberals a lesson will collide with their grocery list and ability to pay the mortgage or rent, while Trump's planned tax cuts make America's affluent even more affluent. It'll be interesting to watch how Republicans sell it all. As proud citizens doing their part for America, most likely. And for Jesus. This column is part of CBC's Opinion section. For more information about this section, please read this editor's blog and our FAQ. | Low | [
0.5032537960954441,
29,
28.625
]
|
The Doctor finds Lady Cranleigh & Latoni and shows them the body he's found. They take him back to his room where he changes into his returned costume. Anne meanwhile has been put to bed by a hideously disfigured man. When she awakens she finds Lady Cranleigh and Latoni rebinds the disfigured man. The Doctor comes to the party in costume where he is identified as the assailant by Anne and arrested by Sir Robert Muir, the chief constable of the county, a guest at the ball. Lady Cranleigh refuses to give the Doctor an alibi. The Doctor tells Muir of a second dead body, but when he is taken to the cupboard it is empty and the Doctor is taken away with his companions. The Doctor asks to be taken to the railway station but when they get there the Tardis is gone. They are taken to the police station where the Tardis sits in the yard and the Doctor unlocks it admitting the Police Man. The disfigured man escapes again, setting a fire. The police receive a call that another body has been found and the Doctor takes them to the manor in the Tardis. The figure confronts Lord and Lady Cranleigh, but when the Doctor & his friends enter he mistakes Nyssa for Anne and seizes her. Lady Cranleigh admits the man is her elder son George. Charles confronts his brother on the roof of the burning manor, and the Doctor talks him into releasing Nyssa, proving she is not Anne. George falls to his death from the roof. The Doctor stays for the funeral, and Lady Cranleigh presents him with a copy of George's book, The Black Orchid. That's a novel for Doctor Who. Yes it's the first story since the Highlanders in 1966 not to feature any alien life form, and no science fiction element except the Tardis. But it could be the first Doctor Who story not to feature science fiction or historical events..... I suppose the Smugglers is it's nearest anticendant in Doctor Who: while not featuring actual historical events or figures it does feature a story set in a specific era. What it's most like is an Agatha Christie novel, in particular Hercule Poirot. You could see Poirot getting off the train, with Hastings being drafted into the cricket match and the fiance being Miss Lemon's double. I doubt you'd get away with the story as it is now, you could see some science fiction horror being inserted into it, perhaps having George slowly mutating as a result of contact with some alien artifact. The only problem with that is that perhaps that's a bit too reminiscent of Seeds of Doom. But it works as a story, it's something a bit different and it proves that the two part story is a viable format. And the fifty ish minutes that this story takes up are the equivalent length of one modern episode of Doctor Who. This is the first two part story since the Sontaran experiment in 1975, which in turn was the only two parter outside the Hartnell era (1964's Edge of Destruction and 1965's The Rescue). Two parters are the solution in the fifth Doctor's era to the problem of having a season length that doesn't divide by 4, the preferred length of a story. But wait! Didn't John Nathan-Turner secure extra funding at the start of season 18, Tom Baker's last, to make a 28 episode season instead of the traditional 26 episode one? What happened to the extra money? I think we can safely say that 2 episodes worth of money went making K-9 & Company this year. Next year is only 22 episodes but would have been 26 if Warhead had been made (yup there's some strike action coming: see Enlightenment, King's Demons & Resurrection of the Daleks for details). The remaining two episodes worth were spent on The Five Doctors with the rest of the episode being paid for as a joint production with the Australian Broadcasting Commission. Several of the cast here are known to us, or will be shortly. Probably the most famous face in this serial is Moray Watson as Chief Constable Sir Robert Muir. just look at that CV! Doctor Who and his Star Cops appearances are mere footnotes. Don't take IMDB's claim that he's the father of Emma Watson at face value: the famous one is a different person altogether! Playing Lord Charles Cranleigh is Michael Cochrane. He'll be back as Redvers Fenn-Cooper in Ghost Light, but before then we'll see his younger bother Martin Cochrane as Chellak in the The Caves of Androzani. And his wife's more famous sister as well...... Playing George Cranleigh (credited as The Unknown in the first episode & the Radio Times to disguise his true identity: there's more of this next episode!)is stuntman Gareth Milne who will be back doubling for Peter Davison in Warriors on the Cheap sorry I mean of the Deep. He'll work with Peter Davison again on Campion, which has a similar period setting. Ivor Salter plays Sergeant Markham: he was previously the Morok Commander in The Space Museum and Odysseus in The Myth Makers. Black Orchid was repeated on 31st August & 1st September 1983, the third story from this season to get a repeat that summer. As to what happened to the 1982 repeat season..... well see the end of the next story. It was released as a novel by the story's author in Spetember 1986 (HB) and February 87 (PB), the last Peter Davison story to be released by Target Books leaving Resurrection of the Daleks un-novelised. It was released on video in July 1994 in a double pack with the preceding story, the Visitation, and on DVD on April 14th 2008. One is a tinsy bit excited about tomorrow and the three days following.... | Mid | [
0.6156862745098041,
39.25,
24.5
]
|
/**
* Project: doris.admin.service.common-0.1.0-SNAPSHOT
*
* File Created at 2011-5-24
* $Id$
*
* Copyright 1999-2100 Alibaba.com Corporation Limited.
* All rights reserved.
*
* This software is the confidential and proprietary information of
* Alibaba Company. ("Confidential Information"). You shall not
* disclose such Confidential Information and shall use it only in
* accordance with the terms of the license agreement you entered into
* with Alibaba.com.
*/
package com.alibaba.doris.admin.service.failover.node.check;
/**
* TODO Comment of NodeHealth
*
* @author mian.hem
*/
public enum NodeHealth {
OK,
NG
}
| Low | [
0.478260869565217,
26.125,
28.5
]
|
{ "bundles": { "Overblog\\GraphQLBundle\\OverblogGraphQLBundle": ["all"] }, "copy-from-recipe": { "config/": "%CONFIG_DIR%/" } } | Low | [
0.49884526558891407,
27,
27.125
]
|
ABOUT BAW BAW, founded by Amy Werba in 1995, offers American techniques of acting directly from the Master teachers—Lee Strasberg, Stella Adler, Sanford Meisner, and Eric Morris. As the only acting school that provides intimate classroom settings in English in the heart of Paris with teachers trained in the USA, BAW brings together multilingual and multicultural individuals to enhance their expression, education and networking through related studies in media and film. Join us in our ongoing One Year Certificate Programs to provide a more intense and professional education in acting for film. New! One-on-one Skype coaching for auditions and entrance into university acting programs. Available in several languages. | High | [
0.683168316831683,
34.5,
16
]
|
e units digit of y? 3 Let u be (12/8)/((-1)/(-24)). What is the tens digit of 906/u + 3/(-18)? 2 Suppose -5*q - 4*b + 4 = -11, 0 = 5*q - 4*b - 15. Let a = q + 110. What is the tens digit of a? 1 Let d = -1635 - -4067. What is the units digit of d? 2 Let c(o) = -o**3 + 20*o**2 + 32*o - 36. What is the hundreds digit of c(21)? 1 Suppose 1 = 3*z - 5. Suppose z = 2*n + 6. What is the tens digit of 20 + -4*(-1)/n? 1 Let c = 146 + -150. Let h(u) = -41*u + 33. What is the units digit of h(c)? 7 Let r be 35/15 + (-2)/(-3). Suppose 2*g + r*g - 295 = 0. Suppose -5*w + 1 = -g. What is the tens digit of w? 1 Let d = 2118 + 1124. What is the thousands digit of d? 3 Suppose 0 = 4*o - 3*f + 80, -5*o + 0*f = -4*f + 100. Let n be o/50 + 24/10. What is the units digit of -2*5*n/(-4)? 5 Let t be 4340/42 + (-1)/3. Let i = 4 + t. Suppose 13 = 5*q - i. What is the units digit of q? 4 Let i be 42/(-6)*6/7. Let r(h) = h**3 + 8*h**2 + 5*h + 3. What is the tens digit of r(i)? 4 Let x be (1 - (0 + -2))*-1. Let a = -3 - x. Suppose a = -4*d - 20 + 52. What is the units digit of d? 8 Let m(p) = -7*p**3 + 2*p + 1. Let d be m(-2). Let z = 22 + d. What is the units digit of z? 5 Let v(q) be the first derivative of -q**2/2 + 15*q - 4. Let t be v(-11). Let i = 0 + t. What is the units digit of i? 6 Let u = 215 - 96. Suppose 124*k = u*k + 215. What is the units digit of k? 3 What is the units digit of 212/(-8)*20/(-5)? 6 Let i(j) = 452*j**3 - 3*j**2 + 4*j - 3. What is the tens digit of i(1)? 5 Let s = 12 - 9. Suppose -s*i = -187 - 29. What is the units digit of i? 2 Suppose -470 = -9*i + 547. What is the tens digit of i? 1 Let j be 14/(-42)*0/(-2). Suppose j = g - 5*g + 1296. What is the tens digit of g? 2 Suppose 4*p - 432 = m + 47, -2*p = 2*m - 252. Suppose -4*s + 113 + p = -2*u, 0 = -2*u - 6. What is the tens digit of s? 5 Let o(q) = q**2 - 2*q. Let z be o(3). Let j be (15/(-20))/((-1)/20) + -1. Suppose -4*y = -z*t - j, -5*y - t = -4*y. What is the units digit of y? 2 Suppose -378 = -s + 501. What is the tens digit of s? 7 Let b be 4 + (-17)/1 - -1. Let n be (-1 - 2)*28/b. Let w = n + 44. What is the units digit of w? 1 Let p be -4*((-42)/(-8) + -3). Let n(o) = o**3 + 8*o**2 - 10*o - 19. Let c be n(p). Let a(d) = d**2 + 3*d - 2. What is the units digit of a(c)? 8 What is the tens digit of 3880*(10 - (-455)/(-52))? 5 Let w(x) = -x**2 + 9*x - 14. Suppose 3*f + 28 = 7*f. Let z be w(f). Suppose z*j + 40 = 2*j. What is the tens digit of j? 2 Let p(m) = -2*m - 3. Let l(n) = n + 1. Let d(q) = 7*l(q) + 4*p(q). What is the units digit of d(-6)? 1 Let h be ((-8)/12)/(4/(-186)). Let f(g) = -2*g + 3. Let t be f(0). Suppose t = 3*q, -3*q + h = 3*p - 2*q. What is the tens digit of p? 1 Suppose 0*t = 2*t + 142. Let c = t + 120. What is the units digit of c? 9 Let q(p) = -7*p**3 - p**2. Let t be q(-1). Let l = t + -1. Suppose 0 = 2*n + l*i - 42, -3*i = -4*i. What is the units digit of n? 1 Let v(g) = 2*g**3 + 3*g**2 - 9*g + 6. Let f be v(5). Let s = f - 112. What is the tens digit of s? 7 Let r = 88 + -86. Suppose 2*x - r*b = 3*b + 191, 0 = -5*x - 3*b + 462. What is the tens digit of x? 9 What is the units digit of -3*2/(-3) + 981? 3 Let d(m) = -5*m**3 - 2*m**2 - 3*m. Let t be d(-3). Suppose -57 = r - 121. What is the tens digit of (r/48)/(4/t)? 4 Let z = -12 + 17. Suppose -z*h - 140 = 5*b, 0 = -b - 5*h + 4 - 12. What is the units digit of 0 + 3 - b - -3? 9 Suppose -o - b - 9 = 0, 3*o + 30 = -4*b + 1. Let z(t) = -t**3 - t**2 + 5*t. What is the hundreds digit of z(o)? 2 What is the units digit of (17517/33)/1 - 14/(-77)? 1 Let u = -47 + 107. Suppose 99 = -4*c - v, 2*v = 3*c - 2*v + u. Let o = c - -84. What is the tens digit of o? 6 What is the hundreds digit of ((-8)/18)/(14/(-10521))? 3 Suppose -3*t + 3127 = 2*z - 642, 5 = z. What is the tens digit of t? 5 Let w(o) = 5*o**2 - 8*o - 14. What is the tens digit of w(-4)? 9 Let u(s) = -24*s + 386. What is the tens digit of u(-37)? 7 Let u = 43 + -40. What is the tens digit of ((-9)/2)/(u/(-30)) - 2? 4 Suppose 12 = -44*a + 47*a, -5*q + 7423 = -3*a. What is the hundreds digit of q? 4 Let x = -2577 - -4427. What is the tens digit of x? 5 What is the thousands digit of 4240*2/20*(-13 - -17)? 1 Suppose -4*q + 467 = 55. What is the tens digit of q? 0 Let o(i) = 22*i - 15. Let s be o(12). What is the hundreds digit of s - (-5 - 4/(-4))? 2 Suppose 23 = 5*x - 107. Suppose 5*m + 6 - x = 0. Suppose -s - m = -q - 9, -s - 10 = -4*q. What is the tens digit of s? 1 Suppose 0 = -2*t - 4*f + 6*f + 928, 5*f - 10 = 0. What is the tens digit of t? 6 Let y(c) = -c**3 + 1. Let n(j) = -j**3 - 12*j**2 + 2*j + 2. Let p(u) = n(u) - 2*y(u). What is the tens digit of p(12)? 2 Let n(s) = s**2 + 8*s + 10. Let h be n(-7). Suppose -5*d = -h*d - 138. What is the units digit of d? 9 Let w be 9/3 - (1 - 2). Let d be (10/w)/1*2. Let l(t) = t**3 - 5*t**2 + 2*t - 4. What is the units digit of l(d)? 6 What is the hundreds digit of (3822/(-245))/(3/(-710))? 6 Let l = 2538 - 627. What is the units digit of l? 1 Suppose 4*m - 5*c + 2 + 3 = 0, c - 1 = -m. Suppose 6*y - 648 = -m*y. What is the tens digit of y? 0 Let j = -434 + 226. Let u = 354 + j. What is the units digit of u? 6 Suppose 95932 = -11*x + 40*x. What is the hundreds digit of x? 3 Let x(n) = 62*n**2 + 21*n + 67. What is the units digit of x(-4)? 5 Suppose -11768 = 105*l - 109*l. What is the tens digit of l? 4 Let u be ((-4)/10)/((-2)/30). Suppose -29*v + 15*v = 0. Suppose v*o = -u*o + 84. What is the tens digit of o? 1 Let t = 115 + -98. Let q = t + 157. What is the tens digit of q? 7 Let c be ((-6)/10)/(26/(-5) - -5). Suppose -p + 5*s + 71 = 0, s + 259 = 2*p + c*p. What is the tens digit of p? 5 Suppose -5*h = -4*d - 4064, 4*h - 4*d - 3247 = -5*d. What is the hundreds digit of h? 8 Let z(c) = c**3 + 9*c**2 + 5*c - 4. Let h be z(-4). Let f = -40 - -10. Let k = h + f. What is the units digit of k? 6 Let d(x) = 86*x - 296. What is the units digit of d(10)? 4 Let s = 5 + 11. Let q = -28 + s. What is the tens digit of 6*-20*2/q? 2 Let o(x) = x**2 + 3*x - 1. Let k be o(0). Let i(l) = 2*l + 2. Let n be i(k). Suppose n = 2*c + 49 - 147. What is the units digit of c? 9 Let q = 327 + -182. Let g = q + 141. Suppose o = -3*x - 2*o + 186, -o - g = -5*x. What is the tens digit of x? 5 Let f = 756 + -109. Suppose 5*q - f = 578. What is the units digit of q? 5 Let n(l) be the third derivative of 7*l**5/60 - 3*l**4/8 + l**3/3 + 8*l**2. Let w(x) be the first derivative of n(x). What is the units digit of w(4)? 7 What is the tens digit of ((-23)/(184/(-10128)))/((-6)/(-3))? 3 What is the hundreds digit of 9/(243/7065) - 2/(-6)? 2 Let d = -31 - -33. Suppose 0 = q + b - 6, -8*q = -3*q - 3*b - 6. Suppose 6*c - 3*c - 73 = -d*f, q*c = 15. What is the units digit of f? 9 Suppose 0 = -7*z + 3*z + 8. Let l be (9/z)/((-2)/28). Let h = l - -106. What is the tens digit of h? 4 Let l = 220 + -397. Let x = -124 - l. Suppose 4*u - 49 = -t - u, 2*t + u = x. What is the units digit of t? 4 Let g = -105 - -79. Suppose -5*w + 2*n = 281, -5*w + 3*n = -n + 277. Let d = g - w. What is the units digit of d? 1 Let o = -86 - -89. Let x(h) = 17*h**2 - 2*h + 9. What is the hundreds digit of x(o)? 1 Let o be (-1 + (-33)/(-15))/(9/30). Suppose o*y + f - 289 = y, -210 = -2*y - 5*f. What is the tens digit of y? 9 Let u = -276 + 723. What is the hundreds digit of u? 4 Let t = 293 + -251. What is the tens digit of t? 4 What is the hundreds digit of (-50796)/(-30) - (-4)/(-20)? 6 Let i(s) be the third derivative of 0 + 1/3*s**4 + 0*s + 6*s**2 - 7/3*s**3 + 1/60*s**5. What is the tens digit of i(-12)? 3 Let r(u) = -17*u - 1. Let z be r(-1). Suppose -175*c + 179*c = 16. Suppose -4*d - c = -z. What is the units digit of d? 3 What is the hundreds digit of (7/28)/((-1)/5444)*-1? 3 What is the hundreds digit of (-1389730)/(-744) + 1/12? 8 Let l(d) = 15*d - 17 + 12*d**2 - 27*d - 8*d**2. What is the tens digit of l(8)? 4 Let j = 19 - 18. Let m be (-1 + 4 + j)*1. Let f(p) = p**3 - p**2 + 4*p - 5. What is the tens digit of f(m)? 5 Let o be (9 + -8)/(1/5). Suppose -o*m + 12 = -m. Suppose -4*l + 59 + 136 = m*c, -4*l + 201 = c. What is the units digit of l? 1 Let a(s) = s**2 + 5*s + 6. Let v be a(-4). What is the units digit of (-10)/v*1 + 177? 2 Suppose 0 = 4*u - 4, 2*p + 105 = u - 2 | Low | [
0.512820512820512,
25,
23.75
]
|
The invention relates to a two-port cartridge type seat valve. For approximately thirty years, two-port cartridge valves have been widely used in hydraulic control technology as pressure-control, directional or check valves. Such cartridge valves are described in detail, for example, in the article "Cartridge check valves: New option for hydraulic control" by David C. Downs, in "Machine Design", Vol. 52, No. 28, of 11th Dec., 1980, Cleveland USA, pages 143-147. A positive-seating, two-port cartridge valve is likewise described in German Offenlegungsschrift DE-A-36 19 927. Such two-port cartridge valves are used in a manifold that has a stepped bore and first and second main flow channels. The stepped bore has a first bore step that is connected to the first main flow channel and a second bore step, with a larger diameter than the first bore step, that is connected to the second main flow channel. The typical two-port cartridge type seat valve includes a valve sleeve that is inserted into the stepped bore, a poppet fitted in the sleeve for sliding axial displacement, a closure spring that biases the poppet into sealing engagement with a valve seat in the valve sleeve, and a valve cover. The valve sleeve has first and second ends, with a first cross-sectional portion at the first end that sealingly fits axially into the first bore step, and a second cross-sectional portion that sealingly fits axially into the second bore step. A central cross-sectional portion between the first and second cross-sectional portion defines an annular chamber within the second bore step, into which the second main flow channel opens when the valve sleeve is inserted into the stepped bore. The sleeve also has an axial main flow bore that forms a first main port in the first end of the valve sleeve and lateral second main ports in the central cross-sectional portion for connecting the main flow bore with the annular chamber. The valve seat is disposed in the main flow bore between the first and said second main ports. The poppet has first and second ends, with the first end having a closure cone that sealingly engages the valve seat in the valve sleeve. The poppet is biased closed by the closure spring. To make the two-port cartridge valves interchangeable, the diameters and depths of the stepped bore, the position of the lateral second main flow channel in the manifold, and the dimensions of the valve cover and the position of its fastening screws and pilot connections, are set out in standards for the different nominal valve sizes. In Germany, for example, the relevant standard is DIN 24342. As a result, the external shape of the valve sleeve is substantially predetermined and the person skilled in the art has little scope for adapting the valve to different functions. Known valves have a cylindrical guide bore that extends from the valve seat axially through the valve sleeve to the second end of the valve sleeve. The poppet is fitted in the guide bore for axial displacement in the valve sleeve. Within the guide bore, a pilot chamber is defined axially by the second end of the poppet. The second end of the poppet accordingly forms a pilot pressure area, S.sub.X, equal to the cross-sectional area of the guide bore. The maximum possible cross-section of the guide bore is dictated by the minimum necessary wall thickness of the valve sleeve in its central cross-sectional portion and the necessary free cross-section of the annular chamber in the region of the second main port. Accordingly, the maximum possible pilot area S.sub.X, the maximum possible cross-section of the poppet, and therefore the maximum possible free cross-section S.sub.A of the valve seat are also fixed. The free cross-section S.sub.A of the valve seat must, of course, be smaller than the cross-section of the poppet's closure cone which, in turn, cannot be larger than the cross-section of the guide bore. Such two-port cartridge valves with a maximum free cross-section S.sub.A for the valve seat are used as pressure-control valves. In this application the valves should have a maximum flow capacity. Therefore, the pilot area S.sub.X (which is fixed by the cross-section of the guide bore) is preferably approximately equal to the free cross-section S.sub.A of the valve seat. However, two-port cartridge valves can also be used as pilot-controlled two/two-port directional valves for switching applications. For such applications, the maximum free cross-section SA of the valve seat is reduced by about 35% to 50%, to reduce the hydrostatic force acting on the poppet in the opening direction, rendering the switching behavior of the valve as much as possible independent of pressure fluctuations in the first main flow port. Consequently, the flow capacity of the valve is reduced by about 35% to 50%, or the valve produces a greater pressure loss. There is thus a need for a two-port cartridge valve that provides a switching function with a high flow capacity. | Mid | [
0.546875,
30.625,
25.375
]
|
--- abstract: 'By an additive action on an algebraic variety $X$ we mean a regular effective action $\mathbb{G}_a^n\times X\to X$ with an open orbit of the commutative unipotent group $\mathbb{G}_a^n$. In this paper, we give a classification of additive actions on complete toric surfaces.' address: 'Lomonosov Moscow State University, Faculty of Mechanics and Mathematics, Department of Higher Algebra, Leninskie Gory 1, Moscow, 119991 Russia' author: - Sergey Dzhunusov title: Additive actions on complete toric surfaces --- [^1] Introduction ============ Let $X$ be an irreducible algebraic variety of dimension $n$ over an algebraically closed field $\K$ of characteristic zero and $\Ga=(\K,+)$ be the additive group of the ground field. Consider the commutative unipotent group $\Ga^n=\Ga\times\ldots\times\Ga$ ($n$ times). By an additive action on $X$ we mean an effective regular action $\Ga^n\times X\to X$ with an open orbit. In other words, an additive action on a complete variety $X$ allows to consider $X$ as a completion of the affine space $\A^n$ that is equivariant with respect to the group of parallel translations on $\A^n$. The study of additive actions began with the work of Hassett and Tschinkel [@HT]. They introduced a correspondence between additive actions on the projective space $\P^n$ and local $(n+1)$-dimensional commutative associative algebras with unit; see also [@KL Proposition 5.1] for a more general correspondence. Hassett-Tshinkel’s correspondence makes it possible to classify additive actions on $\P^n$ for $n \leq 5$; these are precisely the cases when the number of additive actions is finite. The study of additive actions was originally motivated by problems of arithmetic geometry. Chambert-Loir and Tschinkel [@CLT1; @CLT2] gave asymptotic formulas for the number of rational points of bounded height on smooth (partial) equivariant compactifications of the vector group. There is a number of results on additive actions on flag varieties [@A1; @Fe; @FH; @Dev], singular del Pezzo surfaces [@DL], Hirzebruch surfaces [@HT] and weighted projective planes [@ABZ]. This work concerns the case of toric varieties. The problem of classification of additive actions on toric varieties is raised in [@AS Section 6]. It is proved in [@De] that $\Ga$-actions on a toric variety $X_{\Sigma}$ normalized by the acting torus $T$ are in bijection with some elements $e \in M$, where $M$ is the character lattice of torus $T$. These vectors are called Demazure roots of the corresponding fan $\Sigma$. Cox [@Cox] observed that normalized $\Ga$-actions on a toric variety can be interpreted as certain $\Ga$-subgroups of automorphisms of the Cox ring $R(X)$ of the variety $X$. In turn, such subgroups correspond to homogeneous locally nilpotent derivations of the Cox ring. In [@AR] all toric varieties admitting an additive action are described. It turns out that if a complete toric variety $X$ admits an additive action, then it admits an additive action normalized by the acting torus. Moreover, any two normalized additive actions on $X$ are isomorphic. This work solves the problem of classification of additive actions for a complete toric surface. It was known in particular cases of the projective plane [@HT Proposition 3.2], Hirzebruch surfaces [@HT Proposition 5.5] and some weighted projective planes [@ABZ Proposition 7] that these surfaces admit exactly two non-isomorphic additive actions, the normalized and the non-normalized ones. In Theorem \[main\], we prove that any complete toric surface admits at most two non-isomorphic additive actions and characterize the fans of surfaces that admit precisely two additive actions. After presenting some preliminaries on toric varieties and Cox ring (Section \[coxring\]) and $\Ga$-actions and Demazure roots (Section \[intrga\]), we describe the results of [@AR] (Section \[intrbas\]). In Section \[draa\], we prove some facts about Demazure roots of a toric variety admitting an additive action. In Section \[mainsection\], we formulate and prove the main theorem of this work. In Section \[example\], we give several explicit examples of additive actions on toric surfaces in Cox ring coordinates and discuss the further research. The author is grateful to his supervisor Ivan Arzhantsev for posing the problem and permanent support and to Yulia Zaitseva for useful discussions and comments. Toric varieties and Cox rings {#coxring} ============================= In this section we introduce basic notation of toric geometry, see [@Fu; @CLS] for details. A *toric variety* is a normal variety $X$ containing a torus $T\simeq (\K^*)^n$ as a Zariski open subset such that the action of $T$ on itself extends to an action of $T$ on $X$. Let $M$ be the character lattice of $T$ and $N$ be the lattice of one-parameter subgroups of $T$. Let $\langle \cdot\,, \cdot\rangle: N \times M \to \Z$ be the natural pairing between the lattice N and the lattice M. It extends to the pairing $\langle \cdot\,, \cdot\rangle_{\Q}: N_{\Q} \times M_{\Q} \to \Q$ between the vector spaces $N_{\Q}=N\otimes \Q$ and $M_{\Q}=M\otimes \Q$. A *fan* $\Sigma$ in the vector space $N_{\Q}$ is a finite collection of strongly convex polyhedral cones $\sigma$ such that: 1. For all cones $\sigma \in \Sigma$, each face of $\sigma$ is also in $\Sigma$. 2. For all cones $\sigma_1, \sigma_2 \in \Sigma$, the intersection $\sigma_1 \cap \sigma_2$ is a face of the cones $\sigma_1$ and $\sigma_2$. There is one-to-one correspondence between normal toric varieties $X$ and fans $\Sigma$ in the vector space $N_{\Q}$, see [@CLS Section 3.1] for details. Here we recall basic notions of the Cox construction, see [@ADHL Chapter 1] for more details. Let $X$ be a normal variety. Suppose that the variety $X$ has free finitely generated divisor class group $\operatorname{Cl}(X)$ and there are only constant invertible regular functions on $X$. Denote the group of Weil divisors on $X$ by $\operatorname{WDiv}(X)$ and consider a subgroup $K \subseteq \operatorname{WDiv}(X)$ which maps onto $\operatorname{Cl}(X)$ isomorphically. The *Cox ring* of the variety $X$ is defined as $$R(X)=\bigoplus_{D\in K} H^0(X,D) = \bigoplus_{D\in K}\{f\in\K(X)^{\times}\mid \operatorname{div}(f)+D\geqslant0\}\cup\{0\}$$ and multiplication on homogeneous components coincides with multiplication in the field of rational functions $\K(X)$ and extends to the Cox ring $R(X)$ by linearity. It is easy to see that up to isomorphism the graded ring $R(X)$ does not depend on the choice of the subgroup $K$. Suppose that the Cox ring $R(X)$ is finitely generated. Then ${\overline{X}:=\operatorname{Spec}R(X)}$ is a normal affine variety with an action of the torus $H_X := \operatorname{Spec}\K[\operatorname{Cl}(X)]$. There is an open $H_X$-invariant subset $\widehat{X}\subseteq \overline{X}$ such that the complement $\overline{X}\backslash\widehat{X}$ is of codimension at least two in $\overline{X}$, there exists a good quotient $p_X\colon\widehat{X}\rightarrow\widehat{X}/\!/H_{X}$, and the quotient space $\widehat{X}/\!/H_{X}$ is isomorphic to $X$, see [@ADHL Construction 1.6.3.1]. Thus, we have the following diagram $$\begin{CD} \widehat{X} @>{i}>> \overline{X}=\operatorname{Spec}R(X)\\ @VV{/\!/H_{X}}V \\ X \end{CD}$$ It is proved in [@Cox] that if $X$ is toric, then $R(X)$ is a polynomial algebra $\K[x_1,\ldots,x_m]$, where the variables $x_i$ correspond to $T$-invariant prime divisors $D_i$ on $X$ or, equivalently, to the rays $\rho_i$ of the corresponding fan $\Sigma$. The $\operatorname{Cl}(X)$-grading on $R(X)$ is given by $\deg(x_i)=[D_i]$. In this case, $\overline{X}$ is isomorphic to $\K^m$, and $\overline{X}\setminus\widehat{X}$ is a union of some coordinate subspaces in $\K^m$ of codimension at least two. Denote by $\mathbb T$ the torus $(\K^{*})^m$ acting on the variety $\overline{X}$. Each $w \in M$ gives a character $\chi^w : T \to \K^{*}$, and hence $\chi^w$ is a rational function on $X$. By [@CLS Theorem 4.1.3], the function $\chi^w$ defines the principal divisor ${\operatorname{div}}(\chi^w) = - \sum_{\rho} \langle w,u_\rho\rangle D_\rho$. Let us consider the map $M \longrightarrow \Z^{m} $ defined by $w \mapsto (\langle w,u_{\rho_1}\rangle, \ldots, \langle w,u_{\rho_m}\rangle)$, where $\rho_1, \ldots, \rho_m$ are one-dimensional cones of $\Sigma$. We identify the group $\Z^m$ with the character lattice of the torus $(\K^*)^m$. Thus, every element $w \in M$ corresponds to the character $\overline{\chi}^w$ of the torus $\mathbb T$. Moreover, for any $w, w' \in M$ the equality $w = w'$ holds if and only if $\overline{\chi}^w =\overline{\chi}^{w'}$. Demazure roots and locally nilpotent derivations {#intrga} ================================================ Let $X_{\Sigma}$ be a toric variety of dimension $n$ and $\Sigma$ be the fan of the variety $X_{\Sigma}$. Let $\Sigma(1)=\{\rho_1, \ldots, \rho_m\}$ in $N$ be the set of rays of the fan $\Sigma$ and $p_i$ be the primitive lattice vector on the ray $\rho_i$. For any ray $\rho_i\in \Sigma(1)$ we consider the set $\mathfrak R_i$ of all vectors $e \in M$ such that 1. $\langle p_i, e\rangle=-1$ and $\langle p_j, e \rangle \geq 0$ for $j \neq i$, $1 \leq j \leq n$; 2. if $\sigma$ is a cone of $\Sigma$ and $\langle v, e \rangle=0$ for all $v \in \sigma$, then the cone generated by $\sigma$ and $\rho_i$ is in $\Sigma$ as well. Elements of the set $\mathfrak R = \bigcup\limits_{i=1}^m \mathfrak R_i$ are called *Demazure roots* of the fan $\Sigma$ (see [@De Section 3.1] or [@Oda Section 3.4]). Let us divide the roots $\mathfrak R$ into two classes: $$\begin{array}{ccc} \mathfrak S = \mathfrak R \cap -\mathfrak R &,\quad& \mathfrak U = \mathfrak R \setminus \mathfrak S. \end{array}$$ Roots in $\mathfrak{S}$ and $\mathfrak{U}$ are called *semisimple* and *unipotent* respectively. A derivation $\partial$ of an algebra $A$ is said to be *locally nilpotent* (LND) if for every $f\in A$ there exists $k\in\N$ such that $\partial^k(f)=0$. For any LND $\partial$ on $A$ the map ${\varphi_{\partial}:\Ga\times A\rightarrow A}$, ${\varphi_{\partial}(s,f)=\exp(s\partial)(f)}$, defines a structure of a rational $\Ga$-algebra on $A$. A derivation $\partial$ on a graded ring $A = \bigoplus\limits_{\omega \in K} A_{\omega}$ is said to be *homogeneous* if it respects the $K$-grading. If ${f,h\in A\backslash \operatorname{ker}\partial}$ are homogeneous, then ${\partial(fh)=f\partial(h)+\partial(f)h}$ is homogeneous too and ${\deg\partial(f)-\deg f=\deg\partial(h)-\deg h}$. So any homogeneous derivation $\partial$ has a well-defined *degree* given as $\deg\partial=\deg\partial(f)-\deg f$ for any homogeneous $f\in A\backslash \operatorname{ker}\partial$. Every locally nilpotent derivation of degree zero on the Cox ring $R(X_{\Sigma})$ induces a regular action $\Ga\times X_{\Sigma}\to X_{\Sigma}$. In fact, any regular $\Ga$-action on $X_{\Sigma}$ arises this way, see [@Cox Section 4] and [@ADHL Theorem 4.2.3.2]. If a $\Ga$-action on a variety $X_{\Sigma}$ is normalized by the acting torus $T$, then the lifted $\Ga$-action on $\overline{X}_{\Sigma}=\K^m$ is normalized by the diagonal torus $\overline{T} = (\K^{*})^m$. Conversely, any $\Ga$-action on $\K^m$ normalized by the torus $(\K^{\times})^m$ and commuting with the subtorus $H_{X_{\Sigma}}$ induces a $\Ga$-action on $X_{\Sigma}$. This shows that $\Ga$-actions on $X_{\Sigma}$ normalized by $T$ are in bijection with locally nilpotent derivations of the Cox ring $\K[x_1,\ldots,x_m]$ that are homogeneous with respect to the standard grading by the lattice $\Z^m$ and have degree zero with respect to the $\operatorname{Cl}(X_{\Sigma})$-grading. For any element $e\in \mathfrak R_i$ we consider a locally nilpotent derivation $\prod\limits_{j \neq i}x_{j}^{\langle p_j, e \rangle}\frac{\partial}{\partial x_i}$ on the algebra $R(X_{\Sigma})$. This derivation has degree zero with respect to the grading by the group $\operatorname{Cl}(X_{\Sigma})$. This way one obtains a bijection between the Demazure roots in $\mathfrak R$ and locally nilpotent derivations of degree zero on the ring $R(X_{\Sigma})$, which in turn are in bijection with $\Ga$-actions on $X_{\Sigma}$ normalized by the acting torus. \[lndconj\] Let $D_e$ be a homogeneous LND that corresponds to the Demazure root $e\in M$ and $t$ be an element of maximal torus $\mathbb{T}$. Then, $$tD_et^{-1} = \overline{\chi}^e(t)D_e.$$ By definition, the derivation $D_e$ is equal to $\prod\limits_{j\neq i} x_j^{\langle p_j, e \rangle}\frac{\partial}{\partial x_i}$. Let us consider the image $tD_et^{-1}(x_i)$ of an element $x_i$. It is equal to $t_i^{-1}\prod\limits_{j\neq i} t_j^{\langle p_j, e \rangle}\prod\limits_{j\neq i} x_j^{\langle p_j, e \rangle}$. Thus, we get $$tD_et^{-1}=t_i^{-1}\prod\limits_{j\neq i} t_j^{\langle p_j, e \rangle} D_e = \prod\limits_{j=1}^m t_j^{\langle p_j, e \rangle}D_e = \overline{\chi}^e(t)D_e.$$ Complete toric varieties admitting an additive action {#intrbas} ===================================================== In this section, we shortly present the results of [@AR]. Let $X_{\Sigma}$ be a toric variety of dimension $n$ admitting an additive action and $\Sigma$ be the fan of the variety $X_{\Sigma}$. Denote primitive vectors on the rays of the fan $\Sigma$ by $p_i$, where $1 \leq i \leq m$. \[deff\] A set $e_1,\ldots,e_n$ of Demazure roots of a fan $\Sigma$ of dimension $n$ is called a [*complete collection*]{} if $\langle p_i,e_j\rangle=-\delta_{ij}$ for all $1\le i,j\le n$ for some ordering of $p_1, \ldots, p_m$. An additive action on a toric variety $X_{\Sigma}$ is said to be *normalized* if the image of the group $\Ga^n$ in $\operatorname{Aut}(X_{\Sigma})$ is normalized by the acting torus. [[@AR Theorem 1]]{} \[cc\] Let $X_{\Sigma}$ be a toric variety. Then normalized additive actions on $X_{\Sigma}$ normalized are in bijection with complete collections of Demazure roots of the fan $\Sigma$. A toric variety $X_{\Sigma}$ admits a normalized additive action if and only if there is a complete collection of Demazure roots of the fan $\Sigma$. [[@AR Theorem 3]]{}\[3con\] Let $X_{\Sigma}$ be a complete toric variety with an acting torus $T$. The following conditions are equivalent. - There exists an additive action on $X_{\Sigma}$. - There exists a normalized additive action on $X_{\Sigma}$. Here we prove a proposition that will be used below. The *negative octant* of the rational vector space $V$ with respect to a basis $f_1, \ldots, f_n$ is the cone $\left\{\sum\limits_{i=1}^n \lambda_i f_i \mid \lambda_i \leq 0\right\} \subset V$. \[ort\] Let $X_{\Sigma}$ be a complete toric variety. The following statements are equivalent. 1. There is a complete collection of Demazure roots of the fan $\Sigma$. 2. We can order rays of the fan $\Sigma$ in such a way that the primitive vectors on the first $n$ rays form a basis of the lattice $N$ and the remaining rays lie in the negative octant with respect to this basis. 3. There exists an additive action on $X_{\Sigma}$. Let us prove implication $(1) \Rightarrow (2)$. Assume that the vectors $p_1, \ldots, p_n$ are linearly dependent, i.e. there exists a non-trivial linear relation ${\alpha_1p_1+\ldots+\alpha_np_n=0}$. Then we get $-\alpha_i = {\langle \alpha_1p_1+\ldots+ \alpha_np_n, e_i \rangle}=0$ for all $1 \leq i \leq n$, a contradiction. Consider an arbitrary vector $v=\sum_{i=1}^n\nu_ip_i$ of the lattice $N$. By definition of a complete collection, we get $\langle v, e_i \rangle = -\nu_i \in \Z$. Therefore, the vectors $p_1, \ldots, p_n$ form the basis of the lattice $N$. All other vectors $p_j,\, j>m,$ are equal to $-\sum_{l=1}^n\alpha_{jl}p_l$ for some integer $\alpha_{jl}$. By definition of a Demazure root, we obtain $$0 \leq \langle p_j, e_i \rangle = \sum \alpha_{jl}\delta_{li}=\alpha_{ji}.$$ The converse implication is straightforward. Equivalence $(1) \Leftrightarrow (3)$ follows from Theorems \[cc\] and \[3con\]. Demazure roots of a variety admitting an additive action {#draa} ======================================================== Let $X_{\Sigma}$ be a complete toric variety of dimension $n$ admitting an additive action and $\Sigma$ be the fan of the variety $X_{\Sigma}$. Denote primitive vectors on the rays of the fan $\Sigma$ by $p_i$, where $1 \leq i \leq m$. From Proposition \[ort\] it follows that we can order $p_i$ in such a way that the first $n$ vectors form a basis of the lattice $N$ and the remaining vectors $p_j$ $(n < j \leq m)$ are equal to $\sum_{i=1}^n-\alpha_{ji} p_i$ for some non-negative integers $\alpha_{ji}$. Let us denote the dual basis of the basis $p_1, \ldots, p_n$ by $p_1^*,\,\ldots, p_n^*$. \[firstroot\] Consider $1\leq i\leq n$. The set ${\mathfrak R}_i$ is a subset of the set ${-p_i^* + \sum\limits_{l=1,l\neq i}^n\Z_{\geq 0}p_j^*}$ and the vector $-p_i^*$ is a Demazure root from the set ${\mathfrak R}_i$. Let $e=\sum\limits_{i=1}^n\epsilon_ip_i^*$ be a Demazure root from ${\mathfrak R}_i$. By the definition, the Demazure roots from $\mathfrak R_i$ are defined by the following equations: $$ \begin{array}{cccc} \epsilon_i = -1&\\ \epsilon_l \geq 0, &l \leq n,\, l \neq i\\ \alpha_{ji}-\sum\limits_{\substack{l=1\\ l\neq i}}^n \epsilon_l\alpha_{jl} \geq 0,& n < j \leq m \end{array}$$ It is clear that all possible solutions lie in the set ${-p_i^* + \sum\limits_{\substack{l=1\\l\neq i}}^n\Z_{\geq 0}p_l^*}$, and the vector $-p_i^*$ satisfies them. Consider the set $\operatorname{Reg}(\mathfrak S) =\{u \in N : \langle u, e \rangle \neq 0 \text{ for all } e \in \mathfrak S\}$. Any element $u$ from $\operatorname{Reg}(\mathfrak S)$ divides the set of semisimple roots $\mathfrak S$ into two classes as follows: $${\mathfrak S_{u}^+ =\{e \in \mathfrak S: \langle u, e\rangle > 0\}},\quad {\mathfrak S_{u}^- =\{e \in \mathfrak S: \langle u, e\rangle < 0\}}.$$ At this point, any element of ${\mathfrak S_{u}}^+$ is called *positive* and any element of $\mathfrak S_{u}^-$ is called *negative*. \[selective\] Let $X_{\Sigma}$ be a complete toric variety admitting an additive action, and ${\mathfrak R = \bigcup_{i=1}^{m} \mathfrak R_i}$ be the set of its Demazure roots. Then 1. any element $e \in \mathfrak R_j, j > n$, is equal to $p_{i_j}^*$ for some $1 \leq i_j\leq n$; 2. all unipotent Demazure roots lie in the set $\bigcup_{i=1}^{n}\mathfrak R_i$; 3. there exists a vector $u\in \operatorname{Reg}(\mathfrak S)$ such that $\mathfrak S_{u}^+ \subset \mathfrak \bigcup_{i=1}^n \mathfrak R_i$. We start with the first statement. Consider a root ${e =\sum\limits_{i=1}^n \epsilon_i p_i^* \in \mathfrak R_j}$, where $j>n$. By definition of Demazure roots, we have $-\langle p_j, e\rangle=\sum\limits_{i=1}^n\alpha_{ji}\epsilon_i=1$ and $\epsilon_i \geq 0$ for all $1\leq i\leq n$. Consider the set ${I_j = \{i : \alpha_{ji} > 0\}}$. Then there exists $s \in I_j$ such that $\epsilon_s=1$ and for all $l \in I_j \setminus \{s\}$ the equality $\epsilon_l=0$ holds. Since $X_{\Sigma}$ is complete, there is no half-space with all vectors $p_i$ inside. Hence, for all $l \in \{1, \ldots, n\} \setminus I_j$ there exists $r > n$ such that $\alpha_{rl} > 0$. Since $\langle p_r, e\rangle = -\sum\limits_{i=1}^n\alpha_{ri}\epsilon_i \geq 0$, we have $\epsilon_l=0$. This implies $e=p_s^*$. The first statement is proved. Let us prove the second statement. As above, consider the root ${e = p_{i_j}^* \in \mathfrak R_j}$, $j>n$. From the first statement of Proposition \[selective\] and Lemma \[firstroot\] it follows that the element $-e$ is a root and lies in $\mathfrak R_{i_j}$ for some $i_j$. This means that the root $e$ is semisimple. Hence, all unipotent roots lie in the set $\bigcup_{i=1}^n \mathfrak R_i$. To prove (3), we should find a vector $u$ from the set $\operatorname{Reg}(\mathfrak S)$ such that the set $\bigcup_{j=n+1}^m\mathfrak R_j$ contains only negative roots. Consider the vector $u_0 = -\sum\limits_{i=1}^n p_i$. For every root $e\in \bigcup_{j=n+1}^m\mathfrak R_j$, we get the inequality $\langle u_0, e \rangle = -1 < 0$. We can add a small rational vector $\Delta u = \frac{1}{Q}\Delta u' \in N_{\Q}$, where $\Delta u' \in N$ and $Q$ is a positive integer such that the inequality $\langle u_0+\Delta u, e\rangle_{\Q} <0$ holds for all roots $e \in \bigcup_{i=n+1}^m \mathfrak R_i$. So, we have $Q(u_0+\Delta u) \in \operatorname{Reg}(\mathfrak S)$, and we obtain the required vector $u:=Q(u_0+\Delta u)$. Main results {#mainsection} ============ [i]{}[0.22]{} (90,90) (50,50)[(1,0)[40]{}]{} (50,50)[(0,1)[40]{}]{} (0,0)(25,25)(50,50) (50,50)[(0,-1)[45]{}]{} (85,55)[$p_1$]{} (55,85)[$p_2$]{} (50,50)[(-1,0)[45]{}]{} (50,50)[(-3,-1)[50]{}]{} (50,50)[(-1,-3)[20]{}]{} (17,33)[$A_{I}$]{} (32,18)[$A_{II}$]{} We consider a complete toric surface $X_{\Sigma}$ with the fan $\Sigma$ admitting an additive action. Denote primitive vectors of the rays of the fan $\Sigma$ by $p_1, \ldots, p_m$. We assume that $p_1, p_2$ is the standard basis of $N_{\Q}$. \[defwide\] Let us call a fan $\Sigma$ *wide* if it satisfies one of the following equivalent conditions: 1. There exist $2 < i_1, i_2 \leq m$ such that ${a_{i_11} > a_{i_12}}$ and ${a_{i_21} < a_{i_22}}$; 2. $\mathfrak R_1 = \{-p_1^*\}$ and $\mathfrak R_2=\{-p_2^*\}$. From the definition of Demazure roots it follows that $$\mathfrak{R}_1 = \left\{(-1, k) : 0 \leq k \leq \min_{j>2}\left(\frac{\alpha_{j1}}{\alpha_{j2}}\right)\right\}, \quad \mathfrak{R}_2 = \left\{(k, -1) : 0 \leq k \leq \min_{j>2}\left(\frac{\alpha_{j2}}{\alpha_{j1}}\right)\right\}.$$ From this it follows that $|\mathfrak{R}_1| =\left\lfloor \min\limits_{j>2}\left(\dfrac{\alpha_{j1}}{\alpha_{j2}}\right) \right\rfloor+ 1$, $|\mathfrak{R}_2| = \left\lfloor\min\limits_{j>2}\left(\dfrac{\alpha_{j2}}{\alpha_{j1}}\right)\right\rfloor + 1$. This implies the equivalence. Let us consider two areas in $N_{\Q}$: $${A_{I} = \{(x, y) \in M_{\Q} : x \leq 0, y \leq 0, x < y\}},$$ $${A_{II} = \{(x, y) \in M_{\Q} : x \leq 0, y \leq 0, x > y\}}.$$ The first condition from the definition of a wide fan means that there is a ray of $\Sigma$ in the area $A_{I}$ and there is a ray in the area $A_{II}$. Now we are ready to formulate the main theorem. \[main\] Let $X_{\Sigma}$ be a complete toric surface admitting an additive action. Then there is only one additive action on $X_{\Sigma}$ if and only if the fan $\Sigma$ is wide; otherwise there exist two non-isomorphic additive actions, one is normalized and the other is not. We are going to classify additive actions on $X_{\Sigma}$ by describing two-dimensional subgroups of a maximal unipotent subgroup $U$ of the automorphism group $\operatorname{Aut}(X_{\Sigma})$ up to conjugation in $\operatorname{Aut}(X_{\Sigma})$. Fix a vector $u \in \operatorname{Reg}(\mathfrak S)$ that satisfies assertion (3) of Proposition \[selective\]. Hereafter we write $\mathfrak S^+$ instead of $\mathfrak S^+_{u}$. Denote the set $\mathfrak S^+ \cup \mathfrak U$ by $\mathfrak R^+$. From Proposition \[selective\] it follows that $\mathfrak R^+$ lies in the set $\bigcup_{i=1}^n\mathfrak R_i$. All the one-parameter subgroups of roots from $\mathfrak R^+$ generate the maximal unipotent subgroup $U$ in the group $\operatorname{Aut}(X_{\Sigma})$, see [@Cox Proposition 4.3]. Denote the set ${\mathfrak R^+ \cap \mathfrak R_i}$ by $\mathfrak R^+_i$. There exists $i\in \{1, 2\}$ such that $|\mathfrak R^+_i|=1$. Moreover, $\max_{i=1,2}|\mathfrak R_i^+|=\max_{i=1,2}|\mathfrak R_i|$. From the definition of Demazure roots it follows that $$\mathfrak{R}_1 = \left\{(-1, k) : 0 \leq k \leq \min_{j>2}\left(\frac{\alpha_{j1}}{\alpha_{j2}}\right)\right\}, \quad \mathfrak{R}_2 = \left\{(k, -1) : 0 \leq k \leq \min_{j>2}\left(\frac{\alpha_{j2}}{\alpha_{j1}}\right)\right\}.$$ We have $|\mathfrak R_1|>1, |\mathfrak R_2|>1$ simultaneously if and only if $$\begin{gathered} {\mathfrak R}_1 = \{(-1, 0), (-1, 1) \}\\ {\mathfrak R}_2 = \{(0, -1), (1, -1)\}. \end{gathered}$$ Since the roots $(-1, 1), (1, -1)$ are opposite to each other, only one of them can lie in $\mathfrak R^+$. Only the roots $(-1, 1), (1, -1)$ can lie in the set $(\mathfrak R_1 \cap -\mathfrak R_2) \cup (\mathfrak R_2 \cap -\mathfrak R_1)$. Thus, we have $|\mathfrak R_1^+|=1$, $\mathfrak R_2^+=\mathfrak R_2$ or $|\mathfrak R_2^+|=1$, $\mathfrak R_1^+=\mathfrak R_1$. Without loss of generality, it can be assumed that $|\mathfrak R^+_1|=1$. Denote the cardinality of the set $\mathfrak R^+_2$ by $d+1$. By Definition \[defwide\] the fan is wide if and only if $d$ is equal to $0$. In there term we have $\mathfrak R_1^+ = \{(-1, 0)\}$ and $\mathfrak R_2^+ = \{(k, -1) : 0 \leq k \leq d\}$. Denote LND that corresponds to the root $(-1, 0) \in \mathfrak R_1^+$ by $\delta$, and LNDs that correspond to roots $(k, -1) \in \mathfrak R^+_2, 0 \leq k \leq d$ by $\partial_k$. \[Lie\] The following equations hold: $$[\delta, \partial_k] = k \partial_{k-1}, \quad\quad [\partial_k, \partial_{k'}]=0.$$ In this proof we use notation introduced in Section \[coxring\]. The correspondence between Demazure roots and LNDs implies: $$\delta=\prod\limits_{j=3}^m x_j^{\alpha_{j1}}\frac{\partial}{\partial x_1}, \quad \partial_k=x_1^k\prod\limits_{j=3}^mx_j^{\alpha_{j2}-k\alpha_{j1}}\frac{\partial}{\partial x_2}\\$$ It can be easily checked that the derivations $\partial_k$ commute with each other. Moreover, direct computations show that the commutator $[\delta, \partial_k]$ is equal to the derivation $k\partial_{k-1}$. Let us find all commutative subgroups in the group $U$ that correspond to additive actions. Such groups are in bijection with some pairs $(D_1, D_2)$ of commuting LNDs. Note that not every pair of commuting LNDs corresponds to an additive action. \[sumform\] In the above terms there is an invertible linear operator $\phi$ on the vector space $\langle D_1, D_2\rangle$ that sends the derivations $D_1, D_2$ to $$\label{sum} \begin{cases} \phi(D_1)=\delta + \sum\limits_{k=0}^d\mu_k\partial_k\\ \phi(D_2)=\partial_0 \end{cases} ,\quad\quad \mu_k \in \K$$ Every pair of derivations has the form $D_1 = \lambda^{(1)}\delta+\sum \mu_k^{(1)}\partial_k$ and $ D_2 = \lambda^{(2)}\delta+\sum \mu_k^{(2)}\partial_k$. If $\lambda^{(1)}=\lambda^{(2)}=0$ then dimension of the orbit in the total space $X_{\Sigma}$ is less than 2 and the orbit can not become open after the factorization $\widehat{X_{\Sigma}} \to X_{\Sigma}$. Thus, without loss of generality we can assume that $\lambda^{(1)}\neq 0$. We can convert derivations $D_1, D_2$ to the form $\delta+\sum \mu_k^{(1)}\partial_k, \sum \mu_k^{(2)}\partial_k$. From Lemma \[Lie\] it follows that the derivations $D_1, D_2$ commute if and only if $\mu_k^{(2)}=0$ for $k>0$. Thus, we can convert derivations $D_1, D_2$ to the form $\delta+\sum \mu_k^{(1)}\partial_k, \mu_0^{(2)}\partial_0$, with $\mu_0^{(2)}\neq 0$. We can assume that $\mu_0^{(2)}=1$. \[cor\] Every pair of derivations of form corresponds to an additive action. Let us consider the $\Ga^2$-action corresponding to the LNDs $D_1, D_2$. We prove that the group $\Ga^2 \times H_{X_{\Sigma}}$ acts in the total space $\K^m$ with an open orbit. By construction, the group $\Ga^2$ changes exactly two of the coordinates $x_1,\ldots,x_m$, while the weights of the remaining $m-2$ coordinates with respect to the $\operatorname{Cl}(X)$-grading form a basis of the lattice of characters of the torus $H_X$. From this it follows that there exists a point $p \in \K^m$ with trivial stabilizer. Due to $\dim(\Ga^2 \times H_{X_{\Sigma}}) = m$ we get that the orbit of the point $p$ is open. Hereafter, we suppose that $D_1, D_2$ have form . From Lemma \[sumform\] it follows that if $d=0$, then derivations $D_1, D_2$ can be converted to $\delta, \partial_0$ respectively. Such LNDs correspond to a normalized additive action and every additive action is isomorphic to this action. Hereafter, we assume that $d\neq 0$. \[conj\] There exists an automorphism $\psi \in \operatorname{Aut}(R(X_{\Sigma}))$ that conjugates $D_1, D_2$ to the form $$\label{final} \begin{cases} \psi(D_1)=\delta + \mu_d\partial_d\\ \psi(D_2)=\partial_0 \end{cases}$$ We are going to find numbers $\eta_k \in \K$ such that the automorphism $\psi = \exp(\delta + \sum\limits_{k=1}^d\eta_k\partial_k)$ is the desired one. The automorphism $\psi$ conjugates LNDs $D_1, D_2$ to the form $$\begin{gathered} \exp(\delta +\sum\limits_k\eta_k \partial_{k})D_1\exp(-\delta -\sum\limits_k\eta_k\partial_k)=\\ =\operatorname{Ad}\left(\exp\left(\delta +\sum\limits_k\eta_k \partial_{k}\right)\right)D_1 = \exp\left(\operatorname{ad}\left(\delta +\sum\limits_k\eta_k \partial_k\right)\right)D_1 =\\ =D_1 + \sum\limits_{l=1}^{\infty}\frac{\operatorname{ad}\left(\delta +\sum\limits_k\eta_k \partial_{k}\right)^l}{l!}D_1 =\delta + \sum\limits_{k=0}^d\left(\mu_k + \sum\limits_{l=1}^{d-k}\frac{(k+l)!}{k!}(-\mu_{k+l}+\eta_ {k+l})\right)\partial_k;\\\ \exp(\delta +\sum\limits_k\eta_k \partial_{k})D_2\exp(-\delta -\sum\limits_k\eta_k\partial_k)=D_2. \end{gathered}$$ Here, we get the system of linear equations $$\mu_k + \sum\limits_{l=1}^{d-k}\dfrac{(k+l)!}{k!}(-\mu_{k+l}+\eta_{k+l})=0,\; 0 \leq k \leq d-1,$$ in variables $\eta_1, \ldots, \eta_d$. This system has a unique solution as an upper triangular system and it is the solution we are looking for. Hereafter, we suppose that $D_1, D_2$ have form . Thus, we have a family of additive actions parameterized by the number $\mu_d$: $$\arraycolsep=0.3pt \begin{array}{ccccl} x_1 &\to& \exp(s_1D_1+s_2D_2)x_1&=&x_1 +s_1\prod\limits_{j=3}^m x_j^{\alpha_{j1}}\\ x_2 &\to& \exp(s_1D_1+s_2D_2)x_2&=&x_2 + (s_2 + \frac{\mu_ds_1^d}{d!})\prod\limits_{j=3}^mx_j^{\alpha_{j2}}+\sum\limits_{k=1}^{d}\frac{\mu_ds_1^{d-k}}{k!}x_1^k\prod\limits_{j=3}^mx_j^{\alpha_{j2}-k\alpha_{j1}}\\ \end{array}$$ Note that every action corresponding to the pair of LNDs of form acts on $x_j, 3\leq j \leq m$ identically. \[nnaisom\] All additive actions with $\mu_d \neq 0$ are non-normalized and isomorphic to each other. We conjugate the pair of LNDs that have form by an element $t$ of the maximal torus $\mathbb{T} = (\K^*)^m$. Using Lemma \[lndconj\] we obtain $$\begin{gathered} tD_1t^{-1}=\overline{\chi}^{(-1,0)}(t)\delta + \mu_d\overline{\chi}^{(d,-1)}(t)\partial_d \\ tD_2t^{-1}=\overline{\chi}^{(0,-1)}(t)\partial_0 \end{gathered}$$ Since $\overline{\chi}^{(-1,0)} \neq \overline{\chi}^{(d,-1)}$ we can conjugate an additive action with $\mu_d \neq 0$ to the additive action with $\mu_d=1$. From the last lemma it follows that there are two classes of additive actions. The first one ($\mu_d=0$) is a normalized additive action: $$\label{NA} \arraycolsep=0.3pt \begin{array}{ccccl} x_1 &\to&x_1 +s_1\prod\limits_{j=3}^m x_j^{\alpha_{j1}}\\ x_2 &\to&x_2 + s_2\prod\limits_{j=3}^mx_j^{\alpha_{j2}}.\\ \end{array}$$\[NNA\] The second is a non-normalized additive action: $$\arraycolsep=0.3pt \begin{array}{ccl} x_1 &\to&x_1 +s_1\prod\limits_{j=3}^m x_j^{\alpha_{j1}}\\ x_2 &\to&x_2 + (s_2 + \frac{s_1^d}{d!})\prod\limits_{j=3}^mx_j^{\alpha_{j2}}+\sum\limits_{k=1}^{d}\frac{s_1^{d-k}}{k!}x_1^k\prod\limits_{j=3}^mx_j^{\alpha_{j2}-k\alpha_{j1}}.\\ \end{array}$$ \[notisom\] Actions and are not isomorphic. Let us consider the homogeneous component of $\K[\overline{X}]$ containing $x_2$: $$C = \langle x_2 \rangle \oplus \operatorname{span}\{x_1^{k}\prod_{j=3}^m x_j^{\alpha_{j2}-k\alpha_{j1}} : 0\leq k \leq d\}.$$ We consider the space $V = \{s_1D_1+s_2 D_2 : s_1, s_2 \in \K\}$ and its subspace $$\operatorname{Ann}_Vf = \{v \in V : vf = 0\}, \, f \in C.$$ Let $f = \lambda x_2 + \sum\limits_{k=0}^d \lambda_k x_1^{k}\prod\limits_{j=3}^m x_j^{\alpha_{j2}-k\alpha_{j1}}$ be an arbitrary non-zero element of $C$. In the case of normalized action $(s_1D_1 + s_2D_2)f$ is equal to $$s_2\lambda \prod_{j=3}^m x_j^{\alpha_{j2}} + s_1 \sum_{k=1}^d\lambda_kkx_1^{k-1}\prod_{j=3}^m x_j^{\alpha_{j2}-(k-1)\alpha_{j1}}.$$ Elements of $\operatorname{Ann}_V f$ are defined by the following equations: $$\begin{array}{cc} \lambda s_2 +\lambda_1s_1 = 0&\\ \lambda_ks_1 = 0,& 2 \leq k \leq d \end{array}$$ The collection of subspaces $\operatorname{Ann}_V f$, where $f \in C\setminus \{0\}$, contains a family of lines ${\{s_1D_1+ s_2D_2 : \lambda_1 s_1+ \lambda s_2=0\}}, (\lambda : \lambda_1) \in \P^2$. In the case of non-normalized action $(s_1D_1 + s_2D_2)f$ is equal to $$s_2\lambda \prod_{j=3}^m x_j^{\alpha_{j2}} +s_1 \lambda x_1^{d}\prod_{j=3}^m x_j^{\alpha_{j2}-d\alpha_{j1}}+ s_1 \sum_{k=1}^d\lambda_kkx_1^{k-1}\prod_{j=3}^m x_j^{\alpha_{j2}-(k-1)\alpha_{j1}}.$$ Elements of $\operatorname{Ann}_V f$ are defined by the following equations: $$\begin{array}{cc} \lambda s_2 + \lambda_1s_1 = 0&\\ \lambda_ks_1 = 0 ,&2 \leq k \leq d\\ \lambda s_1=0&\\ \end{array}$$ The subspace $\operatorname{Ann}_V f$ for $f \in \C \setminus \{0\}$ can be either $\K D_2$ or $0$. Hence, actions and are not isomorphic. The idea of this proof is taken from the proof [@ABZ Theorem 1]. In the case of a wide fan Theorem \[main\] follows from Lemmas \[sumform\] and \[cor\]. In the case of a non-wide fan we obtain the assertion from Lemmas \[cor\]-\[notisom\]. Theorem \[main\] is proved. Examples and problems {#example} ===================== In this section, we describe some examples illustrating Theorem \[main\]. Let us consider the surface $\P^1\times \P^1$. Its fan is wide and there is only one additive action up to isomorphism. [3]{} (90,90) (50,50)[(1,0)[40]{}]{} (50,50)[(0,1)[40]{}]{} (50,50)[(-1,0)[40]{}]{} (50,50)[(0,-1)[40]{}]{} (85,55)[$p_1$]{} (55,85)[$p_2$]{} (15,55)[$p_3$]{} (55,15)[$p_4$]{} $\arraycolsep=0.0pt\begin{array}{c} \mathfrak R_1 = \{(-1, 0)\}\\ \mathfrak R_2 = \{(0, -1)\}\\ \mathfrak R_3 = \{(1, 0)\}\\ \mathfrak R_4 = \{(0, 1)\}\\ \mathfrak R^+=\{(-1, 0), (0, -1)\} \end{array}$ Normalized action: $\arraycolsep=0.0pt \begin{array}{ccc} x_1 &\to& x_1 + s_1 x_3\\ x_2 &\to& x_2 + s_2 x_4\\ x_3 &\to& x_3\\ x_4 &\to& x_4\\ \end{array} $ $(s_1, s_2) \in \Ga^2$ Let us consider the surface corresponding to the following fan with ${p_3=-p_1-2p_2, p_4=-2p_1-p_2}$. Its fan is wide and there is only one additive action up to isomorphism. [3]{} (90,110) (50,70)[(1,0)[40]{}]{} (50,70)[(0,1)[40]{}]{} (50,70)[(-1,-2)[40]{}]{} (50,70)[(-2,-1)[80]{}]{} (0,20)(25,45)(50,70) (85,75)[$p_1$]{} (55,105)[$p_2$]{} (10,60)[$p_3$]{} (35,30)[$p_4$]{} $\begin{array}{c} \mathfrak R_1 = \{(-1, 0)\}\\ \mathfrak R_2 = \{(0, -1)\}\\ \mathfrak R_3 = \emptyset\\ \mathfrak R_4 = \emptyset\\ \mathfrak R^+=\{(-1, 0), (0, -1)\} \end{array}$ Normalized action: $ \arraycolsep=0.0pt\begin{array}{ccc} x_1 &\to& x_1 + s_1 x_3x_4^2\\ x_2 &\to& x_2 + s_2 x_3^2x_4\\ x_3 &\to& x_3\\ x_4 &\to& x_4\\ \end{array} $ $(s_1, s_2) \in \Ga^2$ Let us consider the projective plane $\P^2$. It corresponds to the following fan with ${p_3=-p_1-p_2}$. This fan is not wide. Therefore there are two additive actions up to isomorphism. [3]{} (90,90) (50,50)[(1,0)[40]{}]{} (50,50)[(0,1)[40]{}]{} (50,50)[(-1,-1)[40]{}]{} (85,55)[$p_1$]{} (55,85)[$p_2$]{} (5,25)[$p_3$]{} $\arraycolsep=0.0pt \begin{array}{c} \mathfrak R_1 = \{(-1, 0), (-1, 1)\}\\ \mathfrak R_2 = \{(0, -1), (1, -1)\}\\ \mathfrak R_3 = \{(1, 0), (0, 1)\}\\ \mathfrak R^+=\{(-1, 0), (0, -1), (1, -1)\} \end{array}$ Normalized action: $\arraycolsep=1.4pt \begin{array}{ccc} x_1 &\to& x_1 + s_1 x_3\\ x_2 &\to& x_2 + s_2 x_3\\ x_3 &\to& x_3\\ \end{array} $ $(s_1, s_2) \in \Ga^2$ Non-normalized action: $\arraycolsep=0.0pt \begin{array}{ccc} x_1 &\to& x_1 + s_1 x_3\\ x_2 &\to& x_2 +\frac{2s_2 + s_1^2}2 x_3 + s_1 x_1\\ x_3 &\to& x_3\\ \end{array} $ $(s_1, s_2) \in \Ga^2$ Let us consider Hirzebruch surface $\mathbb F_1$. It corresponds to the following fan with ${p_3=-p_1-p_2, p_4=-p_2}$. This fan is not wide. Therefore there are two additive actions up to isomorphism. [3]{} (100,100) (50,50)[(1,0)[40]{}]{} (50,50)[(0,1)[40]{}]{} (50,50)[(0,-1)[40]{}]{} (50,50)[(-1,-1)[40]{}]{} (85,55)[$p_1$]{} (55,85)[$p_2$]{} (55,15)[$p_4$]{} (5,25)[$p_3$]{} $ \arraycolsep=0.0pt \begin{array}{c} \mathfrak R_1 = \{(-1, 0)\}\\ \mathfrak R_2 = \{(0, -1), (1, -1)\}\\ \mathfrak R_3 = \{(1, 0)\}\\ \mathfrak R_4 = \emptyset\\ \mathfrak R^+=\{(-1, 0), (0, -1), (1, -1)\} \end{array}$ Normalized action: $\arraycolsep=0.pt \begin{array}{ccc} x_1 &\to& x_1 + s_1 x_3\\ x_2 &\to& x_2 + s_2 x_3x_4\\ x_3 &\to& x_3\\ x_4 & \to& x_4 \end{array} $ $(s_1, s_2) \in \Ga^2$ Non-normalized action: $\arraycolsep=0.0pt \begin{array}{llc} x_1 &\to& x_1 + s_1 x_3\\ x_2&\to& x_2 + \frac{2s_2+s_1^2}2x_3x_4 +s_1 x_1x_4\\ x_3 &\to& x_3\\ x_4 &\to& x_4 \end{array}$ $(s_1, s_2) \in \Ga^2$ For a geometric realization of these two actions, see [@HT Propostion 5.5]. Finally, let us outline some problems for further research. Classify additive actions on complete non-toric normal surfaces. Examples of additive actions on singular del Pezzo surfaces can be found in [@DL]. The case of 3-dimensional toric varieties seems to be more complicated: by Hassett-Tschinkel correspondence, we have four non-isomorphic additive actions on $\P^3$, see [@HT Proposition 3.3]. Nevertheless, the following problem seems to be reasonable. Classify additive actions on complete three-dimensional toric varieties. In particular, characterize complete toric 3-folds that admit a unique additive action. Is it true that the number of additive actions on a complete toric 3-fold is finite? [99]{} Ivan Arzhantsev. Flag varieties as equivariant compactifications of $\mathbb{G}^n_a$. Proc. Amer. Math. Soc. 139 (2011), no. 3, 783–786 Ivan Arzhantsev, Sergey Bragin, and Yulia Zaitseva. Commutative algebraic monoid structures on affine spaces. Comm. Contem. Math., to appear; arXiv:1809.052911 Ivan Arzhantsev, Ulrich Derenthal, Jürgen Hausen, and Antonio Laface. *Cox rings*. Cambridge Studies in Adv. Math. 144, Cambridge University Press, New York, 2015 Ivan Arzhantsev and Andrey Popovskiy. Additive actions on projective hypersurfaces. In: Automorphisms in Birational and Affine Geometry, Proc. Math. Stat. 79, Springer, 2014, 17-33 Ivan Arzhantsev and Elena Romaskevich. Additive actions on toric varieties. Proc. Amer. Math. Soc. 145 (2017), no. 5, 1865–1879 Ivan Arzhantsev and Elena Sharoyko. Hassett-Tschinkel correspondence: Modality and projective hypersurfaces. J. Algebra 348 (2011), no. 1, 217–232 Antoine Chambert-Loir and Yuri Tschinkel. On the distribution of points of bounded height on equivariant compactifications of vector groups. Invent. Math. 148 (2002), no. 2, 421-452 Antoine Chambert-Loir and Yuri Tschinkel. Integral points of bounded height on partial equivariant compactifications of vector groups. Duke Math. J. 161 (2012), no. 15, 2799–2836 David Cox. The homogeneous coordinate ring of a toric variety. J. Alg. Geom. 4 (1995), no. 1, 17–50 David Cox, John Little, and Henry Schenck. *Toric Varieties*. Graduate Studies in Math. 124, AMS, Providence, RI, 2011 Michel Demazure. Sous-groupes algebriques de rang maximum du groupe de Cremona. Ann. Sci. Ecole Norm. Sup. 3 (1970), 507–588 Ulrich Derenthal and Daniel Loughran. Singular del Pezzo surfaces that are equivariant compactifications. J. Math. Sciences 171 (2010), no. 6, 714–724 Rostislav Devyatov. Unipotent commutative group actions on flag varieties and nilpotent multiplications. Transform. Groups 20 (2015), no. 1, 21–64 Evgeny Feigin. $\mathbb{G}^M_a$ degeneration of flag varieties. Selecta Math. New Ser. 18 (2012), no. 3, 513–537 Baohua Fu and Jun-Muk Hwang. Uniqueness of equivariant compactifications of $\C^n$ by a Fano manifold of Picard number $1$. Math. Research Letters 21 (2014), no. 1, 121–125 William Fulton. *Introduction to toric varieties*. Annales of Math. Studies 131, Princeton University Press, Princeton, NJ, 1993 Brendan Hassett and Yuri Tschinkel. Geometry of equivariant compactifications of $\mathbb{G}^n_a$. Int. Math. Res. Notices 1999 (1999), no. 22, 1211–1230 Friedrich Knop and Herbert Lange. Commutative algebraic groups and intersections of quadrics. Math. Ann. 267 (1984), no. 4, 555-571 Tadao Oda. *Convex bodies and algebraic geometry: an introduction to toric varieties*. A Series of Modern Surveys in Math. 15, Springer Verlag, Berlin, 1988 [^1]: The author was supported by RSF grant 19-11-00172. | Mid | [
0.583143507972665,
32,
22.875
]
|
package storage import ( "bytes" "encoding/json" "io" "io/ioutil" "time" "github.com/pkg/errors" "github.com/Sirupsen/logrus" "github.com/containers/image/image" "github.com/containers/image/manifest" "github.com/containers/image/types" "github.com/containers/storage/pkg/archive" "github.com/containers/storage/pkg/ioutils" "github.com/containers/storage/storage" ddigest "github.com/opencontainers/go-digest" ) var ( // ErrBlobDigestMismatch is returned when PutBlob() is given a blob // with a digest-based name that doesn't match its contents. ErrBlobDigestMismatch = errors.New("blob digest mismatch") // ErrBlobSizeMismatch is returned when PutBlob() is given a blob // with an expected size that doesn't match the reader. ErrBlobSizeMismatch = errors.New("blob size mismatch") // ErrNoManifestLists is returned when GetTargetManifest() is // called. ErrNoManifestLists = errors.New("manifest lists are not supported by this transport") // ErrNoSuchImage is returned when we attempt to access an image which // doesn't exist in the storage area. ErrNoSuchImage = storage.ErrNotAnImage ) type storageImageSource struct { imageRef storageReference Tag string `json:"tag,omitempty"` Created time.Time `json:"created-time,omitempty"` ID string `json:"id"` BlobList []types.BlobInfo `json:"blob-list,omitempty"` // Ordered list of every blob the image has been told to handle Layers map[ddigest.Digest][]string `json:"layers,omitempty"` // Map from digests of blobs to lists of layer IDs LayerPosition map[ddigest.Digest]int `json:"-"` // Where we are in reading a blob's layers SignatureSizes []int `json:"signature-sizes"` // List of sizes of each signature slice } type storageImageDestination struct { imageRef storageReference Tag string `json:"tag,omitempty"` Created time.Time `json:"created-time,omitempty"` ID string `json:"id"` BlobList []types.BlobInfo `json:"blob-list,omitempty"` // Ordered list of every blob the image has been told to handle Layers map[ddigest.Digest][]string `json:"layers,omitempty"` // Map from digests of blobs to lists of layer IDs BlobData map[ddigest.Digest][]byte `json:"-"` // Map from names of blobs that aren't layers to contents, temporary Manifest []byte `json:"-"` // Manifest contents, temporary Signatures []byte `json:"-"` // Signature contents, temporary SignatureSizes []int `json:"signature-sizes"` // List of sizes of each signature slice } type storageLayerMetadata struct { Digest string `json:"digest,omitempty"` Size int64 `json:"size"` CompressedSize int64 `json:"compressed-size,omitempty"` } type storageImage struct { types.Image size int64 } // newImageSource sets us up to read out an image, which needs to already exist. func newImageSource(imageRef storageReference) (*storageImageSource, error) { id := imageRef.resolveID() if id == "" { logrus.Errorf("no image matching reference %q found", imageRef.StringWithinTransport()) return nil, ErrNoSuchImage } img, err := imageRef.transport.store.GetImage(id) if err != nil { return nil, errors.Wrapf(err, "error reading image %q", id) } image := &storageImageSource{ imageRef: imageRef, Created: time.Now(), ID: img.ID, BlobList: []types.BlobInfo{}, Layers: make(map[ddigest.Digest][]string), LayerPosition: make(map[ddigest.Digest]int), SignatureSizes: []int{}, } if err := json.Unmarshal([]byte(img.Metadata), image); err != nil { return nil, errors.Wrap(err, "error decoding metadata for source image") } return image, nil } // newImageDestination sets us up to write a new image. func newImageDestination(imageRef storageReference) (*storageImageDestination, error) { image := &storageImageDestination{ imageRef: imageRef, Tag: imageRef.reference, Created: time.Now(), ID: imageRef.id, BlobList: []types.BlobInfo{}, Layers: make(map[ddigest.Digest][]string), BlobData: make(map[ddigest.Digest][]byte), SignatureSizes: []int{}, } return image, nil } func (s storageImageSource) Reference() types.ImageReference { return s.imageRef } func (s storageImageDestination) Reference() types.ImageReference { return s.imageRef } func (s storageImageSource) Close() error { return nil } func (s storageImageDestination) Close() error { return nil } func (s storageImageDestination) ShouldCompressLayers() bool { // We ultimately have to decompress layers to populate trees on disk, // so callers shouldn't bother compressing them before handing them to // us, if they're not already compressed. return false } // putBlob stores a layer or data blob, optionally enforcing that a digest in // blobinfo matches the incoming data. func (s *storageImageDestination) putBlob(stream io.Reader, blobinfo types.BlobInfo, enforceDigestAndSize bool) (types.BlobInfo, error) { blobSize := blobinfo.Size digest := blobinfo.Digest errorBlobInfo := types.BlobInfo{ Digest: "", Size: -1, } // Try to read an initial snippet of the blob. header := make([]byte, 10240) n, err := stream.Read(header) if err != nil && err != io.EOF { return errorBlobInfo, err } // Set up to read the whole blob (the initial snippet, plus the rest) // while digesting it with either the default, or the passed-in digest, // if one was specified. hasher := ddigest.Canonical.Digester() if digest.Validate() == nil { if a := digest.Algorithm(); a.Available() { hasher = a.Digester() } } hash := "" counter := ioutils.NewWriteCounter(hasher.Hash()) defragmented := io.MultiReader(bytes.NewBuffer(header[:n]), stream) multi := io.TeeReader(defragmented, counter) if (n > 0) && archive.IsArchive(header[:n]) { // It's a filesystem layer. If it's not the first one in the // image, we assume that the most recently added layer is its // parent. parentLayer := "" for _, blob := range s.BlobList { if layerList, ok := s.Layers[blob.Digest]; ok { parentLayer = layerList[len(layerList)-1] } } // If we have an expected content digest, generate a layer ID // based on the parent's ID and the expected content digest. id := "" if digest.Validate() == nil { id = ddigest.Canonical.FromBytes([]byte(parentLayer + "+" + digest.String())).Hex() } // Attempt to create the identified layer and import its contents. layer, uncompressedSize, err := s.imageRef.transport.store.PutLayer(id, parentLayer, nil, "", true, multi) if err != nil && err != storage.ErrDuplicateID { logrus.Debugf("error importing layer blob %q as %q: %v", blobinfo.Digest, id, err) return errorBlobInfo, err } if err == storage.ErrDuplicateID { // We specified an ID, and there's already a layer with // the same ID. Drain the input so that we can look at // its length and digest. _, err := io.Copy(ioutil.Discard, multi) if err != nil && err != io.EOF { logrus.Debugf("error digesting layer blob %q: %v", blobinfo.Digest, id, err) return errorBlobInfo, err } hash = hasher.Digest().String() } else { // Applied the layer with the specified ID. Note the // size info and computed digest. hash = hasher.Digest().String() layerMeta := storageLayerMetadata{ Digest: hash, CompressedSize: counter.Count, Size: uncompressedSize, } if metadata, err := json.Marshal(&layerMeta); len(metadata) != 0 && err == nil { s.imageRef.transport.store.SetMetadata(layer.ID, string(metadata)) } // Hang on to the new layer's ID. id = layer.ID } // Check if the size looks right. if enforceDigestAndSize && blobinfo.Size >= 0 && blobinfo.Size != counter.Count { logrus.Debugf("layer blob %q size is %d, not %d, rejecting", blobinfo.Digest, counter.Count, blobinfo.Size) if layer != nil { // Something's wrong; delete the newly-created layer. s.imageRef.transport.store.DeleteLayer(layer.ID) } return errorBlobInfo, ErrBlobSizeMismatch } // If the content digest was specified, verify it. if enforceDigestAndSize && digest.Validate() == nil && digest.String() != hash { logrus.Debugf("layer blob %q digests to %q, rejecting", blobinfo.Digest, hash) if layer != nil { // Something's wrong; delete the newly-created layer. s.imageRef.transport.store.DeleteLayer(layer.ID) } return errorBlobInfo, ErrBlobDigestMismatch } // If we didn't get a blob size, return the one we calculated. if blobSize == -1 { blobSize = counter.Count } // If we didn't get a digest, construct one. if digest == "" { digest = ddigest.Digest(hash) } // Record that this layer blob is a layer, and the layer ID it // ended up having. This is a list, in case the same blob is // being applied more than once. s.Layers[digest] = append(s.Layers[digest], id) s.BlobList = append(s.BlobList, types.BlobInfo{Digest: digest, Size: counter.Count}) if layer != nil { logrus.Debugf("blob %q imported as a filesystem layer %q", blobinfo.Digest, id) } else { logrus.Debugf("layer blob %q already present as layer %q", blobinfo.Digest, id) } } else { // It's just data. Finish scanning it in, check that our // computed digest matches the passed-in digest, and store it, // but leave it out of the blob-to-layer-ID map so that we can // tell that it's not a layer. blob, err := ioutil.ReadAll(multi) if err != nil && err != io.EOF { return errorBlobInfo, err } hash = hasher.Digest().String() if enforceDigestAndSize && blobinfo.Size >= 0 && int64(len(blob)) != blobinfo.Size { logrus.Debugf("blob %q size is %d, not %d, rejecting", blobinfo.Digest, int64(len(blob)), blobinfo.Size) return errorBlobInfo, ErrBlobSizeMismatch } // If we were given a digest, verify that the content matches // it. if enforceDigestAndSize && digest.Validate() == nil && digest.String() != hash { logrus.Debugf("blob %q digests to %q, rejecting", blobinfo.Digest, hash) return errorBlobInfo, ErrBlobDigestMismatch } // If we didn't get a blob size, return the one we calculated. if blobSize == -1 { blobSize = int64(len(blob)) } // If we didn't get a digest, construct one. if digest == "" { digest = ddigest.Digest(hash) } // Save the blob for when we Commit(). s.BlobData[digest] = blob s.BlobList = append(s.BlobList, types.BlobInfo{Digest: digest, Size: int64(len(blob))}) logrus.Debugf("blob %q imported as opaque data %q", blobinfo.Digest, digest) } return types.BlobInfo{ Digest: digest, Size: blobSize, }, nil } // PutBlob is used to both store filesystem layers and binary data that is part // of the image. Filesystem layers are assumed to be imported in order, as // that is required by some of the underlying storage drivers. func (s *storageImageDestination) PutBlob(stream io.Reader, blobinfo types.BlobInfo) (types.BlobInfo, error) { return s.putBlob(stream, blobinfo, true) } func (s *storageImageDestination) HasBlob(blobinfo types.BlobInfo) (bool, int64, error) { if blobinfo.Digest == "" { return false, -1, errors.Errorf(`"Can not check for a blob with unknown digest`) } for _, blob := range s.BlobList { if blob.Digest == blobinfo.Digest { return true, blob.Size, nil } } return false, -1, types.ErrBlobNotFound } func (s *storageImageDestination) ReapplyBlob(blobinfo types.BlobInfo) (types.BlobInfo, error) { err := blobinfo.Digest.Validate() if err != nil { return types.BlobInfo{}, err } if layerList, ok := s.Layers[blobinfo.Digest]; !ok || len(layerList) < 1 { b, err := s.imageRef.transport.store.GetImageBigData(s.ID, blobinfo.Digest.String()) if err != nil { return types.BlobInfo{}, err } return types.BlobInfo{Digest: blobinfo.Digest, Size: int64(len(b))}, nil } layerList := s.Layers[blobinfo.Digest] rc, _, err := diffLayer(s.imageRef.transport.store, layerList[len(layerList)-1]) if err != nil { return types.BlobInfo{}, err } return s.putBlob(rc, blobinfo, false) } func (s *storageImageDestination) Commit() error { // Create the image record. lastLayer := "" for _, blob := range s.BlobList { if layerList, ok := s.Layers[blob.Digest]; ok { lastLayer = layerList[len(layerList)-1] } } img, err := s.imageRef.transport.store.CreateImage(s.ID, nil, lastLayer, "", nil) if err != nil { logrus.Debugf("error creating image: %q", err) return err } logrus.Debugf("created new image ID %q", img.ID) s.ID = img.ID if s.Tag != "" { // We have a name to set, so move the name to this image. if err := s.imageRef.transport.store.SetNames(img.ID, []string{s.Tag}); err != nil { if _, err2 := s.imageRef.transport.store.DeleteImage(img.ID, true); err2 != nil { logrus.Debugf("error deleting incomplete image %q: %v", img.ID, err2) } logrus.Debugf("error setting names on image %q: %v", img.ID, err) return err } logrus.Debugf("set name of image %q to %q", img.ID, s.Tag) } // Save the data blobs to disk, and drop their contents from memory. keys := []ddigest.Digest{} for k, v := range s.BlobData { if err := s.imageRef.transport.store.SetImageBigData(img.ID, k.String(), v); err != nil { if _, err2 := s.imageRef.transport.store.DeleteImage(img.ID, true); err2 != nil { logrus.Debugf("error deleting incomplete image %q: %v", img.ID, err2) } logrus.Debugf("error saving big data %q for image %q: %v", k, img.ID, err) return err } keys = append(keys, k) } for _, key := range keys { delete(s.BlobData, key) } // Save the manifest, if we have one. if err := s.imageRef.transport.store.SetImageBigData(s.ID, "manifest", s.Manifest); err != nil { if _, err2 := s.imageRef.transport.store.DeleteImage(img.ID, true); err2 != nil { logrus.Debugf("error deleting incomplete image %q: %v", img.ID, err2) } logrus.Debugf("error saving manifest for image %q: %v", img.ID, err) return err } // Save the signatures, if we have any. if err := s.imageRef.transport.store.SetImageBigData(s.ID, "signatures", s.Signatures); err != nil { if _, err2 := s.imageRef.transport.store.DeleteImage(img.ID, true); err2 != nil { logrus.Debugf("error deleting incomplete image %q: %v", img.ID, err2) } logrus.Debugf("error saving signatures for image %q: %v", img.ID, err) return err } // Save our metadata. metadata, err := json.Marshal(s) if err != nil { if _, err2 := s.imageRef.transport.store.DeleteImage(img.ID, true); err2 != nil { logrus.Debugf("error deleting incomplete image %q: %v", img.ID, err2) } logrus.Debugf("error encoding metadata for image %q: %v", img.ID, err) return err } if len(metadata) != 0 { if err = s.imageRef.transport.store.SetMetadata(s.ID, string(metadata)); err != nil { if _, err2 := s.imageRef.transport.store.DeleteImage(img.ID, true); err2 != nil { logrus.Debugf("error deleting incomplete image %q: %v", img.ID, err2) } logrus.Debugf("error saving metadata for image %q: %v", img.ID, err) return err } logrus.Debugf("saved image metadata %q", string(metadata)) } return nil } func (s *storageImageDestination) SupportedManifestMIMETypes() []string { return nil } func (s *storageImageDestination) PutManifest(manifest []byte) error { s.Manifest = make([]byte, len(manifest)) copy(s.Manifest, manifest) return nil } // SupportsSignatures returns an error if we can't expect GetSignatures() to // return data that was previously supplied to PutSignatures(). func (s *storageImageDestination) SupportsSignatures() error { return nil } // AcceptsForeignLayerURLs returns false iff foreign layers in manifest should be actually // uploaded to the image destination, true otherwise. func (s *storageImageDestination) AcceptsForeignLayerURLs() bool { return false } func (s *storageImageDestination) PutSignatures(signatures [][]byte) error { sizes := []int{} sigblob := []byte{} for _, sig := range signatures { sizes = append(sizes, len(sig)) newblob := make([]byte, len(sigblob)+len(sig)) copy(newblob, sigblob) copy(newblob[len(sigblob):], sig) sigblob = newblob } s.Signatures = sigblob s.SignatureSizes = sizes return nil } func (s *storageImageSource) GetBlob(info types.BlobInfo) (rc io.ReadCloser, n int64, err error) { rc, n, _, err = s.getBlobAndLayerID(info) return rc, n, err } func (s *storageImageSource) getBlobAndLayerID(info types.BlobInfo) (rc io.ReadCloser, n int64, layerID string, err error) { err = info.Digest.Validate() if err != nil { return nil, -1, "", err } if layerList, ok := s.Layers[info.Digest]; !ok || len(layerList) < 1 { b, err := s.imageRef.transport.store.GetImageBigData(s.ID, info.Digest.String()) if err != nil { return nil, -1, "", err } r := bytes.NewReader(b) logrus.Debugf("exporting opaque data as blob %q", info.Digest.String()) return ioutil.NopCloser(r), int64(r.Len()), "", nil } // If the blob was "put" more than once, we have multiple layer IDs // which should all produce the same diff. For the sake of tests that // want to make sure we created different layers each time the blob was // "put", though, cycle through the layers. layerList := s.Layers[info.Digest] position, ok := s.LayerPosition[info.Digest] if !ok { position = 0 } s.LayerPosition[info.Digest] = (position + 1) % len(layerList) logrus.Debugf("exporting filesystem layer %q for blob %q", layerList[position], info.Digest) rc, n, err = diffLayer(s.imageRef.transport.store, layerList[position]) return rc, n, layerList[position], err } func diffLayer(store storage.Store, layerID string) (rc io.ReadCloser, n int64, err error) { layer, err := store.GetLayer(layerID) if err != nil { return nil, -1, err } layerMeta := storageLayerMetadata{ CompressedSize: -1, } if layer.Metadata != "" { if err := json.Unmarshal([]byte(layer.Metadata), &layerMeta); err != nil { return nil, -1, errors.Wrapf(err, "error decoding metadata for layer %q", layerID) } } if layerMeta.CompressedSize <= 0 { n = -1 } else { n = layerMeta.CompressedSize } diff, err := store.Diff("", layer.ID) if err != nil { return nil, -1, err } return diff, n, nil } func (s *storageImageSource) GetManifest() (manifestBlob []byte, MIMEType string, err error) { manifestBlob, err = s.imageRef.transport.store.GetImageBigData(s.ID, "manifest") return manifestBlob, manifest.GuessMIMEType(manifestBlob), err } func (s *storageImageSource) GetTargetManifest(digest ddigest.Digest) (manifestBlob []byte, MIMEType string, err error) { return nil, "", ErrNoManifestLists } func (s *storageImageSource) GetSignatures() (signatures [][]byte, err error) { var offset int signature, err := s.imageRef.transport.store.GetImageBigData(s.ID, "signatures") if err != nil { return nil, err } sigslice := [][]byte{} for _, length := range s.SignatureSizes { sigslice = append(sigslice, signature[offset:offset+length]) offset += length } if offset != len(signature) { return nil, errors.Errorf("signatures data contained %d extra bytes", len(signatures)-offset) } return sigslice, nil } func (s *storageImageSource) getSize() (int64, error) { var sum int64 names, err := s.imageRef.transport.store.ListImageBigData(s.imageRef.id) if err != nil { return -1, errors.Wrapf(err, "error reading image %q", s.imageRef.id) } for _, name := range names { bigSize, err := s.imageRef.transport.store.GetImageBigDataSize(s.imageRef.id, name) if err != nil { return -1, errors.Wrapf(err, "error reading data blob size %q for %q", name, s.imageRef.id) } sum += bigSize } for _, sigSize := range s.SignatureSizes { sum += int64(sigSize) } for _, layerList := range s.Layers { for _, layerID := range layerList { layer, err := s.imageRef.transport.store.GetLayer(layerID) if err != nil { return -1, err } layerMeta := storageLayerMetadata{ Size: -1, } if layer.Metadata != "" { if err := json.Unmarshal([]byte(layer.Metadata), &layerMeta); err != nil { return -1, errors.Wrapf(err, "error decoding metadata for layer %q", layerID) } } if layerMeta.Size < 0 { return -1, errors.Errorf("size for layer %q is unknown, failing getSize()", layerID) } sum += layerMeta.Size } } return sum, nil } func (s *storageImage) Size() (int64, error) { return s.size, nil } // newImage creates an image that also knows its size func newImage(s storageReference) (types.Image, error) { src, err := newImageSource(s) if err != nil { return nil, err } img, err := image.FromSource(src) if err != nil { return nil, err } size, err := src.getSize() if err != nil { return nil, err } return &storageImage{Image: img, size: size}, nil } | Low | [
0.5229540918163671,
32.75,
29.875
]
|
class Record attr_reader :PtrComp, :Discr, :EnumComp, :IntComp, :StringComp attr_writer :PtrComp, :Discr, :EnumComp, :IntComp, :StringComp def initialize() @PtrComp = nil @Discr = 0 @EnumComp = 0 @IntComp = 0 @StringComp = nil end def assign(other) @PtrComp = other.PtrComp @Discr = other.Discr @EnumComp = other.EnumComp @IntComp = other.IntComp @StringComp = other.StringComp end end LOOPS = 500000 Ident1 = 1 Ident2 = 2 Ident3 = 3 Ident4 = 4 Ident5 = 5 $IntGlob = 0 $BoolGlob = FALSE $Char1Glob = 0 $Char2Glob = 0 $Array1Glob = [0] * 51 $Array2Glob = [] for i in Range.new(1, 51) $Array2Glob << [0] * 51 end $PtrGlb = nil $PtrGlbNext = nil def func3(enumParIn) enumLoc = enumParIn if enumLoc == Ident3 return TRUE end return FALSE end def func2(strParI1, strParI2) intLoc = 1 while intLoc <= 1 if func1(strParI1[intLoc].bytes[0], strParI2[intLoc + 1].bytes[0]) == Ident1 charLoc = 65 intLoc += 1 end end if charLoc >= 87 && charLoc <= 90 intLoc = 7 end if charLoc == 88 return TRUE else if strParI1 > strParI2 intLoc = intLoc + 7 return TRUE else return FALSE end end end def func1(charPar1, charPar2) charLoc1 = charPar1 charLoc2 = charLoc1 if charLoc2 != charPar2 return Ident1 else return Ident2 end end def proc8(array1Par, array2Par, intParI1, intParI2) intLoc = intParI1 + 5 array1Par[intLoc] = intParI2 array1Par[intLoc + 1] = array1Par[intLoc] array1Par[intLoc + 30] = intLoc for intIndex in [intLoc, intLoc + 1] array2Par[intLoc][intIndex] = intLoc end array2Par[intLoc][intLoc - 1] += 1 array2Par[intLoc + 20][intLoc] = array1Par[intLoc] $IntGlob = 5 end def proc7(intParI1, intParI2) intLoc = intParI1 + 2 intParOut = intParI2 + intLoc return intParOut end def proc6(enumParIn) enumParOut = enumParIn if !func3(enumParIn) enumParOut = Ident4 end if enumParIn == Ident1 enumParOut = Ident1 elsif enumParIn == Ident2 if $IntGlob > 100 enumParOut = Ident1 else enumParOut = Ident4 end elsif enumParIn == Ident3 enumParOut = Ident2 elsif enumParIn == Ident4 elsif enumParIn == Ident5 enumParOut = Ident3 end return enumParOut end def proc5() $Char1Glob = 65 $BoolGlob = FALSE end def proc4() boolLoc = $Char1Glob == 65 boolLoc = boolLoc || $BoolGlob $Char2Glob = 66 end def proc3(ptrParOut) if $PtrGlb != nil ptrParOut = $PtrGlb.PtrComp else $IntGlob = 100 end $PtrGlb.IntComp = proc7(10, $IntGlob) return ptrParOut end def proc2(intParIO) intLoc = intParIO + 10 while 1 if $Char1Glob == 65 intLoc = intLoc - 1 intParIO = intLoc - $IntGlob enumLoc = Ident1 end if enumLoc == Ident1 break end end return intParIO end def proc1(ptrParIn) nextRecord = ptrParIn.PtrComp nextRecord.assign($PtrGlb) ptrParIn.IntComp = 5 nextRecord.IntComp = ptrParIn.IntComp nextRecord.PtrComp = ptrParIn.PtrComp nextRecord.PtrComp = proc3(nextRecord.PtrComp) if nextRecord.Discr == Ident1 nextRecord.IntComp = 6 nextRecord.EnumComp = proc6(ptrParIn.EnumComp) nextRecord.PtrComp = $PtrGlb.PtrComp nextRecord.IntComp = proc7(nextRecord.IntComp, 10) else ptrParIn.assign(nextRecord) end return ptrParIn end def Proc0() $PtrGlbNext = Record.new() $PtrGlb = Record.new() $PtrGlb.PtrComp = $PtrGlbNext $PtrGlb.Discr = Ident1 $PtrGlb.EnumComp = Ident3 $PtrGlb.IntComp = 40 $PtrGlb.StringComp = "DHRYSTONE PROGRAM, SOME STRING" string1Loc = "DHRYSTONE PROGRAM, 1'ST STRING" $Array2Glob[8][7] = 10 for i in Range.new(1, LOOPS) proc5 proc4 intLoc1 = 2 intLoc2 = 3 string2Loc = "DHRYSTONE PROGRAM, 2'ND STRING" enumLoc = Ident2 $BoolGlob = !func2(string1Loc, string2Loc) intLoc3 = 0 while intLoc1 < intLoc2 intLoc3 = 5 * intLoc1 - intLoc2 intLoc3 = proc7(intLoc1, intLoc2) intLoc1 = intLoc1 + 1 end proc8($Array1Glob, $Array2Glob, intLoc1, intLoc3) $PtrGlb = proc1($PtrGlb) charIndex = 65 while charIndex <= $Char2Glob if enumLoc == func1(charIndex, 67) enumLoc = proc6(Ident1) end charIndex += 1 end intLoc3 = intLoc2 * intLoc1 intLoc2 = intLoc3 / intLoc1 intLoc2 = 7 * (intLoc3 - intLoc2) - intLoc1 intLoc1 = proc2(intLoc1) end end def main() starttime = Time.now Proc0() tm = Time.now - starttime puts "Time used: %f sec" % tm puts "This machine benchmarks at %f RbStones/second" % (LOOPS / tm) end main | Low | [
0.5260869565217391,
30.25,
27.25
]
|
Mine Cart A Mine Cart is used to transport customers between the vaults of Gringotts Wizarding Bank. Only goblins employed at Gringotts bank can operate these and have special places for lanterns. They move on specially laid tracks at the bank and are magically operated. 1998 Harry Potter decided to infiltrate Gringotts to obtain the Horcruxes he believed that was in Bellatrix's vault. While in the Shell Cottage, Harry sought for the help of Griphook to assist them to break-in. Later Griphook agreed to help them but in exchange for Godric Gryffindor's Sword because he considered it a Goblin property, claiming that Godric Gryffindor had stolen it from goblin Ragnuk. To break-in, Harry Potter and Griphook hid themselves using Harry's Invisibility cloak, while Ron Weasley and Hermione Granger used Polyjuice Potion. Hermione disguised herself as Bellatrix Lestrange and Ron disguised himself as an unnamed person but was described as having long and wavy hair, a thick brown beard and moustache, no freckles, a short, broad nose, and heavy eyebrows. Later Hermione named him as "Dragomir Despard" when they encountered Travers, a Death Eater who also intended to go to his own vault in Gringotts. Harry had to use the Imperius Curse to goblin Bogrod to be able to control him and assist them. Bogrod escorted them using the Gringotts cart but they passed over the Thief's Downfall, a defence that conjures an enchanted waterfall that can wash away all enchantment and magical concealment. This revealed the disguised figure over Hermione and Ron, and returned them to their original state and the Gringotts cart they used was smashed into pieces.[2] Shortly later, when Harry, Hermione and Ron escaped on the Ukrainian Ironbelly at Gringotts dragon, a part of the mine track broke when the dragon climbed on it with its claws, causing a cart with several goblins and Gringotts guards to go flying off and plunging down into the darkness, killing them. | Mid | [
0.562899786780383,
33,
25.625
]
|
The invention is directed to an angle measurement with a graduation carrier which is connectable to a shaft by a hub, and which is scanned by a stationary scanning arrangement, installation means being provided for defining the positional correlation of the graduation carrier and scanning arrangement. Such angle measurement apparatus are also designated as "built-in rotary encoders", which comprise no support of their own (for instance company publication of the DR. JOHANNES HEIDENHAIN GmbH, Traunreut: Rotary Encoder, issued 2/88). A preassembled angle measurement device without its own support is known U.S. Pat. No. 4,689,595. In a preassembled state, a clamping spring causes the cohesion of the scanning arrangement with the hub to which the graduation carrier or support is fastened. A stop is provided at the hub, which contacts the scanning arrangement during the preliminary assembly and which fixes the hub in the radial and the axial direction. In this state the angle measurement apparatus is placed on the drive shaft and the scanning arrangement is fastened at the mounting surface of the drive unit. Subsequently, the clamping spring is moved out of engagement and the hub is shifted in the axial direction onto the drive shaft. This shift is required in order to cancel the contact of the stop of the hub with the scanning device and in order to assure a friction-free rotation of the hub relative to the scanning arrangement. In this angle measurement apparatus there exists, in the preassembled state, a defined correlation between the hub and the scanning device in the radial and axial directions with respect to the hub axis, this correlation must however be removed during the installation at the drive unit. Because of the required axial displacement of the hub and of the graduation carrier relative to the scanning device, no defined correlation can be achieved without additional auxiliary means, and indeed neither in the radial nor in the axial direction. The measures disclosed in the U.S. Pat. No. 4,639,595 assure only security during transport. Additional angle measurement devices are described in the U.S. Pat. No. 4,556,792 and German Offenlegungsschrift 37 40 744. Expensive adjustment instruments are required for the axial and radial adjustment of the hub with respect to the scanning device. The fixation of the hub with respect to the scanning device occurs by means of a plurality of elements, which must all be laboriously removed by the recipient which requires a great deal of time. | Low | [
0.534521158129176,
30,
26.125
]
|
Q: Where to configure customer dashboard On the default Magento installation, when a customer registers they are brought to the customer dashboard, which displays several entries in the customer dashboard screen menu under the MY ACCOUNT heading. In this menu there is an entry for "My Downloadable Products". Since I am setting up a store which only offers Simple Products, I would like to delete this entry from the customer dashboard. Is there a way to remove it from the admin interface without having to modify source code? Thanks. A: Rather than copying downloadable.xml to your theme and editing it directly, use the removeLinkByName plugin in local.xml* with the following solution from Daniel Sloof (@danslo): I had a similar problem, and I didn't want to comment out addLink node because we want to implement our changes in local.xml only. Ended up writing a small module to do it: app\etc\modules\Stackoverflow_Customerlinks.xml: <?xml version="1.0" encoding="UTF-8"?> <config> <modules> <Stackoverflow_Customerlinks> <active>true</active> <codePool>local</codePool> </Stackoverflow_Customerlinks> </modules> </config> app\code\local\Stackoverflow\Customerlinks\Block\Account\Navigation.php: <?php class Stackoverflow_Customerlinks_Block_Account_Navigation extends Mage_Customer_Block_Account_Navigation { public function removeLinkByName($name) { unset($this->_links[$name]); } } ?> app\code\local\Stackoverflow\Customerlinks\etc\config.xml: <?xml version="1.0" encoding="UTF-8"?> <config> <global> <blocks> <customer> <rewrite> <account_navigation>Stackoverflow_Customerlinks_Block_Account_Navigation</account_navigation> </rewrite> </customer> </blocks> </global> </config> After that, you can simply make the changes through local.xml: <customer_account> <reference name="customer_account_navigation"> <action method="removeLinkByName"><name>downloadable_products</name></action> </reference> </customer_account> *If the local.xml file does not exist in your theme's layout directly, you'll have to create it. Source: https://stackoverflow.com/questions/5887664/remove-navigation-links-from-my-account A: Removing the link can be done by commenting it out in the downloadable.xml layout file. Copy the file to your template layout directory and edit around line 30 like this: [...] <customer_account> <reference name="customer_account_navigation"> <!-- <action method="addLink" translate="label" module="downloadable"><name>downloadable_products</name><path>downloadable/customer/products</path><label>My Downloadable Products</label></action> --> </reference> </customer_account> [...] Now if you're not planning on using the downloadable products at all I'd like to suggest turning off this module all together by editing app/etc/modules/Mage_Downloadable.xml changing <active>true</active> to <active>false</active>. | Low | [
0.509302325581395,
27.375,
26.375
]
|
"WHOA." "WHERE ARE YOU GOING?" "I HAVE TO PUT A LOAD OF LAUNDRY IN." "NO." "NO." "WE'RE IN THE PERFECT POSITION." "I CAN SEE THE TV." "YOU CAN BREATHE." "THAT NEVER HAPPENS." "LOOK, DOUG, I'LL DO THE WASH," "AND THEN WE'LL GET RIGHT BACK THE WAY WE WERE, I PROMISE." "YOU'RE-YOU'RE DREAMING." "IT'LL NEVER BE THE SAME." "I HAVE TO DO THIS, OK?" "IT'S THE BEGINNING OF THE WORK WEEK, AND ONCE AGAIN," "YOUR UNDERPANTS HAVE ME AGAINST THE ROPES." "AND I APPRECIATE THE EFFORT," "BUT RIGHT NOW, I'M COMFY." "SHH-SHH- DOUG!" "EASY." "EASY." "EASY." "YOU SEE, THE MORE YOU STRUGGLE, THE MORE I SQUEEZE." "I'M LIKE AN ANACONDA." "OK!" "ALL RIGHT!" "OK!" "A FEW MORE MINUTES." "ALL RIGHT." "THAT'S MY HOT POCKET." "IT HAS TO BE ROTATED." "EXCUSE ME." "SERIOUSLY, IS OUR MAILMAN A BOY OR A GIRL?" "BECAUSE I'M LEANING TOWARDS BOY AGAIN." "YOU KNOW WHAT?" "I" " I REALLY CAN'T FOCUS ON THAT RIGHT NOW," "'CAUSE I'M STILL SITTING HERE WITH DRY COCOA PUFFS." "MY DAD'S NOT BACK WITH THE MILK YET?" "THE MARKET'S 3 BLOCKS AWAY," "AND NOW WE'RE COMING UP ON..." "AN HOUR AND A HALF." "ARE YOU SURE YOU DON'T WANT TO TRY THE SKIM MILK?" "JUST TRYING TO THINK OUTSIDE THE BOX." "WHERE THE HELL IS HE?" "I DON'T KNOW." "DO YOU THINK SOMETHING COULD'VE HAPPENED TO HIM?" "DOUG!" "NO, NOTHING HAPPENED." "I'M BACK." "ALL RIGHT, WELL, WHERE'S THE MILK?" "OH, I'VE GOT SOMETHING" "MUCH BETTER THAN MILK." "A PING-PONG TABLE!" "DAD, WHAT HAPPENED?" "LUCKILY, DOUGLAS HAD GIVEN ME A 50," "AND THIS LITTLE HONEY" "WAS CALLING TO ME LIKE A FRENCH WHORE." "OK." "YOU KNOW WHAT?" "HOLD HIS LEGS," "'CAUSE I'M GONNA MILK HIM." "OH, HEY, DID YOU HEAR THAT DENISE GOT PROMOTED" "AT THE BOWLING ALLEY?" "OH, YEAH?" "YEAH." "THAT'S GREAT." "YOU KNOW, WITH HER, UH, MAKING MORE MONEY," "WE CAN FINALLY AFFORD TO GET A NICE PLACE TOGETHER," "AND I CAN..." "FINALLY ASK THE BIG QUESTION." "WHAT? "CAN I TOUCH 'EM?"" "ANYWAY, I'M GOING TO GO SURPRISE HER AT WORK." "SEE YOU LATER" " AND THIS WAS FUN." "ALL RIGHT." "I SEE THE TABLE HAS QUICKLY BECOME" "THE RECREATIONAL HUB OF THE NEIGHBORHOOD." "IT'S SOMETHING TO DO." "SO..." "YOU UP FOR A GAME?" "YOU WANT TO PLAY ME?" "I SHOULD WARN YOU." "OF ALL MINIATURE PADDLE GAMES," "THIS IS MY FORTE." "I'LL TAKE MY CHANCES." "HERE." "YOU CAN SERVE." "OK, GRAMPS, ANY WAY WE CAN SPEED THINGS UP HERE A LITTLE BIT?" "ALL RIGHTY." "THAT'S 11-ZIP." "YOU DIDN'T EVEN GET THE PADDLE OFF YOUR SHOULDER THAT GAME." "YOU'RE NOT BETTER THAN ME, OK?" "I JUST KEEP LOSING THE BALL IN THE WHITE OF YOUR LEGS." "OH, NO." "YOU'RE SOFT FROM PLAYING" "IN YOUR COZY, SHAG-CARPETED REC ROOMS." "I LEARNED PING-PONG ON THE STREETS!" "YOU EITHER GOT GOOD OR YOU DIED!" "JUST SERVE." "WASN'T READY." "OK, FELLAS, THAT'S 2 BUD LIGHTS AND NACHOS," "SO, THAT'S... 9.70." "OUT OF 10." "KEEP IT." "THANKS!" "OH, HI!" "HEY, SWEETUMS." "UM, IS THIS THE BIG PROMOTION" "YOU WERE TELLING ME ABOUT?" "YOU'RE A COCKTAIL WAITRESS NOW?" "YEAH." "IT ALL HAPPENED SO FAST." "IT DOESN'T EVEN SEEM REAL TO ME." "HEY, WHAT'S THE MATTER?" "I DON'T KNOW." "I MEAN," "ARE YOU SURE THIS IS SUCH A GOOD IDEA?" "YEAH." "WHY NOT?" "WELL, I-STRANGE MEN AND LIQUOR..." "QUICK-DRAW LOTTO MACHINE." "THIS IS A FASTER LIFESTYLE THAN YOU'RE USED TO." "HONEY, IF YOU DON'T WANT ME TO DO THIS," "THEN I WON'T, BUT THE ONLY REASON I TOOK THIS JOB" "WAS SO I COULD MAKE ENOUGH MONEY" "TO START A REAL LIFE WITH MY..." "MIDNIGHT SWORDSMAN." "HEY, SWEETHEART, WHERE ARE THOSE HOT WINGS?" "SO, WHAT DO YOU THINK?" "I THINK YOU'VE GOT SOME HOT WINGS TO GET." "YEAH." "HOW DO YOU LIKE THAT, OLD MAN?" "WHAT?" "ARE YOU GETTIN' SCARED?" "YOU GETTING SCARED?" "UM..." "I AM." "HEY." "WHAT'S GOING ON, BABY?" "IF I COULD JUST DEVELOP A KILLER SERVE," "HE'LL NEVER HAVE A CHANCE TO DO HIS SLAM." "THAT'S ALL THE OLD MAN'S GOT." "THAT'S IT!" "THAT'S WHAT THIS IS ABOUT," "MY DAD BEATING YOU AT PING-PONG?" "YEAH." "IT'S VERY ANNOYING." "HOW CAN I BE BEAT BY ANYBODY WHO EATS SOUP LIKE THIS?" "DOUG, WHAT DOES IT MATTER?" "I MEAN, YOU'RE BIGGER AND SMARTER" "AND LIVE IN THE ABOVEGROUND PART OF THE HOUSE." "CAN'T YOU JUST LET HIM HAVE THIS ONE THING?" "COME ON, JUST PLAY WITH ME." "PRACTICE." "COME ON." "FINE." "CAN WE STOP NOW?" "LET'S JUST FINISH THIS RALLY." "OK." "COME ON!" "LOOK ALIVE!" "THIS IS REALLY FUN," "BUT I THINK I SHOULD BE GOING." "ALL RIGHT." "WOULD YOU AL LEAST HIT ONE BACK?" "WILL YOU STOP?" "!" "THIS IS JUST LIKE DODGEBALL ALL OVER AGAIN!" "WHAT'S THE MATTER WITH HER?" "I DON'T KNOW." "SHE'S JUST A MESS IN GENERAL." "HEY." "HOW'S YOUR SHOULDER?" "YOU HIT THE CAR PRETTY HARD ON MY LAST SLAM THERE." "IT'S FINE." "WELL, JUST COVER IT UP BEFORE YOU GO TO WORK." "I DON'T WANT PEOPLE TO THINK I SMACK YOU AROUND." "OK." "HELLO, DOUGLAS." "HEY." "OR SHOULD I CALL YOU "SOFT SERVE"?" "YOU SEE THE DOUBLE MEANING?" "YOU CLEARLY LOVE YOUR SOFT ICE CREAM," "AND IN PING-PONG YOUR" "OH, GOD." "I'M SORRY." "I DIDN'T REALIZE YOU WERE SO SENSITIVE ABOUT ME BEATING YOU." "IT'S NOT YOU." "WHAT DO YOU MEAN?" "I'M OVER LOSING TO YOU." "YOU?" "YOU'RE A FREAK OF NATURE." "YOUR HANDS ARE 5 TIMES THE SIZE OF A NORMAL MAN'S." "IT'S CARRIE." "OHH." "SO, SHE'S BEEN CHEATING ON YOU?" "IS IT PEDRO?" "NO." "SHE'S NOT CHEATING ON ME." "SHE'S BEATING ME AT PING-PONG." "OHH." "I'M SORRY." "I DON'T FOLLOW." "IT'S JUST..." "I KNEW WHAT I WAS GETTING WHEN I MARRIED CARRIE." "SHE'S..." "IN CHARGE." "SHE RUNS THE SHOW..." "AND I'M GOOD WITH THAT." "IT'S JUST..." "SPORTS HAS ALWAYS BEEN MY THING, YOU KNOW?" "AND NOW THAT SHE CAN BEAT ME AT A GAME AS STUPID AS PING-PONG," "IT'S LIKE..." "LIKE YOU MIGHT AS WELL PULL UP YOUR TESTICLES LIKE A VENETIAN BLIND?" "SOMETHING LIKE THAT, YEAH." "I MEAN, HOW THE HELL DID SHE GET SO GOOD, ANYWAY?" "HOW DO YOU THINK?" "I TAUGHT HER." "THEN TEACH ME." "WHAT?" "I WANT YOU TO TRAIN ME..." "TO BEAT HER." "I HAVEN'T TRAINED ANYONE IN YEARS." "COME ON." "I NEED YOU." "OK, BUT REMEMBER THIS, DOUGLAS:" "IF I TRAIN YOU," "WE'RE GOING TO BE DOING THINGS MY WAY." "I KNOW, THAT'S WHY I ASKED YOU." "RIGHT." "HERE WE GO." "2 BEERS AND..." "ANOTHER VODKA..." "FOR "MR. GROPEY."" "OK, UM, I GOTTA TELL YOU." "I REALLY DON'T LIKE YOU WORKING HERE." "SPENCE, I TOLD YOU." "I'M DOING THIS FOR US." "OH, YEAH." "THAT'S WHY YOU LEANED OVER RIGHT IN THOSE GUYS' FACES" "AND PUSHED YOUR PLUMPIES TOGETHER." "IT'S CALLED "THE LEAN AND SQUEEZE."" "IF YOU WERE IN THE INDUSTRY, YOU'D KNOW THAT." "WAIT." "WAIT." "SO, YOU'RE NOT QUITTING." "IS THAT WHAT I'M HEARING?" "THAT'S RIGHT." "FAIR ENOUGH, BUT I THINK I SHOULD LET YOU KNOW" "THAT IF YOU'RE GOING TO KEEP" "LETTING STRANGE MEN PAW ALL OVER YOU," "I MAY HAVE TO GET OUT THERE MYSELF." "THERE'S A LOT OF WOMEN LINED UP TO RIDE SPENCE MOUNTAIN." "WELL, I HOPE THEY ENJOY A SHORT, BUMPY RIDE." "EXCUSE ME." "COME ON!" "AT LEAST PUT SOME WOOD ON IT." "I'M PLAYING WITH A SPOON!" "OF COURSE YOU ARE." "IF YOU PRACTICE WITH A SPOON," "THEN THE PADDLE WILL SEEM LIKE THE SIZE OF TEXAS." "OK." "THAT'S IT." "YOU KNOW, I'M-I'M DONE." "DOUGLAS..." "I'M VERY CLOSE TO GIVING YOU ANOTHER 10 LAPS." "NO, I'M NOT RUNNING AROUND THE PING-PONG TABLE ANYMORE." "ALL RIGHT." "CALM DOWN." "YOU'RE HYSTERICAL." "LET'S GET BACK TO BASICS." "JUST SHOW ME YOUR STROKE." "OK..." "THAT WAS A TRAIN WRECK." "WHAT'S WRONG WITH IT?" "COME HERE." "WHAT ARE YOU DOING?" "I'M MAKING MYSELF ONE WITH YOU." "OHHHH." "CAN YOU MAKE YOURSELF ONE WITHOUT GYRATING?" "THAT'S IT." "NICE AND EASY." "LIKE YOU'RE SPANKING AN UNRULY CHILD." "YOU'RE TOO TENSE." "THAT'S YOUR PROBLEM." "RELEASE." "RELEASE INTO ME!" "OK, THAT'S IT!" "STOP IT!" "STOP!" "NO!" "NO!" "YOU WERE JUST RIGHT THAT TIME." "NOW, PUT DOWN THE SPOON AND PICK UP THE PADDLE." "WOW." "THAT WAS- THAT WAS PRETTY GOOD." "MAYBE YOU KNOW WHAT YOU'RE TALKING ABOUT." "YOU BET YOUR BIPPY I DO." "NOW, I WANT YOU TO HAVE A LIGHT MEAL," "LISTEN TO THE TAPES I MADE YOU," "IN BED BY 9:30," "AND OBVIOUSLY..." "NO SHIMMY SHAM." "HEY, BABY." "HI." "WHAT ARE YOU DOING?" "JUST LISTENING TO SOME TUNES." "BE THE PADDLE." "IS SOMEONE GONNA GET THAT?" "I'M IN THE MIDDLE OF SOMETHING." "HELLO?" "AS A MATTER OF FACT, YES, I HAVE BEEN UNHAPPY" "WITH MY LONG-DISTANCE PROVIDER." "HEY, BABY." "HI, HONEY." "WHAT DO YOU WANT FOR DINNER?" "WELL, I DON'T KNOW ABOUT THE MAIN COURSE," "BUT FOR THE APPETIZER," "ARE YOU UP FOR A LITTLE..." "PING..." "PONG?" "OK, NOT SURE IF YOU'RE TALKING ABOUT SEX OR THE ACTUAL GAME." "COME ON." "PING-PONG." "UH..." "NAH, I DON'T FEEL LIKE IT." "JUST ONE GAME BEFORE DINNER." "NAH." "WHY NOT?" "BECAUSE, DOUG, YOU DON'T LIKE LOSING TO ME, OK?" "AND I DON'T WANT THIS TO BECOME A PROBLEM BETWEEN US." "PROBLEM?" "I'M A 38-YEAR-OLD MAN." "I DON'T GET MY SELF-WORTH" "FROM BEATING A GIRL AT PING-PONG," "NNNKAY?" "REALLY?" "IS THAT WHY YOU'VE BEEN TRAINING WITH MY DAD FOR 2 WEEKS?" "I DON'T KNOW WHAT YOU'RE TALKING ABOUT." "DOUG, ALL MY WOODEN SPOONS ARE GONE." "AND IT WORKED!" "I CAN BEAT YOUR ASS NOW!" "DOUG..." "IF WE GO OUT THERE AND PLAY," "YOU'RE JUST GONNA LOSE AGAIN," "AND THEN WHO ARE YOU GOING TO GET TO TRAIN YOU?" "MR. MIYAGI?" "MEET ME IN THE GARAGE..." "IF YOU GOT THE PLUMS." "YEAH!" "OH, YEAH!" "THAT'S 20 TO 12, ADVANTAGE DOUG HEFFERNAN." "NOTHING SHORT OF A MASSIVE STROKE CAN DENY HIM VICTORY." "WELL, THE WAY YOU'VE BEEN WHEEZING, I LIKE MY CHANCES." "NOW SERVE." "LET'S GO." "COMING RIGHT UP." "OH!" "OH!" "OH!" "OH!" "OH!" "OH-HO HO HO!" "OH!" "OH!" "WINNER!" "LOSER!" "OH!" "GLAD YOU COULD TAKE ME UP ON THE INVITATION." "OH, I REALLY NEEDED A NIGHT LIKE THIS." "OH, UM..." "MMM-MMM." "AND HOW ARE YOU FOLKS THIS EVENING?" "UH, WE'RE GOOD," "AND I'LL TELL YOU WHAT, UH..." "DENISE," "MY LADY FRIEND AND I ARE IN KIND OF A RUSH," "TRYING TO CATCH A MOVIE." "OH, WELL, THEN WHAT CAN I GET YOU?" "I'LL HAVE A HEINEKEN ON TAP," "AND, HOLLY," "I PEG YOU AS A BRANDY AND SODA GIRL," "AM I RIGHT?" "WELL, YES, BUT NO SODA" "AND MAKE THAT BRANDY GIN." "YOU'RE DELIGHTFUL." "OK, BE BACK IN A JIFF." "HMM." "VODKA ON THE ROCKS." "THANKS." "YOU KNOW, IT'S, UM..." "SO WARM IN HERE TONIGHT." "UM, DO YOU MIND?" "HUH?" "OH, YEAH!" "OOH!" "OH, THAT'S SO MUCH BETTER." "OOH!" "THANKS." "WHAT ARE YOU DOING?" "WHAT DO YOU CARE?" "YOU'RE OVER THERE WITH BLONDIE!" "UH, SPENCE, WHAT IS GOING ON HERE?" "HE'S TRYING TO MAKE ME JEALOUS." "IS THAT TRUE?" "PRETTY MUCH." "AND I THOUGHT YOU WERE JUST BEING NICE TO ME" "TO TRY TO GET IN MY PANTS." "WELL, GOOD NIGHT TO YOU!" "YEAH!" "ONCE AGAIN..." "VERY CUTE." "AND, YOU KNOW, TO CELEBRATE MY VICTORY," "I'VE DECREED A NIGHT OF SEX..." "AND GEORGE FOREMAN ON BIOGRAPHY." "WELL, LET ME KNOW HOW THAT TURNS OUT." "OH." "SOUNDS LIKE SOMEBODY DOESN'T LIKE LOSING SO MUCH." "I'M FINE WITH IT, BUT JUST DO ME A FAVOR" "AND BACK DOWN THE OBNOXIOUS THING A SCOOCH, OK?" "BUT I HAVE SO MUCH TO BE OBNOXIOUS ABOUT." "NOT REALLY." "WHAT?" "NOTHING." "YOU SAID, "NOT REALLY." WHAT DOES THAT MEAN?" "IT DOESN'T MEAN ANYTHING." "IT'S GOTTA MEAN SOMETHING." "ALL RIGHT." "IT MEANS I LET YOU WIN, OK?" "YOU LET ME WIN?" "WOW!" "I JUST BEAT YOU LIKE A GRAND CANYON MULE," "AND YOU CAN'T GIVE ME MY PROPS." "VERY SAD." "OK, DOUG, WHATEVER YOU SAY." "YOU BEAT ME." "I DID." "YOU DID." "I WHIPPED YOUR BUTT." "AND I'M AGREEING WITH YOU." "I KNOW YOU'RE AGREEING WITH ME." "I'M JUST TALKING." "I'M ALLOWED TO TALK IN MY OWN HOUSE, OK?" "YES, YOU ARE." "I KNOW I AM." "THANK YOU." "ONE MORE GAME." "RIGHT NOW." "OK, 21 TO 3." "THAT WAS DECISIVE." "I BEGGED YOU NOT TO DO THIS." "I JUST CAN'T BELIEVE THIS." "I MEAN..." "I" " I TRAINED FOR 2 WEEKS." "I CALLED IN SICK TWICE." "I'M IN BIG TROUBLE." "ALL RIGHT." "ALL RIGHT." "SO IT'S OVER NOW." "CAN WE JUST GET PAST IT?" "I DID HAVE THAT ONE SLAM." "YOU ALMOST DIDN'T RETURN THAT" "THAT WAS REALLY GOOD." "YOUR GAME HAS IMPROVED." "YEAH, I KNOW." "IT HAS." "NOW, I BELIEVE THAT YOU DECREED A NIGHT OF..." "SEX AND, UM, SOMETHING ABOUT GEORGE FOREMAN." "THAT'S WHEN I THOUGHT I WAS CHAMPION." "WELL, I'M THE CHAMPION NOW, SO I DECREE IT." "CAN-CAN I DO SOMETHING HERE?" "WHAT?" "I MEAN, YOU'RE DOMINATING EVERYTHING!" "GOSH, FIRST IT'S PING-PONG, NOW IT'S SEX." "IT'S OFFICIAL!" "I AM THE WOMAN!" "WILL YOU STOP IT?" "I CAN'T, OK?" "!" "WHY IS THIS SUCH A BIG DEAL TO YOU?" "I DON'T KNOW WHY IT'S A BIG DEAL, BUT IT IS," "AND IT'S GONNA RUIN EVERYTHING!" "OK-OH, ALL RIGHT." "LET ME GET THIS STRAIGHT." "SOME MARRIAGES, THEY BREAK UP OVER MONEY, OR SOMEONE CHEATS." "I MEAN, IS OUR THING REALLY GOING TO BE PING-PONG?" "LOOKS THAT WAY." "OH, OK." "WELL, AT LEAST IT'S A GOOD REASON." "THAT'LL BE FUN CALLING YOUR FOLKS." "BELIEVE ME, THEY'D UNDERSTAND." "THEY ALMOST GOT DIVORCED" "OVER A QUESTION ON CARD SHARKS." "NOW, COME ON." "THERE'S GOT TO BE SOMETHING WE CAN DO HERE." "THERE IS." "I HAVE TO BEAT YOU AT PING-PONG FOR REAL." "AND I LOVE YOU MORE THAN ANYTHING," "BUT I JUST DON'T THINK THAT CAN EVER HAPPEN." "RIGHT." "YOU GOT ANYTHING ELSE?" "YEAH!" "WHOO!" "WHOO!" "WHOO!" "WHOO!" "IT'S 12-9." "YOUR BALL." | Mid | [
0.574257425742574,
36.25,
26.875
]
|
Q: Customizing Streamplot with other plots I am trying plot vector field of a dynamical system together with highlighting some area using some inequality constraints. My state-variable for vector fields are $x$ and $y$. The following are the parameters used for the vector field ls = 2*10^-3; cs = 2*10^-3; g = 0.03; p1 = 1000; pi1 = 1100; is = 0; ki = 0; kd = 1; yd = 380; The vector fields are given by f1 and f2: f1 = -(pi1/y^2 + kd)* cs^-1*(x - g*y - p1/y - is) - (ki + ls^-1)*(y - yd); f2 = cs^-1*(x - g*y - p1/y - is); I have used the following code to Draw the vector SteamDensity plot StreamDensityPlot[ {f1, f2}, {x, xd - 100, xd + 100}, {y, yd - 100, yd + 100}, StreamPoints -> {{{{xd, yd}, Blue}, {{xd - 50, yd - 50}, Green}, {{xd + 50, yd + 50}, Red}, Automatic}}, PlotRange -> {{xd - 100, xd + 100}, {yd - 100, yd + 100}}, FrameTicks -> {{-50, {14, "\!\(\*SuperscriptBox[\(I\), \(*\)]\)=14 A", {.5, 0}, Thickness[0.001]}, 50}, {250, 300, 350, {380, "\!\(\*SuperscriptBox[\(V\), \(*\)]\)=380 V", {.5, 0}, Thickness[0.001]}, 450}}, AspectRatio -> 1, FrameLabel -> {Current , Voltage }, PlotLegends -> Automatic, PlotTheme -> "Monochrome", StreamPoints -> Fine, TicksStyle -> Directive[Orange, 50] ] This resulted in the following plot: However, I am want to highlight the area inside the plot satisfying $370<y<410$. I checked all the option of StreamDensityPlot but didn't find any relevant function that does this. A: Try putting a Rectangle in Epilog: StreamDensityPlot[{f1, f2}, {x, xd - 100, xd + 100}, {y, yd - 100, yd + 100}, StreamPoints -> {{{{xd, yd}, Blue}, {{xd - 50, yd - 50}, Green}, {{xd + 50, yd + 50}, Red}, Automatic}}, PlotRange -> {{xd - 100, xd + 100}, {yd - 100, yd + 100}}, FrameTicks -> {{-50, {14, "\!\(\*SuperscriptBox[\(I\), \(*\)]\)=14 A", {.5, 0}, Thickness[0.001]}, 50}, {250, 300, 350, {380, "\!\(\*SuperscriptBox[\(V\), \(*\)]\)=380 V", {.5, 0}, Thickness[0.001]}, 450}}, AspectRatio -> 1, FrameLabel -> {Current, Voltage}, PlotLegends -> Automatic, PlotTheme -> "Monochrome", StreamPoints -> Fine, TicksStyle -> Directive[Orange, 50], Epilog -> {Orange, Opacity[0.5], Rectangle[{xd - 100, 370}, {xd + 100, 410}]}] | Low | [
0.523364485981308,
28,
25.5
]
|
You can follow Chelsie Farah or print off her photos and cut the eyes out of them: HERE Egg yolks are bad for you Egg yolks are bad for you the way masturbation is bad for you. A good amount is healthy and normal behavior. It's when you start viciously pounding your dick 5 times a day using any lubricant you can find (lotion, hand soap, tears of loneliness), that it becomes a problem. 95% of the nutritional content in an egg COMES FROM THE YOLK. All the calcium, B6, B12, Vitamins A, D, E, and K come from the yolk. Seriously, if you're just going to eat egg whites, grab a protein shake instead. Whole wheat is good for you This is like saying since it's a blowjob, it’s going to be great! Oh naive bro, anyone who has had a real mushroom-muncher (trademark, Alex Nerney Co.), knows this is not true. Whole wheat has the same glycemic index and is basically the same as white bread. The difference between the two is infantesimal. You can check all www.glycemicindex.com to verify/see this for yourself. Basically, you are eating a simple sugar with the same nutritional value as M&M's. Saturated Fat is Bad For girls, probably. For guys, it depends on the amount. Saturated fat and testosterone are like best bros. But even your best bro can piss you off if he's around too much. Milk fat or meat fat is ok for you every now and then. Don't make it a habit, but certainly don't neglect it. Anyway, no. Nuts are great because they have good monounsaturated and polyunsaturated fats in them. However, the protein quality in those nuts is shitter than the nutritional quality of my protein farts. Don't neglect eating them– just don't walk around with a stick lodged in your anus telling everybody how “these nuts have lots of protein.” Protein bars are good for you the way anal sex is good for girls. Not really. They like it because you like it, but I mean, come on. It's the literary equivalent of having a pencil repeatedly jammed into your ear while some guy shouts, “YEAH, FUCK YEAH” and then shoots lead into your skull and leaves you, forever. If you enjoy it, you may have some issues you should look into. Protein bars are usually filled with sugar and the protein quality is not great. Quest bars are your best bet; other than that, stick to real food not created in labs. You can only process 30 grams of protein at one sitting Pseudo-science at its finest. Basically, this myth revolves around a study saying that in 3-4 hours your body absorbs 30-40 grams of protein. Which is true. What they didn't understand that if you have more than that in your stomach, your body just keeps absorbing it later on in the day. Not shitting it out. You can read a little bit about it HERE You can clear toxins from your body This is some frou-frou, yoga lovin', hipster bullshit. Don't buy products that “remove toxins from your body.” If you want, you can do a colon cleanse and sit in the bathroom all day bleeding and weeping from the pain. Fruit is bad for you Anybody who tells you to stop eating fruit needs to go jump off the Golden Gate Bridge. The difference between natural sugar and processed sugar is the difference between blue moon and natty light. Do I even need to explain why fruit is good for you? Breakfast is the most important meal of the day It's not. Yes, I read the recent article on yahoo and it was, like all yahoo articles, filled with correlation without causation. I do intermittent fasting, don't eat breakfast, and my blood work is in the top 5% of the population. If you want more info on IF go: HERE | Low | [
0.501144164759725,
27.375,
27.25
]
|
Prevention in college health: counseling perspectives. Such problems as sexually transmitted diseases, alcohol and other drug use, and acquaintance rape require college health professionals to function in primary and secondary preventive roles. In this article, the authors draw upon counseling literature and college health practice to identify the central elements of preventive programs, highlight specific intervention formats used in preventive work, and describe how interventions are assembled into coherent programs of prevention. To illustrate the structure and process of long-range, institutionalized preventive efforts, the authors describe an initiative addressing the primary, secondary, and tertiary prevention of substance use at a health sciences campus. | High | [
0.690958164642375,
32,
14.3125
]
|
Q: HTML5 two or more imports I'm trying to import 2 files with HTML5 import. <link rel="import" href="/pages/templates/menuAdmin.html"> <link rel="import" href="/pages/templates/header.html"> But I don't know how to get the second one. I have one js file but I don't know what to do next var doc= document.querySelector('link[rel="import"]').import; console.log(doc); var text = doc.querySelector('template'); var clone = document.importNode(text.content, true); document.querySelector('.sidebar-menu').appendChild(clone); A: Use querySelectorAll instead var doc= document.querySelectorAll('link[rel="import"]').import; Then use it as array doc[0] doc[1] | Mid | [
0.584415584415584,
33.75,
24
]
|
Google's decided the Chromium OS is its preferred operating system for running containers in its own cloud. And why wouldn't it – the company says it uses it for its own services. The Alphabet subsidiary offers a thing called “Container-VM” that it is at pains to point out is not a garden variety operating system you'd ever contemplate downloading and using in your own bit barn. Container-VM is instead dedicated to running Docker and Kubernetes inside Google's cloud. The Debian-based version of Container-VM has been around for a while, billed as a “container-optimised OS”. Now Google has announced a new version of Container-VM “based on the open source Chromium OS project, allowing us greater control over the build management, security compliance, and customizations for GCP.” The new Container-VM was built “primarily for running Google services on GCP”. We therefore have here an OS built by Google to run Google itself, and now available to you if you want to run containers on Google, which is of course a leading user of containers and creates billions of them every week. It's not unusual for a cloud provider to offer tight integration between their preferred operating systems and their clouds. Amazon Linux is designed to work very well in Amazon Web Services. Oracle wants you to take it as Red all the way up and down its stack. We also know that Windows 2016 Server's container-friendly Nano Server has powered Azure since 2016. So Google's not ahead of the pack here. But it does now have a rather stronger container story to tell. ® | Mid | [
0.5995623632385121,
34.25,
22.875
]
|
The Indian state of Uttar Pradesh (UP) will pilot a peer-to-peer (P2P) solar power trading project in partnership with Australian blockchain energy company Power Ledger. The state power utility UP Power Corporation Limited and UP New and Renewable Energy Development Agency have partnered with Power Ledger to launch a trial of P2P solar energy trading to examine its practicability, according to a Nov. 28 press release. The first phase of the project is set to be completed by March 2020. During the trial, Power Ledger will integrate its blockchain-based platform with smart meter systems to enable residents with rooftop solar infrastructure to set prices, track energy trading and settle surplus solar energy transactions via smart contracts. One of the main problems facing renewable energy sources is storing surplus energy when unpredictable elements like wind and sun create more or less power than is needed. As such, the project aims to make it easier for small producers to find users for surplus energy and make renewable sources more viable. Once the pilot is completed, Power Ledger will examine the results and purportedly work with the local government to tailor regulations that further enable P2P energy trading. Photovoltaic solar capacity in Uttar Pradesh — the largest state in India with a population of nearly 200 million — is set to expand in order to meet growing energy demands. In 2017, the state had 12,500 megawatts of photovoltaic power generation capacity. India’s forward-thinking approach to blockchain Power Ledger has previously worked on P2P renewable energy trading in India. Earlier this month, the firm announced that it completed a trial in the Dwarka region, South West Delhi. Similar to the pilot project in Uttar Pradesh, the trial in Dwarka aimed to give participants access to cheaper, renewable energy and let solar infrastructure owners monetize their surplus energy. India has proved itself as a jurisdiction with a proactive approach toward blockchain adoption. On Nov. 27, India’s Ministry of Electronics and Information Technology said that it recognizes the potential of blockchain technology and the need for the development of a shared infrastructure to carry out related use cases. The Ministry added that it is working on a “National Level Blockchain Framework.” | High | [
0.6845965770171151,
35,
16.125
]
|
================= Section Bookmarks ================= If you have a long page, and you want to allow the visitors of your site to quickly navigate to different sections, then you can use bookmarks and create links to the different sections of any HTML page. When a user clicks on a bookmark link, then that page will load as usual but will scroll down immediately, so that the bookmark is at the very top of the page. Bookmarks are also known as anchors. They can be added to any HTML element using the attribute ``id``. For example: .. code-block:: html <section id="unique-identifier-for-that-page"> For obvious reasons, this identifier must be unambiguous, otherwise the browser does not know where to jump to. Therefore **djangocms-cascade** enforces the uniqueness of all bookmarks used on each CMS page. Configuration ============= The HTML standard allows the usage of the ``id`` attribute on any element, but in practice it only makes sense on ``<section>``, ``<article>`` and the heading elements ``<h1>``...``<h6>``. Cascade by default is configured to allow bookmarks on the **SimpleWrapperPlugin** and the **HeadingPlugin**. This can be overridden in the project's configuration settings using: .. code-block:: python CMSPLUGIN_CASCADE = { ... 'plugins_with_bookmark': [list-of-plugins], ... } Hashbang Mode ------------- Links onto bookmarks do not work properly in hashbang mode. Depending on the HTML settings, you may have to prefix them with ``/`` or ``!``. Therefore **djangocms-cascade** offers a configuration directive: .. code-block:: python CMSPLUGIN_CASCADE = { ... 'bookmark_prefix': '/', ... } which automatically prefixes the used bookmark. Usage ===== When editing a plugin that is eligible for adding a bookmark, an extra input field is shown: |section-bookmark| .. |section-bookmark| image:: /_static/section-bookmark.png You may add any identifier to this field, as long as it is unique on that page. Otherwise the plugin's editor will be reject the given inputs, while saving. Hyperlinking to a Bookmark ========================== When editing a **TextLink**, **BootstrapButton** or the link fields inside the **Image** or **Picture** plugins, the user gets an additional drop-down menu to choose one of the bookmarks for the given page. This additional drop-down is only available if the **Link** is of type *CMS page*. |link-bookmark| .. |link-bookmark| image:: /_static/link-bookmark.png If no bookmarks have been associated with the chosen CMS page, the drop-down menu displays only *Page root*, which is the default. | Mid | [
0.6186046511627901,
33.25,
20.5
]
|
Ectopic Pregnancy (cont.) Melissa Conrad Stöppler, MD Melissa Conrad Stöppler, MD, is a U.S. board-certified Anatomic Pathologist with subspecialty training in the fields of Experimental and Molecular Pathology. Dr. Stöppler's educational background includes a BA with Highest Distinction from the University of Virginia and an MD from the University of North Carolina. She completed residency training in Anatomic Pathology at Georgetown University followed by subspecialty fellowship training in molecular diagnostics and experimental pathology. Charles Patrick Davis, MD, PhD Dr. Charles "Pat" Davis, MD, PhD, is a board certified Emergency Medicine doctor who currently practices as a consultant and staff member for hospitals. He has a PhD in Microbiology (UT at Austin), and the MD (Univ. Texas Medical Branch, Galveston). He is a Clinical Professor (retired) in the Division of Emergency Medicine, UT Health Science Center at San Antonio, and has been the Chief of Emergency Medicine at UT Medical Branch and at UTHSCSA with over 250 publications. William C. Shiel Jr., MD, FACP, FACR Dr. Shiel received a Bachelor of Science degree with honors from the University of Notre Dame. There he was involved in research in radiation biology and received the Huisking Scholarship. After graduating from St. Louis University School of Medicine, he completed his Internal Medicine residency and Rheumatology fellowship at the University of California, Irvine. He is board-certified in Internal Medicine and Rheumatology. The woman may not be aware that she is pregnant. These characteristic symptoms occur in ruptured ectopic pregnancies (those accompanied by severe internal bleeding) and non-ruptured ectopic pregnancies. However, while these symptoms are typical for an ectopic pregnancy, they do not mean an ectopic pregnancy is necessarily present and could represent other conditions. In fact, these symptoms also occur with a threatened abortion (miscarriage) in nonectopic pregnancies. The signs and symptoms of an ectopic pregnancy typically occur six to eight weeks after the last normal menstrual period, but they may occur later if the ectopic pregnancy is not located in the Fallopian tube. Other symptoms of pregnancy (for example, nausea andbreast discomfort, etc.) may also be present in ectopic pregnancy. Weakness, dizziness, and a sense of passing out upon standing can (also termed near-syncope) be signs of serious internal bleeding and low blood pressure from a ruptured ectopic pregnancy and require immediate medical attention. Unfortunately, some women with a bleeding ectopic pregnancy do not recognize they have symptoms of ectopic pregnancy. Their diagnosis is delayed until the woman shows signs of shock (for example, low blood pressure, weak and rapid pulse, pale skin and confusion) and often is brought to an emergency department. This situation is a medical emergency. | Mid | [
0.599190283400809,
37,
24.75
]
|
How to Choose the Right Bow for Hunting As a bow hunter, you know the importance of choosing the right bow. It is always a personal choice. There are a number of bows on the market. There are also plenty of accessories that go with them. When the time comes for you to pick the right bow, consider the same things that you would if you were going to purchase a pair of hunting boots. You want to find a bow that is adequately fit, durable, and easy to use. As with all other hunting equipment, nothing beats quality when choosing a bow. Due to the sheer number of bows available on the market, you should try as many bows as possible. You want to find a bow that feels good in your hands. You also want a bow that is the proper size for your body type. Finally, you want to purchase a bow that will match your shooting style. These factors will affect your level of accuracy and comfort while shooting the bow. Consider your bow an investment that will either benefit you or cause you a great deal of frustration while in the field. There are many things to consider when buying a bow. One of the most important is eye dominance. Eye dominance should play an important role as you search for the right bow. You should know your eye dominance so that you can pick a left-hand or right-hand bow. Most often, a person who is right handed will have a dominant right eye. The same applies to someone who is left handed. The most effective way to figure out which eye is your dominant eye is to point to a distant object with both eyes open. Close your left eye. If your finger is still pointing directly at the target, your right eye is dominant. If you notice that your finger is no longer pointing at the target, you are likely left-eye dominant. If your right eye is your dominant eye, buy a right-handed bow. Do the opposite if you are left-eye dominant. Taking the time to do this will benefit your accuracy with the bow. Other things to consider while shopping for a bow are draw length, draw weight, axle-to-axle length (ATA), and brace height. The most important thing, however, is to make sure that you choose a bow that has been made by a highly reputable company. Find a company that will always stand behind their product. They should also offer a high level of customer service. You will benefit by purchasing a bow that comes with a guarantee. Most companies that deal with higher-end bows will automatically offer an unlimited lifetime warranty. You need to make sure that you choose the right bow as you prepare for the bow hunting season. There are a number of options on today’s market, so take the time to research all of them. Several factors will determine what kind of bow you purchase. Decide if your right or left eye is dominant, and then select your bow accordingly. This will help you as you attempt to improve your accuracy in the field. Deal only with highly reputable companies that offer customer service and that guarantee your bow. You will be able to thoroughly enjoy the hunting season once you have found the right bow. | High | [
0.6799007444168731,
34.25,
16.125
]
|
[Acute venous liver circulatory disorder caused by blunt abdominal trauma: is it a compartment syndrome?]. Authors describe the case of a 37-year-old female patient who had been operated on for a subcapsular haematoma of the liver that had developed following a blunt abdominal trauma. This manifested as a Budd-Chiari syndrome-like phenomenon that was not recognized until an exploratory operation was performed, when we found that the liver was hard and dark purple in colour and there was considerable ascites in the abdominal cavity. After aspiration of the haematoma, which contained about 1 l of a mixture of fluid and clotted blood, the circulation of the liver rapidly improved. On the basis of the findings, a posttraumatic Budd-Chiari syndrome seems unlikely, since the symptoms caused by the rise in intracapsular pressure are similar to those of a compartment syndrome. No literature data can be found to define such a posttraumatic failure of the liver circulation. Subcapsular and intrahepatic haematomata can be successfully monitored by ultrasonography and managed conservatively if they are asymptomatic. Operation is restricted to lesions with worsening symptoms or increasing danger of haemorrhage. | Mid | [
0.6392251815980631,
33,
18.625
]
|
Q: Error: This key is already associated with an element of this collection in Excel VBA I am trying to write a code where I am comparing three column values from two different sheets and fetching the value of the fourth column based on the match. While using below code getting the following error: This key is already associated with an element of this collection. Sub UpdateW2() Dim Dic, Dic1 As Object, key As Variant, oCell, oCell2 As Range, i&, i1& Dim w1, w2 As Worksheet Set Dic = CreateObject("Scripting.Dictionary") Set Dic1 = CreateObject("Scripting.Dictionary") Set w1 = Workbooks("Request_Raising_Automation.xlsm").Sheets("RawData") Set w2 = Workbooks("Request_Raising_Automation.xlsm").Sheets("BRE") i = w1.Cells.SpecialCells(xlCellTypeLastCell).Row For Each oCell In w1.Range("B2:D" & i) If Not Dic.exists(oCell.Value) Then Dic.Add oCell.Value, oCell.Offset(, 1).Value & oCell.Offset(,2).Value i1 = w2.Cells.SpecialCells(xlCellTypeLastCell).Row For Each oCell2 In w2.Range("B2:E" & i1) Dic1.Add oCell2.Value, oCell2.Offset(, 2).Value & oCell2.Offset(, 3).Value If oCell = oCell2 Then oCell.Offset(, 3).Value = oCell2.Offset(, 1).Value End If Next End If Next End Sub I want output where i will match 3 columns of two different worksheets and fetch the fourth column value based on the match but this is not working and throwing error. A: It is considered a good practice to check whether a key exists in a dictionary, before adding it. This is done with Dictionary.Exist(key) method. Adding key and value as variables is a good work around - myVal = oCell2.Offset(, 2).Value & oCell2.Offset(, 3).Value, improving the readability of the code. Declared like this Dim Dic, Dic1 As Object, key As Variant, oCell, oCell2 As Range, Dic and oCell are initially declared as Variant. Later they are assigned to the correct type. If cells in Excel are compared, it is a good idea to try to escape possible erorrs. Because two errors are never equal: If (Not IsError(oCell.Value)) And (Not IsError(oCell2)) Then and an error would be thrown: Sub UpdateW2() Dim Dic As Object, Dic1 As Object, key As Variant, oCell As Range, oCell2 As Range, i&, i1& Dim w1 As Worksheet, w2 As Worksheet Set Dic = CreateObject("Scripting.Dictionary") Set Dic1 = CreateObject("Scripting.Dictionary") Set w1 = ThisWorkbook.Worksheets(1) Set w2 = ThisWorkbook.Worksheets(2) i = w1.Cells.SpecialCells(xlCellTypeLastCell).Row For Each oCell In w1.Range("B2:D" & i) If Not Dic.Exists(oCell.Value) Then Dic.Add oCell.Value, oCell.Offset(, 1).Value & oCell.Offset(, 2).Value i1 = w2.Cells.SpecialCells(xlCellTypeLastCell).Row For Each oCell2 In w2.Range("B2:E" & i1) Dim myKey As String Dim myVal As String myKey = oCell2.Value myVal = oCell2.Offset(, 2).Value & oCell2.Offset(, 3).Value If Dic1.Exists(myKey) Then Debug.Print "Key exists " & myKey Else Debug.Print "Key added " & myKey Dic1.Add myKey, myVal End If If (Not IsError(oCell.Value)) And (Not IsError(oCell2)) Then If oCell = oCell2 Then oCell.Offset(, 3).Value = oCell2.Offset(, 1).Value End If Else Debug.Print oCell.Address; " or "; oCell2.Address End If Next End If Next End Sub | Low | [
0.5,
24.875,
24.875
]
|
package com.github.aysnc.sql.db.integration import com.github.jasync.sql.db.postgresql.messages.backend.NotificationResponse import java.util.UUID import org.assertj.core.api.Assertions.assertThat import org.junit.Test class ListenNotifySpec : DatabaseTestHelper() { private fun generateQueueName() = "scala_pg_async_test_" + UUID.randomUUID().toString().replace("-", "") @Test fun `"connection" should "should be able to receive a notification if listening"`() { withHandler { connection -> val queue = generateQueueName() executeQuery(connection, "LISTEN $queue") var payload = "" var channel = "" connection.registerNotifyListener { message -> payload = message.payload channel = message.channel } executeQuery(connection, "NOTIFY $queue, 'this-is-some-data'") Thread.sleep(1000) assertThat(payload).isEqualTo("this-is-some-data") assertThat(channel).isEqualTo(queue) assertThat(connection.hasRecentError()).isFalse() } } @Test fun `"connection" should "should be able to receive a notification from a pg_notify call" `() { withHandler { connection -> val queue = generateQueueName() executeQuery(connection, "LISTEN $queue") var payload = "" var channel = "" connection.registerNotifyListener { message -> payload = message.payload channel = message.channel } executePreparedStatement(connection, "SELECT pg_notify(?, ?)", listOf(queue, "notifying-again")) Thread.sleep(1000) assertThat(payload).isEqualTo("notifying-again") assertThat(channel).isEqualTo(queue) } } @Test fun `"connection" should "should not receive any notification if not registered to the correct channel" `() { withHandler { connection -> val queue = generateQueueName() val otherQueue = generateQueueName() executeQuery(connection, "LISTEN $queue") var payload = "" var channel = "" connection.registerNotifyListener { message -> payload = message.payload channel = message.channel } executePreparedStatement(connection, "SELECT pg_notify(?, ?)", listOf(otherQueue, "notifying-again")) Thread.sleep(1000) assertThat(payload).isEqualTo("") assertThat(channel).isEqualTo("") } } @Test fun `"connection" should "should not receive notifications if cleared the collection" `() { withHandler { connection -> val queue = generateQueueName() executeQuery(connection, "LISTEN $queue") var payload = "" var channel = "" connection.registerNotifyListener { message -> payload = message.payload channel = message.channel } connection.clearNotifyListeners() executeQuery(connection, "NOTIFY $queue, 'this-is-some-data'") Thread.sleep(1000) assertThat(payload).isEqualTo("") assertThat(channel).isEqualTo("") } } @Test fun `"connection" should "should not receive notification if listener was removed" `() { withHandler { connection -> val queue = generateQueueName() executeQuery(connection, "LISTEN $queue") var payload = "" var channel = "" val listener: (NotificationResponse) -> Unit = { message: NotificationResponse -> payload = message.payload channel = message.channel } connection.registerNotifyListener(listener) connection.unregisterNotifyListener(listener) executeQuery(connection, "NOTIFY $queue, 'this-is-some-data'") Thread.sleep(1000) assertThat(payload).isEqualTo("") assertThat(channel).isEqualTo("") } } @Test fun `"connection" should "should be able to receive notify ,out payload" `() { withHandler { connection -> val queue = generateQueueName() executeQuery(connection, "LISTEN $queue") var payload = "this is some fake payload" var channel = "" val listener: (NotificationResponse) -> Unit = { message -> payload = message.payload channel = message.channel } connection.registerNotifyListener(listener) executeQuery(connection, "NOTIFY $queue") Thread.sleep(1000) assertThat(payload).isEqualTo("") assertThat(channel).isEqualTo(queue) } } } | Mid | [
0.5777262180974471,
31.125,
22.75
]
|
Arrow's sixth season is currently in full swing, but it sounds like the chapter could end in a pretty unexpected way. In an interview with Entertainment Weekly's Spoiler Room, Arrow EP Marc Guggenheim teased what fans can expect for the season six finale. While he was relatively mum on the details, he hinted that it would have a complicated impact on Oliver Queen (Stephen Amell). “It’s a very unusual kind of finale,” Guggenheim explained. “It definitely has a cliffhanger, but not a traditional cliffhanger. Last year’s finale was a traditional cliffhanger. It was very much an ‘Oh my God, what’s going to happen?’ This is a different kind of cliffhanger. I would say it’s somewhere on the spectrum of the cliffhanger of season 1, which was like, ‘How is Oliver gonna go forward?’ and the cliffhanger of season 5, which was more of a traditional cliffhanger. This, I think, falls somewhere in the middle." So, it sounds like the next Arrow cliffhanger is somewhere between Oliver leaving Star City as a result of Tommy Merlyn's death, and the whole Lian Yu explosion of last year. And looking at where things are going in Arrow's current stretch of episodes (and the fact that Legends of Tomorrow's Caity Lotz is confirmed to appear in the finale), that only makes this tease even more interesting. A lot of episodes have hinted at Oliver losing some of the major connections in his life, from "New Team Arrow" breaking off on their own, to the departure of Thea Queen (Willa Holland), to upcoming clashes with John Diggle (David Ramsey) and Felicity Smoak (Emily Bett Rickards). And according to Guggenheim, that could all be building to something surprising - and potentially groundbreaking for the Arrowverse as a whole. "We have a few surprises up our sleeves." Guggenheim added. "There’s a couple of twists, there’s a couple of things that we’re doing that are not only very unexpected, but also unprecedented not just for Arrow, but for the other DC superhero shows as well." Are you excited to see what Arrow has in store for its season six finale? Sound off in the comments below. Arrow airs Thursdays at 9/8c on The CW. | High | [
0.6946386946386941,
37.25,
16.375
]
|
A Look Inside Caddy, a Web Server Written in Go Caddy is a unique web server with a modern feature set. Think nginx or Apache, but written in Go. With Caddy, you can serve your websites over HTTP/2. It can act as a reverse proxy and load balancer. Front your PHP apps with it. You can even deploy your site with git push . Cool, right? Caddy serves the Gopher Academy websites, including this blog. Go ahead, check out the response headers. At the end of this post, we’ll show you how this is done. By the way, even if you’re new to Go, Caddy is a great project to contribute to. For example, right now we need more tests. Much of the setup/boilerplate is already done. Please feel free to get involved! There’s a great community of Caddy users to collaborate with. Introduction Caddy is basically a web app. Like other Go web applications, it imports net/http, embeds *http.Server , has ServeHTTP() methods, and uses http.FileServer as a basis for serving static files. Even though Caddy resembles a regular web app, it diverges in several significant and challenging ways. Its entire configuration could change from one execution to the next. (Soon, you’ll be able to make changes to Caddy without needing to restart it.) In this post, we’ll examine a few of the critical design decisions that make Caddy tick. User Interface and Experience Caddy is a headless application. There is no visual UI (yet) and it can run without any interaction from the user. This does not, however, eliminate the user interface/experience. I believe the first key element in any application is the user experience. Nearly every technical decision should be checked-and-balanced with a cross-examination: “How does the user like this?” This can be an important discussion to have, and the first four months of development was me talking myself through the answers to that question. As you read about and use Caddy, I hope you’ll see what I mean when I say it was designed for people, with the Web in mind. Middleware Middleware is absolutely the #1 reason that Caddy works. If I were to choose one thing that is Caddy’s secret sauce, this is it. In essence, Caddy has just one HTTP handler: the file server. The rest is all middleware. Each middleware does one thing very well. For example, logging, authentication, or gzip compression. All of Caddy’s middleware can be used in your own Go programs independently of Caddy. Middleware is usually chained together. For example, to do both gzip compression and logging, you would wrap a handler like logHandler(gzipHandler(fileServer)) . With most web apps, you could just hardcode this. But because users can customize Caddy, we can’t hardcode its middleware chain. Instead, it compiles a custom middleware stack based on user input: In that code, layers is a slice of functions that take a Handler and return a Handler, true to the traditional middleware pattern. The fileServer is the HTTP handler at the core of every request (the “end” of the chain). When the loop finishes, vh.stack points to the beginning of the chain through which all requests will pass. By compiling the middleware stack dynamically, the user can customize exactly what functionality they want their web server to have. Error Handling There are several ways to handle errors in HTTP handlers (slides). I changed the signature of ServeHTTP() to return (int, error) . It’s not directly compatible with net/http, but this pattern is one recommended by the Go Blog and it works extremely well. This way, nobody does error handling except the application or a dedicated error-handling middleware. Middlewares don’t even have to call an error handling function - they just immediately return a status code and the error. This keeps error handling consistent, customizable, and reliable. Startup and Configuration The first work on Caddy wasn’t on the program itself. Rather, it was on its input. Long before Caddy even had a name, I planned how the user would configure it. Extensibility and a clean syntax were important. No semicolons, parentheses, or angle brackets were allowed. Non-programmers are going to use this, after all. Caddy includes a robust, custom parser to make sense of the Caddyfile. When you run Caddy, the first thing it does is configure itself based on the contents of the Caddyfile. Caddy’s parsing routine is… unconventional. First, the file is read into tokens. The only thing the core parser does is organize tokens by server address. Most of the parsing happens in another package called setup, which sets up each middleware according to the tokens. By the time the resulting configuration is passed back up and out of the config package, Caddy has everything it needs to start serving. This architecture makes for quite a few files, but it separates concerns. It makes it easy to extend Caddy and put it under test. Routing Caddy doesn’t use a conventional HTTP router. Instead, all requests take the same path through the middleware chain. If the request path matches what that middleware is configured for, the middleware activates and does its thing. Otherwise, it passes the request through to the next handler. For example: 1 2 3 4 5 6 7 8 func (m MyMiddleware) ServeHTTP(w http.ResponseWriter, r *http.Request) (int, error) { if middleware.Path(r.URL.Path).Matches(m.BasePath) { // do something } else { // pass-thru return m.Next.ServeHTTP(w, r) } } Some directives do not accept a base path and will run on every request. Others with an optional path argument will default to “/” (matching every request) if the base path is omitted. Virtual Hosting I said before that there isn’t any routing. That’s only true for the request’s path. There is, in fact, some routing on the host. Caddy can serve multiple sites (each with their own hostname) on the same port. The obvious problem is that only one listener can bind to, say, port 80. To work around this, Caddy will start one listener on port 80 and then multiplex requests from there based on the value of the Host header. Server Name Indication You can serve multiple plaintext sites on the same port with Caddy, but what about multiple HTTPS sites on port 443? It’s impossible without an extension to TLS called SNI, or Server Name Indication. Without it, a TLS handshake comes in from a client, but the server has no idea which key to use to complete the handshake because the Host information is encrypted! This prevents the TLS handshake from ever succeeding. SNI solves this problem. It’s actually built into the Go standard library, but you can’t use it with a call to the usual http.ListenAndServeTLS() . You have to roll your own, which isn’t hard. Basically, you just add each cert/key pair and attach them to their host names: SNI is not something a Caddy user needs to think about. It just works. Example The nginx.conf file for all the Gopher Academy websites was over 115 lines long. The equivalent Caddyfile is only 50 lines. This Caddyfile serves the GopherCon website: 1 2 3 4 http://gophercon.com, http://www.gophercon.com { root /var/www/gc15/public gzip } Gophercon.com is generated by Hugo, so the static HTML files live in the gc15/public folder. Let’s use the git directive to deploy the site when we git push : 1 2 3 4 5 6 7 8 9 http://gophercon.com, http://www.gophercon.com { root /var/www/gc15/public gzip git { repo https://github.com/gophercon/gc15 path ../ then hugo --theme=gophercon --destination=public } } When the server starts, it pulls the entire repository into the folder above the site root, then runs hugo to generate the site, placing it in the “public” folder. Every hour, the latest is pulled and the site is re-generated. (A future release will allow immediate pulls via post-commit hook.) So basically, each Gopher Academy site is served and deployed using a 9-line file that’s easy to read and intuitive to write. (In reality, the files are combined into one, but you can do what you want.) After the Caddyfile is prepared, we just run caddy in the same directory as the Caddyfile and we’re done. (Initially, we forgot to raise ulimit -n to a value safe for a production website. Caddy showed a warning that the file descriptor limit was too low and recommended raising it. Phew!) Next Steps We’re working on an API that can change the server’s configuration while it’s running. And with that, an API client that will allow you to log in to your server and make changes and see requests in real-time. Conclusion Thank you to all contributors so far. I hope this was interesting to you! Give Caddy a try and let us know what you think. You can also reach out to me directly on Twitter @mholt6. | High | [
0.665024630541871,
33.75,
17
]
|
Week 11 didn't have much drama among the playoff contending teams. Oklahoma had a scare in their rivalry game, but ultimately left with a win. And with all of the top teams winning, there was no change into top 10 of the College Football Playoff rankings. Week 12 is an ugly slate of games for the top teams in the country outside of Notre Dame, but that just gives us a chance to see top prospects in games where they should dominate. We'll continue with last week's format with the mix and match prospect review. First, we'll take a look at three RB prospects in next year's draft and then we'll look at an under-the-radar WR. Love the strategy of season-long fantasy sports? Live for the short term gratification of DFS? Try Weekly Fantasy Sports on OwnersBox - a new weekly DFS platform. Sign up today for a FREE $50 Deposit Match Scouting The Running Backs Rodney Anderson, RB Oklahoma It's been a while since we've seen Rodney Anderson, but he recently announced that he was declaring for the NFL Draft. And while his final season is difficult to evaluate, the small sample size paired with his 2017 season gives a decent amount of insight into Anderson's skill set. Rodney Anderson G Rush Att Rush Yards YPC Rush TD Rec Rec Yards YPR Rec TD 2015 2 1 5 5 0 0 0 0 0 2017 13 188 1161 6.2 13 17 281 16.5 5 2018 2 11 119 10.8 3 0 0 0 0 Career 200 1285 6.4 16 17 281 16.5 5 The difficulty with evaluating Anderson is mostly in his usage rate. He showed signs that he could be a workhorse back during his 2017 season, but still came up short of 200 carries. And in his two game 2018 season, he'd only tallied 11 carries and no receptions, but the two opponents were also over-matched and the team didn't need Anderson to be heavily utilized. Anderson's evaluation will lean on whether he's able to workout during the combine. If he's unable to complete any of the drills, then his prospect evaluation can only really be seen as incomplete. CBSSports currently lists Anderson as the fifth best RB in the class. If he isn't able to workout, it's unlikely that his stock will rise which will likely leave him as a late Day 2 prospect. As a round 3 prospect, Anderson probably is a late first round rookie pick with a range that ends in the early second round. Damien Harris, RB Alabama Week 12 - vs The Citadel (11/17) There's a case to be made that Harris is the most talented RB in the class, but he's failed to standout in a highly talented crowd as a part of Alabama. Harris is a former five-star high school prospect and in most situations, he's the clear-cut most talented player in the RB room. But in Alabama, he spent four seasons splitting the work with other top prospects. Damien Harris G Rush Att Rush Yards YPC Rush TD Rec Rec Yards YPR Rec TD 2015 10 46 157 3.4 1 4 13 3.3 0 2016 15 146 1037 7.1 2 14 99 7.1 2 2017 14 135 1000 7.4 11 12 91 7.6 0 2018 10 101 595 5.9 7 16 166 10.4 0 Career 428 2789 6.5 21 46 369 8 2 The biggest concern with Harris is his history of limited usage and even this season as the lead back, he's only on pace for 150 carries. But his final season expanded usage in the passing game with decent efficiency helps demonstrate some of the upside of him as a prospect. It's somewhat unfortunate that Harris went to Alabama rather than choosing a slightly lower profile school that would have allowed him to dominate usage because his production leaves more questions than answers. But two seasons over 7 yards per carry make it clear that he's not lacking talent. Finishing without a season of 200 carries points to a prospect destined for a future in a committee, but Harris has the talent to become a highly efficient player. In the right situation, Harris could become a star. But his floor could be very low. CBSSports ranks Harris as the fourth best RB in the class and his athletic pedigree points to a player that will benefit from the pre-draft process. If he's a round-two selection, then he won't be around in the back half of rookie draft first rounds. Mike Weber, RB Ohio State Week 12 - at Maryland (11/17) After accumulating 182 carries for over 1000 yards as a freshman, Weber had a ton of buzz entering 2017. But an early-season injury opened the door for teammate, J.K. Dobbins, to earn a meaningful role in the offense. As the secondary back, even in a great backfield, Weber's hype slowly faded and now he's turned into a potential sleeper. Mike Weber G Rush Att Rush Yards YPC Rush TD Rec Rec Yards YPR Rec TD 2016 13 182 1096 6 9 23 91 4 0 2017 12 101 626 6.2 10 10 94 9.4 0 2018 10 127 711 5.6 4 16 82 5.1 1 Career 410 2433 5.9 23 49 267 5.4 1 Weber's two seasons of at least 6 yards per carry showed that he's efficient between the tackles runner. The overall offensive issues of Ohio State have hindered his efficiency and with another season likely to finish below 200 carries, there's some concern about whether he's truly capable of more. The positive notes from Weber are a career average near 6 yards per carry and more than one reception per game. Weber seemed to fall behind Dobbins on the depth chart in 2017, but the split has been more even in 2018. CBSSports doesn't rank Weber among the top 10 RB prospects. Of these three RB prospects, Weber is the most likely to return for his final season, but if he builds any buzz over the final weeks of the season, he could be a strong Day 3 prospect. For fantasy purposes, he's very situation-dependent since his draft stock is unlikely to guarantee a workload. In a good situation, he could be a late second round rookie pick. In a bad spot, he's a third or fourth round flier. Scouting The Wide Receivers Lil'Jordan Humphrey, WR Texas Week 12 - vs Iowa State (11/17) Not only does Lil'Jordan Humphrey have the best name in all of college football, but he's turned into a legitimate NFL prospect, this year. Lil'Jordan Humphrey G Rec Yds Avg TD MS Receiving Yards MS Receiving TDs Dominator 2016 3 2 15 7.5 0 0.00 0.00 0.00 2017 11 38 439 11.6 1 0.13 0.05 0.09 2018 10 63 947 15 7 0.35 0.32 0.33 Career 24 103 1401 13.6 8 0.15 0.13 0.14 Prior to 2017, Humphrey was a relative unknown. Even as a big target, he only managed 1 touchdown through his first two seasons. But with Texas's reemergence, Humphrey has become a big part of the offense and he's on his way to a true breakout season. Already at 7 touchdowns, he's demonstrated that he's capable of the role scouts will hope for him. And with 35 percent of his team's passing yards, he's shown that he's an option anywhere on the field. #TeamBigWR is going to fall in love with Humphrey as a future red zone option. Standing at 6-foot-4, Humphrey will have NFL scouts salivating if his combine results match his athleticism displayed on the field. And at only 20 years old, Humphrey's age will not be any concern. CBSSports ranks him as the outside of the top 15 WRs. As a dynasty prospect, Humphrey will likely be a back-half of the rookie draft type prospect. However, if he manages to elevate his draft stock into the first three rounds, then he should be seriously considered in back end of round 2 of rookie drafts. More NCAA Football Analysis | Mid | [
0.6443914081145581,
33.75,
18.625
]
|
This research project starts on the corner of a coffee table with my PhD supervisor. It starts with an intuition, here formulated into hypothesis: “The efficiency and impact of design fiction’s generated discussions would be greater if its public would be constructed ‘bottom-up’, based on participants/audience recommendations.” | Mid | [
0.6202247191011231,
34.5,
21.125
]
|
Scott Morrison's new ministry — who is in and who has moved Updated Prime Minister Scott Morrison has announced his new ministry as the Coalition begins its third straight term of government. So who's taking on new responsibilities, who's staying put and who's out? New: Scott Morrison Prime Minister, Minister for the Public Service Mr Morrison has taken the responsibility for the public service from Mathias Cormann New: Bridget McKenzie Minister for Agriculture The Nationals deputy leader becomes Australia's first female Agriculture Minister New: Mark Coulton Minister for Regional Services, Decentralisation and Local Government Picks up Bridget McKenzie's old portfolio New: Jane Hume Assistant Minister for Superannuation, Financial Services and Financial Technology Picks up an assistant role acknowledging her work on Senate committees New: Steve Irons Assistant Minister for Vocational Education, Training and Apprenticeships Promoted after holding onto his marginal seat New: Nola Marino Assistant Minister for Regional Development and Territories Takes over from Sussan Ley, who is now becoming Environment Minister New: Michael Sukkar Assistant Treasurer, Minister for Housing Returns to previous role of Assistant Minister but picks up Minister for Housing New: Jason Wood Assistant Minister for Customs, Community Safety and Multicultural Affairs Mr Wood has a multicultural electorate and held on to his seat, which was targeted by Labor New: Christian Porter Attorney-General, Minister for Industrial Relations Remains Attorney-General but will also become Minister for Industrial Relations New: Marise Payne Minister for Foreign Affairs, Minister for Women The Senator retains her Foreign Affairs portfolio but also becomes the Minister for Women New: Trevor Evans Assistant Minister for Waste Reduction and Environmental Management The second-term MP gets his first assistant minister job New: Richard Colbeck Minister for Aged Care and Senior Australians Minister for Senior Australians Minister for Youth Minister for Sport Promoted to Minister for Aged Care and Senior Australians, and Minister for Youth and Sport New: Angus Taylor Minister for Energy and Emissions Reduction Picks up the new responsibility for emissions reductions New: Sussan Ley Minister for Environment Returns to Cabinet, taking over Melissa Price's portfolio New: Ben Morton Assistant Minister to the Prime Minister and Cabinet Ben Morton was a key advisor to Scott Morrison during the campaign New: Linda Reynolds Minister for Defence Picks up the portfolio held by the retired Christopher Pyne New: Zed Seselja Assistant Minister for Finance, Charities and Electoral Matters Retains Assistant Finance Minister role while becoming Assistant Minister for Charities and Electoral Matters New: Stuart Robert Minister for National Disability Insurance Scheme, Minister for Government Services Promotion for a close ally of Mr Morrison's who was previously Assistant Treasurer New: Ken Wyatt Minister for Indigenous Australians Ken Wyatt will become the first Indigenous person to take responsibility for Indigenous affairs New: Anne Ruston Minister for Families and Social Services Will be elevated to Cabinet and become Minister for Family and Social Services, taking Paul Fletcher's old job New: Luke Howarth Assistant Minister for Community Housing, Homelessness and Community Services Takes some of Sarah Henderson's responsibility, after Ms Henderson lost her seat at the election New: Greg Hunt Minister for Health Assistant Minister for the Public Service and Cabinet Health Minister role remains unchanged although he is now also the Assistant Minister for the Public Service and Cabinet New: Alex Hawke Assistant Defence Minister Minister for International Development and the Pacific Loses Special Minister of State role but stays in outer ministry. A close ally of Scott Morrison New: Paul Fletcher Minister for Communications Minister, Cyber Security and the Arts Shifted from Social Services Minister, taking responsibilities now for Communications, Cyber Security and the Arts New: Alan Tudge Minister for Population, Cities and Urban Infrastructure Promoted to Cabinet but will continue in his current portfolio New: Melissa Price Minister for Defence Industry Will no longer serve as Environment Minister and shifts to Defence Industry New: David Littleproud Minister for Water Resources, Drought, Rural Finance, Natural Disaster and Emergency Management No longer serves as Agriculture Minister Stays: Josh Frydenberg Treasurer Role remains unchanged Stays: Michaelia Cash Minister for Employment, Skills, Small and Family Business Retains many of her existing responsibilities and she will pick up some of retiring Kelly O'Dwyer's responsibilities Stays: Michael McCormack Deputy Prime Minister, Minister for Infrastructure and Transport and Regional Development Role remains unchanged. Stays: Scott Buchholz Assistant Minister for Road Safety and Freight Transport Role remains unchanged Stays: Andrew Gee Assistant Minister to the Deputy Prime Minister Role remains unchanged Stays: David Coleman Minister for Immigration, Citizenship, Migrant Services and Multicultural Affairs Role remains largely unchanged. Migrant Services has been added to his title Stays: Mathias Cormann Minister for Finance Finance Minister role remains unchanged although he has lost responsibility for the public service Stays: Matthew Canavan Minister for Resources and Northern Australia Role remains unchanged Stays: Dan Tehan Minister for Education Role remains unchanged Stays: Karen Andrews Minister for Science and Technology Role remains unchanged Stays: Simon Birmingham His role as Trade Minister is unchanged Stays: Peter Dutton Remains as the Minister for Home Affairs Stays: Darren Chester Minister for Veterans' Affairs Minister for Defence Personnel Roles largely remain unchanged Stays: Michelle Landry Remains as the Assistant Minister for Children and Families Out: David Fawcett Mr Fawcett was Assistant Defence Minister but now has no ministerial role. Out: Mitch Fifield The former communications minister will be recommended as Australia's new ambassador to the United Nations Topics: federal-election, government-and-politics, federal-elections, scott-morrison, australia First posted | Mid | [
0.615803814713896,
28.25,
17.625
]
|
A new report from the Center for Immigration Studies to be released Wednesday examines Immigration and Customs Enforcement raids on U.S. meatpacking plants and their aftermath. It notes the historical context of an industry whose workers have seen a dramatic decline in wages over the past 30 years as well as the raids' economic effects, the center said. Additionally, research and education group the Crop Protection Research Institute (CPRI) said it will release the results of its study on the value of insecticides in U.S. crop production later this week at the National Press Club in Washington, DC. According to the institute, the study documents how insecticides have protected the yields of numerous crops in the U.S. since their introduction to American agriculture more than a hundred years ago. Insecticide use has prevented the loss of 50 percent of the production of most U.S. crops beneficial in feeding millions of people while keeping food affordable, the CPRI said. CropLife Foundation, a non-profit, non-advocacy organization created to advance the understanding of pesticide use in the U.S., sponsored the research by CPRI. | High | [
0.660421545667447,
35.25,
18.125
]
|
The city of Udaipur is located in the southern end of Rajasthan, a fertile valley bounded by hills. Owing to the mountainous divide of the Aravalli ranges in the state, the region of Mewar, characterised by rocky hills, dense forests, elevated plateaus and alluvial plains, presents a geographical scenario almost opposite to the sandy, arid landscape of Marwar. While the south-west monsoon winds, running parallel to Aravalli, surpass the region causing very little rainfall, Southern Rajasthan captures low-velocity winds obstructed by hills, causing humid conditions. Mewar’s unique topography is drained by two main rivers – Banas and Berach, the floodplains of which have been home to ancient Ahar cultures dating back to the time of Harappan civilisation. (Aquatic Resources: A Case Study of Udaipur ‘City of Lakes’, Rajasthan – Hemant Mangal and Sandhya Pathania) Udaipur’s ancient synonymy with lakes began as early as 1568 when Rana Udai Singh decided to move his capital here, after Chittorgarh had succumbed to Akbar’s forces. He strategically ordered the royal palace to be built on the east of the artificial embankment of Lake Pichhola, securely surrounded by scrub-forested hills. (The City Palace Museum Udaipur: Paintings of Mewar Court Life – Andrew Topfield) Negotiating the gradually sloping terrain of the region, the flow of water had to be checked at crucial points to provide for domestic and irrigational needs as well as create a recreational landscape for Rajput royalty. The Southern tip of Lake Pichhola, with its depth varying from 4 to 8 metres, was secured with a stone masonry dam to ensure a perennial supply of water for the city’s sustenance. The early settlement of Udaipur spread in the bowl-shaped basin fed by river Ayad, a tributary of Banas that ultimately drains in the Gulf of Kutch. Through the landform of valleys and ridges, seasonal streams briefly collected water into natural depressions. These catchments could be harnessed to become provisional means of water supply through a series of channels and harvesting infrastructure. This resulted in the indigenous system of inter-connected lakes of Udaipur that has made the city self-sufficient till date. The south-easterly slope of the terrain brings water from the upper lakes of Bada Madar, Chhota Madar and Badi Talav, channelising it into six networked lakes within the city and further towards the downstream lake of Udaisagar. While Pichhola and Fatehsagar are the two largest lakes located in the heart of the city, the others act as smaller overflow tanks. These are all connected with linkage channels that follow the contours to allow a natural sequence of flow and are separated with sluice gates to prevent any solid material from being carried on. Dense settlement around the water edges and protected green fringes direct the city’s stormwater into the lakes. (Urban Water Resource Management for Udaipur City -Anil Kumar Bairwa, Dissertation, IIT Roorkee) Sketching the Past The fourteenth century landscape of Udaipur was a combination of hills, mounds, streams and marsh, dotted with trees and lush with wildlife. The Monsoon Palace of Sajjangarh, located at the highest point of the city, had been built solely to enjoy the view of exotic migratory birds of the season and conduct hunting expeditions into the jungle. Many miniature paintings of that time vividly render tiger hunting scenes set against a dense green vegetative background. The embankments around Lake Pichhola has a series of ghats, one of the most interesting interfaces between land and water, flanked with traditional bath houses, temples and havelis. A point of social convergence and a platform for celebration, rituals and domestic chores, they must have been central to people’s lifestyle in the past. Architectural nuances like jali-windows, balcony projections, arched elements and colonnaded pavilions respond to the microclimate conditioned by the presence of lakes in the city and create an array of visual links with water (An exploration of the historic core along Lake Pichola in Udaipur– S. Samant, School of the Built Environment, University of Nottingham, UK). Historical accounts vividly describe the boat procession during Gangaur, a colourful festival of the womenfolk of Rajasthan, to be a mesmerising spectacle. Col. James Tod, an English officer under the East India Company and author of Annals and Antiquities of Rajasthan, remarked: “A more imposing and exhilarating sight cannot be imagined than the entire population of the city thus assembled for the purpose of rejoicing the countenance of every individual from the Prince to the peasant, dressed in smiles. Carry the eye to heaven and it rests on a sky without a cloud; below is a magnificent lake, the even surface of blue waters broken by palaces of marbles, whose arched piazzas are seen through the foliage of orange grove plantain and tamarind; while the vision is bounded by noble mountains, their peaks towering over each other and composing an immense amphitheater.” In earlier times, the lakes were not a direct source of water to be used by the public. Instead, they were part of the ecosystem that had evolved to be in sync with nature. While these large catchments served as reserves, collecting rainwater during the season and maintaining their level all round the year, surrounding forest cover ensured minimum erosion. It absorbed excess surface water and prevented silt from being deposited on lake beds. Understandably, this kept the ground water table recharged, allowing sufficient seepage in wells, stepwells and kunds, from where water was drawn on a daily basis. This cycle of replenishment, only complete with aquatic life, birds and trees, never deprived the city of its serene waterscape. Present day With the hike in population, Udaipur’s boundaries have pushed out of its hilly confines and condensed the historical core further inward. With about 70 ghats, 80 plus hotels and 6,000 houses located on lake slopes, these water bodies are under constant threat of degradation. (Eutrophication in the Lakes of Udaipur city: A case study of Fateh Sagar Lake – Deeksha Dave, 2011) Bathing and washing activity, garbage, sewage, chemical effluents and layers of algae are polluting Udaipur’s only source of drinking water. Alarmingly, untreated industrial waste also finds its way in the water streams from zinc smelting plants, marble factories and mining sites. River Ayad, which flows through the heart of the city, has pityingly been reduced to a canal, its flow hindered with construction debris in some pockets while other areas are left dry due to overgrazing and digging. Since deforestation and siltation have reduced the lake depths to a quarter of what it was 50 years ago, the natural cleansing process through sedimentation does not happen efficiently. While authoritative bodies have acknowledged an environmental urgency in this matter, little has come to effect. In a recent notice by the high court to take immediate action for the protection of lakes, all construction activity has been banned around sensitive areas and restrictions imposed on social and religious events that may pollute the banks of these water bodies. Every commercial set-up within the range of 250 metres, including restaurants, hostels and guest houses have had to sign an undertaking to ensure no harmful substances are released in the lakes. The Lake Conservation Society, an independent body of volunteers established in 1992, actively identifies pressing issues in this regard and compiles status reports. However, it is not uncommon to find unchecked sewage outlets directly meeting Lake Picchola and marble slurry dumps contaminating groundwater (Citizens’ Role in Ecological, Limnological, Hydrological Conservation of Udaipur Lake System -Anil Mehta, Jheel Sanrakshan Samiti Udaipur). Luxury hotels like the Leela Palace and Oberoi Udaivilas, opened in the year 2000 among many others, just a few feet from the water edge, have contributed to Udaipur’s international tourism success along with accelerating pressure on the remaining lakefront land. It has opened doors for smaller entrepreneurs to acquire properties along the lake periphery and convert them into heritage lodging. The clustering built mass communicates economic desperation and struggle for livelihood as well as a drifting interest from conservation of resources. The changing scenario has alienated harmonious communities from their landscape, prioritising individual needs. The way forward Udaipur’s lakes are the relief points of the city, calming waters punctuating a busy urbanscape. They are liquid pores in a sprawling mass, giving a distinct identity to this place. The Master Plan of 2031 maintains green zones around Fatehsagar and Pichhola, carefully protecting the mounds around these lakes (Nagar Niyojan Vibhag, Rajasthan). The open tracts of land in their vicinity are indicated as recreational parks, playgrounds, stadiums or Government Reserved Areas. Some of these are landscaped gardens with stone sculpture insets by local artists while are others raw sites adopted by the Forest Department like that around Sajjangarh pronounced as the Biological Park. Areas around Badi Lake, most of which is mentioned as agricultural land or reserved forest area, remains comparatively untouched despite excessive urban pressure. The fluidity of this landscape, with its undulating nature and natural soaking ground, has this particular lake full to the brim. The lakes of Udaipur are layered and networked, not singular and secluded. They need permeable edges and buffers that allow them to expand and contract, to accommodate degrees of uncertainty and critically negotiate their presence in an urban environment. Taking a cue from its own ancestral wisdom, the city needs to readopt its nonlinear system of supplying water, where the lakes do not serve as shallow storage containers but organic depressions that help replenish groundwater. Their boundaries should gradually transient into wetlands that naturally purify the inflow, instead of abruptly ending in dead bund walls (Deccan Traverses: The Making of Bangalore’s Terrain – Anuradha Mathur and Dilip da Cunha). A large infrastructure of stepwells and kunds that lies forgotten in muck can be revived to participate in the system once more. Architectural innovation can retain natural sponges while allowing public access, instead of crudely compromising with hard pavements and solid barriers. Urban design can then establish a dignified association of the city with its water bodies, accounting for a gradient terrain and seasonal channels of water. However, first and foremost, we need a dialogue. Rupal Rathore is an architect and a graduate of NMIMS, Mumbai. This article was originally published in the Journal of Landscape Architecture and has been reproduced here with permission. | Mid | [
0.6328125,
30.375,
17.625
]
|
Human globin chain separation by isoelectric focusing. Human globin chain separation, a key procedure in the study of hemoglobinopathies, is routinely performed by chromatography on carboxymethylcellulose. This method, though relatively easy and highly reliable, is expensive and time consuming. A new procedure, based on isoelectric focusing, is presented which allows the simultaneous separation of globin chains from multiple samples (at least 20 per gel slab). The method is rapid, inexpensive and can be easily carried out in clinical laboratories, and its high sensitivity allows the identification of radioactive bands even with minute amounts of labelled material. A new phenomenon, called the 'Nonidet P-40 effect', which greatly enhances the separation between gamma and beta chains by binding to these two chains and shifting their pI values in opposite directions, is described. | High | [
0.6809583858764181,
33.75,
15.8125
]
|
In Ubuntu 12.04 LTS, you can explore new upcoming apps or undiscovered cool apps – easily using Ubuntu Software Center. Now, some proprietary cool games are also available, besides the huge collection of free softwares. Here are some cool – collection of some most useful apps – that you must try in Ubuntu 12.04 or equivalent distributions such as kubuntu, Linux Mint etc. Top 10 Apps for Ubuntu 12.04 users! #1. Nitro Nitro is a cool app for managing your tasks, your todo list – in an easy way. Installing Nitro-tasks in Ubuntu/Linux Mint (Using PPA) sudo add-apt-repository ppa:cooperjona/nitrotasks sudo apt-get update sudo apt-get install nitrotasks #2. Synapse Synapse is a graphical launcher (more accurately – a semantic file launcher), also very useful in searching stuffs. If you’re looking for an equivalent of Unity HUD (e.g while using Cinnamon or XFCE on Ubuntu) then you must try it. Installing Synapse File launcher in Ubuntu / Linux Mint sudo apt-get install synapse #3. Miro Miro is a music player – that can play videos from the web, you can also download it if you want. Enjoy watching videos from the popular sites like YouTube, Hulu, Amazon Mp3 store as well as the podcasts and video feeds. Additionally, it can also do some video format conversion works for you. Installing Miro Video aggregator in Ubuntu /Linux Mint sudo apt-get install miro #4. Shutter Shutter is a full featured screenshot application. You can easily capture screenshot of a window or a specified rectangular area – with or without a delay. You can also edit your screenshot using the embedded drawing tool, apply cool effects, and upload/export images automatically to the configured ftp host or Ubuntu One. Installing Shutter in Ubuntu [12.04] /Linux Mint (13) sudo apt-get install shutter #5. Eidete Eidite is a Screencasting application, it’s designed for simplicity and it works! You must checkout if you’re not happy with the other screen recording application such as recordMyDesktop or Kazam. Installing Eidete in Ubuntu / Linux Mint sudo add-apt-repository ppa:shnatsel/eidete-daily sudo apt-get update sudo apt-get install eidete #6. Steadyflow Steadyflow is a simple download manager, with an easy to use GUI and great features. Installing Steadyflow download manager in Ubuntu / Linux Mint sudo apt-get install steadyflow #7. Zim Zim is a wiki application. It has some nice features (sync, links, formatting, images etc) with a nice UI. it’s really good for wiki style notes. The sync features keeps your notes updated (if you use it on multiple computer, using Ubuntu One or Dropbox) and safe. Installing Zim Desktop Wiki in Ubuntu / Linux Mint sudo apt-get install zim #8. Catlooking Catlooking is a distraction free writing app for those who love writing and looking for a text editor with minimal features. Download Catlooking and install it using a gdebi package installer (in Linux Mint) or Ubuntu Software Center (in Ubuntu). #9. Handbrake Handbrake is a video transcoder application, available for all platforms. It has lot of cool features and it supports variety of formats, so it can convert your video files for any devices you want. Installing Handbrake Converter in Ubuntu 12.04 open a terminal and type the commands – sudo apt-add-repository ppa:stebbins/handbrake-releases sudo apt-get update sudo apt-get install handbrake #10. OpenShot OpenShot is a simple and easy to use video editor, like a good substitute for the windows movie maker. it has nice features and it’s really good for beginners. Installing OpenShot Video editor in Ubuntu [12.04] / Linux Mint (13 – Maya) If it’s not already there in your system package, install it using the PPA (otherwise skip the first two commands) sudo apt-add-repository ppa:openshot.developers/ppa sudo apt-get update sudo apt-get install openshot Update 1 : Added the ppa for nitro tasks. (Thanks to reddit users) | High | [
0.6650366748166251,
34,
17.125
]
|
History We proudly serve many restaurants and organizations in the area. Take a look at the list! The origin of Italian Peoples Bakery goes back to 1936 when Pasquale Gervasio, the patriarch of the family, opened a bakery on Hamilton Avenue in Trenton, New Jersey. Over the years his reputation for making wonderful bread spread. As the business grew, he operated the bakery with the help of his wife, Margaret, and their five children. It was this next generation who would eventually clean, mix, mold and deliver the bread and build a very successful wholesale-retail bakery business. The children, namely, Theresa, Phyllis, Frank, Johnny and Victor, carried on with the family business as it grew into something wonderful within the small Italian community known as Chambersburg. The Company was incorporated on April 1, 1956 and continued to operate and grow over the next twenty years. The wholesale business was expanded by deliveries to small delis' supermarkets, restaurants, hospitals, government facilities and houses. The small retail store was eventually moved and expanded to include pastry when a neighborhood competitor went out of business and a deli when customers requested one. Automated production equipment was slowly introduced to increase capacity and reduce labor and materiel costs. In 1976 the Company recognized that the population was migrating to the suburbs and a decision was made to follow the market by expanding and opening additional retail locations. Between July, 1976 and May, 1990 the Company opened 8 satellite retail stores. In order to maintain control of product quality and consistency, all bread, roll and pastry products were manufactured at the main facility and delivered for bake off and sale at the retail stores. During this period of retail expansion the Company also moved to expand its production capability and widen its product lines. Seeing the need for a "real sourdough rye" the Company acquired Frey's Baking Company in February, 1986. Later, in May, 1990, the Company acquired a financially troubled neighborhood competitor, New Colonial Bakery. This not only generated a substantial increase in wholesales sales, but also allowed for the much needed expansion of the packing and distribution area. Adjacent to the Company's plant, New Colonial's building was gutted and the two properties were connected with a link which included an expanded conveyor system to deliver fresh baked product to the much larger staging area. For the next six years the Company concentrated on absorbing its acquisitions, expanded distribution and planning for future growth and modernization. Additional real estate purchases were made in the neighborhood, with the eventual plan of building a larger and much more modern production plant. | Mid | [
0.611607142857142,
34.25,
21.75
]
|
This Weekend's "Shell No" Rally Focused on People, Not Polar Bears Hundreds of people—one organizer estimated more than a thousand—attended the event. Leaders from Bayan-USA, Got Green, Gabriela Seattle, Greenpeace, Plant for the Planet, and the Tsleil-Waututh Nation delivered speeches before the crowd marched south to Port of Seattle headquarters with big signs and a red kayak full of handwritten messages to port commissioners. Joshua Kelety "Stand up in whatever manner you can," University of Washington fossil fuel divestment organizer Sarra Tekola instructed a fired-up crowd of "Shell No" demonstrators in Myrtle Edwards Park this past Sunday. "This is our lunch counter to sit on. This is our history to be made. We hold the world in our hands." If 20th century environmentalism too often looked like white people expressing concern for pristine wilderness and endangered animals, Sunday's protest against Shell's Arctic drilling rigs mooring in Seattle showed how much the movement has evolved. The demonstration centered on people most adversely affected by a continued reliance on fossil fuels. They represented urban communities of color with disproportionate asthma rates, islanders displaced by rising sea levels, indigenous homes threatened by resource extraction, and those hard-pressed to afford survival when the worst effects of climate change arrive. In February, with very little public notice, the Port of Seattle signed a lease to allow Shell's Arctic drilling fleet to moor at Terminal 5 in the drilling off-season. In spite of recent research showing that exploiting any Arctic oil and gas would be inconsistent with staying below a two-degree Celsius global warming safety limit, and in spite of the port's "Where a sustainable world is headed" slogan, King County's five elected port commissioners held just one public meeting on the subject within a week of announcing the proposal's existence before giving the deal a green light. In the aftermath of that decision, a coalition of local activists are organizing a three-day "festival of resistance" against Shell's Arctic drilling rigs, including a flotilla of kayaks and a day of mass direct action, in May. Representation of a fearsome kayaktivist. Organizers are planning a kayak-based demonstration in Elliott Bay on May 16. Joshua Kelety Rising Tide Seattle organizer Ahmed Gaya coordinating chants from the crowd. Joshua Kelety Bayan-USA Pacific Northwest, Anakbayan Seattle, Gabriela Seattle, and Got Green covered Diskarte Namin's "River (Chico Redemption)." Joshua Kelety Sarra Tekola, of the University of Washington's divestment movement: "This is the people versus Shell. Complacency equals consent. And if you aren't standing up against Shell when they're here in our backyard, then you are also guilty." Joshua Kelety Oh, hey! It's four out of the six Greenpeace volunteers who scaled one of Shell's Arctic drilling rigs as it journeyed across the Pacific. Joshua Kelety Aji Piper (center), president of the local Plant for the Planet chapter, dances with his brother and sister to an adaptation of "Uptown Funk" with lyrics about climate change and the oil industry. Joshua Kelety Sundance Chief Rueben George spoke about his people's opposition to the Kinder Morgan pipeline project in British Columbia. Joshua Kelety The anti-Shell party hats added a nice touch. Joshua Kelety The demonstration wound south of Myrtle Edwards Park to Port of Seattle headquarters on Alaskan Way. Joshua Kelety In February, the Port of Seattle signed a lease with Foss Maritime to let Shell use the port's Terminal 5 to moor its Arctic drilling fleet in the exploration off-season. Joshua Kelety Once at the Port of Seattle building, organizer Kurtis Dengler asked the crowd how many people found out about the port's winter mooring deal for Shell after the lease had already been signed. Joshua Kelety | Mid | [
0.6365979381443291,
30.875,
17.625
]
|
Plant Protectors: Meet the Tryke Security Team Photo: Shane O’Neal – SON Studios If you’ve ever been to Reef Dispensaries, chances are you’ve seen them. Emblazoned in khaki pants and black collared shirts, the Tryke Security team is posted up outside of the building, keeping an eye on things. While they can appear intimidating, ultimately the team is there for the safety […] If you’ve ever been to Reef Dispensaries, chances are you’ve seen them. Emblazoned in khaki pants and black collared shirts, the Tryke Security team is posted up outside of the building, keeping an eye on things. While they can appear intimidating, ultimately the team is there for the safety of the employees and the customers. Tryke Security maintains contracts with all six Reef locations across Nevada and Arizona. Stu Johnson, Director of Security for Tryke (Reef’s parent company), explains that this “big dog in the front yard” posture is enough of a deterrent in itself, while his 40-person team is made up of all veterans and many former police officers with special training. Johnson, who spent 8 years in the military and 23 years in law enforcement, ironically has a background in narcotics. You read that right: Stu went from seizing drugs to protecting them. “It’s funny because we’ve never found marijuana to be an issue, even when we were cops. The enforcement of archaic laws is silly to me,” he says. “I often joke that I only made one marijuana arrest in my career in law enforcement because it was a trailer of terrible brick weed smuggled in from Mexico. Other than that, it was simple possession and we’d say ‘Hey man, get rid of it.’” Stu’s perspective as a former cop and as head of security for one of the largest marijuana companies in the country lends an honest perspective that not many have seen. Having been on both sides of the issue, Stu says that cannabis was never really much of a problem for officers of the law. In fact, going after it was more trouble than it was worth. “Marijuana enforcement took a backseat to the other drugs that were more prevalent, such as black tar heroin, which the only reason that it is prevalent is because of the pharmaceutical companies. If someone gets hooked on oxycodone, their next step is to get on black tar heroin because it’s cheap and easy to get ahold of,” he says. Tryke’s K9 Program Manager Guy Joslin agrees, himself having spent over 16 years in the military and 13 years in law enforcement. “I learned a lot about marijuana as a cop, but I didn’t learn a lot of the truth as a cop,” says Joslin. “Once you realize that it is relatively benign, it’s very hard to justify going after it. Especially when we were seizing kilos of methamphetamines, pharmaceuticals, and heroin.” Having been on the front lines, both Stu and Guy agree that marijuana poses no real danger, making their career transitions into the cannabis industry a smooth, natural–if not somewhat strange–progression. During their time behind the badge, the two had seen that in almost every case, crime was attached to drugs other than weed. “The only thing I ever dealt with regarding marijuana was the fact that marijuana was illegal.” Joslin reveals. “But with the other drugs, name the crime and it was happening.” Interestingly enough, studies have shown that there is less crime near marijuana dispensaries. That rings true for Reef as well, with its heavy security presence surely playing a role. Otherwise, the prospect of a cash business that can’t use banks and that’s filled with cannabis would be a pretty attractive target. “We actually did a crime analysis here before we built this building and then did another right before we went recreational. I’ll tell you, the crime statistics have gone down. The robberies are almost null and void in this area here… It shows that our presence here has inadvertently stopped a lot of the crime,” says Stu. “I had a Metro Police captain come here and tell me that they are so happy that we are here and that our organization is the way that it is, because we are reducing crime with just our presence in the area.” Reef Dispensaries serves thousands of customers per day, typically without any problems. Interestingly enough, the few incidents that they have had have been mostly alcohol related, says Johnson. He explains that Tryke Security’s true mission is to make sure the consumer has a safe and comfortable experience; safeguarding the plants and assets is a secondary benefit. “The reason that we chose the security model that we have is that we like to protect our customers and make them feel safe,” he reveals. “Nobody is going to harass them in the parking lot on the way in or out, despite the fact that they are going to be doing a cash transaction or leaving with product.” The professionalism that years of military and special forces training have instilled in the Tryke Security team does not go unnoticed, as each member conducts themselves in a polite and collected manner. There are no jumpy, rent-a-cops on Stu’s team. “Because of our backgrounds – military, law-enforcement, or contracting – we’re not hyper vigilant. A guy that isn’t sure what’s coming next, he may be a little more aggressive,” explains Joslin. “But people that come through our door, we smile at them, welcome them, thank them for coming, talk to them if they want to talk. They usually are surprised that we are approachable.” “The guys that are working here have had substantial training. They don’t have that Barney Fife, Paul Blart: Mall Cop mentality, where they are jumping around, looking for something to do,” adds Johnson. “We understand threat levels and body language. We also realize that if we were to react in a panicky way, that makes everyone else nervous, so we try to keep it calm and relaxed.” Never once having a robbery attempt or major incident, Reef Dispensaries’ approach to security has arguably become a model for the rest of the industry and has been praised by the state of Nevada, according to Johnson. “To me it’s worth every ounce of prevention in the long run, to ensure that the employees are safe, the customers are safe, and the community is safe,” says Johnson. | Mid | [
0.579520697167756,
33.25,
24.125
]
|
City Farmhouse to Close Retail Store City Farmhouse, located inside The Factory at Franklin, shared some news with their followers on social media Friday. In June, City Farmhouse will close their brick and mortar location to focus more on Pop-up Fairs in Franklin as well as across the country. In their Facebook message, they wrote about how much they love being on the road in their 1962 Globetrotter Airstream (fun fact: they got their airstream from Sheryl Crow and it once belonged to the Kennedy family too.) They also hinted at a new show concept to roll out later this year. City Farmhouse will continue to occupy their space at The Factory but it will no longer serve as a storefront but more as storage and staging for their upcoming shows. Through June 16 you can continue to shop at City Farmhouse where you can have the opportunity to purchase items which have never been available before like the chandeliers installed in the store, 1800s doors, and the big white mirror. See the entire message on Facebook here. Be sure to follow City Farmhouse on social media for updated local sale dates and news on their travels. City Farmhouse moved to The Factory back in 2015 after having a storefront in downtown Franklin for six years. In 2017, City Farmhouse transformed their retail store into an event space and later back to a retail space for the launch of their book City Farmhouse Style. City Farmhouse owners Kim and David Leggett have been “pickers” for more than 20 years, and their trained eye and vivacious personalities have earned them national acclaim. Donna is one of those former corporate types (Xerox) who wanted to try something new. She went from marketing to blogger and now Style Editor, and is always on the lookout for what’s trending in restaurants, new stores, charity events, and entertainment. To keep up the pace, Donna is usually found drinking at least one Cold Brew coffee a day or on a busy day make it two. Contact me at [email protected]. | Mid | [
0.590809628008752,
33.75,
23.375
]
|
Responses of pulmonary platelet-derived growth factor peptides and receptors to hyperoxia and nitric oxide in piglet lungs. The peptides platelet-derived growth factor-A (PDGF-A) and especially -B have important roles in lung development. The effect of hyperoxic exposure with and without inhaled nitric oxide (iNO) on lung expression of PDGF and its receptors is unknown. We hypothesized that hyperoxia exposure would suppress mRNA expression and protein production of these ligands and their receptors. The addition of iNO to hyperoxia may further aggravate the effects of hyperoxia. Thirteen-day-old piglets were randomized to breathe 1) room air (RA); 2) 0.96 fraction of inspired oxygen (O2), or 3) 0.96 fraction of inspired oxygen plus 50 ppm of NO (O2+NO), for 5 d. Lungs were preserved for mRNA, Western immunoblot, and immunohistochemical analyses for PDGF-A and -B and their receptors PDGFR-alpha and -beta. PDGF-B mRNA expression was greater than that of PDGF-A or PDGFR-alpha and -beta in RA piglet lungs (p<0.05). Hyperoxia with or without iNO reduced lung PDGF-B mRNA and protein expression relative to the RA group lungs (p<0.01). PDGF-B immunostain intensity was significantly increased in the alveolar macrophages, which were present in greater numbers in the hyperoxia-exposed piglet lungs, with or without NO (p<0.01). PDGFR-beta immunostaining was significantly increased in airway epithelial cells in O2- and O2+NO-exposed piglets. PDGF-A and PDGFR-alpha immunostain intensity and distribution pattern were unchanged relative to the RA group. Sublethal hyperoxia decreases PDGF-B mRNA and protein expression but not PDGF-A or their receptors in piglet lungs. iNO neither aggravates nor ameliorates this effect. | Mid | [
0.555555555555555,
29.375,
23.5
]
|
This Program Project grant is designed to enhance our understanding of the basic mechanisms responsible for gastrointestinal (Gl) motility. Knowledge of mechanisms that generate normal motility patterns will help explain what goes awry in motility disorders and develop novel approaches to therapies. In this Program we are investigating smooth muscle cells, Interstitial cells of Cajal (ICC) and PDGFRa+ cells of Gl muscles, which through electrical coupling, form a syncytial tissue we refer to as the SIP syncytium. Cells of the SIP syncytium generate electrical pacemaker activity and provide what has been known as 'myogenic' regulation of motility. SIP cells also receive and transduce inputs from enteric motor neurons, so they are key participants in neural regulation of motility. We have developed techniques to isolate and purify each class of cell in the SIP syncytium, and we have performed deep sequencing of the gene transcripts in these cells. Hypotheses in this proposal were developed from this unprecedented knowledge of the cell-specific transcriptomes of SIP cells. Four projects will investigate questions regarding the mechanism of pacemaking and propagation of electrical slow waves, integration of excitatory responses by ICC and smooth muscle cells in generation of propulsive colonic contractions, bioactivity and targets of purines released and metabolites produced in colonic muscles, and the fate and recovery of ICC in patho-physiological conditions causing loss of ICC. Three Core laboratories will support these projects. Core A will provide informatics support and aide investigators with experimental planning and data management. Core B will provide transgenic animal, isolate and sort cells by fluorescence activated cell sorting, and support organ cultures. Core C will analyze expression of genes and proteins in cells and tissues. Experiments will utilize transgenic mice as model organisms to test novel hypotheses. Ideas developed in rodent studies will be tested on cells and muscles of non-human primates and human patients. The research team is highly synergistic and collaborative and has a long track record of productivity and innovative contributions to neurogastroenterology. | High | [
0.7338345864661651,
30.5,
11.0625
]
|
TESTIMONIAL – TUMMY TUCK & LIPOSUCTION 3-11-2015 Dear Dr Ananda, Its been 2.5 months Post Op of Tummy Tuck and Lipo. I can say that you are a “cool” doctor. You can put anyone at ease and you have managed to reassure me and answer all my questions. I do appreciate your daily visits during my stay in the hospital and constant contact via Whats App which i felt was a nice gesture. Kudos to your staff and OT room staff esp to my anesthetist, who were all very highly skilled. The surgery went well and healing was unevenful, Thank God. Keep up the good work. I will definitely recommend Dr Ananda to anyone looking to have tummy tuck and lipo without a second thought. | Mid | [
0.549199084668192,
30,
24.625
]
|
Projections of the common fur of the muzzle upon the cortical area for mystacial vibrissae in rats dewhiskered since birth. In normal adult rats, the mystacial vibrissae and the common fur of the snout project at different loci on the SI cortex. The surface area of the normal fur projection is 0.8 mm2, whereas the vibrissa field amounts to 3-4 mm2. In rats dewhiskered since birth, the vibrissa area can still be identified through the projections from ipsilateral vibrissae (undamaged side). It is shown that in the absence of the vibrissae since birth, the vibrissa area, and this alone, is invaded by projections from the contralateral fur (damaged side). | Mid | [
0.620525059665871,
32.5,
19.875
]
|
About the blogger Tom Weber serves as co-host for MPR News’ The Daily Circuit. He joined MPR News in Jan. 2008 as a general assignment reporter, and soon moved to the K-12 education beat. In 2011, Weber was the lead reporter on MPR News’ investigation into Minnesota’s anti-bullying law, a ground-breaking report that has prompted new proposals and vigorous debate. Weber was a morning news anchor and reporter for KWMU St. Louis Public Radio for more than five years. He has won the regional Edward R. Murrow awards for writing and use of sound. Related Blog Posts Cannot legislate core values if voters don’t act you get the Woody Allen effect: the world is run by those who show up BJ I think they should be required to check in to polling location, but then they can just leave if they want. Kevin Mandatory voting would be acceptable IF there were an option for “none of the above”. Carmen Dahlberg You have it all backwards. The government should pay people for going to the polls. Just think how long those lines would be if each voter got a $20 bill along with their voting sticker! Mike M Ya that’s what we want, to force every uninformed and indifferent person to vote. Moronic! Do they have to vote for every item on the ballot? I don’t vote on those items, on which I’m ignorant. Jordan This should not even be a question. The more things that we “require” the less liberty we have. Remember that the government is there to serve us and not us to serve the government. If voting becomes mandatory it would be an insult to the country that we have fought so hard to build. Jefferson There is no need to make voting mandatory…I do believe that the day should be a national holiday in order to allow people the time to vote. The last thing we need is to force people who are uninformed and have no knowledge of the issues to cast a vote based on looks or what celebrities tell them. Dave69 Voting should be mandatory. SSN’s can be used for voting registrations. One SSN = one vote. Better tracking, and if voting was required, small fines could be attached to tax rolls. No cards required. Then voting could be done online, too. Why not? MN Mom Your last guest was ridiculous One – his assertion that Republicans are discouraging voters is a flat out lie. We all, democrats and republicants want fair elections. I often vote Republican and I am offended by this assult on my integrity. Second – he wants to mandate voting saying it is not much to ask since health insurance is mandated and the government mandates other things so he says “mandatory voting is not too big of an imposition”. But showing a photo id he would say, is asking too much! To much of an imposition? How very inconsistent! Where is the logic in this? We can make it easy for people to get a photo id and ensure fair elections. Jeffrey We should have mandatory voting, as other civic duties are mandated. It will clearly eliminate all the complaining by people who do not vote, and make those running for public office more accountable to the entire electorate. Jean I think if we were to make voting mandatory, we would have to create a national holiday or move voting to the weekend. Also, make public transportation free of charge on voting day, so everyone, especially those who can’t afford it, can get to the polls. J. Martin I’d like to take issue with the comparison to other countries, and Australia in particular. Two points: 1. Australia uses the Westminster system. Individuals vote for local representatives, and the majority party, or majority coalition selects the prime minister. The involvement demanded of individuals is therefore LOCAL involvement. In a system in which the head of state is directly elected (questions of the electoral college aside), the requirement would be for NATIONAL involvement. On those grounds, I find specious the supposition that mandatory voting would ease sharpening partisanship. Rather, the indifferent center would be forced to engage with a poisonously partisan environment, and the more likely scenario would be that the center would be divided. 2. When I lived in Australia in the 1990s, they struggled with what was called the “donkey vote,” where those who didn’t want to vote, but were required to, would simply vote for the first name on the ballot (or rank them 1, 2, 3, etc. straight down the page). This possibility is especially troubling when private enterprises, such as Diebold, control the voting systems. It would empower those in charge of designing the voter interface to prejudice the vote by capturing the votes of the indifferent. Chad This is a completely misguided idea. Part of the justification is to encourage moderates to vote, but the real result would be to annoy them. Just getting moderates to the polls would not lead to more moderate candidates on the ballot. What is needed is a different system for selection of party candidates–like open primaries coupled with more widespread media attention. Moderates need to be included in the process of selecting candidates they like, not just being compelled to pick what they view as the best of two bad options. (I think this is a bigger issue for legislative races, where most people probably couldn’t name a single candidate who didn’t make it to the general election ballot–the party faithful are fully in charge of the options in these races.) As far as voter suppression, this concept won’t help…if we don’t have the political will to end it, then we certainly don’t have the political will to enact mandatory voting. Lars Voter Ignorance is the Biggest Problem MN law lets party affiliation and “incumbant” be printed below the candidate’s name. This requirement only benefits entrenched political interests, and should be reversed. Voter ignorance is the biggest problem. A way to neutralize the effect of voter ignorance is to just list the candidate’s name without party or incumbancy indicators. Then, voters voting out of ignorance will cancel out (as in a random draw) and leave informed votes to indicate which candidate wins. Alana YES!! This needs to happen. I think there should be a holiday or more days for people to vote to reduce lines/time it takes to vote. No more excuses people, it is embarrassing how empathetic people are in this country when I hear about voter turn out in other democratic countries…. Craig Huber I do believe that voting is a duty of a citizen of a democracy. That said, mandatory voting is a recipe for disaster, in my opinion. Realistic enforcement would be ridiculously expensive, and the results would be at best chaotic, at worst detrimental. Making Election Day a national holiday is something I would like to see. Beyond that, however, any form of official enticement, positive or negative, is both inappropriate and far too likely to be ineffective. If we do not collectively care enough about our representative democracy to perform the minimal effort required to support and inform it (i.e. voting with knowledge and intent every couple of years), we deserve the consequences (and eventual loss of it) that will entail. Aaron How about having mandatory primary voting instead so these extreme left/right candidates don’t make it past the first round? Primaries seem a bit like a joke at the moment but they also create some of the most partisan politicians out there. lily It’s not unreasonable— jury duty is a required civic duty, and voting should be as well. In Australia, where voting is mandatory, you don’t actually have to vote; you can fill in a box for “none of the above”, but you do have to show up. Again, just like jury duty. And as was discussed earlier tonight on NPR, it would be a good thing because politicians wouldn’t have to appeal to the radical side of their base to ensure turnout, since everyone is already turning out. They would actually have to appeal to the middle, as has happened in Australia. Andrew I can understand that on first glance it almost seems authoritarian to have compulsory voting, but when you think about our civic duties in America, voting is just about the only one that ISN’T mandatory. The Census Bureau can impose fines for not responding to the Census, you can certainly be penalized for tax evasion, and how many young men during the Vietnam War had left the country to avoid compulsory military service? In light of these mandatory civic duties, it’s kind of strange that simply asking one’s anonymous opinion about who should lead should be left to choice. Why not conduct elections like the census? Why such a big difference between the two kinds of information being collected? | Mid | [
0.54229934924078,
31.25,
26.375
]
|
Subscribe to this blog Follow by Email Spirit Bound (Vampire Academy #5) by Richelle Mead After a long and heartbreaking journey to Dimitri's birthplace in Siberia, Rose Hathaway has finally returned to St. Vladimir's-and to her best friend, Lissa. It is nearly graduation, and the girls can't wait for their real lives beyond the Academy's iron gates to begin. But Rose's heart still aches for Dimitri, and she knows he's out there, somewhere. She failed to kill him when she had the chance. And now her worst fears are about to come true. Dimitri has tasted her blood, and now he is hunting her. And this time he won't rest until Rose joins him... forever. "Review" It was not as good as the last three books but still a 5-star read. It seems that Rose has finally gotten over Dimitri but she keeps getting letters from him. Dimitri can't let Rose go and now that she has refused to be awakened, he wants to kill her. Rose is now with Adrian. She doesn't love him like she did Dimitri but she is willing to give them a chance. There is still hope that Dimitri can be saved. The big question remained that what will happen in their love triangle? Here I want to say that this is the only thing in this series which I did not like. The reason is that Rose has really really strong feelings for Dimitri and we do not see her wavering from that. But when it comes to third person in these love triangles (Mason in first few book & Adrian in the rest), she doesn't feel much. She likes them but that's all. So in my opinion this makes her character a negative one. Not my favourite. It seems like she is using them to pass time or get over her love. Which is not very impressive if you asked me. Lissa and Christian remained my favourite characters in this book too. Their side of the story is always fun to read. Sometimes I wonder what this series would have been like if Lissa was the main character instead of Rose. She has better personality. But Rose is not all bad either. So now the sixth and final book. I really hope that it ends well. Because ending can change my take on the whole series. I have been loving these books so far and I hope that does not change. | Mid | [
0.5800865800865801,
33.5,
24.25
]
|
Rally Australia — the final and title-deciding round of the FIA World Rally Championship delivered some early drama but Mads Ostberg stayed out of trouble to lead for Citroen at the end of the opening day. The Norwegian now heads Craig Breen, who inched ahead of Jari-Matti Latvala by 1.9 seconds in the final super special stages of the day. This afternoon the crews repeated the same three morning stages and then, returning to Coffs Harbour, took in two runs over the popular but tricky coastal super special stage. Different tire strategies came into play but Ostberg consistently delivered best. Breen, now second, admitted to a couple of silly mistakes in the first of the repeated stages but a clean run through the remainder rewarded the Irishman and gave Citroen a provisional double podium. The second stage was a difficult one for Toyota, and Latvala, who played it safe through the water splash, was the only Yaris WRC driver to escape problems, enabling him to move ahead of teammate Esapekka Lappi to take second position earlier in the day. He maintained that place until the two super specials, where he then dropped behind Breen after clipping a bale. Hayden Paddon heads Hyundai’s challenge, as the Korean marque battles with Toyota for the Manufacturers’ Championship. The Kiwi was happy with his choice of tires for the loop, despite the rubber coming off the rim in the second stage. He remains in the thick of the fight for the podium, 12.5 seconds adrift of Ostberg. Championship outsider Ott Tanak climbed from sixth to fourth in the first stage in the afternoon, despite clipping a fence post and damaging the rear end of his Yaris WRC. However, he then lost all the front aero devices on the second stage when he powered sideways into the water splash. He managed to maintain pace and climbed to third at the expense of teammate Lappi but then dropped back to fifth after the final longest stage, the lack of aero front and rear hampering his charge. From second going into the loop, Lappi is now sixth, the same water splash causing him problems that dropped him to ninth. The young Finn’s engine ingested a lot of water and developed a misfire; he dropped over 20 seconds and was lucky to be able to continue. He is ahead of championship contender Sebastien Ogier, the Frenchman climbing from 10th to seventh in the final gravel stage, courtesy of team orders to Elfyn Evans and Teemu Suninen, who now sit directly behind him. Ogier has struggled running first on the road and two extra positions from his teammates, coupled with problems for championship rival Thierry Neuville, will give him a better road position for tomorrow and some breathing space to the Belgian. Thierry Neuville (Image by McKlein/LAT) Neuville was placed seventh but then in the last stage a tire came off the rim after a jump; he then locked up under braking and ran straight into a straw bail and stalled. The resultant time loss dropped him to 10th, some 30 seconds behind Ogier. The Chilean Heller brothers continue to top the FIA WRC 2 Championship standings, with Alberto heading Pedro by 20.6 seconds. Enrico Brazzoli, who provisionally won the FIA WRC 3 Championship on the last round in Spain, retired during the second loop for unconfirmed reasons. | Mid | [
0.6026785714285711,
33.75,
22.25
]
|
Background {#s1} ========== Unique to men who have sex with men (MSM) in many settings internationally (e.g., India and Peru) is the adoption of a fixed sexual role (insertive or receptive) rather than a versatile role during intercourse. This role segregation is important because of the different transmission risks of insertive and receptive anal sex and because biomedical interventions can potentially target specific individuals based on their sex role (insertive or receptive). Some candidate prevention interventions for MSM, currently under study such as circumcision and anal microbicides would likely only protect insertive and receptive partners respectively [@pone.0070043-McGowan1], [@pone.0070043-Wiysonge1]. Others such as condoms and antiretroviral based treatments protect MSM irrespective of their sex position [@pone.0070043-Grant1]. The goal of this study is to model the effect of these position sensitive interventions on HIV prevalence over a 20-year period using sex role data from South India. In heterosexuals, the effectiveness of circumcision and vaginal microbicides in preventing HIV is dependent upon sex position. For example, female receptive partners of circumcised men are not protected [@pone.0070043-Baeten1] and to date, there is no evidence that the male partners of women who utilize microbicides are protected. Additionally, in most Western settings, there has been little evidence for the benefits of circumcision among MSM [@pone.0070043-Jozkowski1] even stratifying for sex role and focusing on insertive-only sex participants [@pone.0070043-Millett1]. In international contexts, however, there is theoretical and observational support for circumcision as protective among MSM who only assume an insertive role [@pone.0070043-Schneider1]. Thus, sex role is critically important in developing and implementing position-specific interventions. Previous mathematical models have found that individual sex role preference and mixing by sex role has a strong contribution to HIV transmission dynamics among MSM [@pone.0070043-Goodreau1]--[@pone.0070043-Wiley1]. For example, Goodreau and colleagues concluded that a population of MSM with complete role versatility would have twice the prevalence of HIV over time compared to a population of MSM with role segregation [@pone.0070043-Goodreau1]. However, preferential mixing among versatile MSM did not change the overall population prevalence but affected which individuals became infected. Most existing models of HIV transmission consider a group of susceptibles that may become infected; some models separate the susceptible population into a few groups such as male, insertive-MSM, etc.; and seldom do models consider a sexual network [@pone.0070043-Enns1], [@pone.0070043-vanSighem1]. The more detailed the model, the more it is able to predict the distributional impact of HIV and to some extent the more accurate its predictions. Our model is between the latter two types: we use sexual network data to parameterize mixing in a compartmental model where we distinguish among different sex roles. Methods {#s2} ======= Study Population {#s2a} ---------------- Our study population consists of MSM participating in behavioral and sexual network surveys between 2003 and 2010 in Andhra Pradesh, India [@pone.0070043-Dandona1]--[@pone.0070043-Schneider3]. Participants were recruited in Hyderabad the capital of Andhra Pradesh state (population of ∼85 million), which has the highest numbers of HIV infected in India [@pone.0070043-NFHS31]. The surveys all took place in what are known as "hot-spots" and affiliated drop-in centers managed by partnering community based organizations (CBO). These settings, are generally public venues such as bus stops or parks that incorporate higher risk segments of the MSM community, including sex workers and their clients, many of whom are married [@pone.0070043-Kumta1], [@pone.0070043-Solomon1], who engage in transactional sex in the hot-spot venues and receive HIV prevention services in the drop-in centers. All procedures and protocols in the principal studies were approved by the relevant institutional review boards in the United States and India. Model Development {#s2b} ----------------- A compartmental deterministic model is used to predict the spread of HIV among Indian MSM over 20 years. This model is based on that presented in Goodreau et al. [@pone.0070043-Goodreau1] The population is divided into six compartments based on sex roles (insertive, receptive and versatile) and infection status (HIV−, HIV+). Members of the population are assumed to enter the population with a sex role, possibly become infected, and finally exit the population (due to AIDS or other causes). Our model has three refinements on the previous model. First, we consider condom use. Second, we do not assume proportional mixing but instead make use of data on the sexual mixing among different roles (Goodreau et al. considered assortativity, which is one dimension of sexual mixing, for a part of their paper). Proportional mixing or "random" mixing is when each versatile MSM has equal chances of partnering with any other MSM in the network. Third, we consider the changing distribution of sexual roles. Our model does this by changing the distribution of sexual roles among new members entering the population or by allowing individuals to change their role over time. The model is represented by the equations in [Figure S1](#pone.0070043.s001){ref-type="supplementary-material"} and the full set of parameters is listed in [Table 1](#pone-0070043-t001){ref-type="table"}. For comparison, we also build a simple SI model with homogenous mixing depicted in [Figure S2](#pone.0070043.s002){ref-type="supplementary-material"}. SI model is a Susceptible Infected compartmental model which utilized differential equations. 10.1371/journal.pone.0070043.t001 ###### Parameters for model of HIV transmission among men who have sex with men in Southern India. {#pone-0070043-t001-1} Parameter Value Reference --------------------------------------------------------------------------------------------------------------------------- ------------------------ --------------------------------------------------------------- ------ ------ -------------------------------------------------------- Initial population in various roles, *n~i~*(0), *n~r~*(0), *n~v~*(0) 56.6%, 19.3%, 24.1% [@pone.0070043-Schneider2], [@pone.0070043-Schneider3] Initial fraction of HIV+ among various roles, *n~i+~*(0)/*n~i~*(0), *n~r+~*(0)/*n~r~*(0), *n~v+~*(0)/*n~v~*(0) 9.6%, 25.2%, 24.7% [@pone.0070043-Hemmige1]--[@pone.0070043-Schneider3] Number of uninfected individuals added every day to population pool, μ 1.2 [@pone.0070043-1] Condom usage probability per sexual encounter, c 0.629 [@pone.0070043-Schneider2], [@pone.0070043-Schneider3] Probability that condom usage prevents transmission, α 0.9 [@pone.0070043-Weller2] Annual mortality rate for HIV− and HIV+ individuals, γ−, γ+ 1/46, 1/15 [@pone.0070043-WHO1]--[@pone.0070043-2], [@pone.0070043-WHO2] Probability of becoming infected per sexual encounter by role, *β~i~*, *β~r~*, *β~v~* 0.0016, 0.0048, 0.0032 (see discussion) Distribution of roles in entering population, *µ~i~, µ~r~, µ~v~* *n~i~, n~r~, n~v~* [@pone.0070043-Dandona1], [@pone.0070043-Hemmige1] Exception: scenario 2 (disproportionate inflow) 29%, 9%, 62% (see discussion) Annual probability of changing roles from *x* to *y*, *f~xy~* 0 Exception: scenario 3, *f~iv~, f~rv~* (role change) 2.3%, 2.3% (see discussion) Number of sexual interactions an individual of role *x* has with a member of role *y* in a month (sexual mixing), *P~xy~* *P* i r V [@pone.0070043-Schneider2], [@pone.0070043-Schneider3] i 0.00 2.10 0.13 r 13.02 0.00 0.52 v 4.96 2.27 1.68 Sexual Mixing Data {#s2c} ------------------ We used data from 2010 network survey of MSM (n = 4604) [@pone.0070043-Schneider2], [@pone.0070043-Schneider3] to specify the initial distribution of sex roles, *n~x~,* and to derive the sexual mixing matrix *P* = \[*P~xy~*\]. Here *P~xy~* is the number of sexual interactions an individual of role *x* has with a member of role *y* in a month. We ignored reports of insertive-insertive and receptive-receptive encounters because of the limited number of them and the difficulty in interpreting them with the existing data. There is no epidemiological data determining a threshold for when a MSM should be considered versatile nor is there biological significance for various thresholds in terms of HIV transmission. For this analysis, network members were categorized as versatile if they self-identified as versatile, were described as "versatile" by a study respondent, or if the ratio of insertive vs. receptive categorizations of the network member was between 3∶1 and 1∶3. The number of sexual encounters between individuals in role *x* with individuals in role *y* can be estimated as either *P~xy~* times the number of individuals in role *x* or *P~yx~* times the number of individuals in role *y*. So that our equations in [Figure S1](#pone.0070043.s001){ref-type="supplementary-material"} are consistent (i.e., balanced) we take the average of the two estimates. We consider four scenarios. The first is a status quo scenario that serves as a reference. In the baseline scenario, individuals do not change their sex roles (the *f~xy~* are zero); the distribution of sex roles among individuals entering the population, *µ~x~*, equals that of the initial population; and the observed mixing matrix \[*P~xy~*\] is used. In the second and third scenarios, the fraction of versatiles increases over time. This is an ongoing trend in India documented by ethnographic work [@pone.0070043-Lorway1] and behavioral surveys spanning 2003--2010 [@pone.0070043-Dandona1], [@pone.0070043-Hemmige1]. In the second scenario, this is modeled by assuming that the individuals entering the population are disproportionally versatile. In this scenario, the distribution of sex roles among individuals entering the population is set to match the rate of increase in the versatile fraction of the population observed between 2003 [@pone.0070043-Dandona1] (18.0%, Dandona personal communication) and 2008 [@pone.0070043-Hemmige1] (25.2%). Our choices lead to the fraction of versatiles increasing from 24.1% initially to 31.3% in five years. In the third scenario, this is modeled by assuming that individuals change their roles to versatile over time (i.e., practice change). In this scenario, we set the rate of role changes to match the increase in the versatile population over ten years seen in scenario two. The fourth scenario considers proportional mixing to judge the value of the sexual mixing data in *P*. In this scenario we do not change the average number of partners individuals have in each role (i.e., the row sums remain the same), we only change how the roles of these partners are distributed. We assume that the roles of the partners are distributed in proportion to their number in the population. Thus the modified mixing matrix changes over time. For example, receptives have 13.54 interactions per month; the ratio of insertives to versatiles is 56.6∶24.1 at time 0; hence under proportional mixing, the number of receptive-insertive encounters per month, *P~ri~*, is 13.54\*56.6/(56.6+24.1) = 9.50 in the modified mixing matrix at time 0. Again, we also assume that *P~ii~* = *P~rr~ = *0 and take the average of the two estimates to determine the rate of sexual encounters between different roles. Details are in [Figure S1](#pone.0070043.s001){ref-type="supplementary-material"}. Other Parameters {#s2d} ---------------- We used data from 2010 [@pone.0070043-Schneider2], [@pone.0070043-Schneider3] to specify the condom usage probability, *c*. The initial HIV prevalence in each role is estimated by combining data from our field surveys [@pone.0070043-Hemmige1]--[@pone.0070043-Schneider3]. Condoms are assumed to prevent transmission α = 90% of the time [@pone.0070043-Weller1]. We start with an initial population of 10,000 adults, and we model population growth by adding new HIV− individuals to the population at a rate of 1.2 per day. This leads to a total population of 10,146 in one year and 10,690 in five years, approximately matching the 10,141 and 10,725, respectively, that one would expect from India's annual population growth rate of 1.41% [@pone.0070043-1]. The mortality rate *γ~-~* for HIV− individuals implies a life expectancy of 46 years to reflect the 48.3 and 43.8 year life expectancy of male Indians age 20--24 and 25--29, respectively [@pone.0070043-WHO1]. For HIV+ individuals, *γ* ~+~ implies a life expectancy of 15 years to reflect the 9.5 year [@pone.0070043-Morgan1] or 11 year [@pone.0070043-2] median survival time without treatment; the 23--28% (2010 guidelines) and 36--55% (2006 guidelines) treatment coverage [@pone.0070043-Laumann1]; and the 6 to 15 year gain from treatment [@pone.0070043-Hallett1]. The transmission probabilities per encounter varies from population to population and may depend on many factors including the length of the encounter, whether the insertive partner withdraws before ejaculation, etc. Thus we set these probabilities by first fixing their relation to another and then varying their magnitude so that the baseline prevalence trajectory is roughly flat, matching existing data [@pone.0070043-UNAIDS1]. We assume that *β~v~* = (*β~i~+β~r~*)/2 since versatile individuals take both insertive and receptive roles. Assuming that 30% of insertives are circumcised and the transmission probabilities among MSM [@pone.0070043-Jin1], we find that the ratio of the receptive to insertive transmission probabilities, *β~r~*/*β~i~*, is 3. Biomedical HIV Prevention Intervention {#s2e} -------------------------------------- We simulate the effects of biomedical HIV prevention interventions that are currently under investigation for MSM [@pone.0070043-McGowan1], [@pone.0070043-Wiysonge1]. Except for PrEP (pre-exposure prophylaxis- anti-retroviral therapy taken to prevent HIV acquisition) [@pone.0070043-Grant1], these candidate interventions will likely have efficacies contingent upon a specific sex role. Currently, there are no efficacy data on a microbicide or circumcision in the prevention of HIV acquisition in receptive and insertive only MSM sex roles respectively. However, we do have compelling data on HIV acquisition from heterosexual insertive and receptive sex role positions with these two interventions and utilize a range of efficacy values from these trials ([Table 2](#pone-0070043-t002){ref-type="table"}) [@pone.0070043-AbdoolKarim1], [@pone.0070043-Bailey1]. We use these estimates as a starting point for the efficacy of circumcision and a hypothetical anal microbicide in preventing HIV acquisition for MSM by sex role. We also use these estimates because the suggested higher rates of anal microbicide adherence that might be expected among a MSM population that already uses anal lubricants, such as in India, could offset any potential lower efficacy when compared to vaginal microbicides [@pone.0070043-McGowan1]. The assumed risk reduction of each intervention is applied to *β~r~* and/or *β~i~* (depending on the affected sexual role(s)), with *β~v~* again the average of the *β~r~* and *β~i~*. 10.1371/journal.pone.0070043.t002 ###### One-way sensitivity analysis of various scenarios on HIV prevalence among South Indian men who have sex with men (changes are in percentage points). {#pone-0070043-t002-2} Scenario Prevalence in 5 years Prevalence in 10 years Prevalence in 20 years -------------------------------------- ----------------------- ------------------------ ------------------------ *Status Quo (Baseline, scenario 1)* 16.0% 15.9% 16.1% β~v~ = β~i~ 15.7% (−0.3%) 15.4% (−0.5%) 15.2% (−0.8%) β~v~ = β~r~ 16.3% (+0.3%) 16.4% (+0.5%) 17.0% (+0.9%) Role change: *f* ~iv~:*f* ~rv~ = 3∶1 16.2% (+0.2%) 16.6% (+0.7%) 18.6% (+2.5%) Role change: *f* ~iv~:*f* ~rv~ = 1∶3 16.0% (+0.0%) 16.1% (+0.2%) 16.7% (+0.6%) Condom usage halved 20.2% (+4.2%) 24.5% (+8.6%) 32.8% (+16.7%) Circumcision (60% rr) 14.3% (−1.6%) 12.7% (−3.2%) 10.2% (−5.9%) Anal microbicide (38% rr) 14.8% (−1.2%) 13.6% (−2.3%) 11.9% (−4.1%) (54% rr) 14.2% (−1.7%) 12.6% (−3.2%) 10.3% (−5.8%) Circumcision+Microbicide (38%) 13.3% (−2.7%) 11.0% (−4.9%) 7.8% (−8.2%) (54% rr) 12.9% (−3.1%) 10.3% (−5.6%) 6.9% (−9.2%) PreP (44% rr) 13.5% (−2.5%) 11.4% (−4.5%) 8.4% (−7.6%) (74% rr) 12.0% (−4.0%) 9.0% (−6.9%) 5.2% (−10.9%) HIV+ Mortality, γ~+~, Halved 18.3% (+2.4%) 20.8% (+4.9%) 26.4% (+10.3%) PrEP -- pre-exposure prophylaxis; rr - risk reduction. Results {#s3} ======= Status Quo Simulation {#s3a} --------------------- [Figure 1](#pone-0070043-g001){ref-type="fig"} shows the fraction of the population in various sex roles, the ratio of the population to that at time zero, and the prevalence over 20 years. The overall HIV prevalence remains approximately constant. Throughout the simulation horizon, the prevalence of receptives is higher than that of versatiles, which in turn is higher than that of insertives. {ref-type="table"} disproportionate inflow (ie increasing proportion of versatiles in the population), role change (insertives or receptives "becoming" versatile), proportional mixing (random mixing; versatile equally likely to partner with any other MSM in population).](pone.0070043.g001){#pone-0070043-g001} Simulations with Changing Community {#s3b} ----------------------------------- [Figure 2](#pone-0070043-g002){ref-type="fig"} summarizes the overall prevalence over time for the status quo scenario, the two scenarios that model the increasing fraction of versatiles, and the scenario with proportional mixing. The prevalence in all scenarios is within 0.6 percentage points of each other the first ten years. Over a twenty year horizon, the prevalence in the non-status quo scenarios increases, with the scenario with disproportionally versatile inflow (scenario 2) achieving the highest prevalence (2.1 percentage points above the status quo scenario). {#pone-0070043-g002} Sensitivity Analyses {#s3c} -------------------- We conducted one-way sensitivity analysis where we start with the baseline (scenario 1; status quo) and vary parameters one at a time to determine their impact on the prevalence in 5, 10, and 20 years ([Table 2](#pone-0070043-t002){ref-type="table"}). The prevalence is insensitive to our choice of β~v~ because this transmission probability applies to only a small fraction of interactions, those between two versatile individuals. Overall we find that at the population level, role change has little effect on overall HIV prevalence. In contrast, halving condom use or halving HIV mortality (from say increased treatment coverage) causes HIV prevalence to grow rapidly. Among biomedical prevention interventions, PrEP has the greatest impact overall on decreasing HIV prevalence with only 12.0% of the population infected in five years. Circumcision and an anal microbicide combined reduce HIV prevalence by an amount that is almost the sum of their individual reductions in prevalence. [Figure S3](#pone.0070043.s003){ref-type="supplementary-material"} presents additional sensitivity analyses. Discussion {#s4} ========== Our model not only provides insights into the growing MSM HIV epidemic in India, but also into several factors that are important for modeling HIV transmission and simulating the potential effects of biomedical HIV prevention among MSM in general. First, the HIV prevalence in this population is 0.3--0.8 percentage points lower under existing sex network mixing patterns than under assumptions of proportionate mixing. Additionally, we find that increasing sex role versatility leads to moderate increases of HIV prevalence over time, with slightly larger increases seen when this increasing versatility is achieved through new versatile MSM joining the population rather than through role change. As might be expected, biomedical interventions that are protective for both receptive and insertive partners such as PrEP, would have the greatest impact on the epidemic, decreasing HIV prevalence to 5.2% in 20 years. This is however, assuming \>90% adherence; an adherence rate much higher than seen in the limited data on PrEP acceptability from India [@pone.0070043-Schneider4]. Finally, we find that anal microbicides and circumcision, modeled at HIV prevention efficacy rates in heterosexuals, would have modest effects on the HIV epidemic. Of note, this is the first model that includes data on MSM sex network mixing where ties are matched (i.e., each respondent reported on sex partnering status with other respondents in the network). The observed sexual mixing is not proportional. Notably, sexual mixing data demonstrated a 50% increase in the number of receptive-insertive encounters per month at time 0 (18,500), when compared to the proportionate mixing model (11,963 encounters per month). Due to the multiple reports provided by the network survey we expect that this reflects the actual mixing rather than for example receptives believing their versatile partner is actually insertive. Observed sex mixing also demonstrates some receptive-receptive and insertive-insertive mixing in this setting, corroborating our own anecdotal observations as well as those reported by others [@pone.0070043-Lorway1]. Comparisons of proportional models across studies is difficult given the higher mixing of versatiles with other versatiles described by Goodreau et al. [@pone.0070043-Goodreau1] when compared to our population. Goodreau et al. find that "preferential mixing among versatile MSM does not change overall prevalence" [@pone.0070043-Goodreau1]. This agrees with the specific case we consider, where the prevalence estimates from proportional mixing are not much higher than those using the observed (preferential) mixing pattern. This gives us confidence in the accuracy of our model. The idea of a breakdown in role segregation (i.e., increasing versatiles in the population) as having an effect on HIV prevalence, we argue, is unproven based upon our model. In contrast to other studies which suggest greater rates of HIV at the population level with increasing versatile sex role practice, our data suggest only an insignificant change in HIV prevalence with almost no change in HIV prevalence at 20 years under a disproportionate inflow of versatile MSM assumption or under the assumption that MSM change roles. Suggestions that MSM in India are becoming increasingly versatile, as direct influence from the West is of interest [@pone.0070043-Lorway1], but of little importance to the trajectory of the HIV epidemic. Efforts should be made instead to focus on specific biomedical interventions and how they may fit within traditional sex roles and a potentially increasing versatile sex role. Our model had several limitations. The parameters were based upon MSM recruited from "hot-spots" and may not reflect the larger and more hidden MSM population in India, many of whom are insertive-only MSM. This would serve to bias our HIV prevalence estimates upwards. However, our sex network data included many clients of receptive-only MSM sex workers demonstrating much higher numbers of insertive-only MSM than previously reported in India. [@pone.0070043-Vadivoo1] Second, the efficacy rates for microbicide and circumcision were based upon efficacy in heterosexuals. The actual efficacy may or may not be different among MSM. However, our goal was not to compare existing and/or hypothetical prevention interventions across a population, but to demonstrate how these interventions based upon the best available data might work within an HIV epidemic where role segregation and potential increasing versatility are evident. Third, we did not consider the degrees of role versatility of individuals both in terms of proportions of insertive to receptive sex partners as well as event versatility occurring within one sexual encounter. Finally, we did not model treatment or HIV progression in detail or the spread to and interaction with the wider population (e.g., the wives of these MSM). Public health programmers will need to consider sex role segregation in efforts to promote HIV prevention interventions in many international settings that are likely to have efficacy rates sensitive to the sex role of the end user. Consistent with previous work, the importance of network data for modeling disease spread and forecasting the effect of future interventions that limit the sexual transmission of HIV is critical. Differences in projections exist between models that incorporate sex network mixing and those that do not [@pone.0070043-Goodreau1], [@pone.0070043-Schooley1], which could affect downstream recommendations for HIV intervention implementation. If circumcision and anal microbicides are found to be efficacious, their protection may be sex role specific. HIV prevention may need to be reconfigured, with separate modalities targeting each member of a MSM sexual dyad to maximize potential for synergistic effects. Supporting Information {#s5} ====================== ###### (DOCX) ###### Click here for additional data file. ###### (DOCX) ###### Click here for additional data file. ###### Sensitivity analysis that vary the distribution of sexual roles in the initial population (top) and among the inflow (bottom). The status quo scenario is labeled SQ. The top contour plot in [Figure S3](#pone.0070043.s003){ref-type="supplementary-material"} (3a) demonstrates the final prevalence in 10 years as we vary the initial population fractions. We then varied the inflow fractions in the model. We examine the prevalence in 10 years as we vary the fraction of new individuals in various roles. The two axes of the bottom contour plot (3b) show the fraction of versatile and receptive individuals in the total population in 10 years (points in the shaded region are possible scenarios). We see that in the situations where we end up with the most insertive-only MSM are also those where the HIV prevalence is least. (TIF) ###### Click here for additional data file. We would like to acknowledge collaborators at SHARE-India and Public Health Foundation of India who conducted the primary data collection that informed our model and in particular Sabitha Gandham and Ganesh Oruganti. We would also like to thank the partnering Community Based Organizations supported by the Andhra Pradesh State AIDS Control Society that worked with them: Mithrudu, Suraksha and Darpan. [^1]: **Competing Interests:**The authors have declared that no competing interests exist. [^2]: Conceived and designed the experiments: JAS BA. Performed the experiments: SR JAS BA AK. Analyzed the data: SR BA. Contributed reagents/materials/analysis tools: AK. Wrote the paper: JAS BA. | High | [
0.6591422121896161,
36.5,
18.875
]
|
Q: How to style a custom Silverlight 4 UserControl? I have a custom UserControl that I created as a navigation menu that parses an xml file and populates itself with hyperlink buttons. So basically my control is an empty stackpanel, and when it's loaded it adds hyperlinkbuttons as children to the stack panel. In my application I just add a <myLibrary:NavigationMenu links="somexml.xml" /> The problem is that I want to be able to style the hyperlinkbuttons and the stack panel differently for every application. What is the best way to do this. A: In the code behind for the control, create a DependencyProperty of type Style for both HyperlinkStyle and StackPanelStyle. Then when you create the items apply the correct styles too them. Take a look at MSDN The article is a good starting point for writing stylable controls. | High | [
0.7563291139240501,
29.875,
9.625
]
|
"use strict"; function SlugsMapModel($cacheFactory, PostsApi, ApiManagerMap){ var model = { addToCache: addToCache, load: load, updateFromPosts: updateFromPosts, getCachedSlugs: getCachedSlugs }; var cache = $cacheFactory("slugsCache"); var propertiesToCache = ["slug"]; propertiesToCache.push(ApiManagerMap.postId); function addToCache(incrementalCache){ var originalCache = cache.get("slugs"); if(typeof originalCache === "undefined"){ originalCache = []; } var concatenatedCache = originalCache.concat(incrementalCache); var idProperty = ApiManagerMap.postId; concatenatedCache = concatenatedCache.removeDuplicatedObjectsByField(idProperty); cache.put("slugs", concatenatedCache); } function getCachedSlugs(){ var cachedSlugs = cache.get("slugs"); return cachedSlugs; } function updateFromPosts(postsArray){ var filteredArray = postsArray.filterToProperties(propertiesToCache); model.addToCache(filteredArray); } function load(pageSize, pageNumber){ var promiseParams = {"pageSize": pageSize, "pageNumber": pageNumber}; var allPostsPromise = PostsApi.getAllPosts(promiseParams); allPostsPromise.then(function(result){ var filteredArray = result.posts.filterToProperties(propertiesToCache); model.addToCache(filteredArray); }); allPostsPromise.catch(function(error){ console.log(error); }); } return model; } angular.module("frontpress.components.slugs-map").factory("SlugsMapModel", SlugsMapModel); SlugsMapModel.$inject = ["$cacheFactory", "PostsApi", "ApiManagerMap"]; | Mid | [
0.618955512572533,
40,
24.625
]
|
Alpha Natural Resources reports drop in revenues The take: Revenues for coal miner Alpha Natural Resources dropped 29.8 percent in the fourth quarter as the company faced falling demand for metallurgical and steam coal. In turn, coal prices have fallen as well. Coal shipments during the fourth quarter were 4.4 million tons, compared with 4.9 million tons during the fourth quarter of 2012. The coal industry has been struggling as it competes with low natural gas prices, increased regulation of its industry and an over-supply of some types of coal. Revenues: Sales during the fourth quarter were $1.09 billion, compared with $1.6 billion in the fourth quarter of last year. For the full year, revenues fell 29 percent. In 2013, revenues fell 29 percent to $6.97 billion from $4.95 billion in 2012. Net income: Alpha Natural Resources’ loss widened to $358.8 million, or $1.62 per share, from $127.6 million, or 58 cents per share, during the same period the year before. The company’s full-year loss narrowed from $2.4 billion to $1.1 billion. The company’s take: Kevin Crutchfield, chairman and CEO of Alpha Natural Resources: "2013 was a challenging year for Alpha and the coal industry. After completing an extensive restructuring initiative in 2012, we announced further cost reductions in the fall of 2013 to better match our production and overhead expenses with current and anticipated market conditions. These are always difficult decisions because they affect employees and their families, but they are necessary in these challenging times. We have also actively managed our balance sheet to improve financial flexibility and enhance cyclical resilience by opportunistically accessing the capital markets and agreeing to monetize a portion of our Marcellus shale gas acreage.” | Mid | [
0.577319587628865,
35,
25.625
]
|
NEW LONDON, Conn.--Brown University (10-6) defeated Connecticut College (1-8) 22-8 in a Northern Division water polo match played at Lott Natatorium Tuesday night. Sam Burns (Albuquerque, N.M.), Sam Mitchell (Rancho Palos Verdes, Calif.) and Connor Matzinger (Ranch Santa Fe, Calif.) scored two goals each in the setback for the hosts. Rookie net-minder Clayton Witter (New York, N.Y.) contributed with 15 saves for the Camels. The Camels completed a West Coast road trip during fall break. Connecticut College routed Cal Tech in an 18-6 triumph Sunday for their first win of the season. Sam Mitchell exploded with six goals to lead the Camels in the offensive uprising. Mitchell leads the club with 14 goals this fall. Connor Matzinger has chipped in with 12 scores this season. Burns has scored six goals in his past two games and is third on the squad with nine goals scored. Clayton Witter is averaging 9.8 saves per start for the Camels with 88 saves in the cage. October 14, 2009 | Mid | [
0.6410256410256411,
37.5,
21
]
|
Histopathological study of alobar holoprosencephaly. 1. Abnormal laminar architecture of the telencephalic cortex. Abnormal architecture of the telencephalic cortex was studied in six autopsy specimens of alobar holoprosencephaly by histopathological, electron microscopic and immunohistochemical methods. Several common abnormalities are described and their significance discussed. In all of the specimens, the cortices showed excessive thickness and abnormal lamination with a middle cellular layer and an external sparse layer, indicating disturbance of neuronal migration. Neurons of the external sparse layer were segmented into irregularly arranged groups, suggesting disturbance of tissue organization. In three specimens, the internal pyramidal layer contained numerous abnormal glomerular structures which consisted of fine dendrites and axons. | High | [
0.664748201438848,
28.875,
14.5625
]
|
Protein kinase A and its role in human neoplasia: the Carney complex paradigm. The type 1 alpha regulatory subunit (R1alpha) of cAMP-dependent protein kinase A (PKA) (PRKAR1A) is an important regulator of the serine-threonine kinase activity catalyzed by the PKA holoenzyme. Carney complex (CNC) describes the association 'of spotty skin pigmentation, myxomas, and endocrine overactivity'; CNC is in essence the latest form of multiple endocrine neoplasia to be described and affects the pituitary, thyroid, adrenal and gonadal glands. Primary pigmented nodular adrenocortical disease (PPNAD), a micronodular form of bilateral adrenal hyperplasia that causes a unique, inherited form of Cushing syndrome, is also the most common endocrine manifestation of CNC. CNC and PPNAD are genetically heterogeneous but one of the responsible genes is PRKAR1A, at least for those families that map to 17q22-24 (the chromosomal region that harbors PRKAR1A). CNC and/or PPNAD are the first human diseases to be caused by mutations in one of the subunits of the PKA holoenzyme. Despite the extensive literature on R1alpha and PKA, little is known about their potential involvement in cell cycle regulation, growth and/or proliferation. The presence of inactivating germline mutations and the loss of its wild-type allele in CNC lesions indicated that PRKAR1A could function as a tumor-suppressor gene in these tissues. However, there are conflicting data in the literature about PRKAR1A's role in human neoplasms, cancer cell lines and animal models. In this report, we review briefly the genetics of CNC and focus on the involvement of PRKAR1A in human tumorigenesis in an effort to reconcile the often diametrically opposite reports on R1alpha. | High | [
0.710306406685236,
31.875,
13
]
|
# -> to get system_libc_addr, enter this value in the 'system_libc_offset' value of the target_finder, run, sit back, wait for shell | Low | [
0.449877750611246,
23,
28.125
]
|
Dear Friends, Greetings from the desk of the Tricontinental: Institute for Social Research. A recent report by the International Labour Organisation shows that the total global labour force is now measured at 3.5 billion workers. This is the largest size of the global labour force in recorded history. Talk of the demise of workers is utterly premature when confronted with the weight of this data. Most of these 3.5 billion workers, the ILO says, ‘experienced a lack of material well-being, economic security, equal opportunities or scope for human development. Being in employment does not always guarantee a decent living. Many workers find themselves having to take up unattractive jobs that tend to be informal [so-called flexible work] and are characterised by low pay and little or no access to social protection and rights at work’. While half of the global labour force is made up of waged or salaried employees, two billion workers (61%) are in the informal sector. The ILO report shows that the number of the working poor has now declined, largely thanks to the massive impact of the People’s Republic of China’s economic development model. Data on poverty is controversial, since there is doubt whether the government statistics on poverty are honestly reported. Nonetheless, the data demonstrates that while the incomes of the poor have risen, they have not risen sufficiently to wrench them out of poverty. Jason Hickel and Huzaifa Zoomkawala have shown that there has been little gain for the poorest section of humanity over the past several decades. ‘For the poorest 60% of humanity’, Hickel writes, ‘the average person saw their annual income increase by only about $1,200…over 36 years’. This is hardly a figure to celebrate. Even as the data shows that those in the global labour force are not able to find ‘decent work’, productivity rates are higher than they have been before. As the ILO report notes, ‘productivity growth during 2019-21 is expected to reach its highest levels since 2010, surpassing the historical average of 2.1 per cent for the period 1992-2018’. The ILO refers to the global average, since in many countries–including the United States–growth in productivity has not been rising; it is the growth in productivity in countries like China that has boosted the global average. But the benefits of this productivity growth are not shared sufficiently with workers in terms of wage and salary increases commensurate to their contributions. The benefits go upwards to the owners of capital, which will only increase the concentration of wealth. Labour is producing the massive surplus, which could very well be used to improve the general well-being of humanity. Instead, it is going to line the pockets of capitalists. Over the past year, we–at Tricontinental: Institute for Social Research–have been trying to find ways to explain a few key misconceptions: 1. That the global labour force has shrunk. Talk of automation and precarity has led to the assumption that there is a decline in work globally. This is not the case. There are now more people at work than ever before, many of them in manufacturing–despite the ‘factory deserts’ and the process of deindustrialisation in the West. 2. That poverty has declined. If there were less people working, then there should be less people earning and therefore there should be higher rates of poverty. The fact is that there are more people working, and yet poverty remains a serious problem. The people who are working are in fact more productive on average and are producing more now than before. What keeps them in poverty despite their increased productivity–some of it due to better technology–is that they cannot command an increased share of the productivity gains and of the full surplus produced. But what also keeps the poverty rate steady is the destruction of the welfare state, and of a range of welfare provisions–from subsidised housing to food rations–that have been taken away from billions of people. There are, in fact, more people working, and they are not able to earn enough of the total surplus produced to lift them sufficiently above the established poverty line. Why is this so? The arsenal of Marxist analysis provides us with a simple concept–the rate of exploitation. Marx, in Capital (1867), writes of exploitation in two registers. First, on the moral plane, he thunders against the exploitation of workers, particularly of children. The terrible living and working conditions enraged him, as they should any sensitive person. Second, in the precise framework of his science, Marx studies the way that the owners of capital are able to hire workers by purchasing their labour power. It is these workers who produce surplus value and whose gains are expropriated by the owners of capital because of their ownership rights. Exploitation, then, is the extraction of this surplus value by the owners of capital from the workers who produce it. The rate of exploitation, Marx wrote, can be quite illuminatingly calculated if we use his basic conceptual apparatus. Apple has just released its iPhone 11. There is little that differentiates it from the iPhone X, although the more expensive version of the new phone has three cameras. It is important to point out that Apple does not manufacture these phones. They are largely manufactured by the Taiwanese company Foxconn, which employs more than 1.3 million workers in the China alone. The iPhone is obscenely expensive, with the bulk of the cost of its sale going not to the workers nor to Foxconn but to Apple. Because Apple owns the intellectual property over the phone, it licenses its production to companies such as Foxconn, which then produce these phones for the market. Apple devours the bulk of the profits from this process. Five years ago, E. Ahmet Tonak did a study of the iPhone 6, looking at it from the standpoint of Marx’s analysis of the rate of exploitation. As part of the Tricontinental: Institute for Social Research team, Ahmet updated his analysis to look at the iPhone X. We used this as an opportunity to produce Notebook no. 2, which explains some of the core Marxist concepts and then uses the analysis of the rate of exploitation to look more specifically at the iPhone. The rate of exploitation allows us to demonstrate how much the worker contributes to the increase of value in the production process. It shows that even if the worker were to be paid more, by the special magic of mechanisation and of efficient management of the production process, the rate of exploitation increases. Under the system of capitalism, freedom for the worker is impossible. The most stunning finding from the analysis is that the iPhone workers of our time are twenty-five times more exploited than the textile workers of 19th century England. The rate of exploitation of the iPhone worker is 2458%. This number tells us that an infinitesimal part of the working day is devoted to the value needed by the workers as wages; the bulk of the working day is spent by the workers producing goods that enhance the wealth of the capitalist. The higher the rate of exploitation, the greater the enhancement of the capitalist’s wealth by the labour of the workers. Notebook no. 2 is designed with great care by our team (Tings Chak and Ingrid Neves). We have produced it in the hope that it will be widely used for various forms of education–whether in political schools, academic settings, or for independent study. The text is written in fairly straightforward language; the design is formulated to enhance learning. We are eager for your assessment of this work, since it will inform a series of other Notebooks on other key concepts to help understand the contours of capitalism. This week, the United Nations hosted five summits on the climate catastrophe. The UN Secretary General Antonio Guterres says that two words define these five meetings: ambition and action. Global protests to defend the planet took place last Friday, with more protests to follow. The conversation at the UN meetings, however, remains blocked by the refusal of the United States and other Western countries to acknowledge that they have the largest responsibility for the catastrophe, since they have overused their share of the carbon budget. Hope that these countries would contribute substantially to the Global Climate Fund has now faded. The minimum amount needed is in the trillions of U.S. dollars, not the low billions that have been promised. There is little talk of mitigation, of technology transfer, of emissions inequality, or of other substantial solutions to the root causes of the current crisis. A few years ago, Oxfam released an important study that showed how the poorest 50% of the planet was responsible for only 10% of global emissions, while the richest 10% was responsible for 50% of carbon emissions. Yet, as Oxfam notes, it is the people of the poorer nations who are most vulnerable to climate change, and who are often mistakenly blamed for causing it. Discussion of development has not taken place alongside the discussion of climate change. What does it mean for the billions of people who produce surplus value, but who live in relative poverty, that they must participate in a conversation about reduced consumption? A recent UN study says that there are at least 820 million people who live with hunger, while at least 2 billion people are food insecure. These are numbers that stubbornly will not shift downwards. Those who live with hunger are workers. You cannot talk about addressing climate change without talking about abolishing the system that thrives on the hunger and poverty of the majority of the world’s people, and without recognizing the seeds of a better future that are being planted today. The current of critical Latin American thought reminds us of the importance of this. In a recent report produced by our Buenos Aires and São Paulo offices–José Seoane writes, ‘It is not only about imagining these futures theoretically based on our past; it is also a question of reflecting and spreading the popular projects that are currently taking place and anticipating the futures that we are seeking’. What’s the point of saving the planet if billions of workers are dying of hunger? Suffering is not a commodity. There is no primary or secondary market for it. It is the earth and stone that sits in the stomach of a famished human being, a worker who participates in the commodity chain that results in an iPhone. Warmly, Vijay. | Mid | [
0.6376146788990821,
34.75,
19.75
]
|
Battle Realms IS READY FOR TESTING! After months of painful leftdowns, we have found the resources and people who could finish the job of making a Steam version of Battle Realms! Over the next weeks we will be testing the game internally and, if possible, we might be bringing it to some of you to help us test. I know it's been a hard road. No one (despite the posts) has been more frustrated with this process than I. We have perservered and barring any catostrophic bugs we will see a Steam version of BR before Halloween! Things are looking up. :) Thanks to all of you who kept the faith, you really helped us shake off the haters and keep going. You are the best. :) Ed Del Castillo President, Liquid Entertainment | Mid | [
0.553459119496855,
33,
26.625
]
|
Welcome Search Search for: About Paschal Paschal is the Fine Gael TD for Dublin Central and in June 2017 was appointed as the Minister for Finance & Public Expenditure and Reform. Prior to his appointment as the Minister for Finance & Public Expenditure and Reform, he served, from May 2016-June 2017, as the Minister for Public Expenditure and Reform, and from ... GOVERNMENT ESTABLISHES NORTH-EAST INNER CITY TASK-FORCE 29th July, 2016 WHY IS THIS TASK-FORCE BEING ESTABLISHED? As both a Government Minister and a T.D., I am extremely proud to represent the communities of the North-East inner City. It is a vibrant and proud community where many great people live and work and where fantastic local organisations do huge work. However, the shootings that took place on our streets earlier this year, coupled with continuing problems with the sale and supply of illegal and prescription drugs, shocked and led to a sense of anxiety and fear developing among our community. In response, the Taoiseach along with myself and other Ministers met with local residents, community and voluntary groups in St. Laurence O’Toole’s C.B.S. to listen to people’s views. At that meeting, the Taoiseach committed the Government to taking action to address the economic and social needs we have and that he will lead this work in his role as Head of Government. GARDAÍ RESPONSE TO VIOLENT SHOOTINGS Huge efforts have been made by the Gardaí to reassure families and our communities across the north-east inner that all actions are being taken to prevent any further shootings and ensure those responsible are arrested and brought before the Courts. Local Gardaí have now made 36 arrests into these shootings, seized 17 firearms and approximately €1m worth of assets under the Criminal Assets legislation. The Government has provided an extra €50m towards Garda overtime allowing local officers continue with the policing initiatives that have been in place recently. Furthermore, Government will be accelerating the rate of recruitment to the Gardaí later this year. HOW WILL THIS TASK-FORCE WORK? This initiative will be two-fold. Firstly, the Taoiseach will establish a Ministerial task-Force, which his Department will lead, to oversee the initiative, both from an immediate view and longer-term. Secondly, the Government has asked Kieran Mulvey, former Chair of the Labour Relations Commission, to prepare a report for the task-Force by November. Kieran Mulvey has agreed to complete this work which will recommend specific measures to support the long-term economic and social regeneration of the North-East inner City. HOW CAN YOU TAKE PART IN THE TASK-FORCE? As part of his work, Kieran Mulvey will engage directly with local residents, community and voluntary groups in the North-East inner city, including your public representatives. Government does not have all the answers, so it is essential that we get your input as to what you think should happen both in the coming weeks and years. CAN GOVERNMENT UNDERTAKE SOME IMMEDIATE & TARGETED MEASURES? Throughout the past month, the Taoiseach has joined myself and Councillor Ray McAdam in meeting individual groups across the Sean McDermott Street and North Wall areas. Those discussions have centred on what practical immediate steps that Government can take to support our communities in the North-East inner City. Following that consultation and further engagement with various Government Departments, a number of immediate action steps have been agreed. These measures include: Investment of €1m in funding by the Department of Transport, Tourism & Sport in sports facilities for Sheriff Youth Club, Larkin Community College and the installation of new mini pitches and the redevelopment of the former Pigeon Club in Ballybough. €500,000 in funding from the Department of Housing, Planning & Local Government to help Dublin City Council complete public realm improvements and support local community & youth projects. Re-opening Fitzgibbon Street Garda Station with initial refurbishment works to begin this year. Providing an additional €100,000 from the Department of Health to support projects that work directly with those recovering from addiction. Refurbishing ground floor in Buckley House through funding from Department of Arts for the provision of new artists’ workshops. Funding a feasibility study to determine whether artists’ studios could be developed in the former Magdalene Laundry on Sean McDermott Street. Confirmation of funding to allow redevelopment of the Rutland Street School to become permanent hub for local community projects. These measures will be undertaken throughout the rest of 2016 with further actions to be completed next year. The task-Force that will be chaired by the Taoiseach will make sure these proposals are implemented. WHAT FURTHER MEASURES ARE BEING TAKEN BY GOVERNMENT? In addition to the specifically targeted measures in the North-East inner City, the Government has put in place a number of further measures which will benefit the communities in North Wall, Sean McDermott Street and Summerhill. These measures include: Construction work beginning on the new HSE Primary Health Care Centre on the former Mountainview Court site in Summerhill. Approval of €22m in funding to allow construction works begin on the planned Dominick Street regeneration project. The introduction of new Misuse of Drugs legislation to make the sale of prescription drugs illegal and strengthen Garda powers to catch those dealing in prescription tablets. The establishment of new anti-gang task-force within the Gardaí to specifically target criminal gangs. Along with the Taoiseach and Kieran Mulvey and other Ministers, myself and Councillor Ray McAdam held a follow-up meeting with residents, community groups and other voluntary organisation this week to discuss these proposals. Kieran Mulvey will now begin work on talking with residents’ groups, community leaders and other stakeholders as he works to draft his report that will be presented to the Taoiseach by November at the latest. Between now and then, both myself and Councillor Ray McAdam will be working with the Taoiseach and our colleagues in Government to deliver the immediate measures outlined above. We are immensely proud to be your representatives in the Dail and on Dublin City Council. We are committed to working with you and Government so that the challenges we face as a community are overcome and that people can live their lives without the fear and anxiety we all felt earlier this year. | Mid | [
0.5595238095238091,
35.25,
27.75
]
|
Previous estimates have suggested that venous thromboembolism is responsible for around 60 000 deaths in the UK each year.^[@R1]^ It is thought that individuals admitted to hospital may be at increased risk of developing deep vein thrombosis and/or pulmonary embolism as a result of reduced mobility or intercurrent illness. Other important risk factors include older age (over 60 years), active malignancy, dehydration, inherited or acquired thrombophilia, obesity, previous venous thromboembolism or family history of venous thromboembolism, oral contraceptive pill use, hormone replacement therapy, pregnancy and varicose veins with phlebitis.^[@R2],[@R3]^ These risk factors may be applicable to individuals admitted to hospital for medical, surgical or psychiatric care. For these reasons, current clinical guidelines recommend a risk assessment for all people who are admitted to hospital and prescription of a low-dose anticoagulant such as low molecular weight heparin (LMWH) and/or mechanical prophylaxis for those thought to be at high risk.^[@R2]^ The decision as to whether to offer venous thromboembolism prophylaxis should be balanced against potential risks, particularly the risk of bleeding with LMWH. Evidence base for venous thromboembolism prophylaxis in acute general hospitals {#S1} =============================================================================== Numerous interventional studies have investigated the role of mechanical and pharmacological prophylaxis in reducing the risk of venous thromboembolism among those admitted to an acute general hospital. Studies have principally focused on patients undergoing orthopaedic surgery, non-orthopaedic surgery or no surgery. Interventional studies have demonstrated a reduction in symptomatic deep vein thrombosis among patients undergoing orthopaedic surgery who receive LMWH (relative risk (RR) = 0.50, 95% CI 0.43--0.59^[@R4]^). The use of LMWH in this group is not associated with a significant increase in major bleeding (RR = 0.81, 95% CI 0.38--1.72^[@R4]^). Prophylactic LMWH is also associated with a reduction in non-fatal symptomatic venous thromboembolism in patients who are undergoing non-orthopaedic surgery (RR = 0.31, 95% CI 0.12--0.81^[@R5]^) and possibly a reduction in symptomatic deep vein thrombosis (RR = 0.47, 95% CI 0.22--1.00^[@R6]^) and pulmonary embolism (odds ratio (OR) = 0.70, 95% CI 0.56--0.87^[@R7]^) in patients who are not undergoing surgery. However, this is balanced with a significantly increased risk of major bleeding (OR = 1.28, 1.05--1.56^[@R7]^). Furthermore, when considering fatal pulmonary embolism or overall mortality, prophylactic LMWH is not associated with significant benefit in any group.^[@R4]--[@R7]^ Evidence base for venous thromboembolism prophylaxis in mental healthcare settings {#S2} ================================================================================== In contrast to studies in acute general hospitals, there is relatively little published evidence investigating venous thromboembolism incidence and the role of pharmacological or mechanical prophylaxis in mental healthcare settings. A recent observational study that included systematic venous ultrasonography identified deep vein thrombosis in 10 out of 449 participants (2.2%) following 10 days of admission to a psychiatric hospital.^[@R8]^ A total of 16 out of 458 (3.5%) had experienced an episode of venous thromboembolism by 90 days following admission. Of these, three had a non-fatal pulmonary embolism. The study also showed that venous thromboembolism was more likely in older people (8.6% of those aged over 75 years), which may relate to greater exposure to risk factors such as immobility. Another study based on a review of hospital records revealed 17 confirmed cases of venous thromboembolism among 1495 people (1.1%) admitted to an in-patient mental health service for older people.^[@R9]^ This contrasts with an incidence of 2.4% within 91 days among people undergoing total hip arthroplasty surgery^[@R10]^ and 1.45 per 1000 person years in the general population.^[@R11]^ There is growing evidence from observational studies that suggests a possible association between antipsychotic medications and venous thromboembolism, particularly for clozapine and first-generation antipsychotics.^[@R12]^ However, it has been difficult to establish whether this association could be a direct pharmacological consequence of antipsychotics (leading to a prothrombotic state) or if it is mediated through other risk factors that are consequences of antipsychotics, such as obesity or sedation leading to reduced mobility.^[@R13]^ Some studies have also pointed towards physical restraint as a potential risk factor for venous thromboembolism in mental healthcare settings.^[@R14]--[@R16]^ Areas of uncertainty {#S3} ==================== A recent meta-analysis has led to increasing controversy over the potential benefits of pharmacological or mechanical measures to prevent venous thromboembolism among hospital patients who are not undergoing surgery.^[@R7]^ Although a reduction in non-fatal symptomatic venous thromboembolism was seen with LMWH prophylaxis, this is balanced with an increased risk of bleeding and no overall benefit in terms of reduced mortality. Furthermore, the relative benefit of prophylaxis only translates to a modest reduction in absolute risk; for every 1000 in-patients treated with LMWH, only three cases of pulmonary embolism are prevented balanced with four additional cases of major bleeding.^[@R7]^ There is also continued uncertainty about the true incidence of clinically significant venous thromboembolism.^[@R17]^ Although data from epidemiological modelling suggests that venous thromboembolism is responsible for around 60 000 deaths each year in the UK,^[@R1]^ data from postmortem studies suggest a much lower rate of around 5680 per year.^[@R18]^ Whether pharmacological and mechanical prophylaxis could prevent all deaths from venous thromboembolism is also unclear. Do people who develop venous thromboembolism always need treatment with anticoagulants? {#S4} ======================================================================================= Some observational studies have employed systematic ultrasound screening to identify asymptomatic as well as symptomatic deep vein thrombosis. Although deep vein thrombosis was identified in 10 out of 449 participants following admission to a psychiatric hospital, seven cases were of distal deep vein thrombosis of which only one case was symptomatic.^[@R8]^ The extent to which asymptomatic deep vein thrombosis predisposes an individual to increased risk of mortality remains uncertain, particularly with respect to asymptomatic distal deep vein thrombosis.^[@R19]^ The advent of computed tomography pulmonary angiography (CTPA) has led to a substantial increase in the radiological diagnosis of pulmonary embolism.^[@R20]^ However, uncertainty is growing over the optimum treatment particularly with respect to whether all those with a radiological diagnosis of pulmonary embolism would benefit from anticoagulation.^[@R21]^ It is thought that small subsegmental emboli may not necessarily be associated with adverse clinical outcomes and that the risks of bleeding from treatment with anticoagulants may outweigh any benefits within this group.^[@R22]^ Benefits and risks of venous thromboembolism prophylaxis in mental healthcare settings {#S5} ====================================================================================== There are no published interventional studies that have investigated the potential benefits of venous thromboembolism prophylaxis in mental healthcare in-patient settings. Despite this, there is ongoing interest in developing and utilising risk-screening tools to identify individuals at increased risk of venous thromboembolism for prophylaxis.^[@R23]^ Furthermore, there is no published evidence that has investigated the potential harms of venous thromboembolism prophylaxis in this setting. Although risks of bleeding have been well characterised for people admitted to acute general hospitals, it is not clear whether the same risks apply elsewhere. In particular, prolonged use of LMWH can predispose to thrombocytopenia leading to an increased risk of bleeding.^[@R24]^ The mean length of stay in an in-patient mental healthcare setting (adult: 52.1 days, older people: 93.2 days) is substantially greater than that of an acute medical unit (5.5 days).^[@R25]^ With the exception of those taking clozapine, full blood count monitoring is not routinely performed in the mental healthcare in-patient setting. The extent to which staff in mental healthcare settings are trained to administer prophylaxis and recognise potential adverse complications is also unclear.^[@R3]^ For these reasons, it is possible that the risk of thrombocytopenia from LMWH may be greater for those who receive it for venous thromboembolism prophylaxis in the mental healthcare setting. Balancing the potential risks of bleeding and the potential benefits of preventing venous thromboembolism with pharmacological prophylaxis is problematic. Cost--utility analysis is a method by which the benefits and risks of an intervention may be balanced with respect to quality of life measures. A study investigating the application of cost--utility analysis to venous thromboembolism found that there was a wide degree of variation in individual estimates of cost--utility of both acute venous thromboembolism and bleeding complications from pharmacological prophylaxis.^[@R26]^ However, in the mental healthcare in-patient setting, it is sometimes not possible for patients to weigh up benefits and risks of an intervention because of lack of mental capacity. Furthermore, there is little evidence to estimate the potential benefits and risks of venous thromboembolism prophylaxis among individuals who lack capacity as randomised controlled trials have excluded these individuals.^[@R17]^ Discussion {#S6} ========== Venous thromboembolism remains an important cause of mortality in people who are admitted to hospital. However, in recent years, there has been ongoing uncertainty over the efficacy and risks of prophylaxis among in-patients who are not undergoing surgery^[@R6],[@R7]^ and whether everyone with established venous thromboembolism would benefit from anticoagulant treatment.^[@R21],[@R22]^ Although prophylaxis appears to reduce the incidence of non-fatal venous thromboembolism, there is no robust evidence that supports a reduction in mortality.^[@R4]--[@R7]^ This may be because of the balance with risk of bleeding for pharmacological prophylaxis.^[@R7],[@R24]^ There is even less evidence to support its use in mental healthcare in-patient settings where no interventional studies have been published. Despite this, substantial resources (over £30 million per year in England) have been invested into venous thromboembolism prevention programmes that claim to 'save lives'.^[@R27]^ Although it is claimed these investments have resulted in a modest overall saving (a yield of 2.7%^[@R28]^), it is possible that there is a greater opportunity cost in mental healthcare settings where there is currently no evidence for the cost-effectiveness of venous thromboembolism prophylaxis. It is clear that there is an ongoing need to improve the overall physical health of individuals with mental illness, particularly those with severe mental illness who have been shown to have a substantially lower life expectancy than the general population.^[@R29]^ Although venous thromboembolism is an important cause of mortality, a greater degree of impact could be achieved by investing resources into improving detection and treatment of new cases^[@R3]^ as well as preventative strategies in mental healthcare for cardiovascular disease in general.^[@R30]^ In summary, there is little evidence to support current strategies for venous thromboembolism prophylaxis in mental healthcare settings. Further study to develop and evaluate the effectiveness of novel venous thromboembolism prevention and early detection strategies is therefore warranted. **Declaration of interest** None. [^1]: **Dr Rashmi Patel** is an MRC Clinical Research Training Fellow at the Department of Psychosis Studies, King's College London, UK. | Mid | [
0.631808278867102,
36.25,
21.125
]
|
//============================================================================= // Copyright 2016 YI Technologies, Inc. All Rights Reserved. // // This software is the confidential and proprietary information of YI // Technologies, Inc. ("Confidential Information"). You shall not // disclose such Confidential Information and shall use it only in // accordance with the terms of the license agreement you entered into // with YI. // // YI MAKES NO REPRESENTATIONS OR WARRANTIES ABOUT THE SUITABILITY OF THE // SOFTWARE, EITHER EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE // IMPLIED WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR // PURPOSE, OR NON-INFRINGEMENT. YI SHALL NOT BE LIABLE FOR ANY DAMAGES // SUFFERED BY LICENSEE AS A RESULT OF USING, MODIFYING OR DISTRIBUTING // THIS SOFTWARE OR ITS DERIVATIVES. //============================================================================= import Foundation extension NSDate { func getHours() -> Int { return NSCalendar.current.component(.hour, from: self as Date) } func getMinutes() -> Int { return NSCalendar.current.component(.minute, from: self as Date) } func getSeconds() -> Int { return NSCalendar.current.component(.second, from: self as Date) } } | Low | [
0.404081632653061,
24.75,
36.5
]
|
Q: Pass a cell contents as a parameter to an excel query in Excel 2007 I have tried really hard to solve this issue but I think I am going to need a little help. I can program in different languages but I don't have any experience with Excel, VBA or the queries you can make so please feel free to treat me like a little kid and mention all the little details. What I would like to do is to take the contents in three different cells, and use them as parameters in a SQL query. Right now I have no problems creating the query as mentioned here Run an SQL Query With a Parameter from Excel 2007 and I can choose the parameters from the cells ONCE (by replacing the strings with '?'). But I would like to call the query multiple times as a normal function, just by putting it in a cell like '=MyQuery($A$1,$A$2,$A$3)' The "Database" is just another Excel file chosen from External sources so I don't know if things change in the VBA code. I would be really helpful if you can point me in the right direction, even if they are just pieces of the puzzle. I need a way to get to the query, a way to modify it and a way to execute... but as usual, the devil is in the details. A: Here's the Dynamic SQL, ADODB way to do it (make sure and add the ADODB reference). This was built for string values in the cells. Also there's no error-catching code, please add that as needed: Public Function Test(p1 As Range, p2 As Range, p3 As Range) As Integer Dim cnt As New ADODB.Connection Dim rst As New ADODB.Recordset Dim strSQL As String cnt.Open "Driver={SQL Server};Server=YY;Database=ZZ;Trusted_Connection=yes" strSQL = "Select col4 from Table_1 where col1='" & p1.Value & _ "' and col2='" & p2.Value & _ "' and col3='" & p3.Value & "'" rst.Open strSQL, cnt, adOpenStatic, adLockReadOnly, adCmdText Test = rst("col4") rst.Close cnt.Close Set rst = Nothing Set cnt = Nothing End Function Here's the ADODB, Command-Parameter way, a little trickier. This one is just setup up for single chars: Public Function Test(p1 As Range, p2 As Range, p3 As Range) As Integer Dim cnt As New ADODB.Connection Dim rst As New ADODB.Recordset Dim ccmd As New ADODB.Command Dim PA1 As New ADODB.Parameter, PA2 As New ADODB.Parameter Dim PA3 As New ADODB.Parameter cnt.Open "Driver={SQL Server};Server=YY;Database=ZZ;Trusted_Connection=yes" ccmd.ActiveConnection = cnt ccmd.CommandText = _ "SELECT col4 FROM Table_1 WHERE col1=? AND col2=? AND col3=?" ccmd.CommandType = adCmdText Set PA1 = ccmd.CreateParameter("first", adChar, adParamInput, 1, p1.Value) Set PA2 = ccmd.CreateParameter("second", adChar, adParamInput, 1, p2.Value) Set PA3 = ccmd.CreateParameter("third", adChar, adParamInput, 1, p3.Value) ccmd.Parameters.Append PA1 ccmd.Parameters.Append PA2 ccmd.Parameters.Append PA3 Set rst = ccmd.Execute Test = rst("col4") rst.Close Set rst = Nothing cnt.Close Set cnt = Nothing End Function | Mid | [
0.6424870466321241,
31,
17.25
]
|
bill and bob are both on the roof of a building 176.4 m high. bill drops a penny straight down at the same instant, bob throws a dime vertically upwards. the dime is thrown over the age when it comes back down it misses the roof and follows the penny to the street below. how fast was the dime thrown if when the, penny hits the ground the dime is still at a height of 58.8m? Answer this Question First Name: School Subject: Answer: Related Questions physics - bill and bob are both on the roof of a building 176.4 m high. bill ... Probability - * I have a question. The sentence below says, "A PENNY, a NICKEL, ... Physics - Beatrice throws the 1st calculator straight up from the edge of the ... Computers C++ - I really need help with this one... 1.) Look at the following ... science - The turntable below is spinning. Which coin has a greater speed than ... Physics - A ball is thrown straight up from the ground with an initial velocity ... College Physics - Bob has just finished climbing a sheer cliff above a beach, ... math - A box contains 4 coins: a penny, a nickel, a dime, and a quarter. It ... Physics Gr.11 - Frank stands at the base of a building. He throws a 0.12kg rock ... physics - Frank stands at the base of a building. He throws a 0.12kg rock ... | Mid | [
0.6545454545454541,
24.75,
13.0625
]
|
Assessing the impacts of dynamic soft-templates innate to switchable ionic liquids on nanoparticulate green rust crystalline structures. This experimental and theoretical study investigates how dynamic solvation environments in switchable ionic liquids regulate the composition of nanoparticulate green rust. A custom microfluidic device enables in situ X-ray absorption spectroscopy to elucidate characterization of the solvent structure and speciation of reaction intermediates of air-sensitive nanoparticles growing in solution. | High | [
0.6633906633906631,
33.75,
17.125
]
|
Transcription of biliary glycoprotein I gene in malignant and non-malignant human liver tissues. Biliary glycoprotein I (BGP I) is a member of carcinoembryonic antigen (CEA) gene family consisting of at least 11 related genes. The transcription of BGP I gene was analysed in malignant and non-malignant human liver tissues with a 396-bp 3'-untranslated region probe from a cDNA clone 4-13 which was newly isolated from an adult human colon cDNA library. Among 21 tissue samples from 14 patients with hepatocellular carcinoma, 16 samples were clearly shown to express a single 3.9-kb message. This message was also found in the hepatoma cell line HuH-7. When the malignant tissues were compared to the non-malignant ones for the intensity of the band, no significant difference was observed. mRNAs of CEA and non-specific cross-reacting antigen (NCA) were not detected in 5 samples which were shown to have the message of the BGP I gene. These data suggest that the human hepatocyte and its malignant transformant produce BGP I, and that this could correspond to the cross-reacting antigen previously detected in the liver. | Mid | [
0.6096385542168671,
31.625,
20.25
]
|
Q: Error: HTTP Error: 400, Project 'projectname' is not a Firestore enabled project I am getting this error : I think firebase setup is good but problem with deploy === Deploying to 'uiexpertonline'... i deploying storage, firestore, hosting i storage: checking storage.rules for compilation errors... ✔ storage: rules file storage.rules compiled successfully i firestore: checking firestore.rules for compilation errors... ✔ firestore: rules file firestore.rules compiled successfully i storage: uploading rules storage.rules... i firestore: uploading rules firestore.rules... i hosting: preparing dist directory for upload... ✔ hosting: 23 files uploaded successfully ✔ storage: released rules storage.rules to firebase.storage/uiexpertonline.appspot.com ✔ firestore: released rules firestore.rules to cloud.firestore ✔ Deploy complete! Project Console: https://console.firebase.google.com/project/uiexpertonline/overview Hosting URL: https://uiexpertonline.firebaseapp.com Bhupinders-MacBook-Pro:ui bhupinder$ A: When you are doing the firebase init that time you need to say No to override the index.html | Mid | [
0.6116751269035531,
30.125,
19.125
]
|
Fania Bergstein Fania Bergstein () was a Hebrew poet, born in 1908 in Szczuczyn, Łomża Governorate, Congress Poland, Russian Empire. Fania Bergstein participated in the Zionist youth movement He-Halutz Hatzair. In 1930 she immigrated to British Mandate of Palestine, and joined Kibbutz Gvat. She died of heart failure at the age of 42, on September 18, 1950. References Category:1908 births Category:1950 deaths Category:People from Grajewo County Category:People from Łomża Governorate Category:Polish Jews Category:Polish emigrants to Mandatory Palestine Category:Jews in Mandatory Palestine Category:Israeli people of Polish-Jewish descent Category:Israeli women poets Category:Polish women poets Category:20th-century women writers Category:20th-century Israeli poets Category:20th-century Polish poets | High | [
0.657824933687002,
31,
16.125
]
|
Q: Map with ArrayList as the value in Java - Why use a third party library for this? I've recently found the need to use a Map with a Long as the key and an ArrayList of objects as the value, like this: Map<Long, ArrayList<Object>> But I just read here that using a third-party library like Google Guava is recommended for this. In particular, a Multimap is recommended instead of the above. What are the main benefits of using a library to do something so simple? A: I like the ArrayList analogy given above. Just as ArrayList saves you from array-resizing boilerplate, Multimap saves you from list-creation boilerplate. Before: Map<String, List<Connection>> map = new HashMap<>(); for (Connection connection : connections) { String host = connection.getHost(); if (!map.containsKey(host)) { map.put(host, new ArrayList<Connection>()); } map.get(host).add(connection); } After: Multimap<String, Connection> multimap = ArrayListMultimap.create(); for (Connection connection : connections) { multimap.put(connection.getHost(), connection); } And that leads into the next advantage: Since Guava has committed to using Multimap, it includes utilities built around the class. Using them, the "after" in "before and after" should really be: Multimap<String, Connection> multimap = Multimaps.index(connections, Connection::getHost); Multimaps.index is one of many such utilities. Plus, the Multimap class itself provides richer methods than Map<K, List<V>>. A: What is Guava details some reasoning and benefits. For me the biggest reason would be reliability and testing. As mentioned it has been battle-tested at Google, is now very widely used elsewhere and has extensive unit testing. | High | [
0.7329545454545451,
32.25,
11.75
]
|
488 S.W.2d 515 (1972) Billy G. UNDERWOOD, Appellant, v. George WILLIAMS, Jr., Appellee. No. 17362. Court of Civil Appeals of Texas, Fort Worth. December 15, 1972. *516 Marvin Jones, Dallas, for appellant. John L. Sullivan and Jack Gray, Griffin, Shelton & Eames, and Mike Griffin and Robert N. Eames, Denton, for appellee. OPINION BREWSTER, Justice. The defendant, Underwood, here appeals from the trial court's order overruling his plea of privilege to be sued in Dallas County where he lives. The plaintiff, Williams, argued in his controverting plea and in his appellee's brief that venue of the case was properly in Tarrant County under Subdivisions 7, 9 and 9a of Art. 1995, Vernon's Ann.Civ.St. The petition alleged: "III. "On or about March 19, 1971, the defendant, BILLY G. UNDERWOOD, acting by and through his ranch manager, DUB DALE, duly authorized to so act, exhibited to the Plaintiff, GEORGE WILLIAMS, JR., for purposes of sale to said Plaintiff, nineteen (19) quarter horses, represented to be registered with said American Quarter Horse Association; plaintiff purchased said horses for the sum of $5,000.00, and paid said Defendant, BILLY G. UNDERWOOD, said sum of $5,000.00.... At the time of said sale, and as a part of the consideration therefor, it was ... agreed that the Defendant would transfer the registration on said quarter horses, to the Plaintiff, or his assigns, under said rules and regulations of the American Quarter Horse Association. Plaintiff relied upon said representations in the purchase of said horses,... and plaintiff would not have purchased said horses nor paid for the same... but for his ... reliance upon said representations. (Emphasis ours.) ". . . "V. "Defendant, BILLY G. UNDERWOOD, has unconditionally refused to comply with his contractual obligation to sign the necessary papers for transfer of registration of said quarter horses, ... and has fraudulently demanded that the Plaintiff pay him large sums of money, in addition to the purchase price of said horses, in order to secure his signature on said registration papers. "VI. "Plaintiff, GEORGE WILLIAMS, JR., due to said fraudulent representations and *517 demands of the Defendant, BILLY G. UNDERWOOD, has sustained large monetary losses, and expenses, in addition to damage to his business and professional reputation. He has heretofore sold said horses in good faith, and has been unable to comply with the terms of said sales, because of the defendant's said fraudulent representations and demands. Plaintiff, by reason of his being the innocent victim of defendant's said fraud is also subject to multiple suits for damages by his purchasers of said horses, and was then, and is being harassed, embarrassed and humiliated, because of said fraud of defendant. "VII. "Plaintiff ... has heretofore also paid Defendant ... the sum of $340.00 for stud service fees, but the Defendant... has ... refused to sign the breeder's certificate, showing such stud service, which is required as a condition to registration of the foals ... causing Plaintiff damage .... "VIII. "By reason of such fraudulent acts and omissions of said defendant, BILLY G. UNDERWOOD, in connection with the sale of said horses, and the rendition of said stud breeding service, the Plaintiff, GEORGE WILLIAMS, JR., has sustained actual damages in the sum of $5,340.00, being the amount paid for said horses and said breeding service, plus his additional expense in cataloging and advertising said horses for sale, and in selling said horses. Further, by reason of said fraud, and the wilful and malicious nature of said intentional wrongs to the Plaintiff, Plaintiff is further entitled to recover exemplary damages from the defendant in the sum of not less than $7,500.00, for all of which actual and exemplary damages Plaintiff herein sues." In defendant's three points of error he contends that the trial court erred in holding that plaintiff's pleadings and evidence were sufficient to make out either a case of fraud under Subdivision 7, or a case of crime or trespass under Subdivision 9, or a case of negligence under Subdivision 9a of Art. 1995, V.A.C.S. We sustain all of defendant's points of error. The plaintiff's strongest argument to keep venue in Tarrant County can be made with reference to Subdivision 7. Subdivision 7, Art. 1995, V.A.C.S., provides: "In all cases of fraud ... suit may be brought in the county where the fraud was committed or ... where the defendant has his domicile." It is settled that Subdivision 7 applies only in instances where the cause of action is clearly based upon fraud and that it does not apply where the fraud is just incidental to the main cause of action sued upon. Morgan v. Box, 449 S.W.2d 499 (Dallas, Tex.Civ.App., 1969, no writ hist.); Stegall v. Lytle, 360 S.W.2d 898 (San Antonio, Tex.Civ.App., 1962, no writ hist.); Murray v. Frankland, 347 S.W.2d 374 (Houston, Tex.Civ.App., 1961, no writ hist.); and Bateman v. McGee, 50 S.W.2d 374 (Dallas, Tex.Civ.App., 1932, no writ hist.). In order to be able to keep venue of this case in a county other than that of defendant's residence under Subdivision 7 of Art. 1995, V.A.C.S., the plaintiff had the burden of both pleading and proving a cause of action for fraud, within the meaning of said Subdivision 7, and that such fraud was committed in the county of suit. Stegall v. Lytle, supra; Morgan v. Box, supra; A. H. Belo Corporation v. Blanton, 133 Tex. 391, 129 S.W.2d 619 (1939); and C. R. Miller Mfg. Co. v. Provine, 17 S.W. 2d 128 (Eastland, Tex.Civ.App., 1929, no writ hist.). An examination of plaintiff's petition reveals that he does not allege or claim that defendant misrepresented any past or existing fact as a basis for an action for fraud. *518 The basis of his suit is his allegation that a part of the contract whereby the horses were purchased from defendant was defendant's promise or agreement that he would transfer the registration of such horses to the plaintiff or to his assigns and that defendant has failed and refused to carry out his promise or agreement relative to the transfer of such certificates thereby causing plaintiff damage. In his appellee's brief filed in this Court the plaintiff stated the following on page 1: "... Plaintiff ... filed suit... seeking damages which resulted from the refusal of Appellant to transfer the registration of certain quarter horses which Appellee had purchased from Appellant and for his refusal to furnish a breeder's certificate in connection with a mare which was bred to one of Appellant's stud horses." In our opinion the plaintiff's petition in this case did not allege a cause of action for fraud within the meaning of Subdivision 7 of Art. 1995, V.A.C.S. He simply pleaded a suit for breach of contract in that he pleaded the making of a promise and a breach thereof. A mere failure to perform an agreement does not constitute actionable fraud. Texas Star Flour Mills v. Victoria Wholesale Grocery, 115 S.W.2d 500 (San Antonio, Tex.Civ.App., 1938, no writ hist.); Johnston v. Bracht, 237 S.W.2d 364 (San Antonio, Tex.Civ.App., 1951, no writ hist.); and Idar v. Alaniz, 70 S.W.2d 756 (San Antonio, Tex.Civ.App., 1934, no writ hist.). Before a promise to do something in the future can be made the basis of an actionable fraud such promise must have been made with the promisor intending at the very time the promise was made not to carry it out. Stegall v. Lytle, supra; Morgan v. Box, supra; Murray v. Frankland, 347 S.W.2d 374 (Houston, Tex.Civ. App., 1961, no writ hist.); Texas Star Flour Mills v. Victoria Wholesale Grocery, supra; Johnston v. Bracht, supra; C. R. Miller Mfg. Co. v. Provine, supra; Turner v. Biscoe, 141 Tex. 197, 171 S.W.2d 118 (1943); and Lyon v. Gray, 265 S.W. 1094 (Amarillo, Tex.Civ.App., 1924, no writ hist.). In the absence of an allegation in the petition that defendant intended, at the time he made the promise, not to carry it out, no cause of action for fraud with reference to that promise was alleged. No such allegation was present in plaintiff's petition. The conclusions we have stated are not altered by the fact that in the plaintiff's petition the word "fraud" or the phrase "fraudulent misrepresentations" appear at several different places. For instance plaintiff alleged in substance that defendant refused to comply with the contract to sign the necessary transfer papers and "fraudulently" demanded that plaintiff pay him added large sums of money. He also alleged that due to the "fraudulent representations and demands" plaintiff suffered damages. He then later alleged that by reason of said fraud and the wilful and intentional wrongs to plaintiff that plaintiff is entitled to recover exemplary damages. The Supreme Court of Texas while dealing with a question like the one we have here said in the case of Baines v. Mensing et al., 75 Tex. 200, 12 S.W. 984 (1889) the following: "The petition alleges substantially that plaintiff had a very advantageous contract with defendants, ... which they refused to perform. The facts he sets up can amount to nothing more. The general averments that they induced him to make the contract with a fraudulent intent to ruin his business, ... or that their acts were done in the furtherance of a scheme to ruin him ... such general averments do not set up fraud in a legal sense. Merely to characterize an act as fraudulent does not make it a good allegation of fraud.... it was nothing more than a breach of a contract.... No amount of mere denunciation of it as a fraud could make it so. The facts constituting the fraud must be *519 alleged. If a failure of defendants to comply with the alleged agreement constituted a fraud, because it was so denominated... and because it resulted disastrously to plaintiff's business, there is no reason why the breach of any contract, ... would not be fraudulent, or made so by mere abstract allegation." The holding of the Baines case has been followed down to the present time and is still the law in Texas. See Morgan v. Box, 449 S.W.2d 499, supra; McLaughlin v. Shannon, 3 Tex.Civ.App. 136, 22 S.W. 117 (1893, no writ hist.); Oakes & Witt v. Thompson, 58 Tex.Civ.App. 364, 125 S.W. 320 (1910, no writ hist.); Idar v. Alaniz, supra; Beale v. Cherryhomes, 21 S.W.2d 65 (Fort Worth, Tex.Civ.App., 1929, no writ hist.); and Allied Finance Company v. Fowler, 358 S.W.2d 239 (Austin, Tex. Civ.App., 1962, no writ hist.). Even if a plaintiff has an actionable case of fraud against a defendant, if instead of suing him on it the plaintiff elects, as he did here, to sue the defendant for damages for breach of contract instead, the plaintiff waives the fraud as a fact fixing venue. Caprock Machinery Company v. Boswell, 318 S.W.2d 669 (Amarillo, Tex.Civ.App., 1958, writ dism.); Texarkana Water Supply Corp. v. L. E. Farley, Inc., 353 S.W.2d 885 (Houston, Tex.Civ. App., 1962, no writ hist.); and Dowell v. Long, 219 S.W. 560 (Texarkana, Tex.Civ. App., 1920, no writ hist.). We have carefully examined the pleadings and the evidence and also hold that the plaintiff neither pleaded nor proved facts sufficient to entitle him to maintain venue of this suit in Tarrant County under either Subdivisions 9 or 9a of Art. 1995, V.A.C.S. The trial court's judgment is reversed and judgment is here rendered sustaining defendant's plea of privilege and the case is ordered transferred to a District Court of Dallas County. | Low | [
0.5190476190476191,
27.25,
25.25
]
|
Q: I do not know if my algorithm complexity is $P$, $NP$ or $NP-hard$? I developed an algorithm but just not sure what is the complexity of the algorithm. I provide a brief description of it below: "For $N$ user case, there are $B(N)$ Decision Variables. $B(N)$ is Bell Number, for those of you who are not familiar with Bell Numbers please be noted that $B(N)$ grows exponentially with $N$. In every turn, I have to choose the minimum Decision Variable among all of the Decision Variables and do a certain action accordingly." I know that sorting problem is considered a Polynomial $(P)$ problem. But I am confused if my algorithm is considered $P$ or $NP$ or $NP-hard$ since the number of decision variables that are being sorted grows exponentially with $N$. A: Your question is somewhat malformed because P and NP are classes of problems, not algorithms. For example, as you state, the problem of sorting is in P. However, that doesn't mean that every sorting algorithm runs in polynomial time. For example, the well-known joke algorithm bogosort sorts lists by trying every possible permutation until it finds one that is sorted. It has running time approximately $n!$, which is far from polynomial. If a problem has polynomial time complexity, that means that there exists an algorithm that solves it in polynomial time, but it doesn't mean that all algorithms for the problem are that efficient. It's not possible to say what the complexity of your problem is, or what the running time of your algorithm is, because you haven't given a precise description of either. The fact that it involves choosing a "best" set from some exponentially large set doesn't necessarily mean the problem has to have exponential time complexity: there could be a smart way of picking the best set without considering all the options. For example, there are polynomial-time algorithms for finding the shortest path between two points in a graph, even though there may be exponentially many paths. | Mid | [
0.5985401459854011,
30.75,
20.625
]
|
Intraoperative positioning during cesarean as a cause of sciatic neuropathy. Sciatic nerve compression has been well documented as a cause of perioperative sciatic neuropathy but rarely during cesarean. A parturient complained of left foot drop after cesarean delivery for twins performed under spinal anesthesia. Intraoperatively, her right hip was raised with padding under the right buttock to tilt the pelvis approximately 30 degrees to the left. Postoperatively, the patient had weakness, sensory changes, and diminished reflexes in the left lower extremity. Electrodiagnostic studies supported a diagnosis of neurapraxia and partial denervation in the distribution of the sciatic nerve. By postpartum week 6, she had full recovery. Elevating the right buttock during cesarean can cause compression of the underlying structures of the left buttock and result in sciatic neuropathy. Decreasing the duration of time the patient is in the left lateral position may reduce the risk of this uncommon but debilitating complication. | High | [
0.678217821782178,
34.25,
16.25
]
|
/* * Copyright (c) Facebook, Inc. and its affiliates. * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. * You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. */ package com.facebook.litho.intellij.actions; import com.facebook.litho.intellij.LithoPluginUtils; import com.facebook.litho.intellij.completion.OnEventGenerateUtils; import com.facebook.litho.intellij.extensions.EventLogger; import com.facebook.litho.intellij.logging.LithoLoggerProvider; import com.intellij.codeInsight.CodeInsightActionHandler; import com.intellij.codeInsight.generation.ClassMember; import com.intellij.codeInsight.generation.GenerateMembersHandlerBase; import com.intellij.codeInsight.generation.GenerationInfo; import com.intellij.codeInsight.generation.PsiGenerationInfo; import com.intellij.codeInsight.generation.PsiMethodMember; import com.intellij.codeInsight.generation.actions.BaseGenerateAction; import com.intellij.ide.util.TreeJavaClassChooserDialog; import com.intellij.openapi.actionSystem.AnActionEvent; import com.intellij.openapi.actionSystem.CommonDataKeys; import com.intellij.openapi.application.ApplicationManager; import com.intellij.openapi.project.Project; import com.intellij.psi.PsiClass; import com.intellij.psi.PsiFile; import com.intellij.psi.PsiMethod; import com.intellij.psi.search.GlobalSearchScope; import com.intellij.util.IncorrectOperationException; import java.util.ArrayList; import java.util.Collections; import java.util.List; import java.util.Optional; import javax.annotation.Nullable; import org.jetbrains.annotations.NotNull; /** * Generates a method handling Litho event in the Litho Spec. * https://fblitho.com/docs/events-overview */ public class OnEventGenerateAction extends BaseGenerateAction { public interface EventChooser { PsiClass choose(PsiClass context, Project project); } @Nullable public interface OnEventRefactorer { PsiMethod changeSignature(Project project, PsiMethod originalOnEventMethod, PsiClass context); } public interface OnEventGeneratedListener { void onGenerated(PsiMethod onEvent); } public static CodeInsightActionHandler createHandler( EventChooser eventChooser, OnEventGeneratedListener onEventGeneratedListener) { return new OnEventGenerateHandler( eventChooser, (project, originalOnEventMethod, context) -> { if (ApplicationManager.getApplication().isUnitTestMode()) { return originalOnEventMethod; } final OnEventChangeSignatureDialog onEventMethodSignatureChooser = new OnEventChangeSignatureDialog(project, originalOnEventMethod, context); onEventMethodSignatureChooser.show(); return onEventMethodSignatureChooser.getMethod(); }, onEventGeneratedListener); } public OnEventGenerateAction() { super( createHandler( (context, project) -> { // Choose event to generate method for final TreeJavaClassChooserDialog chooseEventDialog = new TreeJavaClassChooserDialog( "Choose Event", project, GlobalSearchScope.allScope(project), LithoPluginUtils::isEvent, context /* Any initial class */); chooseEventDialog.show(); return chooseEventDialog.getSelected(); }, onEventMethod -> LithoLoggerProvider.getEventLogger() .log(EventLogger.EVENT_ON_EVENT_GENERATION + ".success"))); } @Override public void update(AnActionEvent e) { // Applies visibility of the Generate Action group super.update(e); final PsiFile file = e.getData(CommonDataKeys.PSI_FILE); if (!LithoPluginUtils.isLithoSpec(file)) { e.getPresentation().setEnabledAndVisible(false); } } /** * Generates Litho event method. Prompts the user for additional data: choose Event class and * method signature customisation. * * @see com.facebook.litho.intellij.completion.MethodGenerateHandler */ static class OnEventGenerateHandler extends GenerateMembersHandlerBase { private final EventChooser eventChooser; private final OnEventGeneratedListener onEventGeneratedListener; private final OnEventRefactorer onEventRefactorer; OnEventGenerateHandler( EventChooser eventChooser, OnEventRefactorer onEventRefactorer, OnEventGeneratedListener onEventGeneratedListener) { super(""); this.eventChooser = eventChooser; this.onEventGeneratedListener = onEventGeneratedListener; this.onEventRefactorer = onEventRefactorer; } /** @return method based on user choice. */ @Override protected ClassMember[] chooseOriginalMembers(PsiClass aClass, Project project) { return Optional.ofNullable(eventChooser.choose(aClass, project)) .map( eventClass -> OnEventGenerateUtils.createOnEventMethod( aClass, eventClass, Collections.emptyList())) .map( customMethod -> { OnEventGenerateUtils.addComment(aClass, customMethod); onEventGeneratedListener.onGenerated(customMethod); return new ClassMember[] {new PsiMethodMember(customMethod)}; }) .orElse(ClassMember.EMPTY_ARRAY); } @Override protected GenerationInfo[] generateMemberPrototypes(PsiClass psiClass, ClassMember classMember) throws IncorrectOperationException { return generateMemberPrototypes(psiClass, new ClassMember[] {classMember}) .toArray(GenerationInfo.EMPTY_ARRAY); } /** @return a list of objects to insert into generated code. */ @NotNull @Override protected List<? extends GenerationInfo> generateMemberPrototypes( PsiClass aClass, ClassMember[] members) throws IncorrectOperationException { final List<GenerationInfo> prototypes = new ArrayList<>(); for (ClassMember member : members) { if (member instanceof PsiMethodMember) { PsiMethodMember methodMember = (PsiMethodMember) member; prototypes.add(new PsiGenerationInfo<>(methodMember.getElement())); } } return prototypes; } @Override protected ClassMember[] getAllOriginalMembers(PsiClass psiClass) { return ClassMember.EMPTY_ARRAY; } } } | Low | [
0.534161490683229,
32.25,
28.125
]
|
Regular Features Current NewsChina ReportNews and Commentary on Current EventsA Year of Anniversaries: 20091919, 1949, 1979, 1989...Global ChinaChinese communities around the worldTales from TaiwanMeanwhile, across the strait... 8/27/2008 The KMT Backstroke Now that the Beijing Olympiad has reached its glorious conclusion, people in Taiwan are starting to turn their attentions back to the home front. The Olympics did not go very well for Taiwan, which ended up winning only 4 bronze medals, its worst result in 20 years. Even the baseball team could only mange a fifth-place finish, including a shocking 8-7 loss to China in extra innings. One of the few bright spots was the competitive spirit of athletes like Su Li-wen 蘇麗文, who fought to the bitter end while losing her bronze medal match by a single point in extra time, despite having suffered a painful injury. The dedication that these men and women displayed is particularly impressive in light of the fact that they are not permitted to compete in their country's name, but rather under the odd moniker of "Chinese Taipei" (中華台北). On the domestic front, things look grim as well. The stock market has plummeted, real wages are declining, exports are in a tailspin, and GDP estimates continue to be revised downwards. About the only things going up are unemployment and prices. These are worldwide problems, and the KMT government has numerous experts who are working on solutions. At the same time, however, the KMT also seems to be devoting considerable effort to restoring its ideological hegemony, attacking its enemies, promoting party loyalists cronies, and pursuing a pro-China agenda. One prominent example of the first phenomenon concerns the controversy over the proposed renaming of the Chiang Kai-shek Memorial Hall as the National Taiwan Democracy Memorial Hall, which was the subject of a post on this website in January 2008. At a recent Cabinet meeting, Premier Liu Chao-shiuan 劉兆玄 instructed the Executive Yuan to withdraw the former DPP government's request to abolish the Organic Statue of the CKS Memorial Hall (國立中正紀念堂管理處組織條例廢止案), while also approving the abolition of the Organic Statute of the National Taiwan Democracy Memorial Hall (國立台灣民主紀念館組織規程), thereby condemning the latter name to the dustbin of history and signifying the imminent return of hero worship of the former dictator. As for the issue of whether to restore the inscription 大中至正 on the Hall's entry arch, Minister of Education Cheng Jei-cheng 鄭瑞城 said that this would be discussed in a series of public forums. Another sign of the revival of KMT ideology may be found in reports that the armed forces plan to reinstate the singing of "I Love China" (我愛中華), which features a line about "5,000 years since the nation was founded" (開國五千年), at evening assemblies of soldiers stationed at all military bases. Efforts at purging DPP-appointed officials (拔綠官) are also continuing apace, including the effective demotion of Executive Yuan Deputy Secretary-General Chen Mei-ling 陳美伶, and the dismissal of Parris Chang (張旭成) as representative to Bahrain. Perhaps even more striking are the unrelenting attempts to convict former president Chen Shui-bian 陳水扁 of corruption, which have included the declassification of secret documents relating to Chen's use of the state affairs fund (國務機要費), a decision that may impact national interests. More recently, the KMT government has launched a wide-ranging investigation of Chen and his relatives on charges of laundering excess campaign funds. Such allegations have shocked, disappointed, and broken the hearts of many DPP supporters, but their legal implications remain unclear (Like the U.S., Taiwan has only recently begun to address the problem of campaign finance reform, and current laws contain numerous loopholes). There is no doubt that the rooting out of corruption is an essential element of any democracy. Chen has admitted that he and his wife made mistakes, and both have withdrawn from the DPP. If he or members of his family have in fact broken the law, they should face justice for their actions. Nonetheless, one cannot help but wonder if the current anti-Chen campaign is motivated by more than concerns over corruption, and might also constitute a means of currying favor with pan-blue hardliners while also diverting attention from the new government's problems. Moreover, the tone of some attacks on Chen, his relatives, and even his acquaintances has at times taken on a chilling and even vindictive tenor, which suggests that some KMT leaders have never forgiven the son of a tenant farmer for snatching away the power that they had been groomed to assume. All this, combined with the above-mentioned weeding out of former DPP officials, seems to be sending a clear message to any Taiwanese elites who might have doubts about professing their loyalty to the new government. It also remains to be seen how diligent the KMT will be about tackling irregularities in its own ranks. For example, despite President Ma Ying-jeou 馬英九's promises of clean government, the KMT-dominated parliament has so far failed to pass any significant legislation related to this issue, and has continued to obstruct the passage of so-called "sunshine laws" (陽光法案). Another thorny problem involves charges of dual citizenship among KMT elites, the most prominent being Legislator Diane Lee (李慶安), who has been accused of holding U.S. citizenship while serving in a number of elected offices. Nearly six months have passed since Next Magazine (壹週刊) broke the story, but the Legislative Yuan has yet to divulge any details of its ongoing investigation, while the Central Election Commission seems unable to reach any consensus on how to deal with the issue. Eyebrows has also been raised over the decision by Taipei Mayor Hau Lung-pin 郝龍斌 (son of former Premier Hau Pei-tsun 郝柏村) to appoint Sean Lien 連勝文 (son of former Premier and Vice President Lien Chan 連戰) to serve as an EasyCard board member. Qualifications aside, the younger Lien's reported monthly salary of NT$300,000 seems particularly galling to recent college graduates, many of whom are starting at jobs paying only NT$25,000 a month. Hau's decision prompted the Apple Daily (蘋果日報) to issue a scathing editorial, which included the observation that "The specter of the old KMT has been haunting the land since even before the Ghost Month" (老國民黨幽靈早在鬼月之前，就已經四處作怪). Of greatest concern to many Taiwanese, however, is the new government's pro-China stance. While the current "low key", "practical", and "rational" approach to questions of national identity has gone a long way towards reducing tensions, the long-term benefits and costs for Taiwan remain to be seen. While the Cross-Strait atmosphere has improved, direct flights have as yet failed to result in large groups of Chinese tourists traveling to Taiwan (visitor numbers average 212 per day, and are dropping). Moreover, Beijing has yet to agree to direct cargo flights, and continues to deploy hundreds of missiles aimed at the island. On the diplomatic front, the government has decided not to apply for full UN membership this year (as either the "Republic of China" or "Taiwan"), opting instead to seek "meaningful participation" in the august organization's auxiliary associations. Accordingly, the Ministry of Foreign Affairs has prepared a proposal for the General Assembly asking it to support "the fundamental rights of the 23 million people of the Republic of China (Taiwan) to participate meaningfully in the activities of the United Nations specialized agencies". The main goal of these efforts seems to be joining the WHO, but prospects seem dim indeed, especially since Wang Yi 王毅, head of China's Taiwan Affairs Office, indicated that China would never accept Taiwan becoming a member of that organization, but would look instead into forming an international network to share data with Taiwan in cases of disease outbreaks. More recently, in spite of Ma's calls for a "diplomatic truce", in an August 18 letter to UN Secretary General Ban Ki-moon, Chinese Ambassador to the UN Wang Guangya 王光亞 stated that, "Taiwan is not a sovereign state. The claim by a very few countries that specialized agencies should allow the Taiwan region to 'participate' in their activities under the 'principle of universality' is unfounded", essentially splashing ice-cold water on the KMT plan. The government's next course of action is unclear. It also seems significant that key allies such as the Vatican, Haiti, Guatemala, Paraguay, Panama and the Dominican Republic have chosen not to cosponsor the above-mentioned resolution. The actions of these allies are understandable, however, as some have begun to wonder whether the new government's position includes the possibilty of dual recognition, a point that Ma has been at pains to deny. Other allies have reached a different conclusion, as can be seen in the decision by the Dominican Republic to refer to the delegation led by Ma on his state visit as "China, Taiwan". This did not seem to raise concerns among Taiwan's new crop of diplomats and National Security Council officials, however, who argued that according to the 1992 Consensus (九二共識) Taiwan could be referred to as China, since each side had agreed to its own definition of the term (一中各表). The trend of renaming Taiwan is now spreading to countries like Australia and Thailand, both of which have referred to the nation as "Chinese Taipei" on government websites. Current trends have caused some concern in U.S. diplomatic circles, with recent reports indicating that officials who visited Taiwan earlier this month informed the KMT government of a "Two No's" (二不) position, namely no hinting that China has sovereignty over Taiwan and no acceptance of China having final say over Taiwan's participation in international organizations. This suggests that the U.S. government, once concerned about Chen's government upsetting the status quo, may now have similar worries about the Ma government. Anxiety on the diplomatic front, combined with the restoration of the name "Chunghwa Post" (中華郵政), confusion over China's attempts to use the title "Taipei, China" (中國台北) for the Olympic team instead of "Chinese Taipei", and uncertainty over whether the new government will push for the purchase of the F-16 C/D fighter, have caused many to wonder about the KMT government's long-term intentions. For its part, KMT elites in favor of unification continue to visit China as often as they can, and some are said to be pushing for the new government to restore the Guidelines for National Unification (國家統一綱領). While the pace at which the KMT government will edge towards this goal remains to be seen, these issues may well continue to occupy worldwide attention for many months to come. 6 comments: Can Paraguay still be considered a diplomatic ally of Taiwan? It was interesting that the Chinese propaganda ministry issued guidelines barring Chinese journalists from speculating on Paraguay-China ties during the Olympics. Paraguay was one of four countries called out in the "Particularly, don't do this" section, and the only one that was a big "Huh?" This suggests that something delicate is going on at a very high level. Even if Taiwan keeps Paraguay, it's going to cost more in "investment" (bribe) than it has in the past. The Vatican is definitely not a diplomatic ally of Taiwan anymore. Just a matter of time, probably another 5-20 years. As usual, The China Beat provides us with the DPP's official view of Taiwan. I suppose Chen's money laundering, discovered by Swiss and Singapore banks, is also a KMT smear job, right? I love how China Beat sees the KMT's appointments as a cleaning out of DPP people! But isn't this what happens when new administrations take over in democracies? Come on guys! Get a grip on reality. You might have mentioned this mirrors the DPP when it came to powerit also devoted considerable effort to establishing its ideological hegemony, attacking its enemies, promoting party loyalists cronies, and pursuing a anti-China agenda. One cannot help but wonder if the DPP's campaigns over Taiwanese identity were motivated by more than concerns over Taiwan's future, and might also constitute a means of currying favor with pan-green hardliners while also diverting attention from the government's problems. I suppose Chen's money laundering, discovered by Swiss and Singapore banks, is also a KMT smear job, right? No one has provided any evidence of money laundering. At present that is merely a claim of the KMT. The Chens say the money came from unreported campaign funds, not government monies. If you have evidence of "money laundering" by all means bring it to the attention of the authorities. Meanwhile, the $400 million payoff from France to the KMT in 1991 has not resulted in a single conviction. No one has been investigated, let alone prosecuted or jailed, from the martial law era killings. The massive institutional corruption of the KMT remains largely unconfronted by the overwhelmingly Blue prosecutorial system. But Chen is guilty of money laundering! Whew! Glad we're square on that! We both know that if Chen were KMT, none of this would be getting the least bit of attention. And what a coincidence that story, known since Jan -- with prosecutors asking about in March -- suddenly breaks as Ma is in the midst of the worst performance by a KMT president since the 1970s, with failure on every front, including stock market and economic growth implosion. Good thing we appointed Ma to save us! Excellent post Paul, that. One quibble: although it was reported in the Taipei Times and other papers that Ma had changed Taiwan's name to China, Taiwan in the Dominican Republic, a veteran newsman with many trips to the area under his belt assures me that the Spanish term is widely used, long predates Ma, and is not a pro-China term, but a simple local designate for Taiwan. And Chen did far less of a "purge" when he came to power in 2000. Chen had a KMT environmental minister, a KMT premier, and a KMT defense minister (through almost his entire administration). Most of the pro-KMT officials in the bureaucracy remained, especially in the diplomatic corps, where they worked to undermine Chen at every turn. These prosecutions are part of a strategy to smear the DPP as corrupt -- a strategy Chen has stupidly, and richly, rewarded. As usual, The China Beat provides us with the DPP's official view of Taiwan Many thanks to everyone for all the insightful comments, which certainly prove the wisdom of the old saying, "All crows under heaven are black". Accordingly, all corrupt politicians deserve to be punished, regardless of which party they belong to. At the same time, however, any person accused of a crime has the right to be presumed innocent until proven guilty. I would like to clarify one issue: As an expatriate scholar living in Taiwan, and as a contributor to this blog, I feel that it is my responsibility to provide a balanced view of "how the East is read" (in this case Taiwan). If you follow all the weblinks in my posts, you will find that my sources range from the Central News Agency, China Times, Liberty Times, NOWNews, Taipei Times, United Daily News, government websites, etc. I do not claim to be totally objective, but my overriding concern has always been for the future of Taiwan's democracy, which, despite its many imperfections, provides a model that merits our admiration and respect. I don't believe Katz "as usual, provides us with DPP's official view of Taiwan." My observation is that, when serving as a journalist (though he is a historian by profession), Katz rather takes the position of the New York Times, or the Guardian, in Taiwan. He is (much more than Taiwan's mainstream media) skeptic about authoritarianism (guess which of KMT and DPP is authoritarian) and sympathetic (not without balance or moderation) with those who were repressed (guess which parties have relentlessly repressed dissidents across the Taiwan Strait—KMT in Taiwan and the Communist in China). If you are, like Katz, socialist-inclined, liberal, democratic, and progressive, and have studied Taiwan's past (as he does), you'd much appreciate his thoughtful reading of KMT's recent backstrokes. Good job, Dr. Katz. Thank you. | Low | [
0.522540983606557,
31.875,
29.125
]
|
1. Field of the Invention The present invention relates to a tire chuck apparatus and method for gripping a tire from the inner side of the bead portion. 2. Description of the Related Art Unprocessed tires and vulcanized tires (finished products) are generally gripped for various reasons. Tires are gripped in order to insert or take out a tire in a vulcanizing mold in a tire manufacturing process, or in order to collect and ship tires in a physical distribution process, or in order to be shipped in or out in a sales process. A known conventional chuck apparatus for gripping tires in these types of processes is one provided with, for example, a supporting member capable of moving in the central axial direction of the tire and at least two gripping claws supported by the supporting member such that the gripping claws can expand and contract in the radial direction of the tire. In this chuck apparatus, by moving the supporting member in the central axial direction of the tire when each of the gripping claws is contracted in the radial direction of the tire, each gripping claw is inserted within the tire bead portion of a tire placed horizontally on a roller conveyor, loading stand, or the like. By then expanding each of the gripping claws in this state in the radial direction of the tire, the tire bead portion is gripped from the inner side. However, in this type of conventional tire chuck apparatus, the problem arises that the tire is sometimes gripped in a state in which the center of the tire is out of position. The reason for this occurring is described below. Namely, if the central axis of the tire and the center of the chuck apparatus gripping the tire (the center of a single circle running through all the gripping claws) are not aligned, when the gripping claws expand in the radial direction of the tire, the gripping claws contact the internal periphery of the tire bead portion one after the other with a small time difference between each contact. If, at this time, the amount of friction resistance between the tire and the roller conveyor or loading stand is large enough that the tire is unable to move, the tire bead portion is pushed by the gripping claw which makes contact first and is slightly deformed in portions. As a result, the tire ends up being gripped by the gripping claws in a state in which the central axis of the tire is not aligned with the center of the chuck apparatus. Furthermore, because the above described gripping claws only hold the tire as it is and cannot rotate the tire, when performing an inspection over the entire periphery of the tire, it is necessary to rotate the inspection apparatus or the like around the periphery of the tire which results in the problem that the apparatus as a whole is large and expensive. The aim of the present invention is to provide a tire chuck apparatus and method in which the size of the apparatus can be reduced and the cost thereof decreased and at the same time gripping of a tire by gripping mechanism at a misaligned position can be reduced. In order to achieve the above objectives, the first aspect of the present invention is a tire chuck apparatus for holding a tire having a tire bead, the apparatus including a gripping mechanism with at least two gripping members movable in tire radial direction from a retracted position to an extended position for pressing against the inner side of the bead portion of the tire and thereby holding the tire, gripping rollers as the gripping members adapted to be rotatable around an axis substantially parallel to a central axis of the tire, and a rotation drive mechanism for rotating the tire around the central axis of the tire. In the above aspect, when gripping a tire, firstly, each gripping roller (gripping member) which has been moved to the inner side in the radial direction of the tire is inserted along the central axis of the tire into the inner side of the tire bead portion. From this state, each gripping roller is then expanded to the outer side in the radial direction of the tire. If the central axis of the tire is not aligned with the central axis of the chuck apparatus (the center of a single circle passing through all of the gripping rollers) at this point, the gripping rollers make contact one after another with the inner periphery of the tire bead portion with a short time difference between the contact by each roller. If the tire is unable to move at this time, the tire bead portion begins to undergo slight partial deformation as it is pushed by the gripping claw which makes the first contact. In the present invention, however, by rotating the tire around its central axis using the rotation drive means, the tire is shifted to a position in which all of the gripping rollers make contact with the inner periphery of the tire bead portion. At this point, because the gripping rollers contacting the tire bead portion rotate around an axis parallel to the central axis of the tire, the gripping rollers do not hinder the rotation of the tire. As a result, a movement of the tire such as that described above can take place easily and smoothly. Because of this, the above described deformation is prevented and the result of this is that mispositioning between the central axis of the tire and the center of the chuck apparatus is reduced. In short, the tire is gripped from the inside by the gripping rollers in a state in which the central axis of the tire has been accurately positioned relative to (coincided with) the center of the chuck apparatus. Furthermore, after the tire has been gripped by the gripping rollers, if the tire is rotated around the central axis thereof by the rotation drive mechanism, it is possible to perform an inspection or the like over the entire periphery of the tire even if the inspection apparatus is stationary. As a result, there is no need to rotate the inspection apparatus or the like around the periphery of the tire enabling the size of the apparatus overall to be reduced and the production costs to be decreased. The inspection apparatus mentioned above may be a tire information reading mechanism, a surface condition reading mechanism, an internal condition reading mechanism, and the like. In the second aspect of the present invention, a tire is rotated by at least one gripping roller being rotated by the rotation drive mechanism. The structure of the second aspect enables the gripping rollers to also be used for the rotation of the tire which allows the structure to be simplified. Moreover, because the rotation force in the peripheral direction is applied from the gripping rollers to the bead portion which is the portion of a tire with the highest rigidity, the rotation of the tire can be accurately controlled. In the third aspect of the present invention, a tire is rotated by all gripping rollers being rotated by the rotation drive mechanism. The structure of the third aspect enables rotation force to be continuously applied to the tire from the time the first gripping roller makes contact with the tire bead portion. The result of this is that the alignment of the central axis of the tire with the center of the chuck apparatus is smoothly carried out. In the fourth aspect of the present invention, the drive source of the rotation drive mechanism is placed in a central space (position) surrounded by gripping rollers. The structure of the fourth aspect allows effective use to be made of empty space. In the fifth aspect of the present invention, the tire information reading mechanism, the surface condition reading mechanism, the internal condition reading mechanism, or the like is attached to a member which moves in the central axial direction of the tire integrally with the gripping roller. | Mid | [
0.56188605108055,
35.75,
27.875
]
|
The governments of Italy, France, and Germany Thursday flatly rejected U.S. President Donald Trump’s offer to renegotiate the Paris climate accord. “We deem the momentum generated in Paris in December 2015 irreversible and we firmly believe that the Paris Agreement cannot be renegotiated, since it is a vital instrument for our planet, societies and economies,” the leaders of the three countries said in a joint statement. Earlier Wednesday, Trump had announced that the U.S. would withdraw from the Paris agreement and immediately begin negotiations to re-enter on terms that are “fair to the United States.” The statement by French President Emmanuel Macron, Italian Prime Minister Paolo Gentiloni, and German Chancellor Angela Merkel indicates that Europe would rather keep the U.S. out of the Paris climate agreement than permit the U.S. to re-enter on more favorable terms. That likely means that the U.S. will remain out of the agreement for the foreseeable future. | Mid | [
0.551422319474835,
31.5,
25.625
]
|
Does the public understand the differences between ophthalmologists and optometrists? Telephone interviews utilizing random digit dialing were conducted in Los Angeles County to assess the public's knowledge of differences between ophthalmologists and optometrists and to determine factors predictive of knowledge status. Knowledge status was determined by performance on a questionnaire specifically designed for this study. Using multiple logistic regression analysis for simultaneous evaluation of potentially predictive factors, higher education, history of prior eye examination as an adult, and history of prior or present contact lens or spectacle wear were associated with scoring as knowledgeable. Predicted probabilities of being knowledgeable and not knowledgeable were presented for all combinations of these predictive variables. Such information may be helpful in guiding public education campaigns regarding eye care. | High | [
0.6834733893557421,
30.5,
14.125
]
|
Q: Некорректная пагинация в Opencart В пагинации на страницах отображаются дубли страниц....( 1 1 2 3). Помогите пожалуйста. pagination.php <?php class Pagination { public $total = 0; public $page = 1; public $limit = 9999; public $num_links = 3; public $url = ''; public $text_first = '1'; public $text_last = '>|'; public $text_next = '>'; public $text_prev = '<'; public function render() { /* echo '<pre>'; var_dump(isset($_GET['route'])); echo '</pre>'; die();*/ if(isset($_GET['route'])){ $takeArea = explode('/',$_GET['route']); switch ($takeArea[0]) { case 'catalog': case 'common': if ($this->page < 1) { $page = 1; } else { $page = $this->page; } if (!(int)$this->limit) { $limit = 10; } else { $limit = $this->limit; } $num_links = $this->num_links; $num_pages = ceil($total / $limit); $this->url = str_replace('%7Bpage%7D', '{page}', $this->url); $output = '<ul class="pagination">'; if ($page > 1) { $tmp_url = str_replace('&', '&', $this->url); $output .= '<li><a href="' . str_replace('&', '&', rtrim( str_replace('page={page}', '', $tmp_url), '?&')) . '">' . $this->text_first . '</a></li>'; if ($page == 2){ $output .= '<li><a href="' . str_replace('&', '&', rtrim( str_replace('page={page}', '', $tmp_url), '?&')) . '">' . $this->text_prev . '</a></li>'; }else{ $output .= '<li><a href="' . str_replace('{page}', $page - 1, $this->url) . '">' . $this->text_prev . '</a></li>'; } } if ($num_pages > 1) { if ($num_pages <= $num_links) { $start = 1; $end = $num_pages; } else { $start = $page - floor($num_links / 2); $end = $page + floor($num_links / 2); if ($start < 1) { $end += abs($start) + 1; $start = 1; } if ($end > $num_pages) { $start -= ($end - $num_pages); $end = $num_pages; } } for ($i = $start; $i <= $end; $i++) { if ($page == $i) { $output .= '<li class="active"><span>' . $i . '</span></li>'; } else { if ($i == 1){ $output .= '<li><a href="' . str_replace('&', '&', rtrim( str_replace('page={page}', '', $tmp_url), '?&')) . '">' . $i . '</a></li>'; }else{ $output .= '<li><a href="' . str_replace('{page}', $i, $this->url) . '">' . $i . '</a></li>'; } } } } if ($page < $num_pages) { $output .= '<li><a href="' . str_replace('{page}', $page + 1, $this->url) . '">' . $this->text_next . '</a></li>'; $output .= '<li><a href="' . str_replace('{page}', $num_pages, $this->url) . '">' . $this->text_last . '</a></li>'; } $output .= '</ul>'; if ($num_pages > 1) { return $output; } else { return ''; } break; default: $total = $this->total; if ($this->page < 1) { $page = 1; } else { $page = $this->page; } if (!(int)$this->limit) { $limit = 10; } else { $limit = $this->limit; } $num_links = $this->num_links; $num_pages = ceil($total / $limit); $this->url = str_replace('%7Bpage%7D', '{page}', $this->url); $output = '<div class="pagination_wrap f_right">'; if ($page > 1 && $page >= 3 && $num_pages > 3) { $output .= '<a href="' . str_replace('{page}', 1, $this->url) . '">' . $this->text_first . '</a>'; if($page >= 3){ $output .= '<span href="#" class="more">...</span>'; } } if ($num_pages > 1) { if ($num_pages <= $num_links) { $start = 1; $end = $num_pages; } else { $start = $page - floor($num_links / 2); $end = $page + floor($num_links / 2); if ($start < 1) { $end += abs($start) + 1; $start = 1; } if ($end > $num_pages) { $start -= ($end - $num_pages); $end = $num_pages; } } for ($i = $start; $i <= $end; $i++) { if ($page == $i) { $output .= '<a href="' . str_replace('{page}', $i, $this->url) . '" class="active">' . $i . '</a>'; $output .= '<a href="' . str_replace('{page}', $i + 1, $this->url) . '" class="smore-product" style="display:none;"></a>'; } else { $output .= '<a href="' . str_replace('{page}', $i, $this->url) . '">' . $i . '</a>'; } } } if ($page > 3 && $page < $num_pages && ($page < $num_pages-1 || $page < $num_pages-2) || $page < $num_pages-2) { $output .= '<span href="#" class="more">...</span>'; if($num_pages > $num_pages-3){ $output .= '<a href="' . str_replace('{page}', $num_pages, $this->url) . '">' . $num_pages . '</a>'; } } $output .= '</div>'; if ($num_pages > 1) { return $output; } else { return ''; } break; } }else{ $total = $this->total; if ($this->page < 1) { $page = 1; } else { $page = $this->page; } if (!(int)$this->limit) { $limit = 10; } else { $limit = $this->limit; } $num_links = $this->num_links; $num_pages = ceil($total / $limit); $this->url = str_replace('%7Bpage%7D', '{page}', $this->url); $output = '<div class="pagination_wrap f_right">'; if ($page > 1 && ($page != 2 && $page != 3) || $page == 3) { $output .= '<a href="' . str_replace('{page}', 1, $this->url) . '">' . $this->text_first . '</a>'; if($page > 3){ $output .= '<span href="#" class="more">...</span>'; } } if ($num_pages > 1) { if ($num_pages <= $num_links) { $start = 1; $end = $num_pages; } else { $start = $page - floor($num_links / 2); $end = $page + floor($num_links / 2); if ($start < 1) { $end += abs($start) + 1; $start = 1; } if ($end > $num_pages) { $start -= ($end - $num_pages); $end = $num_pages; } } for ($i = $start; $i <= $end; $i++) { if ($page == $i) { $output .= '<a href="' . str_replace('{page}', $i, $this->url) . '" class="active">' . $i . '</a>'; $output .= '<a href="' . str_replace('{page}', $i + 1, $this->url) . '" class="smore-product" style="display:none;"></a>'; } else { $output .= '<a href="' . str_replace('{page}', $i, $this->url) . '">' . $i . '</a>'; } } } if ($page > 3 && $page < $num_pages && ($page < $num_pages-1 || $page < $num_pages-2) || $page < $num_pages-2) { $output .= '<span href="#" class="more">...</span>'; if($num_pages > $num_pages-3){ $output .= '<a href="' . str_replace('{page}', $num_pages, $this->url) . '">' . $num_pages . '</a>'; } } $output .= '</div>'; if ($num_pages > 1) { return $output; } else { return ''; } } } } category.tpl <?php echo $header; ?> <main> <section class=""> <div class="container"> <div class="row"> <div class="col-md-12 col-lg-12"> <div class="breadcrumbs"> <?php $count_bread = count($breadcrumbs); $count = 1; foreach ($breadcrumbs as $breadcrumb) { ?> <?php if ($count != $count_bread) { $count++; ?> <a href="<?php echo $breadcrumb['href']; ?>"><?php echo $breadcrumb['text']; ?></a> / <?php } else { ?> <span><?php echo $breadcrumb['text']; ?></span> <?php } ?> <?php } ?> <?php if (isset($breadcrumbs[1]['catIdParent'])) { $parentCat = $breadcrumbs[1]['catIdParent']; $childCat = $breadcrumbs[1]['catIdChild']; } else { $parentCat = ''; $childCat = ''; } ?> <input type="hidden" id="parentCat" value="<?php echo $parentCat; ?>"> <input type="hidden" id="childCat" value="<?php echo $childCat; ?>"> </div> </div> </div> <?php if (!empty($categories)){ ?> <div class="row"> <div class="col-md-12 col-lg-12"> <div class="category_page"> <h3><?php echo $heading_title; ?></h3> <?php if ($categories) { ?> <div class="wrap_subcategories"> <div class="col_links"> <?php $colonProd = ceil(count($categories) / 3); ?> <?php $count = 0; foreach ($categories as $category) { ?> <?php if (($count % $colonProd) == 0 && $count != 0){ ?> </div> <div class="col_links"> <?php } ?> <a href="<?php echo $category['href']; ?>"><?php echo $category['name']; ?></a> <?php $count++; } ?> </div> <div class="clear"></div> </div> <?php } ?> </div> </div> </div> </div> </section> <?php } ?> <?php if (empty($categories)) { ?> </div> <div class="container subcategory"> <div class="row"> <div class="col-sm-12 col-md-3 col-lg-3"> <div class="filter_button"> <div>Показать фильтр</div> <span><i class="fa fa-chevron-down"></i> </span> <div class="clear"></div> </div> <aside class="left_col"> <?= $column_left; ?> <div class="left_section"> <div class="section_title">Торговая марка</div> <ul class="manufacturer_filter"> <?php if (!empty($data_manuf)) { ?> <?php foreach ($data_manuf as $key => $value) { ?> <li data-href='<?= $url; ?>'> <label <?= (!empty($count_manufacturer) && array_key_exists($value['manufacturer_id'], $count_manufacturer)) ? '' : 'class="disabled"'; ?>> <input <?= (!empty($count_manufacturer) && array_key_exists($value['manufacturer_id'], $count_manufacturer)) ? '' : 'disabled="disabled"'; ?> value="<?= $value['manufacturer_id']; ?>" type="checkbox" <?= (array_key_exists($value['manufacturer_id'], $count_manufacturer) && $value['checked']) ? $value['checked'] : ''; ?>> <span></span><?= $value['name']; ?> (<?= (!empty($count_manufacturer) && array_key_exists($value['manufacturer_id'], $count_manufacturer)) ? $count_manufacturer[$value['manufacturer_id']]['count'] : 0; ?>)</label> </li> <?php } } ?> </ul> </div> <div class="left_section"> <div class="section_title">Цена</div> <div class="range_wrap"> <div id="price-range-details" class="price-filter"> <input type="text" id="price-range-low" value="" class="separator"> <span class="range_text">-</span> <input type="text" id="price-range-high" value=""> <span class="range_text" style="margin-right:0;">грн.</span> <div class="clear"></div> </div> <div id="price-range" class="price-filter"> </div> <div class="price-filter"> <input type="hidden" id="needShow" value="<?= $products[0]['price'] ?>"> <script> $(document).ready(function () { var minprice = $('#needShow').val(); var isShown = minprice.split(' '); var yesShow = isShown[0] * 1; if (yesShow > 0) { $('#price-range').noUiSlider({ range: [<?= floor($start_price[0]['minprice']) != ceil($start_price[0]['maxprice']) ? floor($start_price[0]['minprice']) : 0; ?>, <?=ceil($start_price[0]['maxprice']) ?>], start: [<?=(isset($min_price_sart)) ? floor($min_price_sart) : floor($start_price[0]['minprice']);?>, <?=(isset($max_price_sart)) ? ceil($max_price_sart) : ceil($min_max_price[0]['maxprice']) ?>], handles: 2, connect: true, step: 1, serialization: { to: [$('#price-range-low'), $('#price-range-high')], resolution: 1 } }); } }); </script> </div> </div> </div> </aside> </div> <?php /*echo "<pre>"; print_r($products); <!-- print_r($sorts); --> echo "</pre>";*/ ?> <?php if ($products) { ?> <div class="col-sm-12 col-md-9 col-lg-9"> <h2 class="title_page"><?php echo $heading_title; ?></h2> <div class="filter_select"> <div class="span_sort f_left">Отсортировано:</div> <select> <?php foreach ($sorts as $sorts) { ?> <?php if ($sorts['value'] == $sort . '-' . $order) { ?> <option value="<?php echo $sorts['href']; ?>" selected="selected"><?php echo $sorts['text']; ?></option> <?php } else { ?> <option value="<?php echo $sorts['href']; ?>"><?php echo $sorts['text']; ?></option> <?php } ?> <?php } ?> </select> <div class="clear"></div> <span id="filterReturnZero" style="display: none;"><span class="no-item">Товаров с указанными характеристиками нет, повторите, пожалуйста, запрос с другими параметрами.</span></span> </div> <div class="row subcategory_list"> <?php foreach ($products as $product) { ?> <?php /*echo '<pre>'; print_r($product); echo '</pre>'; die();*/ ?> <?php $akciya = ''; if (!isset($akciya)) { $class = 'sale'; } elseif ($product['popular_product'] == 1) { $class = 'hit'; } elseif ($product['product_innovation'] == 1) { $class = 'new'; } else { $class = ''; } if ($product['drawing_product'] == 1) { $class .= ' draw'; } ?> <div class="col-sm-6 col-md-4 col-lg-4 items_prod"> <div class="item <?= $class; ?>"> <?php if (in_array($product['product_id'], $wishlist)) { $class_active = 'active'; $wish = 'onclick="wishlist.remove(' . $product['product_id'] . ', this);" ontouchend="wishlist.add(' . $product['product_id'] . ', this);"'; } else { $class_active = ''; $wish = 'onclick="wishlist.add(' . $product['product_id'] . ', this);" ontouchend="wishlist.add(' . $product['product_id'] . ', this);"'; } ?> <a class="liked <?= $class_active; ?>" <?= $wish; ?>><i class="fa fa-heart"></i></a> <a href="<?php echo $product['href']; ?>"> <img src="<?php echo $product['thumb']; ?>" alt="<?php echo $product['name']; ?>" title="<?php echo $product['name']; ?>"> <div class="description_prod"> <div class="name"><?php echo $product['name']; ?></div> <?php if (!$product['special']) { ?> <div class="price"><?php echo $product['price']; ?> <span>/ 1 <?= $product['weight_goods'] == 0 ? 'шт' : 'кг'; ?></span> </div> <?php } else { ?> <div class="price"><?php echo $product['special']; ?> <span class="price-old"> <?php echo $product['price']; ?></span> <span>/ 1 <?= $product['weight_goods'] == 0 ? 'шт' : 'кг'; ?></span> </div> <?php } ?> <div class="opt_price"> <span><?= $product['disc_price']?></span> <span>/ от <?= $product['disc_quantity']?>-х единиц</span> </div> </div> </a> <div class="qtywrapper"> <a class="decrease-qty"> <img src="/catalog/view/theme/default/img/minus.png"> </a> <?php $numberProduct = $weight_goods == 0 ? '1' : $minimum; //echo $numberProduct;?> <input type="text" class="qty" value="<?= $product['weight_goods'] == 0 ? '1' : $product['minimum']; ?>" data-step="<?= $product['weight_goods'] == 0 ? '1' : $product['minimum']; ?>" step="<?= $product['weight_goods'] == 0 ? '1' : $product['minimum']; ?>" /> <a class="increase-qty"> <img src="/catalog/view/theme/default/img/plus.png"> </a> <span><?= $product['weight_goods'] == 0 ? 'шт' : 'кг'; ?></span> <div class="clear"></div> </div> <div class="bottom_item"> <a data-id="<?php echo $product['product_id']; ?>" class="global-add-to-cart"><i class="fa fa-cart-arrow-down"></i><span> В корзину</span></a> <div class="clear"></div> </div> </div> </div> <?php } ?> </div> <div class="control_block"> <div class="more_row"> <div class="pagination_text more">Показано <span></span> товаров из <?php echo $countproducts; ?></div> <div class="pagin_block"> <?php if ($pagination != '') { ?> <div class="pagin"> <?php if ($load_more == true) { ?> <div class="more"><a class="load_more f_left" onclick="getNextPage(this);" ontouchend="getNextPage(this);"><span>Показать еще <?php echo $more; ?> товаров</span></a> </div> <?php echo $pagination; ?> <?php } elseif ($pagination) { ?> <?php echo $pagination; ?> <?php } ?> </div> <?php } ?> </div> </div> <div class="clear"></div> </div> </div> <?php } else { ?> <div class="col-sm-12 col-md-9 col-lg-9"> <h2 class="title_page"><?php echo $heading_title; ?></h2> <div class="no-item">В этой категории ещё нет товаров</div> </div> <?php } ?> </div> </div> </section> <?php } ?> <?php echo $footer; ?> A: Вопрос уже решён. Банально перебором вариантов количества отображаемых страниц. <?php class Pagination { public $total = 0; public $page = 1; public $limit = 9999; public $num_links = 3; public $url = ''; public $text_first = '1'; public $text_last = '>|'; public $text_next = '>'; public $text_prev = '<'; public function render() { if(isset($_GET['route'])){ $takeArea = explode('/',$_GET['route']); switch ($takeArea[0]) { case 'catalog': case 'common': $total = $this->total; if ($this->page < 1) { $page = 1; } else { $page = $this->page; } if (!(int)$this->limit) { $limit = 10; } else { $limit = $this->limit; } $num_links = $this->num_links; $num_pages = ceil($total / $limit); $this->url = str_replace('%7Bpage%7D', '{page}', $this->url); $output = '<ul class="pagination">'; if ($page > 1) { $tmp_url = str_replace('&', '&', $this->url); $output .= '<li><a href="' . str_replace('&', '&', rtrim( str_replace('page={page}', '', $tmp_url), '?&')) . '">' . $this->text_first . '</a></li>'; if ($page == 2){ $output .= '<li><a href="' . str_replace('&', '&', rtrim( str_replace('page={page}', '', $tmp_url), '?&')) . '">' . $this->text_prev . '</a></li>'; }else{ $output .= '<li><a href="' . str_replace('{page}', $page - 1, $this->url) . '">' . $this->text_prev . '</a></li>'; } } if ($num_pages > 1) { if ($num_pages <= $num_links) { $start = 1; $end = $num_pages; } else { $start = $page - floor($num_links / 2); $end = $page + floor($num_links / 2); if ($start < 1) { $end += abs($start) + 1; $start = 1; } if ($end > $num_pages) { $start -= ($end - $num_pages); $end = $num_pages; } } for ($i = $start; $i <= $end; $i++) { if ($page == $i) { $output .= '<li class="active"><span>' . $i . '</span></li>'; } else { if ($i == 1){ $output .= '<li><a href="' . str_replace('&', '&', rtrim( str_replace('page={page}', '', $tmp_url), '?&')) . '">' . $i . '</a></li>'; }else{ $output .= '<li><a href="' . str_replace('{page}', $i, $this->url) . '">' . $i . '</a></li>'; } } } } if ($page < $num_pages) { $output .= '<li><a href="' . str_replace('{page}', $page + 1, $this->url) . '">' . $this->text_next . '</a></li>'; $output .= '<li><a href="' . str_replace('{page}', $num_pages, $this->url) . '">' . $this->text_last . '</a></li>'; } $output .= '</ul>'; if ($num_pages > 1) { return $output; } else { return ''; } break; default: $total = $this->total; if ($this->page < 1) { $page = 1; } else { $page = $this->page; } if (!(int)$this->limit) { $limit = 10; } else { $limit = $this->limit; } $num_links = $this->num_links; $num_pages = ceil($total / $limit); $this->url = str_replace('%7Bpage%7D', '{page}', $this->url); $output = '<div class="pagination_wrap f_right">'; if ($page > 1 && $page >= 3 && $num_pages > 3) { $output .= '<a href="' . str_replace('{page}', 1, $this->url) . '">' . $this->text_first . '</a>'; if($page >= 3){ $output .= '<span href="#" class="more">...</span>'; } } if ($num_pages > 1) { if ($num_pages <= $num_links) { $start = 1; $end = $num_pages; } else { $start = $page - floor($num_links / 2); $end = $page + floor($num_links / 2); if ($start < 1) { $end += abs($start) + 1; $start = 1; } if ($end > $num_pages) { $start -= ($end - $num_pages); $end = $num_pages; } } for ($i = $start; $i <= $end; $i++) { if ($page == $i) { $output .= '<a href="' . str_replace('{page}', $i, $this->url) . '" class="active">' . $i . '</a>'; // $output .= '<a href="' . str_replace('{page}', $i + 1, $this->url) . '" class="smore-product" style="display:none;"></a>'; } else { $output .= '<a href="' . str_replace('{page}', $i, $this->url) . '">' . $i . '</a>'; } } } if ($page > 3 && $page < $num_pages && ($page < $num_pages-1 || $page < $num_pages-2) || $page < $num_pages-2) { $output .= '<span href="#" class="more">...</span>'; if($num_pages > $num_pages-3){ $output .= '<a href="' . str_replace('{page}', $num_pages, $this->url) . '">' . $num_pages . '</a>'; } } $output .= '</div>'; if ($num_pages > 1) { return $output; } else { return ''; } break; } }else{ $total = $this->total; if ($this->page < 1) { $page = 1; } else { $page = $this->page; } if (!(int)$this->limit) { $limit = 10; } else { $limit = $this->limit; } $num_links = $this->num_links; $num_pages = ceil($total / $limit); $this->url = str_replace('%7Bpage%7D', '{page}', $this->url); //-----------------------------------New // $page;//текущий пейдж // $num_pages;//всего пейджей // $num_links;//количество кубиков которое показывать $output = '<div class="pagination_wrap f_right">'; if($num_links != 5) $num_links = 5; if($page > $num_pages) $page = $num_pages; if($num_pages <= $num_links){ for ($i = 1; $i <= $num_pages; $i++){ if ($page == $i) { $output .= '<a href="' . str_replace('{page}', $i, $this->url) . '" class="active">' . $i . '</a>'; $output .= '<a href="' . str_replace('{page}', $i + 1, $this->url) . '" class="smore-product" style="display:none;"></a>'; } else { $output .= '<a href="' . str_replace('{page}', $i, $this->url) . '">' . $i . '</a>'; } } }else{ if($page <= 3){ for ($i = 1; $i <= 4; $i++) { if ($page == $i) { $output .= '<a href="' . str_replace('{page}', $i, $this->url) . '" class="active">' . $i . '</a>'; $output .= '<a href="' . str_replace('{page}', $i + 1, $this->url) . '" class="smore-product" style="display:none;"></a>'; } else { $output .= '<a href="' . str_replace('{page}', $i, $this->url) . '">' . $i . '</a>'; } } $output .= '<span href="#" class="more">...</span>'; $output .= '<a href="' . str_replace('{page}', $num_pages, $this->url) . '">' . $num_pages . '</a>'; }elseif($page >= ($num_pages - 2)){ $output .= '<a href="' . str_replace('{page}', 1, $this->url) . '">' . 1 . '</a>'; $output .= '<span href="#" class="more">...</span>'; for ($i = ($num_pages - 3); $i <= $num_pages; $i++) { if ($page == $i) { $output .= '<a href="' . str_replace('{page}', $i, $this->url) . '" class="active">' . $i . '</a>'; $output .= '<a href="' . str_replace('{page}', $i + 1, $this->url) . '" class="smore-product" style="display:none;"></a>'; } else { $output .= '<a href="' . str_replace('{page}', $i, $this->url) . '">' . $i . '</a>'; } } }else{// page > 3 но page < num_pages-2 $output .= '<a href="' . str_replace('{page}', 1, $this->url) . '">' . 1 . '</a>'; $output .= '<span href="#" class="more">...</span>'; for ($i = ($page - ( ($num_links-3)/2 )); $i <= ($page + ( ($num_links-3)/2 )); $i++) {//требует доработки если num_links нужен больше 5ти ВАЖНО!!! чтоб нум линкс был не четный 7,9,11... тогда все будет хорошо! иначе получим страницу 5 с половиной!!! if ($page == $i) { $output .= '<a href="' . str_replace('{page}', $i, $this->url) . '" class="active">' . $i . '</a>'; $output .= '<a href="' . str_replace('{page}', $i + 1, $this->url) . '" class="smore-product" style="display:none;"></a>'; } else { $output .= '<a href="' . str_replace('{page}', $i, $this->url) . '">' . $i . '</a>'; } } $output .= '<span href="#" class="more">...</span>'; $output .= '<a href="' . str_replace('{page}', $num_pages, $this->url) . '">' . $num_pages . '</a>'; } } $output .= '</div>'; if ($num_pages > 1) {//пагинация показывается только если пейджей 2 и больше return $output; }else{ return ''; } //-----------------------------------end New if ($page > 3) { // 1... $output .= '<a href="' . str_replace('{page}', 1, $this->url) . '">' . $this->text_first . '</a>'; if($page > 3){ $output .= '<span href="#" class="more">...</span>'; } } if ($num_pages > 1) { if ($num_pages <= $num_links) { $start = 1; $end = $num_pages; } else { $start = $page - floor($num_links / 2); $end = $page + floor($num_links / 2); if ($start < 1) { $end += abs($start) + 1; $start = 1; } if ($end > $num_pages) { $start -= ($end - $num_pages); $end = $num_pages; } } for ($i = $start; $i <= $end; $i++) { if ($page == $i) { $output .= '<a href="' . str_replace('{page}', $i, $this->url) . '" class="active">' . $i . '</a>'; $output .= '<a href="' . str_replace('{page}', $i + 1, $this->url) . '" class="smore-product" style="display:none;"></a>'; } else { $output .= '<a href="' . str_replace('{page}', $i, $this->url) . '">' . $i . '</a>'; } } } if ($page > 3 && $page < $num_pages && ($page < $num_pages-1 || $page < $num_pages-2) || $page < $num_pages-2) { $output .= '<span href="#" class="more">...</span>'; if($num_pages > $num_pages-3){ $output .= '<a href="' . str_replace('{page}', $num_pages, $this->url) . '">' . $num_pages . '</a>'; } } if ($page == 3 && $page < $num_pages) { $outfist = '<a href="' . str_replace('{page}', 1, $this->url) . '">' . $this->text_first . '</a>'; $output = str_replace('<div class="pagination_wrap f_right">', '<div class="pagination_wrap f_right">'.$outfist, $output); } $output .= '</div>'; if ($num_pages > 1) { return $output; } else { return ''; } } } } ?> | Low | [
0.5039577836411611,
23.875,
23.5
]
|
As a rock climber growing up in Florida, the options for climbing on true outdoor faces are limited. Aside from the training we do in the gym, our closest options are the bouldering grounds in Georgia, Alabama, and the Carolinas. So when somebody told me that just two hours north of Miami, in the town of Jupiter, was some great outdoor bouldering, I was initially skeptical. When people think of the beaches here, they think of the South Beach life: endless miles of flat, white sandy shores, with the emphasis on “flat”. What I ended up discovering was some of the most extraordinarily unique beachside bouldering unlike anywhere else. Blowing Rocks State Preserve in Jupiter, Florida. Setting off from Miami, our group from the X-Treme rock climbing gym drove two hours north to the sleepy little town of Jupiter. Crossing over a small inlet, we made our way onto a desolate road and parked at the entrance to Blowing Rocks State Preserve. Entrance to the park is based on an honor system, and one or two dollars goes towards its preservation and upkeep. Collecting our cooler, gear, and crash pads, we followed a shady trail that opened up at the edge of the vast golden shoreline. Blowing Rocks takes it’s name from the miles of rocky cliffs that line the shore. At high tide, the water rushes through its channels and caves, gushing out the top as if the rocks are “blowing” out the water. We were fortunate to find a particularly low tide day, and the caves were all safe to climb in without worrying about waves or water. After getting ourselves settled on the beach, we immediately began our first climbs. Since the rocks over a variety of heights and overhangs, there are no specific routes and any climb and traverse is left up to the imagination. The climbs I found most interesting however, were the deep hollowed out caves with a skylight-like opening at the top where we would traverse our way around the cave and then top out by climbing out of the hole in the ceiling. I started my first climb on the outside faces. It was a relatively simple jaunt up the side with a large bulge protruding out of the limestone wall. I felt my feet securely in place as my body contoured the rounded stone. I placed my right hand inside a deep pocket and let my left hand dangle, ready to lean forward and reach the small spire just over the lip. Suddenly I felt my foot slip out of its hold and I slid down the side leaving a nice scratch down my side. Washing myself off and putting off the little soreness, I jumped right back up and headed for my next climb. By now our group had moved into the caves. The more experienced and able climbers set mazy routes that traversed the entire route of the cave, expertly guiding their hands along the roof and slowly hooking their shoes into the cracks before pulling themselves through the skylight. I was more interested in the tunnel itself. As a midday sun filtered through the cave, flooding the ground with an intense beam of light, I gripped two deep pockets and brought my feet above my body, hooking them into the cracks under the tunnel. Letting my body dangle for a moment, I pushed forward, gripping the inside and going vertical. Inside the tunnel, I had to place my feet into awkward positions putting one foot in front of me and one bent behind, getting my shoes firmly set and then reaching and pulling myself up. As my head emerged on the upper tier of the cliff, I reached out onto the shore and pulled myself out of the cave. It was by far one of the most interesting climbs of the day. After a short break, we moved onto the smaller enclaves that dotted the shoreline. This cave, closer to the waves, was constantly dripping, but it had two openings in the roof, and a route that started in the very back. We meandered our way through the cracks, slippery and soaked with seawater, while being farther spaced apart. Although I myself wasn’t able to complete the route, I learned a valuable skill in slowing down my movements and securely grabbing each hold. As the tide rose up in the late afternoon and made the caves harder to climb, we hiked back up to the beach for a little Cinco de Mayo party with homemade beer and music while our soaking gear dried out on the limestone cliffs. Blowing rocks is a unique climbing experience giving Florida climbers an opportunity to practice their trade on a one of a kind seaside landscape. As well as being an extraordinary state preserve, it makes for a great weekend getaway. | Mid | [
0.62004662004662,
33.25,
20.375
]
|
Thursday, 9 January 2014 Wythenshawe and Sale East: Ward Breakdown This page gives an estimate of the votes cast in each ward of Wythenshawe and Sale East at the general election of 2010. The official ward breakdowns are not officially tabulated or published, so these numbers are only approximate. The basic idea of the calculation is to look at the district council wards which make up the new seat, and estimate how they voted in 2010, and also to predict how they will vote at the next election. These estimates are based on the recent local election results in those wards, with adjustments made to allow for different turnouts and different voting patterns for local and general elections. Usuallly each ward lies entirely within a single constituency, but some large wards are split between several constituencies (particularly in Scotland and Northern Ireland). Such wards are shown divided into several parts, called [1], [2], and so on. Election results from a recent local election are given. This is usually the local election closest to 2010 from the period 2007-2011. For multiple-member wards, the votes shown are the sum of the votes cast for all candidates of each party. A negative number indicates candidate(s) elected unopposed. Seat: Wythenshawe and Sale East Workings for Wythenshawe and Sale East The raw vote table shows the district council election results for all the wards in the seat of Wythenshawe and Sale East. The first block shows the actual results, the second block shows the turnout-adjusted results. Details of the transfer calculation are given below this table. Seat: Wythenshawe and Sale East Actual Results Turnout-adjusted Results District Ward ElectionYear Electorate2010 CONVotes LABVotes LIBVotes OTHVotes CONVotes LABVotes LIBVotes OTHVotes TotalVotes Manchester Baguley 2010 10,608 777 0 1,178 2,854 924 0 1,401 3,393 5,718 Manchester Brooklands 2010 10,300 1,534 2,633 1,061 465 1,496 2,568 1,035 453 5,552 Manchester Northenden 2010 10,733 546 2,478 2,503 399 533 2,419 2,444 390 5,786 Manchester Sharston 2010 11,209 933 0 930 3,260 1,100 0 1,097 3,845 6,042 Manchester Woodhouse Park 2010 9,594 608 2,428 626 528 750 2,997 773 652 5,172 Trafford Brooklands 2010 7,908 2,648 1,444 1,389 179 1,994 1,087 1,046 135 4,262 Trafford Priory 2010 7,762 1,618 2,087 1,345 263 1,274 1,643 1,059 207 4,183 Trafford Sale Moor 2010 7,488 1,668 2,032 1,068 198 1,356 1,652 868 161 4,037 Total 75,602 9,427 12,366 9,723 9,236 40,752 The transfer table below shows the votes cast in the seat of Wythenshawe and Sale East at the general election, as well as the total local turnout-adjusted votes. The number of votes to transfer, shown in the fourth and fifth columns, are the difference between the general and local votes. Strong parties will have votes transferred away, and weak parties will have votes transferred into them. The final column describes how votes will be transferred away from or into that party on a ward-by-ward basis. If a party is too strong, it will lose a percentage of its votes in each ward which go into that ward's transfer pool. If a party is too weak, it will gain votes from each ward's transfer pool in proportion to the number of transfer votes it needs over the whole seat. Party GeneralElection 2010Votes Local ElectionTurnout-adjustedVotes Votes totransferaway Votes totransferinto Ward Transfers needed CON 10,412 9,427 0 985 Transfer in 14.9% (= 985 / 6606) of ward's transfer pool votes LAB 17,987 12,366 0 5,621 Transfer in 85.1% (= 5621 / 6606) of ward's transfer pool votes LIB 9,107 9,723 616 0 Transfer away 6.3% (= 616 / 9723) of ward's LIB votes OTH 3,245 9,236 5,991 0 Transfer away 64.9% (= 5991 / 9236) of ward's OTH votes Total 40,751 40,752 6,606 6,606 Main table for Wythenshawe and Sale East The main table shows the general election transfer-adjusted results for each ward in the seat of Wythenshawe and Sale East, as well as the predicted election result. Seat: Wythenshawe and Sale East Est. 2010 General Election Results Predicted Results District Ward Electorate2010 CONVotes LABVotes LIBVotes OTHVotes TotalVotes CONVotes LABVotes LIBVotes OTHVotes TotalVotes Manchester Baguley 10,608 1,265 1,948 1,312 1,192 5,717 960 2,577 368 1,813 5,718 Manchester Brooklands 10,300 1,550 2,874 969 159 5,552 1,176 3,413 272 691 5,552 Manchester Northenden 10,733 594 2,766 2,289 137 5,786 451 3,667 642 1,026 5,786 Manchester Sharston 11,209 1,482 2,181 1,027 1,351 6,041 1,124 2,733 288 1,896 6,041 Manchester Woodhouse Park 9,594 820 3,399 724 229 5,172 622 3,761 203 586 5,172 Trafford Brooklands 7,908 2,017 1,218 980 47 4,262 1,530 1,818 275 639 4,262 Trafford Priory 7,762 1,304 1,814 992 73 4,183 989 2,332 278 584 4,183 Trafford Sale Moor 7,488 1,380 1,788 813 57 4,038 1,047 2,250 228 513 4,038 Total 75,602 10,412 17,988 9,106 3,245 40,752 7,899 22,551 2,554 7,748 40,752 After transfer adjustment, the totals for each party over all the wards match the general election vote in the seat. UK GENERAL ELECTION 2015 SEATS WON WAYS YOU CAN FOLLOW THIS BLOG HOW YOU CAN HELP THIS BLOG Thank you for looking at our blog, No donation is needed keep your money for yourself. BUT! If you could share a link for this blog on your own blog or sites you visit, or leave a comment on this blog or become a follower on Twitter, Facebook or Google+. That would be very gratefully appreciated. | Mid | [
0.569169960474308,
36,
27.25
]
|
Assessment of luteolin (3',4',5,7-tetrahydroxyflavone) neuropharmacological activity. Since the discovery that certain flavonoids (namely flavones) specifically recognise the central BDZ receptors, several efforts have been made to identify naturally occurring GABA(A) receptor benzodiazepine binding site ligands. Flavonoid derivatives with a flavone-like structure such as apigenin, chrysin and wogonin have been reported for their anxiolytic-like activity in different animal models of anxiety. Luteolin (3',4',5,7-tetrahydroxyflavone) is a widespread flavonoid aglycon that was reported as devoid of specific affinity for benzodiazepine receptor (BDZ-R) binding site, but its psychopharmacological activity is presently unknown. Considering (1) the close structural similarity with other active flavones, (2) the activity of some of its glycosilated derivatives and (3) the complexity of flavonoid effects in the central nervous system, luteolin was submitted to a battery of tests designed to evaluate its possible activity upon the CNS and its ability to interact with the BDZ-receptor binding sites was also analysed. Luteolin apparently has CNS activity with anxiolytic-like effects despite the low affinity for the BDZ-R shown in vitro. Our findings suggest a possible interaction with other neurotransmitter systems but we cannot rule out the possibility that luteolin's metabolites might show a higher affinity for the BDZ-R in vivo, thus eliciting the evident anxiolytic-like effects through a GABAergic mechanism. | High | [
0.6844919786096251,
32,
14.75
]
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.