Datasets:

khaled123

/

dataioieme

like 0

@@ -2928,10 +2928,17 @@ validate_identifier(const char *identifier, YYLTYPE loc, * "In addition, all identifiers containing two * consecutive underscores (__) are reserved as * possible future keywords." + * + * The intention is that names containing __ are reserved for internal + * use by the implementation, and names prefixed with GL_ are reserved + * for use by Khronos. Names simply containing __ are dangerous to use, + * but should be allowed. + * + * A future version of the GLSL specification will clarify this. */ - _mesa_glsl_error(&loc, state, - "identifier `%s' uses reserved `__' string", - identifier); + _mesa_glsl_warning(&loc, state, + "identifier `%s' uses reserved `__' string", + identifier); } }

2024-07-24T01:26:28.774034

https://example.com/article/6491

'Apples and oranges': Comparing Wall St. traders to poor drug users … Mr. one-glove would probably not approve of Takeesha. He felt everyone makes his own path in life, that raising his taxes to help the poor was encouraging a lifetime of sloth. To him, poverty was because of a lack of trying, a lack of working as hard as he had. Many successful professionals, who forget their benign youth, share that attitude.” ======= Sadder still?, These same sentiments are shared with too many good "Latter-Day Saints". They worship Babylon and the love of Money - they are prideful in the Gods they are making with their own hands.

2024-07-09T01:26:28.774034

https://example.com/article/3531

Data are available from the Open Science Framework. The DOI for the project is: [10.17605/OSF.IO/ZGHVY](http://dx.doi.org/10.17605/OSF.IO/ZGHVY), ARK: c7605/osf.io/zghvy. Introduction {#sec001} ============ Many people around the world cannot access essential medicines to treat diseases like malaria, tuberculosis (TB), and HIV/AIDS. Every year 8.8 million people are diagnosed with tuberculosis, every day more than 7,300 people are infected with AIDs, every 60 seconds malaria kills a child \[[@pone.0141374.ref001]--[@pone.0141374.ref003]\]. One reason for this is that many people cannot access the existing drugs and technologies they need. Even basic medicines, like antibiotics, may be too expensive for people in low income countries making less than the equivalent of what \$1,025 a year will buy in the US \[[@pone.0141374.ref004]\]. Another reason many people around the world lack access to essential medicines is that little of the research and development on new drugs and technologies focuses on the diseases that have the largest impact on global health \[[@pone.0141374.ref005]\]. There are several ways of trying to address these problems. Many global health organizations including the Global Fund offer grants for developing countries to purchase essential medicines or provide these directly to the poor. Others, like PATH, GAVI, IPM Global, and the TB Alliance, partner with private industry to do research on, and development of, essential medicines \[[@pone.0141374.ref006]\]. Yet others, like the Gates Foundation and the US Food and Drug Administration, support these efforts by offering financial incentives for new innovation in the form of grants, prize funds, priority review vouchers, and advanced market commitments \[[@pone.0141374.ref007]\]. Better data on everything from health systems functioning, and administration to the impact of essential medicines is necessary to advance these efforts \[[@pone.0141374.ref008]\]. Some good data is already available and having a large impact. The Institute for Health Metrics Evaluation's Global Burden of Disease project provides estimates of the need for many essential medicines, for instance \[[@pone.0141374.ref009]\]. This project estimates the Disability Adjusted Life Years (DALYS)--a measure of death and disability lost--due to many of the major global health problems in each country in the world. Until now, however, we have had no consistent estimates of the impact of our efforts to combat malaria, TB, and HIV/AIDS. The Institute for Health Metrics Evaluation does not provide any estimate of how much of this burden is alleviated across these diseases. The models that do exist focus primarily on individual diseases \[[@pone.0141374.ref010]--[@pone.0141374.ref012]\]. This paper presents a new Global Health Impact index that evaluates the impact of key drugs for malaria, TB, and HIV/AIDS around the world. Materials and Methods {#sec002} ===================== What is the best way to measure the global health impact of key medicines for some of the world's worst diseases? Is it possible to develop a consistent and simple method of measuring the death and disability averted by essential medicines? The Global Health Impact Index uses three pieces of information in arriving at an estimate of key drugs' impact on malaria, TB, and HIV/AIDS around the world: data on access to the drugs, their efficacy and the need for those drugs (measured in DALYS) \[[@pone.0141374.ref009]\]. The base year for the model is 2010 and the impact of drug *i* for disease state *j* in the base year in each country *c*, is calculated as $${I_{icj} = d}_{icj}t_{icj}e_{icj}.$$ where *d* ~*icj*~ represents the DALYS lost to disease state *j* in country *c* that we estimate can be averted with *i*; *t* ~*icj*~ represents the proportion of people who need treatment for disease state *j* who we estimate are receiving *i* in country *c*; *e* ~*icj*~ represents estimated treatment effectiveness of *i* in *c* for disease state *j*. Each drug's score is the sum of its scores in each country for all disease states (i.e. the sum of scores for drug susceptible TB in HIV+/- patients, multi-drug resistant, and extremely drug resistant TB). [Fig 1](#pone.0141374.g001){ref-type="fig"} shows drug scores by rank and details about this are provided in [S1 Appendix](#pone.0141374.s001){ref-type="supplementary-material"} \[[@pone.0141374.ref013]--[@pone.0141374.ref028]\]. Because each drug's impact varies with the need for, access to, and efficacy of the medicine this model provides much more than a scientific study of drugs' efficacy or meta-analysis. It looks at the proportion of the population that needs the medicine that is receiving it as well as drug efficacy. It calculates the proportion of the global burden of disease alleviated. {#pone.0141374.g001} Individual drug scores can be aggregated in many ways--within countries, across countries, by disease and even by pharmaceutical company holding the patent on the medicines. It is possible to see, for instance, which drugs are alleviating the largest amount of death and disability in each country in the world and, where great needs remain unmet, and to what extent this is due to lack of access to effective drugs. As [Fig 2](#pone.0141374.g002){ref-type="fig"} demonstrates, it is also possible to aggregate drug scores by disease. All of the data in the index is from international databases and reports (see [S1 Appendix](#pone.0141374.s001){ref-type="supplementary-material"} for further explanation) \[[@pone.0141374.ref014]--[@pone.0141374.ref028]\]. Where country-level information is not available, our approach is to use averages to replace the missing national data. {#pone.0141374.g002} It will help to consider a real example of how one originator company's drug's score was calculated. Chongqing Tonghe Pharmaceutical Co. Ltd. holds the patent on only one anti-malarial: Dihydroartemisinin-piperaquine (DHA-PPQ). DHA-PPQ is a first-line drug in Viet Nam, so consider how its impact in Viet Nam was calculated. 63,901.40 DALYs were lost to malaria in Viet Nam in 2010. About 75% of the malaria in Viet Nam was Plasmodium falciparum malaria \[[@pone.0141374.ref009]\]. so we estimate that 75% of the 63,901.40---or 47,926.05---DALYs were lost to p. falciparum malaria. DHA-PPQ is used as the first-line treatment of Plasmodium falciparum malaria in Viet Nam. The WHO suggests that DHA-PPQ is 100% effective in Viet Nam. However, DHA-PPQ only has treatment coverage in Viet Nam of 2.6% \[[@pone.0141374.ref009], [@pone.0141374.ref029]--[@pone.0141374.ref032]\]. The impact of DHA-PPQ in Viet Nam, then, is DALYs \* Coverage \* Effectiveness. The estimated impact of DHA-PPQ for Viet Nam is (47,926.05 \* 2.6% \* 100%) = 1,246.08 DALYs saved. The above process was repeated for every country where DHA-PPQ was a first-line drug, so that an impact score for every country was obtained. To get the total impact score for Chongqing Tonghe Pharmaceutical Co. Ltd., we summed the scores for all of these countries. The total impact score for Chongqing Tonghe Pharmaceutical Co. Ltd. is 6,730.11 DALYs saved. The models used to calculate TB and HIV are much more complex, so examples illustrating the necessary calculations are relegated to the [S1 Appendix](#pone.0141374.s001){ref-type="supplementary-material"} Sections II and III. What follows just presents some key assumptions and data sources for our TB and HIV models in turn. Consider our current TB model. It examines drug impacts on Drug-Susceptible (or \"Normal\") TB, MDR-TB, and XDR-TB. Totally drug-resistant (TDR)-TB is excluded from the current model as, thus far, only a small number of TDR-TB cases have been reported \[[@pone.0141374.ref014]\]. For Drug-Susceptible TB, we also consider the difference in drugs' impacts on HIV+ versus HIV- TB cases. UNAIDS' TB database provides the data necessary for breaking down incident cases into Drug-Susceptible TB and MDR-TB, and we use the WHO's Global Tuberculosis Report's estimate that 9% of MDR-TB cases are XDR-TB \[[@pone.0141374.ref018]\]. The WHO reports the number incident cases of TB, treatment percentages, the number of registered cases that were tested for HIV status, and what proportion were HIV positive \[[@pone.0141374.ref016], [@pone.0141374.ref019], [@pone.0141374.ref020]\]. In countries where data is not available regarding the proportion of TB incident cases with known HIV status, an estimate was derived using the global average percent of TB cases with a known HIV status \[[@pone.0141374.ref021]\]. The Institute for Health Metrics Evaluation provides data on the DALYS lost to TB \[[@pone.0141374.ref009]\]. To compute the DALYs lost to MDR-TB and XDR-TB, we use calculated MDR-TB and XDR-TB proportions and multiply by the total DALYs due to TB of any type. We use global estimates of drug efficacy for the various treatment groups (e.g. MDR-TB) \[[@pone.0141374.ref017]\]. We have yet to get good treatment coverage data at the country level for HIV+ vs HIV- drug susceptible TB cases. Thus, for now, we use the WHO's estimate of the prevalence of directly observed treatment short-course (DOTS) coverage of 65.9% for all cases \[[@pone.0141374.ref021]\]. Estimated efficacy for TB/HIV+ treatment is 73% and that for TB/HIV- treatment is 87% \[[@pone.0141374.ref017]\]. We then take the calculated DALYs lost to each specific type of TB (e.g. Normal TB in HIV+ patients) \* treatment coverage for that type with each regimen \* efficacy of treatment for that type in each country to get regimen impact scores. Each drug in the regimen is given credit in proportion to its use. An individual drug's score, then, is the sum of each of the proportional score of any regimen in which it is a part. Drug scores are aggregated across countries and then across disease type and by originator company. A difficulty that arises with MDR-TB treatment is that different patients are resistant to different drugs. Protocols exist for which treatment to use depending on to which drugs the patient is resistant. We use these protocols and data on resistance to estimate global use of each regimen \[[@pone.0141374.ref033], [@pone.0141374.ref034]\]. Again, each drug in each regimen is given equal weight in our model. Next, consider our HIV model. Again, the Institute for Health Metrics Evaluation provides data on the DALYS lost to HIV \[[@pone.0141374.ref009]\]. Treatment percentage information is available from the WHO's HIV database \[[@pone.0141374.ref024]\]. If country-specific treatment numbers are not provided, then numbers are calculated based on what would be necessary to reach regional averages \[[@pone.0141374.ref025], [@pone.0141374.ref026]\]. The WHO also provides data on what percentage of adults and children are taking first and second line regimens in mid- and low-income countries affected by HIV that responded to the WHO AIDS Medicines and Diagnostics Service (AMDS) survey. These countries were classified by the WHO as either \"Group A\" or \"Group B\" countries. Group A countries include 47 low- and middle-income countries excluding region of the Americas and Group B countries include 20 low- and middle-income countries in the Americas \[[@pone.0141374.ref027]\]. We assume that the DALYs each regimen can recover are proportionate to their use in each population. We conducted a systematic review of regimens' efficacy by subgroup (e.g. children in Group B countries) using data on the regimen from other regions and then data on average regimen efficacy within subgroups as fallback data when efficacy estimates were not available \[[@pone.0141374.ref035]--[@pone.0141374.ref069]\]. We take the calculated DALYs lost recoverable with a particular treatment regimen in a country for each subgroup of patients (e.g. Group A adults) \* treatment coverage for that subgroup in that country with each regimen \* estimated efficacy of treatment for that subgroup to get regimen impact scores. Each drug in the regimen is given credit in proportion to its use. An individual drug's score, then, is the sum of its proportional of each regimen's score in which it is a part. Drug scores are aggregated across countries (as in [Fig 3](#pone.0141374.g003){ref-type="fig"}) and then across disease type and by originator company. {#pone.0141374.g003} We have conducted extensive one-way and multi-parameter sensitivity analysis on the model as well as Monte Carlo analysis. Overall the model is stable across a wide range of parameter settings and changes to modelling assumptions. Again, much more detailed explanations with example calculations for TB and HIV and details of some the sensitivity analyses are available in the [S1 Appendix](#pone.0141374.s001){ref-type="supplementary-material"}. Additional results are available from the corresponding author upon request. There are important limitations to the quality of the data we use. Our analysis does not, for instance, perfectly capture the volume of each product used in each country for all diseases. Where data is lacking, we provide an estimate based on the extent to which products are listed as first-line drugs for treating a disease. If 100 patients are treated in a country, and there are two first-line drugs, we give each drug credit for its potential impact on 50 patients. Our approach has the merit of allocating credit for being recognized as a first-line therapy for a given disease. Similarly, we have not attempted to determine what the incremental benefit of a drug is, relative to the next best therapy. Our analysis, in effect, indicates the impact of treatment including drugs in place of no treatment. Details of some sensitivity analyses on the model are included in [S1 Appendix](#pone.0141374.s001){ref-type="supplementary-material"} Section IV. Even with the inaccuracies that inevitably arise in this exercise, we believe that it is important to estimate the impact pharmaceuticals are having on global health for patients infected with malaria, tuberculosis and HIV/AIDS. In the future, we plan to expand the model over time and across diseases. There is good data, for instance, on a variety of neglected diseases that have a large global health impact including lymphatic filariasis, helminths, and schistosomiasis. It may also be possible to expand the index to include some chronic diseases and different emerging technologies including vaccines. Results {#sec003} ======= The model provides an estimate of the impact drugs for malaria, TB, and HIV are having around the world. Key drugs for malaria--artemether-lumefantrine and artesunate plus amodiaquine--have the largest impact because they are widely recommended and highly effective. Together they alleviate almost 12% of the global burden of the three diseases in the model. Lamivudine for HIV and all of the drugs in the first line regimen for drug susceptible TB also have a large impact. Still, even with many highly effective drugs available, 63% of the burden of these diseases remains unalleviated. It is also possible to see the drugs' impacts in each country individually, by disease, and in aggregate. Nigeria is the highest ranked country on the Global Health Index. There is a lot of malaria in Nigeria receiving highly effective treatment (See [Fig 4](#pone.0141374.g004){ref-type="fig"}). There is also some successfully treated malaria and TB. In India drugs for TB are having a much larger impact, though we are also having some significant impact on HIV/AIDS. In South Africa, the third highest ranked country, we are having more success in alleviating the burden of HIV/AIDS but there is a much less severe malaria burden to alleviate. {#pone.0141374.g004} Moreover, the model provides an overall picture of drugs' impacts on these three diseases and it is possible to view the determinants of drug performance in the model many ways. The model suggests, for instance, that we are having an approximately equal impact on all three diseases, though the need for drugs for TB is much less than for malaria or HIV/AIDS, treatment coverage is higher. There is, however, great variation across countries and regions in need, treatment coverage, and efficacy. Treatment coverage for HIV/AIDS is significantly higher in Latin America and the Caribbean than many other regions, for instance. Finally, the model shows the drugs impacts aggregated by originator-company. The model suggests that drugs on which Sanofi holds the original patent or license are having the greatest impact of any company's drugs. Most of the impact comes from its drugs for malaria (artesunate plus amodiaquine and artesunate plus sulfadoxine-pyrimethamine). These drugs are responsible for 50.07% of the total DALYs alleviated that would have been lost to malaria in the world in 2010. Sanofi also has the original patent on some key medicines for TB (Rifampicin and Ethionamide). Rifampicin is important because it is one of the standard 6-month first-line regimens against TB. Ethionamide is especially important in treating multiple drug-resistant TB (MDR-TB) because it is included in all three anti-MDR-TB treatment regimens. Sanofi's TB drugs helped to alleviate 24.97% of the DALYs that would have been lost to TB in the world of 2010 \[[@pone.0141374.ref027]\]. Discussion {#sec004} ========== The Global Health Impact Index can assist ministries of health and country-level policy makers in developing health policy. It may be useful for country-level health ministries in deciding what diseases to prioritize and what drugs to use. The claim here is not that the best drugs in the model are the ones countries should use. Nor is it obvious that we should put more resources into fighting the diseases against which we are most successful. Countries should still, presumably, follow WHO treatment guidelines and may do best to focus on meeting the greatest needs. Nevertheless, when the suggested drugs, or efforts to address a disease, are not significantly impacting death and disability, policy makers should consider why--there are many possible explanations including price differentials, resistance patterns, and so forth. The model shows, for instance, that some highly effective HIV/AIDS drugs are not having a large impact because they are not widely used. Countries might draw on this fact to explain the potential impact of scaling up such treatments in applying for grants from organizations like the Global Fund. Alternately, they could compare the impact of key drugs within their country to countries with relevantly similar disease burdens etc. Nigeria might, for instance, point out that despite great remaining need for anti-malaria drugs, drugs are having a large impact in combatting the disease within their borders. On the other hand, policy makers can inquire into why drugs in India do not seem to be having a very large impact on malaria despite the large need (especially given that many countries with similarly high disease burdens--like Uganda---are much more successful in addressing the need). The model can also be used to evaluate international organizations' contributions to global health impact and to help them focus their efforts more effectively. Generally, these organizations claim a proportion of the total impact of interventions in partner-countries. This model has some advantages over, e.g., the Global Fund's method of estimating the impact of its investments \[[@pone.0141374.ref070]\]. It is simple, transparent, and consistent across several diseases and can be extended to evaluate a broad range of interventions. It also includes a measure of the disability as well as death averted by key interventions. It is important to recall, however, that a drug's impact varies with the need for, access to, and efficacy of the medicine. Some drugs may be available, acceptable, affordable and accessible, but ineffective. Others may cost too much, or the company that produces them may not be able to make them in sufficient quantities, to have a great impact even if they are highly effective. In yet other cases, prices may rise as demand increases--limiting accessibility. This may happen if, for instance, policy makers include a drug in treatment guidelines without international organizations or countries investing sufficiently in scale-up. In some cases, even climate change can explain changes in impact scores as rainfall, for instance, impacts the transmission of malaria. Not all factors that contribute to impact result from countries', companies', or international organizations' attempts to extend access on essential medicines (some have nothing to do with drugs at all). However, the index opens the door to figuring out what factors are important determinants of impact in different contexts. Policy makers may look for correlations between policies and impacts to determine what factors promote and undermine global health impact in general and design better policy. They can also try to address the particular problems they discover. Further research using the index will allow us to have a clearer picture of the causes and consequences of this impact. Pharmaceutical companies, consumers, and investors may utilize this index to track performance, set targets, and create incentives for greater impact. In other work, I have argued for using this kind of index as a basis for giving companies a Global Health Impact label to use on all of their over-the-counter products. If even a small percentage of consumers prefer products with Global Health Impact labels, the incentive for companies to improve performance may be significant \[[@pone.0141374.ref035]\]. Again, companies are not the only ones responsible for the drugs' impacts. The Drugs for Neglected Diseases Initiative (DNDi) played a key role, for instance, in the development of artesunate+sulfadoxine-pyrimethamine. Still, as discussed above, aggregating drug scores by the companies holding the patents/licenses (as in [Fig 5](#pone.0141374.g005){ref-type="fig"}) provides a mechanism for incentivizing new innovation. {#pone.0141374.g005} Moreover, the company or country indexes are in no way an overall evaluation of companies' or countries' performance or even their access policies. Many things affect drug performance including other countries', companies', and international institutions' policies. Right now we just aggregate drug scores by originator-company (it was difficult even to determine which companies held the original patents on which medicines). In the future, we plan to look at manufacturers and distributors as well. This is incredibly important as studies indicate that Indian generic manufacturers supply more than 80% of ARVs in low- and middle-income countries and their efforts are essential for lowering prices and increasing drug accessibility \[[@pone.0141374.ref071]\]. However, we have not yet perfected our methodology for doing so and do not present the data here as the Global Price Reporting Mechanism Database does not (yet) contain information about distributions of anti-malarial medicines (some preliminary data is, however, available upon request from the corresponding author). Nevertheless, we think it is illuminating to see which originator companies' drugs are having an impact, and where they are having an impact, as this provides a mechanism for incentivizing positive change. Conclusions {#sec005} =========== There are many difficult issues to resolve in evaluating key innovations' impact on global health. It is possible to refine many of the assumptions the model relies upon further and to update the model as new data on need, access, and efficacy becomes available. Nevertheless, the model presented here provides some essential information about drugs' global health impacts and highlights the need to improve global disease surveillance mechanisms. A good rating system has the potential to foster great improvements to global health. The rating system should be of interest to policy makers, researchers, companies, investors, and consumers. It will, for instance, open the door to many new ways of incentivizing international organizations, countries, and companies to have a greater impact on global health. Although this will not solve all of the health problems people face, it may help many people secure essential medicines that can save millions of lives every year. Supporting Information {#sec006} ====================== ###### Drug Impacts, Sensitivity Analyses, and Company Accreditation. Contents: Section I. Drug Abbreviations. (p. 2) Table A, Drug Abbreviations. Section II. TB Example: How the Impacts of TB Drugs are Calculated. (p. 3) Fig A, Breakdown of TB patient groups. Table B, Impact on TB patient groups for Botswana in 2010. Table C, Disaggregated Drug-Susceptible TB Treatment Regimen. Table D, Possible MDR-TB Treatment Regimens. Table E, MDR-TB Resistance Patterns. Table F, Breakdown of TB Drug Resistance between Different Regimens. Table G, Portion of MDR-TB treatments. Table H, Proportion of Credit Given to Each Drug in Different Treatment Regimens. Table I, XDR-TB Treatment Regimen Drug Proportions. Table J, Disaggregated XDR-TB Treatment Regimens. Section III. HIV Example: How the Impacts of HIV Drugs are Calculated. (p. 11) Table K, Group A and Group B Countries Affected by HIV. Table L, Percentage of People Taking First and Second Line Regimens in Group A Countries. Table M, Antiretroviral Treatment Regimen Proportions and Efficacies for Group A and Group B Countries. Some of the material in this section is reprinted from "Globalization, Global Justice, and Global Health Impact" under a CC BY license, with permission from Public Affairs Quarterly, original copyright 2014 Section IV. Sensitivity Analyses. (p. 18) Fig B, Initial and Secondary Stability for Sensitivity Analyses. Section V. Drug Accreditation between Companies. (p. 25) Table N, Drug Accreditation between Companies. (DOCX) ###### Click here for additional data file. The author would like to thank *Public Affairs Quarterly* for allowing her to reprint some of the material from the HIV appendix in her article "Globalization, Global Justice, and Global Health Impact" in their July 2014 issue. The author would also like to thank all of the people and organizations that have contributed to the project--especially the Global Health Impact team. She is thankful for recent discussions about the project at the World Health Organization, The Global Fund; the Edmund J. Safra Center for Ethics at Harvard University; the University of Manchester; the American Philosophical Association; Yale University; Binghamton University; the University of Delaware; London School of Economics; William and Lee College; Goethe University; California University; University College London; Santa Clara University; the Universidad De Antioquia; Carnegie Mellon University; the American Society for Bioethics and Humanities; Stanford University; Dickinson College; Newcastle on the Tyne; and researchers at UNAIDS, the World Health Organization, and Médecins Sans Frontières along with countless others. She is also especially grateful for support from Academics Stand Against Poverty; Stanford University's Center for Ethics in Society; Justitia Amplificata and the Center for Advanced Studies in Frankfurt, Germany; Binghamton University's Citizenship, Rights, and Belonging Transdisciplinary Area of Excellence collaborative grant program; the Swedish---Franco Program in Philosophy and Economics in Paris, France; the Center for Poverty Research in Salzburg, Austria; the World Institute for Development Economics Research in Helsinki, Finland; and the Berkman and Falk Foundations at Carnegie Mellon University. [^1]: **Competing Interests:**The authors have declared that no competing interests exist. [^2]: Conceived and designed the experiments: NH. Performed the experiments: NH. Analyzed the data: NH. Contributed reagents/materials/analysis tools: NH. Wrote the paper: NH.

2024-05-20T01:26:28.774034

https://example.com/article/5962

Why so many Somali-Canadians who go west end up dead JOSH WINGROVE and KIM MACKRAEL FORT McMURRAY, ALTA. and MINNEAPOLIS — The Globe and Mail Last updated Monday, Jun. 25 2012, 11:44 PM EDT Edmonton June 21, 2012. Somalian refugee Saeed Jama 23, pictured at his home in Edmonton is facing deportation because of his criminal record though he has never actually been to Somalia. (JASON FRANSON for The Globe and Mail) They are called the ciyaal baraf, or the children of the snow. The kids of a generation who fled blood-stained Somalia two decades ago. Their parents sought refuge across the world in a mass exodus from civil war. Many settled in Canada, mostly in Toronto, where they raised their children, often in poverty. And, as the children came of age and branched out across the country, a new kind of grief emerged. Story continues below ad Since 2005, dozens of young men from Canada’s Somali community have been killed, most of them casualties along a cocaine-dusted corridor between the housing projects of Toronto and the oil patch in Alberta. Most cases remain unsolved. The latest slaying was among the most brazen. Ahmed Hassan, a 24-year-old who’d been charged with dealing drugs in Alberta, was gunned down in Toronto’s Eaton Centre. His public death has nudged this grief into the spotlight and renewed calls from Somali community leaders for governments to help stop the bloodshed. Ultimately, the shooting has forced the country to confront the vexing question of why so many of these young men who go west end up dead. Western dream a nightmare The Somali-Canadian community may be rooted in Toronto, but the source of its grief is in Alberta, where at least 23 young men have died in the past seven years. There are about 3,000 Somalis who live in or near the oil-sands city of Fort McMurray. Their community is clustered in a series of low-rise apartments tucked between a grocery store, a mall and a graveyard. They come here dreaming of well-paying jobs, hoping to send money back home and end two decades of poverty. But many lack recognized skills and end up chronically underemployed, driving cabs or working as hotel housekeepers; or they’re unemployed, as is the case with more than 300 Somalis in Fort McMurray today. “We’re called the lost generation,” explained Warsame Adam, a 29-year-old facility manager at the Fort McMurray mosque. “We’re hit from every direction, Somalis. It’s like we don’t belong anywhere.” Mr. Adam found meaningful work out west. Others, however, heeded a different, persistent call – that of the drug trade. “I don’t think anybody goes there saying, ‘You know what, I’m going to go over there and become a drug dealer,’ ” said Ali Abdullahi, who runs youth programs for Somalis in Toronto and knew at least one of the men killed in Alberta. “It’s a lot of young men who go over there, look for work, and some of them may not have all the qualifications to find a job.” But they still need to make money, said Hukun Hurur, a Somali leader in Fort McMurray. “And then they turn to other things.” Cocaine use thrives in Alberta’s oil patch, driven by those who did find well-paying jobs. In 2010, Fort McMurray RCMP laid five cocaine-trafficking charges for every marijuana charge. “We don’t get a job. So the only option is to get money, to sell drugs,” said one young Somali-Canadian in Fort McMurray, who calls himself M.J. “There’s something wrong with this city,” he said. Civil war Most of these children of the snow can trace their roots to strife-torn Somalia. In 1991, armed opposition groups overthrew the ruling military government, thrusting the country into a brutal and protracted civil war. As the conflict worsened, migrants poured into Toronto, along with other cities in the United States and Britain. Many arrived with limited English skills and few resources. In places like Toronto, where there was no existing Somali community to join, families were left to fend for themselves. Rima Berns-McGown, a University of Toronto professor who has studied the Somali diaspora in Canada and Britain, said many parents who brought their children abroad were suffering from post-traumatic stress disorder – yet another challenge for young families adapting to life on a new continent. Those who came to Canada were overwhelmingly directed to Toronto’s social-housing projects, places like Regent Park and Jane and Finch, where residents are in frequent conflict with police. And as the children of the first wave of refugees grew up, many of them faced a double stigmatization as Muslims who are black – a situation some Somalis say was acutely reinforced after the 2001 terrorist attacks in New York. Many of the rivalries that play out in Alberta are in fact nurtured in Toronto, where an estimated 80,000 Somali-Canadians live. “Whatever’s going on over in Toronto, it comes over here,” M.J. said. “Everybody wants to make his money, so they’re going to shoot each other.” The deadly pull westward among Toronto’s Somali community, according to one community source, began with one young man from the East Mall neighbourhood who got involved in Alberta’s lucrative oil-sands spinoff through a friend who was working there. When the man returned home to Toronto, he drove a flashy car, bought drinks for his friends and was rich enough to leave expensive items behind at bars and nightclubs. The siren song of easy money was attractive to some of the young men he grew up with, many of whom were struggling to find work in Toronto. A few left to join him. Soon after, others followed. “He really recruited a lot of people into that stuff,” said the source, a respected member of the community who spoke on condition of anonymity. “It seems like there was a chain migration. One guy left and the others followed him.” Looking to the U.S. When Canadian law-enforcement officials attempted to better understand this phenomenon last year, one of the places they looked was Minnesota. The state is home to an estimated 32,000 Somali-Americans, the largest concentration in the U.S. There, as in Alberta, many young Somalis have sought prosperity in the Bakken oil fields of North Dakota, a 10-hour drive west of Minneapolis. The heart of Minneapolis’s Somali community is Cedar-Riverside, an enclave often referred to as Little Mogadishu. The towers of Riverside Plaza – a social-housing complex that’s long been a haven for previous waves of refugees – are now home to thousands of Somali-Americans. Police officer Jeanine Brudenell, who was invited to share her experiences with Canadian officials, began tracking street gangs in the city’s Somali community in 2005. Gradually, she said, her role shifted to providing programs aimed at teaching Somali-Americans about their legal rights and encouraging them to report criminal activity. Minnesota police have long been frustrated with how difficult it is to solve crimes in the Somali community: of roughly eight gang-related homicides in Minneapolis in recent years, only one has been solved, a problem Ms. Brudenell attributes to distrust of police and the possibility of retaliation. “They don’t want to be testifying or be a witness because they fear they’re going to be in danger,” she said, adding, “It’s a fair fear.” In recent years, the force has hired two Somali-speaking beat officers who work nights in the neighbourhood, which most people say has improved safety and helped reduce conflicts with police. “Police are usually suspicious of [a group of] black kids who are maybe up to no good walking around,” said Saeed Fahia, a community leader. “It’s possible that they’re doing nothing. So someone who knows the culture could tell you if they are up to no good or not. An ordinary police officer cannot do that.” They also hired a civilian liaison to work with the Somali community and opened a “safety centre” at the base of one of the public-housing towers, aimed at encouraging residents to report crime. Ms. Brudenell said that, as the department does a better job of tracking and catching gangsters, some of the most serious criminals are turning up in other cities instead. “We get calls, ‘Oh my God, we have all your people here,’ ” she said. The Minnesota experience may not translate exactly in Fort McMurray, where the young men getting into trouble are hundreds or thousands of kilometres away from family. But law-enforcement officials share a common frustration in getting Somali community members to talk to investigators. In one Edmonton murder case on New Year’s Day in 2011, a restaurant full of people yielded just one suspect description. Homicide detective Bill Clark complained publicly, forcing the police chief to apologize and mend fences with Somali leaders. M.J., sitting in Fort McMurray, said he’d never speak to police. “Where’s my benefit, if I snitch on you? I put my life in danger. I have no benefits. They do nothing for me, they pull me over, because being black, and you think I’m going to go to them and tell them what’s going on?” ‘Positive programs’ Somali leaders want program funding for their summer camps, soccer and basketball leagues, or a community centre – anything to engage young Somali men, specifically. Existing programs are piecemeal, and rely heavily on volunteer hours at Somali organizations. “The only way we can stop them from joining these bad activities is to make them busy with positive programs,” said Bashir Ahmed, executive director of Edmonton’s Somali-Canadian Education and Rural Development Organization. But those don’t always work. Mr. Hassan was once in one, writing he was“planning to be productive member of society.” He was later charged with cocaine trafficking before being gunned down earlier this month. Five years ago, community leaders produced a provincially funded report on the risks facing Somali youth in Edmonton. One of the co-authors was Abdullahi Roble – Mr. Hassan’s father – who doesn’t want to talk about his dead son. “There’s nothing to prove, nothing. … We will not gain anything about him. He’s dead, that’s it. That’s enough for me,” he said. But for those who get caught up in the game and survive, the challenges are far from over. Saeed Ibrahim Jama’s parents fled Somalia’s turmoil and went to Saudi Arabia, where he was born, before eventually ending up in Canada in 2001. They lived in poor neighbourhoods in Toronto and Winnipeg and Edmonton, and Mr. Jama and his older brother both fell into crime. Mr. Jama served 27 months for getting caught with drugs he planned to sell. Since being released, he said he’s turned his life around, but was denied citizenship. Last Wednesday, Canada served him a final deportation notice. On July 22, barring a last-minute legal intervention, he’ll be deported to Somalia, a country he has never set foot in. The federal official ruled he faced no “significant personalized risk” by returning to a country where it recommends Canadian citizens “avoid all travel.” Mr. Jama is repentant. “I completely understand why they want to deport me. I understand it. I did what I did,” he said this week. But, he said, the government is making it impossible for his generation to make amends. “I’ve been working, doing everything I can. I don’t make no trouble. But they don’t see it,” he said. Once part of a middle-class family that began to struggle, he says he got into drugs for the money, and because of peer pressure. His oldest sister is a university graduate, and another sister is in university. But he and his brother, the ciyaal baraf, have criminal records. “I was young, and I didn’t take it seriously,” he said, adding some advice for other young Somalis. “They need to look at what their parents went through to get them here. But no one sees it like that.”

2023-12-10T01:26:28.774034

https://example.com/article/6787

/* This file is part of VoltDB. * Copyright (C) 2008-2020 VoltDB Inc. * * This program is free software: you can redistribute it and/or modify * it under the terms of the GNU Affero General Public License as * published by the Free Software Foundation, either version 3 of the * License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Affero General Public License for more details. * * You should have received a copy of the GNU Affero General Public License * along with VoltDB. If not, see <http://www.gnu.org/licenses/>. */ #ifndef STATSAGENT_H_ #define STATSAGENT_H_ #include "common/ids.h" #include "common/types.h" #include <vector> #include <map> namespace voltdb { class StatsSource; class TempTable; /** * StatsAgent serves as a central registrar for all sources of statistical runtime information in an EE. In the future this could perform * further aggregation and processing on the collected statistics. Right now statistics are only collected on persistent tables but that * could be extended to include stats about plan fragments and the temp tables connecting them. */ class StatsAgent { public: /** * Do nothing constructor */ StatsAgent(); /** * Associate the specified StatsSource with the specified CatalogId under the specified StatsSelector * @param sst Type of statistic being registered * @param catalogId CatalogId of the resource * @param statsSource statsSource containing statistics for the resource */ void registerStatsSource(voltdb::StatisticsSelectorType sst, voltdb::CatalogId catalogId, voltdb::StatsSource* statsSource); /** * Unassociate all instances of this selector type */ void unregisterStatsSource(voltdb::StatisticsSelectorType sst, int32_t relativeIndexOfTable = -1); /** * Get statistics for the specified resources * @param sst StatisticsSelectorType of the resources * @param catalogIds CatalogIds of the resources statistics should be retrieved for * @param interval Return counters since the beginning or since this method was last invoked * @param now Timestamp to return with each row */ TempTable* getStats( voltdb::StatisticsSelectorType sst, int64_t m_siteId, int32_t m_partitionId, std::vector<voltdb::CatalogId> catalogIds, bool interval, int64_t now); ~StatsAgent(); private: /** * Map from a statistics selector to a map of CatalogIds to StatsSources. */ std::map<voltdb::StatisticsSelectorType, std::multimap<voltdb::CatalogId, voltdb::StatsSource*> > m_statsCategoryByStatsSelector; /** * Temporary tables for aggregating the results of table statistics keyed by type of statistic */ std::map<voltdb::StatisticsSelectorType, voltdb::TempTable*> m_statsTablesByStatsSelector; }; } #endif /* STATSAGENT_H_ */

2024-06-02T01:26:28.774034

https://example.com/article/1093

Q: Preventing minidom from escaping already escaped text import xml.dom.minidom text='2 &gt; 1' impl = xml.dom.minidom.getDOMImplementation() doc = impl.createDocument(None, "foobar", None) docElem = doc.documentElement text = doc.createTextNode(text) docElem.appendChild(text) f=open('foo.xml', 'w') doc.writexml(f) f.close() I expected foo.xml to read as follows: <?xml version="1.0" ?><foobar>2 &gt; 1</foobar> but in fact it reads: <?xml version="1.0" ?><foobar>2 &amp;gt; 1</foobar> How can I stop minidom from escaping an already escaped sequence? In my application the text is being read from a (non-xml) document, so I cannot simply write text = '2 > 1'. A: Unescape before inserting: from xml.sax.saxutils import unescape text = doc.createTextNode(unescape(text)) The escaping takes place when writing and cannot be disabled, nor should it be. Sometimes you want to include literal &gt; text in your XML, and that should be escaped properly for you if you do. If your input is XML escaped, simply unescape it before inserting.

2023-08-25T01:26:28.774034

https://example.com/article/3579

Q: How to convert time in seconds to standard time format in rails? How can convert time in seconds to standard time format in rails.For example 1971 seconds should be displayed as 0:33:25 A: There is no helper to that for you in rails. But it's quite easy to write your own: def to_dot_time(s) h = s / 3600 s -= h * 3600 m = s / 60 s -= m * 60 [h, m, s].join(":") end And an example: >> to_dot_time(1971) => "0:32:51"

2023-10-09T01:26:28.774034

https://example.com/article/4708

Good news swimmers on a hot day - the Onset Harbor swimming ban has been lifted Wednesday Jun 25, 2014 at 1:47 PMJun 25, 2014 at 2:12 PM The Wareham Harbormaster's Dept. has confirmed that the ban on swimming the waters of Onset Bay has been lifted. The Wareham Harbormaster's Dept. has confirmed that the ban on swimming the waters of Onset Harbor has been lifted. A sewer overflow Monday at about 10:30 a.m. on Independence Lane in Onset spilled approximately 2,000 – 3,000 gallons of waste material into the Bay from an adjacent storm drain and led to the swimming closure. The Wareham Board of Health and the Massachusetts Division of Marine Fisheries completed water sampling Tuesday, and the results came back OK today. Shellfish harvesting will remain closed in Onset Bay, however, due to FDA regulations. The Harbormaster issued the following release today: "Effective immediately the ban on bathing has been lifted by the Wareham Board of Health. "Effective immediately the ban on shellfishing in Fisherman’s Cove, Cohasset Narrows, Peter’s Neck and Butler Cove has been lifted by the Massachusetts Division of Marine Fisheries. "Onset Bay will remain CLOSED to the harvesting of shellfish due to FDA regulations. We will update you as soon as we are able to reopen the remainder of shellfish beds. "If you have any questions, please feel free to contact the Wareham Harbormaster Department at 508-291-3100, extension 3186, or the Board of Health at 508-291-3100, extension 3197."

2024-07-05T01:26:28.774034

https://example.com/article/4981

Q: How to completely reset an ARKit scene in Unity Hey guys I'm having a small issue with ARKit and Unity. In the game that I'm making I'm reloading my scene when the player dies, however when the scene is reloaded all the GameObjects are still in the same position from the last session. I want all my objects to return to their starting positions when the scene is reloaded. I saw that some variables regarding position and rotation are marked as "static" in the code. I tried changing them but I got a lot of compile errors. Does anyone know a way around this? A: Create this method and call it whenever you want to reset the scene: using UnityEngine.XR.iOS; . . . public void ResetScene() { ARKitWorldTrackingSessionConfiguration sessionConfig = new ARKitWorldTrackingSessionConfiguration ( UnityARAlignment.UnityARAlignmentGravity, UnityARPlaneDetection.Horizontal); UnityARSessionNativeInterface.GetARSessionNativeInterface().RunWithConfigAndOptions(sessionConfig, UnityARSessionRunOption.ARSessionRunOptionRemoveExistingAnchors | UnityARSessionRunOption.ARSessionRunOptionResetTracking); } A: I found the solution! Add these lines of code in your ARCameraManager script in the "!UnityEditor" part. UnityARSessionRunOption options = new UnityARSessionRunOption(); options = UnityARSessionRunOption.ARSessionRunOptionRemoveExistingAnchors | UnityARSessionRunOption.ARSessionRunOptionResetTracking; m_session.RunWithConfigAndOptions(config, options); Now every time you reload your scene all AR elements (planes, anchors, camera tracking data) are reset.

2024-06-17T01:26:28.774034

https://example.com/article/6749

A Birmingham councillor will formally resign the Liberal Democrat whip tomorrow following a row over his deselection. Coun Abdul Aziz was elected to represent Aston ward in July 2005 in a by-election following the postal fraud scam which disrupted the local election. However, a row with senior Lib Dems has led to them accusing Coun Aziz of helping Labour. Last night Coun Aziz denied he was defecting to Labour but added he was "keeping my options open" and intends to continue serving the local community. He said: "I resigned the whip on Friday but will make a formal announcement before the full council meeting on Tuesday. "I felt it was unfair that the party deselected me when I'm supposed to be a sitting councillor. "People in Aston don't necessarily vote for the Lib Dems, they vote for the individual, so I am confident I'll take a fair few votes from the Hemming clan at the next election." Councillor John Hemming (Lib Dem, South Yardley) said he was "very happy" that Coun Aziz had left the party, but claimed he had agreed to be replaced by a new candidate two years ago. He said: "It was agreed by the Aston ward in 2004 that a new candidate would be fielded and Coun Aziz would be replaced, but he didn't like that and this year he was helping Labour in their election campaign. I believe he's already tried to join Labour, Respect and the Conservatives without success but I'm sure he'll find somewhere to go."

2024-02-03T01:26:28.774034

https://example.com/article/5843

Priorities and challenges of health system chief nursing executives: insights for nursing educators. The health system chief nursing executive (CNE) is responsible for providing high-quality, service-oriented nursing care; delivering such care with disciplined cost management; leading and developing a group of nursing executives and managers at the facility level to establish nursing professional development programs and to build and maintain an effective supply of nurses; and advocating nurses and patients. This article provides insight into the strategies and priorities of large health system CNEs in balancing their obligations to their health systems, to patients and their families, and to the nurses they lead. It is hoped that these insights will provide perspectives that will support the ability of nursing educators to meet their own obligations to their schools of nursing, the faculty and students they represent, and to the profession. These insights will also set a context for further dialogue between two very important groups of nursing leaders-nursing executives and nursing educators.

2024-05-26T01:26:28.774034

https://example.com/article/6036

Get breaking news alerts and special reports. The news and stories that matter, delivered weekday mornings. An experienced Cirque du Soleil performer died after plunging onto a stage during an aerial straps routine at a weekend show in Tampa, Florida, the company said Sunday. The accident occurred Saturday night when Yann Arnaud, 38, fell during a performance of the show "Volta," according to Cirque du Soleil Entertainment Group. The French performance artist died of his injuries at Tampa General Hospital. Arnaud had been performing in Cirque shows for 15 years and was considered one of the company's most experienced entertainers, President and Chief Executive Daniel Lamarre told Reuters in a telephone interview. Let our news meet your inbox. The news and stories that matters, delivered weekday mornings. This site is protected by recaptcha "We were very surprised, considering his experience, that something like that happened," said Lamarre, speaking from Tampa, where he had flown to be with the show's cast. "I cannot describe to you how the people feel. It's terrible." The death is the third involving a Cirque performer in the company's 34 years, Lamarre said, adding that the aerial strap act was seen as a relatively safe number. Yann Arnaud, left, and Goel Ouisse perform at a rehearsal for Cirque du Soleil's "Totem" in New York in March 2013. John Lamparski / WireImage file Julian Martinez, a spectator who witnessed the accident, told NBC affiliate WFLA: "It was awful. You heard all the cries of the audience. There were children there, and they were freaking out." Lamarre said he couldn't share details about the incident involving Arnaud, a husband and father of two young children. "We are offering our full and transparent collaboration to the authorities as they look into the circumstances of this accident," the company said in a statement, adding that the last two shows of Volta planned for Tampa on Sunday had been canceled. Police said Arnaud was performing on the double rings when one of his hands slipped and he fell about 20 feet. An autopsy was scheduled for Monday. Tampa police said the incident was under investigation by the U.S. Occupational Safety and Health Administration. Just a few hours before he fell, Arnaud posted a photo to Instagram to announce that the strap duo act would finally appear in the show.

2023-10-14T01:26:28.774034

https://example.com/article/5541

Background {#Sec1} ========== Energy crisis and environment pollution problem received more and more attention due to inefficient use of vast fossil fuels \[[@CR1]\]. Therefore, the search for renewable energy alternatives to fossil fuels is a highly significant yet challenging assignment \[[@CR2]--[@CR4]\]. Photocatalytic hydrogen production through water splitting by using solar energy has been considered as an alternative environmentally benign way, but it is limited to develop highly active and stable photocatalysts at low cost. So far, various photocatalysts have been developed for H~2~ production, for instance, metal oxide (TiO~2~ \[[@CR5]--[@CR7]\], NiO \[[@CR8]\], CuO \[[@CR9]\]), metal sulfide (CdS \[[@CR10]\], CuS \[[@CR11]\], NiS \[[@CR12]\], MoS \[[@CR13], [@CR14]\]), and nitride semiconductors (C~3~N~4~) \[[@CR15]--[@CR22]\]. Recently, Yu and coworkers have made a systematic analysis of the heterojunction photocatalysts, which provides an important reference for the subsequent photocatalytic research \[[@CR23]\]. Furthermore, some phosphorus such as CoP \[[@CR24], [@CR25]\], Ni~2~P \[[@CR26]\], Cu~3~P \[[@CR27]\], and MoP \[[@CR28]\] have been employed for H~2~ production. Especially, metal--organic frameworks (MOFs) with outstanding characteristics have attracted tremendous attention as catalysts or catalyst carriers for photocatalytic water splitting in the past few years \[[@CR29]--[@CR31]\]. Although there are still some limitations, the opportunities for MOFs as heterogeneous catalysts are very encouraging \[[@CR32]--[@CR35]\] because MOFs as a new class of porous material have exciting characteristics, such as high surface areas, crystalline open structures, tunable pore size, and functionality. Particularly, the high specific surface area of MOFs may provide more attachment points for a cocatalyst, in which it could create more active sites and make better contact with reactants. On the other hand, the porous structures of MOFs can also provide extra pathways for the migration of photo-induced electrons and facilitate separation of the charge carrier \[[@CR36], [@CR37]\]. For all these reasons, MOFs as a highly efficient photocatalyst could be expected. More importantly, some photoactive MOFs have been reported; specifically, NH~2~-MIL-125(Ti) could photocatalytically reduce CO~2~ to form formate under visible light according to Sun et al. \[[@CR38]\]. Metal--organic framework and metal molecular are applied to spatial charge separation for enhancing H~2~ evolution under visible light \[[@CR39]\]. Horiuchi et al. synthesized the amino-functionalized Ti-MOF-NH~2~, which exhibited efficient photocatalysis for hydrogen production reaction with triethanolamine (TEOA) as a sacrificial electron donor under visible-light irradiation condition \[[@CR40]\]. Jiang et al. structured electron trap states in a metal--organic framework to enhance separation of electron--hole, which applied visible-light photoreduction of CO~2~ \[[@CR41]\]. Moreover, the palladium nanoparticles were successfully encapsulated in UiO-66 material by Dong et al., which exhibited efficient catalytic activity for the Suzuki--Miyaura coupling reactions at mild condition \[[@CR42]\]. Lillerud et al. first synthesized Zr-based MOFs, which they designated as UiO-66 \[[@CR43]\]. It was reported that UiO-66 displayed high chemical and thermal stability (500 °C) owing to its high affinity of zirconium towards oxygen ligands and the compact structure \[[@CR44]\]. In 2010, Garcia and coworkers used UiO-66 for water splitting under UV light irradiation, which opened the door for MOFs to photocatalytic water splitting \[[@CR45]\]. However, the UiO-66 cannot be effective for photocatalysis because they cannot respond to visible light effectively. It is well known that dye-sensitized photocatalysts could expand absorption band edge and intensity, typically a metal complex photosensitizer. In 2014, He and coworkers described the application of UiO-66 and Pt\@UiO-66, using rhodamine B as photosensitizer, in these systems, and the catalytic activities were 33 and 116 μmol g^−1^ h^−1^, respectively \[[@CR46]\]. This work successfully extended the range of UiO-66 absorption to visible light, but the activity of hydrogen production of the system was still low. In 2015, Yuan and coworkers described a very simple system using erythrosine B dye to sensitize UiO-66 and the highest H~2~ production rate of 4.6 μmol h^−1^ \[[@CR47]\]. In 2016, Xiao and coworkers described a Pt\@UI-66-NH~2~ catalytic system with a very high hydrogen production activity (257.38 μmol g^−1^ h^−1^) \[[@CR48]\]. The synergistic of metal--organic frameworks and metal nanoparticles for enhanced catalysis is systematically reviewed in Jiang' work \[[@CR49], [@CR50]\]. UiO-66 which has an absorption band edge of 335 nm in the UV region could be attributed to the π − π\* transition in organic ligands. UiO-66 exhibits photocatalytic activity because of its ability to act like a semiconductor \[[@CR45]\]. Although UiO-66 has been widely studied in the field of photocatalysis, its photocatalytic efficiency is still very low. Therefore, there is still a long way to go to find the proper cocatalyst and construct a reasonable photocatalytic system to enhance the photocatalytic activity of UiO-66 and application of photocatalysis. In this work, we designed and constructed a dye-sensitized photocatalysis reaction system, where we use TEOA as a sacrificial donor under visible-light irradiation (*λ* ≥ 420 nm) and introduced eosin Y (EY) as a photosensitizer. A nanosize Zr--metal--organic framework (Zr-MOF, UiO-66) was solvothermally synthesized, and the Pd/MOF catalysts were prepared by impregnation reduction as well. The Pd-loaded Zr-MOF was tested for efficient photocatalytic hydrogen production. It exhibited maximal photocatalytic activity (2.28 mmol h^−1^ g^−1^) under visible-light irradiation (*λ* ≥ 420 nm) with EY as a photosensitizer. Methods {#Sec2} ======= Preparation of UiO-66 {#Sec3} --------------------- All chemicals were analytical grade and used directly without any further purification. UiO-66 was synthesized via a solvothermal route. In a typical synthesis, ZrCl~4~ (1.89 g,) and terephthalic acid (2.79 g) were dissolved in 48.7 mL *N*,*N*-dimethylformamide (DMF) containing 1.43 mL hydrochloric acid (HCl) and then the solution was transferred to a 100 mL Teflon-lined stainless steel autoclave. The autoclave was sealed and heated in an oven at 220 °C for 20 h. After cooling naturally, the product was collected by centrifugation and washed for three times with DMF and then sequentially purified within methanol for several times to make sure that the occluded DMF molecules were eliminated. Finally, it followed by drying under vacuum (90 °C, 6 h) before using the samples for the photocatalytic reactions. Synthetic of Pd/MOF Composite Photocatalysts {#Sec4} -------------------------------------------- The Pd/MOF composite photocatalysts were prepared by impregnation reduction \[[@CR42], [@CR50]\]. The above-prepared UiO-66 powders (0.2 g) were placed into a clean beaker, which contained 200 mL of deionized water and mixed with appropriate amount of H~2~PdCl~4~ solution, and were vigorously stirred for another 1 h to disperse them completely. Then the NaBH~4~ (freshly prepared) was added drop-wise into the solution with a continuous magnetic stirring; the reaction solution was kept on stirring for 3 h to complete the reduction reaction (*n* ~(H2PdCl4)~:*n* ~(NaBH4)~ = 1:3). The obtained black granules were washed with deionized water and dried in a vacuum oven at 70 °C for 6 h. H~2~PdCl~4~ was added in an amount of 1, 3, and 5% of the mass of UiO-66, and the resulting samples were named Pd/MOF 1%, Pd/MOF 3%, and Pd/MOF 5%, respectively. Characterization {#Sec5} ---------------- Morphology of the sample was characterized by a field emission scanning electron microscope (JSM-6701F.JEOL) at an accelerating voltage of 5 kV. Transmission electron microscopy (TEM) measurements were taken on by using a FEI Tecnai TF20 microscope at 200 kV. The crystalline structure of the products was identified by X-ray diffraction analysis (XRD, Rigaku RINT-2000) using Cu Kα radiation at 40 keV and 40 mA. The XRD patterns were recorded from 10° to 90° with a scanning rate of 0.067°s^−1^. UV-vis diffuse reflectance spectra were taken on an UV-2550 (Shimadzu) spectrometer by using BaSO~4~ as the reference. The element composition was detected by X-ray photoelectron spectroscope (XPS, ESCALAB 250Xi). The nitrogen adsorption--desorption isotherms of samples were measured at 77 K with an ASAP 2020M instrument and analyzed by the Brunauer--Emmett--Teller (BET) equation. The pore size distribution plots were obtained by the Barret--Joyner--Halenda (BJH) model. Photocatalytic H~2~ Evolution Experiments {#Sec6} ----------------------------------------- Photocatalytic experiments were conducted in a quartz glass reactor ca. 62 cm^3^, and the opening of the reactor was sealed with a silicone rubber septum. In a typical photocatalytic experiment, 10 mg of catalyst was suspended in 30 mL 15% (*v*/*v*) TEOA aqueous solution containing 20 mg dye EY and dispersed by means of ultrasonication for about 15 min. The system was degassed by bubbling N~2~ gas to ensure the reactant mixtures under anaerobic conditions. The system was irradiated by a 5-W light-emitting diode lamp (420 nm) for H~2~ evolution under magnetic stirring condition. The amount of hydrogen evolution was measured using gas chromatography (Tianmei GC7900, TCD, 13 X columns, N~2~ as carrier). Photoelectrochemical Measurements {#Sec7} --------------------------------- ### Preparation of Working Electrode {#Sec8} The fluorine-doped tin oxide (FTO) (1 × 5 cm^2^) substrate is washed by cleaning agent, acetone solution, isopropyl alcohol, ethanol, and water under ultrasonic processing for about 30 min. The catalyst (10 mg) was added in 500 μL anhydrous ethanol (containing 50 μL 5% Nafion solution) and ultrasonicated treatment to form suspension liquid. Subsequently, 0.2 mL of the above suspension is uniformly applied to the pre-treated FTO with a drip coating, and the coating area is controlled at about 1 cm^2^. The painted electrode is dried in natural environment, and the working electrode is obtained. All PEC measurements were finished on a electrochemical workstation (VersaStat4-400, Advanced Measurement Technology, Inc.) in a three-electrode system using the as-prepared photoanode as the working electrode, a Pt plate as the counter electrode, and a saturated calomel electrode (SCE) as the reference electrode. A 300-W xenon lamp equipped with a filter (*λ* ≥ 420) was used as the irradiation source. 0.2 M Na~2~SO~4~ aqueous and hydrogen producing system solution (containing TEOA and dye EY) was employer as the electrolyte. Photocurrent response test of the photoanodes with on and off cycles were carried out at a fixed bias of 0.4 V vs. SCE. Results and Discussion {#Sec9} ====================== Morphology and Structure {#Sec10} ------------------------ The typical scanning electron microscopy (SEM) imaging of the UiO-66 and Pd/MOF has been shown in Fig. [1](#Fig1){ref-type="fig"}. The original UiO-66 was prepared by a simple and mild solvothermal method. The SEM images (Fig. [1](#Fig1){ref-type="fig"}a) clearly displayed that the bare UiO-66 presents uniform size and smooth surface. Pd nanoparticles were obtained by reduction of H~2~PdCl~4~ at room temperature with sodium borohydride (NaBH~4~). Figure [1](#Fig1){ref-type="fig"}b is the SEM image of the Pd/MOF composite photocatalysts, which showed that the original smooth UiO-66 surface appeared with a lot of particulate matter. It can be proven that these small particles are elementary palladium by the subsequent XPS results. The glossy surface can provide extra pathways for photogenerated charges, and Pd nanoparticles on surface of UiO-66 can provide active sites for H~2~ evolution. The photogenerated charges can rapidly transfer from excited dye to UiO-66, and the enriched electrons on the UiO-66 can be transferred to the Pd nanoparticles and combined with the protons in the solution to form hydrogen molecules. It is beneficial for the separation of photogenerated electron--holes and for the enhancement of photocatalytic hydrogen production activity. Therefore, the high-efficiency hydrogen production by water splitting using visible light was expected.Fig. 1The typical scanning electron microscopy (SEM) patterns of **a** UiO-66 and **b** Pd/MOF For further study of the morphology of Pd/MOF sample and the Pd nanoparticles of UiO-66 surface, the typical TEM image and the high-resolution TEM (HRTEM) image patterns were exhibited in Fig. [2](#Fig2){ref-type="fig"}. As shown in Fig. [2](#Fig2){ref-type="fig"}a, some of the Pd nanoparticles are exposed to the outside of the UiO-66, which is conducive to the binding of electrons and protons in the solution. In addition, it can be seen that the Pd nanoparticles are well dispersed on the surface of UiO-66 and the diameter is about 6 nm. The HRTEM image (Fig. [1](#Fig1){ref-type="fig"}b) clearly shows that the lattice spacing of the quantum-sized Pd nanoparticles is ca. 0.223 nm, which is consistent with the lattice spacing of the (111) plane of metallic Pd \[[@CR48]\]. It can be clearly seen that the Pd nanoparticles were uniformly distributed on the surface of UiO-66 (Fig. [2](#Fig2){ref-type="fig"}c) and the size of the Pd nanoparticles is between 4 and 9 nm (Fig. [2](#Fig2){ref-type="fig"}d). In particular, the size of the Pd nanoparticles is mainly concentrated at 6 nm.Fig. 2**a** The TEM patterns and **b** the HRTEM patterns of Pd/MOF 3% sample. **c**, **d** The size distribution for Pd NPs of Pd/MOF 3% sample The X-ray diffraction (XRD) patterns of the pure UiO-66 and Pd/MOF are exhibited in Fig. [3](#Fig3){ref-type="fig"}. It is clearly shown that diffraction peaks are well indexed to other works, which indicated the MOF was successfully synthesized \[[@CR43]\]. Moreover, it have been reported that the UiO-66 framework is stable in water, benzene, ethanol, and DMF, as well as in a strong acid (HCl) solution and a strong base (NaOH) solution where it still maintains an appreciable degree of crystallinity \[[@CR43]\]. The patterns in Fig. [3](#Fig3){ref-type="fig"} showed that the crystallinity of UiO-66 did not change after adding the Pd nanoparticles, which manifested the Pd nanoparticles have not destroyed the chemical structure of the framework. Therefore, the UiO-66 as a photocatalyst carrier is feasible and the stable production of hydrogen can be expected by water splitting using solar energy in the TEOA aqueous solution. In addition, the diffraction peaks of Pd were not observed in patterns because of low load, quantum size, and good dispersion.Fig. 3The X-ray diffraction (XRD) patterns of pure UiO-66, Pd/MOF 1%, Pd/MOF 3%, and Pd/MOF 5% The Fourier transform infrared spectra (FTIR) of samples are showed in Fig. [4](#Fig4){ref-type="fig"}. The appeared shark peaks at 1585 and 1400 cm^−1^ are ascribed to the in- and out-of-phase stretching modes of the carboxylate group. Concretely, the peak at 1585 cm^−1^ is associated with C--C in the aromatic compound of the organic linker, and the peak at 1400 cm^−1^ is due to C--O root in C--OH of carboxylic acid. The peak at 659 and 746 cm^−1^ are associated with the O--H bending and Zr--O modes, respectively. Moreover, the peak at 552 cm^−1^ which is associated with Zr--(OC) symmetric stretching and the peak at 546 cm^−1^ which is associated with Zr--(OC) asymmetric stretching appeared at lower frequencies. In addition, the positions of each peak in all samples were not changed, indicating that the introduction of Pd nanoparticles did not destroy the chemical structure of UiO-66 \[[@CR51]\].Fig. 4The Fourier transform infrared spectra (FTIR) of pure UiO-66, Pd/MOF 1%, Pd/MOF 3%, and Pd/MOF 5% The BET specific surface area (*S* ~BET~) and the pore size distributions for samples were calculated by nitrogen adsorption--desorption isotherm measurements (Fig. [5](#Fig5){ref-type="fig"}). The pore size distributions were obtained by using desorption data by the BJH method. As shown in Table [1](#Tab1){ref-type="table"}, it shows that the *S* ~BET~ of pure UiO-66 is 791.6141 m^2^/g. After introducing Pd nanoparticles, the *S* ~BET~ of the composite catalysts are increase in varying degrees. The sample of Pd/MOF 3% shows the largest *S* ~BET~, which contributes to adsorption of dye molecule. In particular, the *S* ~BET~ is decreased when the Pd nanoparticles continue to increase (Pd/MOF 5%, 838.9649 m^2^/g).Fig. 5The N~2~ adsorption--desorption isotherms of pure MOF, Pd/MOF 1%, Pd/MOF 3%, and Pd/MOF 5% Table 1The *S* ~BET~, pore volume, and pore diameter of the four samplesSamples*S* ~BET~ (m^2^/g)Pore volume (cm^3^/g)Pore diameter (nm)Pure MOF791.61410.41622.1035Pd/MOF 1%843.01730.44512.1121Pd/MOF 3%847.43500.47752.2539Pd/MOF 5%838.96490.45242.1568 X-ray Photoelectron Spectroscopy Patterns of Pd/MOF 3% {#Sec11} ------------------------------------------------------ In order to determine the chemical composition and identify the chemical state of the elements in the sample, XPS spectra are also presented in Fig. [6](#Fig6){ref-type="fig"}. Specifically, all the peaks corresponding to the Zr, Pd, O, and C elements can be detected in Fig. [6](#Fig6){ref-type="fig"}a. Moreover, the high-resolution spectrum of the sample shows two peaks at 333.7 and 347.2 eV, which could be ascribed to Pd 3d and Zr 3p of metallic Pd. Those results demonstrated metallic Pd has been successfully deposited on the UiO-66 framework by reducing agent of NaHP~4~, which was in accordance with the previous results.Fig. 6**a**, **b** X-ray photoelectron spectroscopy (XPS) patterns of Pd/MOF 3% The UV-Vis Absorption Spectra {#Sec12} ----------------------------- It was already reported that the conduction band of UiO-66 was −0.6 V vs. normal hydrogen electrode (NHE), and this is more negative than the redox potential of H^+^/H~2~(−0.4 V vs. NHE, pH = 7). It proved that the original UiO-66 has the potential to produce hydrogen by water splitting \[[@CR42]\]. However, Fig. [7](#Fig7){ref-type="fig"} showed that the pure UiO-66 is a white powder with absorption band edge of only 300 nm and the Pd/MOF band edge of optical absorption has any evident changes after adding metallic Pd, as a result, all of the bare MOF and Pd/MOf could not produce hydrogen by water splitting in the visible-light region. In order to resolve this issue, EY was employed for increasing the region of absorption. It is known that EY is a photosensitizer, which could absorb visible light. Therefore, photocatalytic water splitting for hydrogen production using visible light is entirely feasible.Fig. 7The UV-vis absorption spectra of pure UiO-66, Pd/MOF 1%, Pd/MOF 3%, and Pd/MOF 5% The Photocatalytic Activities of Different Catalysts for Hydrogen Evolution {#Sec13} --------------------------------------------------------------------------- The process of photocatalytic activities for hydrogen evolution have been designed and implemented, which used TEOA (pH 10) as a sacrificial donor under visible-light irradiation (*λ* ≥ 420 nm) and introduced EY as a photosensitizer. The time courses of H~2~ evolution over different catalysts indicated that only trace amount of H~2~ was detected (only 0.03 mmol after 4-h irradiation) in the pure UiO-66, which is due to the electron of excited EY which could not outright react with H^+^ in the absence of metallic palladium. With the addition of different amounts of Pd nanoparticles, the photocatalytic hydrogen production increased in different degrees. 3.24 mmol of H~2~ was produced after 4 h of irradiation with 1% Pd loaded to MOF. It suggested that Pd was an active species for H~2~ production. Furthermore, when 3% Pd was loaded to MOF, 9.43 mmol of H~2~ evolution evolved, which attributes to more active sites obtained. However, 6.06 mmol of H~2~ evolution was produced after loading 5% Pd, in which because superfluous Pd nanoparticles covered the surface of UiO-66, the absorption of dye molecules on UiO-66 was hindered. We tested the adsorption of different dyes on the catalyst. The experimental results were consistent with the BET testing data. The sample of Pd/MOF 3% showed the maximum dye adsorption (39.7 μmol/g) (Table [2](#Tab2){ref-type="table"}). The affinity of metal Pd and UiO-66 for dye molecules is different, so excessive Pd loading to surface of UiO-66 prevents adsorption of the dye molecule. On the other hand, the sample Pd/MOF 5% exhibited a reduced *S* ~BET~, which may also lead to a decrease in the amount of dye adsorbed.Table 2The adsorption of eosin Y on various samplesSamplesUio-66Pd/MOF 1%Pd/MOF 3%Pd/MOF 5%Amount of adsorbed eosin (μmol/g)30.134.339.734.6 Effect of the pH on the Photocatalytic Activity Pd/MOF 3% of (10 mg) for Hydrogen Evolution (Reaction Time 5 h) {#Sec14} --------------------------------------------------------------------------------------------------------------- The solution pH had significant influence on photocatalytic activity (Figs. [8](#Fig8){ref-type="fig"} and [9](#Fig9){ref-type="fig"}) \[[@CR52]\]. Different pH values of the solution were studied from 5 to 11. It can be distinctly seen that the rate of hydrogen evolution maximized at pH 7 (18.10 mmol), while the rate of H~2~ evolution was decreased under both more acidic and more alkaline TEOA aqueous solutions. The rate of hydrogen evolution was only 0.78 mmol at pH 5 because of the protonation of TEOA at acidic pH, which resulted in a shorter lifetime and efficiency of excited EY, and the rate of hydrogen evolution was decreased. However, the activity of the photocatalyst exhibited a decrease following increase of the basicity. This is because the strong alkaline conditions reduce the concentration of H^+^ and lead to a decrease in the kinetics of hydrogen production.Fig. 8The photocatalytic activities of pure MOF, Pd/MOF 1%, Pd/MOF 3%, and Pd/MOF 5% for hydrogen evolution Fig. 9Effect of the pH on the photocatalytic activity of Pd/MOF 3% (10 mg) for hydrogen evolution (reaction time 5 h, EY 20 mg) The Stability Testing for the Sample of Pd/MOF 3% in the Dye-Sensitized Photocatalytic System {#Sec15} --------------------------------------------------------------------------------------------- In order to verify the stability of the system, a stability test was carried out. The stability experiment was carried out in TEOA aqueous solution adding EY as sensitizer. As shown in Fig. [10](#Fig10){ref-type="fig"}, the experiment was implemented in four stages. In the first cycle, the hydrogen production rate increased persistently in 5 h, which is because the dye has played a key role in the first cycle of reaction. In the second cycle, the N~2~ is used to replace the gas in the reaction system without any additional dyes. At this stage, hydrogen production is reduced, which is due to the dye that was degraded with the reaction time increasing. In the third stage, the N~2~ replacement gas is used as the second stage and no dye is added. At this stage, the hydrogen production decreased continuously, and this was mainly due to the addition of degraded dyes. In the fourth stage, the gas in the reaction system was substituted with N~2~ and added to EY (20 mg). At this stage, the yield of hydrogen is markedly recovered compared to the third phase, which is due to the eosin that was added. The above results show that the prepared Pd/MOF 3% catalyst has excellent properties, and the stability of the dye-sensitized system needs to be improved, which is also the focus of the next step.Fig. 10The stability testing for the sample of Pd/MOF 3% in the dye-sensitized photocatalytic system Photoluminescence (PL) Analysis {#Sec16} ------------------------------- In order to investigate the transfer of photo-generated electrons, the photoluminescence quenching of EY were examined. As shown in Fig. [11](#Fig11){ref-type="fig"}, the dye EY showed up a maximum emission wavelength of 537 nm when the excitation wavelength was 460 nm. After the addition of UiO-66, the intensity of the maximum excitation wavelength did not obviously change, but the fluorescence intensity of the maximum emission wavelength was reduced in different degrees after adding different Pd/MOF samples. This indicates that Pd particles play a key role in the electron transfer of the system. When the Pd/MOF 3% was added, the fluorescence intensity was the lowest, which proved the best separation effect of photogenerated electron hole. This result was in accordance with the time courses of hydrogen evolution by different catalysts. When Pd nanoparticles have been introduced, the photo-generated electrons in UiO-66 could rapidly transfer to Pd. Thus, they exhibited a sharp decrease in emission intensity of EY.Fig. 11Fluorescence spectra of the EY-sensitized MOF, Pd/MOF 1%, Pd/MOF 3%, and Pd/MOF 5% samples in 15% (*v*/*v*) TEOA aqueous solution at pH 10 The Photoelectric Performance Testing {#Sec17} ------------------------------------- In order to further study the electron transfer process in the system, the photoelectric property of the dye-sensitized photocatalytic hydrogen production system was also tested. Figure [12](#Fig12){ref-type="fig"}a is the instantaneous photocurrent--time curves for samples of pure MOF, Pd/MOF 1%, Pd/MOF 3%, and Pd/MOF 5%. It shows that the photocurrent density of pure MOF is lowest under visible light. When the Pd nanoparticles were loaded onto MOF, the photocurrent density increased markedly, and when the 3% Pd was introduced, the photocurrent density reached the maximum. The superior specific surface area of MOF material is favorable for the adsorption of a large number of dye molecules. Under visible-light irradiation, dye EY is excited to form an excited state and then the excited state EY molecule is quenched by TEOA to form a strong reducing EY^−^·. EY^−^· can rapidly deliver electrons to the MOF and then participate in the reactions. However, electrons cannot be rapidly involved in the transfer process, resulting in the loss of a large number of electrons. Thus, a single MOF shows very low photocurrent densities and hydrogen production activity. Pd nanoparticles serve as an electron outlet, enabling the rapid transfer of large amounts of electrons to the MOF surface and thereby enhancing the photocurrent density and hydrogen production. The photoelectric test results are in good agreement with the hydrogen production kinetics, and it proved that the Pd nanoparticles can indeed enhance the photocatalytic activity of MOF.Fig. 12**a** Transient photocurrent responses for samples of MOF, Pd/MOF 1%, Pd/MOF 3%, and Pd/MOF 5% in 0.2 M Na~2~SO~4~ aqueous solution under visible-light irradiation (*λ* ≥ 420 nm) at 0.4 V vs. SCE. **b** Linear sweep voltammograms of MOF, Pd/MOF 1%, Pd/MOF 3%, and Pd/MOF 5% in 0.2 M Na~2~SO~4~ aqueous solution under visible-light irradiation (*λ* ≥ 420 nm) Figure [12](#Fig12){ref-type="fig"}b is a linear voltammetric scan for the samples. As can be seen from the diagram, a weak current response is found on the FTO at the lower voltage, which is due to the cathodic current produced by the reduction of H^+^ to H~2~ under severe negative pressure. At the same voltage, the sample adding Pd showed a higher current response than the pure MOF. Especially after 3% of the Pd was added to MOF, the sample Pd/MOF 3% showed the most prominent current response. These results are in good agreement with the above test results. It proved that Pd nanoparticles can significantly enhance the hydrogen production activity of MOF in dye-sensitized photocatalytic system. Speculation on the Mechanism for H~2~ Evolution {#Sec18} ----------------------------------------------- Based on the above results, the possible mechanism of photocatalytic hydrogen evolution in EY-sensitized system can be explained in Scheme [1](#Sch1){ref-type="fig"}. The large specific surface area of UiO-66 is beneficial to the adsorption of dye molecules. Firstly, a large number of EY molecules were adsorbed onto the surface of UiO-66 by physical adsorption. Then, the ground state of EY absorbs light photo to form singlet excited state EY^1\*^under visible-light irradiation. Singlet excited EY^1\*^ rapidly produces the lowest lying triplet excited state EY^3\*^ via an efficient intersystem crossing (ISC). In the case of existing TEOA as a sacrificial donor, EY ^3\*^can be reductively quenched and can produce EY^−·^. Subsequent electron transfer can be obtained by comparing the energy levels. It has been reported that the reductive potential of EY^−·^ is −0.8 V vs. NHE, and the conduction band of UiO-66 is −0.6 V vs. NHE. Therefore, the electrons can actively transmit from EY^−·^ to UiO-66. The accumulated electrons on UiO-66 frameworks will transfer to the Pd nanoparticles, and finally, H^+^ obtains electrons from Pd to form hydrogen. UiO-66 can function as an excellent electron acceptor and transporter to efficiently prolong the lifetime of charge carriers. Consequently, it improves the charge separation efficiency and the catalytic H~2~ evolution activity of the Pd/MOF. The UiO-66 has extremely large surface area and well-order porous structures and channels and is conducive to the electron transfer.Scheme 1Possible mechanism of photocatalytic hydrogen evolution in EY-sensitized system Conclusions {#Sec19} =========== The Pd/MOF catalysts were prepared by impregnation reduction. It is important that we have reasonably constructed the dye-sensitized system of Pd/MOF and successfully extended the application of MOF to the visible range. The Pd-loaded Zr-MOF was tested for efficient photocatalytic hydrogen production and exhibited maximal photocatalytic activity (9.1 mmol/g) under visible-light irradiation (*λ* ≥ 420 nm) with EY as a photosensitizer. The remarkable enhanced properties of which was carefully studied by means of XRD, TEM, HRTEM, XPS, UV-vis diffuse reflectance, and photocatalytic hydrogen production. The results are consistent with each other. The activities of photocatalytic hydrogen production was enhanced twice order of magnitude compared with the pure MOF (0.09 mmol/g). The promotion of photocatalytic hydrogen evolution activity should be attributed to the utilization of the longer wavelength visible light and a great electronic transmission capacity of MOF. The synergistic effect between Pd and Zr-MOF is corroborated by photo-luminescence spectra and electro-chemical and photo-electro-chemical experiments, which demonstrated that the charge separation and the electron transfer are more efficient with the aid of Pd. The possible mechanism had been presented. The EY was employed for increasing absorb band gap of irradiation. UiO-66 could accept and transport electron and contribute to prolong the lifetime of charge carriers. Pd as an active species significantly enhanced the photocatalytic activity for hydrogen evolution. This work was financially supported by the Chinese National Natural Science Foundation (41663012 and 21263001). HY and ZJ conceived and designed the experiments. HY performed the experiments. ZJ and HY analyzed the experimental data and characterize data. HY wrote the paper. Both authors read and approved the final manuscript. Competing Interests {#FPar1} =================== The authors declare that they have no competing interests. Publisher's Note {#FPar2} ================ Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

2024-02-01T01:26:28.774034

https://example.com/article/3323

Q&A: Archie Hewlett, founder of Duke & Dexter Duke & Dexter founder, Archie Hewlett, shares the story of his three-year-old brand, explaining why he offers customers the ability to personalise their shoes. ER: Give us a short history of the brand. AH: Duke & Dexter is a British born footwear label, I launched when I was only 19. Now three years old, it specialises in premium shoes for those who appreciate modern, functional and spirited apparel. Designed in London and handcrafted in England, we choose to innovate the conventional whilst working off traditional styles, through offering an array of colours, textures, prints and motifs, while never faltering on exceptional comfort to accommodate a contemporary lifestyle. Fusing global inspiration with British charm, we build bold, personal collections for those who strive to create their own look, rather than following the latest seasonal fashion. Our typical clients are aged between 20-35. ER: Is personalisation a new venture or has it been part of the brand from the beginning? AH: The bespoke element has always been something we wanted to focus on, but it has truly come into fruition with the move to hand make each pair in England. Because of our craftsmen's advanced ability in embroidery, it’s something we felt should be pushed to the forefront of the business. That quality and old-school technique is rarely seen nowadays. For our clients, we feel this genuine take on personalisation is really appreciated and it’s a nice element to showcase traditional British talent. It's something we’re very proud of. What technology do you use to ensure customers can personalise their products? We have an online bespoke platform where clients can choose their upper and trim colours alongside the option to initial or motif a product. From there a member of our design team will send a mock up and on confirmation from the client, we alert our workshop. ER: Is personalisation scalable? AH: As the company expands, of course there will have to be a rethink on strategy and manpower. However, one of the founding values of Duke & Dexter was to never compromise on quality, whilst also providing attractive price points and this is how we will continue, regardless of our size. We have a very talented team who know the industry well and are masters of their craft, so there will never be a pair which isn’t given the same amount of time and dedication. ER: Why do your customers want individual products? AH: Why wouldn’t they? For such a huge market it’s amazing to see so many labels either repeat older trends or even imitate each other. Everyone has their own taste and style which is individual to them and that’s what makes the fashion world great. But we are really trying to create timeless pieces which people love and will wear throughout the seasons. We're trying to provide more depth to our products. From global inspiration, which is diarised in our social media, right through to products being handmade in our workshop. ER: What’s been the biggest technology impact to your brand? AH: Probably artificial intelligence. It’s much easier to align your business and goals when you have a clearer idea of who your clients are! Instagram has also been a huge element to brand development and exposure and we do spend a lot of time perfecting the visuals we feel best represent what we’re doing. Unless you have the product in front of you, it’s tricky to portray the extent of work and thought that goes into perfecting each pair. ER: How do expect to use technology in the future? AH: There’s a play with our company on keeping things traditional and testing new technological developments. It’s also an ambiguous question because we never know what we be the next best platform or vice to take us to the next stage. In respect to our online store and presence, there will no doubt be extra add-outs we look to include. However, for our manufacturing, we will always strive to keep hand craftsmanship the primary technique of production.

2024-07-03T01:26:28.774034

https://example.com/article/5577

Q: How to enable Assembly Language support in Visual Studio 2015 I installed Visual Studio 2015 Community and want to use Assembly Languege in 32bit mostly. A: Despite what sanaris said, it IS possible to build masm using VS2015. However this is a trick you have to know. You will need to right click on the project (not the solution) and select "Build Dependencies/Build Customizations". From there, check the "masm" box. That's it. Now asm files will be built using ml and linked in to your executable as expected. Note that this is basically the sames as the instructions for VS2010, except that there is one more layer of menu (must look under Build Dependencies). If you already have asm files added to your project, they probably got added as "Does not participate in build." You can either remove/re-add them, or right click on the file and change the "Item Type" to "Microsoft Macro Assembler."

2023-12-21T01:26:28.774034

https://example.com/article/2121

USGA AWARDS Honorees Take Stage at USGA Service Awards February 8, 2014 By USGA Michael Cumberpatch received the 2014 Joe Dey Award at the USGA Service Awards at the Pinehurst Resort & Country Club. (USGA/Chris Keane) VILLAGE OF PINEHURST, N.C. – In celebration of the individuals and organizations that give back to the game, the United States Golf Association presented its annual Service Awards during a dinner on Saturday, February 8 at the Carolina Hotel in the Pinehurst Resort and Country Club. The newly created Service Awards dinner consolidated the presentation of many of the USGA’s most significant honors into a single event. The two-hour program interspersed award presentations, powerful videos and personal testimonials that delighted the more than 500 attendees representing a cross-section of the golf community. “This was the inaugural Service Awards in this format, and I can’t think of a better way to honor those who give back to the game,” said Thomas J. O’Toole Jr., USGA president. “We are proud to bring the golf community together to celebrate the great work of each of our Service Award winners. Their selfless dedication and contributions have made a significant impact on the USGA and our mission to serve the game.” Serving as emcee for the evening was Tim Rosaforte, Golf World senior writer and Golf Channel/NBC commentator. “It was a pleasure to host this special evening and be among some longtime friends from across the golf industry,” said Rosaforte. “I appreciate the invitation from the USGA and think they did a great job in revising the format of their service award presentations.” The following awards were presented during the evening’s program: Green Section Award Presented annually since 1961, the USGA Green Section Award recognizes an individual’s distinguished service to the game of golf through his or her work with turfgrass, including research, maintenance and other areas that positively impact the arena upon which golf is played. The 2014 recipient of this award is Dr. Peter Dernoeden, of Milton, Del., a nationally recognized turfgrass researcher and educator and professor emeritus of plant science and landscape architecture at the University of Maryland’s College of Agriculture and Natural Resources. Over the course of an extensive career, he led the design and management of turfgrass research programs focusing on weed and disease control, integrated pest management and sustainable fescue species. In 1999, he was responsible for the discovery of a new pathogen and disease that affects creeping bentgrass. His work is widely recognized as having contributed significantly to the quality of turf on golf courses both regionally and nationally. Herbert Warren Wind Award Established in 1987, the Herbert Warren Wind Book Award recognizes and honors outstanding contributions to golf literature while attempting to broaden the public’s interest in, and knowledge of, the game of golf. Wind, who died in 2005, was the famed writer for The New Yorker and Sports Illustrated who coined the phrase “Amen Corner” at Augusta National. He is the only writer to win the USGA’s Bob Jones Award, the Association’s highest honor. Author Jeff Silverman’s “Merion: The Championship Story” is the 2013 recipient of the Herbert Warren Wind Book Award. This extensively researched and carefully crafted book explores every aspect of one of the most respected and beloved clubs in the game. Merion’s successful hosting of the 2013 U.S. Open, 32 years after it last hosted the championship, was the final chapter in Silverman’s work. The club has hosted more USGA championships (18) than any other, making it a rich subject for a work of this magnitude. Ike Grainger Awards Established in 1995 as part of the USGA’s Centennial Celebration, the Ike Grainger Award recognizes those volunteers who reach 25 years of service to the Association. Grainger served on the USGA Executive Committee and rose to become president from 1954-55. This year the award recognized 18 individuals for their distinguished service to the Association: Joe Dey Award Presented annually since 1996, the USGA's Joe Dey Award recognizes an individual's meritorious service to the game as a volunteer. The award is named after the late Joseph C. Dey Jr., who served as USGA executive director for 35 years, from 1934-69, and was later the first commissioner of the PGA Tour. Michael Cumberpatch, of Annapolis, Md., a tireless contributor to the game on local and national levels for 20 years, received the 2014 Joe Dey Award. Affiliated with the USGA since 1993, when he joined the Association’s Regional Affairs Committee, he has worked at 20 USGA championships, including the U.S. Open, U.S. Senior Open, U.S. Mid-Amateur and Men’s State Team Championships. He currently serves as the official-in-charge of U.S. Open Sectional Qualifying for the Washington, D.C., region. Beyond his dedication to the USGA and regional golf activities, Cumberpatch has provided extraordinary volunteer service to other organizations, including the Special Olympics and the U.S. Armed Forces. He is a past president of the Middle Atlantic Golf Association, where he earned recognition for his efforts to bring together neighboring golf associations and for instilling a sense of community with USGA committee members in the region. The Middle Atlantic PGA Section presented him with the David Wortman Citizen of the Year Award in 2009. The 2015 USGA Annual Meeting will take place at the Waldorf-Astoria Hotel in New York, N.Y. More from the USGA USGA PARTNERS American Express Together, American Express and the USGA have been providing world-class service to golf fans since 2006. By creating interactive U.S. Open experiences both onsite and online, American Express enhances the USGA’s effort to make the game more accessible and enjoyable for fans. For more information on American Express visit www.americanexpress.com/entertainment Deloitte As a strategic partner, Deloitte delivers thought leadership, business knowledge and innovation concepts to help the organization better serve the game and its constituents. Together, Deloitte and the USGA created a transformative strategy that responds to the needs of today’s game, deepens engagement in the golf community, and empowers people to connect in new ways. In addition to its professional services work with the USGA, Deloitte supports USGA initiatives and championships, including programs that celebrate volunteerism, and promote inclusion and innovation in and beyond the golf community. Lexus is committed to partnering with the USGA to deliver a best-in-class experience for the world’s best golfers by providing a fleet of courtesy luxury vehicles for all USGA Championships. At each U.S. Open, Women’s Open and Senior Open, Lexus provides spectators with access to unique experiences ranging from the opportunity to have a picture taken with both the U.S. Open and U.S. Women’s Open trophies to autograph signings with legendary Lexus Golf Ambassadors in the Lexus Performance Drive Pavilion. Rolex has been a longtime supporter of the USGA and salutes the sportsmanship and great traditions unique to the game. This support includes the Rules of Golf where Rolex has partnered with the USGA to ensure golfers understand and appreciate the game.As the official timekeeper of the USGA and its championships, they also provide clocks throughout host sites for spectator convenience. For more information on Rolex and their celebration of the game, visit the Rolex and Golf homepage.

2024-07-10T01:26:28.774034

https://example.com/article/8489

/* * Copyright (C) 2016 Felix Fietkau <nbd@nbd.name> * * Permission to use, copy, modify, and/or distribute this software for any * purpose with or without fee is hereby granted, provided that the above * copyright notice and this permission notice appear in all copies. * * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. */ #include <linux/delay.h> #include "mt76x2.h" #include "mt76x2_trace.h" void mt76x2_set_irq_mask(struct mt76x2_dev *dev, u32 clear, u32 set) { unsigned long flags; spin_lock_irqsave(&dev->irq_lock, flags); dev->irqmask &= ~clear; dev->irqmask |= set; mt76_wr(dev, MT_INT_MASK_CSR, dev->irqmask); spin_unlock_irqrestore(&dev->irq_lock, flags); } void mt76x2_rx_poll_complete(struct mt76_dev *mdev, enum mt76_rxq_id q) { struct mt76x2_dev *dev = container_of(mdev, struct mt76x2_dev, mt76); mt76x2_irq_enable(dev, MT_INT_RX_DONE(q)); } irqreturn_t mt76x2_irq_handler(int irq, void *dev_instance) { struct mt76x2_dev *dev = dev_instance; u32 intr; intr = mt76_rr(dev, MT_INT_SOURCE_CSR); mt76_wr(dev, MT_INT_SOURCE_CSR, intr); if (!test_bit(MT76_STATE_INITIALIZED, &dev->mt76.state)) return IRQ_NONE; trace_dev_irq(dev, intr, dev->irqmask); intr &= dev->irqmask; if (intr & MT_INT_TX_DONE_ALL) { mt76x2_irq_disable(dev, MT_INT_TX_DONE_ALL); tasklet_schedule(&dev->tx_tasklet); } if (intr & MT_INT_RX_DONE(0)) { mt76x2_irq_disable(dev, MT_INT_RX_DONE(0)); napi_schedule(&dev->mt76.napi[0]); } if (intr & MT_INT_RX_DONE(1)) { mt76x2_irq_disable(dev, MT_INT_RX_DONE(1)); napi_schedule(&dev->mt76.napi[1]); } if (intr & MT_INT_PRE_TBTT) tasklet_schedule(&dev->pre_tbtt_tasklet); /* send buffered multicast frames now */ if (intr & MT_INT_TBTT) mt76_queue_kick(dev, &dev->mt76.q_tx[MT_TXQ_PSD]); if (intr & MT_INT_TX_STAT) { mt76x2_mac_poll_tx_status(dev, true); tasklet_schedule(&dev->tx_tasklet); } if (intr & MT_INT_GPTIMER) { mt76x2_irq_disable(dev, MT_INT_GPTIMER); tasklet_schedule(&dev->dfs_pd.dfs_tasklet); } return IRQ_HANDLED; }

2024-03-04T01:26:28.774034

https://example.com/article/8026

--- a/build_system/build_files/common.mk +++ b/build_system/build_files/common.mk @@ -122,7 +122,7 @@ CC=$(COMPILER) LD=$(LINKER) AR=$(ARCHIVER) -CFLAGS+=-O2 +#CFLAGS+=-O2 PWD= $(shell pwd) --- a/build_system/build_files/OS/linux_2.6.mk +++ b/build_system/build_files/OS/linux_2.6.mk @@ -80,7 +80,7 @@ endif ifeq ($(OS_LEVEL), kernel_space) -CFLAGS+= +#CFLAGS+= endif

2023-11-28T01:26:28.774034

https://example.com/article/3110

Q: PHP Insert array into multidimensional array by using an array value I got arrays like this build upon data from a database representing single pages of a cms: $page = Array ( [title] => mein produkt [NavID] => 200 [parents] => Array ( [0] => 0 [1] => 3 [2] => 200 ) ) And I need to put that into an other multidimensional array like this representing the sitemap: $map = Array ( [NavID] => 0 [0] => Array ( [childs] => Array ( [1] => Array ( [title] => home [NavID] => 1 ) [2] => Array ( [title] => impressum [NavID] => 2 [childs] => Array ( [100] => Array ( [title] => startseite [NavID] => 100 [parents] => Array ( [0] => 0 [1] => 2 [2] => 100 ) ) ) ) [3] => Array ( [title] => produkte [NavID] => 3 ) ) ) ) As you see, I got the structure of the array as the array value on parents. So what I would do by hand is putting this like: $map[0]['childs'][3]['childs'][200] = $page; Put how can I select the multidimensional array with my array value $page['parents']? Thanks for helping me out. A: You can directly use $page['parents'][KEY] as keys when accessing $map values that way : $map[$page['parents'][0]]['childs'][$page['parents'][1]]['childs'][$page['parents'][2]] = $page; As your tree grows, I'd really suggest to shorten it with a direct variable : $par = $page['parents']; $map[$par[0]]['childs'][$par[1]]['childs'][$par[2]] = $page; To dynamically go to the correct node, just loop over your parents using references : $tmp = &$map; $first = true; foreach ($page['parents'] as $parent) { if ($first) { // Quick workaround to skip the first node without 'childs' key $tmp = &$tmp[$parent]; $first = false; continue; } $tmp = &$tmp['childs'][$parent]; } $tmp = $page;

2024-03-30T01:26:28.774034

https://example.com/article/9706

<?xml version="1.0" encoding="UTF-8"?> <beans xmlns="http://www.springframework.org/schema/beans" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation=" http://www.springframework.org/schema/beans http://www.springframework.org/schema/beans/spring-beans.xsd"> <!-- Spring容器初始化完成监听器 --> <bean class="com.zheng.common.listener.ApplicationContextListener"></bean> </beans>

2024-01-14T01:26:28.774034

https://example.com/article/3378

Q: How to replace text in R using regular expression? I have a vector of strings that looks something like this: c("abc@40gmail.com", "xyz@50gmail.com"). For some reason, there are random/different digits after the @ and I'm trying to remove them. Using regular expression, how can I tell R to remove or replace the digits that come after "@", so I end up with c("abc@gmail.com", "xyz@gmail.com"). I don't know much about Regex, so I'd really really appreciate if someone can provide not just the code, but also a brief explanation of the code. Thanks! A: One option is x <- c("abc@40gmail.com", "xyz@50gmail.com") sub("@\\d+", "@", x) ## [1] "abc@gmail.com" "xyz@gmail.com" A: You could use Positive lookbehind or \K sub("(?<=@)\\d+", "", x, perl=T) \\d+ matches one or more digits characters. So (?<=@) forces the regex engine to look immediate after to the @ symbol and then make it to match the following one or more digit characters. Since lookarounds belong to the PCRE family, you need to enable perl=TRUE parameter. OR sub("@\\K\\d+", "", x, perl=T)

2023-09-03T01:26:28.774034

https://example.com/article/2930

// ----------------------------------------------------------------------- // // // MODULE : DeathShroud.cpp // // PURPOSE : DeathShroud - Definition // // CREATED : 11/20/97 // // ----------------------------------------------------------------------- // #include <stdio.h> #include "DeathShroud.h" #include "cpp_server_de.h" #include "SoundTypes.h" BEGIN_CLASS(DeathShroud) ADD_REALPROP(RandomHitPoints, 0.0f) \ ADD_STRINGPROP(AIState, "IDLE") \ ADD_VECTORPROP_VAL_FLAG(Dims, 20.0f, 48.0f, 20.0f, PF_DIMS | PF_LOCALDIMS | PF_HIDDEN) END_CLASS_DEFAULT(DeathShroud, AI_Mgr, NULL, NULL) //static data member initialization DBOOL DeathShroud::m_bLoadAnims = DTRUE; CAnim_Sound DeathShroud::m_Anim_Sound; // ----------------------------------------------------------------------- // // // ROUTINE: // // PURPOSE: Constructor // // ----------------------------------------------------------------------- // DeathShroud::DeathShroud() : AI_Mgr() { m_fHearingDist = 3000.0f; m_fSensingDist = 3000.0f; m_fSmellingDist = 0.0f; m_fSeeingDist = 3000.0f; m_fWalkSpeed = 100.0f; m_fRunSpeed = 180.0f; m_fRollSpeed = 3.5f; m_fAIMass = AI_DEFAULT_MASS; _mbscpy((unsigned char*)m_szAIWeapon[0], (const unsigned char*)"SKULL"); m_nAIStrength = 5; m_nState = STATE_Idle; m_nLastState = STATE_Idle; m_dwFlags = 0; m_bCabal = DFALSE; // [blg] m_fAIHitPoints = 800; m_fAIRandomHP = 00; m_fAIArmorPoints = 200; _mbscpy((unsigned char*)m_szAIState, (const unsigned char*)"IDLE"); } // ----------------------------------------------------------------------- // // // ROUTINE: EngineMessageFn // // PURPOSE: Handle engine messages // // ----------------------------------------------------------------------- // DDWORD DeathShroud::EngineMessageFn(DDWORD messageID, void *pData, DFLOAT fData) { switch(messageID) { case MID_PRECREATE: { // Need to call base class to have the object name read in before // we call PostPropRead() DDWORD dwRet = AI_Mgr::EngineMessageFn(messageID, pData, fData); if(fData != PRECREATE_SAVEGAME) PostPropRead((ObjectCreateStruct*)pData); return dwRet; } break; case MID_INITIALUPDATE: { InitialUpdate((DVector *)pData); AI_Mgr::EngineMessageFn(messageID, pData, fData); VEC_SET(m_vScale, 1.5f, 1.5f, 1.5f); DDWORD dwFlags = m_pServerDE->GetObjectFlags(m_hObject); dwFlags &= ~FLAG_SHADOW; m_pServerDE->SetObjectFlags(m_hObject, dwFlags); CacheFiles(); return 0; } default : break; } return AI_Mgr::EngineMessageFn(messageID, pData, fData); } // ----------------------------------------------------------------------- // // // ROUTINE: PostPropRead() // // PURPOSE: Update properties // // ----------------------------------------------------------------------- // void DeathShroud::PostPropRead(ObjectCreateStruct *pStruct) { if (!pStruct) return; char* pFilename = "Models\\Enemies\\DeathShroud.abc"; char* pSkin = "Skins\\Enemies\\DeathShroud.dtx"; _mbscpy((unsigned char*)pStruct->m_Filename, (const unsigned char*)pFilename); _mbscpy((unsigned char*)pStruct->m_SkinName, (const unsigned char*)pSkin); } // ----------------------------------------------------------------------- // // // ROUTINE: InitialUpdate() // // PURPOSE: Handle initial update // // ----------------------------------------------------------------------- // DBOOL DeathShroud::InitialUpdate(DVector *pMovement) { m_pServerDE = BaseClass::GetServerDE(); if (!m_pServerDE) return DFALSE; if(m_bLoadAnims) { m_Anim_Sound.SetAnimationIndexes(m_hObject); m_Anim_Sound.GenerateHitSpheres(m_hObject); m_Anim_Sound.SetSoundRoot("sounds\\enemies\\DeathShroud"); m_bLoadAnims = DFALSE; } m_InventoryMgr.AddDamageMultiplier(0.5f); AI_Mgr::InitStatics(&m_Anim_Sound); //play ambient looping sound PlaySoundInfo playSoundInfo; PLAYSOUNDINFO_INIT( playSoundInfo ); playSoundInfo.m_dwFlags = PLAYSOUND_3D | PLAYSOUND_ATTACHED | PLAYSOUND_GETHANDLE | PLAYSOUND_REVERB; playSoundInfo.m_dwFlags |= PLAYSOUND_LOOP | PLAYSOUND_CTRL_VOL; _mbsncpy((unsigned char*)playSoundInfo.m_szSoundName, (const unsigned char*)"sounds\\enemies\\deathshroud\\de_loop_2.wav", _MAX_PATH ); playSoundInfo.m_hObject = m_hObject; playSoundInfo.m_nPriority = SOUNDPRIORITY_AI_MEDIUM; playSoundInfo.m_fOuterRadius = 1000; playSoundInfo.m_fInnerRadius = 1000 * 0.1f; playSoundInfo.m_nVolume = 50; g_pServerDE->PlaySound( &playSoundInfo ); m_hLoopSound = playSoundInfo.m_hSound; //fade the deathshroud DVector vColor; DFLOAT fAlpha = 0.0f; m_pServerDE->GetObjectColor(m_hObject,&vColor.x, &vColor.y, &vColor.z, &fAlpha); fAlpha = 0.90f; m_pServerDE->SetObjectColor(m_hObject,vColor.x,vColor.y,vColor.z, fAlpha); return DTRUE; } // ----------------------------------------------------------------------- // // ROUTINE : DeathShroud::MC_Fade // DESCRIPTION : Run an fade out/in animation // RETURN TYPE : void // ----------------------------------------------------------------------- // void DeathShroud::MC_Fade(DBOOL bFade) { if (m_bAnimating == DFALSE || m_nCurMetacmd != MC_TAUNT_BOLD) { DBOOL bRet = SetAnimation(m_pAnim_Sound->m_nAnim_TAUNT[4]); //SCHLEGZ 4/22/98 3:27:12 PM: if we can't stand up, crawl out from underneath if(!bRet) { SetNewState(STATE_CrawlUnderObj); return; } m_pServerDE->SetModelLooping(m_hObject, DFALSE); m_bAnimating = DTRUE; m_nCurMetacmd = MC_TAUNT_BOLD; if(bFade) { DDWORD dwFlags = m_pServerDE->GetObjectFlags(m_hObject); dwFlags &= ~FLAG_SOLID; m_pServerDE->SetObjectFlags(m_hObject, dwFlags); } } else { DVector vColor; DFLOAT fAlpha = 0.0f; m_pServerDE->GetObjectColor(m_hObject,&vColor.x, &vColor.y, &vColor.z, &fAlpha); if(bFade) { fAlpha -= 0.05f; if(fAlpha <= 0.5f) fAlpha = 0.5f; m_pServerDE->SetObjectColor(m_hObject,vColor.x,vColor.y,vColor.z, fAlpha); if(m_pServerDE->GetModelPlaybackState(m_hObject) & MS_PLAYDONE && fAlpha <= 0.5f) { m_bAnimating = DFALSE; Metacmd++; return; } } else { fAlpha += 0.05f; if(fAlpha >= 0.90f) fAlpha = 0.90f; m_pServerDE->SetObjectColor(m_hObject,vColor.x,vColor.y,vColor.z, fAlpha); if(m_pServerDE->GetModelPlaybackState(m_hObject) & MS_PLAYDONE && fAlpha >= 0.90f) { DDWORD dwFlags = m_pServerDE->GetObjectFlags(m_hObject); dwFlags |= FLAG_SOLID; m_pServerDE->SetObjectFlags(m_hObject, dwFlags); m_bAnimating = DFALSE; Metacmd++; return; } } } return; } // ----------------------------------------------------------------------- // // ROUTINE : DeathShroud::MC_Fire_Stand // DESCRIPTION : Run the energy blast, shockwave, or fire animation and effect // RETURN TYPE : void // ----------------------------------------------------------------------- // void DeathShroud::MC_Fire_Stand() { if (m_bAnimating == DFALSE || m_nCurMetacmd != MC_FIRE_STAND) { DBOOL bRet = SetAnimation(m_pAnim_Sound->m_nAnim_FIRE_STAND[8]); //SCHLEGZ 4/22/98 3:27:12 PM: if we can't stand up, crawl out from underneath if(!bRet) { SetNewState(STATE_CrawlUnderObj); return; } m_pServerDE->SetModelLooping(m_hObject, DFALSE); m_bAnimating = DTRUE; m_nCurMetacmd = MC_FIRE_STAND; } else { if(m_pServerDE->GetModelPlaybackState(m_hObject) & MS_PLAYDONE) { m_bAnimating = DFALSE; Metacmd++; return; } } return; } // ----------------------------------------------------------------------- // // ROUTINE : DeathShroud::MC_Dead // DESCRIPTION : Run death animation based on node hit // RETURN TYPE : void // ----------------------------------------------------------------------- // void DeathShroud::MC_Dead() { DVector vColor; DFLOAT fAlpha = 0.0f; m_pServerDE->GetObjectColor(m_hObject,&vColor.x, &vColor.y, &vColor.z, &fAlpha); if (m_bAnimating == DFALSE || m_nCurMetacmd != MC_DEAD) { if(m_hLoopSound) { m_pServerDE->KillSound(m_hLoopSound); m_hLoopSound = DNULL; } m_pServerDE->SetObjectColor(m_hObject,vColor.x,vColor.y,vColor.z, 1.0f); int nSideHit = m_damage.GetSideHit(); switch(m_damage.GetNodeHit()) { case NODE_NECK: m_nCorpseType = m_pAnim_Sound->m_nAnim_DEATH[0 + nSideHit]; break; case NODE_TORSO: m_nCorpseType = m_pAnim_Sound->m_nAnim_DEATH[1 + nSideHit]; break; case NODE_RARM: m_nCorpseType = m_pAnim_Sound->m_nAnim_DEATH[2 + nSideHit]; break; case NODE_LARM: m_nCorpseType = m_pAnim_Sound->m_nAnim_DEATH[3 + nSideHit]; break; case NODE_LLEG: m_nCorpseType = m_pAnim_Sound->m_nAnim_DEATH[4 + nSideHit]; break; case NODE_RLEG: m_nCorpseType = m_pAnim_Sound->m_nAnim_DEATH[5 + nSideHit]; break; } m_pServerDE->SetModelLooping(m_hObject, DFALSE); m_bAnimating = DTRUE; m_nCurMetacmd = MC_DEAD; } else { VEC_MULSCALAR(m_vScale, m_vScale, 0.9f); VEC_MULSCALAR(m_vDims, m_vDims, 0.9f); m_pServerDE->ScaleObject(m_hObject, &m_vScale); m_pServerDE->SetObjectDims2(m_hObject, &m_vDims); fAlpha -= 0.05f; if(fAlpha <= 0.0f) fAlpha = 0.0f; m_pServerDE->SetObjectColor(m_hObject,vColor.x,vColor.y,vColor.z, fAlpha); if(m_pServerDE->GetModelPlaybackState(m_hObject) & MS_PLAYDONE) { m_bAnimating = DFALSE; Metacmd++; m_bRemoveMe = DTRUE; } } return; } // ----------------------------------------------------------------------- // // ROUTINE : DeathShroud::ComputeState // DESCRIPTION : Compute actual substate // RETURN TYPE : void // ----------------------------------------------------------------------- // void DeathShroud::ComputeState(int nStimType) { int nStim = nStimType; if(nStimType == -1) nStim = ComputeStimuli(); if(!nStim) { switch(m_nState) { case STATE_Idle: SetNewState(STATE_Idle); break; case STATE_SearchVisualTarget: SetNewState(STATE_Idle); break; case STATE_SearchSmellTarget: SetNewState(STATE_Idle); break; default: SetNewState(STATE_SearchVisualTarget); break; } } else { SetNewState(STATE_AttackFar); } return; } // ----------------------------------------------------------------------- // // ROUTINE : DeathShroud::AI_STATE_AttackFar // DESCRIPTION : // RETURN TYPE : void // ----------------------------------------------------------------------- // void DeathShroud::AI_STATE_AttackFar() { DFLOAT fHeight = (DFLOAT)fabs(m_vTargetPos.y - m_MoveObj.GetPos().y); //SCHLEGZ 4/22/98 4:51:21 PM: sanity check if(m_hTarget == DNULL && m_nCurMetacmd != MC_FIRE_STAND) { if(fHeight <= m_vDims.y) SetNewState(STATE_SearchVisualTarget); else ComputeState(); return; } m_fStimuli[SIGHT] = VEC_DIST(m_MoveObj.GetPos(),m_vTargetPos); MC_FaceTarget(); Metacmd--; switch(Metacmd) { case 1: MC_Fade(DFALSE); break; case 2: if(m_fStimuli[SIGHT] <= (m_fSeeingDist * 0.66) || m_nCurMetacmd == MC_FIRE_STAND || fHeight > m_vDims.y) { MC_Fire_Stand(); } else { Metacmd++; } break; case 3: MC_Fade(DTRUE); break; case 4: if(m_fStimuli[SIGHT] <= (m_fSeeingDist * 0.33) || fHeight > m_vDims.y) Metacmd++; else MC_Walk(); break; case 5: ComputeState(); break; } return; } // ----------------------------------------------------------------------- // // // ROUTINE: CacheFiles // // PURPOSE: Cache resources used by the object // // ----------------------------------------------------------------------- // void DeathShroud::CacheFiles() { // Sanity checks... CServerDE* pServerDE = GetServerDE(); if (!pServerDE) return; if(!(pServerDE->GetServerFlags() & SS_CACHING)) { return; } if (!m_hObject) return; // Get the model filenames... char sModel[256] = { "" }; char sSkin[256] = { "" }; pServerDE->GetModelFilenames(m_hObject, sModel, 255, sSkin, 255); // Cache models... pServerDE->CacheFile(FT_MODEL, sModel); // Cache textures... pServerDE->CacheFile(FT_TEXTURE, sSkin); // Cache sounds... SetCacheDirectory("sounds\\enemies\\deathshroud"); CacheSoundFileRange("de_attack_", 1, 3); CacheSoundFileRange("de_idle_", 1, 3); CacheSoundFileRange("de_loop_", 1, 3); CacheSoundFileRange("de_pain_", 1, 3); CacheSoundFile("de_death_3verbed"); CacheSoundFile("flyskull"); }

2023-08-24T01:26:28.774034

https://example.com/article/2051

Nearly three quarters of businesses are optimised for mobile commerce according to Sage Pay e-Business Benchmark Report Almost three-quarters (73 per cent) of businesses are now optimised for mobile commerce with 18 per cent spending in excess of £1000 on the transition into mobile, according to a survey by the UK’s leading payment processor Sage Pay. Businesses are getting more prepared for m-commerce The survey of more than 1500 online businesses in the UK shows a steady rise in the past 12 months with more businesses championing mobile apps and optimisation. Large e-businesses were found to be rapidly adapting to the rise in mobile, with 22 per cent building mobile apps in the last year and 73 per cent choosing to optimise their sites for mobile commerce. Of those surveyed a quarter of app-enabled businesses are now seeing between 10-19 per cent of all sales coming via mobile devices, over half (56 per cent) of the respondents boasting apps said they were generating up to 10 per cent transactions through the add on. Sage Pay CEO Simon Black, said the findings show how the “pressure to stay at the cutting edge is driving UK e-commerce to new levels of sophistication”. Black added: “The results of the report prove that taking advantage of the mobile opportunity is critical to stimulating economic growth in the UK. With almost half of the businesses surveyed planning to introduce mobile apps in the coming months, Britain is poise for a bright future at the leading edge of mobile innovation.” In terms of social, Facebook continues to play a role in the evaluation of online commerce activities, although to a lesser extent than mobile. Of the respondents 15 per cent have a Facebook store with embedded payment pages, with only 36 per cent planning to set one up this year. Of the 24 per cent that don’t have Facebook, the main reason was lack of relevance to the business or perceived ability to generate sales.

2023-09-08T01:26:28.774034

https://example.com/article/6790

February 21, 2020 Calibrating Cash to Stocks Ratio We were recently asked, “When is the best time to invest in stocks?” The question goes deeper since the market has been lackluster since February 2018 and that there are major issues in the world such as the US and China trade war, US and Iran conflict, Hong Kong protests and the outbreak of the COVID-19 virus from Wuhan, China. The latter alone is expected to cut global GDP growth this year since China is the world’s biggest manufacturer of goods. It likewise threatens the health and lives of billions of people. We would like to ask you to check your pictures from five years ago back in 2015 and see what you’ve been doing and where you’ve gone to? We’re sure it was generally a better time than now. Now, you have doubts of travelling or even going to the nearest mall because of COVID-19. 2015 was also the year before the PSEi ran to new highs to 8,000 in 2016 and 9,000 in January 2018. That was a good stretch for gains from share price appreciation, a benefit that we don’t have in the last two years. So when is the best time to invest in stocks? Of course, it’s all the time. Among our tools is the cash to stocks ratio. It is just a ratio of what percentage of cash and stocks you hold. Right now, it is leaning close to minimal cash and majority stocks. The PSEi in our other tool, the PSEi Bands, is right there at the bottom of the bands where the market is oversold and ripe to pick up for medium to long term share price appreciation. In addition, the cash dividend yields now are so favorable you can make a portfolio generating near 5% yield. Do you know that investing now suits the 4% Rule wherein your principal investment generates 4% yield every year for your financial security in your lifetime? I know this is a very general explanation, and you can look up how the 4% rule works. Many bash it, but we’re part of the group that believes in it. There’s even a community of frugal savers and investors in the US that live by it led by Mr. Money Moustache. They live modest, simple and happy lives that we aspire to. The thing is that our tools are running optimally… on Normal Conditions. The thing is that times now are as extraordinary as in the Asian financial crisis of 1997 to 1998, the dot-com bubble aftermath and SARS outbreak of 2002 to 2003 and the global subprime crisis of 2008 to 2009. You can check out our previous article on Philippine stock market cycles by scrolling down below. This year may even be worse because COVID-19, which has now spread globally, puts health and lives directly at risk. Back in February 3 to 6, we let our lone Stocks Research Service client PNB Securities know about Rock Bottom PSEi levels during the three periods mentioned earlier. These are the times the PSEi fell below normal conditions and at what level they fell to in our bands. They were really low. This prompts us to calibrate our cash to stocks ratio for today’s extraordinary situation. We will be doing this for the first time as we only started in 2009. The PSEi, however, has hung just above our depressed low level. Maybe it is just buoyed by 2020 cash dividend season and may collapse later on in June. Since part of our Mission is minimizing risks, we are calibrating our cash to stocks ratio to 30% from nearly 0%. This added liquidity can be a buffer used to pick up stocks in case the PSEi falls to rock bottom levels this year. The effect of all the major issues mentioned earlier will be seen in 2H20. Right now, the market is basking in 4Q19 and 2019 results which are stronger. Updates on Our Philippine Stocks Research Service for Individual Investors We announced in our Twitter and Facebook accounts that this service we are currently building has evolved from an app to a community. This is a better platform since it is more personal and allows communication between us and clients. Our Mission is to Seek Value and to Minimize Risks in the Philippine Stock Market. Please let us know your suggestions for the service using the contact us box/email below in the Stocks Research Service Page. Target launch is March 2020. -oOo- Subscribe to our Philippine Stocks and Economic Research Service Package Solutions. Our service, based on the value-investing methodology, has been running for more than a decade. We specialize in the analysis, projections and valuations of stocks and stock markets. Seek Value and Minimize Risks in the Philippine Stock Market With Us. Disclaimer This report is solely for information. It should not be constituted as an offer for solicitation for the purchase or sale of securities mentioned. The information herein has been obtained from sources believed to be reliable. Whilst every effort has been made to ensure accuracy, we do not guarantee the accuracy or completeness of the report. All opinions and estimates expressed herein constitute our judgment as of this date made on a reasonable basis and are subject to change without notice. No liability can be expected for any loss arising from the use of this report or its contents. As this is general information, it does not have regard to the specific investment objectives, financial situation and the particular needs of any specific person who may obtain this report. Pictures in this report cannot be copied or redistributed and are owned by Corpecon Research.

2023-08-23T01:26:28.774034

https://example.com/article/8985

Gå aldri glipp av et godt tilbud! Hollywood The Golden-Age glamor image of Hollywood may not be as evident as it once was, however, its very name is synonymous with the entire movie industry. For this is the shrine to the movie industry: stars in the sidewalks, the sign, glorious old theaters, the places where the movie industry grew up. Most of the sights line up neatly along a 1-mile (1.6 km) stretch of Hollywood Boulevard between La Brea Avenue and Vine Street. Find your favorite stars along Hollywood Walk of Fame, the celestial sidewalk gallery on Hollywood Boulevard. At the grand entryway to Grauman's Chinese Theater, you can actually match your handprints and footprints of stars who've have had theirs embedded in cement. Other famous theaters include the Eyptian and El Capitan, all flamboyant icons from Hollywood's glitzy past.

2024-04-21T01:26:28.774034

https://example.com/article/3557

Starbreeze announces asymmetrical horror game Dead by Daylight Brothers: A Tale of Two Sons developer and Payday 2 publisher Starbreeze is partnering with developer Behaviour Interactive (Naughty Bear, Wet) to make an asymmetrical competitive horror game called Dead By Daylight. The premise pits four survivors against one killer in a game of cat and mouse. On paper it sounds very similar to the recently Kickstarted Friday the 13th game in which a player assumed the role of Jason Voorhees attempting to slay seven camp counselors. The difference with Dead by Daylight is that the killer plays from first-person, while the survivors have a third-person camera granting them more environmental awareness. The killer will be more powerful, however, with special abilities like swifter movement. They won't all be teen horror slashers either, as some monsters will be of a more paranormal nature. Stages will be procedurally-generated too, so you can't rely on the regular camping spots as you must scour the scenery for items to craft and traps to set. It's certainly a promising premise and while Behaviour's extensive track record is hit-or-miss, Starbreeze is fairly exacting in what projects it chooses to pick up. Definitely one to keep an eye on anyway.

2024-04-24T01:26:28.774034

https://example.com/article/3427

Q: How to make count with linq ASP.NET C# I´m trying to make this sql request SELECT number, COUNT(number) FROM Bet GROUP BY number ORDER BY COUNT(number) DESC; Code public static List<Apuesta> GetAllNumbers(ApplicationDbContext db) { List<Bet> bets = (from b in db.Bet select b.Number).Count(); return bets; } and i want to use it in one function using linq. A: To get the result you are trying to achieve you can project your query to an anonymous type: var bets =db.Bet.GroupBy(b=>b.Number) .Select(g=>new {Number=g.Key, Count=g.Count()}) .OrderByDescending(e=>e.Number); Or a DTO: public class BetDTO { public int Number{get;set;} public int Count{get;set;} } Then project your result using that custom class: var bets =db.Bet.GroupBy(b=>b.Number) .Select(g=>new BetDTO{Number=g.Key, Count=g.Count()}) .OrderByDescending(e=>e.Number) .ToList();

2024-07-11T01:26:28.774034

https://example.com/article/1198

Organic phosphorous insecticides have appeared after the Second World War, playing the leading role in the eradication of hazardous insects. However, the disadvantages of these materials, such as development of insect resistance, the considerable toxicity of the material to humans and cattle, and simultaneous eradication of natural enemies, have been noticed in recent years. The most effective and widely used organic phosphorous insecticides are: O,o-diethyl-O-(2-isopropyl-4-methyl-6-pyrimidyl)thionophosphate (referred to as Diazinon). PA1 O,o-dimethyl, .alpha.,.alpha.,.alpha.-trichloro-1-hydroxyethyl phosphonate (referred to as DEP). PA1 .alpha.-methoxy-4H-1,3,2-benzodioxaphosphorin-2-thione (referred to as Salithion. PA1 O,o-dimethyl S-(.alpha.-(ethoxycarbonyl)benzyl)phosphorodithioate (referred to as PAP). PA1 O,o-dimethyl S-(4-chlorophenyl) phosphorothioate (referred to as DMCP). Bacillus thuringiensis, a spore forming microorganism with crystalline parasporal bodies, has been employed commercially as a microbial insecticide for the control of insects such as species of the order Lepidoptera and certain flies and mites. B. thuringiensis and its use as an insect pathogen is described inter alia, in C. L. Hannay and P. Fitz-James, "The Protein Crystals of Bacillus thuringiensis Berliner", Can. J. Microb., I, 694-710 (1955); A. M. Heimpel, "A Critical Review of Bacillus thuringiensis var. thuringiensis Berliner and Other Crystalliferous Bacteria", Ann. Rev. Entomology, 12, 287-322, (1967). B. thuringiensis insecticides are quite specific and are harmless to non-susceptible orders of insects, and relatively safe to animals and man. "Endotoxin" is used by the art to define the toxicity associated with the water-insoluble crystals. "Exotoxin" denotes the so-called heat-stable, water-soluble fly toxin produced by Bacillus thuringiensis var. thuringiensis organisms. The water-soluble, heat-stable exotoxin was first reported in 1959 when its toxicity against the larvae of flies was noted. A review of the heat-stable exotoxin is contained in the previously mentioned article by A. M. Heimpel. This article summarizes the activity of the exotoxin (therein referred to as B.t. .beta.-exotoxin) and concludes that exotoxin is effective against insects belonging to some species of the orders "Lepidoptera, Diptera, Hymenoptera, Coleoptera, and Orthoptera". It is also reported that exotoxin affects insects only at molting or during metamorphosis. The probable chemical structure of Bacillus thuringiensis exotoxin has been elucidated by Bond et al., "A Purification and some Properties of an Insecticidal Exotoxin from Bacillus thuringiensis Berliner", R. P. M. Bond, C. B. C. Boyce and S. J. French, Biochem. J. (1969), 114, 477-488. The proposed structure is: ##STR1## Various processes are known for the production of exotoxin. All involve the fermentation of a Bacillus thuringiensis variety thuringiensis organism in a medium such as the following: ______________________________________ Ingredient Weight (%) ______________________________________ Cane Molasses 0.5 Beet Molasses 0.5 Cottonseed Oil Meal 2.0 Casein 1.0 Corn Steep Liquor 3.33 CaCO.sub.3 0.1 ______________________________________ The medium is adjusted to a pH of about 7.6 with ammonium hydroxide and then sterilized at about 120.degree. C. for about 15 minutes. The medium is inoculated with Bacillus thuringiensis var. thuringiensis and the fermentation is conducted for about 24 hours at about 30.degree. C. At the termination of the fermentation the cells in the broth are in the prespore stage of development and not more than about 1% of the total population contained spores. The final whole culture is screened through a 200 mesh screen and the resulting mixture of cells and liquor is concentrated at about 125.degree. F. with a vacuum of about 25 inches of mercury. Final drying and micropulverizing produced a 200 mesh powder which is characterized by a LD.sub.50 of 2.9 mg%. Another process for the production of both the exotoxin and endotoxin of Bacillus thuringiensis is proposed by Drake et al. U.S. Pat. No. 3,087,865. Drake et al. further disclose the precipitation of exotoxin from aqueous supernatant fermentation liquor by addition of calcium chloride. The calcium salt thus produced, as well as corresponding magnesium and barium salts, are disclosed to possess insecticidal activity. Other salts of .beta.-exotoxin which evidence insecticidal activity and may also be used in accordance with this invention are the copper, cadmium, manganese, tin, zinc, lead, cobalt, aluminum and iron salts.

2024-07-06T01:26:28.774034

https://example.com/article/6552

Last year's Blizzcon was tremendously popular. So much so that their servers were unable to handle the strain of fans competing for 15,000 available tickets. This year, Blizzard was more prepared; they made an additional 5,000 tickets available and set up a queue so that the transaction servers weren't overwhelmed. CEO Mike Morhaime said during the keynote address that if you weren't able to get into the queue within 30 seconds of its opening, the tickets were sold out before your turn came. Tens of thousands more chose to order the pay-per-view coverage, demonstrating the extraordinary enthusiasm felt for Blizzard's games. Their presentations didn't disappoint. Read on for details on the status of StarCraft II, Diablo III, World of Warcraft: Cataclysm, and the new Battle.net. It's divided into sections by game in case you're only interested in one or two of them. The big StarCraft II news this year wasn't so much about the first installment, Wings of Liberty, as it was about two of the major features shipping with the game: the editor and Battle.net. Both look to be extremely powerful, and they're being given the same level of care and polish you'd expect from the game proper. Still, the devs spoke a little bit about their philosophy and vision for the game. One of the major themes is making sure the player has options. When selecting missions in the single-player campaign, players can choose from several different paths to advance the main plot. There are also optional missions; you can choose to skip them if you want, or you can finish them to open up new units that you wouldn't have access to otherwise. Even within missions themselves, Blizzard wants to give you different ways to get the job done. One example they gave was an escort mission where you're shown the path some escaping civilians will be taken, so you can plan out how you want to prepare for attacks and decide how many resources to commit at a particular time. Another mission features high terrain surrounded by low terrain. Zerg attack frequently, and every so often, lava rises out of nearby crevasses and floods the low terrain. The goal of the mission is to build up a certain amount of money, which puts a new spin on resource planning. Spending a lot of money to fight off the Zerg goes contrary to the mission objective, but spending too little has its own risks. You can also decide to be as aggressive or as cautious as you want when playing chicken with the lava. Harvesting those extra few minerals can make a huge difference if you time it well enough. This leads into another major theme: keeping all the missions unique and interesting. Even with the brief look at the single-player campaign that we've already seen, there are several cool new mechanics that make the game more than "build up an army and smash the other army" thirty times in a row. It'll do great things for replayability, and I think it will make the single-player portion of the game stand on its own more than in the original StarCraft. Solo-play in RTS games is often referred to as "training" for multi-player, but Blizzard doesn't look at it this way; the missions are far too unlike PvP to be useful in that regard. Instead, they've added what they call "Challenges," which do train you for common PvP scenarios. There will be mini-missions for things like maximizing your economy, learning how to counter particular units, or using micro-management skills to take out a superior force. You'll be able to keep trying, improve your scores, and track your performance — thanks to the new Battle.net. Battle.net is shaping up to be a really impressive addition. Match-making is at the heart of it, but calling it simply a match-making system doesn't really do it justice. Communication, stat-tracking, and mod-sharing are also central to the new platform. Players will be able to create friends lists that span the different games, allowing somebody in World of Warcraft to talk with somebody playing Wings of Liberty. They're rolling out what is essentially an integrated IM client with all the features you'd expect for keeping track of people and conversations — multiple frames, online/offline notices, setting an alias for somebody, etc. I think it'll be an incredible boon for multi-player when people are able to look for groups in one game while playing another. Blizzard also made sure to mention that they were aware of the privacy concerns involved in such a system, and they'll be implementing controls to let you limit the amount of information you share. The new system also supports looking at your performance in myriad ways. When reviewing a game, you'll be able to see how the players' economies developed, what their build orders were, unit production, battle details, and more. What's more, you'll get a much more useful replay system, allowing you to fast-forward, rewind, jump to particular points in the game, view from different places, and look at stats as they're being accumulated. In addition to this is a full achievement system with a ton of things to unlock and show off. One of the coolest parts is the ability to unlock and choose artistic decals which will then be rendered on your units in-game. But, of course, the matchmaking system itself can't be overshadowed. Their goal when designing it was to give a competitive experience to as many people as possible, and it looks like they've found a way. As you play against other people and start to accumulate wins and losses, you are put in a League with players of a similar skill level. There are seven Leagues: Pro, Platinum, Gold, Silver, Bronze, Copper, Practice. The Leagues are broken down further into Divisions, which include opponents even closer to your skill level. Divisions are limited to 100 people. Players will be ranked against others in their Division, and there will be seasons of play. Tournaments held at the end of the season will determine Division winners, who can complete for the League championship. The idea is that everyone should be paired against people of their own skill level as much as possible, and everyone should have a reasonable chance of winning their division — even the most hopeless of casuals. Speaking of which — for the truly new (or truly terrible), there will be a few maps designed specifically to be "anti-rush" so that they can learn the basics without fear of being immediately crushed. Another significant fact to keep in mind is that these ratings will be tied to Battle.net accounts, which will require the purchase of a Blizzard game to use. This allows for two great new controls: first, people will be much less likely to try cheating, since they can't just register a new account for free. Second, your game rating is tied to your account, so the problem of "smurfing" — when highly-skilled players make a new account for the sole purpose of being matched against (and then demolishing) newer players — is neatly eliminated. Providing meaningful, interesting matches to every player will go a long way toward a thriving, sustainable PvP community. Also, the rating system will apply to co-op match-making as well. Each team of players has its own rating, so you don't have to worry about dropping in the standings if you want to goof off with your friends in 3v3. Speaking of co-op, the match-making and game creation system has been streamlined in that regard as well. It's simple to, for example, join up with one friend and then drop into a 3v3 or 4v4 game as a group of two. You also don't have to jump through hoops to get your friends in a game and select settings before letting random people in to fill the extra slots. The last major feature of the new Battle.net is the support for custom maps and mods. They're making it very easy to browse custom games and download maps without having to repeatedly get booted from a server or visit a third-party site. The Blizzard developers were extremely enthusiastic about what they called the StarCraft II Marketplace — essentially an App-Store-like interface for browsing and getting maps and mods. You could feel the wariness from the Blizzcon audience when this was announced; people were wondering if they would be required to pay for custom maps. But, for the most part, this won't be the case. The capacity for premium mods does exist, but the devs said that even a massively-popular mod like DotA would probably be too simple to expect people to pay for. The ability to charge was put into place so development teams that were interested could plan for a budget, in order to build extremely detailed or complex maps and mods. You can expect free access to all the great fan-made maps and mods that are typical of Blizzard games. This naturally leads to questions about the editor that will be coming with StarCraft II. From what we've seen so far, the Blizzard devs are going out of their way to include a ridiculous amount of flexibility in the tools they are providing. They seem to have a tremendous respect for what fans have done with their previous games; fully one-third of their design staff has come out of the mod community, and they have every intention of contacting people who make incredible creations for StarCraft II. Put simply, everything in the single-player campaign can be done with their editor. Many things not in the single-player campaign can be done with the editor. They gave a few simple examples: nothing in StarCraft II makes use of an inventory, but the code is there to support it. One of the powerful Zerg units, an Ultralisk, was modified with spiny grafts on its back that rapidly shot back and forth to destroy smaller units. When the Ultralisk was surrounded, it gave off a huge circular flame wave, destroying what was, literally, a screen full of enemies. Most impressive, though, were the two complicated examples. Using just the editor, they were able to transform the game into a third-person shooter. You took control of a unit (a Ghost, of course), and ran around the map (even underground) shooting Zerg, complete with a shooter UI, keyboard movement controls and mouse-look. They were also able to turn the game into a top-down scrolling space shooter. Take a look. And they're still adding features. They're looking for ways to create libraries that can be passed around — they want to give mod-makers the ability to work on different tasks at the same time. They're also very aware of the possibility that people might grab somebody else's custom map, make one minor change, and re-submit it as their own — Blizzard is making it very difficult to do this, and they're already working on a report and review system for objectionable content. The editor will be available during the beta, but probably not right away. With all of this in development, it's easy to see why Blizzard is so focused on getting people to use Battle.net. The oft-repeated suggestion that it's just DRM to fight piracy isn't the case. Hearing them talk about it and finally seeing what Battle.net has to offer makes it plain that they really do think the gaming experience will be better for it. That said, the door to LAN play doesn't seem to be closed. Rob Pardo acknowledged that there are a number of fringe cases where access to the internet isn't available or networking concerns prevent decent gameplay, and they're still looking into ways to give people what they want. They're also continuing to look into ways to optimize for situations where people are playing with each other from the same location. Diablo III The big reveal for Diablo III this year was the new Monk class. It's the game's second melee character, after the Barbarian, but manages to have a completely distinct style and feel. The inspiration for the Monk came from rather disparate sources; pen-and-paper RPGs and arcade-style fighting games (think Street Fighter). Since a Monk is holy by nature, Blizzard felt he should have access to a bit of holy magic to enhance his martial-arts style of fighting. Interestingly, they drew on a more Eastern European background, rather than the archetypical Southeast Asian variety, and the departure works well; the character seems to have the discipline and focus expected of a devoted adherent while concealing a craziness that would make him try to kill a bear with his teeth. And win. When designing the Monk, they wanted a fragile fighting class with more depth than just running up and smashing something. They looked at World of Warcraft's Rogue and Diablo II's Assassin, but decided each was ultimately unsatisfying for a game like Diablo III. They wanted something with a limited amount of skills but many ways to have those skills work together. Thus was born the combo system. Many of the Monk's major attacks have three different stages. Clicking on an enemy once gives you the first stage, clicking again (within a short period of time) gives you the second stage, and another click for the third stage. For example: Exploding Palm. The first stage hits for 35% of your weapon damage. Second stage hits for 50%. Third stage puts a damage-over-time bleed effect on the enemy, exacerbated by movement. If the enemy dies from the bleed effect, it explodes, causing a huge amount of damage to nearby enemies. This happens quite often, and it's a very powerful area-of-effect attack. Another example: Way of the Hundred Fists. The first attack is a quick dash, striking one enemy. The second stage is a rapid series of low-damage attacks. The third stage is a powerful area-of-effect damage and knock-back effect around the player. Now, the most interesting part about these combos is that you can mix and match. You can take the first stage from one ability, second stage from another, and the third stage from still another. This lets you tailor the way you attack to fit whatever situation you're in. These combine with more typical single-stage abilities, although some of the abilities themselves are anything but typical. An attack called Seven Sided Strike makes the Monk zip around part of the screen, teleporting between enemies to attack them. It's great fun to use, and very reminiscent of combo attacks in arcade fighting games. It's not something you'd expect in a Diablo game, but it fits perfectly. Everything feels like an impact. There were hands-on gaming areas set up throughout the convention, so we got to sit down and play through a level using the brand-new Monks, and it was probably the most entertaining time I spent there. Figuring out interesting ways to weave the abilities together is fun. Plus, one of the coolest things I noticed was how well two players could complement each other, even playing the same class. As I got comfortable with the Monk's skills and began to watch what my partner (also a Monk) was doing, I found that if I planned my attacks to play into his, we could tackle much stronger groups of monsters than we could otherwise. I could use my knock-back to bump a few monsters in to his area-attack or to give him a little space when he was vulnerable. We could layer our disorient spell so that monsters had less time to hit us. It gave me great hope for group synergy. Blizzard had some neat tidbits on display within the level itself, too. Several boss monsters, and even some regular ones, required strategic movement and ability use — not just blindly running in the opposite direction waiting for our heath bars to fill up, as was often the case in Diablo II. By playing smart, we could avoid a lot of the damage, which is how it should be. There was also an interesting side-dungeon; upon zoning in, we were warned that the place was collapsing, and a timer began ticking down. As we moved further inside, the ceiling would periodically drop rocks on us, forcing us to dodge quickly or take damage. But here's the rub: the further you go into the dungeon the more and better loot you get from chests. So it becomes a race — a challenge. How far can you go before you can't get back? When the timer expires, everything collapses, and you die. Several quests were available in the demo level as well. They all operate in a very smooth and story-driven manner. Several lessons have obviously been taken from World of Warcraft in that regard, but not in a way that undermines the Diablo style. They succeeded in showing a very dark thematic tone in a visually bright level. The developers spent some time talking about their design process and philosophy, and showed some examples of what they had in the works. They're trying to do interesting things with the monsters without making an individual monster too complex. Difficulty and complexity is achieved through combining different types of monsters. They have a variety of archetypes, such as swarmers, ranged attackers, enemies that weaken you in some way, monsters that alter or constrict your movement through area-effect spells, and many others. Knowing how to prioritize your targets will be a valuable skill. Diablo III is a game that's already impressive, but very much still in development. Blizzard isn't ready to talk about many things; major decisions for the PvP system haven't been made yet, Battle.net integration is something for the future (though they will have cross-game communication, like the others), and the much-anticipated rune system for customizing skills is on hold until they finalize the skills themselves. Even things like the Barbarian's resource system and graphical effects are still going through new iterations, and they're trying to smooth out the bumps in monster design. They mentioned a sand-shark which would become much more powerful in the open desert (think Tremors), making the sand feel less safe to stand on than nearby rocks. Unfortunately, in playtesting, they found that it was hard to balance and confusing for the players, so they're tinkering with the design. I wouldn't expect this game before 2011. A few more random snippets: the stash will be "gigantic," and there will still be endgame loot runs, but they will most likely be "diversified" such that you'd actively want to kill multiple bosses rather than the same one over and over. There will be some method for transferring items between your characters, and they're working on ways to prevent item duping/hacking. They want Diablo III to have a more meaningful economy than Diablo II. They don't feel like modding or map-making provides any substantial benefit for the game, and they don't plan to support it. They like the idea of using the Horadric Cube to craft items, but wouldn't be satisfied duplicating the way it was implemented. World of Warcraft: Cataclysm The unveiling of World of Warcraft's third expansion was perhaps the biggest hit of the conference. It was clear since the launch of The Burning Crusade that Blizzard has gotten much better at quest and zone design since the original two continents were created. Wrath of the Lich King only emphasized that point; comparing the landscape of Howling Fjord to that of Desolace made you wonder that they were part of the same game. Players had been asking for a better leveling experience for years, and their demands did not go unnoticed. Cataclysm is easily the biggest expansion, and is sure to further solidify the game's place at the top of the MMO food chain. So, what do we know about Cataclysm? Well, it'll affect every zone on Kalimdor and the Eastern Kingdoms, some to greater extent than others. Northrend will be affected too, though not as much. The Outland, being separate from the world of Azeroth, won't undergo significant physical change, but quests and dialogues will be updated to reflect such a major event. In addition to the remodeling of the two major continents, several entirely new areas will be available to players as well, including an underwater zone. The phasing technology introduced in Wrath is being upgraded to affect terrain, and players will be able to use their flying mounts in Azeroth. That's a lot to digest, but the WoW developers just kept piling on more information throughout the convention. There are five new high-level zones for taking players from level 80 to 85. Two of them, Mount Hyjal and the Sunken City of Vashj'ir, are starter zones. Vashj'ir is the underwater zone. The devs promised to "make sure it won't be annoying." From what they described, most of the combat will be done on the bottom of the ocean, with characters able to move around and fight much like normal. They'll also be able to detach themselves from the bottom and swim through the water above them. Underwater mounts will be introduced that move as quickly as flying mounts, and there may even be some areas at the bottom of the sea that will be enclosed, containing air. They showed some concept art that was very bright and colorful, what you might expect from a documentary on a lively reef on the Discovery channel. Hyjal will be under siege by an old enemy — Ragnaros. He's not too happy about what happened to him the last time around, and he's trying to take out his anger on the World Tree. Deepholm was termed the "hub" of the new 80-85 areas; it will facilitate quick transport to any of them. A temple in the center of the zone is where the expansion's villain, Deathwing, broke through and caused the cataclysm. It's designed to feel like an enclosed space, and the art we've seen makes it look like a giant cavern, which will definitely give it a different feel from any zone we've seen before. Uldum is a long-awaited addition to Azeroth. As it turns out, it was always "there," but Titan-created machines prevented anyone from seeing it. The cataclysm broke those machines, so it's open season on this Egypt-inspired zone. Twilight Highlands is home to the Twilight's Hammer cult, the ones who helped to free Deathwing. It'll have Grim Batol, one of the new raids, as well as new port towns for both the Horde and the Alliance. The cataclysm will have political ramifications as well, resulting in two new playable races. The Goblins will be forced from their neutrality into partnership with the Horde, and a break in the Greymane Wall puts the Worgen squarely on the side of the Alliance. They each get their own starting zone (levels 1-15), and both will have fairly powerful racial abilities; Worgen get a sprint ability, slightly increased damage, and a bonus to skinning — which they don't require a knife to do. Goblins get price discounts regardless of reputation, engineering abilities (one launches them at their target, another fires rockets, but they share a cooldown), and a bonus to their alchemy skill, which includes increased effects from potions. You don't need to worry that these are more powerful than the old races — all of them will be updated to a similar level of usefulness when Cataclysm launches. Oh, and race changes will become available at some point as well. More big news: rated battlegrounds will be arriving with Cataclysm. They will function differently from arenas in that you won't have particular teams, and your rating will never go down — only up. Every week a particular battleground can be used for rated matches. If you win, you gain rating determined by your current rating and the quality of your opponents. If you lose, your rating stays the same. Winning also awards you a number of arena points per game. Arenas will be shifting to this system as well. Your rating will determine the maximum number of points you can earn in a week. You won't have rated teams for battlegrounds, but you will need to queue as a group. A variety of new bonuses and awards are being introduced, including epic ground mounts and the return of honor titles, like Grand Marshal. Also on the PvP front, a new world-PvP zone will be opening: an island called Tol Barad. The intent is to combine the battles in Wintergrasp with the daily quest hub of the Isle of Quel'Danas. When the battle isn't active, players from both factions can do daily quests and choose whether or not they want to rumble on their own terms. When the fight is underway, daily quests shut down until there is a victor. The winner gets access to an instance and a few more daily quests. The action will be spread out over a larger area in order to avoid some of the crippling lag that plagued Wintergrasp on some servers, and different areas will have different types of combat. There will be a new battleground too, the Battle of Gilneas, which will have players trying to capture districts of a city. There will probably be new arena maps as well. Perhaps as significant as the physical changes to World of Warcraft are the changes to itemization that are in the works. Mana per 5 is being rolled into Spirit. Attack Power will be abandoned for Strength and Agility. Spell Power will be rolled into Intellect. Defense and Armor Penetration are going away (almost) entirely. Block value is gone too; blocks now absorb a flat percentage of the damage, making it a useful stat against bosses. The intent is to streamline gear so that players don't need giant spreadsheets to figure out whether something is an upgrade. Most of these stats will be replaced by a new stat called "Mastery," which "makes you better at what you do best." The talent trees are being revised to remove talents that give a passive bonus to your character, since that's kind of boring. Instead, simply spending points in a particular talent tree will give you appropriate passive bonuses. The further you go, the better the bonuses are. It will allow for more meaningful choices in how the characters is played. The system will be smart enough to know what weapon specialization you use, and if you go all the way down to the bottom of a tree, you'll see some really interesting bonuses. One they showed for Paladins granted a percentage reduction in cooldown duration. Some big class changes are underway too; Hunters will no longer use mana, but instead adopt the Focus system used by their pets. This lets them ignore Intellect gear and reduces the need for cooldowns on their abilities, since that can be handled by their resource system. Warlocks are seeing a substantial change in the way Soul Shards work. No longer will they have to carry around a few dozen in their bags; instead, they'll acquire a max of three, held in a UI system similar to Death Knight Runes. They won't be easily recharged during combat, but grant substantial boosts to spell effects. For example, one might be used to make a long summoning spell or their biggest, slowest damage spell instant-cast instead. It wouldn't be an expansion without a new profession, and once again Blizzard is doing it in a way they haven't done before; Archaeology is a new secondary profession, so everyone can get it without taking up one of their primary profession slots. It's also the key to a new max-level character progression system called "Paths of the Titans." This will be a way to gradually improve your character once you've hit the level cap. Progress will be limited; they don't want people to feel obligated to grind it out, so it'll become available slowly. There are 10 ranks to each Path, and you get bonuses to your character at every rank. The bonuses are not class specific, so it's feasible for a warrior and a priest to pick the same one; it just depends on what abilities you'd like. The examples they gave included a passive damage reduction to your character and an activated ability that reduced damage to nearby allies. It uses the glyph system, but the glyphs come from Archaeology rather than Inscription. Another way to customize will be an ability called Reforging. It will let you exchange part of one stat on an item for another. For example, a ring with 10 Intellect could be changed to a ring with 5 Intellect and 5 Spirit. That's not all with regard to customization, however. Cataclysm will be introducing a Guild leveling system. Almost everything you do — boss kills, level-ups, skill-ups, PvP, etc. — contributes toward your guild gaining levels, to a maximum of 20. Guilds will have their own talent trees, which only apply to its members. Blizzard showed a few of the possible talents; one reduced repair costs, and another granted a mass resurrection spell. They also talked about talents for removing reagent costs and having extra gold drop from monsters. There will also be Guild Achievements and Guild Heirlooms. Heirloom recipes can be purchased, allowing anyone of that profession within the guild to craft the item. If a person with one of those items leaves the guild, the item is put back in the guild bank. It was an eventful two days for the WoW team. They mentioned a variety of other news, too. They're doing away with spell ranks; they all just scale with level now. Incidentally, this opens the door to a mentoring system, which they may decide to implement at some point. They're making "big changes" to fishing so it will be "more fun." Players with two gathering professions will be able to track both simultaneously. The terrain phasing system will let you see entire coastlines change as the cataclysm progresses. There will be a guild news feed, not to mention cross-faction, cross-realm, and cross-game communication through Battle.net. Cross-server instance groups (aimed at PUGs) are planned for the next major patch. The revamped leveling zones will lead to each other in a more contiguous manner, so expect some high level zones to become low-level zones, and vice versa. All in all, it looks like the WoW devs have been busy cramming every cool feature they could manage into this expansion, while simultaneously addressing some of the game's biggest weaknesses. It's getting hard to see how new MMOs will ever be able to compete against something like this. Blizzard wants new players to have this experience, so it's likely they'll integrate Cataclysm into the base game. It'll be interesting to see whether the development cycle takes longer than the previous expansions, since it seems like Cataclysm will require a lot more work. I'm sure we'll have a better idea after the next Blizzcon!

2024-06-11T01:26:28.774034

https://example.com/article/2518

The Ultimate Task The Ultimate Task (), also known as Fantastic Adventure, is a 2013 Chinese animated adventure comedy drama film directed by Sun Lijun. It was released on July 20, 2013. Voice cast Xie Na Lu Zhixing Han Tongsheng Wang Jinsong Li Yang Liu Jing Yang Yifei Reception The film earned at the Chinese box office. References Category:2013 animated films Category:2013 films Category:2010s adventure films Category:2010s comedy-drama films Category:Animated adventure films Category:Animated comedy films Category:Animated drama films Category:Chinese animated films Category:Chinese films

2024-06-16T01:26:28.774034

https://example.com/article/5718

Q: umbraco my site pages can navigate on any other page, how to stop this? i have website developed by Umbraco. It's working good except one thing. Suppose i have the following pages under the parent node content : login - register - about-us if i type in the browser www.mysite/login/register it normally respond with the register page, which is not make sense i navigate to every page under any other page(which is so weird) and i don't know why. Is there any changes i need to make in my IIS or web.config? A: If you have a template called "register" you can apply that template to any page simply by putting "register" at the end of you url, as in: www.mysite/login/register If there is in fact no node that exists called "register" which lives under "login", then the above url effectively becomes: www.mysite/login/?alttemplate=register This is expected and useful behavior as described in Why Umbraco Rocks - Alternate Templates.

2023-12-10T01:26:28.774034

https://example.com/article/2354

Q: Keep physics object upright using engines placed on it So, I'm writing an auto-pilot, sorta, for a 3D physics object. The player is allowed to place as many engines as they wish, wherever they wish. The auto-pilot is then supposed to keep this object upright using the engines, control each engine's thrust amount 0-100%. So if it's tilting to the right, it should fire all engines to the right a bit more. If it's tilting forward, but only slightly to the right, all engines in the direction it's tilting should fire more, so the object gets upright again. How would I go about doing this? A: determine motors usage you have to make list for what your motors will be used so divide all motors to groups by its direction you should have motors for left,right,up,down,forward,backward the problem is you can missing some ... in that case you are screwed and cant complete the task the group sorting is not easy for non axis aligned arbitrary motors to simplify this just do the dot product of motor direction and group direction and the maximal values are belonging to motors of that group the minimal values (negative) are belonging to opposite direction so tag each motor with group and try to select them so each group has at least one motor control well just use any type of regulation P,PI,PID... to maintain the position it should be pretty straightforward for example motors in x group with P (proportional regulation) thrust_x = c0 + c1 * (object_x-wanted_x) where c1 is response constant play with it to achieve wanted response too big will cause oscilations too small will cause slow reactions c0 is anihilating external force fields like gravity both c0,c1 are dependent on the group strength, object mass,... if you need also to control orientation then you just have to add more groups [notes] the motors usage can change with time (object can rotate) so you can convert the desired position to object local coordinate system or recompute the groups once in a while

2023-11-23T01:26:28.774034

https://example.com/article/6673

Q: Managing MySQL query in PHP with MySQLi I'm needing to use PHP to access the MySQL database on my host from a C# project. I'm learning PHP and mysqli to be able to do this. I'm stuck about where to actually sort the information. The query comes from my C# app through a $_POST variable and gets the requested data. But then it seems like i'm limited as how to get it back to my app. I can either send it as one long string and reorganize it in C#. Or create complicated for loops and still need to do a lot of sorting on the C# side. I'm sure i'm just unfamiliar with PHP and mysqli. Can anyone recommend a workflow? Thanks. A: There's many ways you can pass it back to your C# application. JSON and XML are very popular. For this answer I will discuss using JSON. On the PHP side you will want to take your data and convert it into it's JSON form with json_encode. On the C# side you will convert it from JSON into a C# object. While there are ways to do this built into C# (DataContractSerializer and JavaScriptSerializer), the best option in .NET due to implementation and performance is Newtonsoft's Json.NET. Updating... adding a rough example. PHP if ($result = $mysqli->query("SELECT One, Two FROM MyTable")) { $jsonResult = json_encode($result); /* free result set */ $result->close(); } // Now send back $jsonResult C# (using JSON.net/JObject... you could also make an actual object to deserialize to) string phpResponse = /* Add wherever you got your data from */; JObject myResult = JObject.Parse(phpResponse);

2023-08-12T01:26:28.774034

https://example.com/article/4425

{ "images" : [ { "idiom" : "universal", "filename" : "logo-180.png", "scale" : "1x" }, { "idiom" : "universal", "scale" : "2x" }, { "idiom" : "universal", "scale" : "3x" } ], "info" : { "version" : 1, "author" : "xcode" } }

2023-08-27T01:26:28.774034

https://example.com/article/4880

20 years ago this summer, the first Fushigi Yugi manga ended. The TV anime ended in March of that year. So, time for a remake of the mid-90s hit fantasy shoujo series? Author Yuu Watase thought it would be fun to play around with the idea of a 2016 version of Mysterious Play, so, making it clear that fans shouldn't take it too seriously, she posted her designs. She aimed to keep the essential qualities of the originals, with some tweaks (some changes to Hotohori's hair for example), and some a bit more substantial (a more HENTAI Tomo). UPDATE - more have been added Revisit the series' anime on Crunchyroll. ------ Scott Green is editor and reporter for anime and manga at geek entertainment site Ain't It Cool News. Follow him on Twitter at @aicnanime.

2024-01-29T01:26:28.774034

https://example.com/article/5640

Russian Troops in the Crimea John Kerry is appropriately aghast at the “incredible act of aggression” by Russia in the Ukraine: “You just don't in the 21st century behave in 19th century fashion by invading another country on completely trumped up pre-text," Kerry told the CBS program "Face the Nation." This new-found respect for the sovereignty of foreign nations represents a laudable 180 degree change in US foreign policy. You just don't do that in the 21st century! Like e.g. invading Iraq by making up tall stories about “weapons of mass destruction” hidden there. It's just not done. As an aside to this: in February, the civil war currently raging in Iraq has cost yet another 1,705 lives, with 2,045 wounded. The death toll is a considerable increase from January's 1,284 dead and 2,088 wounded. Perhaps you weren't aware there is a civil war raging in Iraq? If so, that is no surprise. The Western media have fallen almost completely silent on the topic. Yet, this is what the famous 'mission' has actually 'accomplished'. As Jason Ditz reports regarding the recent escalation in the Crimea: “While US politicians have also ratcheted up the rhetoric, US officials concede that Russia’s troops in Crimea are setting up defensive positions and are in a “self-defense posture only.” Reports from Crimea’s government say they’ve got Russian troops helping them protect government buildings in anticipation of the referendum, and with a sense that will easily back secession and re-accession into the Russian federation, it seems that Russia doesn’t need to “invade” at all, but simply needs to keep the interim government at bay until Crimean voters affirm the switch.” (emphasis added) But we actually can't have a democratic referendum, can we? Especially one the outcome of which is very likely going to be one that doesn't conform to 'our' (the Western powers) wishes. So let's get this straight: removing a democratically elected government by violence is perfectly fine with our politicians. Please note in this context that Yanukovich, for all his faults, was actually offering one conciliatory gesture after another: he offered the opposition to join the government, he extended an amnesty to all imprisoned protesters, he twice offered a truce and agreed to early presidential elections. It is not entirely clear which side broke the truce – if press reports are to be believed, the protesters sure had a hand in it (many of the most violent ones are supporters of the fascist 'Svoboda' party). Even CNN admitted as much, and CNN is usually well known for tailoring its reporting to the wishes of the powers-that-be (CNN's habit of faking reports is by now legendary). So, a violent revolution is fine, but a referendum over whether the Crimea wants to remain with the Ukraine is considered anathema. By the way, we are certainly not arguing that Yanukovich is anything but a major sleazeball; there is evidently an endless supply of those in Ukrainian politics. There is also little doubt that Yanukovich in the end gave the green light to his security forces to use live ammunition. We certainly don't want to paint Yanukovich as a perfectly innocent party. We are merely pointing out a few facts that seem to be getting short shrift in the mainstream press. “Territorial Integrity” Nonsense The main point we want to make is though that it is absurd that everybody insists on keeping the 'territorial integrity' of the Ukraine intact, as if it had any special meaning or as if there were any reason to regard it as sacrosanct. The Ukraine as it exists today is largely a creation of Soviet communists, who deliberately added large Russian-dominated territories to the Ukraine precisely because they wanted to keep a lid on nationalist sentiments. In fact, the Ukrainian territory of today is – with the sole exception of a tiny piece of heartland – almost entirely a Russian creation. What the communists didn't tack on, the Tzars did. Here is a historical map that shows what occurred. Note in this context also that the past 23 years since the implosion of the Soviet Bloc are the longest period of time in which the Ukraine has been independent in more than 300 years. That is of course not meant to imply that it shouldn't be independent. The importance of maintaining the 'territorial integrity' of a territory put together by a bunch of Soviet communists over the past 90 years eludes us however. The tiny orange piece in the middle was the original Ukraine. Later additions to the then Russian province and later Soviet Republic were all the work of Russian tzars and Soviet communists. Not even Kiev was originally part of the Ukraine. And obviously, the Crimea was the most recent addition to its territory, courtesy of Nikita Khrushchev. That makes it a sacrosanct part of the Ukraine how exactly? When Yugoslavia fell apart, keeping its 'territorial integrity' intact was the last thing on the mind of Western powers. They demanded the exact opposite: Serbia was to be dismantled. When Czechs and Slovaks parted ways amicably, the world somehow kept turning as well. The biggie is of course the Soviet empire itself: there was widespread delight at its 'loss of territorial integrity'. By contrast, when West and East Germany let it be known they wanted to reunify, the allied powers were initially against it. It took a lot of deft maneuvering by the West German government (including paying a big political and economic price by agreeing to the introduction of the euro) to finally convince all the former WW2 allies to give their placet to reunification. It should be obvious that the demands regarding the Ukraine's territorial integrity are largely a result of the utterly pointless geopolitical contest between Washington and Moscow. What the citizens of the Ukraine want is way down on the list of priorities. Incidentally, now that Ukrainians have the government Victoria Nuland planned for them, they are already beginning to doubt it. “Protesters on the square universally tell tales of the wild riches that ordinary parliamentarians gain – one confidently talked of the "millions" a member of parliament can get for voting correctly during a debate. They reckon that the leaders of the opposition-turned government, such as acting President Oleksander Turchinov and Prime Minister Arseny Yatseniuk will enjoy such benefits.” That is of course the main reason for entering politics in the Ukraine, so the protesters probably have it quite right. On the other hand, Yanukovich and Tymoshenko before him have apparently looted the state's coffers so thoroughly that the only way to get at fresh moolah in the near future is via the EU/IMF. Let us get back to the territorial integrity question though. In the meantime, just as we suspected would happen, other Eastern Ukrainian regions have joined the Crimea in reconsidering their status. “Dozens of people were hurt in clashes on Saturday when pro-Russia activists stormed the regional government's headquarters in the eastern Ukrainian city of Kharkiv and raised the Russian flag, local media said. The UNIAN news agency said thousands of people had gathered outside the building during a protest against the country's new leaders who ousted President Viktor Yanukovich a week ago. The violence signaled that Ukraine's new leaders could face a challenge in mainly Russian-speaking regions that oppose the largely pro-Western course charted by the newly installed government. The leaders of Crimea, a Black Sea peninsula with an ethnic Russian majority that is home to a Russian naval base, say they have joined forces with Russian servicemen to exert control over key buildings. Russian parliament has approved a proposal by President Vladimir Putin to deploy troops in Ukraine. Protests against the new authorities also took place on Saturday in other cities, including Odessa, Dnipro and Donetsk, Yanukovich's home town and power base. The Russian flag was raised over the regional government building in Donetsk by several thousand pro-Russia activists waving the Russian tricolour and chanting "Russia! Russia!, witnesses said. Donetsk authorities issued an appeal for a referendum to be called on the future status of the region.” (emphasis added) The Russian flag is hoisted in Kharkiv (Photo via AFP / Getty Images) This is precisely what we expected: as soon as the Crimea announced it would hold a referendum on its status, other regions with a predominantly Russian speaking population would follow suit. Again, why wouldn't they? The new government has just declared their mother tongue 'lingua non grata' again. And why should some of the Eastern regions not be allowed to secede from the Ukraine? After all, it can be shown unequivocally that the constant eruption of violent conflict is not only the result of popular discontent with the corrupt political and economic elite. It is firmly rooted in an ethnic-linguistic conflict that could be resolved once and for all by a partition. The charts below are making all of this perfectly clear. An Ethnic and Linguistic Conflict in Pictures First let us take a detailed look at the linguistic situation. Ukrainian is spoken mainly in the Western Ukraine, while Russian predominates in the Eastern part of the country. What is interesting is that the percentage of citizens that support making Russian the second official language is quite a bit higher than the percentage naming it as their mother tongue. Obviously, most Ukrainians actually understand and speak Russian. The first three charts show survey results from 2003, which are a bit outdated by now, but nevertheless illustrate the basic situation. Note that there is a historical reason for this East-West split: much of today's Western Ukraine used to be part of the late medieval Lithuanian Empire, and later the Polish-Lithuanian Commonwealth, which became a Russian protectorate in 1768 and was subsequently partitioned several times. At the time of its largest territorial extent, the regions that are today considered part of the 'Eastern Ukraine' were actually Russian territory. A historical map of the Polish-Lithuanian Commonwealth can be seen here). A detailed overview of the Ukraine's language distribution – click to enlarge. Language distribution by 'macro-region' – click to enlarge. Support for making Russian the second official language. It is interesting that the idea has considerable support in several central/Western regions as well, in spite of the fact that most of the inhabitants declare Ukrainian to be their mother tongue – click to enlarge. Finally, a 2011 survey by a Kiev based think-tank, showing the regions which have made Russian the second official language after Yanukovich signed a law making it possible to adopt it as a 'regional' official language. This was one of the first laws the new government reversed. Looking at the map above, is it any wonder Russian flags are hoisted in cities in Kharkiv, Donetsk and the Crimea? – click to enlarge. As to why we feel so certain that the linguistic divide truly reflects the political conflict, nothing is easier to prove. The first map below shows the 2004 election results after the 'Orange Revolution' ousted the the first Yanukovich government in favor of the Yushchenko/Tymoshenko government. The election result reflected the linguistic divide to a 'T'. Below that we see the results of the 2010 election, which took place long after Yushchenko had fallen from grace, toppled by his former ally, the 'gas princess' Yulia Tymoshenko. Apparently even a number of Western Ukrainians were so fed up with Tymoshenko that a number of them decided to support the no less tainted Yanukovich (Yanukovich has been a force in Ukrainian politics since the demise of the Kuchma regime. Kuchma's government was largely a Western Ukrainian kleptocracy, but both Yushchenko and Yanukovich actually served in it as prime minsters at some point). The 2004 election in the Ukraine, which former 'Orange Revolution' star Yushkenko won. In 2010, he would not even garner 10% of the vote. The degree of East-West polarization is astonishing. Funny enough, both Yushchenko and Yanukovich once served as prime ministers in the Kuchma government – click to enlarge. The 2010 run-off election between Yanukovich and Tymoshenko. This map shows which of the regions were ultimately won by one or the other – click to enlarge. A more detailed map of the same election, which indicates that polarization was slightly less pronounced than in 2004, largely because Tymoshenko was no longer regarded as trustworthy by many of her former supporters after deserting Yushchenko and making deals with Yanukovich – not to mention her involvement in various financial scandals. Nevertheless, the result still strongly reflects the linguistic divide – click to enlarge. Next is a detailed map of the 2007 parliamentary election (at the time, Tymoshenko still enjoyed more support than in 2010). By and large it reflects exactly the same phenomenon: people simply tended to vote for 'their' crook, regardless of how corrupt he or she was held to be: The 2007 parliamentary election followed the same general pattern – click to enlarge. Next, a map showing where exactly the protests against Yanukovich broke out last year and their status in 2014: Where the protests took place. Note where precisely the 'government center was seized by protesters' as there is an interesting parallel with the next map – click to enlarge. The next map shows the growing electoral success of the fascist 'Svoboda' party, formerly called the 'Social Nationalist Party'. Here is a video of a march organized by one of its leaders, Yuri Michalchyshyn. At the time the party still used the "wolf's angel" heraldic cross as its symbol. Similarities with the Swastika are entirely coincidental of course. These worthies have increasingly captured the imagination of Western Ukrainian voters, gaining 38 seats in the 2012 parliament. Compare the regions in which their support was the greatest in 2012 with the the regions where government buildings were forcefully occupied according to the map above. This tells us something about their willingness to employ violence. Will Svoboda's influence wane now that the opposition has taken over? Perhaps, but we actually doubt it. We suspect for one thing that the party's alliance with the more moderate 'Fatherland Party' of Yatseniuk/Tymoshenko is largely an alliance of convenience. It is doubtful that Svoboda really shares their eagerness for joining the EU – it is largely its virulent anti-Russian stance that informs its lip service on that point. The rise of Ukraine's fascists – click to enlarge. The new government will be forced to take many unpopular decisions due to the precarious financial and economic state the Ukraine finds itself in. Svoboda may well decide that it will be to its benefit to oppose these decisions. Hard economic times are typically when radical parties like Svoboda tend to flourish. Speaking of economic and financial hardship, the Yanukovich government was welcome to subsidized gas deliveries from Russia's Gazprom. However, Russia has of course no interest in extending the discounted price to the new government – and it can point to the fact that there is still a rather large unpaid bill outstanding: “Russia's energy ministry said on Saturday it saw no reason to extend an earlier agreed gas discount to Ukraine for the second quarter due to unpaid debt for deliveries, the Interfax news agency cited a representative at the ministry as saying. Russian gas producer Gazprom said earlier on Saturday that Ukraine's debt for 2013 and this year's deliveries stood at $1.55 billion. "If this continues to happen, is there any point in continuing the existing agreement on gas supplies at discount prices? No," the agency cited an unnamed ministry representative as saying.” (emphasis added) Of course these sudden second thoughts about the gas discount and the Ukraine's overdue payments are mainly designed to increase the political pressure on the new Ukrainian government. Conclusion: The Western insistence that the Ukraine must remain as it is glosses over the fact that it is a deeply divided country. Clearly citizens of Western Ukraine sympathize with Europe, while Eastern Ukrainians sympathize with Russia. Even the occasional Ukrainian warship is unwilling to obey its new masters in Kiev. The division between the two halves of the Ukraine has long-standing historical roots. There is undoubtedly genuine frustration in the population over the antics of the country's political elite, but whether the new rulers will turn out to be any better than the old ones remains to be seen (experience to date suggests otherwise, as political corruption has seemingly become deeply entrenched). Experience also suggests that the two opposed groups are simply unable to find a modus vivendi. In other words, forcing them to remain in a single nation state will only lead to even more conflict. When borders drawn by dictators of the past become an unending source of conflict, it is probably best to rearrange them. Maps by: Wikipedia, Washington Post, GeoCurrents Dear Readers! You may have noticed that our so-called “semiannual” funding drive, which started sometime in the summer if memory serves, has seamlessly segued into the winter. In fact, the year is almost over! We assure you this is not merely evidence of our chutzpa; rather, it is indicative of the fact that ad income still needs to be supplemented in order to support upkeep of the site. Naturally, the traditional benefits that can be spontaneously triggered by donations to this site remain operative regardless of the season - ranging from a boost to general well-being/happiness (inter alia featuring improved sleep & appetite), children including you in their songs, up to the likely allotment of privileges in the afterlife, etc., etc., but the Christmas season is probably an especially propitious time to cross our palms with silver. A special thank you to all readers who have already chipped in, your generosity is greatly appreciated. Regardless of that, we are honored by everybody's readership and hope we have managed to add a little value to your life. Bitcoin address: 12vB2LeWQNjWh59tyfWw23ySqJ9kTfJifA

2024-01-13T01:26:28.774034

https://example.com/article/5341

<annotation> <folder>imagesRaw</folder> <filename>2017-12-27 04:54:49.319248.jpg</filename> <path>/Users/abell/Development/other.nyc/Camera/imagesRaw/2017-12-27 04:54:49.319248.jpg</path> <source> <database>Unknown</database> </source> <size> <width>352</width> <height>240</height> <depth>1</depth> </size> <segmented>0</segmented> <object> <name>truck</name> <pose>Unspecified</pose> <truncated>0</truncated> <difficult>0</difficult> <bndbox> <xmin>210</xmin> <ymin>166</ymin> <xmax>250</xmax> <ymax>203</ymax> </bndbox> </object> </annotation>

2023-08-03T01:26:28.774034

https://example.com/article/8582

Q: Android: Intent createChooser not working properly I am adding share feature in the app. Below is my code: public static void shareData(String title, String message, Uri imageUri, Activity activity) { try { Intent sendIntent = new Intent(Intent.ACTION_SEND); sendIntent.putExtra(Intent.EXTRA_TITLE, title); sendIntent.putExtra(Intent.EXTRA_SUBJECT, message); if (imageUri != null) { Logger.errorMessage(ShareUtil.class.getSimpleName(), "share if"); sendIntent.putExtra(Intent.EXTRA_STREAM, imageUri); sendIntent.setType("image/*"); } else { Logger.errorMessage(ShareUtil.class.getSimpleName(), "share else"); sendIntent.setType("text/plain"); } activity.startActivity(Intent.createChooser(sendIntent, "Share using")); } catch (Exception e) { e.printStackTrace(); Toast.makeText(activity, "No App found to share", Toast.LENGTH_LONG).show(); } } This is showing the list of apps, but when I select any app, the title and message is not sent. I am not getting what I am doing wrong. A: Intent.EXTRA_SUBJECT is mainly used in email. Try replacing it with Intent.EXTRA_TEXT. This works in most apps.

2023-12-03T01:26:28.774034

https://example.com/article/6047

Combining neural and behavioral indicators in the assessment of internalizing psychopathology in children and adolescents. Anxiety and mood disorders are among the most prevalent mental health problems affecting our youth. We propose that assessment and treatment efforts in this area can benefit from a focus on developmentally sensitive neurobehavioral trait constructs, that is, individual difference constructs with direct referents in both neurobiology and behavior across the lifespan. This approach dovetails with the National Institute of Mental Health's Research Domain Criteria initiative, which aims to improve classification and treatment of psychopathology by delineating dimensions of functioning that transcend measurement domains and traditional diagnostic categories. We highlight two neurobehavioral dimensions with clear relevance for understanding internalizing problems at differing ages: (a) defensive reactivity and (b) cognitive control. Individual differences in defensive reactivity are posited to reflect variations in sensitivity of the brain's negative valence systems, whereas differences in cognitive control are theorized to reflect variations in neural systems dedicated to regulating behavior and affect. Focusing on these target constructs, we illustrate a psychoneurometric approach to assessment of internalizing psychopathology entailing use of neural, self-report, and behavioral indicators. We address the feasibility of the psychoneurometric approach for clinical application and present results from a pilot study demonstrating expected associations for neural, parent-report, and behavioral measures of defensive reactivity and cognitive control with internalizing symptoms in preschoolers. Together, our conceptual and empirical analyses highlight the promise of multimethod, dimensional assessment of internalizing psychopathology in the lab and in the clinic.

2024-01-04T01:26:28.774034

https://example.com/article/8487

-- | Types describing runtime errors related to Explorer module Pos.Explorer.Web.Error ( ExplorerError (..) ) where import Formatting (bprint, stext, (%)) import qualified Formatting.Buildable import Universum newtype ExplorerError = -- | Some internal error. Internal Text deriving (Show, Generic) instance Exception ExplorerError instance Buildable ExplorerError where build (Internal msg) = bprint ("Internal explorer error ("%stext%")") msg

2024-03-11T01:26:28.774034

https://example.com/article/3760

African teams are always passionate and hard-working which makes them fun to watch. And there will be some lone star in those teams who would play many roles – motivator, leader, and executor. Sadio Mané might not be Didier Drogba but he still infuses a lot of enthusiasm among his teammates. Senegal displayed all that might against Poland. It was refreshing to watch them go on with the same stamina and power in the 90th minute as they had in the beginning. They were skilful in the midfield, had a solid defence & nice strategic gameplay. Some of their issues lie when they enter opponent’s penalty box. Their shot selection, execution and collaboration in there was weak. Also, they need to work on their set-pieces. Mané seemed pale and was playing way back. Maybe coz he was not sure of the kind of support that he gets while playing for Liverpool. Or maybe he was saving his skills for those big matches. I would like to see them in the next round(s).

2024-02-09T01:26:28.774034

https://example.com/article/8588

Capable adults are free to enter into a contract with one another. Once entered into, the contract is binding on the parties (exceptions apply) and they may ask the court for assistance enforcing the terms of the contract. Different rules apply to contracts entered into by minors (in Ontario, the Age of Majority and Accountability Actdefines a “minor” is anyone under the age of 18). Subject to a few exceptions, any contract entered into by a minor is voidable at the minor’s discretion. In other words, a minor can back out of a contract at any time. The same cannot be said for the capable adult who enters into a contract with the minor – the adult is bound by the contract even though the minor is not. For this reason, it is generally considered unwise to rely on documents signed by children. (The minor cannot, however, keep the goods contracted for without also fulfilling her end of the bargain. For example, if the minor entered into a contract to pay $50 for a pair of shoes, the minor could not back out of the contract after receiving the shoes but before paying the $50. The minor would have to return the shoes in order to void the contract.) Similar rules apply to contracts entered into by adults who lack the capacity to enter into contract (for example, adults who have dementia which makes them unable to understand the contents or consequences of a contract) – in such cases, the contract is voidable. Concerns about the capacity of a party to enter into a contract frequently arises in estate and capacity disputes where a settlement is reached and minutes of settlement are signed – minutes of settlement are, after all, a contract. The purpose of the settlement is to end the litigation, but how can the parties be certain the litigation is over if one of the parties is a minor or an incapable adult who is allowed to back out of the settlement at any time? The solution is found in rule 7.08 of the Rules of Civil Procedure (previously blogged about here). Further to rule 7.08, the settlement becomes binding on the minor or incapable adult (i.e. a party “under disability”) once approved by a judge. Rule 7.08 reads: “No settlement of a claim made by or against a person under disability, whether or not a proceeding has been commenced in respect of the claim, is binding on the person without the approval of a judge.” On a motion or application to approve the settlement, the judge will review the settlement and, if the judge agrees that the settlement is in the best interests of the party under disability, the judge will approve the settlement on behalf of the minor or incapable adult. At that time, the settlement is binding on all parties involved. Where litigation has been commenced (either by way of action or application), a motion may be brought to a judge to approve the settlement on behalf of the minor/incapable adult. However, where parties have settled a pending claim (i.e. one that has not yet been commenced), then an application will have to be brought to obtain a judge’s approval of the settlement. In Leonard v Saint-Vincent Hospital, 2018 ONSC 370, the court explored the differences between bringing a motion to approve a settlement where litigation has started and bringing an application to approve a settlement where no litigation has been commenced. While the evidence required in support of the motion and application are the same, the procedure is not. As set out in sub-rule 7.08(4), the parties to either the motion or the application must provide: an affidavit of the litigation guardian setting out the material facts and the reasons supporting the proposed settlement and the position of the litigation guardian in respect of the settlement; an affidavit of the lawyer acting for the litigation guardian setting out the lawyer’s position in respect of the proposed settlement; where the person under disability is a minor who is over the age of 16 years, the minor’s consent in writing, unless the judge orders otherwise; and a copy of the proposed minutes of settlement. Recall the minors and incapable adults cannot represent themselves in litigation. Rather, their interests are represented in the litigation by a litigation guardian (see rule 7.01). All litigation guardians must in turn hire a lawyer (with the exception of the Children’s Lawyer and the Public Guardian and Trustee, who do not need to hire outside counsel). The main difference between a motion and an application to approve a settlement that a motion for approval may be heard in writing, but an application for approval must be heard orally. The judge explained the principle underlying the distinction as follows: [40] Through the litigation process, the merits of the claims on behalf of or against a person under a disability are explored and considered. The motion for approval of a settlement is the final step in that process; a process intended to ensure that the action is resolved on terms that are both reasonable and in the best interests of the person under a disability. The evidence on the motion for approval of the settlement includes that of counsel for the party under a disability with respect to the steps taken, etc. That evidence is intended to provide the judge reviewing the record with confidence that the party under a disability has been treated fairly both procedurally and on a substantive basis. [41] Parties to an application are not required to exchange pleadings, comply with discovery rules, or attend a pre-trial conference before they attend in court on the return of the application. An application proceeds directly to a hearing on the merits. It is the oral hearing that provides the opportunity for judicial oversight; the presiding judge considers the procedural fairness to and the substantive rights of the party under a disability. The court acknowledged that the parties could, as part of their application, request that the need for an oral hearing be dispensed with. However, the circumstances where the court would agree to such a request would be rare. Leonard v Saint-Vincent Hospital is a comprehensive summary of the rules and reasons behind court approval of settlements involving an incapable party and is worth a read.

2023-09-16T01:26:28.774034

https://example.com/article/3925

CAN ENYONE TELL ME WHAT THE INGREDIENT SHORTENING IS OR IF YOU CAN FIND IT UNDER A DIFFERANT NAME IN EUROPE (BELGIUM) thanks diana -- 02-02-2003 @ 5:38 PM Hi Longryder, It's Diana here. Shortening is what you might use in Europe called lard, or suet. We don't use too much animal lard here in the USA, we use a solid shortening in baking by the brand name of Crisco. Or we may use lard, but it is vegetable lard, not animal lard. It is a white colored solid shortening, and it is flavorless, so it can be used interchangebly for other fats in recipes such as butter, or margarine or oil. Hope this helps. Sincerely, Diana Diana's Desserts LONGRYDER -- 02-04-2003 @ 6:19 AM HI DIANA THANKS FOR EXPLAINING IT SINCERELY LONGRYDER diana -- 02-04-2003 @ 7:57 AM Hi Longryder, What DO you call lard or shortening in Belgium? What do you use for shortening in baking? Thank You, Diana LONGRYDER -- 02-04-2003 @ 8:59 AM HI DIANA SHORTENING OR LARD IS CALL'T SMOUT OR REUZEL WHICH IS ANIMEL FAT FROM PIGS (ONLY PIGS) WE DONT USE MOCH CHORTENING IN BELGIUM WE USE SMOUT ONLY IN BREAD BAKING FOR A MORE TRADISIONAL BREAD (WE ALSO USE IS IN FISH BAKING IT GIVES IT A SPECIAL FLAVOUR) IN FINE PASTRY WE SOMETIMES USE COCOLINE WHICH IS COCONUT FAT BECOUSE OF ITS FLAVOUR AND BECOUSE IT IS SO HARD WE NORMELY USE THE SPECIAL DESIGNED BUTTERS OR MARGERINES FOR FINE PASTRY WE HAVE A HOLE RANGE FOR PASTRY, PUFT PASTRY, CAKES, DANISH PASTRY, WITH DIVEREND FLAVOURS (CAROTEEN GIVES IT A MORE YELLOW AND TRADICIONAL LOOK OR VANILLE WHO HASE A VANILLE FLAVOUR)EXC EXC EXC HOPE THIS INFO HELP AND ANSWERS YOUR QUESTION

2024-03-31T01:26:28.774034

https://example.com/article/4173

475 F.Supp.2d 1403 (2007) In re BLUETOOTH HEADSET PRODUCTS LIABILITY LITIGATION. No. MDL 1822. Judicial Panel on Multidistrict Litigation. February 20, 2007. Before WM. TERRELL HODGES,[*] Chairman, D. LOWELL JENSEN,[*] J. FREDERICK MOTZ,[**] ROBERT L. MILLER, Jr., KATHRYN H. VRATIL, DAVID R. HANSEN and ANTHONY J. SCIRICA, Judges of the Panel. TRANSFER ORDER J. FREDERICK MOTZ, Acting Chairman. This litigation currently consists of thirteen actions as follows: four actions in the Central District of California, three actions in the Middle District of Florida, and an action each in the Eastern District of Arkansas, the Northern District of Illinois, the Southern District of Mississippi, the District of New Hampshire, the Eastern District of Oklahoma, and the Western District of Tennessee as listed on Schedule A.[1] Plaintiffs in a Central District of California *1404 action (Jones) move the Panel, pursuant to 28 U.S.C. § 1407, for an order centralizing this litigation in the Central District of California before Judge Dale S. Fischer. Defendants[2] and all responding plaintiffs[3] support plaintiffs' motion. On the basis of the papers filed and hearing session held, the Panel finds that the actions in this litigation involve common questions of fact, and that centralization under Section 1407 in the Central District of California will serve the convenience of the parties and witnesses and promote the just and efficient conduct of this litigation. Plaintiffs in each of the actions allege that defendants designed, manufactured, marketed, distributed and/or sold Bluetooth headsets, which are products that allow the wearer to use a mobile phone without holding the phone next to the face and without the necessity of wires connecting the phone to the headset. Plaintiffs assert, among other things, that use of the headsets for certain periods of time can cause noise-induced hearing loss. The actions are brought as nationwide or statewide class actions, and plaintiffs seek relief under various theories of liability, such as unjust enrichment, breach of express and/or implied warranties, and strict products liability. In addition, several actions contain claims that defendants violated various state consumer protection laws. Centralization under Section 1407 is necessary in order to eliminate duplicative discovery, prevent inconsistent pretrial rulings, and conserve the resources of the parties, their counsel and the judiciary. In accordance with the agreement of the parties to centralize this litigation in the Central District of California before Judge Fischer, the Panel is persuaded that this choice provides an appropriate transferee forum. Relevant discovery may be found in this district, inasmuch as defendant Plantronics is headquartered there. IT IS THEREFORE ORDERED that, pursuant to 28 U.S.C. § 1407, the actions listed on Schedule A and pending outside the Central District of California are transferred to the Central District of California and, with the consent of that court, assigned to the Honorable Dale S. Fischer for coordinated or consolidated pretrial proceedings with the actions listed on Schedule A and pending in that district. SCHEDULE A MDL-1822 — In re Bluetooth Headset Products Liability Litigation Eastern District of Arkansas Hayley Frye v. Motorola, Inc., C.A. No. 4:06-1533 Central District of California Michael Jones, et al. v. Motorola, Inc., C.A. No. 2:06-5182 Betsee Finlee v. GN Jabra North America, et al., C.A. No. 2:06-6280 Amy Karl v. Motorola, Inc., et al., C.A. No. 2:06-6706 Lori Raines v. Plantronics, Inc., C.A. No. 2:06-6708 Middle District of Florida Steve Edwards v. Motorola, Inc., C.A. No. 8:06-1909 Kyle Edwards v. Plantronics, Inc., C.A. No. 8:06-1910 Gary Hamrick v. GN Jabra North America, et al., C.A. No. 8:06-1911 *1405 Northern District of Illinois Martin Alpert, et al. v. Motorola, Inc., C.A. No. 1:06-5586 Southern District of Mississippi Jessica Smith v. Motorola, Inc., C.A. No. 2:06-242 District of New Hampshire Mark Davis v. GN Jabra North America, et al., C.A. No. 1:06-402 Eastern District of Oklahoma Jarred Swink v. Motorola, Inc., C.A. No. 6:06-456 Western District of Tennessee Mark Benfield v. Motorola, Inc., C.A. No. 2:06-2690 NOTES [*] Judges Hodges and Jensen took no part in the decision of this matter. [**] In light of the fact that Judge Motz could be a member of the putative class(es) in this litigation, he has filed with the Clerk of the Panel a formal renunciation of any claim that he may have as a putative class member, thereby removing any basis for a disqualification of Judge Motz on that ground. [1] The Panel has been notified of twelve potentially related actions pending in multiple federal districts. In light of the Panel's disposition of this docket, these actions will be treated as potential tag-along actions. See Rules 7.4 and 7.5, R.P.J.P.M.L., 199 F.R.D. 425, 435-36 (2001). [2] Motorola, Inc.; Plantronics, Inc. (Plantronics); GN Jabra North America; and GN Netcom, Inc. [3] Plaintiffs in eleven actions and six potential tag-along actions.

2024-02-14T01:26:28.774034

https://example.com/article/8402

_GatheredModuleInfo = provider( fields = { "name": "Name of the module, may be `None`.", "module_path": "depset of jars that make up the module path so far.", "jars": "Jars to include in the module.", "source_jars": "Source jars to include in the module.", "java_info": "A merged JavaInfo of all the entries in `jars`.", }, ) JavaModuleInfo = provider( fields = { "name": "Name of the module.", "module_path": "depset of jars to include on the module path", }, ) # In order to construct the module path, we do this: # * `JavaModuleInfo`: use the module path from that # * maven coordinates: add the runtime output jars to the module path # * otherwise: just accumulate jars _ATTR_ASPECTS = [ "deps", "exports", "runtime_deps", ] def _infer_name(tags): names = [tag[len("maven_coordinates="):] for tag in tags if tag.startswith("maven_coordinates=")] if len(names) == 0: return None if len(names) > 1: fail("Only one set of maven coordinates may be specified") exploded = names[0].split(":") # We want the group id and artifact id. If the artifact id begins # with the last segment of the group id, then remove it. groups = exploded[0].split(".") final = groups[-1] + "-" if exploded[1].startswith(final): return (exploded[0] + "." + exploded[1][len(final):]).replace("-", "_") return (exploded[0] + "." + exploded[1]).replace("-", "_") def _java_module_aspect_impl(target, ctx): name = _infer_name(ctx.rule.attr.tags) all_deps = [] [all_deps.extend(getattr(ctx.rule.attr, attr, [])) for attr in _ATTR_ASPECTS] all_infos = [dep[_GatheredModuleInfo] for dep in all_deps] nameless_infos = [info for info in all_infos if not info.name] jars = depset(direct = target[JavaInfo].runtime_output_jars, transitive = [info.jars for info in nameless_infos]) source_jars = depset(direct = target[JavaInfo].source_jars, transitive = [info.source_jars for info in nameless_infos]) derived = "unknown" if JavaModuleInfo in target: derived = "from java module info" module_path = target[JavaModuleInfo].module_path jars = target[JavaInfo].runtime_output_jars source_jars = target[JavaInfo].source_jars java_info = target[JavaInfo] elif name: derived = "by name" module_path = depset(direct = target[JavaInfo].runtime_output_jars, transitive = [info.module_path for info in all_infos]) java_info = java_common.merge([info.java_info for info in all_infos if info.name] + [target[JavaInfo]]) else: derived = "by default" module_path = depset(transitive = [info.module_path for info in all_infos]) java_info = java_common.merge([info.java_info for info in all_infos if info.name]) return [ _GatheredModuleInfo( name = name, module_path = module_path, jars = jars, source_jars = source_jars, java_info = java_info, ), ] _java_module_aspect = aspect( _java_module_aspect_impl, attr_aspects = _ATTR_ASPECTS, required_aspect_providers = [ [JavaInfo], ], provides = [ _GatheredModuleInfo, ], host_fragments = [ "java", ], ) def _java_module_impl(ctx): name = _infer_name(ctx.attr.tags) all_infos = [dep[_GatheredModuleInfo] for dep in ctx.attr.deps] included_jars = depset(transitive = [info.jars for info in all_infos]) raw_merged_jar = ctx.actions.declare_file("%s-pre-module.jar" % ctx.attr.name) args = ctx.actions.args() args.add_all(["--output", raw_merged_jar]) args.add_all(["--normalize", "--exclude_build_data"]) args.add_all(included_jars, before_each = "--sources") ctx.actions.run( executable = ctx.executable._singlejar, outputs = [raw_merged_jar], inputs = included_jars, arguments = [args], ) # Now that we have a single jar, derive the module info. all_jars = depset(transitive = [info.module_path for info in all_infos]).to_list() module_path_jars = depset(transitive = [info.module_path for info in all_infos]) module_info_jar = ctx.actions.declare_file("%s-module-info.jar" % ctx.attr.name) args = ctx.actions.args() args.add_all(["--module-name", name]) args.add_all(["--in", raw_merged_jar]) args.add_all(["--output", module_info_jar]) args.add_all(ctx.attr.hides, before_each = "--hides") args.add_all(ctx.attr.uses, before_each = "--uses") args.add_all(module_path_jars, before_each = "--module-path") ctx.actions.run( executable = ctx.executable._module_generator, outputs = [module_info_jar], inputs = depset([raw_merged_jar], transitive = [info.module_path for info in all_infos]), arguments = [args], ) # Now merge the input jars and the module info into a single unit. # Bazel's singlejar strips the manifest of all useful information, # which is suboptimal, so we don't use that. module_jar = ctx.actions.declare_file("lib%s.jar" % ctx.attr.name) inputs = depset([module_info_jar], transitive = [info.jars for info in all_infos]) args = ctx.actions.args() args.add_all(["--output", module_jar]) args.add_all(inputs.to_list(), before_each = "--sources") ctx.actions.run( executable = ctx.executable._merge_jars, outputs = [module_jar], inputs = inputs, arguments = [args], ) # Generate the ijar compile_jar = java_common.run_ijar( actions = ctx.actions, jar = module_jar, target_label = ctx.label, java_toolchain = ctx.attr._java_toolchain[java_common.JavaToolchainInfo], ) # Create the merged source jar src_jar = java_common.pack_sources( actions = ctx.actions, output_jar = module_jar, source_jars = depset([module_info_jar], transitive = [info.source_jars for info in all_infos if not info.name]).to_list(), java_toolchain = ctx.attr._java_toolchain[java_common.JavaToolchainInfo], host_javabase = ctx.attr._javabase[java_common.JavaRuntimeInfo], ) # TODO: This JavaInfo needs to have the JavaInfos of all jars included in module stripped java_info = JavaInfo( output_jar = module_jar, source_jar = src_jar, compile_jar = compile_jar, deps = [info.java_info for info in all_infos], exports = [ex[JavaInfo] for ex in ctx.attr.exports], runtime_deps = [dep[JavaInfo] for dep in ctx.attr.deps], ) return [ DefaultInfo(files = depset([module_jar, src_jar])), JavaModuleInfo( name = name, module_path = depset(direct = [module_jar], transitive = [info.module_path for info in all_infos]), ), java_info, ] java_module = rule( _java_module_impl, attrs = { "deps": attr.label_list( mandatory = True, providers = [ [_GatheredModuleInfo], ], aspects = [ _java_module_aspect, ], ), "exports": attr.label_list( providers = [ [JavaInfo], ], ), "hides": attr.string_list( doc = "List of package names to hide", default = [], ), "uses": attr.string_list( doc = "List of classnames that the module uses", default = [], ), "_javabase": attr.label( cfg = "host", default = "@bazel_tools//tools/jdk:current_java_runtime", providers = [java_common.JavaRuntimeInfo], ), "_java_toolchain": attr.label( default = "@bazel_tools//tools/jdk:current_java_toolchain", ), "_merge_jars": attr.label( default = "//java/client/src/org/openqa/selenium/tools/jar:MergeJars", executable = True, cfg = "host", ), "_module_generator": attr.label( default = "//java/client/src/org/openqa/selenium/tools/modules:ModuleGenerator", executable = True, cfg = "host", ), "_singlejar": attr.label( default = "@bazel_tools//tools/jdk:singlejar", allow_files = True, executable = True, cfg = "host", ), }, )

2024-07-13T01:26:28.774034

https://example.com/article/5931

Clinical significance of serum retinol binding protein-4 levels in patients with systemic sclerosis. Retinol binding protein-4 (RBP-4) is a member of adipocytokines, which is potentially associated with fibrosis, vasodilation, and angiogenesis in addition to insulin resistance. To investigate the clinical significance of serum RBP4 levels in patients with systemic sclerosis (SSc), which is a systemic autoimmune disease characterized by fibrosis and vasculopathy. Serum RBP4 levels were determined by enzyme-linked immunosorbent assay in 62 SSc patients and 19 healthy controls. Similar to patients with chronic kidney disease, serum RBP4 levels inversely correlated with estimated glomerular filtration rate in SSc patients with renal dysfunction. Therefore, analyses were carried out by excluding SSc patients with estimated glomerular filtration rate <60 mL/min/1.73 m(2) . Serum RBP4 levels were significantly lower in diffuse cutaneous SSc (dcSSc) than in control subjects [median (25-75 percentile); 25.8 μg/mL (19.6-47.0) vs. 43.1 μg/mL (31.7-53.4), P < 0.05], while there was no significant difference between limited cutaneous SSc (lcSSc) [28.0 μg/mL (25.4-43.3)] and control subjects. In both of dcSSc and lcSSc, patients with Raynaud's phenomenon had RBP4 levels significantly lower than those without. Furthermore, serum RBP4 levels inversely correlated with pulmonary function test results in dcSSc and with right ventricular systolic pressure in lcSSc. CONCLUSION Decreased RBP4 levels are associated with the prevalence of Raynaud's phenomenon in dcSSc and lcSSc, with the severity of interstitial lung disease in dcSSc, and with the degree of pulmonary vascular involvement in lcSSc, suggesting the possible contribution of RBP4 to the pathological events in this disorder.

2024-02-05T01:26:28.774034

https://example.com/article/4873

Summary ======= Gaddam et al[@B1] has reported a study entitled \"Persistence of nondysplastic Barrett\'s esophagus (BE) identifies patients at lower risk for esophageal adenocarcinoma (EAC): results from a large multicenter cohort.\" in the September issue of Gastroenterology 2013. Using outcomes of a large multicenter cohort study of patients with BE, the authors evaluated how the persistence of BE without dysplasia over multiple consecutive surveillance using esophagogastroduodenoscopic examinations could have an effect in risk stratification of patients with BE. Based on the number of consecutive surveillance endoscopies presenting BE without dysplasia, they identified 5 groups of patients with BE without dysplasia. Group 1 was determined as the patients with BE without dysplasia at their first esophagogastroduodenoscopy (EGD). Group 2 was determined as the patients with BE without dysplasia at their first 2 consecutive EGDs. Similarly, groups 3, 4 and 5 were determined as the patients with BE without dysplasia at 3, 4, and 5 consecutive surveillance EGDs. A logistic regression model was used to determine whether the persistence of BE without dysplasia had independent effect for the development of esophageal high grade dysplasia (HGD) and/or EAC. In results, a total of 1,401 patients with BE were finally included (median follow-up period; 5.0 ± 3.9 years). The annual risk of HGD and/or EAC in group 1 (n = 1,401), group 2 (n = 826), group 3 (n = 484), group 4 (n = 280) and group 5 (n = 173) was 0.75%, 0.57%, 0.41%, 0.44% and 0.00%, respectively (*P* for trend = 0.021). The persistence of BE without dysplasia, based on multiple surveillance endoscopies, was associated with a gradually lower likelihood of progression to HGD and/or EAC (OR, 0.67; 95% CI, 0.51-0.91; *P* \< 0.01), after adjusting for age, sex and length of BE. Through these results, the authors suggested that the persistence of BE without dysplasia over several endoscopic examinations could identify patients who are at low risk for development of HGD and/or EAC, and after all, these findings support lengthening surveillance intervals or discontinuing surveillance in the patients with persistence of BE without dysplasia. Comment ======= Barrett\'s esophagus is a well-established risk factor for EAC, increasing incidence of EAC at a greater rate (approximately 6-fold increase since 1975).[@B2] The AGA guideline suggest that endoscopic surveillance would be performed in patients with BE without dysplasia as 3-5 years intervals.[@B3] In the similar manner, the other Western guidelines recommend the enrollment of patients with BE in surveillance programs.[@B4],[@B5] Recent large cohort and epidemiological studies have shown that the risk of EAC in patients with BE without dysplasia is much lower than the assumed risk of 0.5%/year, which has been the basis for current surveillance guidelines. Data from these current studies bring into question about the rationale for ongoing surveillance in patients with BE without dysplasia.[@B6],[@B7] Also, some argue lengthening the surveillance intervals or discontinuing the surveillance of patients with persistent BE without dysplasia. Despite the increased evidence showing a low risk of EAC in patients with BE without dysplasia, the inability to stratify the risk in BE patients has led to the ongoing recommendation for lifelong endoscopic surveillance of all patients with BE without dysplasia. Until now, surveillance intervals were not standardized but have been consistent with guidelines.[@B7] In this study, Gaddam et al[@B1] showed that the stable persistence of BE without dysplasia over several endoscopic examinations identified the patients at a very low risk of progression to EAC. The findings of this study should help to inform future decisions on surveillance intervals in patients with BE without dysplasia. As far as I know, this is the first study to show that patients with multiple endoscopic examinations presenting persistence of BE without dysplasia have a decreased risk of EAC. Despite the small sample size for groups 4 and 5 which may have resulted in a type II error and the possibility of a higher-risk cohort due to the study being performed in referral academic centers, the topic of this study is considered to be important and to have major values. Unlike the Western countries, the Asian countries including Korea have the important distinct characteristics. First, although the prevalence of gastroesophageal reflux is increasing, the prevalence of BE and EAC has remained low in most Asian countries.[@B8]-[@B10] Second, upper endoscopic examination is easily accessible and available, evenly familiar in Asians, especially in Koreans, in contrast to the Western population. At present, however, there is no guideline for surveillance of BE in Asia, and also the data regarding the management and long-term outcome of BE are extremely limited in Asia. Therefore, more studies of BE in this geographic area are warranted. Furthermore, the guidelines for surveillance and management suitable for this area will be required. Financial support: None. Conflicts of interest: None.

2023-08-27T01:26:28.774034

https://example.com/article/8891

Hi, unless there is a particular problem you need to solve, you should not trouble to try to update your basic drivers manually. Where did you get your drivers from? What is the URL? Dell Driver & Downloads site. There are sites that seem to be manufacturer sites for drivers when you search for them. What exactly did you update? The drivers as you say... did you also do a Windows update or an upgrade? Can you list the updates you made? Please post a screenshot of your Update History. To clarify: Have you - upgraded Win 10 to the latest build? - upgraded to Win 10 for the first time? I would uninstall the TrackPad driver, reboot and let Windows reinstall it. Or, if you can roll back the driver and know the previous version was ok, you could try that. Please complete your system specs to include your disk(s). By way of routine checks: Download and run Hard Disk Sentinel (trial) and post a screenshot.To post a screenshot please use the Insert Image icon above your post to the left of the video icon. Then Browse to your image, select it and upload it. E.g. png, jpg. Thanks. I am using a differant computer to post (a Mac actually). I went to the Dell site>drivers&downloads>Drive Doctor>, I did a scan and it showed me 5 drivers that require updates - I went ahead and paid for 1-year and it gave me the updates for the drivers. I have been using Windows 10 Home Edition for over a year, an update keeps coming up atomatically telling me I need security updates before I can get the Windows update - then the download starts, I'm not sure if it's downloading security updates or Windows updates - in any case after the download the install begins but never finishes - I get a message that - "unable to configure for update" I have no idea what it means. I have ran Re-image several times and it shows nothing wrong. My ComputerYou need to have JavaScript enabled so that you can use this ... -that's not an official DELL site, is it? Drivers from manufacturers are available for free download. However, they may well not be available for Win 10 if the PC is older. What's the URL? (Internet address) Please follow the instructions I've already given for starters to establish a base line. Thanks. My ComputerYou need to have JavaScript enabled so that you can use this ... Here is the URL for the drivers Driver Doctor - Download Device Drivers | Update Drivers and Fix Driver Problems, this was a link in the Dell site on the page that showed all the different drivers. I have run the Hard Disk Sentinal and the report shows "Perfect, no action required". The Windows 10 Assistant t window keeps popping up and is running in the background. I am now posting from the Dell Laptop. I'm not sure how to find out which drivers were updated. My ComputerYou need to have JavaScript enabled so that you can use this ... and I'm using the Diagnostic tool. I'm also going to try the System Configuration tool. I do that the drivers are for BIOS, Windows 7, 64-bit, & Windows Vista, 64-bit. Nothing for Windows 10. I've been searching for the Dell site I found last night that had the DriverDr link. My ComputerYou need to have JavaScript enabled so that you can use this ... I have downloaded the https://www.microsoft.com/en-ca/soft...load/windows10 onto a USB Flashdrive and am doing an install from the Flashdrive. I have uninstalled the printer software and disconnected the printer Ethernet cable. I also went to the Dell Support Site and ran diagnostics it gave me a Windows Trouble Wiz which found something with the Dell HD that was corrected. The Green Update screen is now up to 45% and going ------ here's hoping!!! I'm have no idea why the underline is happening, I've tried highliting and clicking underline, but it remains. Well that hope just got lost, the white rectangular screen again with "Windows could not configure one or more system componants" it does not say what the system components are. My ComputerYou need to have JavaScript enabled so that you can use this ... Hi, I don't know if this is the right forum to post this in but for the past few weeks my computer will stop working and when I finally get some reaction from it there will be a notice at the bottom of the page that says something like "msn has... This PC runs fine most of the time, but often, as many as 2 or 3 times a day it can crash. Many times it just powers off, however it sometimes shows a BSOD," MEMORY_MANAGEMENT 0x0000001a 00000000`00000403 ... Ok . I am getting random system lockups, can happen anytime. Sometimes using when using chrome or just on desktop. Happens most often when windows is on login screen, or sometime right before windows loads. Playing any game I have will cause crash... About Us Windows 10 Forums is an independent web site and has not been authorized, sponsored, or otherwise approved by Microsoft Corporation. "Windows 10" and related materials are trademarks of Microsoft Corp.

2023-08-26T01:26:28.774034

https://example.com/article/5458

Osteochondritis dissecans of the talus: diagnosis and treatment in athletes. Osteochondritis dissecans of the talus is a subset of osteochondral lesions of the talus that also includes osteochondral fractures, avascular necrosis, and degenerative arthritis. Osteochondral lesions of the talus can be associated with injury to the ankle. This article discusses the anatomy, pathoanatomy, history, physical examination, imaging, management algorithm, and outcomes of surgical treatment of osteochondral lesions in these patients. This article also presents the authors' recommended surgical technique.

2023-09-28T01:26:28.774034

https://example.com/article/8243

It was an unusual, eerie, encounter. It was an unusual, eerie, encounter. In cold water, greened by plankton blooms, the sperm whales were milling round. Slowly, ponderously, some were sinking head-first and disappearing into the haze beneath me. Others were rising from the depths, rejoining those on the surface, then dissolving away into the distance. Two, each probably weighing between 20 to 25 metric tons drifted in from behind me, so close that their sudden bulk, appearing at my shoulder startled me. Constant chattering – strings of clicks and creaks – passed between the whales. One phrase, if such a human term is appropriate for describing sperm whale communication, seemed to be recurring. ‘Zizzzzzz…tuc tuc tuc”, is the best I can do at replicating it on paper. Louder and more sharply defined, it was, perhaps, emanating from the largest whale, a cow close to 11 metres in length. This cow appeared to be the centre of attention. The others, females and adolescents of both sexes, began aggregating around it. Earlier, from the boat, we had observed a single large cow lob-tailing; raising its flukes to the sky and repeatedly bringing them down to bash the surface of the sea. On a whale this size, those flukes can weigh around two metric tons-about as much as a large four-wheel drive SUV. And so, each impact of flukes on water generated a resounding whooomp! that would have been audible for long distances underwater, and sent shock-waves of white spray flying into the air. We had watched through the morning as small groups of whales had congregated on the surface, off the Azores. Sperm whales typically spend ten to fifteen minutes on the surface between foraging dives. On this day, in calm seas, under low cloud, numbers of them were laying on the surface for hours, side by side – “logging” as this behaviour is called. At one time, we could count seventeen whales in one group. Now, snorkeling in the water, I could see the flukes of this largest whale clearly. It was the same cow we had observed from the boat. After swimming past me, it sank quite quickly, head first, until it almost disappeared. This was not a dive. There had been no final head-raised breath that characteristically signals the beginning of a sperm whale’s profoundly deep descent. They’ve been recorded reaching depths of around 3000 metres in their hunts for squid, octopus, and fish. We don’t know how they regulate their buoyancy. There’s certainly no gush of bubbles issuing from their blow-holes as there is when a scuba diver sinks by dumping air from a buoyancy vest. Nor do they have the scuba diver’s reserve of compressed air for re-inflation. But, by one imperceptible means or another, they seem to be able to control their orientation in the water with ease, and, as I watched, the large cow arrested its descent. Other whales began to cluster around it. They remained in this formation for some minutes. Two or three individuals peeled away. Others moved in. Eventually the assemblage sank deeper than I could follow by free-diving and disappeared from view. The water around me, more than a thousand metres deep, was empty. Only the distinct static that is the so-far unbroken code of sperm whale conversation, if that’s what it is, continued unabated. Later in the afternoon, with the clouds now lifted, a group of whales wallowed on the surface, up sun, not far from the boat. In water clouded by those dense blooms of plankton, and against the strong light, it was difficult to identify individual whales. But one unmistakable feature was visible; the curled and floppy flukes of an infant whale, recently emerged from the womb of its mother. So, was this what the day had been all about? Had we witnessed some form of ritual surrounding the birth of a sperm whale? Had the lob-tailing cow been summoning the clan for the event? Had far-flung individuals gathered to greet the newcomer? Were they now dispersing to relay the news? We don’t know. We had observed comparable events some years previously, some 250 nautical miles west of this latest encounter: a large lob-tailing cow whale; a brief but intense gathering of whales; new-born whales in the area within hours of the lob-tailing. Writing in the late 1700s, French scientist Rene Lesson ruefully observed “What an impenetrable veil covers our knowledge of cetacea! Groping in the dark, we advance in a field strewn with thorns.” It is still true today. The observations described above might be connected. They might not. In providing us glimpses of their lives, these enigmatic animals, the world’s largest toothed predators, leave swirling in their wakes, not just sheets of sloughed skin and detritus, but hosts of unanswered questions. Note: Photographs taken under permit issued by Secretaria Regional do Mar, Ciência e Tecnologia with precautions taken to avoid disturbance to the animals. Swimming with whales is forbidden in the Azores without written permission of the Secretaria. All the photographs we take are made available free of charge for any non-commercial uses related to research, education, or conservation. We routinely share them with whale and cephalopod scientists in various parts of the world. For access to these shots, please click here to contact us.

2023-09-28T01:26:28.774034

https://example.com/article/3916

Im Dschungel von Kambodscha haben Forscher die Überreste einer bislang unbekannten Metropole entdeckt. Sie war womöglich die größte Stadt des 12. Jahrhunderts. Archäologen haben riesige mittelalterliche Siedlungsreste in der Nähe der Tempelanlage Angkor Wat in Kambodscha entdeckt. Sie nutzten spezielle Lasermessungen aus der Luft, mit deren Hilfe sie Strukturen auch unter bewaldeten Böden erkennen konnten. „Wir haben ganze Städte unter den Wäldern entdeckt, von denen bislang niemand wusste, dass sie dort sind“ sagte Forscher Damian Evans der britischen Zeitung „The Guardian“. Am Berg Phnom Kulen nordöstlich von Angkor Wat sei bislang nur ein kleiner Teil der Siedlung Mahendraparvata bekannt gewesen. Nach den neuen Daten sei sie so groß wie Kambodschas Hauptstadt Phnom Penh. Evans präsentiert die Ergebnisse im „Journal of Archaeological Science“ vom kommenden Montag. Mehr zum Thema 1/ Experten gehen laut „Guardian“ davon aus, dass es sich bei der Entdeckung um die größte Metropolregion des 12. Jahrhunderts handeln könnte. Archäologen sprechen in der Zeitung von einem der bedeutendsten Forschungserfolge der vergangenen Jahre.

2024-04-11T01:26:28.774034

https://example.com/article/7488

Availability: Residents of some states may not be eligible for a short term cash loan based upon lender requirements. Our company does not guarantee that completing an inquiry form will result in you being approved by a service provider or lender, being offered a loan product with satisfactory rates of terms, nor receiving a loan from a service provider or lender. The lender you are approved by may not offer the best possible terms and borrowers should always compare all available options before making any decisions. A recent law journal note summarized the justifications for regulating payday lending. The summary notes that while it is difficult to quantify the impact on specific consumers, there are external parties who are clearly affected by the decision of a borrower to get a payday loan. Most directly impacted are the holders of other low interest debt from the same borrower, which now is less likely to be paid off since the limited income is first used to pay the fee associated with the payday loan. The external costs of this product can be expanded to include the businesses that are not patronized by the cash-strapped payday customer to the children and family who are left with fewer resources than before the loan. The external costs alone, forced on people given no choice in the matter, may be enough justification for stronger regulation even assuming that the borrower him or herself understood the full implications of the decision to seek a payday loan.[25] The report was reinforced by a Federal Reserve Board (FRB) 2014 study which found that while bankruptcies did double among users of payday loans, the increase was too small to be considered significant.[49][50] The same FRB researchers found that payday usage had no positive or negative impact on household welfare as measured by credit score changes over time.[51] Consider a small loan from your credit union or a small loan company. Some banks may offer short-term loans for small amounts at competitive rates. A local community-based organization may make small business loans to people. A cash advance on a credit card also may be possible, but it may have a higher interest rate than other sources of funds: find out the terms before you decide. In any case, shop first and compare all available offers. NOTICE: The Federal Equal Credit Opportunity Act prohibits creditors from discriminating against credit applicants on the basis of race, color, religion, national origin, sex, marital status, age (provided the applicant has the capacity to enter into a binding contract); because all or part of the applicant's income derives from any public assistance program; or because the applicant has in good faith exercised any right under the Consumer Credit Protection Act. The Federal agency that administers compliance with this law concerning this creditor is the Consumer Financial Protection Bureau, 1700 G Street NW, Washington DC 20006 and the Federal Trade Commission, Equal Credit Opportunity, Washington DC 20580. Check Into Cash advances range anywhere from $50 to $1,000 depending on your state of residence. The qualifications for our loans are typically less stringent than for conventional loans. In exchange for the cash you need, Check Into Cash charges a small fee. This fee along with the original amount borrowed is typically due on your next day of pay. Payday loans are legal in 27 states, and 9 others allows some form of short term storefront lending with restrictions. The remaining 14 and the District of Columbia forbid the practice.[64] The annual percentage rate (APR) is also limited in some jurisdictions to prevent usury.[65] And in some states, there are laws limiting the number of loans a borrower can take at a single time. In AK, AZ, DC, FL, HI, IN, KY, MI, MN, MT, ND, NE, OK, OR, SD, WA and WY all installment loans are originated by FinWise Bank, a Utah chartered bank, located in Sandy, Utah, member FDIC. California applicants may be funded by one of several lenders, including: (i) FinWise Bank; or, (ii) OppLoans, a licensed lender in certain states. All loans funded by FinWise Bank will be serviced by OppLoans. Certain credit cards and other financial products mentioned in this and other articles on Credit.com News & Advice may also be offered through Credit.com product pages, and Credit.com will be compensated if our users apply for and ultimately sign up for any of these cards or products. However, this relationship does not result in any preferential editorial treatment. Payday loans are designed to help people cover short-term cash needs until their next payday. Also referred to as cash advances, payday loans can be a practical and secure way to tide you over when unexpected expenses crop up. If you have expenses related to an auto accident, emergency medical expenses, or other unexpected bills, a cash advance could help you bridge the gap. In terms of online lending, a cash advance usually refers to a short-term loan that is quickly funded to your bank account after approval. Typically, the amount you borrow for a cash advance loan is relatively small, which often means you can pay it back in only one or two payments. These short-term loans are very similar to what many people call payday loans, but cash advance loans don't always require a single repayment on payday. Affiliate Disclosure: There are links on this site that can be defined as affiliate links. This means that I may receive a small commission (at no cost to you) if you purchase something when clicking on the links that take you through to a different website. By clicking on the links, you are in no way obligated to buy. Please Note:The material on this site is provided for informational purposes only and is not financial advice. Always consult a professional before making any financial decisions.

2024-06-10T01:26:28.774034

https://example.com/article/4400

549 N.E.2d 71 (1990) Paul B. OVERHAUSER, Defendant-Appellant, v. Mark FOWLER, d/b/a Fowler Earth Moving, Plaintiff-Appellee. No. 30A01-8907-CV-254. Court of Appeals of Indiana, First District. January 29, 1990. *72 Thomas G. Stayton, Ronald D. Gifford, Baker & Daniels, Indianapolis, for defendant-appellant. Raymond S. Robak, Wolf, Robak & Murphy, Greenfield, for plaintiff-appellee. BAKER, Judge. STATEMENT OF THE CASE Defendant-appellant, Paul Overhauser (Overhauser), appeals the trial court's grant of plaintiff-appellee, Mark Fowler's (Fowler), motion for default judgment. We reverse. STATEMENT OF THE FACTS On May 4, 1987, Fowler filed a mechanic's lien against real estate titled in the names of Lloyd and Marilyn Roach. At that time, part of the Roaches' property was the subject of litigation between the Roaches, Thomas and Deborah Wilson, and Overhauser. Overhauser had contracted to buy the property from the Wilsons, who were buying it from the Roaches on land contract. On October 16, 1987, Overhauser gave Fowler notice that he claimed an interest in the property against which Fowler had a lien and that Fowler had to file suit against Overhauser within 30 days or lose his claim against him.[1] Fowler filed suit against Overhauser, the Wilsons, the Roaches, and the Roaches' agent, Robert Yowler, on November 13, 1987. On November 17, 1987, and again on November 23, 1987, Fowler attempted to execute service on Overhauser by certified mail. Before the postal service returned the unaccepted service on December 2, 1987, Fowler's counsel sent a letter to Overhauser's counsel suggesting a settlement meeting. On January 25, 1988, Overhauser was served with a summons and cross-complaint by the Wilsons. Fowler never executed service on Overhauser and Overhauser never answered Fowler. On September 19, 1988, the trial court entered a default judgment against Overhauser. Overhauser then filed a motion to set aside default judgment and after the trial court denied the motion, he filed a motion to correct error which the trial court also denied. Overhauser appeals. ISSUES Overhauser presents several issues for our review which we restate as follows: Whether the trial court had personal jurisdiction over Overhauser. DISCUSSION AND DECISION Overhauser argues the trial court did not have personal jurisdiction over him because he did not receive sufficient service of process required by the Indiana trial rules. A trial court lacks personal jurisdiction over a defendant and therefore cannot issue a binding judgment against that defendant if service on him was insufficient or not executed. Smith v. Tisdal (1985), Ind. App., 484 N.E.2d 42; Chesser v. Chesser (1976), 168 Ind. App. 560, 343 N.E.2d 810. Given the requirements of proper service, the issue of whether Overhauser received sufficient service for the trial court to gain personal jurisdiction over him is dispositive. In deciding this issue, we note first that while the decision to set aside a default judgment is largely the province of the trial court, Indiana's policy disfavors default judgments and prefers resolution of a cause on its merits. Green v. Karol (1976), 168 Ind. App. 467, 344 N.E.2d 106. Relevant to our decision are Ind. Trial Rules 4(E), 4.1 and 4.11. Trial Rule 4(E) requires that "[t]he summons and complaint shall be served together unless otherwise ordered by the court." Trial Rule 4.1 authorizes service by certified or registered mail and T.R. 4.11 governs the manner *73 of certified/registered mail service. If a plaintiff chooses to effect service under T.R. 4.11, he is under an affirmative duty to complete service by alternate means if the service by mail is returned unaccepted.[2] Fowler did not fulfill this duty; he failed to request the clerk to reissue service after the original service was returned unaccepted. Record at 104. Instead, Fowler asks us to rule that Overhauser's knowledge of the suit will excuse Fowler's failure to comply with T.R. 4(E) and T.R. 4.11. Overhauser gave Fowler 30 days notice to file suit, received two notices of attempts to deliver certified mail, received correspondence from Fowler's counsel suggesting settlement, and received a summons and a cross-claim from the Wilsons. In light of these facts, Fowler argues Overhauser had sufficient notice of Fowler's suit for the trial court to have personal jurisdiction over Overhauser. Prior cases, however, make clear "actual knowledge of the suit does not satisfy due process or give the court in personam jurisdiction." Glennar Mercury Lincoln, Inc. v. Riley (1975), 167 Ind. App. 144, 152, 338 N.E.2d 670, 675. "This is, of course, particularly true for service of process and other such notice of initial pleadings." Abrahamson Chrysler Plymouth v. Insurance Co. of North America (1983), Ind. App., 453 N.E.2d 317, 321. Overhauser's knowledge does not discharge Fowler's duty to serve him. Fowler relies especially on the summons Overhauser received with the Wilsons' cross-complaint because it twice named Overhauser as a defendant in a suit brought by Fowler. The summons alone is insufficient, however. Trial Rule 4(E) unequivocally requires the complaint to accompany the summons and it did not here.[3] Moreover, in the only reported Indiana case on this issue, our supreme court rejected Fowler's argument. Finley v. Richards (1819), 1 Blackf. (2d ed.) 487, 1 Blackf. (3rd ed.) 464. In Finley, the court applied Sec. 5 of the Indiana Territorial Acts of 1814, CH. VIII and held that an alias summons served without a petition (the early analog of a complaint) was insufficient to confer personal jurisdiction over a defendant.[4] Fowler also relies on T.R. 4.15(F) to cure his failure to execute service.[5] Trial Rule 4.15(F), however, exists "to avoid challenges to service of process based upon technical defects." 1 W. HARVEY, INDIANA PRACTICE § 2 AT 300 (1987). It does "not cure service of process when there has been no service on a party." Roberts v. Watson (1977), 172 Ind. App. 108, 115, 359 N.E.2d 615, 620. Since Fowler never executed service on Overhauser, T.R.4.15(F) does not apply. As a result of Fowler's failure, the trial court never gained personal jurisdiction over Overhauser and its default judgment against him is void. Judgment reversed and remanded for proceedings in the trial court consistent with this opinion. ROBERTSON and MILLER, JJ., concur. NOTES [1] IND. CODE 32-8-3-10. [2] In pertinent part, T.R. 4.11 provides "[i]f a mailing by the clerk of the court is returned without acceptance, the clerk shall reissue the summons and complaint for service as requested, by the person seeking service. [3] The pre-printed summons, certified by the clerk, stated that a copy of the complaint was attached to it, but the trial court specifically found that the attached document was the Wilsons' cross-complaint. Record at 105. [4] In addition to being compatible with the plain language of T.R. 4(E), Finley is in accord with the modern trend in several jurisdictions. See, e.g., County of Milwaukee v. Schmidt, Garden & Erikson (1967), 35 Wis.2d 33, 150 N.W.2d 354; Paskus, Gordon & Hyman v. Peck (1964), 246 N.Y.S.2d 874, 41 Misc.2d 1004; VanSickle v. VanSickle (1977), 137 Cal. Rptr. 568, 68 Cal. App.3d 728. [5] T.R. 4.15(F) provides: Defects in Summons. No summons or the service thereof shall be set aside or be adjudged insufficient when either is reasonably calculated to inform the person to be served that an action has been instituted against him, the name of the court, and the time within which he is required to respond.

2024-04-18T01:26:28.774034

https://example.com/article/3694

Q: EmberJS: Multiple templates, one page I have a website that is largely rendered by Ruby on Rails, with several sections the page using Ember. Up until now, we have been using separate ember apps to manage each section, but that's starting to create too much multi-app overhead. Is there a way to attach the Ember app to the body (as the rootElement) and have each section build as independent components or views, without having to wrap the body in a script tag? The current modules we have: * Shopping cart summary * Account details & menu in the header * And a few others There's now a requirement to duplicate the account details section in another part of the page. The only way to do this today would be to attach the account app to an element that wraps both sections...but then this would also wrap the cart summary area and cause that app to fail. Ideally I'd like to be able to combine all these apps and just tell Ember where to put the views on the page. Is this possible? A: I have prototyped something that seems to work. You make the rootElement the body and then use childView.appendTo($('.some-element')); to put the Ember view where you want. Instead of doing it manually, you can create a few custom script blocks (type="text/x-ember-view") that automate that for you. Demo: http://emberjs.jsbin.com/motile/7/edit?html,js,output

2024-02-10T01:26:28.774034

https://example.com/article/4747

40 Best Fonts For Websites From Professional Designers It seems very exciting to choose very stylish and unique fonts for our websites, but in the real practice it is not very good to be freely experimental with the available fonts while designing a web page. Some designers who are not much experienced choose whatever font they like, but they visit their website on different computers, they sometimes do not find the same font which they had used. It is because other machines may not have those uncommon fonts. Simple Font: To deal with this problem it is good to stick to safe fonts while designing a website. Another important point to consider is the readability of the selected font. People come to different sites for different purposes but everyone wants to go through a website with ease and comfort, so the font must be easily readable. Some fonts only show good results when they are displayed on high resolution screens, and have a poor visibility on low resolution, so that point also has to be considered. This can be experimented by changing the resolution and opting out those fonts who are not showing up well at different situations. Choosing the right font for your website copy is important, since it will affect the way your readers perceive the tone of your page, whether it is serious or friendly and casual. A particular font cannot always fulfill the requirements of websites meant for different purposes. There are some fonts which are quite popular in web designing industry, as their reliability is much trusted by designers. It is a good practice to use a sans serif font if you are free to select a font of your choice. These fonts have many positive points which make their positions in the top rank. Ariel is most basic sans serif font and widely used. It has a good readability even on low resolution atmosphere. It has a modern look and is well streamlined. Verdana is another frequently used font for computers. This font was developed by Microsoft in its attempt to bring out a more legible font. This font was widely accepted by internet and computer users, which was first shipped with internet explorer 3. Comic sans serif is another easily available font but has an informal look making in inappropriate for serious and professional websites. Some other fonts that can be safely chosen include Helvetica, Times New Roman and Trebuchet.

2024-01-17T01:26:28.774034

https://example.com/article/4547

Introduction {#Sec1} ============ Vertigo is one of the most common complaints reported in daily medical practice \[[@CR1], [@CR2]\], with a general prevalence of 17--32 %, among the population over 80 years up to 39 % \[[@CR3]\]. The prevalence of vertigo increases with age \[[@CR4], [@CR5]\] resulting in a steady rise in incidence due to the global rise in general life expectancy. Especially in the elderly, vertigo is commonly associated with significant morbidity and even immobilisation or chronic invalidism, especially when aggravated by falls and resulting injury \[[@CR6], [@CR7]\]. In general, vertigo can impose considerable limitations on the patients' ability to cope with daily activities, leading to a self-perceived reduction in the quality of life \[[@CR4], [@CR8]\] Therefore, the availability of an effective antivertigo treatment is of particular importance in medical practice, both to provide instant relief to the affected patients and for pharmacoeconomic reasons. As vertigo may be associated with a wide range of underlying disorders, it constitutes a particular challenge in both primary and secondary care. In many cases, subjective vertigo symptoms can hardly be unambiguously attributed to a defined organic correlate, often leading to rather unspecified diagnoses. In particular, general practitioners (GPs) require an effective vertigo treatment option without having direct access to sophisticated diagnostic equipment needed for detailed diagnostics, especially in elderly patients with a high number of complex comorbidities. The fixed combination of cinnarizine 20 mg and dimenhydrinate 40 mg (Arlevert^®^, Hennig Arzneimittel, Floersheim am Main, Germany) has been successfully used in the treatment of vertigo of various origins for more than three decades. Its efficacy is based on a dual mechanism of action, with the specific calcium channel blocker cinnarizine acting predominantly on the peripheral vestibular system and the antihistamine dimenhydrinate acting predominantly on the central vestibular system. The efficacy and safety of the combination preparation has been demonstrated in numerous randomised, double-blind, controlled clinical trials comprising a variety of patient populations \[[@CR9]--[@CR17]\]. The present noninterventional study was undertaken to determine whether the good efficacy and tolerability of the fixed-combination preparation reported in controlled clinical trials can be reproduced in routine clinical practice, which in turn provides deeper insight into the product's effectiveness and safety when used in larger patient collectives. Patients, materials and methods {#Sec2} =============================== This prospective, open-label, noninterventional study has been carried out in primary and secondary care private practices throughout Germany between January 1992 and August 2008. Physicians, who prescribed the commercially available fixed-combination preparation for the treatment of vertigo patients in the course of normal clinical practice, have been offered to document the treatment outcome on standardised case report forms provided by the sponsor. Thus, prior to the inclusion of a patient in the study, it was at the participating physicians own discretion to use the combination preparation for the treatment of patients with vertigo of various origins in accordance with the terms of the summary of product characteristics (SmPC). For the selection of patients, no specific requirements were in place regarding inclusion or exclusion criteria, apart from the contraindications and safety recommendations listed in the product information. The physicians determined the starting dose (recommended dosage 3 × 1, up to 5 × 1 tablet per day), administration frequency and any later changes to either dose or frequency as well as the duration of treatment in line with the applicable German SmPC and independent of study documentation. Demographic data, medical history, differential diagnosis and duration of vertigo, prior medical treatment, concomitant diseases and concomitant medications were registered on the occasion of the first visit. Patients rated the intensity of vertigo and concomitant symptoms (see below) by means of a 5-point verbal rating (or visual analogue) scale ranging from no vertigo (0) to slight (1), medium (2), strong (3) and very strong (4), both at the beginning (baseline) and at the end of the observational period. For approximately one third of the study participants, additional data were registered on the occasion of an interim visit after approximately 2 weeks. Furthermore, the physician assessed the overall ('global') efficacy by means of a 5-point verbal rating scale from very much improved (4) to much improved (3), slightly improved (2), not improved (1) and deteriorated (0). The change in a validated MVS between baseline and end of observation has been used as the primary efficacy endpoint. The MVS was calculated as the mean of the following six (unprovoked) vertigo symptoms: dysstasia and walking unsteadiness, staggering, rotary sensation, tendency to fall, lift sensation and blackout. Secondary efficacy endpoints included the changes in concomitant symptoms (nausea, vomiting, sweating, tachycardia, tinnitus, impaired hearing) and the physicians' global judgement of efficacy. A subgroup analysis was performed with respect to the type of vertigo. The safety evaluation comprised the documentation of adverse events (AEs), including their classification with respect to seriousness, severity and possible relatedness to the study medication (adverse drug reaction, ADR). Additionally, the tolerability of the treatment was assessed by the physician on a 4-point verbal rating scale (very good, good, moderate or poor) on the occasion of the final visit. Due to the observational character of the study, analyses were descriptive in nature. After double data entry, statistical analyses were performed using SAS 9.1.3 (SAS Institute Inc.). Assuming continuous but not necessarily normal distribution of the data, the Wilcoxon signed rank test was used to test the changes in the intensity of vertigo symptoms on the 5 % significance level. In order to account for possible deficiencies in the distributional properties of the MVS, as an alternative for parametric analysis (based on the mean), the median was calculated for baseline, final visit and for the changes between the two visits. For the median of the changes, nonparametric 95 % confidence intervals (CI95 %) based on order statistics are provided in addition to the parametric confidence intervals for the mean (based on the t-test model). Statistical analysis was performed using the intent-to-treat data set (safety population), including all patients who had been enrolled in the study. Missing data were imputed conservatively, that is values missing at baseline and at the end of observation were replaced by the best and the worst corresponding value of a patient in the sample, respectively. In addition, all analyses were performed on the basis of all available data without imputing missing values ('data as available') in order to check the robustness of the results. Results {#Sec3} ======= Overall, 443 private practices throughout Germany participated in this observational study and contributed data from a total of 1275 patients. The physicians involved in the study mainly comprised GPs/internal medicine specialists, otorhinolaryngologists and neurologists/psychiatrists (Table [1](#Tab1){ref-type="table"}). Male (34 %) and female (66 %) patients aged between 15 and 99 years (mean age: 61.2 years) were included in the study; female patients were on average slightly older than male patients (for details see Table [2](#Tab2){ref-type="table"}). The mean duration of vertigo before enrolment in the study was approximately 1 year and ranged from less than 1 month to up to 20 years (Table [2](#Tab2){ref-type="table"}). Nearly one third of the patients had taken antivertigo drugs before inclusion in the study. The most commonly used drugs were a homeopathic combination preparation, betahistine and *Ginkgo biloba* (Table [3](#Tab3){ref-type="table"}). It can be assumed that in most cases the prior medical treatment had been discontinued because of insufficient effectiveness, and for this reason it was replaced by the combination preparation. Table 1Distribution of patients *(n* = 1275) among the medical disciplines participating in the studyMedical disciplineNumber of patients%GPs/internal medicine specialists72957.2Otorhinolaryngologists41932.9Neurologists/psychiatrists1219.5Others (e.g. surgeons)60.4 Table 2Selected demographic data and other baseline characteristics (safety population; *n* = 1275): number (*n*) and percentage (%) of patients, mean value of the respective parameter (Mean), standard deviation (SD) and range (minimum (Min), median (Med) maximum (Max))ParameterPatientsStatistical datana%MeanSDRangeMinMedMaxAge *(years)*127261.215.5156399Male4333459.414.7156193Female8376662.115.7196499Height *(cm)*1238167.98.1146168193Weight (*kg)\]*123673.011.53972120BMI *(kg/m* ^*2*^ *)*123625.93.514.725.742.2Duration of vertigo *(months)*118912.323.1\< 13240^a^Data not available for all enrolled patients Table 3Antivertigo drug treatment before enrolment in the study: a total of 400 drugs were documented in 375 of 1275 patients (29.4 %); number *(n)* and percentage (%) of patientsAntivertigo drug*n*%Homeopathic combination11428.50Betahistine9523.75*Ginkgo biloba*6917.25Dimenhydrinate4310.75Naphtidrofuryl338.25Sulpiride276.75Others (e.g. cinnarizine, meclizine)194.75 For 799 patients (62.7 %), 1476 concomitant diseases have been documented, the most frequent of which were essential (primary) hypertension *(n* = 289), chronic ischaemic heart disease *(n* = 136), unspecified diabetes mellitus *(n* = 95) and disorders of lipoprotein metabolism and other lipidaemias *(n* = 71). A total of 603 patients (47.3 %) had received 1206 concomitant medications; ACE inhibitors (plain: *n* = 96, combinations: *n* = 21), beta blocking agents *(n* = 102), analgesics and antipyretics *(n* = 88), blood glucose lowering drugs excluding insulin *(n* = 87), vasodilators used in cardiac diseases *(n* = 83) and lipid-modifying agents *(n* = 61) were the most frequently prescribed drugs. The vast majority of study participants had been prescribed either the standard dosage of 3 × 1 tablet per day of the fixed combination (89.1 % of the patients) or a reduced dosage of 2 × 1 tablet per day (8.6 %). For 110 patients, a change of the dosage in the course of the treatment has been reported, with a dose increase in 27 patients and a dose reduction in 83 patients. The average duration of treatment was 8.4 ± 1.5 weeks, with a broad range of between less than 1 week and 162 weeks (median: 6 weeks). For 424 patients, additional data were registered on occasion of an interim visit after around 2 weeks of treatment. Only 21 patients (1.7 %) terminated the study prematurely, 7 because of complete remission of vertigo symptoms until the interim visit, 2 because of inadequate efficacy, 3 due to AEs and 9 for unknown reasons. Based on 1275 patients (safety population), treatment with the fixed-combination preparation led to a distinct improvement of the MVS in the course of the observational period. The mean value of the MVS was reduced from 1.46 at baseline to 0.57 at the end of observation, corresponding to a 61 % reduction by 0.89 (CI95 %: 0.83--0.94), whereas the median reduction from baseline was 0.93 (CI95 %: 0.83--1.00). The reduction was statistically significant (Wilcoxon signed rank test: *p*  \< 0.001); for more details see Table [4](#Tab4){ref-type="table"} and Fig. [1a](#Fig1){ref-type="fig"}. A total of 282 patients (22.1 %) were completely symptom-free at the end of observation. Even after the relatively short period of treatment until the interim visit, a statistically significant mean reduction of the MVS by 0.52 (CI95 %: 0.43--0.62; *p* \< 0.001) from 1.66 to 1.14 has been achieved (Fig. [1b](#Fig1){ref-type="fig"}), with a median reduction from baseline of 0.57 (CI95 %: 0.50--0.62). Table 4Reduction of the mean vertigo score (MVS) depending on type of vertigo and with respect to all patients: number *(n)* and percentage (%) of patients, mean value (Mean) with standard deviation (SD), median (Med) and 95 % confidence intervals (CI95 %)PatientsMVSReduction in MVSType of vertigoBaselineFinal visit*n*%MeanMedMeanMedMeanMedCI95 %^a^(SD)(SD)(SD)MeanMedPeripheral vestibular39931.31.46 (0.73)1.330.54 (0.82)0.220.92 (1.13)1.000.82--1.040.97--1.03Central vestibular1138.91.38 (0.60)1.330.50 (0.59)0.330.88 (0.75)0.830.73--1.020.67--1.00Combined central-peripheral26120.51.59 (0.66)1.520.74 (0.71)0.580.85 (0.82)0.830.75--0.950.82--0.97Cervical876.81.42 (0.73)1.330.38 (0.52)0.171.04 (0.83)1.000.87--1.220.83--1.17Non-vestibular554.31.54 (0.76)1.500.67 (0.91)0.330.87 (1.24)1.170.54--1.210.67--1.48Unspecified35928.21.38 (0.66)1.330.54 (0.74)0.330.84 (0.89)0.830.75--0.930.83--1.00All patients1274^b^1001.46 (0.69)1.330.57 (0.75)0.330.89 (0.97)0.930.83--0.940.83--1.00^a^95 % confidence intervals refer to the mean and median changes from baseline^b^Data for one patient not available Fig. 1Reduction of the mean vertigo score (MVS (Mean score of six single, unprovoked vertigo symptoms (dysstasia and walking unsteadiness, staggering, rotary sensation, tendency to fall, lift sensation and blackout)) after treatment with a fixed-combination preparation of cinnarizine 20 mg and dimenhydrinate 40 mg. **a** Difference between baseline and end of observation (*n* = 1275). Vertigo symptoms improved significantly (*p* \< 0.001). Approximately, 22% of the patients have been completely symptom-free at the end of observation. **b** Difference between baseline and interim visit (*n* = 424). Vertigo symptoms already improved significantly (*p* \< 0.001) after approximately 2 weeks of treatment The single vertigo symptoms most often reported as 'severe' or 'very severe' prior to the treatment were rotary sensation (43.7 %), dysstasia and walking unsteadiness (37.1 %) and staggering (30.6 %). At the end of observation, these symptoms were either disappeared or rated as 'mild' by 78.4 %, 64.6 %, respectively 69.0 % of the same patients. Vertigo of peripheral or combined central-peripheral origin had been diagnosed in more than half of the study participants, whereas the type of vertigo could not be specified in 28 % of the patients. With respect to each type of vertigo, the reduction of the MVS was statistically significant (Wilcoxon signed rank test: *p* \< 0.001); the mean and median reductions from baseline together with their 95 % CI are given in Table [4](#Tab4){ref-type="table"}. The mean score of the four vegetative concomitant symptoms nausea, vomiting, sweating and tachycardia decreased from 0.85 ± 0.80 to 0.37 ± 0.69, corresponding to a significant reduction by 56.5 % (0.48 ± 0.99; CI95 %: 0.42--0.53; *p* \< 0.001). During the interim visit *(n* = 424), the reduction of the vegetative symptoms by 30.8 % (0.32 ± 0.96; CI95 %: 0.23--0.41) was already statistically significant *(p* \< 0.001). Nausea and vomiting in particular, both frequently associated with vertigo, improved by 84 % and 85 %, respectively in the course of treatment. At baseline, nausea was reported by 832 (65.3 %) of all the patients. The mean value decreased from 1.25 ± 1.16 to 0.20 ± 0.44 (Fig. [2](#Fig2){ref-type="fig"}), which corresponds to a reduction by 84 % (1.05 ± 1.07; CI95 %: 0.14--0.26). Regarding only those 227 patients who described either 'severe' *(n* = 165) or 'very severe' *(n* = 62) nausea at baseline, 197 (86.8 %) reported either no *(n* = 118) or only 'mild' nausea *(n* = 79) at the end of observation. Fig. 2Reduction of the concomitant symptoms nausea, vomiting and tinnitus in the course of treatment with the fixed-combination preparation of cinnarizine 20 mg and dimenhydrinate 40 mg. All reductions in intensity were significant (*p* \< 0.001) A total of 404 patients (31.7 %) suffered from vomiting at baseline. The mean value improved by 85 % from 0.52 ± 0.91 to 0.08 ± 0.29 (reduction by 0.44 ± 0.87; CI95 %: 0.06--0.10; Fig. [2](#Fig2){ref-type="fig"}). In those 76 patients who initially reported the intensity of vomiting as 'severe' *(n* = 55) or 'very severe' *(n* = 21), the symptom was either no longer present *(n* = 52) or of only mild extent *(n* = 19) at the end of observation, which means a distinct improvement in 93.4 % of the patients. Tinnitus was initially reported by 666 patients (52.2 %), and the mean value improved by 51 % from 1.03 ± 1.21 to 0.51 ± 0.73 (reduction by 0.52 ± 0.86; CI95 %: 0.47--0.55; Fig. [2](#Fig2){ref-type="fig"}). In those 213 patients who rated the intensity of tinnitus at baseline as 'severe' *(n* = 150) or 'very severe' *(n* = 63), the symptom was either no longer present *(n* = 28) or of only mild extent *(n* = 83) at the end of observation, corresponding to a distinct improvement in more than half of the patients. On the occasion of the final consultation, the overall (global) efficacy was assessed by the physician using a 5-point verbal rating scale. After treatment with the fixed-combination preparation, the health condition was rated as either 'very much improved' in 40 % or 'much improved' in 45 % of the patients; 'slightly improved' and 'not improved' were reported for 13 and 2 % of the patients, respectively, whereas no deterioration of the health condition occurred in any patient. In total, 58 nonserious AEs have been reported by 53 patients (4.2 %), 51 of which were judged as ADRs by the physician. The majority of ADRs were classified according to System Organ Class (SOC) (MedDRA^®^) as gastrointestinal disorders *(n* = 25; reported by 1.8 % of all the patients) or nervous system disorders *(n* = 15; 1.2 % of all the patients). The most commonly reported ADRs were somnolence/tiredness *(n* = 8), dry mouth *(n* = 8), nausea *(n* = 6) and headache *(n* = 6). All 51 ADRs were characterised as nonserious and the majority was of mild (45.1 %) or moderate (23.5 %) intensity. Moreover, the fixed-combination preparation did not show a clinically relevant effect on blood pressure. The physician's assessment of tolerability of the treatment by means of a 4-point verbal rating scale was as follows: 'very good' in 843 (68.5 %), 'good' in 366 (29.7 %), 'moderate' in 15 (1.2 %) and 'poor' in 7 (0.6 %) out of 1231 patients. Discussion {#Sec4} ========== The present noninterventional study shows that the low-dose fixed combination of cinnarizine and dimenhydrinate, as used under real life conditions, is effective at reducing both vertigo and frequently associated concomitant symptoms such as nausea and vomiting in patients suffering from vertigo of various origins. The study population largely mirrored a representative picture of patients with vertigo seen in daily medical practice. Particularly with respect to age and gender, the enrolled patients represented a typical vertigo population with a mean age of 61 years; the majority of patients being women \[[@CR18]\]. The complexity of the vestibular system and limited availability of sophisticated diagnostic equipment often make it difficult or even impossible to establish an exact diagnosis, especially within the primary and secondary care setting. However, vertigo can impose considerable limitations on the patients' ability to cope with daily activities, reduce quality of life and could become chronic if left untreated. Therefore, the authors believe that a rapid and effective symptomatic treatment is not only acceptable but in fact can be generally recommended. For this purpose, the fixed combination of cinnarizine and dimenhydrinate is particularly suited because of its broad range of efficacy in the treatment of vertigo. Due to the dual mode of action, with cinnarizine mainly acting on the peripheral vestibular system and dimenhydrinate on the central vestibular system, the combination preparation is well established as first-line treatment of vertigo in Germany and numerous other countries. The broad spectrum of patients with vestibular (central, peripheral or combined central-peripheral) vertigo, as well as with vertigo of non-vestibular or unspecified origin included in this noninterventional study largely reflects the routine conditions in daily medical practice. Moreover, the recommended standard dosage of 3 × 1 tablet/day of the combination preparation had been prescribed to the vast majority of the patients (89 %), typically for the duration of around 6--8 weeks. A validated composite score comprising six single vertigo symptoms (MVS) was considered the most appropriate approach to measure the patients' outcome and due to its easy use, maximum assessment compliance could be expected. Independent of the type of vertigo, treatment with the fixed-combination product led to a distinct overall reduction of vertigo symptoms by 61 %, with 22 % of all the patients being completely symptom-free at the end of observation. Even in patients suffering from vertigo of non-vestibular or unknown origin, the symptoms improved significantly. These results indicate that the fixed combination was effective in the symptomatic treatment of vertigo of various origins. Furthermore, the overall therapeutic success is adequately reflected in the physician's global efficacy rating, where the vertigo complaints have been assessed as either 'very much improved' or 'much improved' in 85 % of the patients. This general judgement of efficacy might have been positively influenced by the distinct improvement of various concomitant symptoms, in particular nausea and vomiting, both frequently associated with vertigo and significantly reduced by 84 % and 85 %, respectively in the course of treatment. All in all, the fixed-combination preparation showed the effectiveness which was to be expected from the findings of numerous controlled clinical trials. However, due to the noninterventional, open-label design, the present study has a number of limitations. These comprise---among others---the heterogeneity of the diagnoses with inclusion of patients suffering from different kinds of vertigo, and in particular the lack of a control group. Therefore, conclusions concerning the favourable efficacy outcomes should be made with caution. Moreover, the susceptibility of vertigo symptoms to placebo effects must be adequately taken into account when interpreting the efficacy results. Patients suffering from vertigo for a longer period of time, as was the case for many patients participating in this study, and who might have seen several other doctors before, generally feel a higher degree of discomfort and thus may be more susceptible to spontaneous healing; this is especially true in a study setting, where participants receive more attention than usual, which may contribute to create higher beliefs and expectations of improvement. In a previously conducted randomised, double-blind, active- and placebo-controlled study \[[@CR13]\], the same MVS as used in the present noninterventional study showed for the combination preparation a mean reduction from 1.98 at baseline to 0.47 after 4-week treatment (− 1.51) as compared to a mean reduction from 1.91 to 1.08 (− 0.83) in the placebo group (unpublished results). The results showed that the combination preparation was nearly twice as effective as placebo in reducing vertigo symptoms; the difference was statistically significant (*p* \< 0.001). The safety evaluation showed a low rate of adverse reactions, mostly of mild or moderate intensity, all of them nonserious and without revealing any new or hitherto unknown side effects. The very good safety profile of the fixed-combination preparation is further reflected in a low dropout rate (one third because of complete remission of vertigo) and the physicians' favourable rating of overall tolerability. In conclusion, this noninterventional study demonstrates the favourable antivertiginous efficacy and safety profile of the fixed combination of cinnarizine and dimenhydrinate in daily medical practice. The study corroborates previous findings of numerous interventional, randomised, double-blind, controlled clinical trials \[[@CR9]--[@CR17]\] and confirms their validity in a setting representative of clinical routine. Because of its dual mode of action and synergistic effect, with cinnarizine acting as calcium antagonist and dimenhydrinate as antihistamine, the fixed-combination product effectively reduces vertigo and associated symptoms caused by a great variety of underlying vestibular or non-vestibular disorders. Especially in the primary and secondary care setting, where an exact diagnosis and subsequent causal treatment is quite often not possible, the combination preparation provides immediate symptomatic relief and is therefore considered as first-line treatment for patients with vertigo of various origins. This observational study has been sponsored by Hennig Arzneimittel, Floersheim am Main, Germany. The authors would like to thank N. Burchardi and D. Schremmer (GKM, Munich, Germany) for the statistical analysis as well as all study participants and physicians involved in the study. Conflict of interest {#d30e1348} ==================== The authors A.W. Scholtz, J. Ilgner and B. Loader declare that there is no conflict of interest in relation to this article. B.W. Pritschow and G. Weisshaar are employees of the sponsor. The participating physicians have been reasonably compensated for their efforts to document the study data on the case report forms.

2024-03-19T01:26:28.774034

https://example.com/article/6965

Pathways associated with lignin biosynthesis in lignomaniac jute fibres. We generated the bast transcriptomes of a deficient lignified phloem fibre mutant and its wild-type jute (Corchorus capsularis) using Illumina paired-end sequencing. A total of 34,163 wild-type and 29,463 mutant unigenes, with average lengths of 1442 and 1136 bp, respectively, were assembled de novo, ~77-79 % of which were functionally annotated. These annotated unigenes were assigned to COG (~37-40 %) and GO (~22-28 %) classifications and mapped to 189 KEGG pathways (~19-21 %). We discovered 38 and 43 isoforms of 16 and 10 genes of the upstream shikimate-aromatic amino acid and downstream monolignol biosynthetic pathways, respectively, rendered their sequence similarities, confirmed the identities of 22 of these candidate gene families by phylogenetic analyses and reconstructed the pathway leading to lignin biosynthesis in jute fibres. We also identified major genes and bast-related transcription factors involved in secondary cell wall (SCW) formation. The quantitative RT-PCRs revealed that phenylalanine ammonia-lyase 1 (CcPAL1) was co-down-regulated with several genes of the upstream shikimate pathway in mutant bast tissues at an early growth stage, although its expression relapsed to the normal level at the later growth stage. However, cinnamyl alcohol dehydrogenase 7 (CcCAD7) was strongly down-regulated in mutant bast tissues irrespective of growth stages. CcCAD7 disruption at an early growth stage was accompanied by co-up-regulation of SCW-specific genes cellulose synthase A7 (CcCesA7) and fasciclin-like arabinogalactan 6 (CcFLA6), which was predicted to be involved in coordinating the S-layers' deposition in the xylan-type jute fibres. Our results identified CAD as a promising target for developing low-lignin jute fibres using genomics-assisted molecular approaches.

2024-06-28T01:26:28.774034

https://example.com/article/6679

[A child with pulmonary hypertension: from etiological study to therapeutic decisions]. Pulmonary hypertension is a rare but devastating disease, with poor prognosis and high mortality. The disease may present as Primary Pulmonary Hypertension where no clear aetiology can be identified, or be related to a variety of underlying conditions. This is a rare disease in paediatric age. The authors present the clinical case of a 4 years old child, admitted in Paediatric Department of S. João Hospital for syncope episode. The diagnosis of pulmonary hypertension was made by echocardiogram. Ulterior studies revealed pulmonary disease (obliterans bronchiolitis). The treatment included a calcium channel blocker (diltiazem), an endothelin antagonist (bosentan) and supplemental oxygen. This is the first case of obliterans bronchiolitis diagnosed during etiological study for pulmonary hypertension, in our Pediatrics Department. In this case we could not determine the pulmonary disease precipitating event.

2023-09-13T01:26:28.774034

https://example.com/article/8373

Q: Yii selecting only database columns? I used findAll() in Yii to search only two columns in database. but it results in a array with that two attributes which also contains virtual variables define in Model. I only need database columns not virtual variables. Please answer. Thanks in advance A: You may use like this: $connection = Yii::app()->db; $command = $connection->createCommand('select * from your_table_name'); $row = $command->queryAll();

2024-06-20T01:26:28.774034

https://example.com/article/2794

As shown in FIG. 1, many aircraft include a fairing at the upper surface 203 of a junction between the aircraft fuselage 205 and wing 201 (i.e. the upper surface of the wing root). One function of such fairings is to reduce or eliminate separation of the airflow in the region of the junction and thereby reduce viscous drag on the aircraft. A typical prior art wing root fairing 209 is in the form of a concave, wedge-shaped fillet (the upper surface of the which is represented by the mesh in FIG. 1). The fillet starts at a mid-chord region of the wing root and extends to a maximum cross-sectional area at, or slightly aft of, the trailing edge of the wing root. These known fairings are referred to herein as a “conventional wing root fairing”. When aircraft operate at transonic speeds, at least one shock may develop in the region of the wing root and/or over the upper surface of the inner wing. The shock may be undesirable for a number of reasons. For example, the shock can cause considerable wave drag and may also limit the amount of lift that the inner region of the wing generates. Embodiments of the present invention seek to provide a fairing for an aircraft, which removes or mitigates at least one of the above-mentioned problems.

2024-07-08T01:26:28.774034

https://example.com/article/7955

Pulmonary carcinoid associated with a parathormone producing melanoma. A rare presentation of hypercalcemia secondary to the probable ectopic production of parathormone by a malignant melanoma associated with a pulmonary carcinoid is discussed. We suggest the association of melanoma with multiple endocrine neoplasia.

2023-11-30T01:26:28.774034

https://example.com/article/9816

Google Analytics for developers - yashke http://blog.arkency.com/2012/12/google-analytics-for-developers/ ====== kevinconroy Here are two of my favorite tricks. You can do this just after you set your account ID: <!-- Async Tracking Code - http://code.google.com/intl/en-US/apis/analytics/docs/tracking/asyncTracking.html --> <script type="text/javascript"> var _gaq = _gaq || []; _gaq.push(['_setAccount', 'YOUR ANALYTICS ID GOES HERE']); _gaq.push(['_trackPageview']); //******************* // Trick #1: Track page load time in Google Analytics // (note: only works for HTML5 browsers) //******************* _gaq.push(['_trackPageLoadTime']); (function() { var ga = document.createElement('script'); ga.type = 'text/javascript'; ga.async = true; ga.src = ('https:' == document.location.protocol ? 'https://ssl' : 'http://www') + '.google-analytics.com/ga.js'; var s = document.getElementsByTagName('script')[0]; s.parentNode.insertBefore(ga, s); })(); //******************* // Trick #2: Add a Javascript error handler so that it creates an event in Google Analytics // whenever there's a CLIENT-SIDE javascript error //******************* window.onerror = function(message, file, line) { var sFormattedMessage = '[' + file + ' (' + line + ')] ' + message; _gaq.push(['_trackEvent', 'Errors', 'Browser', sFormattedMessage, null, true]); } </script> Update: Included complete GA code to address any confusion on order and values available in stack. ~~~ gulbrandr According to this page [0], _trackPageLoadTime() is deprecated because site speed reporting is enabled automatically for all users. Update: your 2nd trick is still relevant though [0] [https://developers.google.com/analytics/devguides/collection...](https://developers.google.com/analytics/devguides/collection/gajs/methods/gaJSApiBasicConfiguration#_gat.GA_Tracker_._trackPageLoadTime) ~~~ kevinconroy Thank you! I was unaware of this change. ------ dbarlett I'm a big fan of the GAS (Google Analytics on Steroids) wrapper [1]. One of the coolest features is firing GA events from embedded YouTube videos [2] to track viewer retention [3]. [1] <https://github.com/cardinalpath/gas> [2] <https://gist.github.com/2715896> [3] <http://i.imgur.com/QILnG.png> ------ dangrossman I was expecting something different with the "for developers" title. Perhaps replicating some of the features of MixPanel or KissMetrics, which can track all kinds of interesting things for developers -- which features users of your app use most, in which order they use those features, whether this week's signups are more engaged than last week's signups, etc. ~~~ iamchrisle I actually use event tracking a lot to track exactly that. For our clients, we not only know which features they're using most but by tracking validation errors in Google Analytics we also know what parts of the app is giving users trouble. Best part is, with Google Analytics you can see what people did before and after they ran into trouble and correct for the user experience. ~~~ swalberg This. We recently started doing this and the data it's provided has been awesome. ------ stephth Is anyone using GA to track mobile apps? The mobile SDKs shows a lot of potential until you start wondering about _offline_ usage, GA being a website tracker first. I couldn't find any final answers but from what I can see it might be a sore point: the SDK docs dodge the topic [1] and I see complaints, ie events can be batched for later but get the timestamps of when they were uploaded, instead of when they happened [2,3,4]. [1] [https://www.google.com/search?q=site:https://developers.goog...](https://www.google.com/search?q=site:https://developers.google.com/analytics/devguides/collection/ios/v2/%20offline) [2] [http://stackoverflow.com/questions/6618719/how-does- google-a...](http://stackoverflow.com/questions/6618719/how-does-google- analytics-for-android-handle-offline-app-usage) [3] [http://stackoverflow.com/questions/4484748/what-happens- with...](http://stackoverflow.com/questions/4484748/what-happens-with-iphone- google-analytics-calls-when-theres-no-internet-connect) [4] [http://productforums.google.com/forum/#!msg/analytics/132Eet...](http://productforums.google.com/forum/#!msg/analytics/132Eet7kVFE/rM_kp4j8uIEJ) ~~~ campnic We are using GA to track mobile apps. The local queuing and dispatch of hits to GA is covered here[1]. We've found it to be pretty reliable. You can also modify the dispatch time for testing, etc. [1][https://developers.google.com/analytics/devguides/collection...](https://developers.google.com/analytics/devguides/collection/android/v2/dispatch) ~~~ stephth _Note: Data must be dispatched and received by 4 a.m. of the following day, in the local timezone of each profile. Any data received later than that will not appear in reports._ Do your mobile apps require an Internet connection? From what I'm seeing I imagine that's a prerequisite to use GA. It's a deal breaker for me though, I can't intentionally throw away a slice of offline usage data (iPods, iPads, etc). ------ bluetidepro > _"You probably use most of basic features of Google Analytics - you know how > to get information how many visits was made each day, you know your users > browser segmentation etc. But how can you measure effects of your blog > post?"_ That hits the nail on the head. Great article, although I wish you went into it a bit more in depth on how to do those actions, how to do other actions, and then maybe talk more about the benefits. I love browsing Google Analytics but I will be the first to tell you that I don't really understand much from it, other than than the obvious things. I really wish I could figure out how to integrate it better with my web sites, like you quickly demoed. Again, I really suggest doing this same article with a bit more information. It would really help out those who are your target audience for this article. Thanks! :) ~~~ yashke Thanks, as I mentioned in other comment - I plan to digg deeper and share knowledge, so be patient :) ~~~ bluetidepro Oh, I must have missed that in the comments. I really appreciate that! Keep me posted, would love to see that article! Thanks! :) ------ wiremine You can also do this on the server side. Here is a Python implementation: <https://github.com/kra3/py-ga-mob> ~~~ thomasbachem This is the Python port of my <http://code.google.com/p/php-ga/> project :) ------ jgalt212 The article is interesting, but gives some bad instructions on how to track outbound links and also probably how to track form submissions. Because of the asynchronous nature of communications back/forth from Google Analytics if you load a new page before an event is properly tracked, you won't be able to see it on the GA Dashboard. Bad intel is worse than no intel at all. Here's what Google itself has to say on the matter: [http://support.Google.com/analytics/bin/answer.py?hl=en&...](http://support.Google.com/analytics/bin/answer.py?hl=en&answer=1136920) Here's how to correct one code example from the blog post: //this function is OK, but probably an unnecessary abstraction of a one-liner function trackEvent(category, action, label) { window._gaq.push(['_trackEvent', category, action, label]) } //this event handler will not track some non-negligible percentage of events $("article a").click(function(e) { var element = $(this) var label = element.attr("href") trackEvent("Outbound link", "Click", label) }); //corrected outbound link event handler which gives GA 100 ms to register //the event. higher than 100 risks UX degradation, lower increases the % //of untracked events. 100 ms is happy medium $("article a").click(function(e) { e.preventDefault(); //stay on the page for now var element = $(this) var label = element.attr("href") trackEvent("Outbound link", "Click", label) //leave the page after a short delay window.setTimeout("window.location.href='" + label + "'", 100); }); ~~~ simonw I'm a bit suspicous of that method... will it still work for people right clicking and opening in new window, or shift-clicking, or middle-clicking, or right clicking and copying the URL? ------ iamchrisle If you want to track if people are reading your blog, you can use the onscroll javascript event that fires events into Google Analytics. (eg: [http://cutroni.com/blog/2012/02/21/advanced-content- tracking...](http://cutroni.com/blog/2012/02/21/advanced-content-tracking- with-google-analytics-part-1/)) By looking at time to scroll, time to the end of the blog post, and comparing that to the number of unique page views per visit, you can tell if your content is engaging. ------ xyzzyb Those are some good basics. Tracking user actions can be very useful: I use it on movieterminals.com to see everything that gets typed into each console. The theory being that (one day?) I'll use that to enhance the scripts to work how people expect. Tracking an event per page 404 or 500 can also be very helpful. If you aren't already using something more robust to track errors you could even setup alerts to watch for those events and contact you. Goals are good, although funnels are even better. Finally: if you can afford it I've found that Clicky offers many great advantages over google analytics. More helpful default reports, a better realtime view, etc. ------ campnic At the risk of going off topic, a question about sampling and sampling rates. If I set sampling to 1%, will the visitor totals in the Google Analytics dashboards reflect 1% of my true values or do they compensate/extrapolate out to 100% based on the sampling rate? ~~~ iamchrisle No. There are two things here. Sampling rate for calculating page timing and using sampled data when generating reports. Confusingly, they are two different things with the same word "sample." Sampling rate only affects calculating page timing because it's client side and slows down the client. ([http://support.google.com/analytics/bin/answer.py?hl=en&...](http://support.google.com/analytics/bin/answer.py?hl=en&answer=1205784)) Google Analytics will collect all the unfiltered data for the web property. ([http://support.google.com/analytics/bin/answer.py?hl=en&...](http://support.google.com/analytics/bin/answer.py?hl=en&answer=2637192)) However, to speed up ad-hoc querying, like when you create a custom report, it will limit the amount of data it will fetch to generate that report in order to make the user interface faster. You can increase/decrease that using the slider. YOu will only see the slider after something like 250k unique pageviews. Google Analytics Premium increases the number. If you really want to get a better sense of page timing, you should look both at the client side timing and the server side timing together. All you can really control is stuff going out. You can't help it if the user is running a netbook with 512 megs of RAM :) ------ dudus If you want to extract more data from your site to Google Analytics I recommend GAS (Google Analytics on Steroids). <https://github.com/CardinalPath/gas> It adds these events and even more to your site. (I'm the main developer by the way.) ~~~ ApolloRising This is really impressive. ------ euroclydon How can you see individual user sessions using Google Analytics? In other words, how can I see, for an individual visitor, their landing page, sequence of subsequent page views, and finally their exit page? ~~~ iamchrisle Generally you should be paying attention to trends, not individual users. Either way: Landing pages: Go to Content > Site Content > Landing Pages What you probably want is to create an advanced segment: Landing page = something. You can use regex or an exact match term. Then go to audience > visitor flow, select the advanced segment you used and you can visually see how users navigated your site. Remember: Keep in mind that a user can technically visit your site using browser tabs. That would give you a report where people went from page A to page B even if there isn't a link on page A going to page B. Hence: Use GA to gain insight into trends. ------ instakill Perhaps I'm confused but what benefit do you get from using event tracking for an outbound click, and lastly what does ET have to do with real time? Thanks ~~~ polyfractal I use event tracking on my outbound clicks all the time. My side project is a vertical niche search engine, so I like to know when, where and how people are leaving the site (since that is the point of the app afterall). I have some of it tracked with internal code, but for a lot of things that don't need rigorous analysis/tracking, firing an outbound click event to GA is sufficient.

2023-10-05T01:26:28.774034

https://example.com/article/1940

Q: Problems w/ OpenJML Update Site When I try to install the openJML plugin from the update site at http://jmlspecs.sourceforge.net/openjml-updatesite I get the following error: An error occurred while collecting items to be installed session context was:(profile=epp.package.java, phase=org.eclipse.equinox.internal.p2.engine.phases.Collect, operand=, action=). Artifact not found: ... (with about 4 or 5 jars) I've tried installing previous versions of the plugin, but all result in similar "Artifact not found" errors. Anyone have any idea why this isn't working? Or have a workaround I could use to get the Eclipse plugin to work? Thanks in advance! A: A bug report has already been opened, but no one seems to care (yet): http://sourceforge.net/p/jmlspecs/bugs/397/ Seems that you have to compile your own version of it.

2024-01-16T01:26:28.774034

https://example.com/article/6602

A jury in Oakland, California, has awarded a couple $2 billion in punitive damages after concluding that sustained exposure to Monsanto Co.'s popular Roundup weed killer led to their cancer diagnoses. The couple will receive an additional $55 million for pain and suffering and to cover medical expenses. The Alameda County Superior Court jury deliberated for less than two days before reaching a verdict. Seventy-six-year-old Alva and 74-year-old Alberta Pilliod used Roundup for about 30 years for residential landscaping, which the jury believed played a "substantial factor" in their development of non-Hodgkin's lymphoma. Alva was diagnosed in 2011; his wife, Alberta, received the same diagnosis four years later. They are both in remission. Get Breaking News Delivered to Your Inbox Bayer, Monsanto's parent company, released a statement claiming that the couple had "long histories of illnesses known to be substantial risk factors for non-Hodgkin's lymphoma" and countered allegations that an active ingredient in Roundup, glyphosate, has been linked to cancer. Bayer said it plans to appeal Monday's verdict. Bayer's full statement on the jury's verdict in the glyphosate trial taking place in the California Superior Court for the County of Alameda Oakland, California to be posted shortly. Link to follow. pic.twitter.com/kuVTMzhS0B — Bayer US (@BayerUS) May 13, 2019 "The jury saw for themselves internal company documents demonstrating that, from day one, Monsanto has never had any interest in finding out whether Roundup is safe," an attorney for the couple, R. Brent Wisner, said in a statement sent to CBS News. "Instead of investing in sound science, they invested millions in attacking science that threatened their business agenda." This is the third lawsuit related to Roundup that Monsanto has lost in the state of California. Wisner co-represented plaintiffs in the prior two lawsuits as well. In the first, school groundskeeper Dewayne "Lee" Johnson was ultimately awarded $78.5 million. Johnson was diagnosed with non-Hodgkin's lymphoma in 2014 and regularly spraying a high-concentration version of Roundup known as Ranger Pro as part of his job from 2012 to 2016. A California federal court jury awarded more than $80 million to Edwin Hardeman, who was diagnosed with non-Hodgekin's lymphoma in 2015. Hardeman had used Roundup for more than 25 years on his Sonoma property. Lawsuits' effect on Bayer stock price The lawsuits have battered Bayer's stock since it purchased Monsanto for $63 billion last year, The Associated Press reports. Chairman Werner Wenning told shareholders at Bayer's annual general meeting last month that company leaders "very much regret" falls in its share price. At the same time, CEO Werner Baumann insisted that "the acquisition of Monsanto was and remains the right move for Bayer." Bayer's stock price closed Monday at $15.91 a share, down 45 cents or 2.76 percent per share, in trading on the New York Stock Exchange. The verdict was announced after the trading session closed, AP points out.

2024-04-28T01:26:28.774034

https://example.com/article/8618

Central Freight Bureau of Sri Lanka Central Freight Bureau of Sri Lanka Central Freight Bureau of Sri Lanka A LAW TO PROVIDE FOR THE ESTABLISHMENT OF THE CENTRAL FREIGHT BUREAU OF SRI LANKA FOR THE PURPOSE OF CENTRALIZATION OF BOOKING OF FREIGHT FROM SRI LANKA TO SUCH FOREIGN PORTS AS MAY BE DETERMINED BY THE MINISTER BY ORDER PUBLISHED IN THE GAZETTE; TO MAKE PROVISION FOR THE TERMINATION OF THE ACTIVITIES OF THE CEYLON FREIGHT BUREAU SET UP UNDER THE AEIGS SHIPPERS’ COUNCIL OF CEYLON; TO REGULATE THE POWERS AND DUTIES OF THE BUREAU AND TO PROVIDE FOR MATTERS CONNECTED THEREWITH OR INCIDENTAL THERETO. BE it enacted by the National State Assembly of the Republic of SRI Lanka as follows: – Short title and date of operation. 1. This Law may be cited as the Central Freight Bureau of Sri Lanka Law. No. 26 of 1973, and shall come into operation on. such date (hereinafter referred to as the ” appointed date “) as may be appointed by the Minister by Order published in the Gazette, Establishment of the Central Freight Bureau of Sri Lanka. 2. (1) There shall be established a Bureau which shall be called the Central Freight Bureau of Sri Lanka, (hereinafter referred to as ” the Bureau “‘). (2) The Bureau shall, by the name assigned to it by subsection (1), be a body corporate and shall have perpetual succession and a common seal and may sue and be sued in such name. Members of the Bureau. 3. The members of the Board of Directors of the Bureau shall be the members of the Bureau. Board of Directors. 4. (1) The Bureau shall have a Board of Directors consisting of not more than seven members appointed by the Minister. (2) A person shall be disqualified for being appointed, or continuing, as a Director if he is a Member of the National State Assembly. (3) Every Director shall hold office for three years unless he earlier resigns, dies, or is removed from office. (4) A Director may resign his office by letter addressed to the Minister. (5) A Director vacating his office by resignation or by the expiration of his term of office shall be eligible for reappointment. (6) The Minister may, without assigning a reason, remove any Director from office, and such removal shall not be called in question in any court or tribunal whether by way of appeal or writ or in any other manner whatsoever. (7) (a) If a Director vacates his office otherwise than by the expiration of his term of office the Minister may appoint any other person to be a Director in place of the Director who so vacates (b) Any Director appointed under paragraph (a) of this subsection, unless he earlier vacates office, shall hold office for the unexpired period of office of the Director whom he succeeds. (8) Where a Director becomes, by reason of illness or other infirmity, or absence from Sri Lanka, temporarily unable to perform the duties of his office, the Minister may appoint a fit person to act in his place for the period of such incapacity or absence. Remuneration of members of the Bureau. 5. All or any of the Directors may be paid such remuneration from the funds of the Bureau at such rates as the Minister may determine with the concurrence of the Minister in charge of the subject of Finance. Members of the Bureau to disclose interest in contract proposed to be made by the Bureau. 6. A Director who is in any way directly or indirectly interested in any contract made or proposed to be made by the Bureau shall disclose the nature of his interest at a meeting of the Board of Directors, The disclosure shall be recorded in the minutes of the Board of Directors, and such Director shall not take part in any deliberation or decision of the Board of Directors with respect to that contract: Provided that the interest which any Director of the Bureau may have in a contract by virtue of his being an officer of a Government Department or a public Corporation, or a Director of a public Corporation, shall be deemed not to be an interest within the meaning of this section. Quorum for meeting of the Board and regulation of procedure. 7. The quorum for any meeting of the Board of Directors shall be three and subject to the provisions of this Law, the Board of Directors may regulate its own procedure in regard to meetings of such Board and transaction of business at such meetings. Validity of acts or proceedings of the Board. 8. No act or proceeding of the Board of Directors shall be deemed to be invalid by reason only of the existence of any vacancy among its Directors or defect in the appointment of any Director thereof. Members of the Board to administer the affairs of the Bureau. 9. The Board of Directors of the Bureau shall administer the affairs, may exercise the powers, and shall perform the duties of the Bureau. Delegation of powers and duties of the Board. 10. (1) The Board of Directors may delegate to the Chairman, a Director or employee of the Bureau any of its powers and duties. (2) Every person to whom any power or duty is delegated under subsection (1) shall exercise or perform such power or duty subject to the general or special directions of the Board of Directors. Chairman of the Board. 11. (1) The Minister shall appoint the Chairman of the Board of Directors from among the Directors. (2) If the Chairman of the Board of Directors is, by reason of illness or other infirmity or absence from Sri Lanka, temporarily unable to perform the duties of his office, the Minister may appoint one of the Directors to act in his place. (3) The meetings of the Board of Directors shall be presided over by the Chairman appointed under subsection (1), if present, but if such Chairman is not present at the time fixed for holding a meeting of the Board of Directors, the Directors present shall choose one of their number to preside. (4) The Chairman may resign the office of the Chairman by letter addressed to the Minister. (5) The Minister may, without assigning a reason, terminate the appointment of the Chairman and such termination shall not be called in question in any court or tribunal whether by way of appeal or writ or in any other manner whatsoever. (6) Subject to the provisions of subsections (4} and (5), the term of office of the Chairman shall be the period of his office as a member of the Board of Directors. (7) The Chairman of any meeting of the Board of” Directors shall, in addition to his own vote, have a casting vote. Seal of the Bureau. 12. (1) The seal of the Bureau shall be in the custody of the Board of Directors, or any officer of the Bureau authorized in that behalf by such Board. (2) The seal of the Bureau may be altered in such manner as may be determined by the Board of Directors. (3) The seal of the Bureau shall not be affixed to any instrument or document except in the presence of two Directors both of whom shall sign the instrument or document in token of their presence, or where two Directors are not available, by one Director and an officer authorized specially for such purpose by the Board of Directors. Powers of the Minister in relation to the Bureau. 13. (1) The Minister may give to the Board of Directors directions in writing as to the performance of the duties and the exercise of the powers of the Bureau, and such Board of Directors shall give effect to such directions. (2) The Minister may, from time to time, direct in writing the Board of Directors to furnish to him, in such form as he may require, returns, accounts and other information with respect to the property and business of the Bureau and such Board of Directors shall carry out every such direction. (3) The Minister may, from time to time, order all or any of the activities of the Bureau to be investigated and reported upon by such person or persons, as he may specify, and upon such order being made, the Board of Directors shall afford all such facilities, and furnish all such information, to the said person or persons as may be necessary to carry out the order. Objects of the Bureau. 14. The objects of the Bureau shall be- (a) to provide for a central freight booking office for allocation of freight space on any ocean going vessel, in respect of goods, produce and merchandise of whatsoever class or description that shall be shipped from any port in Sri Lanka to any destination outside Sri Lanka; (b) to ensure the aggregation of goods, produce and merchandise of whatsoever class or description that shall be shipped from any port in Sri Lanka to any destination outside Sri Lanka with a view to ensuring economic loads to ocean going vessels calling at the ports of Sri Lanka; (c) to rationalize the frequency of calls and the availability of vessels for the carriage of goods, produce and merchandise of whatsoever class or description that shall be shipped from any port in Sri Lanka to any destination outside Sri Lanka; (d) to arrange for the carriage of goods, produce and merchandise of whatsoever class or description that shall be shipped from any port in Sri Lanka to any destination outside Sri Lanka; (e) to take such measures as are necessary to ensure efficient and regular services for the shipment of goods, produce and merchandise from any port in Sri Lanka to any destination outside Sri Lanka; (f) to foster the development of the national merchant fleet; (g) to improve port performance, loading rate in the ports of Sri Lanka, the handling of cargo and other matters connected therewith or incidental thereto; (h) to negotiate with shipowners and shipping lines, individually or collectively, on matters such as freight rates, surcharges, adequacy, frequency and efficiency of shipping services and matters incidental thereto; (i) to enter into agreements with shipowners and shipping lines, individually or collectively, either on its own or on behalf of shippers, and arrange for the carriage of goods, produce and merchandise of whatsoever class or description that shall be shipped from any port in Sri Lanka to any destination outside Sri Lanka; (j) to reduce costs incurred by shippers; (k) to obtain most favourable freight rates and terms for the carriage of goods, produce and merchandise of whatsoever class or description that shall be shipped from any port in Sri Lanka to any destination outside Sri Lanka; (l) to undertake research on shipping and freight rates; and (m) to do all such other acts or things as are necessary for or incidental to the attainment of the objects herein before mentioned. General powers of the Bureau. 15. (1) The Bureau shall have power to do anything necessary for, or conducive or incidental to, the carrying out of its objects. (2) Without prejudice to the generality of the powers conferred by subsection (1), the Bureau shall have power- (a) to centralize the bookings of freight space in respect of goods, produce and merchandise of whatsoever class or description that shall be shipped from any port in Sri Lanka to any destination outside Sri Lanka: (b) to allocate freight on ocean going vessels in such manner as to safeguard and promote the national interest in trade and shipping; (c) to determine the vessels on which goods, produce and merchandise of whatsoever class or description that shall be shipped from any port in Sri Lanka to any destination outside Sri Lanka; (d) to negotiate with shipowners and shipping lines, individually or collectively, on matters such as freight rates, surcharges, adequacy, frequency and efficiency of shipping services and’ matters incidental thereto: (e) to enter into agreements with shipowners and shipping lines, individually or collectively, either on its own or on behalf of shippers, and arrange for the carriage of all goods, produce and merchandise of whatsoever class or description that shall be shipped from any port in Sri Lanka to any destination outside Sri Lanka; (f) to construct, execute, carry out, equip, improve, work, develop, administer, manage or control in the ports of Sri Lanka, with the prior approval of the Port Com missioner, such works and conveniences as may be necessary to facilitate the shipping of goods, produce and merchandise of whatsoever class or description from such ports; (g) to provide and to arrange for the provision of services for warehousing, wharfage and the shipping of all goods, produce and merchandise of whatsoever class or description, with the approval of the Port (Cargo) Corporation; (h) to transport and warehouse goods, produce and merchandise of whatsoever class or description for shipment from any port of Sri Lanka; (i) to levy charges and commissions for any services rendered or facilities afforded by the Bureau to shippers, shipping agents, and shipowners, including the booking, reservation and allocation of freight space; (j) to conduct research into all matters affecting the carriage from Sri Lanka of all goods, produce and merchandise of whatsoever class or description; (k) to acquire in any manner whatsoever and hold, take or give on lease or hire, mortgage, pledge, sell or otherwise dispose of any immovable or movable property: (l) to do anything necessary for the purpose of advancing the skill of persons employed by the Bureau, or the efficiency of the equipment of the Bureau, or the manner in which such equipment is operated, including the provision by the Bureau and the assistance of the provision by others of facilities for training persons required to carry out the work of the Bureau; (m) to enter into and perform, either directly or indirectly, through any officer or agent of the Bureau, all such contracts or agreements, as may be necessary, for the exercise of the powers of the Bureau, and the carrying out of the objects of the Bureau: (n) to borrow money from whatsoever source for the purposes of the Bureau, in such manner and upon such security as the Bureau may, with the approval of the Minister, determine: (o) to receive and disburse monies for the accomplishment of its objects; (p) to appoint, employ, remunerate and control its officers, servants and agents, and to direct and decide all matters connected with the administration of its affairs; (q) to provide welfare and recreational facilities, houses, hostels and other like accommodation, for the persons employed by or serving the Bureau; (r) to make rules in respect of the administration of the affairs of the Bureau; (s) to formulate schemes to give effect to the objects of the Bureau. Exclusive right to book freight. 16. (1) The Minister may, from time to time, by Order published in the Gazette, vest in the Bureau, with effect from such date as may be specified in the Order, the exclusive right to book, reserve or allocate freight or cargo space on any ocean going vessel for the carriage of goods other than the goods specified in the Order, from any port in Sri Lanka to any destination specified in the Order. (2) On and after the date with effect from which the exclusive right to book or reserve freight or cargo space for the carriage of any goods to any destination has been vested in the Bureau under subsection (1)- (a) no person other than the Bureau shall make any booking or reservation of freight or cargo space with a shipowner or his agent for the carriage of such goods to such destination; (b) no person shall ship such goods to such destination on any ocean going vessel unless freight or cargo space has been booked, reserved or allocated for the carriage of such goods by the Bureau; and (c) any booking, reservation or allocation of freight or cargo space for the carriage of such goods to such destination in contravention of the preceding provisions of this subsection, and any contract of affreightment in respect of such carriage entered into between a shipper and any owner, agent or master of an ocean going vessel shall be deemed for all purposes to be null and void and to have no force or effect whatsoever. Certain arrangements and agreements rendered null and void. 17. On and after the date with effect from which the exclusive right to book or reserve freight or cargo space in respect of the carriage of any goods to any destination has been vested in the Bureau under subsection (1) of section 16, no shipper of such goods from any port in Sri Lanka to such destination shall enter into any agreement or arrangement with any shipowner or shipping line, individually or collectively, whereby such shipper undertakes to confine shipment from Sri Lanka of any such goods whether it be for his own account or for the account of his associates or principals, to any ocean going vessel provided by such shipowner or shipping line, on such shipowner or shipping line agreeing to pay such shipper, any sum of money whether by way of rebate, discount or otherwise, or agreeing to carry on a ” contract rate”, and any such agreement or arrangement subsisting on the day immediately preceding the aforesaid date, or entered into any time thereafter, shall be deemed for all purposes to be null and void and to have no force or effect in law whatsoever: Provided that the preceding provisions of this section shall not apply in the case of the Bureau entering into any such agreement or arrangement for or on behalf of any such shipper. Charges that may be made by the Bureau. 18. (1) Charges and commissions that may be made by the Bureau for any services rendered or facilities afforded including the booking, reservation and allocation of freight or cargo space by the Bureau to shippers, exporters, shipping agents and shipowners shall be fixed by the Bureau with the approval of the Minister and may be revised from time to time with like approval. (2) Charges and commissions referred to in subsection (1) shall become payable within thirty days after demand by the Bureau. (3) Where a shipper, exporter, shipping agent or shipowner fails “or refuses to pay, within thirty days after demand, any sum which he is required to pay as a charge or commission under this section, to the Bureau, such sum may, on application made by the Bureau to the Magistrate’s Court having jurisdiction over the last known place of business or residence of such shipper, exporter. shipping agent or shipowner, be recovered in like manner as a fine imposed by such Court, notwithstanding that such sum may exceed the amount of the fine which the Court may impose in the exercise of its ordinary jurisdiction. Penalty for default. 19. (1) Where the Bureau has booked, reserved or allocated freight or cargo space on an ocean going vessel for shipment of any goods from a port in Sri Lanka to any destination, at the request of a shipper and such shipper fails without reasonable cause in the opinion of the Bureau, to utilize the whole or any part of such freight or cargo space by the shipment of such goods, the Bureau may after giving such shipper an opportunity of being heard either in person or by a representative, impose a penalty not exceeding a sum of one thousand rupees on such shipper. (2) A shipper aggrieved by a decision of the Bureau under subsection (1) may within ten days. after the communication of such decision to him. make a written appeal from such decision to the Minister and the Minister may, on any such appeal confirm, vary or quash the decision from which such appeal is made. (3) The decision of the Minister upon an appeal and, where no appeal has been preferred under subsection (2) within the time allowed therefor, the decision of the Bureau, shall be final and conclusive and shall not be called in question in any court or tribunal, whether by way of appeal or write or in any other manner whatsoever. (4) Where a shipper refuses or fails to pay to the Bureau any sum which he has been required to pay as a penalty under the preceding provisions of this section, such sum may be recovered from him by the Bureau upon an application made by the Bureau to the Magistrate’s Court having jurisdiction over the last known place of business or residence of such shipper, in like manner as a fine imposed by that Court, notwithstanding that such sum may exceed the amount of the fine which that Court may in the exercise of its ordinary jurisdiction impose. (5) Nothing in subsection (4) shall be construed as to require or to authorize a Magistrate before whom an application in terms of that subsection is made, to consider, examine or decide the correctness or legality of such penalty. Indemnity. 20. (1) Where by reason of the neglect or default on the part of a shipper to utilize by the shipment of any goods, from any port in Sri Lanka to any destination, the whole or any part of the freight or cargo space booked, reserved or allocated by the Bureau, for such shipper, on any ocean going vessel, the Bureau is called upon to pay any sum as damages or otherwise to the owner of such vessel, the Bureau shall be entitled to be indemnified to the full extent of such sum, by such shipper, on the production by the Bureau of a duly authenticated acknowledgment by or on behalf of the owner of such vessel, of the payment by the Bureau of such sum. (2) A shipper who within a period of thirty days after being requested by the Bureau, to make payment, fails or neglects to pay to the Bureau any sum which he is liable to pay, by way of indemnity under subsection (1), shall be guilty of an offence under this Law. Vesting of property of the Ceylon Freight Bureau in the Central Freight Bureau of Sri Lanka. 21. (1) On and after the appointed date, all property, both movable and immovable, belonging to the Ceylon freight Bureau, whether held in the name of the said Ceylon freight Bureau or in the name or names of any person or persons in trust for the said Ceylon Freight Bureau, shall be and the same is hereby vested in the Central Freight Bureau of Sri Lanka constituted under this Law, and the said properly both movable and immovable, shall be held by the said Central Freight Bureau of Sri Lanka for the purposes of this Law. (2) All debts and liabilities of the Ceylon Freight Bureau; referred to in subsection (1), existing on the appointed date shall be paid by the Central Freight Bureau of Sri Lanka constituted under this Law, and all debts due to, and subscriptions, contributions and all sums of money payable by way of penalties to the said Ceylon Freight Bureau on such date, shall be paid to the said Central Freight Bureau of Sri Lanka. No compensation for loss Incurred by reason of vesting exclusive right to reserve space in the Bureau. 22. No person shall be entitled to compensation for any loss incurred by him, whether directly or indirectly, by reason of the fact that the exclusive right to reserve freight or cargo space in any ocean going vessel for the carriage of any goods from any port in Sri Lanka to any destination outside Sri Lanka has been vested in the Bureau. Application of provisions of Part II of Finance Act, No. 38 of 1971, and the financial year of the Bureau. 23. (1) The provisions of Part II of the Finance Act, No. 38 of 1971, shall, mutatis mutandis, apply to the financial control and accounts of the Bureau. (2) The financial year of the Bureau shall be the calendar year. Appointment of officers and servants of the Bureau. 24. (1) The Bureau shall have the power- (a) to appoint such officers and servants as may be necessary for the purposes of the Bureau; (b) to exercise disciplinary control over and dismiss any officer or servant of the Bureau. (2) The officers and servants of the Bureau shall be remunerated at such rates as the Bureau may determine. Officers and servants of Bureau deemed to be state officers. 25. All officers and servants of the Bureau shall be deemed to be state officers within the meaning and for the purposes of the Penal Code. Bureau deemed to be scheduled within the meaning of the Bribery Act. 26. The Bureau shall be deemed to be a scheduled institution within the meaning of the Bribery Act and the provisions of that Act shall be construed accordingly, Directions of the Bureau. 27. (1) The Bureau may issue directions for the purpose of carrying out or giving effect to the principles and provisions of this Law or the regulations made thereunder, to any shipper of goods from Sri Lanka or to any person or body carrying on business as shipping agent in Sri Lanka. All such persons shall carry out every such direction. (2) Any person who contravenes or fails to comply with any directions issued by the Bureau under this Law shall be guilty of an offence. Protection for action taken under this Law or on the direction of the Bureau. 28. (1) No suit or prosecution shall lie- (a) against the Bureau for any act which in good faith is done or is purported to be done by the Bureau under this Law, or (b) against any member, officer, servant or agent of the Bureau for any act which in good faith is done or is purported to be done by him under this Law or on the direction of the Board of Directors. (2) Any expense incurred by the Bureau in any suit or prosecution brought by or against the Bureau before any court shall be paid out of the funds of the Bureau and any costs paid to, or recovered by, the Bureau in any such suit or prosecution shall be credited to the funds of the Bureau. (3) Any expense incurred by any such person as is referred to in paragraph (b) of subsection (1) in any suit or prosecution brought against him before any court in respect of any act which is done or is purported to be done by him under this Law or on the direction of the Bureau shall, if the court holds that such act was done in good faith, be paid out of the funds of the Bureau, unless such expense is recovered by him in such suit or prosecution. Regulations. 29. (1) The Minister may make regulations for the purpose of carrying out or giving effect to the principles and provisions of this Law. (2) Every regulation made by the Minister shall be published in the Gazette and shall come into operation on the date of such publication or on such later date as may be specified in the regulation. (3) Every regulation made by the Minister shall, as soon as may be convenient after its publication in the Gazette, be laid before the National State Assembly and if the National State Assembly, within the period of one month after the regulation is so laid before it, resolves that the regulation be annulled, the regulation shall thereupon cease to have effect but without prejudice to the validity of anything previously done thereunder. Any regulation not so annulled shall be deemed to be approved by the National State Assembly. (4) Every regulation made by the Minister shall, when deemed to be approved by the National State Assembly, be as valid and effectual as if herein enacted. (5) Any person who contravenes the provisions of any regulation made under this Law shall be guilty of an offence under this Law. Offences &c., 30. Any person who is guilty of an offence under this Law shall he liable, on conviction after summary trial before a Magistrate, to imprisonment of either description for a term not exceeding one year or to a fine not exceeding one thousand rupees or to both such imprisonment and such fine. This Law to prevail in case of conflict with other written law. 31. The provisions of this Law shall have effect notwithstanding anything contained in any other written law, and in the event of any conflict or inconsistency between the provisions of this Law and such other law, the provisions of this Law shall prevail. Acquisition of immovable property. 32. (1) Where any immovable property is required to be acquired for any purpose of the Bureau and the Minister, by Order published in the Gazette, approves of the proposed acquisition, that property shall be deemed to be required for a public purpose, and may accordingly be acquired under the Land Acquisition Art, and be transferred to the Bureau. (2) Any sums payable for the acquisition of any immovable property under the Land Acquisition Act for the Bureau shall be paid from the funds of the Bureau. Interpretation. 33. In this Law, unless the context otherwise requires- ” Ceylon Freight Bureau ” means the organization established by the Shipper’s Council of Ceylon in November 1971, in consequence of letter No. SH/03/053 dated October 16th 1971, and signed by the Permanent Secretary, Ministry of Shipping and Tourism; ” contract rate ” means a lower freight rate agreed to between a shipper and a shipowner in respect of carriage of goods by sea in consideration of which such shipper agrees to ship goods exclusively in ships owned by such shipowner; ” public Corporation ” means any Corporation, Board or other body that was or is established by or under any written law other than the Companies Ordinance, with capital wholly or partly provided by the Government by way of loan, grant or other form.

2023-12-25T01:26:28.774034

https://example.com/article/4391

Warehouse and Office Lighting Southwark and Lewisham LED Warehouse and Office Lighting Units A very simple way of lowering operating costs for your Southwark office or Lewisham warehouse would be to install bright LED low bay lighting. But not only will it help you save cash, it will help with your environmental credentials as well. They use a comparable amount of electricity to your existing fluorescent lighting (and much less if you are still using HID or incandescent), but last considerably longer meaning your company will send less to the new waste management facility in Devon Street or Landmann Way. Mercury is a toxic metal that is an essential component of fluorescent lighting in offices and warehouses. Your staff probably are unaware that if a fluorescent tube is broken, the mercury vapour will enter the air in the building. It can then be breathed in by staff, contributing to the level of heavy metals that enter their body. By changing to LED low bay lighting, you can avoid this seldom-mentioned aspect of health and safety. Not all areas of a warehouse or office require lighting all of the time. Using conventional and fluorescent ighting, switching them on and off as required is rarely practical. Using incandescent bulbs, full lighting levels are achieved instantly, however, switching them on and off repeatedly can shorten their life. You will end up spending more on materials and labour for changing the blown bulbs. Repeatedly switching fluorescent lighting on and off also shortens the life of the tube and starter capacitor but the biggest problem with fluorescent is the brightness – they take a minute or three before they have reached full brightness. If you change to LED lighting for your Southwark office or Lewisham warehouse, you will benefit in several ways. Firstly, LED lighting systems can supply the same or more light output as your old system but using a lot less electricity – in the extreme, you could save up to 75% on your lighting electricity bill. Secondly, if you get a professional commercial electrician to fit your warehouse or office LED lighting systems, you could be eligible for an immediate reduction in your next tax bill. Other benefits include less frequent replacement of blown bulbs or flickering tubes meaning lower maintenance costs and you won’t need to carry as many spares. You should expect around 50,000 hours from an LED lighting unit – compare that to the much lower lifetime expected from fluorescent tubes and incandescent units. How do warehouse and office LED lighting systems work? An LED is a neat little electrical component that converts electricity directly into light. This is much more efficient than incandescent warehouse or office lighting systems which convert the electricity into heat first. There is still some energy lost from LEDs as heat, but much less than with either fluorescent tubes or HID bulbs. It is for that reason, LED lighting really makes sense. Less electricity used means cheaper bills and less carbon dioxide emitted. Criticisms of early LED commercial lighting units tended to put most businesses off having them installed. The lighting was harsh; there were dark areas as they only threw light out at a narrow angle; flickering and so on. Business lighting based on LEDs is now trouble-free and when coupled with even a basic control system, can save any Southwark or Lewisham business hundreds or even thousands of pounds over the course of a year. You can also purchase lighting with a specific ‘colour temperature’ so that it will be exactly suited to the application e.g. daylight where colour recognition is really important or the comfort of office staff is your aim. A happy workforce is more efficient. South London Electricians use Right-Light&reg; 200W high output LED warehouse and office lighting modules which are eligible for the government’s enhanced capital allowance scheme, together with the most energy-efficient drivers and control systems. So to make sure that your business saves spending on both taxes and utility bills, contact us on 0208 406 9834 for a free, no-obligation chat with one of our experienced warehouse lighting electricians. We cover all other areas of South London – from Richmond to Bromley, through Merton, Wandsworth, Lambeth and Croydon, as well as Westminster and Chelsea (OK, we know they are north London but we do venture over the Thames from time to time!). And our fleet of electric powered vans have the range also to visit places beyond the boundaries of Greater London – like Banstead, Caterham, Carshalton and Sutton. Comments are closed. To speak to a member of our team about your project please call 0208 406 9834 Our Services Expert electricians South London Electricians offer a full range of domestic electrical installation services within London and the Home Counties. No matter if just need a few extra sockets or a complete rewiring, we’ll complete the work to the highest possible standard.

2023-12-19T01:26:28.774034

https://example.com/article/9097

Q: Uploading HTML into database - PERL im trying to upload HTML into a database which does work for some files but not all. my $fileContents; if( $md5Con =~ m/\.php$/g ) { my $ftp = Net::FTP->new($DB_ftpserver, Debug => 0) or die "Cannot connect to some.host.name: $@"; $ftp->login($DB_ftpuser, $DB_ftppass) or die "Cannot login ", $ftp->message; ftp->get("/" . $root . $webpage, "c:/perlscripts/" . md5_hex($md5Con) . "-code.php") or die $ftp->message; my $file = "c:/perlscripts/" . md5_hex($md5Con) . "-code.php"; { local( $/ ); # undefine the record seperator open FILE, "<", $file or die "Cannot open:$!\n"; my $fileContents = <FILE>; #print $fileContents; my $bodyContents; my $headContents; my @contentsArray = split( /<\/head>/is, $fileContents, 2); if( scalar @contentsArray == 2 ){ $bodyContents = $dbh->quote(trim($contentsArray[1])); $headContents = $dbh->quote(trim($contentsArray[0]) . "</head>"); $dbh->do($createBodyTable) or die " error: Couldn't create body table: " . DBI->errstr; $dbh->do($createHeadTable) or die " error: Couldn't create header table: " . DBI->errstr; $dbh->do("INSERT INTO $headerTable ( headData, headDataOutput ) VALUES ( $headContents, $headContents )") or die " error: Couldn't connect to database: " . DBI->errstr; $dbh->do("INSERT INTO $bodyTable ( bodyData, bodyDataOutput ) VALUES ( $bodyContents, $bodyContents )") or die " error: Couldn't connect to database: " . DBI->errstr; $dbh->do("INSERT INTO page_names (linkFromRoot, linkTrue, page_name, table_name, navigation, location) VALUES ( $linkFromRoot, $linkTrue, $page_name, $table_name, $navigation, $location )") or die " error: Couldn't connect to database: " . DBI->errstr; unlink("c:/perlscripts/" . md5_hex($md5Con) . "-code.php"); }else{ print "<span class=\"red\">" . $md5Con . " cannot be used by our CMS, invalid data.</span><br />\n"; } } $ftp->quit; } can anyone see why this maybe happening? EDIT To see at a different angle, this is the output of the data going into the database... The first 3 blocks of code go in fine then errors on the fourth. <span class="green">http://www.themobilemakeover.co.uk/index.php</span><br /> '<?php session_start(); ?>\n<!DOCTYPE html PUBLIC \"-//W3C//DTD XHTML 1.0 Strict//EN\" \"http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd\">\n<html xmlns=\"h ttp://www.w3.org/1999/xhtml\">\n<head>\n<meta http-equiv=\"Content-Type\" content=\"text/html; charset=utf-8\" />\n<meta name=\"description\" content=\"The Mo bile Makeover offers a wide range of services and treatments all from the luxuary of your own home!\" />\n<meta name=\"keywords\" content=\"Mobile Makeover, B eauty Therapist, Beautician, Therapist, Mobile Therapist, Mansfield, Nottinghamshire\" />\n<meta name=\"language\" content=\"en\" />\n<meta name=\"author\" co ntent=\"ACT Web Designs\" />\n<meta name=\"copyright\" content=\"The Mobile Makeover\" />\n<meta name=\"publisher\" content=\"ACT Web Designs\" />\n<meta name =\"country\" content=\"United Kingdom\" />\n<meta name=\"city\" content=\"Mansfield, Nottinghamshire\" />\n<meta http-equiv=\"X-UA-Compatible\" content=\"IE=8 \" /> \n<meta name=\"verify-v1\" content=\"4lZIaMmjLMq+UA8nkPYB9RjF5RreNwF3Mzurm9JYvQM=\" />\n<title>The Mobile Makeover - Mobile Beautician</title>\n<link hr ef=\"stylesheets/main.css\" rel=\"stylesheet\" type=\"text/css\" />\n<link href=\"stylesheets/cssReset.css\" rel=\"stylesheet\" type=\"text/css\" />\n<script type=\"text/javascript\" src=\"js/jquery-1.3.1.js\"></script>\n<script type=\"text/javascript\" src=\"js/jquery.bgpos.js\"></script>\n<script type=\"text/java script\" src=\"js/jquery.timers.js\"></script>\n<script type=\"text/javascript\" src=\"js/makeover.scroll.js\"></script>\n<script type=\"text/javascript\">\nv ar gaJsHost = ((\"https:\" == document.location.protocol) ? \"https://ssl.\" : \"http://www.\");\ndocument.write(unescape(\"%3Cscript src=\'\" + gaJsHost + \" google-analytics.com/ga.js\' type=\'text/javascript\'%3E%3C/script%3E\"));\n</script>\n<script type=\"text/javascript\">\ntry {\nvar pageTracker = _gat._getTr acker(\"UA-8193659-6\");\npageTracker._trackPageview();\n} catch(err) {}</script></head>' <span class="green">http://www.themobilemakeover.co.uk/about-us-the-mobile-makeover.php</span><br /> '<?php session_start(); ?>\n<!DOCTYPE html PUBLIC \"-//W3C//DTD XHTML 1.0 Strict//EN\" \"http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd\">\n<html xmlns=\"h ttp://www.w3.org/1999/xhtml\">\n<head>\n<meta http-equiv=\"Content-Type\" content=\"text/html; charset=utf-8\" />\n<meta name=\"description\" content=\">My na me is Kelly Knight, I am a highly Qualifed Mobile Beauty Therapist. I have trained in NVQ Level 2 and NVQ level 3 in Beauty Therapy with many additional cours es and training...\" />\n<meta name=\"keywords\" content=\"Mobile Makeover, About Us, Beauty Therapist, Mobile Therapist, Mansfield, Nottinghamshire\" />\n<me ta name=\"language\" content=\"en\" />\n<meta name=\"author\" content=\"ACT Web Designs\" />\n<meta name=\"copyright\" content=\"The Mobile Makeover\" />\n<me ta name=\"publisher\" content=\"ACT Web Designs\" />\n<meta name=\"country\" content=\"United Kingdom\" />\n<meta name=\"city\" content=\"Mansfield, Nottingha mshire\" />\n<meta http-equiv=\"X-UA-Compatible\" content=\"IE=8\" /> \n<title>The Mobile Makeover - About Us</title>\n<link href=\"stylesheets/main.css\" rel =\"stylesheet\" type=\"text/css\" />\n<link href=\"stylesheets/cssReset.css\" rel=\"stylesheet\" type=\"text/css\" />\n<script type=\"text/javascript\" src=\" js/jquery-1.3.1.js\"></script>\n<script type=\"text/javascript\" src=\"js/jquery.bgpos.js\"></script>\n<script type=\"text/javascript\" src=\"js/jquery.timers .js\"></script>\n<script type=\"text/javascript\" src=\"js/makeover.scroll.js\"></script>\n<script type=\"text/javascript\">\nvar gaJsHost = ((\"https:\" == d ocument.location.protocol) ? \"https://ssl.\" : \"http://www.\");\ndocument.write(unescape(\"%3Cscript src=\'\" + gaJsHost + \"google-analytics.com/ga.js\' ty pe=\'text/javascript\'%3E%3C/script%3E\"));\n</script>\n<script type=\"text/javascript\">\ntry {\nvar pageTracker = _gat._getTracker(\"UA-8193659-6\");\npageT racker._trackPageview();\n} catch(err) {}</script></head>' <span class="green">http://www.themobilemakeover.co.uk/beauty-products-used.php</span><br /> '<?php session_start(); ?>\n<!DOCTYPE html PUBLIC \"-//W3C//DTD XHTML 1.0 Strict//EN\" \"http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd\">\n<html xmlns=\"h ttp://www.w3.org/1999/xhtml\">\n<head>\n<meta http-equiv=\"Content-Type\" content=\"text/html; charset=utf-8\" />\n<meta name=\"description\" content=\"We use a wide range of the finest products on the market today. Below is a short brief of just a few of the names which we believe give you the best results - we do not compromise when it comes to quality.\" />\n<meta name=\"keywords\" content=\"Mobile Makeover, Beauty Therapist, Beauty Products, Jessica, Calgel, Eve Tay lor, Tantrick, Therapist, Mansfield, Nottinghamshire\" />\n<meta name=\"language\" content=\"en\" />\n<meta name=\"author\" content=\"ACT Web Designs\" />\n<m eta name=\"copyright\" content=\"The Mobile Makeover\" />\n<meta name=\"publisher\" content=\"ACT Web Designs\" />\n<meta name=\"country\" content=\"United Ki ngdom\" />\n<meta name=\"city\" content=\"Mansfield, Nottinghamshire\" />\n<meta http-equiv=\"X-UA-Compatible\" content=\"IE=8\" /> \n<title>The Mobile Makeov er - Beauty Products Used</title>\n<link href=\"stylesheets/main.css\" rel=\"stylesheet\" type=\"text/css\" />\n<link href=\"stylesheets/cssReset.css\" rel=\" stylesheet\" type=\"text/css\" />\n<!--[if lte IE 6]><link href=\"stylesheets/mainie6.css\" rel=\"stylesheet\" type=\"text/css\" /><![endif]-->\n<script type= \"text/javascript\" src=\"js/jquery-1.3.1.js\"></script>\n<script type=\"text/javascript\" src=\"js/jquery.bgpos.js\"></script>\n<script type=\"text/javascrip t\" src=\"js/jquery.timers.js\"></script>\n<script type=\"text/javascript\" src=\"js/makeover.scroll.js\"></script>\n<script type=\"text/javascript\">\nvar ga JsHost = ((\"https:\" == document.location.protocol) ? \"https://ssl.\" : \"http://www.\");\ndocument.write(unescape(\"%3Cscript src=\'\" + gaJsHost + \"googl e-analytics.com/ga.js\' type=\'text/javascript\'%3E%3C/script%3E\"));\n</script>\n<script type=\"text/javascript\">\ntry {\nvar pageTracker = _gat._getTracker (\"UA-8193659-6\");\npageTracker._trackPageview();\n} catch(err) {}</script></head>' <span class="green">http://www.themobilemakeover.co.uk/beauty-treatments.php</span><br /> '<?php session_start(); ?>\n<!DOCTYPE html PUBLIC \"-//W3C//DTD XHTML 1.0 Strict//EN\" \"http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd\">\n<html xmlns=\"h ttp://www.w3.org/1999/xhtml\">\n<head>\n<meta http-equiv=\"Content-Type\" content=\"text/html; charset=utf-8\" />\n<meta name=\"description\" content=\"The Mo bile Makeover offers a wide range of treatments all from the luxuary of your own home!\" />\n<meta name=\"keywords\" content=\"Mobile Makeover, Beauty Treatme nts, Beautician, Facials, Pedicures, Hopi Ear Candles, Eye Treatments, Mansfield, Nottinghamshire\" />\n<meta name=\"language\" content=\"en\" />\n<meta name= \"author\" content=\"ACT Web Designs\" />\n<meta name=\"copyright\" content=\"The Mobile Makeover\" />\n<meta name=\"publisher\" content=\"ACT Web Designs\" / >\n<meta name=\"country\" content=\"United Kingdom\" />\n<meta name=\"city\" content=\"Mansfield, Nottinghamshire\" />\n<meta http-equiv=\"X-UA-Compatible\" c ontent=\"IE=8\" /> \n<title>The Mobile Makeover - Beauty Treatments</title>\n<link href=\"stylesheets/main.css\" rel=\"stylesheet\" type=\"text/css\" />\n<lin k href=\"stylesheets/cssReset.css\" rel=\"stylesheet\" type=\"text/css\" />\n<script type=\"text/javascript\" src=\"js/jquery-1.3.1.js\"></script>\n<script ty pe=\"text/javascript\" src=\"js/jquery.bgpos.js\"></script>\n<script type=\"text/javascript\" src=\"js/jquery.timers.js\"></script>\n<script type=\"text/javas cript\" src=\"js/makeover.scroll.js\"></script>\n<script type=\"text/javascript\">\nvar gaJsHost = ((\"https:\" == document.location.protocol) ? \"https://ssl .\" : \"http://www.\");\ndocument.write(unescape(\"%3Cscript src=\'\" + gaJsHost + \"google-analytics.com/ga.js\' type=\'text/javascript\'%3E%3C/script%3E\")) ;\n</script>\n<script type=\"text/javascript\">\ntry {\nvar pageTracker = _gat._getTracker(\"UA-8193659-6\");\npageTracker._trackPageview();\n} catch(err) {}< /script></head>' DBD::mysql::db do failed: You have an error in your SQL syntax; check the manual that corresponds to your MySQL server version for the right syntax to use nea r '22e64cef7d70fa952ce7444f158e2c4e_header ( headData, headDataOutput ) VALUES ( '<' at line 1 at C:\perlscripts\cgitest.pl line 360, <FILE> chunk 4. error: Couldn't connect to database: You have an error in your SQL syntax; check the manual that corresponds to your MySQL server version for the right synta x to use near '22e64cef7d70fa952ce7444f158e2c4e_header ( headData, headDataOutput ) VALUES ( '<' at line 1 at C:\perlscripts\cgitest.pl line 360, <FILE> chunk 4. >>>>>> EDIT 2 <<<<<<<<< After using trace I am non the wiser. Here is my log: (this is now removing "quote()" and using placeholders) DBI 1.607-ithread default trace level set to 0x0/1 (pid 13524) at cgitest.pl line 10 -> DBI->connect(*****************************************************) -> DBI->install_driver(mysql) for MSWin32 perl=5.010001 pid=13524 ruid=0 euid=0 install_driver: DBD::mysql version 4.011 loaded from C:/Perl/site/lib/DBD/mysql.pm <- install_driver= DBI::dr=HASH(0x37be1fc) !! warn: 0 CLEARED by call to connect method <- connect('database=web110-accounts;host=79.170.44.110;', 'web110-accounts', ...)= DBI::db=HASH(0x37bdc8c) at DBI.pm line 638 <- STORE('PrintError', 1)= 1 at DBI.pm line 690 <- STORE('AutoCommit', 1)= 1 at DBI.pm line 690 <- STORE('Username', 'web110-accounts')= 1 at DBI.pm line 693 <> FETCH('Username')= 'web110-accounts' ('Username' from cache) at DBI.pm line 693 <- connected(**********************************)= undef at DBI.pm line 699 <- connect= DBI::db=HASH(0x37bdc8c) <- STORE('dbi_connect_closure', CODE(0x37c3634))= 1 at DBI.pm line 708 <- prepare('SELECT * FROM accounts WHERE KI = '9096699576bcc810df5bc311650c4ebd' ')= DBI::st=HASH(0x37bda24) at cgitest.pl line 61 <- execute= 1 at cgitest.pl line 62 <- rows= '1' at cgitest.pl line 63 <- fetchrow_hashref= HASH(0x37bd514)24keys row1 at cgitest.pl line 64 <- finish= 1 at cgitest.pl line 71 <- disconnect= 1 at cgitest.pl line 72 **************************************************************************** **************************************************************************** <- STORE('PrintError', 1)= 1 at DBI.pm line 690 <- STORE('AutoCommit', 1)= 1 at DBI.pm line 690 <- STORE('Username', 'web110-db-2')= 1 at DBI.pm line 693 <> FETCH('Username')= 'web110-db-2' ('Username' from cache) at DBI.pm line 693 <- connected('DBI:mysql:database=web110-db-2;host=79.170.44.110;', 'web110-db-2', ...)= undef at DBI.pm line 699 <- connect= DBI::db=HASH(0x3d615ac) <- STORE('dbi_connect_closure', CODE(0x3d60f6c))= 1 at DBI.pm line 708 <- prepare('INSERT INTO ? ( headData, headDataOutput ) VALUES ( ?, ? )')= DBI::st=HASH(0x351659c) at cgitest.pl line 263 <- prepare('INSERT INTO ? ( bodyData, bodyDataOutput ) VALUES ( ?, ? )')= DBI::st=HASH(0x37bd914) at cgitest.pl line 264 <- prepare('INSERT INTO page_names (linkFromRoot, linkTrue, page_name, table_name, navigation, location) VALUES ( ?, ?, ?, ?, ?, ? )')= DBI::st=HASH(0x3d575fc) at cgitest.pl line 265 <- quote("http://www.themobilemakeover.co.uk/index.php")= "'http://www.themobilemakeover.co.uk/index.php'" at cgitest.pl line 271 <- prepare("SELECT * FROM page_names WHERE linkTrue = 'http://www.themobilemakeover.co.uk/index.php' ")= DBI::st=HASH(0x3d571bc) at cgitest.pl line 272 <- execute= '0E0' at cgitest.pl line 273 <- rows= '0' at cgitest.pl line 274 <- quote("The Mobile Makeover - Mobile Beautician")= "'The Mobile Makeover - Mobile Beautician'" at cgitest.pl line 289 <- prepare("SELECT * FROM page_names WHERE page_name = 'The Mobile Makeover - Mobile Beautician' ")= DBI::st=HASH(0x3d56fdc) at cgitest.pl line 290 <- execute= '0E0' at cgitest.pl line 291 <- rows= '0' at cgitest.pl line 292 <- DESTROY(DBI::st=HASH(3d54254))= undef at cgitest.pl line 287 <- do('CREATE TABLE IF NOT EXISTS `6959bbd13fdb4df586a5b9d08aae1153_body` ( `id` INT( 10 ) NOT NULL AUTO_INCREMENT PRIMARY KEY , `bodyData` TEXT NOT NULL, `bodyDataOutput` TEXT NOT NULL ) ENGINE = MYISAM CHARACTER SET utf8 COLLATE utf8_general_ci;')= '0E0' at cgitest.pl line 362 <- do('CREATE TABLE IF NOT EXISTS `6959bbd13fdb4df586a5b9d08aae1153_header` ( `id` INT( 10 ) NOT NULL AUTO_INCREMENT PRIMARY KEY , `headData` TEXT NOT NULL, `headDataOutput` TEXT NOT NULL ) ENGINE = MYISAM CHARACTER SET utf8 COLLATE utf8_general_ci;')= '0E0' at cgitest.pl line 363 !! ERROR: 1064 'You have an error in your SQL syntax; check the manual that corresponds to your MySQL server version for the right syntax to use near ''6959bbd13fdb4df586a5b9d08aae1153_header' ( headData, headDataOutput ) VALUES ( ' at line 1' (err#0) <- execute('6959bbd13fdb4df586a5b9d08aae1153_header', '<?php session_start(); ?> <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd"> <html xmlns="http://www.w3.org/1999/xhtml"> <head> <meta http-equiv="Content-Type" content="text/html; charset=utf-8" /> <meta name="description" content="The Mobile Makeover offers a wide range of services and treatments all from the luxuary of your own home!" /> <meta name="keywords" content="Mobile Makeover, Beauty Therapist, Beautician, Therapist, Mobile Therapist, Mansfield, Nottinghamshire" /> <meta name="language" content="en" /> <meta name="author" content="ACT Web Designs" /> <meta name="copyright" content="The Mobile Makeover" /> <meta name="publisher" content="ACT Web Designs" /> <meta name="country" content="United Kingdom" /> <meta name="city" content="Mansfield, Nottinghamshire" /> <meta http-equiv="X-UA-Compatible" content="IE=8" /> <meta name="verify-v1" content="4lZIaMmjLMq+UA8nkPYB9RjF5RreNwF3Mzurm9JYvQM=" /> <title>The Mobile M...', ...)= undef at cgitest.pl line 365 !! ERROR: 1064 CLEARED by call to execute method !! ERROR: 1064 'You have an error in your SQL syntax; check the manual that corresponds to your MySQL server version for the right syntax to use near ''6959bbd13fdb4df586a5b9d08aae1153_body' ( bodyData, bodyDataOutput ) VALUES ( '<' at line 1' (err#0) <- execute('6959bbd13fdb4df586a5b9d08aae1153_body', '<body> <div id="wrapper"> <div id="header"> <div id="innerHeader"> <h1><span>The Mobile Makeover - Mobile Beauty Therapist - Mansfield Nottinghamshire</span></h1> <div class="clear"></div> <?php include("php/navigation.php"); ?> <div class="clear"></div> </div> </div> <div id="main"> <div id="content1" class="content vis"> <h2>Welcome to The Mobile Makeover</h2> <div class="image1"> </div> <p>Home visit appointments are designed to save you time and stress, by providing a service in the comfort of your own home, no need to worry about travel and traffic or facing the cold night air after a relaxing treatment.</p> <p>If you have a baby or a toddler The Mobile Makeover can help you put together a package of <a href="beauty-treatments.php" title="link to treatments page">treatments</a> that is ada...', ...)= undef at cgitest.pl line 366 !! ERROR: 1064 CLEARED by call to execute method <- execute("public_html/index.php", "http://www.themobilemakeover.co.uk/index.php", ...)= 1 at cgitest.pl line 367 <- DESTROY(DBI::st=HASH(3d56f5c))= undef at cgitest.pl line 270 <- quote("http://www.themobilemakeover.co.uk/about-us-the-mobile-makeover.php")= "'http://www.themobilemakeover.co.uk/about-us-the-mobile-makeover.php'" at cgitest.pl line 271 <- prepare("SELECT * FROM page_names WHERE linkTrue = 'http://www.themobilemakeover.co.uk/about-us-the-mobile-makeover.php' ")= DBI::st=HASH(0x3d56d9c) at cgitest.pl line 272 <- execute= '0E0' at cgitest.pl line 273 <- rows= '0' at cgitest.pl line 274 <- quote("The Mobile Makeover - About Us")= "'The Mobile Makeover - About Us'" at cgitest.pl line 289 <- prepare("SELECT * FROM page_names WHERE page_name = 'The Mobile Makeover - About Us' ")= DBI::st=HASH(0x3b07814) at cgitest.pl line 290 <- execute= '0E0' at cgitest.pl line 291 <- rows= '0' at cgitest.pl line 292 <- DESTROY(DBI::st=HASH(3d54254))= undef at cgitest.pl line 287 <- do('CREATE TABLE IF NOT EXISTS `30df18a64311aa9aaaa9576b030f0f83_body` ( `id` INT( 10 ) NOT NULL AUTO_INCREMENT PRIMARY KEY , `bodyData` TEXT NOT NULL, `bodyDataOutput` TEXT NOT NULL ) ENGINE = MYISAM CHARACTER SET utf8 COLLATE utf8_general_ci;')= '0E0' at cgitest.pl line 362 <- do('CREATE TABLE IF NOT EXISTS `30df18a64311aa9aaaa9576b030f0f83_header` ( `id` INT( 10 ) NOT NULL AUTO_INCREMENT PRIMARY KEY , `headData` TEXT NOT NULL, `headDataOutput` TEXT NOT NULL ) ENGINE = MYISAM CHARACTER SET utf8 COLLATE utf8_general_ci;')= '0E0' at cgitest.pl line 363 !! ERROR: 1064 'You have an error in your SQL syntax; check the manual that corresponds to your MySQL server version for the right syntax to use near ''30df18a64311aa9aaaa9576b030f0f83_header' ( headData, headDataOutput ) VALUES ( ' at line 1' (err#0) <- execute('30df18a64311aa9aaaa9576b030f0f83_header', '<?php session_start(); ?> <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd"> <html xmlns="http://www.w3.org/1999/xhtml"> <head> <meta http-equiv="Content-Type" content="text/html; charset=utf-8" /> <meta name="description" content=">My name is Kelly Knight, I am a highly Qualifed Mobile Beauty Therapist. I have trained in NVQ Level 2 and NVQ level 3 in Beauty Therapy with many additional courses and training..." /> <meta name="keywords" content="Mobile Makeover, About Us, Beauty Therapist, Mobile Therapist, Mansfield, Nottinghamshire" /> <meta name="language" content="en" /> <meta name="author" content="ACT Web Designs" /> <meta name="copyright" content="The Mobile Makeover" /> <meta name="publisher" content="ACT Web Designs" /> <meta name="country" content="United Kingdom" /> <meta name="city" content="Mansfield, Nottinghamshire" /> <meta http-equiv="X-UA-Compatible" content="IE=8" /> <title>The Mobile Makeover - About U...', ...)= undef at cgitest.pl line 365 !! ERROR: 1064 CLEARED by call to execute method !! ERROR: 1064 'You have an error in your SQL syntax; check the manual that corresponds to your MySQL server version for the right syntax to use near ''30df18a64311aa9aaaa9576b030f0f83_body' ( bodyData, bodyDataOutput ) VALUES ( '<' at line 1' (err#0) <- execute('30df18a64311aa9aaaa9576b030f0f83_body', '<body id="aboutUsPage"> <div id="wrapper"> <div id="header"> <div id="innerHeader"> <h1><span>The Mobile Makeover - About Us</span></h1> <div class="clear"></div> <?php include("php/navigation.php"); ?> <div class="clear"></div> </div> </div> <div id="main"> <div id="content1" class="content vis"> <h2>About Us - Kelly Night</h2> <div class="image1"> </div> <p>My name is Kelly Knight, I am a highly Qualified Mobile Beauty Therapist. I have trained in NVQ Level 2 and NVQ level 3 in Beauty Therapy with many additional courses and training gained within my time in the beauty industry. I have gained my years of experience from working at one of the UK's biggest Hotels &amp; Spa chains where i worked as a salon supervisor. After being approached by a number of people to go mobile to their homes i recognised that the...', ...)= undef at cgitest.pl line 366 !! ERROR: 1064 CLEARED by call to execute method <- execute("public_html/about-us-the-mobile-makeover.php", "http://www.themobilemakeover.co.uk/about-us-the-mobile-makeover.php", ...)= 1 at cgitest.pl line 367 <- DESTROY(DBI::st=HASH(3d56f1c))= undef at cgitest.pl line 270 <- quote("http://www.themobilemakeover.co.uk/beauty-products-used.php")= "'http://www.themobilemakeover.co.uk/beauty-products-used.php'" at cgitest.pl line 271 <- prepare("SELECT * FROM page_names WHERE linkTrue = 'http://www.themobilemakeover.co.uk/beauty-products-used.php' ")= DBI::st=HASH(0x3d56f3c) at cgitest.pl line 272 <- execute= '0E0' at cgitest.pl line 273 <- rows= '0' at cgitest.pl line 274 <- quote("The Mobile Makeover - Beauty Products Used")= "'The Mobile Makeover - Beauty Products Used'" at cgitest.pl line 289 <- prepare("SELECT * FROM page_names WHERE page_name = 'The Mobile Makeover - Beauty Products Used' ")= DBI::st=HASH(0x3d545a4) at cgitest.pl line 290 <- execute= '0E0' at cgitest.pl line 291 <- rows= '0' at cgitest.pl line 292 <- DESTROY(DBI::st=HASH(3d54684))= undef at cgitest.pl line 287 <- do('CREATE TABLE IF NOT EXISTS `02b5f135f611c1d7b0ec090182bc6cf5_body` ( `id` INT( 10 ) NOT NULL AUTO_INCREMENT PRIMARY KEY , `bodyData` TEXT NOT NULL, `bodyDataOutput` TEXT NOT NULL ) ENGINE = MYISAM CHARACTER SET utf8 COLLATE utf8_general_ci;')= '0E0' at cgitest.pl line 362 <- do('CREATE TABLE IF NOT EXISTS `02b5f135f611c1d7b0ec090182bc6cf5_header` ( `id` INT( 10 ) NOT NULL AUTO_INCREMENT PRIMARY KEY , `headData` TEXT NOT NULL, `headDataOutput` TEXT NOT NULL ) ENGINE = MYISAM CHARACTER SET utf8 COLLATE utf8_general_ci;')= '0E0' at cgitest.pl line 363 !! ERROR: 1064 'You have an error in your SQL syntax; check the manual that corresponds to your MySQL server version for the right syntax to use near ''02b5f135f611c1d7b0ec090182bc6cf5_header' ( headData, headDataOutput ) VALUES ( ' at line 1' (err#0) <- execute('02b5f135f611c1d7b0ec090182bc6cf5_header', '<?php session_start(); ?> <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd"> <html xmlns="http://www.w3.org/1999/xhtml"> <head> <meta http-equiv="Content-Type" content="text/html; charset=utf-8" /> <meta name="description" content="We use a wide range of the finest products on the market today. Below is a short brief of just a few of the names which we believe give you the best results - we do not compromise when it comes to quality." /> <meta name="keywords" content="Mobile Makeover, Beauty Therapist, Beauty Products, Jessica, Calgel, Eve Taylor, Tantrick, Therapist, Mansfield, Nottinghamshire" /> <meta name="language" content="en" /> <meta name="author" content="ACT Web Designs" /> <meta name="copyright" content="The Mobile Makeover" /> <meta name="publisher" content="ACT Web Designs" /> <meta name="country" content="United Kingdom" /> <meta name="city" content="Mansfield, Nottinghamshire" /> <meta http-equiv="X-UA-Compa...', ...)= undef at cgitest.pl line 365 !! ERROR: 1064 CLEARED by call to execute method !! ERROR: 1064 'You have an error in your SQL syntax; check the manual that corresponds to your MySQL server version for the right syntax to use near ''02b5f135f611c1d7b0ec090182bc6cf5_body' ( bodyData, bodyDataOutput ) VALUES ( '<' at line 1' (err#0) <- execute('02b5f135f611c1d7b0ec090182bc6cf5_body', '<body id="aboutUsPage"> <div id="wrapper"> <div id="header"> <div id="innerHeader"> <h1><span>The Mobile Makeover - Beauty Products</span></h1> <div class="clear"></div> <?php include("php/navigation.php"); ?> <div class="clear"></div> </div> </div> <div id="main"> <div id="content1" class="content vis"> <h2>Beauty products that we use</h2> <div class="image1"> </div> <p>We use a wide range of the finest products on the market today. Below is a short brief of just a few of the names which we believe give you the best results - we do not compromise when it comes to quality.<br /> - <em>Kelly Knight</em></p> </div> <div class="content vis norm"> <h2>Jessica</h2> <div class="image3"> </div> <p>The Jessica &copy; nail products are de...', ...)= undef at cgitest.pl line 366 !! ERROR: 1064 CLEARED by call to execute method <- execute("public_html/beauty-products-used.php", "http://www.themobilemakeover.co.uk/beauty-products-used.php", ...)= 1 at cgitest.pl line 367 <- DESTROY(DBI::st=HASH(3d6982c))= undef at cgitest.pl line 270 <- quote("http://www.themobilemakeover.co.uk/beauty-treatments.php")= "'http://www.themobilemakeover.co.uk/beauty-treatments.php'" at cgitest.pl line 271 <- prepare("SELECT * FROM page_names WHERE linkTrue = 'http://www.themobilemakeover.co.uk/beauty-treatments.php' ")= DBI::st=HASH(0x3d56edc) at cgitest.pl line 272 <- execute= '0E0' at cgitest.pl line 273 <- rows= '0' at cgitest.pl line 274 <- quote("The Mobile Makeover - Beauty Treatments")= "'The Mobile Makeover - Beauty Treatments'" at cgitest.pl line 289 <- prepare("SELECT * FROM page_names WHERE page_name = 'The Mobile Makeover - Beauty Treatments' ")= DBI::st=HASH(0x3d6b48c) at cgitest.pl line 290 <- execute= '0E0' at cgitest.pl line 291 <- rows= '0' at cgitest.pl line 292 <- DESTROY(DBI::st=HASH(3d6c674))= undef at cgitest.pl line 287 <- do('CREATE TABLE IF NOT EXISTS `22e64cef7d70fa952ce7444f158e2c4e_body` ( `id` INT( 10 ) NOT NULL AUTO_INCREMENT PRIMARY KEY , `bodyData` TEXT NOT NULL, A: It's hard to see for sure what's going wrong, but I think Andreas Bonini is correct that you've got quoting problems. However, he has accidentally referred you to a PHP function ;-) You can use DBI's quote method for the same effect. (Update: oops, you used it already for the data items. But perhaps you need to use it - or placeholders - for the table name variables too?) However, it's considered better practice by most people to use placeholder values: while (something) { # I've imagined you're looping over the data $dbh->do("INSERT INTO $headerTable ( headData, headDataOutput ) VALUES ( $headContents, $headContents )") or die " error: Couldn't connect to database: " . DBI->errstr; } becomes: my $sth = $dbh->prepare("INSERT INTO ? ( headData, headDataOutput ) VALUES ( ?, ? )") or die " error: Couldn't prepare : " . DBI->errstr;) # later... while (something) { # loop over the data $sth->execute($headerTable, $headContents, $headContents) or die "couldn't execute: " . $sth->errstr; } Untested... sorry ;-) I'm not 100% sure you can use a placeholder for the table name, but I don't really see why not, so I suggest trying it. If not, you should quote() the table name as described above. Assuming your code runs in a loop, you can prepare the statement handler ($sth) once outside the loop and run execute several times, which should save some time if you have many inserts to do. HTH

2024-07-23T01:26:28.774034

https://example.com/article/1779

"Second harmonic generation serves as the basis for a microscope imaging contrast mechanism that visualizes cell and tissue structure and function. This book provides a complete overview of the principles underlying this technique and its current applications, including use in molecular sensing. Covering practical issues related to instrumentation, the text examines which kinds of external labels to use. It also gives detailed reviews of the use of second harmonic generation in biomedical research, from imaging of cancer and skin disorders to self-assembled gels, holographic SHG imaging, and tissue engineering applications"--Provided by publisher.

2024-07-05T01:26:28.774034

https://example.com/article/2739

RPT-Energy dispute deepens between Mexico and foreign allies MEXICO CITY, May 16 (Reuters) - The European Union and Canada have formally raised concerns to Mexico about rules they say endanger renewable energy projects, escalating tensions with its government, which late on Friday moved to tighten its control over the power industry. In letters that were leaked to Mexican media on Friday, the same day they were sent, the foreign powers said the rules threatened foreign investment in the energy sector. Diplomatic sources confirmed the letters were genuine on Saturday. The Mexican government has not commented publicly in response to the letters, but on Saturday the energy ministry wrote in a post on Twitter that “it is the responsibility of the state to guarantee the reliability of the system in an orderly, continuous and effective manner.” The highly unusual diplomatic intervention by Canada and the European powers, some of Mexico’s closest allies, underlines the frustration felt by foreign governments over President Andres Manuel Lopez Obrador’s handling of energy policy. Lopez Obrador has pledged to make Mexico more self-sufficient and strengthen the state’s role in energy. The letters raise concerns about rules issued by electricity regulator CENACE last month that suspended the operation of new renewable energy plants in Mexico, arguing it was necessary to safeguard power supply during the coronavirus outbreak. Late on Friday, Mexico’s energy ministry published additional rules in the government’s official gazette that give the public sector more control over the national electricity system. Foreign governments and international investors are worried Mexico is eroding the legal foundations of contracts worth billions of dollars with the previous administration, in what they see as a creeping squeeze-out of their interests. Canada’s ambassador-designate to Mexico, Graeme Clark, said in the Canadian letter that the new CENACE regulations would imperil Canadian renewable energy projects and requested a meeting with Mexican authorities to discuss the measures. “This agreement joins a host of measures, legal and policy changes that attack investment in renewable energy in the country,” Clark said in the letter addressed to Energy Minister Rocio Nahle. Companies such as ATCO, Canadian Solar, Cubico Sustainable Investments and Northland Power could be affected, the Canadian embassy added. A spokeswoman for the embassy confirmed the authenticity of the letter. In its letter to Nahle, the European Union’s delegation in Mexico said the CENACE rules would “negatively impact” 44 renewable energy projects in Mexico and jeopardize investment from EU companies, which totals more than $6.4 billion. Two diplomatic sources confirmed the authenticity of the EU letter. When asked by Reuters for comment on the letter, the EU’s delegation said whenever the bloc had important issues to discuss with Mexico’s government, it did so in private, and had nothing further to add. (Reporting by Diego Ore and Dave Graham in Mexico City Writing by Julia Love Editing by Matthew Lewis)

2023-08-03T01:26:28.774034

https://example.com/article/5936

Q: Level plot for continuous x continuous interaction with continuous response Recently, I came across a publication using a level/tile/contour plot to illustrate the relationship between two continuous variables and a continuous response (with the input variables on the x and y axes and the response plotted as a color). This struck me as a very intuitive way to plot this type of interaction, but I have since had difficulty finding similar uses of this type of plot in this context. Here is a contrived example of such a plot, using mtcars and ggplot2 in R. lm.mod <- lm(mpg ~ wt*hp, data = mtcars) summary(lm.mod) ... Coefficients: Estimate Std. Error t value Pr(>|t|) (Intercept) 49.80842 3.60516 13.816 5.01e-14 *** wt -8.21662 1.26971 -6.471 5.20e-07 *** hp -0.12010 0.02470 -4.863 4.04e-05 *** wt:hp 0.02785 0.00742 3.753 0.000811 *** ... prepplot <- as.data.frame(matrix(ncol = 3, nrow = 10000)) colnames(prepplot) <- c("hp", "wt", "est.mpg") prepplot$hp <- rep(seq(52,335, length.out = 100), 100) prepplot <- prepplot[order(prepplot$hp),] prepplot$wt <- rep(seq(1.513,5.424, length.out = 100), 100) prepplot$est.mpg <- 49.80842 - 8.21662*prepplot$wt - 0.12010*prepplot$hp + 0.02785*prepplot$wt*prepplot$hp ggplot(prepplot, aes(wt, hp, fill = est.mpg)) + geom_tile() + xlab("Weight (1000 lbs.)") + ylab("Horsepower") + scale_fill_gradientn(colours = c("#b2182b","#d6604d","#f4a582","#fddbc7","#f7f7f7","#d1e5f0","#92c5de","#4393c3","#2166ac")) + scale_x_continuous(expand = c(0,0)) + scale_y_continuous(expand = c(0,0)) Is fair to interpret this plot in this way: "The color of a given coordinate represents the predicted MPG for that weight and horsepower"? If so, how might someone create this plot for two interacted terms in a regression with even more predictors? Does this plot commit a statistical fault I am not considering? A: Yes, your interpretation of the colors makes perfect sense. (Incidentally, this kind of plot is called a "heat map" - a level plot usually uses contour lines to indicate discrete levels of data, and colors are secondary.) If you have even more predictors, say three, a sensible thing would be to plot heatmaps like yours for two of the three predictors at discrete levels of the third predictor. For instance, at the three quartiles of the observed values of the third predictors. With four or more predictors, I usually despair of visualizing. This earlier question may be helpful: How to investigate a 3-way interaction?.

2023-09-22T01:26:28.774034

https://example.com/article/7365

[We operated for a few months in the beginning, then after that we had an injunction, then we operated for about 4 months, and then another 6 months for the pilot phase. So on and off operations really took a toll on the company.)

2024-06-18T01:26:28.774034

https://example.com/article/4190

/* infcover.c -- test zlib's inflate routines with full code coverage * Copyright (C) 2011, 2016 Mark Adler * For conditions of distribution and use, see copyright notice in zlib.h */ /* to use, do: ./configure --cover && make cover */ #include <stdio.h> #include <stdlib.h> #include <string.h> #undef NDEBUG #include <assert.h> #include <inttypes.h> #include <stdint.h> /* get definition of internal structure so we can mess with it (see pull()), and so we can call inflate_trees() (see cover5()) */ #define ZLIB_INTERNAL #include "zbuild.h" #ifdef ZLIB_COMPAT # include "zlib.h" #else # include "zlib-ng.h" #endif #include "inftrees.h" #include "inflate.h" /* -- memory tracking routines -- */ /* These memory tracking routines are provided to zlib and track all of zlib's allocations and deallocations, check for LIFO operations, keep a current and high water mark of total bytes requested, optionally set a limit on the total memory that can be allocated, and when done check for memory leaks. They are used as follows: PREFIX3(stream) strm; mem_setup(&strm) initializes the memory tracking and sets the zalloc, zfree, and opaque members of strm to use memory tracking for all zlib operations on strm mem_limit(&strm, limit) sets a limit on the total bytes requested -- a request that exceeds this limit will result in an allocation failure (returns NULL) -- setting the limit to zero means no limit, which is the default after mem_setup() mem_used(&strm, "msg") prints to stderr "msg" and the total bytes used mem_high(&strm, "msg") prints to stderr "msg" and the high water mark mem_done(&strm, "msg") ends memory tracking, releases all allocations for the tracking as well as leaked zlib blocks, if any. If there was anything unusual, such as leaked blocks, non-FIFO frees, or frees of addresses not allocated, then "msg" and information about the problem is printed to stderr. If everything is normal, nothing is printed. mem_done resets the strm members to NULL to use the default memory allocation routines on the next zlib initialization using strm. */ /* these items are strung together in a linked list, one for each allocation */ struct mem_item { void *ptr; /* pointer to allocated memory */ size_t size; /* requested size of allocation */ struct mem_item *next; /* pointer to next item in list, or NULL */ }; /* this structure is at the root of the linked list, and tracks statistics */ struct mem_zone { struct mem_item *first; /* pointer to first item in list, or NULL */ size_t total, highwater; /* total allocations, and largest total */ size_t limit; /* memory allocation limit, or 0 if no limit */ int notlifo, rogue; /* counts of non-LIFO frees and rogue frees */ }; /* memory allocation routine to pass to zlib */ static void *mem_alloc(void *mem, unsigned count, unsigned size) { void *ptr; struct mem_item *item; struct mem_zone *zone = mem; size_t len = count * (size_t)size; /* induced allocation failure */ if (zone == NULL || (zone->limit && zone->total + len > zone->limit)) return NULL; /* perform allocation using the standard library, fill memory with a non-zero value to make sure that the code isn't depending on zeros */ ptr = malloc(len); if (ptr == NULL) return NULL; memset(ptr, 0xa5, len); /* create a new item for the list */ item = malloc(sizeof(struct mem_item)); if (item == NULL) { free(ptr); return NULL; } item->ptr = ptr; item->size = len; /* insert item at the beginning of the list */ item->next = zone->first; zone->first = item; /* update the statistics */ zone->total += item->size; if (zone->total > zone->highwater) zone->highwater = zone->total; /* return the allocated memory */ return ptr; } /* memory free routine to pass to zlib */ static void mem_free(void *mem, void *ptr) { struct mem_item *item, *next; struct mem_zone *zone = mem; /* if no zone, just do a free */ if (zone == NULL) { free(ptr); return; } /* point next to the item that matches ptr, or NULL if not found -- remove the item from the linked list if found */ next = zone->first; if (next) { if (next->ptr == ptr) zone->first = next->next; /* first one is it, remove from list */ else { do { /* search the linked list */ item = next; next = item->next; } while (next != NULL && next->ptr != ptr); if (next) { /* if found, remove from linked list */ item->next = next->next; zone->notlifo++; /* not a LIFO free */ } } } /* if found, update the statistics and free the item */ if (next) { zone->total -= next->size; free(next); } /* if not found, update the rogue count */ else zone->rogue++; /* in any case, do the requested free with the standard library function */ free(ptr); } /* set up a controlled memory allocation space for monitoring, set the stream parameters to the controlled routines, with opaque pointing to the space */ static void mem_setup(PREFIX3(stream) *strm) { struct mem_zone *zone; zone = malloc(sizeof(struct mem_zone)); assert(zone != NULL); zone->first = NULL; zone->total = 0; zone->highwater = 0; zone->limit = 0; zone->notlifo = 0; zone->rogue = 0; strm->opaque = zone; strm->zalloc = mem_alloc; strm->zfree = mem_free; } /* set a limit on the total memory allocation, or 0 to remove the limit */ static void mem_limit(PREFIX3(stream) *strm, size_t limit) { struct mem_zone *zone = strm->opaque; zone->limit = limit; } /* show the current total requested allocations in bytes */ static void mem_used(PREFIX3(stream) *strm, char *prefix) { struct mem_zone *zone = strm->opaque; fprintf(stderr, "%s: %" PRIu64 " allocated\n", prefix, (uint64_t)zone->total); } /* show the high water allocation in bytes */ static void mem_high(PREFIX3(stream) *strm, char *prefix) { struct mem_zone *zone = strm->opaque; fprintf(stderr, "%s: %" PRIu64 " high water mark\n", prefix, (uint64_t)zone->highwater); } /* release the memory allocation zone -- if there are any surprises, notify */ static void mem_done(PREFIX3(stream) *strm, char *prefix) { int count = 0; struct mem_item *item, *next; struct mem_zone *zone = strm->opaque; /* show high water mark */ mem_high(strm, prefix); /* free leftover allocations and item structures, if any */ item = zone->first; while (item != NULL) { free(item->ptr); next = item->next; free(item); item = next; count++; } /* issue alerts about anything unexpected */ if (count || zone->total) fprintf(stderr, "** %s: %" PRIu64 " bytes in %d blocks not freed\n", prefix, (uint64_t)zone->total, count); if (zone->notlifo) fprintf(stderr, "** %s: %d frees not LIFO\n", prefix, zone->notlifo); if (zone->rogue) fprintf(stderr, "** %s: %d frees not recognized\n", prefix, zone->rogue); /* free the zone and delete from the stream */ free(zone); strm->opaque = NULL; strm->zalloc = NULL; strm->zfree = NULL; } /* -- inflate test routines -- */ /* Decode a hexadecimal string, set *len to length, in[] to the bytes. This decodes liberally, in that hex digits can be adjacent, in which case two in a row writes a byte. Or they can be delimited by any non-hex character, where the delimiters are ignored except when a single hex digit is followed by a delimiter, where that single digit writes a byte. The returned data is allocated and must eventually be freed. NULL is returned if out of memory. If the length is not needed, then len can be NULL. */ static unsigned char *h2b(const char *hex, unsigned *len) { unsigned char *in, *re; unsigned next, val; size_t inlen; inlen = (strlen(hex) + 1) >> 1; assert(inlen != 0); /* tell static analyzer we won't call malloc(0) */ in = malloc(inlen); if (in == NULL) return NULL; next = 0; val = 1; do { if (*hex >= '0' && *hex <= '9') val = (val << 4) + *hex - '0'; else if (*hex >= 'A' && *hex <= 'F') val = (val << 4) + *hex - 'A' + 10; else if (*hex >= 'a' && *hex <= 'f') val = (val << 4) + *hex - 'a' + 10; else if (val != 1 && val < 32) /* one digit followed by delimiter */ val += 240; /* make it look like two digits */ if (val > 255) { /* have two digits */ in[next++] = val & 0xff; /* save the decoded byte */ val = 1; /* start over */ } } while (*hex++); /* go through the loop with the terminating null */ if (len != NULL) *len = next; assert(next != 0); /* tell static analyzer we won't call realloc(in, 0) */ re = realloc(in, next); return re == NULL ? in : re; } /* generic inflate() run, where hex is the hexadecimal input data, what is the text to include in an error message, step is how much input data to feed inflate() on each call, or zero to feed it all, win is the window bits parameter to inflateInit2(), len is the size of the output buffer, and err is the error code expected from the first inflate() call (the second inflate() call is expected to return Z_STREAM_END). If win is 47, then header information is collected with inflateGetHeader(). If a zlib stream is looking for a dictionary, then an empty dictionary is provided. inflate() is run until all of the input data is consumed. */ static void inf(char *hex, char *what, unsigned step, int win, unsigned len, int err) { int ret; unsigned have; unsigned char *in, *out; PREFIX3(stream) strm, copy; PREFIX(gz_header) head; mem_setup(&strm); strm.avail_in = 0; strm.next_in = NULL; ret = PREFIX(inflateInit2)(&strm, win); if (ret != Z_OK) { mem_done(&strm, what); return; } out = malloc(len); assert(out != NULL); if (win == 47) { head.extra = out; head.extra_max = len; head.name = out; head.name_max = len; head.comment = out; head.comm_max = len; ret = PREFIX(inflateGetHeader)(&strm, &head); assert(ret == Z_OK); } in = h2b(hex, &have); assert(in != NULL); if (step == 0 || step > have) step = have; strm.avail_in = step; have -= step; strm.next_in = in; do { strm.avail_out = len; strm.next_out = out; ret = PREFIX(inflate)(&strm, Z_NO_FLUSH); assert(err == 9 || ret == err); if (ret != Z_OK && ret != Z_BUF_ERROR && ret != Z_NEED_DICT) break; if (ret == Z_NEED_DICT) { ret = PREFIX(inflateSetDictionary)(&strm, in, 1); assert(ret == Z_DATA_ERROR); mem_limit(&strm, 1); ret = PREFIX(inflateSetDictionary)(&strm, out, 0); assert(ret == Z_MEM_ERROR); mem_limit(&strm, 0); ((struct inflate_state *)strm.state)->mode = DICT; ret = PREFIX(inflateSetDictionary)(&strm, out, 0); assert(ret == Z_OK); ret = PREFIX(inflate)(&strm, Z_NO_FLUSH); assert(ret == Z_BUF_ERROR); } ret = PREFIX(inflateCopy)(&copy, &strm); assert(ret == Z_OK); ret = PREFIX(inflateEnd)(&copy); assert(ret == Z_OK); err = 9; /* don't care next time around */ have += strm.avail_in; strm.avail_in = step > have ? have : step; have -= strm.avail_in; } while (strm.avail_in); free(in); free(out); ret = PREFIX(inflateReset2)(&strm, -8); assert(ret == Z_OK); ret = PREFIX(inflateEnd)(&strm); assert(ret == Z_OK); mem_done(&strm, what); (void)err; } /* cover all of the lines in inflate.c up to inflate() */ static void cover_support(void) { int ret; PREFIX3(stream) strm; mem_setup(&strm); strm.avail_in = 0; strm.next_in = NULL; ret = PREFIX(inflateInit)(&strm); assert(ret == Z_OK); mem_used(&strm, "inflate init"); ret = PREFIX(inflatePrime)(&strm, 5, 31); assert(ret == Z_OK); ret = PREFIX(inflatePrime)(&strm, -1, 0); assert(ret == Z_OK); ret = PREFIX(inflateSetDictionary)(&strm, NULL, 0); assert(ret == Z_STREAM_ERROR); ret = PREFIX(inflateEnd)(&strm); assert(ret == Z_OK); mem_done(&strm, "prime"); inf("63 0", "force window allocation", 0, -15, 1, Z_OK); inf("63 18 5", "force window replacement", 0, -8, 259, Z_OK); inf("63 18 68 30 d0 0 0", "force split window update", 4, -8, 259, Z_OK); inf("3 0", "use fixed blocks", 0, -15, 1, Z_STREAM_END); inf("", "bad window size", 0, 1, 0, Z_STREAM_ERROR); mem_setup(&strm); strm.avail_in = 0; strm.next_in = NULL; ret = PREFIX(inflateInit_)(&strm, &PREFIX2(VERSION)[1], (int)sizeof(PREFIX3(stream))); assert(ret == Z_VERSION_ERROR); mem_done(&strm, "wrong version"); strm.avail_in = 0; strm.next_in = NULL; ret = PREFIX(inflateInit)(&strm); assert(ret == Z_OK); ret = PREFIX(inflateEnd)(&strm); assert(ret == Z_OK); fputs("inflate built-in memory routines\n", stderr); (void)ret; } /* cover all inflate() header and trailer cases and code after inflate() */ static void cover_wrap(void) { int ret; PREFIX3(stream) strm, copy; unsigned char dict[257]; ret = PREFIX(inflate)(NULL, 0); assert(ret == Z_STREAM_ERROR); ret = PREFIX(inflateEnd)(NULL); assert(ret == Z_STREAM_ERROR); ret = PREFIX(inflateCopy)(NULL, NULL); assert(ret == Z_STREAM_ERROR); fputs("inflate bad parameters\n", stderr); inf("1f 8b 0 0", "bad gzip method", 0, 31, 0, Z_DATA_ERROR); inf("1f 8b 8 80", "bad gzip flags", 0, 31, 0, Z_DATA_ERROR); inf("77 85", "bad zlib method", 0, 15, 0, Z_DATA_ERROR); inf("8 99", "set window size from header", 0, 0, 0, Z_OK); inf("78 9c", "bad zlib window size", 0, 8, 0, Z_DATA_ERROR); inf("78 9c 63 0 0 0 1 0 1", "check adler32", 0, 15, 1, Z_STREAM_END); inf("1f 8b 8 1e 0 0 0 0 0 0 1 0 0 0 0 0 0", "bad header crc", 0, 47, 1, Z_DATA_ERROR); inf("1f 8b 8 2 0 0 0 0 0 0 1d 26 3 0 0 0 0 0 0 0 0 0", "check gzip length", 0, 47, 0, Z_STREAM_END); inf("78 90", "bad zlib header check", 0, 47, 0, Z_DATA_ERROR); inf("8 b8 0 0 0 1", "need dictionary", 0, 8, 0, Z_NEED_DICT); inf("78 9c 63 0", "compute adler32", 0, 15, 1, Z_OK); mem_setup(&strm); strm.avail_in = 0; strm.next_in = NULL; ret = PREFIX(inflateInit2)(&strm, -8); strm.avail_in = 2; strm.next_in = (void *)"\x63"; strm.avail_out = 1; strm.next_out = (void *)&ret; mem_limit(&strm, 1); ret = PREFIX(inflate)(&strm, Z_NO_FLUSH); assert(ret == Z_MEM_ERROR); ret = PREFIX(inflate)(&strm, Z_NO_FLUSH); assert(ret == Z_MEM_ERROR); mem_limit(&strm, 0); memset(dict, 0, 257); ret = PREFIX(inflateSetDictionary)(&strm, dict, 257); assert(ret == Z_OK); mem_limit(&strm, (sizeof(struct inflate_state) << 1) + 256); ret = PREFIX(inflatePrime)(&strm, 16, 0); assert(ret == Z_OK); strm.avail_in = 2; strm.next_in = (void *)"\x80"; ret = PREFIX(inflateSync)(&strm); assert(ret == Z_DATA_ERROR); ret = PREFIX(inflate)(&strm, Z_NO_FLUSH); assert(ret == Z_STREAM_ERROR); strm.avail_in = 4; strm.next_in = (void *)"\0\0\xff\xff"; ret = PREFIX(inflateSync)(&strm); assert(ret == Z_OK); (void)PREFIX(inflateSyncPoint)(&strm); ret = PREFIX(inflateCopy)(&copy, &strm); assert(ret == Z_MEM_ERROR); mem_limit(&strm, 0); ret = PREFIX(inflateUndermine)(&strm, 1); #ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR assert(ret == Z_OK); #else assert(ret == Z_DATA_ERROR); #endif (void)PREFIX(inflateMark)(&strm); ret = PREFIX(inflateEnd)(&strm); assert(ret == Z_OK); mem_done(&strm, "miscellaneous, force memory errors"); } /* input and output functions for inflateBack() */ static unsigned pull(void *desc, z_const unsigned char **buf) { static unsigned int next = 0; static unsigned char dat[] = {0x63, 0, 2, 0}; struct inflate_state *state; if (desc == NULL) { next = 0; return 0; /* no input (already provided at next_in) */ } state = (void *)((PREFIX3(stream) *)desc)->state; if (state != NULL) state->mode = SYNC; /* force an otherwise impossible situation */ return next < sizeof(dat) ? (*buf = dat + next++, 1) : 0; } static int push(void *desc, unsigned char *buf, unsigned len) { buf += len; (void)buf; return desc != NULL; /* force error if desc not null */ } /* cover inflateBack() up to common deflate data cases and after those */ static void cover_back(void) { int ret; PREFIX3(stream) strm; unsigned char win[32768]; ret = PREFIX(inflateBackInit_)(NULL, 0, win, 0, 0); assert(ret == Z_VERSION_ERROR); ret = PREFIX(inflateBackInit)(NULL, 0, win); assert(ret == Z_STREAM_ERROR); ret = PREFIX(inflateBack)(NULL, NULL, NULL, NULL, NULL); assert(ret == Z_STREAM_ERROR); ret = PREFIX(inflateBackEnd)(NULL); assert(ret == Z_STREAM_ERROR); fputs("inflateBack bad parameters\n", stderr); mem_setup(&strm); ret = PREFIX(inflateBackInit)(&strm, 15, win); assert(ret == Z_OK); strm.avail_in = 2; strm.next_in = (void *)"\x03"; ret = PREFIX(inflateBack)(&strm, pull, NULL, push, NULL); assert(ret == Z_STREAM_END); /* force output error */ strm.avail_in = 3; strm.next_in = (void *)"\x63\x00"; ret = PREFIX(inflateBack)(&strm, pull, NULL, push, &strm); assert(ret == Z_BUF_ERROR); /* force mode error by mucking with state */ ret = PREFIX(inflateBack)(&strm, pull, &strm, push, NULL); assert(ret == Z_STREAM_ERROR); ret = PREFIX(inflateBackEnd)(&strm); assert(ret == Z_OK); mem_done(&strm, "inflateBack bad state"); ret = PREFIX(inflateBackInit)(&strm, 15, win); assert(ret == Z_OK); ret = PREFIX(inflateBackEnd)(&strm); assert(ret == Z_OK); fputs("inflateBack built-in memory routines\n", stderr); (void)ret; } /* do a raw inflate of data in hexadecimal with both inflate and inflateBack */ static int try(char *hex, char *id, int err) { int ret; unsigned len, size; unsigned char *in, *out, *win; char *prefix; PREFIX3(stream) strm; /* convert to hex */ in = h2b(hex, &len); assert(in != NULL); /* allocate work areas */ size = len << 3; out = malloc(size); assert(out != NULL); win = malloc(32768); assert(win != NULL); prefix = malloc(strlen(id) + 6); assert(prefix != NULL); /* first with inflate */ strcpy(prefix, id); strcat(prefix, "-late"); mem_setup(&strm); strm.avail_in = 0; strm.next_in = NULL; ret = PREFIX(inflateInit2)(&strm, err < 0 ? 47 : -15); assert(ret == Z_OK); strm.avail_in = len; strm.next_in = in; do { strm.avail_out = size; strm.next_out = out; ret = PREFIX(inflate)(&strm, Z_TREES); assert(ret != Z_STREAM_ERROR && ret != Z_MEM_ERROR); if (ret == Z_DATA_ERROR || ret == Z_NEED_DICT) break; } while (strm.avail_in || strm.avail_out == 0); if (err) { assert(ret == Z_DATA_ERROR); assert(strcmp(id, strm.msg) == 0); } PREFIX(inflateEnd)(&strm); mem_done(&strm, prefix); /* then with inflateBack */ if (err >= 0) { strcpy(prefix, id); strcat(prefix, "-back"); mem_setup(&strm); ret = PREFIX(inflateBackInit)(&strm, 15, win); assert(ret == Z_OK); strm.avail_in = len; strm.next_in = in; ret = PREFIX(inflateBack)(&strm, pull, NULL, push, NULL); assert(ret != Z_STREAM_ERROR); if (err && ret != Z_BUF_ERROR) { assert(ret == Z_DATA_ERROR); assert(strcmp(id, strm.msg) == 0); } PREFIX(inflateBackEnd)(&strm); mem_done(&strm, prefix); } /* clean up */ free(prefix); free(win); free(out); free(in); return ret; } /* cover deflate data cases in both inflate() and inflateBack() */ static void cover_inflate(void) { try("0 0 0 0 0", "invalid stored block lengths", 1); try("3 0", "fixed", 0); try("6", "invalid block type", 1); try("1 1 0 fe ff 0", "stored", 0); try("fc 0 0", "too many length or distance symbols", 1); try("4 0 fe ff", "invalid code lengths set", 1); try("4 0 24 49 0", "invalid bit length repeat", 1); try("4 0 24 e9 ff ff", "invalid bit length repeat", 1); try("4 0 24 e9 ff 6d", "invalid code -- missing end-of-block", 1); try("4 80 49 92 24 49 92 24 71 ff ff 93 11 0", "invalid literal/lengths set", 1); try("4 80 49 92 24 49 92 24 f b4 ff ff c3 84", "invalid distances set", 1); try("4 c0 81 8 0 0 0 0 20 7f eb b 0 0", "invalid literal/length code", 1); try("2 7e ff ff", "invalid distance code", 1); #ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR try("c c0 81 0 0 0 0 0 90 ff 6b 4 0", "invalid distance too far back", 0); #else try("c c0 81 0 0 0 0 0 90 ff 6b 4 0", "invalid distance too far back", 1); #endif /* also trailer mismatch just in inflate() */ try("1f 8b 8 0 0 0 0 0 0 0 3 0 0 0 0 1", "incorrect data check", -1); try("1f 8b 8 0 0 0 0 0 0 0 3 0 0 0 0 0 0 0 0 1", "incorrect length check", -1); try("5 c0 21 d 0 0 0 80 b0 fe 6d 2f 91 6c", "pull 17", 0); try("5 e0 81 91 24 cb b2 2c 49 e2 f 2e 8b 9a 47 56 9f fb fe ec d2 ff 1f", "long code", 0); try("ed c0 1 1 0 0 0 40 20 ff 57 1b 42 2c 4f", "length extra", 0); try("ed cf c1 b1 2c 47 10 c4 30 fa 6f 35 1d 1 82 59 3d fb be 2e 2a fc f c", "long distance and extra", 0); try("ed c0 81 0 0 0 0 80 a0 fd a9 17 a9 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 " "0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 6", "window end", 0); inf("2 8 20 80 0 3 0", "inflate_fast TYPE return", 0, -15, 258, Z_STREAM_END); inf("63 18 5 40 c 0", "window wrap", 3, -8, 300, Z_OK); } /* cover remaining lines in inftrees.c */ static void cover_trees(void) { int ret; unsigned bits; uint16_t lens[16], work[16]; code *next, table[ENOUGH_DISTS]; /* we need to call inflate_table() directly in order to manifest not- enough errors, since zlib insures that enough is always enough */ for (bits = 0; bits < 15; bits++) lens[bits] = (uint16_t)(bits + 1); lens[15] = 15; next = table; bits = 15; ret = zng_inflate_table(DISTS, lens, 16, &next, &bits, work); assert(ret == 1); next = table; bits = 1; ret = zng_inflate_table(DISTS, lens, 16, &next, &bits, work); assert(ret == 1); fputs("inflate_table not enough errors\n", stderr); (void)ret; } /* cover remaining inffast.c decoding and window copying */ static void cover_fast(void) { inf("e5 e0 81 ad 6d cb b2 2c c9 01 1e 59 63 ae 7d ee fb 4d fd b5 35 41 68" " ff 7f 0f 0 0 0", "fast length extra bits", 0, -8, 258, Z_DATA_ERROR); inf("25 fd 81 b5 6d 59 b6 6a 49 ea af 35 6 34 eb 8c b9 f6 b9 1e ef 67 49" " 50 fe ff ff 3f 0 0", "fast distance extra bits", 0, -8, 258, Z_DATA_ERROR); inf("3 7e 0 0 0 0 0", "fast invalid distance code", 0, -8, 258, Z_DATA_ERROR); inf("1b 7 0 0 0 0 0", "fast invalid literal/length code", 0, -8, 258, Z_DATA_ERROR); inf("d c7 1 ae eb 38 c 4 41 a0 87 72 de df fb 1f b8 36 b1 38 5d ff ff 0", "fast 2nd level codes and too far back", 0, -8, 258, Z_DATA_ERROR); inf("63 18 5 8c 10 8 0 0 0 0", "very common case", 0, -8, 259, Z_OK); inf("63 60 60 18 c9 0 8 18 18 18 26 c0 28 0 29 0 0 0", "contiguous and wrap around window", 6, -8, 259, Z_OK); inf("63 0 3 0 0 0 0 0", "copy direct from output", 0, -8, 259, Z_STREAM_END); } int main(void) { fprintf(stderr, "%s\n", zVersion()); cover_support(); cover_wrap(); cover_back(); cover_inflate(); cover_trees(); cover_fast(); return 0; }

2024-04-29T01:26:28.774034

https://example.com/article/8008

February 13/14 11:31 am - News Links of the Day Every day we post links on our Twitter page (@cdncyclist) to interesting items from around the world. For our readers who are not on Twitter, we have reproduced the headlines and links here. Commonwealth Games 2014 organisers reveal the routes for the ITT and Road races in Glasgow"Cycling is among the fastest and most thrilling events at Glasgow 2014 with the Road Race and Time Trial offering fans the chance to experience the excitement of the sport up close."Read more Here Winnipeg cyclists clearing snow from St. Boniface trailWinnipeg cyclists and pedestrians don't think the city has been keeping up with snow clearing, so they're tackling the job themselves.Read more Here Winter cycling focus of congressWinnipeg welcomes experts, advocatesThe coldest winter in decades has proven challenging to year-round cyclists in Winnipeg, but not because of the temperatures alone.Read more Here Who rides a bike in winter? Study sheds light on thousands of urban winter cyclists in CalgaryThe average winter cyclist in Calgary is a middle-aged man who rides almost every day, usually to work, and will brave temperatures down to -20 C and colder to do soRead more Here This ten point plan for fixing British cycling could apply in North America tooThe ten point plan is in fact relevant anywhere, not just in the UK.Read more Here Boulder Center for Sports Medicine seeks coachResponsible for coaching, training, and performance enhancement techniques for all athletes coached by this position.Read more Here Australian study shows getting fit increases pain tolerance After just six weeks of moderate workouts, people got tougher.Read more Here Italian coach gives verdict on 2014 World Championship road race routeThe UCI Road World Championships in Ponferrada, Spain, this year suits tough sprinters. Italian coach Davide Cassani assessed the race after riding two laps of the circuit yesterday in the country’s cold northwest.Read more Here Vuelta a Espana to include women’s raceFollowing in the footsteps of the Tour de France, the Vuelta a España will include a women’s race. Race Director Javier Guillén said that when the stage race returns to Madrid next year (2015) it will host a one-day women’s event.Read more Here Why the Dutch don't wear helmetsOne of the perennial topics of controversy in the bicycling community is helmets, and the controversial issue is not about which color is prettiest. I won't spend too much time on the backstory, but the controversy is whether or not helmets should be a must (for their skull & brain protection benefits) or left at the shop (because they inhibit bicycling, which results in less bicycling, which makes bicycling less safe). "Must" could mean a legal requirement, or it could simply mean a personally imposed must – it depends on the conversation.Read more Here

2023-08-19T01:26:28.774034

https://example.com/article/1607

# Copyright 2014 The Bazel Authors. All rights reserved. # # 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. # (From https://github.com/bazelbuild/rules_go/blob/master/go/def.bzl@a6f9d0c) load("//go/private:repositories.bzl", "go_repositories") load("//go/private:go_repository.bzl", "go_repository", "new_go_repository") load("//go/private:go_prefix.bzl", "go_prefix") load("//go/private:json.bzl", "json_marshal") """These are bare-bones Go rules. In order of priority: - BUILD file must be written by hand. - No support for SWIG - No test sharding or test XML. """ _DEFAULT_LIB = "go_default_library" _VENDOR_PREFIX = "/vendor/" go_filetype = FileType([ ".go", ".s", ".S", ".h", # may be included by .s ]) # be consistent to cc_library. hdr_exts = [ ".h", ".hh", ".hpp", ".hxx", ".inc", ] cc_hdr_filetype = FileType(hdr_exts) # Extensions of files we can build with the Go compiler or with cc_library. # This is a subset of the extensions recognized by go/build. cgo_filetype = FileType([ ".go", ".c", ".cc", ".cxx", ".cpp", ".s", ".S", ".h", ".hh", ".hpp", ".hxx", ]) ################ def go_environment_vars(ctx): """Return a map of environment variables for use with actions, based on the arguments. Uses the ctx.fragments.cpp.cpu attribute, if present, and picks a default of target_os="linux" and target_arch="amd64" otherwise. Args: The starlark Context. Returns: A dict of environment variables for running Go tool commands that build for the target OS and architecture. """ default_toolchain = {"GOOS": "linux", "GOARCH": "amd64"} bazel_to_go_toolchain = { "k8": {"GOOS": "linux", "GOARCH": "amd64"}, "piii": {"GOOS": "linux", "GOARCH": "386"}, "darwin": {"GOOS": "darwin", "GOARCH": "amd64"}, "darwin_x86_64": {"GOOS": "darwin", "GOARCH": "amd64"}, "freebsd": {"GOOS": "freebsd", "GOARCH": "amd64"}, "armeabi-v7a": {"GOOS": "linux", "GOARCH": "arm"}, "arm": {"GOOS": "linux", "GOARCH": "arm"} } env = {} if hasattr(ctx.file, "go_tool"): env["GOROOT"] = ctx.file.go_tool.dirname + "/.." env.update(bazel_to_go_toolchain.get(ctx.fragments.cpp.cpu, default_toolchain)) return env def _is_darwin_cpu(ctx): cpu = ctx.fragments.cpp.cpu return cpu == "darwin" or cpu == "darwin_x86_64" def _emit_generate_params_action(cmds, ctx, fn): cmds_all = [ # Use bash explicitly. /bin/sh is default, and it may be linked to a # different shell, e.g., /bin/dash on Ubuntu. "#!/bin/bash", "set -e", ] cmds_all += cmds cmds_all_str = "\n".join(cmds_all) + "\n" f = ctx.new_file(ctx.configuration.bin_dir, fn) ctx.file_action( output = f, content = cmds_all_str, executable = True) return f def _emit_go_asm_action(ctx, source, hdrs, out_obj): """Construct the command line for compiling Go Assembly code. Constructs a symlink tree to accomodate for workspace name. Args: ctx: The starlark Context. source: a source code artifact hdrs: list of .h files that may be included out_obj: the artifact (configured target?) that should be produced """ params = { "go_tool": ctx.file.go_tool.path, "includes": [f.dirname for f in hdrs] + [ctx.file.go_include.path], "source": source.path, "out": out_obj.path, } inputs = hdrs + ctx.files.toolchain + [source] ctx.action( inputs = inputs, outputs = [out_obj], mnemonic = "GoAsmCompile", executable = ctx.executable._asm, arguments = [json_marshal(params)], ) def _go_importpath(ctx): """Returns the expected importpath of the go_library being built. Args: ctx: The starlark Context Returns: Go importpath of the library """ path = ctx.attr.importpath if path != "": return path path = ctx.attr.go_prefix.go_prefix if path.endswith("/"): path = path[:-1] if ctx.label.package: path += "/" + ctx.label.package if ctx.label.name != _DEFAULT_LIB: path += "/" + ctx.label.name if path.rfind(_VENDOR_PREFIX) != -1: path = path[len(_VENDOR_PREFIX) + path.rfind(_VENDOR_PREFIX):] if path[0] == "/": path = path[1:] return path def _emit_go_compile_action(ctx, sources, deps, libpaths, out_object, gc_goopts): """Construct the command line for compiling Go code. Args: ctx: The starlark Context. sources: an iterable of source code artifacts (or CTs? or labels?) deps: an iterable of dependencies. Each dependency d should have an artifact in d.transitive_go_libraries representing all imported libraries. libpaths: the set of paths to search for imported libraries. out_object: the object file that should be produced gc_goopts: additional flags to pass to the compiler. """ if ctx.coverage_instrumented(): sources = _emit_go_cover_action(ctx, sources) # Compile filtered files. args = [ "-cgo", ctx.file.go_tool.path, "tool", "compile", "-o", out_object.path, "-trimpath", "-abs-.", "-I", "-abs-.", ] inputs = depset(sources + ctx.files.toolchain) for dep in deps: inputs += dep.transitive_go_libraries for path in libpaths: args += ["-I", path] args += gc_goopts + [("" if i.basename.startswith("_cgo") else "-filter-") + i.path for i in sources] ctx.action( inputs = list(inputs), outputs = [out_object], mnemonic = "GoCompile", executable = ctx.executable._filter_exec, arguments = args, env = go_environment_vars(ctx), ) return sources def _emit_go_pack_action(ctx, out_lib, objects): """Construct the command line for packing objects together. Args: ctx: The starlark Context. out_lib: the archive that should be produced objects: an iterable of object files to be added to the output archive file. """ ctx.action( inputs = objects + ctx.files.toolchain, outputs = [out_lib], mnemonic = "GoPack", executable = ctx.file.go_tool, arguments = ["tool", "pack", "c", out_lib.path] + [a.path for a in objects], env = go_environment_vars(ctx), ) def _emit_go_cover_action(ctx, sources): """Construct the command line for test coverage instrument. Args: ctx: The starlark Context. sources: an iterable of Go source files. Returns: A list of Go source code files which might be coverage instrumented. """ outputs = [] # TODO(linuxerwang): make the mode configurable. count = 0 for src in sources: if not src.path.endswith(".go") or src.path.endswith("_test.go"): outputs += [src] continue cover_var = "GoCover_%d" % count out = ctx.new_file(src, src.basename[:-3] + '_' + cover_var + '.cover.go') outputs += [out] ctx.action( inputs = [src] + ctx.files.toolchain, outputs = [out], mnemonic = "GoCover", executable = ctx.file.go_tool, arguments = ["tool", "cover", "--mode=set", "-var=%s" % cover_var, "-o", out.path, src.path], env = go_environment_vars(ctx), ) count += 1 return outputs def go_library_impl(ctx): """Implements the go_library() rule.""" sources = depset(ctx.files.srcs) go_srcs = depset([s for s in sources if s.basename.endswith('.go')]) asm_srcs = [s for s in sources if s.basename.endswith('.s') or s.basename.endswith('.S')] asm_hdrs = [s for s in sources if s.basename.endswith('.h')] deps = ctx.attr.deps dep_runfiles = [d.data_runfiles for d in deps] cgo_object = None if hasattr(ctx.attr, "cgo_object"): cgo_object = ctx.attr.cgo_object if ctx.attr.library: go_srcs += ctx.attr.library.go_sources asm_srcs += ctx.attr.library.asm_sources asm_hdrs += ctx.attr.library.asm_headers deps += ctx.attr.library.direct_deps dep_runfiles += [ctx.attr.library.data_runfiles] if ctx.attr.library.cgo_object: if cgo_object: fail("go_library %s cannot have cgo_object because the package " + "already has cgo_object in %s" % (ctx.label.name, ctx.attr.library.name)) cgo_object = ctx.attr.library.cgo_object if not go_srcs: fail("may not be empty", "srcs") transitive_cgo_deps = depset([], order="topological") if cgo_object: dep_runfiles += [cgo_object.data_runfiles] transitive_cgo_deps += cgo_object.cgo_deps extra_objects = [cgo_object.cgo_obj] if cgo_object else [] for src in asm_srcs: obj = ctx.new_file(src, "%s.dir/%s.o" % (ctx.label.name, src.basename[:-2])) _emit_go_asm_action(ctx, src, asm_hdrs, obj) extra_objects += [obj] lib_name = _go_importpath(ctx) + ".a" out_lib = ctx.new_file(lib_name) out_object = ctx.new_file(ctx.label.name + ".o") search_path = out_lib.path[:-len(lib_name)] gc_goopts = _gc_goopts(ctx) transitive_go_libraries = depset([out_lib]) transitive_go_library_paths = depset([search_path]) for dep in deps: transitive_go_libraries += dep.transitive_go_libraries transitive_cgo_deps += dep.transitive_cgo_deps transitive_go_library_paths += dep.transitive_go_library_paths go_srcs = _emit_go_compile_action(ctx, sources = go_srcs, deps = deps, libpaths = transitive_go_library_paths, out_object = out_object, gc_goopts = gc_goopts, ) _emit_go_pack_action(ctx, out_lib, [out_object] + extra_objects) dylibs = [] if cgo_object: dylibs += [d for d in cgo_object.cgo_deps if d.path.endswith(".so")] runfiles = ctx.runfiles(files = dylibs, collect_data = True) for d in dep_runfiles: runfiles = runfiles.merge(d) return struct( label = ctx.label, files = depset([out_lib]), runfiles = runfiles, go_sources = go_srcs, asm_sources = asm_srcs, asm_headers = asm_hdrs, cgo_object = cgo_object, direct_deps = ctx.attr.deps, transitive_cgo_deps = transitive_cgo_deps, transitive_go_libraries = transitive_go_libraries, transitive_go_library_paths = transitive_go_library_paths, gc_goopts = gc_goopts, ) def _c_linker_options(ctx, blacklist=[]): """Extracts flags to pass to $(CC) on link from the current context Args: ctx: the current context blacklist: Any flags starts with any of these prefixes are filtered out from the return value. Returns: A list of command line flags """ cpp = ctx.fragments.cpp features = ctx.features options = cpp.compiler_options(features) options += cpp.unfiltered_compiler_options(features) options += cpp.link_options options += cpp.mostly_static_link_options(ctx.features, False) filtered = [] for opt in options: if any([opt.startswith(prefix) for prefix in blacklist]): continue filtered.append(opt) return filtered def _gc_goopts(ctx): gc_goopts = [ctx.expand_make_variables("gc_goopts", f, {}) for f in ctx.attr.gc_goopts] if ctx.attr.library: gc_goopts += ctx.attr.library.gc_goopts return gc_goopts def _gc_linkopts(ctx): gc_linkopts = [ctx.expand_make_variables("gc_linkopts", f, {}) for f in ctx.attr.gc_linkopts] for k, v in ctx.attr.x_defs.items(): gc_linkopts += ["-X", "%s='%s'" % (k, v)] return gc_linkopts def _extract_extldflags(gc_linkopts, extldflags): """Extracts -extldflags from gc_linkopts and combines them into a single list. Args: gc_linkopts: a list of flags passed in through the gc_linkopts attributes. ctx.expand_make_variables should have already been applied. extldflags: a list of flags to be passed to the external linker. Return: A tuple containing the filtered gc_linkopts with external flags removed, and a combined list of external flags. """ filtered_gc_linkopts = [] is_extldflags = False for opt in gc_linkopts: if is_extldflags: is_extldflags = False extldflags += [opt] elif opt == "-extldflags": is_extldflags = True else: filtered_gc_linkopts += [opt] return filtered_gc_linkopts, extldflags def _emit_go_link_action(ctx, transitive_go_library_paths, transitive_go_libraries, cgo_deps, libs, executable, gc_linkopts): """Sets up a symlink tree to libraries to link together.""" config_strip = len(ctx.configuration.bin_dir.path) + 1 pkg_depth = executable.dirname[config_strip:].count('/') + 1 ld = "%s" % ctx.fragments.cpp.compiler_executable extldflags = _c_linker_options(ctx) + [ "-Wl,-rpath,$ORIGIN/" + ("../" * pkg_depth), ] for d in cgo_deps: if d.basename.endswith('.so'): short_dir = d.dirname[len(d.root.path):] extldflags += ["-Wl,-rpath,$ORIGIN/" + ("../" * pkg_depth) + short_dir] gc_linkopts, extldflags = _extract_extldflags(gc_linkopts, extldflags) link_cmd = [ ctx.file.go_tool.path, "tool", "link", "-L", "." ] for path in transitive_go_library_paths: link_cmd += ["-L", path] link_cmd += [ "-o", executable.path, ] + gc_linkopts + ['"${STAMP_XDEFS[@]}"'] # workaround for a bug in ld(1) on Mac OS X. # http://lists.apple.com/archives/Darwin-dev/2006/Sep/msg00084.html # TODO(yugui) Remove this workaround once rules_go stops supporting XCode 7.2 # or earlier. if not _is_darwin_cpu(ctx): link_cmd += ["-s"] link_cmd += [ "-extld", ld, "-extldflags", "'%s'" % " ".join(extldflags), ] + [lib.path for lib in libs] # Avoided -s on OSX but but it requires dsymutil to be on $PATH. # TODO(yugui) Remove this workaround once rules_go stops supporting XCode 7.2 # or earlier. cmds = ["export PATH=$PATH:/usr/bin"] cmds += [ "STAMP_XDEFS=()", ] stamp_inputs = [] if ctx.attr.linkstamp: # read workspace status files, converting "KEY value" lines # to "-X $linkstamp.KEY=value" arguments to the go linker. stamp_inputs = [ctx.info_file, ctx.version_file] for f in stamp_inputs: cmds += [ "while read -r key value || [[ -n $key ]]; do", " STAMP_XDEFS+=(-X \"%s.$key=$value\")" % ctx.attr.linkstamp, "done < " + f.path, ] cmds += [' '.join(link_cmd)] f = _emit_generate_params_action(cmds, ctx, lib.basename + ".GoLinkFile.params") ctx.action( inputs = [f] + (list(transitive_go_libraries) + [lib] + list(cgo_deps) + ctx.files.toolchain + ctx.files._crosstool) + stamp_inputs, outputs = [executable], command = f.path, mnemonic = "GoLink", env = go_environment_vars(ctx), ) def go_binary_impl(ctx): """go_binary_impl emits actions for compiling and linking a go executable.""" lib_result = go_library_impl(ctx) _emit_go_link_action( ctx, transitive_go_libraries=lib_result.transitive_go_libraries, transitive_go_library_paths=lib_result.transitive_go_library_paths, cgo_deps=lib_result.transitive_cgo_deps, libs=lib_result.files, executable=ctx.outputs.executable, gc_linkopts=_gc_linkopts(ctx)) return struct( files = depset([ctx.outputs.executable]), runfiles = lib_result.runfiles, cgo_object = lib_result.cgo_object, ) def go_test_impl(ctx): """go_test_impl implements go testing. It emits an action to run the test generator, and then compiles the test into a binary.""" lib_result = go_library_impl(ctx) main_go = ctx.new_file(ctx.label.name + "_main_test.go") main_object = ctx.new_file(ctx.label.name + "_main_test.o") main_lib = ctx.new_file(ctx.label.name + "_main_test.a") go_import = _go_importpath(ctx) cmds = [ 'UNFILTERED_TEST_FILES=(%s)' % ' '.join(["'%s'" % f.path for f in lib_result.go_sources]), 'FILTERED_TEST_FILES=()', 'while read -r line; do', ' if [ -n "$line" ]; then', ' FILTERED_TEST_FILES+=("$line")', ' fi', 'done < <(\'%s\' -cgo "${UNFILTERED_TEST_FILES[@]}")' % ctx.executable._filter_tags.path, ' '.join([ "'%s'" % ctx.executable.test_generator.path, '--package', go_import, '--output', "'%s'" % main_go.path, '"${FILTERED_TEST_FILES[@]}"', ]), ] f = _emit_generate_params_action( cmds, ctx, ctx.label.name + ".GoTestGenTest.params") inputs = (list(lib_result.go_sources) + list(ctx.files.toolchain) + [f, ctx.executable._filter_tags, ctx.executable.test_generator]) ctx.action( inputs = inputs, outputs = [main_go], command = f.path, mnemonic = "GoTestGenTest", env = dict(go_environment_vars(ctx), RUNDIR=ctx.label.package)) _emit_go_compile_action( ctx, sources=depset([main_go]), deps=ctx.attr.deps + [lib_result], libpaths=lib_result.transitive_go_library_paths, out_object=main_object, gc_goopts=_gc_goopts(ctx), ) _emit_go_pack_action(ctx, main_lib, [main_object]) _emit_go_link_action( ctx, transitive_go_library_paths=lib_result.transitive_go_library_paths, transitive_go_libraries=lib_result.transitive_go_libraries, cgo_deps=lib_result.transitive_cgo_deps, libs=[main_lib], executable=ctx.outputs.executable, gc_linkopts=_gc_linkopts(ctx)) # TODO(bazel-team): the Go tests should do a chdir to the directory # holding the data files, so open-source go tests continue to work # without code changes. runfiles = ctx.runfiles(files = [ctx.outputs.executable]) runfiles = runfiles.merge(lib_result.runfiles) return struct( files = depset([ctx.outputs.executable]), runfiles = runfiles, ) go_env_attrs = { "toolchain": attr.label( default = Label("//go/toolchain:toolchain"), allow_files = True, cfg = "host", ), "go_tool": attr.label( default = Label("//go/toolchain:go_tool"), single_file = True, allow_files = True, cfg = "host", ), "go_prefix": attr.label( providers = ["go_prefix"], default = Label( "//:go_prefix", relative_to_caller_repository = True, ), allow_files = False, cfg = "host", ), "go_src": attr.label( default = Label("//go/toolchain:go_src"), allow_files = True, cfg = "host", ), "go_include": attr.label( default = Label("//go/toolchain:go_include"), single_file = True, allow_files = True, cfg = "host", ), "go_root": attr.label( providers = ["go_root"], default = Label( "//go/toolchain:go_root", ), allow_files = False, cfg = "host", ), "_filter_tags": attr.label( default = Label("//go/tools/filter_tags"), cfg = "host", executable = True, single_file = True, ), "_filter_exec": attr.label( default = Label("//go/tools/filter_exec"), cfg = "host", executable = True, single_file = True, ), "_asm": attr.label( default = Label("//go/tools/builders:asm"), cfg = "host", executable = True, single_file = True, ), } go_library_attrs = go_env_attrs + { "data": attr.label_list( allow_files = True, cfg = "data", ), "srcs": attr.label_list(allow_files = go_filetype), "deps": attr.label_list( providers = [ "transitive_go_library_paths", "transitive_go_libraries", "transitive_cgo_deps", ], ), "importpath": attr.string(), "library": attr.label( providers = [ "direct_deps", "go_sources", "asm_sources", "cgo_object", "gc_goopts", ], ), "gc_goopts": attr.string_list(), } _crosstool_attrs = { "_crosstool": attr.label( default = Label("//tools/defaults:crosstool"), ), } go_link_attrs = go_library_attrs + _crosstool_attrs + { "gc_linkopts": attr.string_list(), "linkstamp": attr.string(), "x_defs": attr.string_dict(), } go_library = rule( go_library_impl, attrs = go_library_attrs + { "cgo_object": attr.label( providers = [ "cgo_obj", "cgo_deps", ], ), }, fragments = ["cpp"], ) go_binary = rule( go_binary_impl, attrs = go_library_attrs + _crosstool_attrs + go_link_attrs, executable = True, fragments = ["cpp"], ) go_test = rule( go_test_impl, attrs = go_library_attrs + _crosstool_attrs + go_link_attrs + { "test_generator": attr.label( executable = True, default = Label( "//go/tools:generate_test_main", ), cfg = "host", ), }, executable = True, fragments = ["cpp"], test = True, ) def _pkg_dir(workspace_root, package_name): if workspace_root and package_name: return workspace_root + "/" + package_name if workspace_root: return workspace_root if package_name: return package_name return "." def _exec_path(path): if path.startswith('/'): return path return '${execroot}/' + path def _cgo_filter_srcs_impl(ctx): srcs = ctx.files.srcs dsts = [] cmds = [] for src in srcs: stem, _, ext = src.path.rpartition('.') dst_basename = "%s.filtered.%s" % (stem, ext) dst = ctx.new_file(src, dst_basename) cmds += [ "if '%s' -cgo -quiet '%s'; then" % (ctx.executable._filter_tags.path, src.path), " cp '%s' '%s'" % (src.path, dst.path), "else", " echo -n >'%s'" % dst.path, "fi", ] dsts.append(dst) if ctx.label.package == "": script_name = ctx.label.name + ".CGoFilterSrcs.params" else: script_name = ctx.label.package + "/" + ctx.label.name + ".CGoFilterSrcs.params" f = _emit_generate_params_action(cmds, ctx, script_name) ctx.action( inputs = [f, ctx.executable._filter_tags] + srcs, outputs = dsts, command = f.path, mnemonic = "CgoFilterSrcs", ) return struct( files = depset(dsts), ) _cgo_filter_srcs = rule( implementation = _cgo_filter_srcs_impl, attrs = { "srcs": attr.label_list( allow_files = cgo_filetype, ), "_filter_tags": attr.label( default = Label("//go/tools/filter_tags"), cfg = "host", executable = True, single_file = True, ), }, fragments = ["cpp"], ) def _cgo_codegen_impl(ctx): go_srcs = ctx.files.srcs srcs = go_srcs + ctx.files.c_hdrs linkopts = ctx.attr.linkopts copts = ctx.fragments.cpp.c_options + ctx.attr.copts deps = depset([], order="topological") for d in ctx.attr.deps: srcs += list(d.cc.transitive_headers) deps += d.cc.libs copts += ['-D' + define for define in d.cc.defines] for inc in d.cc.include_directories: copts += ['-I', _exec_path(inc)] for hdr in ctx.files.c_hdrs: copts += ['-iquote', hdr.dirname] for inc in d.cc.quote_include_directories: copts += ['-iquote', _exec_path(inc)] for inc in d.cc.system_include_directories: copts += ['-isystem', _exec_path(inc)] for lib in d.cc.libs: if lib.basename.startswith('lib') and lib.basename.endswith('.so'): linkopts += ['-L', lib.dirname, '-l', lib.basename[3:-3]] else: linkopts += [lib.path] linkopts += d.cc.link_flags p = _pkg_dir(ctx.label.workspace_root, ctx.label.package) + "/" if p == "./": p = "" # workaround when cgo_library in repository root out_dir = (ctx.configuration.genfiles_dir.path + '/' + p + ctx.attr.outdir) cc = ctx.fragments.cpp.compiler_executable cmds = [ # We cannot use env for CC because $(CC) on OSX is relative # and '../' does not work fine due to symlinks. 'export CC=$(cd $(dirname {cc}); pwd)/$(basename {cc})'.format(cc=cc), 'export CXX=$CC', 'objdir="%s/gen"' % out_dir, 'execroot=$(pwd)', 'mkdir -p "$objdir"', 'unfiltered_go_files=(%s)' % ' '.join(["'%s'" % f.path for f in go_srcs]), 'filtered_go_files=()', 'for file in "${unfiltered_go_files[@]}"; do', ' stem=$(basename "$file" .go)', ' if %s -cgo -quiet "$file"; then' % ctx.executable._filter_tags.path, ' filtered_go_files+=("$file")', ' else', ' grep --max-count 1 "^package " "$file" >"$objdir/$stem.go"', ' echo -n >"$objdir/$stem.c"', ' fi', 'done', 'if [ ${#filtered_go_files[@]} -eq 0 ]; then', ' echo no buildable Go source files in %s >&1' % str(ctx.label), ' exit 1', 'fi', '"$GOROOT/bin/go" tool cgo -objdir "$objdir" -- %s "${filtered_go_files[@]}"' % ' '.join(['"%s"' % copt for copt in copts]), # Rename the outputs using glob so we don't have to understand cgo's mangling # TODO(#350): might be fixed by this?. 'for file in "${filtered_go_files[@]}"; do', ' stem=$(basename "$file" .go)', ' mv "$objdir/"*"$stem.cgo1.go" "$objdir/$stem.go"', ' mv "$objdir/"*"$stem.cgo2.c" "$objdir/$stem.c"', 'done', 'rm -f $objdir/_cgo_.o $objdir/_cgo_flags', ] f = _emit_generate_params_action(cmds, ctx, out_dir + ".CGoCodeGenFile.params") inputs = (srcs + ctx.files.toolchain + ctx.files._crosstool + [f, ctx.executable._filter_tags]) ctx.action( inputs = inputs, outputs = ctx.outputs.outs, mnemonic = "CGoCodeGen", progress_message = "CGoCodeGen %s" % ctx.label, command = f.path, env = go_environment_vars(ctx) + { "CGO_LDFLAGS": " ".join(linkopts), }, ) return struct( label = ctx.label, files = depset(ctx.outputs.outs), cgo_deps = deps, ) _cgo_codegen_rule = rule( _cgo_codegen_impl, attrs = go_env_attrs + _crosstool_attrs + { "srcs": attr.label_list( allow_files = go_filetype, non_empty = True, ), "c_hdrs": attr.label_list( allow_files = cc_hdr_filetype, ), "deps": attr.label_list( allow_files = False, providers = ["cc"], ), "copts": attr.string_list(), "linkopts": attr.string_list(), "outdir": attr.string(mandatory = True), "outs": attr.output_list( mandatory = True, non_empty = True, ), }, fragments = ["cpp"], output_to_genfiles = True, ) def _cgo_codegen(name, srcs, c_hdrs=[], deps=[], copts=[], linkopts=[], go_tool=None, toolchain=None): """Generates glue codes for interop between C and Go Args: name: A unique name of the rule srcs: list of Go source files. Each of them must contain `import "C"`. c_hdrs: C/C++ header files necessary to determine kinds of C/C++ identifiers in srcs. deps: A list of cc_library rules. The generated codes are expected to be linked with these deps. linkopts: A list of linker options, These flags are passed to the linker when the generated codes are linked into the target binary. """ outdir = name + ".dir" outgen = outdir + "/gen" go_thunks = [] c_thunks = [] for s in srcs: if not s.endswith('.go'): fail("not a .go file: %s" % s) basename = s[:-3] if basename.rfind("/") >= 0: basename = basename[basename.rfind("/")+1:] go_thunks.append(outgen + "/" + basename + ".go") c_thunks.append(outgen + "/" + basename + ".c") outs = struct( name = name, outdir = outgen, go_thunks = go_thunks, c_thunks = c_thunks, c_exports = [ outgen + "/_cgo_export.c", outgen + "/_cgo_export.h", ], c_dummy = outgen + "/_cgo_main.c", gotypes = outgen + "/_cgo_gotypes.go", ) _cgo_codegen_rule( name = name, srcs = srcs, c_hdrs = c_hdrs, deps = deps, copts = copts, linkopts = linkopts, go_tool = go_tool, toolchain = toolchain, outdir = outdir, outs = outs.go_thunks + outs.c_thunks + outs.c_exports + [ outs.c_dummy, outs.gotypes, ], visibility = ["//visibility:private"], ) return outs def _cgo_import_impl(ctx): cmds = [ (ctx.file.go_tool.path + " tool cgo" + " -dynout " + ctx.outputs.out.path + " -dynimport " + ctx.file.cgo_o.path + " -dynpackage $(%s %s)" % (ctx.executable._extract_package.path, ctx.file.sample_go_src.path)), ] f = _emit_generate_params_action(cmds, ctx, ctx.outputs.out.path + ".CGoImportGenFile.params") ctx.action( inputs = (ctx.files.toolchain + [f, ctx.file.go_tool, ctx.executable._extract_package, ctx.file.cgo_o, ctx.file.sample_go_src]), outputs = [ctx.outputs.out], command = f.path, mnemonic = "CGoImportGen", env = go_environment_vars(ctx), ) return struct( files = depset([ctx.outputs.out]), ) _cgo_import = rule( _cgo_import_impl, attrs = go_env_attrs + { "cgo_o": attr.label( allow_files = True, single_file = True, ), "sample_go_src": attr.label( allow_files = True, single_file = True, ), "out": attr.output( mandatory = True, ), "_extract_package": attr.label( default = Label("//go/tools/extract_package"), executable = True, cfg = "host", ), }, fragments = ["cpp"], ) def _cgo_genrule_impl(ctx): return struct( label = ctx.label, go_sources = ctx.files.srcs, asm_sources = [], asm_headers = [], cgo_object = ctx.attr.cgo_object, direct_deps = ctx.attr.deps, gc_goopts = [], ) _cgo_genrule = rule( _cgo_genrule_impl, attrs = { "srcs": attr.label_list(allow_files = FileType([".go"])), "cgo_object": attr.label( providers = [ "cgo_obj", "cgo_deps", ], ), "deps": attr.label_list( providers = [ "direct_deps", "transitive_go_library_paths", "transitive_go_libraries", "transitive_cgo_deps", ], ), }, fragments = ["cpp"], ) """Generates symbol-import directives for cgo Args: cgo_o: The loadable object to extract dynamic symbols from. sample_go_src: A go source which is compiled together with the generated file. The generated file will have the same Go package name as this file. out: Destination of the generated codes. """ def _cgo_object_impl(ctx): arguments = _c_linker_options(ctx, blacklist=[ # never link any dependency libraries "-l", "-L", # manage flags to ld(1) by ourselves "-Wl,"]) arguments += [ "-o", ctx.outputs.out.path, "-nostdlib", "-Wl,-r", ] if _is_darwin_cpu(ctx): arguments += ["-shared", "-Wl,-all_load"] else: arguments += ["-Wl,-whole-archive"] lo = ctx.files.src[-1] arguments += [lo.path] ctx.action( inputs = [lo] + ctx.files._crosstool, outputs = [ctx.outputs.out], mnemonic = "CGoObject", progress_message = "Linking %s" % ctx.outputs.out.short_path, executable = ctx.fragments.cpp.compiler_executable, arguments = arguments, ) runfiles = ctx.runfiles(collect_data = True) runfiles = runfiles.merge(ctx.attr.src.data_runfiles) return struct( files = depset([ctx.outputs.out]), cgo_obj = ctx.outputs.out, cgo_deps = ctx.attr.cgogen.cgo_deps, runfiles = runfiles, ) _cgo_object = rule( _cgo_object_impl, attrs = _crosstool_attrs + { "src": attr.label( mandatory = True, providers = ["cc"], ), "cgogen": attr.label( mandatory = True, providers = ["cgo_deps"], ), "out": attr.output( mandatory = True, ), }, fragments = ["cpp"], ) """Generates _all.o to be archived together with Go objects. Args: src: source static library which contains objects cgogen: _cgo_codegen rule which knows the dependency cc_library() rules to be linked together with src when we generate the final go binary. """ def _setup_cgo_library(name, srcs, cdeps, copts, clinkopts, go_tool, toolchain): go_srcs = [s for s in srcs if s.endswith('.go')] c_hdrs = [s for s in srcs if any([s.endswith(ext) for ext in hdr_exts])] c_srcs = [s for s in srcs if not s in (go_srcs + c_hdrs)] # Split cgo files into .go parts and .c parts (plus some other files). cgogen = _cgo_codegen( name = name + ".cgo", srcs = go_srcs, c_hdrs = c_hdrs, deps = cdeps, copts = copts, linkopts = clinkopts, go_tool = go_tool, toolchain = toolchain, ) # Filter c_srcs with build constraints. c_filtered_srcs = [] if len(c_srcs) > 0: c_filtered_srcs_name = name + "_filter_cgo_srcs" _cgo_filter_srcs( name = c_filtered_srcs_name, srcs = c_srcs, ) c_filtered_srcs.append(":" + c_filtered_srcs_name) pkg_dir = _pkg_dir( "external/" + REPOSITORY_NAME[1:] if len(REPOSITORY_NAME) > 1 else "", PACKAGE_NAME) # Platform-specific settings native.config_setting( name = name + "_windows_setting", values = { "cpu": "x64_windows_msvc", }, ) platform_copts = select({ ":" + name + "_windows_setting": ["-mthreads"], "//conditions:default": ["-pthread"], }) platform_linkopts = select({ ":" + name + "_windows_setting": ["-mthreads"], "//conditions:default": ["-pthread"], }) # Bundles objects into an archive so that _cgo_.o and _all.o can share them. native.cc_library( name = cgogen.outdir + "/_cgo_lib", srcs = cgogen.c_thunks + cgogen.c_exports + c_filtered_srcs + c_hdrs, deps = cdeps, copts = copts + platform_copts + [ "-I", pkg_dir, "-I", "$(GENDIR)/" + pkg_dir + "/" + cgogen.outdir, # The generated thunks often contain unused variables. "-Wno-unused-variable", ], linkopts = clinkopts + platform_linkopts, linkstatic = 1, # _cgo_.o and _all.o keep all objects in this archive. # But it should not be very annoying in the final binary target # because _cgo_object rule does not propagate alwayslink=1 alwayslink = 1, visibility = ["//visibility:private"], ) # Loadable object which cgo reads when it generates _cgo_import.go native.cc_binary( name = cgogen.outdir + "/_cgo_.o", srcs = [cgogen.c_dummy], deps = cdeps + [cgogen.outdir + "/_cgo_lib"], copts = copts, linkopts = clinkopts, visibility = ["//visibility:private"], ) _cgo_import( name = "%s.cgo.importgen" % name, cgo_o = cgogen.outdir + "/_cgo_.o", out = cgogen.outdir + "/_cgo_import.go", sample_go_src = go_srcs[0], go_tool = go_tool, toolchain = toolchain, visibility = ["//visibility:private"], ) _cgo_object( name = cgogen.outdir + "/_cgo_object", src = cgogen.outdir + "/_cgo_lib", out = cgogen.outdir + "/_all.o", cgogen = cgogen.name, visibility = ["//visibility:private"], ) return cgogen def cgo_genrule(name, srcs, copts=[], clinkopts=[], cdeps=[], **kwargs): cgogen = _setup_cgo_library( name = name, srcs = srcs, cdeps = cdeps, copts = copts, clinkopts = clinkopts, toolchain = None, go_tool = None, ) _cgo_genrule( name = name, srcs = cgogen.go_thunks + [ cgogen.gotypes, cgogen.outdir + "/_cgo_import.go", ], cgo_object = cgogen.outdir + "/_cgo_object", **kwargs ) def cgo_library(name, srcs, toolchain=None, go_tool=None, copts=[], clinkopts=[], cdeps=[], **kwargs): """Builds a cgo-enabled go library. Args: name: A unique name for this rule. srcs: List of Go, C and C++ files that are processed to build a Go library. Those Go files must contain `import "C"`. C and C++ files can be anything allowed in `srcs` attribute of `cc_library`. copts: Add these flags to the C++ compiler. clinkopts: Add these flags to the C++ linker. cdeps: List of C/C++ libraries to be linked into the binary target. They must be `cc_library` rules. deps: List of other libraries to be linked to this library target. data: List of files needed by this rule at runtime. NOTE: `srcs` cannot contain pure-Go files, which do not have `import "C"`. So you need to define another `go_library` when you build a go package with both cgo-enabled and pure-Go sources. ``` cgo_library( name = "cgo_enabled", srcs = ["cgo-enabled.go", "foo.cc", "bar.S", "baz.a"], ) go_library( name = "go_default_library", srcs = ["pure-go.go"], library = ":cgo_enabled", ) ``` """ cgogen = _setup_cgo_library( name = name, srcs = srcs, cdeps = cdeps, copts = copts, clinkopts = clinkopts, go_tool = go_tool, toolchain = toolchain, ) go_library( name = name, srcs = cgogen.go_thunks + [ cgogen.gotypes, cgogen.outdir + "/_cgo_import.go", ], cgo_object = cgogen.outdir + "/_cgo_object", go_tool = go_tool, toolchain = toolchain, **kwargs )

2024-01-17T01:26:28.774034

https://example.com/article/8431

Cationic polyacrylamide Sewage treatment generally divided into production sewage and living sewage treatment, because of the source of the sewage, chemical composition, the impurities form is varied, the use of flocculation dosage forms, the difference is bigger, we can based on customer’s wastewater, provide product suitable for the model through the experiment.

2024-02-23T01:26:28.774034

https://example.com/article/8224

Q: How to overlap navigator.notification.prompt on top of camera in cordova My app has a barcode scanner.. I am using this plugin to be exact. I need a prompt pop up to appear on top of the scanner when a barcode is scanned. similar to the downloadable version of manatee in googleplay. I'm going to ask the user to enter a quantity. I already commented out finish(); in scannerActivity.java 's handleDecode function so the scanner doesn't close when it has scanned something then I tried navigator.notification.alert(result.code, function(){}, result.type, 'Close'); and alert('normal alert'); and navigator.notification.prompt( 'notification prompt', // message onPrompt, // callback to invoke 'Registration', // title ['Ok','Exit'], // buttonLabels 'Jane Doe' // defaultText ); and navigator.notification.confirm( ' notifcation confirm', // message onConfirm, // callback to invoke with index of button pressed 'Game Over', // title ['Restart','Exit'] // buttonLabels ); They all work but they don't pop up on top of the scanner. I only see them when i exit the scanner. A: I contacted the creator of the Barcode Scanner we used which is Manatee. They said there is no way of doing this with javascript and you'd have to code this Natively. Their Demo had a pop up because it was coded natively.

2023-08-07T01:26:28.774034

https://example.com/article/1380

The Jihad Caucus hosted a Ramadan event at the Capitol, for a number of high level Democrats. The Democrats continue to spit in the face of their Jewish voters, by regularly appeasing Rashida Tlaib and Ilhan Omar despite their open anti-Semitism. No mention was made of the hundreds of victims of Ramadan slaughter. Crimes, deaths, and attacks during Ramadan 2019 – updated daily Muslim Lawmakers Host Ramadan Feast At Capitol, The National, Hannah Allam, May 21, 2019: As Democratic Rep. Ilhan Omar of Minnesota was wrapping up her remarks to the crowd at a Ramadan gathering on Capitol Hill late Monday, she spotted a familiar face in the front row. It was Khizr Khan, the Gold Star father who was famously mocked by then-candidate Donald Trump during the 2016 race. Omar told the audience she remembered how Trump had belittled Khan’s wife by saying he wasn’t sure if Muslim women were allowed to speak. “Little did they know they were going to get the two loudest Muslim women in the country in Congress!” Omar said, drawing cheers from the largely Muslim audience. Omar and Michigan Democratic Rep. Rashida Tlaib, the first two Muslim women elected to Congress, certainly are known for their words. Exuberant outbursts, tone-deaf tweets, ahistorical musings, slips of the tongue – whatever the intention, virtually anything they say becomes fodder for right-wing media outlets that depict them as dangerously anti-American. In the relentless noise surrounding Tlaib and Omar, the gathering Monday night stood out for the quiet.

2024-01-26T01:26:28.774034

https://example.com/article/6572

--- abstract: 'Binary AIFV codes are lossless codes that generalize the class of instantaneous FV codes. The code uses two code trees and assigns source symbols to incomplete internal nodes as well as to leaves. AIFV codes are empirically shown to attain better compression ratio than Huffman codes. Nevertheless, an upper bound on the redundancy of optimal binary AIFV codes is only known to be 1, which is the same as the bound of Huffman codes. In this paper, the upper bound is improved to 1/2, which is shown to coincide with the worst-case redundancy of the codes. Along with this, the worst-case redundancy is derived in terms of $p_{\max}\geq$1/2, where $p_{\max}$ is the probability of the most likely source symbol. Additionally, we propose an extension of binary AIFV codes, which use $m$ code trees and allow at most $m$-bit decoding delay. We show that the worst-case redundancy of the extended binary AIFV codes is $1/m$ for $m \leq 4.$' author: - 'Weihua Hu, Hirosuke Yamamoto,  and Junya Honda, [^1] [^2]' bibliography: - 'reference.bib' title: | Worst-case Redundancy of Optimal\ Binary AIFV Codes and their Extended Codes --- AIFV code, Huffman code, sibling property, redundancy, alphabet extension Introduction ============ Fixed-to-Variable length (FV) codes map source symbols to variable length codewords, and can be represented by code trees. In the case of a binary instantaneous FV code, source symbols are assigned to leaves of the binary tree. The codeword for each source symbol is then given by the path from the root to the corresponding leaf. It is well known by Kraft and McMillan theorems [@kraft49][@mcmillan56] that the codeword lengths of any uniquely decodable FV code must satisfy Kraft’s inequality, and such codeword lengths can be realized by an instantaneous FV code. Hence, the Huffman code [@huffman52], which can attain the best compression ratio in the class of instantaneous FV codes, is also the optimal code in the class of uniquely decodable FV codes. However, it was implicitly assumed in [@mcmillan56] that a single code tree is used for a uniquely decodable FV code. Hence, if we use multiple code trees for a uniquely decodable FV code, it may be possible to attain better compression ratio than Huffman codes. Recently, Almost Instantaneous Fixed-to-Variable length (AIFV) codes were proposed as a new class of uniquely decodable codes that generalize the class of instantaneous FV codes [@yamamoto13][@yamamoto15]. Unlike an instantaneous FV code, which uses only one code tree, an AIFV code is allowed to use multiple code trees. Furthermore, source symbols on the AIFV code trees are assigned to incomplete internal nodes as well as to leaves. In the case of a binary AIFV code [@yamamoto15], two code trees are used in such a way that decoding delay is at most two bits, which is why the code is called [*almost*]{} instantaneous. Binary AIFV codes are empirically shown to be powerful in data compression. Not only do the codes attain better compression ratio than Huffman codes, experiments suggest that for some sources, AIFV codes can even beat Huffman codes constructed for ${\cal X}^2$, where ${\cal X}$ is the source alphabet [@yamamoto15]. Nonetheless, few theoretical results are known about the codes. In particular, an upper bound on the redundancy (the expected code length minus entropy) of binary AIFV codes is only known to be 1, a trivial bound derived from the fact that binary AIFV codes include Huffman codes. Also, it is conjectured in [@yamamoto15] that binary AIFV codes might be able to attain a better compression performance, when more code trees are allowed to be used. The main contribution of this paper is two-fold. First, we present a non-trivial theoretical result on the redundancy of optimal binary AIFV codes, suggesting superiority of the codes over Huffman codes. In particular, we show that the worst-case redundancy of optimal binary AIFV codes is $\frac{1}{2}$, which is the same as that of Huffman codes for $\mathcal{X}^2$. Note that for $K=|{\cal X}|$, the size of memory required to store code trees is ${\cal O}(K)$ for a binary AIFV code, while ${\cal O}(K^2)$ for a Huffman code for ${\cal X}^2$ [@yamamoto15]. We also derive the worst-case redundancy of optimal binary AIFV codes in terms of $p_{\max} \geq \frac{1}{2}$, where $p_{\max}$ is the probability of the most likely source symbol. We compare this with its Huffman counterpart [@gallager78] and Second, we extend the original binary AIFV codes by allowing the code to use more code trees. We show that the extended code with $m$ code trees has at most $m$-bit decoding delay and the worst-case redundancy of the optimal codes is $\frac{1}{m}$ for $m \leq 4.$ Note that the worst-case redundancy of Huffman codes for $\mathcal{X}^m$ per source symbol is also $\frac{1}{m}$. However, the size of a Huffman code tree for $\mathcal{X}^m$ scales exponentially with $m$, while the size of extended AIFV code trees scales only linearly with $m$. Our conjecture is that when the size of alphabet is large enough with respect to $m$, the worst-case redundancy of extended AIFV codes is also $\frac{1}{m}$ for $m \geq 5.$ The rest of the paper is organized as follows. In Section \[preliminaries\], we introduce binary AIFV codes with two code trees [@yamamoto15] and some properties of Huffman codes. We extend the binary AIFV codes in Section \[extension\] so that the codes use more than two code trees. In Section \[redundancy\], we give several theorems, of optimal binary AIFV codes for both the original and extended cases. All the theorems in Sections \[redundancy\] are proved in Section \[proofs\]. Section \[conclusion\] concludes the paper. Preliminaries ============= Binary AIFV codes {#binary_aifv} ----------------- In this section, we introduce the definition of a binary AIFV code proposed in [@yamamoto15]. A binary AIFV code uses two binary code trees, denoted by $T_0$ and $T_1$, in such a way that the code is uniquely decodable and the decoding delay is at most two bits. 1. Incomplete internal nodes (nodes with one child) are divided into two categories, master nodes and slave nodes. \[property-1\] 2. Source symbols are assigned to either master nodes or leaves. \[property-3\] 3. The child of a master node must be a slave node, and the master node is connected to its grandchild by code symbols ‘00’. \[property-2\] 4. The root of $T_1$ has two children. The child connected by ‘0’ from the root is a slave node. The slave node is connected by ‘1’ to its child. \[property-4\] We see from properties \[property-1\]) and \[property-3\]) that a binary AIFV code allows source symbols to be assigned to incomplete internal nodes called master nodes. Fig. \[fig:aifv\_example\_no\_root\] illustrates an example of a binary AIFV code for $\mathcal{X} = \{ a,b,c,d\}$, where slave nodes are marked with squares. It is easy to see that the trees satisfy all the properties of a binary AIFV code. ![An example of binary AIFV code trees.[]{data-label="fig:aifv_example_no_root"}](aifv2_no_root.eps){width="6.0cm"} Given a source sequence $x_1 x_2 x_3 \cdots$, an encoding procedure of a binary AIFV code goes as follows. \[enc\_2aifv\]  1. Use $T_0$ to encode the initial source symbol $x_1$. 2. When $x_i$ is encoded by a leaf (resp. a master node), then use $T_0$ (resp. $T_1$) to encode the next symbol $x_{i+1}$. \[enc-2\] Using a binary AIFV code of Fig. \[fig:aifv\_example\_no\_root\], a source sequence ‘$acdbaca$’ is encoded to ‘0.11.1100.10.0.11.01’, where dots ‘.’ are inserted for the sake of human readability, but they are not necessary in the actual codeword sequences. The code trees are visited in the order of $T_0 \rightarrow T_0 \rightarrow T_1 \rightarrow T_0 \rightarrow T_0 \rightarrow T_0 \rightarrow T_1$. A codeword sequence $y_1 y_2 y_3 \cdots \in \{0,1\}^*$ is decoded as follows. \[dec\_2aifv\]  1. Use $T_0$ to decode the initial source symbol $x_1$. 2. Trace the codeword sequence as long as possible from the root in the current code tree. Then, output the source symbol assigned to the reached master node or leaf. 3. If the reached node is a leaf (resp. a master node), then use $T_0$ (resp. $T_1$) to decode the next source symbol from the current position on the codeword sequence. The decoding procedure is guaranteed to visit the code trees in the same order as the corresponding encoding process does [@yamamoto15]. The codeword sequence ‘01111001001101’ is indeed decoded to the original source sequence ‘$acdbaca$’, using a sequence of trees in the order of $T_0 \rightarrow T_0 \rightarrow T_1 \rightarrow T_0 \rightarrow T_0 \rightarrow T_0 \rightarrow T_1$. When all source symbols are assigned to leaves of $T_0$, a binary AIFV code reduces to an instantaneous FV code. The following defines the average code length of a binary AIFV code, denoted by $L_{\rm AIFV}$. $$\begin{aligned} \label{ave_len} L_{\rm AIFV} = P(T_0)L_{T_0} + P(T_1)L_{T_1},\end{aligned}$$ where $P(T_0)$ (resp. $P(T_1)$) is a stationary probability of $T_0$ (resp. $T_1$), and $L_{T_0}$ (resp. $L_{T_1}$) is the average code length of $T_0$ (resp. $T_1$). Consider for instance, a source $\mathcal{X} = \{a, b,c, d \}$ with probabilities $P(a) = 0.45,\ P(b) = 0.3,\ P(c) = 0.2,\ P(d) = 0.05$. Fig. \[fig:aifv\_example\_no\_root\] depicts an example of binary AIFV code trees for this source. It follows from the encoding procedure \[enc\_2aifv\] that the transition probabilities $P(T_1|T_0)$ and $P(T_0|T_1)$ are given by $0.2$ and $0.8$, respectively. Therefore, the stationary probabilities $P(T_0)$ and $P(T_1)$ are calculated as 0.8 and 0.2, respectively. Thus, we get $L_{{\rm AIFV}} = 1.65 \cdot 0.8 + 2.1 \cdot 0.2 = 1.74$. On the other hand, it is easy to see that the average code length of the corresponding Huffman code is 1.8. In this example, we see that the binary AIFV code outperforms the Huffman code in terms of compression ratio. ![An example of binary AIFV code trees with an source symbol assigned to the root.[]{data-label="fig:aifv_example"}](aifv_example.eps){width="5.0cm"} It is worth noting that the root of $T_0$ is allowed to be a master node, to which a source symbol is assigned. Fig. \[fig:aifv\_example\] illustrates an example of a binary AIFV code for $\mathcal{X} = \{ a,b,c\}$, where $a$ is assigned to the root of $T_0$. The code trees again satisfy all the properties of a binary AIFV code. Using the binary AIFV code of Fig. \[fig:aifv\_example\], a source sequence ‘$aabac$’ is encoded to ‘$\lambda$.1.000.$\lambda$.011’, where $\lambda$ is the null codeword corresponding to the root of $T_0.$ The code trees are visited in the order of $T_0 \rightarrow T_1 \rightarrow T_0 \rightarrow T_0 \rightarrow T_1$. It is easy to confirm that the codeword sequence ‘1000011’ is decoded to the original source sequence and decoding procedure visits the code trees in the same order as the encoding procedure does. Note that since the first codeword ‘1’ on the code sequence cannot be traced on $T_0$ of Fig. \[fig:aifv\_example\], we output ‘$a$’, which is assigned to the root of $T_0$. Lastly, we define the redundancy of optimal binary AIFV codes. Let $L_{{\rm OPT}}$ be the average code length of the optimal binary AIFV code for a given source. Then the redundancy of optimal binary AIFV codes denoted by $r_{{\rm AIFV}}$ is defined as $$\begin{aligned} \label{def:aifv_redundancy} r_{\rm AIFV} \equiv L_{\rm OPT} - H(X),\end{aligned}$$ where $X$ is a random variable corresponding to the source and $H(X)$ is the source entropy. It is shown in [@yamamoto15] how we can obtain the optimal binary AIFV code trees for a given source. Sibling property of Huffman codes {#sib-sec} --------------------------------- Sibling property was first introduced in $\cite{gallager78}$ as a structural characterization of Huffman codes. Consider a $K$-ary source and let $T_{\rm H}$ denote the corresponding Huffman tree. Let the weight of a leaf be the probability of corresponding source symbol. Also, let the weight of an internal node be defined recursively as the sum of the weights of the children. There are $2K-2$ nodes (except the root) on $T_{\rm H}$. Let $q_1, q_2, \dots, q_{2K-2}$ be the weights of the nodes sorted in a non-increasing order, so that $q_1 \geq q_2 \geq \cdots \geq q_{2K-2}$. By a slight abuse of notation, we identify $q_k$ with the corresponding node itself in the rest of the paper. We state the sibling property of Huffman codes, which will play an important role in the later proofs of the redundancy of optimal binary AIFV codes. \[sibling\_def\] A binary code tree has the sibling property if there exists a sequence of nodes $q_1, q_2, \dots, q_{2K-2}$, such that for every $k \in \{1, \dots, K-1 \}$, $q_{2k}$ and $q_{2k-1}$ are sibling on the tree. \[sib\] A binary instantaneous code is a Huffman code iff the code tree has the sibling property. Redundancy upper bounds of Huffman codes ---------------------------------------- It is well-known that the worst-case redundancy of Huffman codes is 1. Meanwhile, numerous studies have shown that better bounds on the redundancy can be obtained when a source satisfies some predefined conditions. One such condition concerns with the value of $p_{\max}$ [@gallager78]–[@johnsen80], where $p_{\max}$ is the probability of the most likely source symbol. The following is proved by Gallager [@gallager78]. \[huffman\_bound\] In Fig. $\ref{fig:huffman_upper}$, we summarize the upper bound results for Huffman codes in terms of $p_{\max}$ [@ye02]. We see from Fig. \[fig:huffman\_upper\] that ![The redundancy upper bounds of Huffman codes in terms of $p_{\max}$.[]{data-label="fig:huffman_upper"}](huffman_detail_bound.eps){width="8cm"} An extension of binary AIFV codes {#extension} ================================= The original binary AIFV code [@yamamoto15] in Section \[binary\_aifv\] uses two code trees. In this section, we extend the class of the codes to allow the use of more than two code trees. Definition of an extended binary AIFV codes {#extension2} ------------------------------------------- We start with redefining a ‘slave node’ and a ‘master node’ that were defined in Section \[binary\_aifv\]. \[slave\_node\] A slave node is an incomplete internal node to which no source symbol is assigned. There are two kinds of slave nodes: 1. A slave-1 node is a slave node which connects to its child by ‘1.’ 2. A slave-0 node is a slave node which connects to its child by ‘0’. In the later figures, slave nodes are marked by square nodes. To distinguish two kinds of slave nodes, a slave-1 (resp. slave-0) node is marked by a white (resp. black) square node. \[master\_k\] A master node is defined as a node to which a source symbol is assigned. There are different degrees of master nodes. For $k \geq 1$, a master node of degree $k$ is an incomplete internal node satisfying the following two conditions: 1) $k$ consecutive descendant nodes are slave-0 nodes and 2) the $(k+1)$th descendant is not a slave-0 node. For simplicity, we treat leaves as master nodes of degree 0. In contrast to the previous definition of master nodes provided in Section \[binary\_aifv\], we note that the new definition of master nodes includes leaves. Fig. \[fig:master\_k\] illustrates a master node of degree $k\geq1$. The master node in Section \[binary\_aifv\] corresponds to a master node of degree 1 in Definition \[master\_k\]. ![An illustration of []{data-label="fig:master_k"}](master_k.eps){width="11cm"} Let $m$ be a natural number. As an extension of the original binary AIFV code, we define a [*binary AIFV-$m$ code*]{}, which uses $m$ code trees and decoding delay is at most $m$ bits. The code trees $T_0,\ T_1,\ \dots, T_{m-1}$ of a binary AIFV-$m$ code are defined by the following properties. 1. Any node in the code trees is either a slave node, a master node, or a complete internal node. Conforming to Definitions \[slave\_node\] and \[master\_k\], source symbols are only assigned to master nodes. 2. The degree $k$ of master nodes must satisfy $0 \leq k \leq m-1.$ It follows from property 3) and Definition 3 that the root of $T_0$ can be a master node in the same way as the original AIFV codes. Furthermore, the root of $T_i$, $i\geq2$, can also be a master node but its degree should be less than or equal to $i-1$. , when an encoding procedure starts from the root of $T_i,~ 1 \leq i \leq m-1$, the code sequence does [*not*]{} start with $\underbrace{00\cdots 0}_{i+1}$. This fact, together with Definition \[master\_k\], will play a key role in proving unique decodability of binary AIFV codes. We proceed to explain encoding and decoding procedures of the binary AIFV-$m$ codes. Given a source sequence $x_1 x_2 x_3 \cdots$, the encoding procedure is described as follows.   1. Use $T_0$ to encode the initial source symbol $x_1$. 2. When $x_i$ is encoded by a master node of degree $k$, then use $T_k$ to encode the next symbol $x_{i+1}$. A codeword sequence $y_1y_2y_3 \cdots \in \{0,1\}^*$ is decoded as follows.   1. Use $T_0$ to decode the initial source symbol $x_1$. 2. Trace the codeword sequence as long as possible from the root in the current code tree. Then, output the source symbol assigned to the reached master node. 3. If the reached node is a master node of degree $k$, then use $T_k$ to decode the next source symbol from the current position on the codeword sequence. In this procedure, the source symbol at a master node of degree $k\geq1$ is decoded after reading subsequent $k+1$ code symbols. Thus, the decoding delay of binary AIFV-$m$ codes is at most $m$ bits. In the following, we show two examples of binary AIFV-$m$ codes to demonstrate how the codes work. \[example1\] Fig. \[fig:3tree\] illustrates code trees of a binary AIFV-3 code for $\mathcal{X} = \{ a,b,c, d\}$. We see that $T_0$ has the master node of degree 1, while $T_1$ has the master node of degree 2. ![An example of the binary AIFV-3 code trees.[]{data-label="fig:3tree"}](aifv3_example1.eps){width="8cm"} Using the binary AIFV code of Fig. \[fig:3tree\], a source sequence ‘acdccbba’ is encoded to ‘0.11.11000.11.11.01.10.0’. The code trees are visited in the order of $T_0 \rightarrow T_0 \rightarrow T_1 \rightarrow T_0 \rightarrow T_1 \rightarrow T_2 \rightarrow T_0 \rightarrow T_0$. Conversely, it is easy to see that the codeword sequence ‘01111000111101100’ can be decoded to the original source sequence. The root of $T_i,\ i \neq 1$, can also be a master node. Example \[example2\] shows this case. \[example2\] Fig. \[fig:3tree2\] illustrates a binary AIFV-3 code for $\mathcal{X} = \{ a,b,c\}$, where the roots of $T_0$ and $T_2$ are master nodes of degree 2 and 1, respectively. For instance, a source sequence ‘$aaabac$’ is encoded to ‘$\lambda . \lambda .1.0000.\lambda.0011$’, that is, ‘100000011’. The code trees are used in the order of $T_0 \rightarrow T_2 \rightarrow T_1 \rightarrow T_0 \rightarrow T_0 \rightarrow T_2$. Conversely, the codeword sequence ‘100000011’ is decoded to the original source sequence. ![An example of binary AIFV-3 code trees whose roots are master nodes.[]{data-label="fig:3tree2"}](aifv3_example2.eps){width="7cm"} We show a lemma, which is crucial to prove the unique decodability of binary AIFV-$m$ codes in Theorem \[unique-thm\]. \[lem:consec\] When the encoding procedure starts from the root of $T_i,~ 1 \leq i \leq m-1$, the code sequence does [*not*]{} start with $\underbrace{00\cdots 0}_{i+1}$. We prove by induction that for all $2 \leq \ell \leq m$, when the encoding procedure starts from the root of $T_i,~ 1 \leq i \leq \ell - 1$, the code sequence does not start with $\underbrace{00\cdots 0}_{i+1}$. The base case $(\ell = 2)$ holds since the root of $T_1$ cannot be a master node and any codewords of $T_1$ do not have prefix ‘00’. Suppose that the induction hypothesis holds for some $\ell$ such that $2 \leq \ell \leq m-1$. Our goal is to show that the induction hypothesis also holds for $\ell + 1$. To this end, it is sufficient to show that when the encoding procedure starts from the root of $T_{\ell}$, the code sequence does not start with $\underbrace{00\cdots 0}_{\ell+1}$. We consider the following two cases. 1. The first symbol in the source sequence is not assigned to a node connected by a sequence of 0’s from the root of $T_{\ell}$. 2. The first symbol in the source sequence is assigned to a master node (which we denote as $M$) connected by $\underbrace{00\cdots0}_{j}$, $0\leq j\leq \ell-2$, from the root of $T_{\ell}$. To begin with, consider the first case. It follows from property 3) of binary AIFV-$m$ code trees that any codewords of $T_{\ell}$ do not have prefix $\underbrace{00\cdots0}_{\ell+1}$. Hence, the encoding procedure would not output a codeword sequence that starts with $\underbrace{00\cdots0}_{\ell+1}$. We then consider the second case. It follows from Definition \[master\_k\] that the degree of $M$ (which we denote as $k$) must satisfy $1\leq k \leq \ell-j-1$. When the source symbol assigned to $M$ in $T_{\ell}$ is encoded, the encoding procedure would output codeword $\underbrace{00\cdots0}_{j}$ and then use $T_k$ for the next code tree. By the induction hypothesis, when the encoding procedure starts from the root of $T_k$, the codeword sequence does not start with $\underbrace{00\cdots0}_{k+1}$. Therefore, the concatenated codeword sequence does not start with $\underbrace{00\cdots0}_{j}\underbrace{00\cdots0}_{k+1}$, which implies that the sequence does not start with $\underbrace{00\cdots0}_{\ell}$. In both cases, when the encoding procedure starts from the root of $T_{\ell}$, the code sequence does not start with $\underbrace{00\cdots 0}_{\ell+1}$. \[unique-thm\] Binary AIFV-$m$ codes are uniquely decodable. Let $x_1 x_2 x_3 \cdots$ be a source sequence and let $x'_1 x'_2 x'_3 \cdots$ be the recovered source sequence. Also, let $i_p $ (resp. $j_p$) be a position on codeword sequence $(y_1 y_2 y_3 \cdots)$ from which encoding (resp. decoding) of $x_p$ starts, and let $T^{p}_{{\rm enc}}$ (resp. $T^p_{{\rm dec}}$) be a code tree used to encode (resp. decode) $x_p.$ We prove by induction that $i_p = j_p$ and $T^p_{{\rm enc}} = T^p_{{\rm dec}}$ hold for every $p \geq 1.$ The base case $(p=1)$ clearly holds since $i_1 = j_1=1$ and $T^1_{{\rm enc}} = T^1_{{\rm dec}} = T_0$. Suppose that $i_p = j_p$ and $T^p_{{\rm enc}} = T^p_{{\rm dec}}$ hold for a given $p \geq 1$. Our goal is to prove $i_{p+1} = j_{p+1}$ and $T^{p+1}_{{\rm enc}} = T^{p+1}_{{\rm dec}}$. We note that $x_{p}$ is assigned to a master node. First, suppose that $x_{p}$ is assigned to a master node of degree 0, i.e., a leaf. Then, the decoding procedure straightforwardly recovers $x_{p}$ with no decoding delay. Thus, $x'_{p} = x_{p}$ holds and so does $i_{p+1} = j_{p+1}$. Then, both the encoder and decoder visit $T_0$ for the next source symbol $x_{p+1}$. Hence, $T^{p+1}_{{\rm enc}} = T^{p+1}_{{\rm dec}}$ holds. Next, suppose that $x_{p}$ is assigned to a master node of degree $k \geq 1$ (which we denote as $M$). Then, the encoding procedure visits $T_k$ for the next symbol $x_{p+1}$. On the other hand, since $M$ is a master node of degree $k$, we see from Definition \[master\_k\] that the prefix of all codeword sequences on $T_{{\rm enc}}^p$ starting from $M$ is $\underbrace{00\cdots 0}_{k+1}$. Thus, the decoding procedure cannot trace any codeword starting from $M$. Therefore, the decoding procedure decodes a source symbol at $M$, which leads the decoder to use $T_k$ for the next source symbol $x_{p+1}$. Hence, $x_p= x'_p,\ i_{p+1} = j_{p+1}$ and $T^{p+1}_{{\rm enc}} = T^{p+1}_{{\rm dec}}$ hold. In either cases, $i_{p+1} = j_{p+1}$ and $T^{p+1}_{{\rm enc}} = T^{p+1}_{{\rm dec}}$ hold. From the above induction, we have that $i_p = j_p$ and $T^p_{{\rm enc}} = T^p_{{\rm dec}}$ and hence $x_p$ = $x'_p$, which means that binary AIFV-$m$ codes are uniquely decodable. We proceed to define an average code length $L_{{\rm AIFV}}$ and redundancy $r_{{\rm AIFV}}$ of binary AIFV-$m$ code. \[ave\_general\] Let $\{T_k\}_{k = 0, \dots, m-1}$ be a set of the code trees. Let $\{L_{T_k}\}_{k = 0, \dots, m-1}$ and $\{P(T_k) \}_{k = 0, \dots, m-1} $ be a set of average code lengths and a set stationary probabilities of the code trees, respectively. The average code length of the binary AIFV-$m$ code is defined as follows. $$\begin{aligned} \label{av_len} L_{{\rm AIFV}} = \sum_{k = 0}^{m-1} P(T_k) L_{T_k}.\end{aligned}$$ Redundancy of optimal binary AIFV-$m$ codes is defined in the same way as . Based on Definition \[ave\_general\], we show how to calculate the average code length of binary AIFV-$m$ code. For example, consider the code trees in Fig. \[fig:3tree\] for a source $\mathcal{X} = \{a,b,c, d\}$ with probabilities $P(a) = 0.65,\ P(b) = 0.2,\ P(c) = 0.1$ and $P(d) = 0.05.$ The transition matrix $R$ is given by $$\begin{aligned} R = \begin{pmatrix} 0.9 & 0.1 & 0 \\ 0.9 & 0 & 0.1 \\ 1 & 0 & 0 \end{pmatrix},\end{aligned}$$ where $R_{ij}$ denotes the transition probability $P(T_j|T_i)$ from $T_i$ to $T_j$. The vector $\mbox{\boldmath $p$}=(P(T_0),P(T_1),\dots,P(T_{m-1}))^{\top}$ of stationary probabilities satisfies $$\begin{aligned} \mbox{\boldmath $p$}^{\top} R = \mbox{\boldmath $p$}^{\top}. \end{aligned}$$ Therefore, $\mbox{\boldmath $p$}$ is the normalized left eigenvector of $R$ with eigenvalue of 1. Hence, we get $P(T_0) =\frac{100}{111} ,\ P(T_1) = \frac{10}{111}$ and $P(T_2) = \frac{1}{111}.$ By Definition \[ave\_general\], the average code length $L_{{\rm AIFV}}$ is calculated as $$\begin{aligned} L_{{\rm AIFV}} = \frac{100}{111} \cdot 1.45 + \frac{10}{111} \cdot 2.15 + \frac{1}{111} \cdot 1.65 &= \frac{168.15}{111} \approx 1.515.\end{aligned}$$ We proceed to show the calculation of the average code length of the code in Fig. \[fig:3tree2\] for a source with probabilities $P(a) = 0.98, \ P(b) = 0.01,$ and $P(c) = 0.01$. The transition matrix $R$ is obtained as $$\begin{aligned} \label{R2} R = \begin{pmatrix} 0.02 & 0 & 0.98 \\ 1 & 0 & 0 \\ 0.02 & 0.98 & 0 \end{pmatrix}.\end{aligned}$$ Hence, we get the stationary probabilities as $P(T_0) = \frac{2500}{7351} \approx 0.340,\ P(T_1) = \frac{2401}{7351}\approx 0.327,$ and $P(T_2) = \frac{2450}{7351} \approx 0.333$. From , the average code length $L_{{\rm AIFV}}$ is calculated as $$\begin{aligned} L_{{\rm AIFV}} \approx 0.340 \cdot 0.08 + 0.327 \cdot 1.04 + 0.333 \cdot 0.08 \approx 0.394. \end{aligned}$$ Note that average code lengths of $T_0$ and $T_2$ are much smaller than 1. This is because the most likely source symbol ‘$a$’ is assigned to the roots of the trees. Compared with Fig. \[fig:aifv\_example\], which uses only two code trees, the binary AIFV-3 code shown in Fig. \[fig:3tree2\] uses an additional code tree $T_2$. The introduction of $T_2$ enables the extended code to compress the source better than the original binary AIFV code in Fig. \[fig:aifv\_example\]. {#redundancy} In this section, we first show the of optimal binary AIFV codes over Huffman codes in terms of compression ratio. We then show of optimal binary AIFV-$m$ codes for $m \leq 4$. The result suggests that the binary AIFV-$m$ codes further improve the worst-case redundancy of the original binary AIFV codes. The proofs of the theorems in this section are given in Section \[proofs\]. {#section} \[thm-1\] For $p_{\max} \geq \frac{1}{2}$, where $f(x)$ is defined as follows. $$\begin{aligned} f(x) = \left\{ \begin{array}{ll} x^2 - 2x + 2 - h(x) & \text{{\rm if} $\frac{1}{2} \leq x \leq \frac{-1+\sqrt{5}}{2}$,} \\ \frac{-2x^2+x+2}{1+x} - h(x) & \text{{\rm if} $\frac{-1+\sqrt{5}}{2} \leq x < 1$.} \\ \end{array} \right.\end{aligned}$$ . We see that the worst-case redundancy of optimal binary AIFV codes is smaller than that of Huffman codes for every $p_{\max} \geq \frac{1}{2}$. ![[]{data-label="fig:comparison"}](plot1.eps){width="8cm"} We also get Theorem \[thm-2\], covering the case of $p_{\max} < \frac{1}{2}$. \[thm-2\] For $p_{\max} < \frac{1}{2}$, the redundancy of optimal binary AIFV codes is at most $\frac{1}{4}.$ Yet, the derived bound is sufficient to prove Corollary \[cor-1\], which follows immediately from Theorems \[thm-1\] and \[thm-2\]. \[cor-1\] , optimal binary AIFV codes can beat Huffman codes for $\mathcal{X}^2$ [@yamamoto15]. Meanwhile, in terms of memory efficiency, a binary AIFV code only requires $\mathcal{O} (K)$ for storing code trees, while a Huffman code for $\mathcal{X}^2$ needs $\mathcal{O}(K^2)$, where $K = |\mathcal{X}|$. that binary AIFV codes are more memory-efficient than Huffman codes for $\mathcal{X}^2$, while attaining comparable compression performance . {#section-1} Do binary AIFV-$m$ codes provide further compression improvement over the original binary AIFV codes? In the following, we obtain These results suggest that binary AIFV-$m$ codes can benefit from the use of more code trees. \[lower\_bb\] \[bound3\] \[bound4\] \[pmax\_one\] Our justification for the conjecture is as follows. Huffman codes and the optimal AIFV-$m$ codes for $m \leq 4$ have the worst-case redundancy when $p_{\max} \to 1$. Thus, it is natural to assume that the same property also holds for $m \geq 5$. If this assumption is true, then the worst-case redundancy is $\frac{1}{m}$ from Theorem \[pmax\_one\], although it is an open question whether this assumption holds or not. Proofs of Theorems \[thm-1\]–\[pmax\_one\] {#proofs} ========================================== We start with proving Theorems \[thm-1\] and \[thm-2\], which provide upper bounds on the redundancy of optimal binary AIFV codes The key to the proofs is to construct binary AIFV code trees by transforming a Huffman code tree. Then, we can utilize the structural property of the Huffman tree, the sibling property introduced in Section \[sib-sec\], in evaluating the redundancy of the binary AIFV code. We first prepare three lemmas, which provide useful inequalities for the later evaluations on the bounds. Note that $q_1, q_2, \cdots, q_{2K-2}$ are defined in Section \[sib-sec\]. \[lem-1\] Consider a Huffman tree and suppose that $q_{2k-1}$ is not a leaf. Then, $q_{2k-1} \leq 2q_{2k}$ holds. Let $q'_1$ and $q'_2$ be children of $q_{2k-1}$. In the construction of the Huffman tree, $q'_1$ and $q'_2$ are merged before $q_{2k-1}$ and $q_{2k}$ are merged. Thus, $q'_1 \leq q_{2k}$ and $q'_2 \leq q_{2k}$ hold. Therefore, we get $q_{2k-1} = q'_1 + q'_2 \leq 2q_{2k}.$ \[lem-2\] Assume $0 < 2w_2 < w_1$ and let $q \in \left[0, \frac{1}{2}\right]$ be arbitrary. Then, $$\begin{aligned} 2w_2 - (w_1 + w_2) & h\left( \frac{w_2}{w_1 + w_2} \right) + q w_1 < q \left( w_1 - w_2 \right). \label{ineq-3}\end{aligned}$$ Let $c \equiv \frac{w_1}{w_2}> 2$ and define $g(x) \equiv h(x) - 2x$. Subtracting the LHS of from the RHS, we get $$\begin{aligned} - q&w_2 - 2w_2 + (1+c)w_2 \cdot \left( g \left(\frac{1}{1+c} \right) + \frac{2}{1+c} \right)\nonumber \\ &= w_2 \cdot \left( - q + (1+c) \cdot g \left(\frac{1}{1+c} \right) \right) \nonumber \\ &\geq w_2 \cdot \left( - \frac{1}{2} + (1+c) \cdot g \left(\frac{1}{1+c} \right) \right) \nonumber \\ &>0\label{eq:z}.\end{aligned}$$ The last inequality follows from $\inf _{c > 2} (1+c)g(\frac{1}{1+c}) = 0.754 \cdots > \frac{1}{2}$. \[lem-3\] If $q_{2k-1} \leq 2q_{2k}$, then $$\begin{aligned} (q_{2k-1} + q_{2k}) \left( 1 - h\left( \frac{q_{2k}}{q_{2k-1} + q_{2k}}\right) \right) \leq \frac{1}{4} \left( q_{2k-1} - q_{2k}\right).\end{aligned}$$ Since $q_{2k} \leq q_{2k-1} \leq 2q_{2k}$, it follows that $\frac{1}{3} \leq \frac{q_{2k}}{q_{2k-1} + q_{2k}} \leq \frac{1}{2}$. Further, since $\frac{1}{2}x + \frac{3}{4} \leq h(x)$ holds for $\frac{1}{3} \leq x \leq \frac{1}{2}$, $$\begin{aligned} (q_{2k-1} &+ q_{2k}) \left( 1 - h\left( \frac{q_{2k}}{q_{2k-1} + q_{2k}}\right) \right) \nonumber \\ &\leq (q_{2k-1} + q_{2k}) \left(1 - \frac{q_{2k}}{2(q_{2k-1} + q_{2k})} - \frac{3}{4} \right) \nonumber \\ &= \frac{1}{4} (q_{2k-1} - q_{2k}). \end{aligned}$$ Now, consider a $K$-ary source and let $T_{\rm H}$ be a Huffman code tree for the source. We transform $T_{\rm H}$ into a new tree $T_{\rm base}$ using Algorithm \[alg1\]. \[t\] Convert the sibling pair ($q_{2k}, \ q_{2k-1}$) into a master node and its grandchild. $\cdots$ ($\ast$) The conversion shown by ($\ast$) in Algorithm \[alg1\] is illustrated in Fig. \[fig:rotation\]. It is an operation that lifts up $q_{2k-1}$ to make a master node and pulls down the entire subtree of $q_{2k}$ to one lower level. Two nodes, $q_{2k-1}$ and $q_{2k}$, are then connected by code symbols ‘00’. ![The conversion from a sibling pair ($q_{2k-1},q_{2k}$) into a master node and its grandchild.[]{data-label="fig:rotation"}](rotation.eps){width="7.0cm"} Let $\mathcal{K}$ be the set of indices whose corresponding sibling pairs are converted by Algorithm \[alg1\] and let $\mathcal{U}$ denote the set of indices of entire sibling pairs, so that $$\begin{aligned} \mathcal{K} &= \{k \in \{ 2, \dots, K-1\}| q_{2k-1}\text{ is a leaf and } 2q_{2k} < q_{2k-1}\},\\ \mathcal{U} &= \{1,\dots, K-1\}. \end{aligned}$$ \[lem-4\] For $\frac{1}{2} \leq q_1 \leq \frac{2}{3}$, the redundancy of optimal binary AIFV codes is upper bounded by $q_1^2 - 2q_1 + 2 - h(q_1).$ Let $T_0$ be $T_{\rm base}$ and transform $T_{\rm base}$ into $T_1$ by the operation described in Fig. \[fig:trans1\]. ![Transformation of $T_{\rm base}$ into $T_1$.[]{data-label="fig:trans1"}](trans2.eps){width="7.0cm"} It is easy to see that $T_0$ and $T_1$ are valid binary AIFV code trees, satisfying all the properties mentioned in Section \[binary\_aifv\]. [1.08]{} The total probability assigned to master nodes is $\sum_{k \in \mathcal{K}}q_{2k-1}$ for both $T_0$ and $T_1$. Thus, it follows from the encoding procedure \[enc-2\]) in Section \[binary\_aifv\] that the transition probabilities, $P(T_1|T_0)$ and $P(T_0|T_1)$, are given by $\sum_{k \in \mathcal{K}}q_{2k-1}$ and $1- \sum_{k \in \mathcal{K}}q_{2k-1}$, respectively. Therefore, the stationary probabilities, $P(T_0)$ and $P(T_1)$, are calculated as $1- \sum_{k \in \mathcal{K}}q_{2k-1}$ and $\sum_{k \in \mathcal{K}}q_{2k-1}$, respectively. Then, we have from and $L_{\rm OPT} \leq L_{\rm AIFV}$ that $$\begin{aligned} L_{{\rm OPT}} &\leq L_{T_0}\cdot P(T_0) + L_{T_1} \cdot P(T_1)\nonumber \\ &= \left( \sum_{k \in \mathcal{U}\setminus \mathcal{K}}(q_{2k-1} + q_{2k}) + \sum_{k\in \mathcal{K}} 2q_{2k} \right) \cdot \left( 1- \sum_{k \in \mathcal{K}}q_{2k-1}\right) \nonumber \\ &\qquad +\left( q_2 + \sum_{k \in \mathcal{U}\setminus \mathcal{K}}(q_{2k-1} + q_{2k}) + \sum_{k\in \mathcal{K}} 2q_{2k} \right)\cdot \sum_{k \in \mathcal{K}}q_{2k-1} \nonumber \\ &= \sum_{k \in \mathcal{U}\setminus \mathcal{K}}(q_{2k-1} + q_{2k}) + \sum_{k\in \mathcal{K}} 2q_{2k} + q_2\cdot \sum_{k \in \mathcal{K}}q_{2k-1} \nonumber \\ &= \left( q_1 + q_2 \right) + \sum_{k \in \mathcal{K}} \left(2q_{2k} + q_2q_{2k-1} \right) +\sum_{k \in \mathcal{U} \setminus (\mathcal{K} \cup \{ 1\})} (q_{2k-1} + q_{2k}). \label{ineq:xyz}\end{aligned}$$ Applying chain rules of entropy on $T_{\rm H}$ from the root to leaves gives the following decomposition of the source entropy [@gallager78]. $$\begin{aligned} H(X) = \sum_{k \in \mathcal{U}} \left( q_{2k-1} + q_{2k} \right) h \left( \frac{ q_{2k}}{q_{2k-1} + q_{2k}} \right).\label{source_entropy}\end{aligned}$$ Thus, the redundancy of the optimal binary AIFV code, $r_{\rm AIFV}$, defined by is upper bounded from and as follows. $$\begin{aligned} r_{{\rm AIFV}} & \leq L_{T_0}\cdot P(T_0) + L_{T_1} \cdot P(T_1) - H(X)\nonumber\\ & = \left[q_1 + q_2 - h \left(\frac{q_{2}}{q_{1} + q_{2}} \right) \right] \nonumber\\ & \ \ + \sum_{k \in \mathcal{K}} \left[2q_{2k} - (q_{2k} + q_{2k-1})h \left(\frac{q_{2k}}{q_{2k-1} + q_{2k}} \right) + q_2q_{2k-1} \right] \nonumber \\ & \ \ +\sum_{k \in \mathcal{U} \setminus (\mathcal{K} \cup \{ 1\})} (q_{2k-1} + q_{2k}) \left( 1 - h \left( \frac{q_{2k}}{q_{2k-1} + q_{2k}} \right) \right). \label{ha}\end{aligned}$$ We can apply Lemma \[lem-2\] with $w_1 \coloneqq q_{2k-1},~ w_2 \coloneqq q_{2k}$ and $q \coloneqq q_2 \leq \frac{1}{2}$ to the second term of since $2q_{2k}<q_{2k-1}$ from the definition of $K$. On the other hand, for $k \in \mathcal{U}\setminus(\mathcal{K}\cup\{1\})$, if $q_{2k-1}$ is a leaf then $q_{2k-1}\leq2q_{2k}$ holds from the definition of $K$. If $q_{2k-1}$ is not a leaf then $q_{2k-1}\leq2q_{2k}$ still holds from Lemma \[lem-1\]. Thus, we can apply Lemma \[lem-3\] to the third term of . Combining these with $q_1 + q_2 = 1$, we get $$\begin{aligned} r_{{\rm AIFV}} &\leq 1 - h(q_1) + \sum_{k \in \mathcal{K}} q_2(q_{2k-1} - q_{2k}) + \sum_{k \in \mathcal{U} \setminus (\mathcal{K} \cup \{ 1\})} \frac{1}{4} (q_{2k-1} - q_{2k}) \nonumber \\ &\stackrel{({\rm a})}{\leq} 1 - h(q_1) + q_2\sum_{k = 2}^{K-1} (q_{2k-1} - q_{2k}) \nonumber\\ &\stackrel{({\rm b})}{<} 1 - h(q_1) + q_2q_3 \nonumber\\ & \stackrel{({\rm c})}{\leq} 1 - h(q_1) + q_2^2 \nonumber \\ & = q_1^2 - 2q_1 + 2 - h(q_1),\end{aligned}$$ where (a) holds since $\frac{1}{4} < \frac{1}{3} \leq 1 - q_1 = q_2$, and (b) and (c) hold since the sequence $\{q_k\}$ is non-increasing. We now turn to the proof of Theorem \[thm-1\]. \[Proof of Theorem \[thm-1\]\] First, consider the case of $\frac{1}{2} \leq p_{{\rm max}} \leq \frac{-1+\sqrt{5}}{2}$. Since $q_1 = p_{\max}$ for $p_{\max} \geq \frac{1}{2}$, it follows that $\frac{1}{2} \leq q_1 \leq \frac{-1+\sqrt{5}}{2} < \frac{2}{3}$. Applying Lemma \[lem-4\], we get the upper bound on the redundancy as $p_{\max}^2 - 2p_{\max} + 2 - h(p_{\max})$. [1.04]{} Next, we prove the bound for $\frac{-1+\sqrt{5}}{2} \leq p_{\max} < 1$. The proof follows the same line as the proof of Lemma \[lem-4\]. First, transform $T_{\rm base}$ into $T_0$ by the operation depicted in Fig. \[fig:trans2\] and also transform $T_{\rm base}$ into $T_1$ as illustrated in Fig. \[fig:trans1\]. ![Transformation of $T_{\rm base}$ into $T_0$.[]{data-label="fig:trans2"}](trans1.eps){width="6.5cm"} Then, $T_0$ and $T_1$ are valid binary AIFV code trees. In the same way as Lemma \[lem-4\], we can show that the stationary probabilities are given by $P(T_0) = \frac{1- \sum_{k \in \mathcal{K}}q_{2k-1}}{1 + q_1}$ and $P(T_1) = \frac{q_1 + \sum_{k \in \mathcal{K}}q_{2k-1}}{1 + q_1}$. As before, the redundancy of the optimal binary AIFV code can be upper bounded as follows. $$\begin{aligned} r_{{\rm AIFV}} & \leq L_{T_0}\cdot P(T_0) + L_{T_1} \cdot P(T_1) - H(X)\nonumber\\ & = \left[2q_2 + \frac{q_1^2}{1+q_1} - h\left(\frac{q_{2}}{q_{1} + q_{2}} \right)\right] \nonumber\\ &\ \ + \sum_{k \in \mathcal{K}} \left[ 2q_{2k} - (q_{2k} + q_{2k-1})h \left(\frac{q_{2k}}{q_{2k-1} + q_{2k}} \right) + \frac{q_1q_{2k-1}}{1+q_1} \right]\nonumber\\ & \ \ + \sum_{k \in \mathcal{U} \setminus (\mathcal{K} \cup \{ 1\})} (q_{2k-1} + q_{2k}) \left( 1 - h \left( \frac{q_{2k}}{q_{2k-1} + q_{2k}} \right) \right). \label{eq:22x}\end{aligned}$$ We can apply Lemma \[lem-2\] with $w_1 \coloneqq q_{2k-1},~w_2 \coloneqq q_{2k}$ and $q \coloneqq \frac{q_1}{1+q_1} \leq \frac{1}{2}$ to the second term of . Also, we can apply Lemma \[lem-3\] to the third term of . Combining these facts with $q_1 + q_2 = 1$ and $q_1 = p_{\max}$, we get $$\begin{aligned} r_{{\rm AIFV}} &\leq \left[2(1-q_1) + \frac{q_1^2}{1 + q_1}- h(q_1)\right] \nonumber \\ &\ \ + \sum_{k \in \mathcal{K}} \frac{q_1}{1 + q_1}(q_{2k-1} - q_{2k}) + \sum_{k \in \mathcal{U} \setminus (\mathcal{K} \cup \{ 1\})} \frac{1}{4} (q_{2k-1} - q_{2k}) \nonumber \\ &\stackrel{({\rm d})}{\leq} 2(1-q_1) + \frac{q_1^2}{1 + q_1}- h(q_1)+ \frac{q_1}{1+q_1}\sum_{k = 2}^{K-1} (q_{2k-1} - q_{2k}) \nonumber \\ &\stackrel{({\rm e})}{<} 2(1-q_1) + \frac{q_1^2}{1 + q_1}- h(q_1)+ \frac{q_1q_2}{1+q_1} \nonumber\\ & = \frac{-2p_{{\rm max}}^2+p_{{\rm max}}+2}{1+p_{{\rm max}}} - h(p_{{\rm max}}),\end{aligned}$$where (d) holds since $\frac{1}{4} < \frac{3-\sqrt{5}}{2} \leq \frac{q_1}{1 + q_1}$, and (e) holds since the sequence $\{q_k\}$ is non-increasing. , it is sufficient to show that there exists a source for every $p_{\max} \geq \frac{1}{2}$ such that the attains the bound arbitrarily closely. In particular, we show that the for a source with probabilities $(p_{\max}, 1 - p_{\max} - \delta, \delta)$ satisfies the bound with equality in the limit of $\delta \rightarrow 0$. Note that for $|\mathcal{X}|=3$, there exist only four possible tree structures for each code tree, $T_0$ and $T_1$. By examining all the possible combinations of the structures, it can be shown that the optimal binary AIFV codes are as illustrated in Fig. \[fig\_sim\] for each range of $p_{\max}$. We see that the redundancy of the codes coincides with the bound in the limit of $\delta \rightarrow 0$. We proceed to prove Theorem \[thm-2\], which provides a simple bound on the redundancy of optimal binary AIFV codes for $p_{\max} < \frac{1}{2}$. In the case of $p_{\max} < \frac{1}{2}$, we note that $|\mathcal{X}|\geq 3$ and thus, $q_1$ must be an internal node. It follows from Lemma \[lem-1\] that $q_1 \leq 2q_2.$ Since $q_1 + q_2 = 1$, we get $\frac{1}{2} \leq q_1 \leq \frac{2}{3}$. By Lemma \[lem-4\], we obtain $$\begin{aligned} r_{{\rm AIFV}} \leq \max_{\frac{1}{2} \leq q_1 \leq \frac{2}{3}} q_1^2 - 2q_1 + 2 - h(q_1) = \frac{1}{4}. \end{aligned}$$ We turn to the proof of Theorem \[lower\_bb\], which lower bounds the worst-case redundancy of optimal binary AIFV-$m$ codes. Consider a source $a \in \mathcal{X}$ with $P(a) = 1 - \delta$, where $\delta$ is arbitrarily close to 0. Our goal is to show that the redundancy of optimal binary AIFV-$m$ codes for the source must be larger than or equal to $\frac{1}{m}$ in order for the code to be uniquely decodable. Let $G = (V, E)$ be a directed graph, where $$\begin{aligned} V&\equiv\{i\in\{ \textcolor{black}{0,1,\cdots,m-1}\}| \mbox{Encoding procedure is able to reach $T_i$ from $T_0$}\},\nonumber\\ E&\equiv\{(i,j)| \mbox{ $T_j$ is used after encoding of `$a$' by $T_i$}\}.\end{aligned}$$ By a slight abuse of notation we sometimes identify an index $i\in V$ with the code tree $T_i$ in the following. Here note that $G$ contains disjoint loops[^3] because the number of outgoing edges is exactly one for each node. Let $S_1, S_2, \cdots, S_k\subset V$ be sets of nodes in each loop, where $k$ is the number of loops, and let $S_0\equiv V\setminus (S_1 \cup S_2 \cup \cdots \cup S_k)$. Now we consider the Markov chain corresponding to the code tree of a binary AIFV-$m$ code. The transition probability from code tree $T_i$ to $T_j$ is denoted by $P_{\delta}(T_j|T_i)$. The stationary probability of the code tree $T$ is denoted by $P_{\delta} (T)$ and we define $P_{\delta}(S) = \sum_{i \in S} P_{\delta}(T_i)$ for $S \subset V$. Let $P_{\delta}^{(l)}(T_j|T_i)$ be the transition probability for $l$ transitions, that is, $$\begin{aligned} P_{\delta}^{(l)}(T_j|T_i)= \begin{cases} P_{\delta}(T_j|T_i),&l=1,\\ \sum_{a\in V} P_{\delta}^{(l-1)}(T_a|T_i)P_{\delta}(T_j|T_a),&l\ge 2.\\ \end{cases}\end{aligned}$$ Here note that the code tree is not in $S_0$ after encoding of $\underbrace{aa\cdots a}_{m}$ from any code tree since $S_0$ contains no loop and $|S_0|\le m$. Thus, for all $j \in S_0$, we have Therefore, we have $$\begin{aligned} P_{\delta}(S_0) &= \sum_{i\in S_0}P_{\delta}(T_i)\nonumber\\ &= \sum_{j\in V}\sum_{i\in S_0}P_{\delta}(T_j)P_{\delta}^{(m)}(T_i|T_j)\nonumber \\ &\le \sum_{j\in V}P_{\delta}(T_j)(1-(1-\delta)^m)\nonumber \\ &= 1-(1-\delta)^m.\end{aligned}$$ Hence, we get $$\begin{aligned} P_{\delta}\left(\bigcup_{i=1}^k S_i\right) \geq (1-\delta)^m. \label{lower9}\end{aligned}$$ Consider the set of code trees $S_i$, $i\ge 1$. We write its elements by $S_i=\{j_1, j_2, \dots, j_s\}$ so that the loop of $S_i$ in $G$ is represented by $v_{j_1} \to v_{j_2} \to \cdots \to v_{j_s} \to v_{j_1}$. Recall that each transition on the graph corresponds to encoding of a source symbol ‘$a$’. Therefore, we get $$\begin{aligned} P_{\delta}(T_{j_2}) &\geq (1-\delta)P_{\delta}(T_{j_1}) \nonumber\\ P_{\delta}(T_{j_3}) &\geq (1-\delta)P_{\delta}(T_{j_2}) \nonumber \\ &\ \vdots \nonumber \\ P_{\delta}(T_{j_s}) &\geq (1-\delta)P_{\delta}(T_{j_{s-1}}) \nonumber \\ P_{\delta}(T_{j_1}) &\geq (1-\delta)P_{\delta}(T_{j_{s}}). \end{aligned}$$ Combining these inequalities, we obtain $$\begin{aligned} P_{\delta}(T_{j_n}) \leq \frac{P_{\delta}(T_{j_{n+1}})}{1- \delta} \le \cdots \leq \frac{P_{\delta}(T_{j_s})}{(1- \delta)^{s-n}} .\end{aligned}$$ Hence, $$\begin{aligned} P_{\delta}(S_i) &= \sum_{n = 1}^{s} P_{\delta}(T_{j_n})\nonumber \\ & \leq \sum_{n = 1}^{s} \frac{P_{\delta}(T_{j_s})}{(1-\delta)^{s-n}}\nonumber \\ & = P_{\delta}(T_{j_s}) \cdot \sum_{n = 1}^{s} (1-\delta)^{-(s-n)},\end{aligned}$$ which implies $$\begin{aligned} P_{\delta}(T_{j_s}) \geq \frac{P_{\delta}(S_i)}{\sum_{n = 1}^{s} (1-\delta)^{n-s}} \geq \frac{P_{\delta}(S_i)}{\sum_{n = 1}^{m} (1-\delta)^{n-m}}.\end{aligned}$$ Similarly, we can bound $P_{\delta}(T_{j_n}),\,1 \le n \le s$, as $$\begin{aligned} P_{\delta}(T_{j_n}) \geq \frac{P_{\delta}(S_i)}{\sum_{n^{\prime} = 1}^{m} (1-\delta)^{n^{\prime}-m}}. \label{good2}\end{aligned}$$ Here note that at least one of $T_{j_1}, T_{j_2}, \cdots ,T_{j_s}$ must assign ‘$a$’ to its non-root node in order for the code to be uniquely decodable. Otherwise, $\underbrace{a\cdots a}_s$ is encoded to null codeword with length 0, and hence, source sequences $x\underbrace{aa\cdots a}_{s}x^{\prime}$ and $xx^{\prime}$ are encoded to exactly the same codeword sequence. In such a case, the code is no longer uniquely decodable. Therefore, $\sum_{n = 1}^{s} L_{T_{j_n}} \geq 1 - \delta$ holds. Combining this with , we obtain a lower bound of the average code length as follows. $$\begin{aligned} \sum_{j\in V}P_{\delta}(T_j)L_{T_j} &\ge \sum_{i=1}^k\sum_{j \in S_i} P_{\delta}(T_j)L_{T_j}\nonumber\\ &\ge \sum_{i=1}^k\sum_{j \in S_i} \frac{P_{\delta}(S_i)}{\sum_{n^{\prime} = 1}^{m} (1-\delta)^{n^{\prime}-m}} L_{T_j}\nonumber\\ &\ge \sum_{i=1}^k\frac{(1-\delta)P_{\delta}(S_i)}{\sum_{n^{\prime} = 1}^{m} (1-\delta)^{n^{\prime}-m}}\nonumber\\&\ge \frac{(1-\delta)^{m+1}}{\sum_{n^{\prime} = 1}^{m} (1-\delta)^{n^{\prime}-m}},\label{lower13}\end{aligned}$$ where the last inequality follows from . Finally, the redundancy of the binary AIFV-$m$ codes for $\delta \to 0$ is lower bounded by $$\begin{aligned} \liminf_{\delta \to 0} \left( \sum_{i \in V} P_{\delta}(T) L_{T_i} - H_{\delta}(X)\right) &\geq \liminf_{\delta \to 0} \left( \frac{(1-\delta)^{m+1}}{ \sum_{n'=1}^{m}(1- \delta)^{n'-m}} - H_{\delta}(X) \right) \nonumber \\ &= \frac{1}{m},\end{aligned}$$ where $H_{\delta}(X)$ is the source entropy. This argument holds for any AIFV-$m$ code and we get Theorem \[lower\_bb\]. We then turn to the proofs of Theorems \[bound3\] and \[bound4\], Consider the case of $p_{\max} \geq \frac{1}{2}$. Then, $q_1$ is a leaf node. We transform a Huffman code tree $T_{\rm H}$ into binary AIFV-3 code trees by the transformation shown in Fig. \[fig:aifv3\]. It is easy to see that these code trees satisfy the conditions of binary AIFV-3 codes. The transition matrix $R$ is calculated as $$\begin{aligned} R = \begin{pmatrix} 1-p_{\max} & 0 & p_{\max} \\ 1 & \textcolor{black}{0} & 0 \\ 1-p_{\max} & p_{\max} & 0 \end{pmatrix}.\end{aligned}$$ Thus, the stationary probabilities are given by $$\begin{aligned} P(T_0) &= \frac{1}{1 + p_{\max} + p_{\max}^2},\label{stationary3from} \\ P(T_1) &= \frac{p_{\max}^2}{1 + p_{\max} + p_{\max}^2},\\ P(T_2) &= \frac{p_{\max}}{1 + p_{\max} + p_{\max}^2}. \label{stationary3to}\end{aligned}$$ Let $r_{T_i}~i = 1,2,3$ denote the redundancy of an FV code with the code tree $T_i$. Applying Theorem \[huffman\_bound\] gives upper bounds on $r_{T_i}$ as follows. $$\begin{aligned} r_{T_0} &< 2 - p_{\max} - h({p_{\max}}) - q_1 + 2q_2,\label{r3from} \\ r_{T_1} &< 2 - p_{\max} - h({p_{\max}}) +q_2, \\ r_{T_2} &< 2 - p_{\max} - h({p_{\max}}) - q_1 + 2q_2. \label{r3to}\end{aligned}$$ Let $r_{{\rm AIFV}\text{-}m}(p_{\max})$ be the redundancy of optimal binary AIFV-$m$ codes for a source with $p_{\max}$. Combining – with –, $r_{{\rm AIFV}\text{-}3}(p_{\max})$ is upper bounded as follows. $$\begin{aligned} r_{{\rm AIFV}\text{-}3}(p_{\max}) &\leq \sum_{i = 0}^2 P(T_i)\cdot r_{T_i} \nonumber \\ &< 2 - p_{\max} - h(p_{\max}) + \frac{1+p_{\max}}{1+p_{\max} + p_{\max}^2} \left(-p_{\max} + 2(1-p_{\max}) \right)\nonumber\\ & \qquad + \frac{p_{\max}^2}{1+p_{\max} + p_{\max}^2} (1-p_{\max}) \nonumber \\ & \equiv f_3(p_{\max}). \label{eq:ww}\end{aligned}$$ Note that our definition of binary AIFV-3 codes includes the original binary AIFV codes. Therefore, for $p_{\max} \geq \frac{1}{2}$, $r_{{\rm AIFV}\text{-}3}(p_{\max})$ can be upper bounded as follows. $$\begin{aligned} r_{{\rm AIFV}\text{-}3}(p_{\max}) \leq \min \{ f({p_{\max}}),\ f_3(p_{\max})\}, \end{aligned}$$ where the functions $f(\cdot)$ and $f_3(\cdot)$ are defined in Theorem \[thm-1\] and , respectively. Fig. \[fig:aifv3\_bound\] illustrates the function $\min \{ f({p_{\max}}),\ f_3(p_{\max})\}$. We see that $r_{{\rm AIFV}\text{-}3}(p_{\max}) \leq \min \{ f({p_{\max}}),\ f_3(p_{\max})\} < \frac{1}{3}$ holds for every $p_{\max} \geq \frac{1}{2}$. Also, Theorem \[thm-2\] implies that for $p_{\max} < \frac{1}{2}$, $r_{{\rm AIFV}\text{-}3}(p_{\max}) < \frac{1}{4}$ holds. In summary, $r_{{\rm AIFV}\text{-}3}(p_{\max}) < \frac{1}{3}$ holds for every $p_{\max} \in (0,1)$. Hence, the redundancy of optimal binary AIFV-3 codes is upper bounded as $$\begin{aligned} r_{{\rm AIFV\text{-}3}} \leq {\sup_{p_{\max} \textcolor{black}{\in (0,1)}}}\ r_{{\rm AIFV}\text{-}3}(p_{\max}) = \frac{1}{3}.\end{aligned}$$ ![Transformation from $T_{\rm H}$ to binary AIFV-3 code trees.[]{data-label="fig:aifv3"}](aifv3_tree.eps){width="9cm"} ![The redundancy upper bounds of optimal binary AIFV-3 codes in terms of $p_{\max}$.[]{data-label="fig:aifv3_bound"}](aifv3_bound.eps){width="8.5cm"} The proof follows the same line as the previous proof of binary AIFV-3 codes. Consider the case of $p_{\max} \geq \frac{1}{2}$. Then, $q_1$ is a leaf node. We transform a Huffman code tree $T_{\rm H}$ into binary AIFV-4 code trees by the transformation shown in Fig. \[fig:aifv4\]. It is easy to see that these code trees satisfy the conditions of binary AIFV-4 codes. The transition matrix $R$ is calculated as $$\begin{aligned} R = \begin{pmatrix} 1-p_{\max} & 0 & 0 & p_{\max} \\ 1 & 0 & 0 & 0 \\ 1-p_{\max} & p_{\max} & 0 & 0 \\ 1-p_{\max} & 0 & p_{\max} & 0 \end{pmatrix}.\end{aligned}$$ Thus, the stationary probabilities are given by $$\begin{aligned} P(T_0) &= \frac{1}{1 + p_{\max} + p_{\max}^2 + p_{\max}^3}, \label{stationary4from}\\ P(T_1) &= \frac{p_{\max}^3}{1 + p_{\max} + p_{\max}^2 + p_{\max}^3}, \\ P(T_2) &= \frac{p_{\max}^2}{1 + p_{\max} + p_{\max}^2 + p_{\max}^3},\\ P(T_3) &= \frac{p_{\max}}{1 + p_{\max} + p_{\max}^2 + p_{\max}^3}. \label{stationary4to}\end{aligned}$$ Let $r_{T_i}~1 \leq i \leq 4$ denote the redundancy of an FV code with the code tree $T_i$. Applying Theorem \[huffman\_bound\] gives upper bounds on $r_{T_i}$ as follows. $$\begin{aligned} r_{T_0} &< 2 - p_{\max} - h({p_{\max}}) - q_1 + 3q_2, \label{r4from} \\ r_{T_1} &< 2 - p_{\max} - h({p_{\max}}) + q_2, \\ r_{T_2} &< 2 - p_{\max} - h({p_{\max}}) - q_1 + 2q_2,\\ r_{T_3} &< 2 - p_{\max} - h({p_{\max}}) - q_1 + 3q_2. \label{r4to}\end{aligned}$$ Combining – with –, $r_{{\rm AIFV}\text{-}4}(p_{\max})$ is upper bounded as follows. $$\begin{aligned} r_{{\rm AIFV}\text{-}4}(p_{\max}) &\leq \sum_{i = 0}^3 P(T_i)\cdot r_{T_i} \nonumber \\ &< 2 - p_{\max} - h(p_{\max}) + \frac{1+p_{\max}}{1+p_{\max} + p_{\max}^2 + p_{\max}^3} \left(-p_{\max} + 3(1-p_{\max}) \right)\nonumber \\ & \qquad + \frac{p_{\max}^2}{1+p_{\max} + p_{\max}^2 + p_{\max}^3} (-p_{\max} + 2(1-p_{\max})) \nonumber \\ &\qquad + \frac{p_{\max}^3}{1+p_{\max} + p_{\max}^2 + p_{\max}^3} (1-p_{\max}) \nonumber \\ & \equiv f_4(p_{\max}). \label{eq:www}\end{aligned}$$ Thus, for $p_{\max} \geq \frac{1}{2}$, $r_{{\rm AIFV}\text{-}4}(p_{\max})$ is upper bounded as $$\begin{aligned} r_{{\rm AIFV}\text{-}4}(p_{\max}) \leq \min \{ f({p_{\max}}),\ f_4(p_{\max})\}. \end{aligned}$$ Fig. \[fig:aifv4\_bound\] illustrates the function $\min \{ f({p_{\max}}),\ f_4(p_{\max})\}$. We see that $r_{{\rm AIFV}\text{-}4}(p_{\max}) \leq \min \{ f({p_{\max}}),\ f_4(p_{\max})\} < \frac{1}{4}$ holds for every $p_{\max} \geq \frac{1}{2}$. Also, Theorem \[thm-2\] implies that for $p_{\max} < \frac{1}{2}$, $r_{{\rm AIFV}\text{-}4}(p_{\max}) < \frac{1}{4}$ holds. In summary, $r_{{\rm AIFV}\text{-}4}(p_{\max}) < \frac{1}{4}$ holds for every $p_{\max} \in (0,1)$. Hence, the redundancy of optimal binary AIFV-4 codes is upper bounded as $$\begin{aligned} r_{{\rm AIFV\text{-}4}} \leq {\sup_{p_{\max} \textcolor{black}{\in (0,1)}}} \ r_{{\rm AIFV}\text{-}4}(p_{\max}) = \frac{1}{4}.\end{aligned}$$ ![Transformation from $T_{\rm H}$ to binary AIFV-4 code trees.[]{data-label="fig:aifv4"}](aifv4_tree.eps){width="10cm"} ![The redundancy upper bounds of binary AIFV-4 codes in terms of $p_{\max}$.[]{data-label="fig:aifv4_bound"}](aifv4_bound.eps){width="8.5cm"} We then provide a simple proof of Theorem \[pmax\_one\], which justifies our conjecture that the redundancy of binary AIFV-$m$ codes is upper bounded by $\frac{1}{m}$ for any source. Suppose $p_{\max} \geq \frac{1}{2}$. Consider binary AIFV-$m$ code trees obtained by the transformation shown in Fig. \[fig:aifvm\_bound\], which is a generalization of Figs. \[fig:aifv3\] and \[fig:aifv4\] to the case of binary AIFV-$m$ codes. Analogous to – and –, it can be shown that the resulting binary AIFV-$m$ code trees, denoted by $T_0, T_1, \cdots, T_{m-1}$, have the stationary probabilities as ![[]{data-label="fig:aifvm_bound"}](general_tree.eps){width="11.5cm"} $$\begin{aligned} \label{transition} P(T_i) = \left\{ \begin{array}{ll} \frac{1}{\sum_{k = 0}^{m-1} p_{\max}^k} & \ \ \text{if $i=0$,} \\ \frac{p_{\max}^2}{\sum_{k = 0}^{m-1} p_{\max}^k} & \ \ \text{if $i=1$,}\\ \frac{p_{\max}^{m-i}}{\sum_{k = 0}^{m-1} p_{\max}^k} & \ \ \text{if $2 \leq i \leq m-1$.}\\ \end{array} \right.\end{aligned}$$ In the limit of $p_{\max} \to 1$, stationary probabilities for all the code trees become $\frac{1}{m}$. In addition, we see from Fig. \[fig:aifvm\_bound\] that the average code length tends to 0 for $T_{i},\ i \neq 1$, and tends to 1 for $T_1.$ Hence, the average code length of the binary AIFV-$m$ code tends to $\frac{1}{m}$ as $p_{\max} \rightarrow 1.$ Since source entropy tends to 0 as $p_{\max} \rightarrow 1$, the redundancy of the binary AIFV-$m$ code tends to $\frac{1}{m}$ in the limit of $p_{\max} \rightarrow 1.$ Therefore, the redundancy of the binary AIFV-$m$ code in Fig. \[fig:aifvm\_bound\] is $\frac{1}{m}$ in the limit of $p_{\max} \rightarrow 1.$ Conclusion ========== In this paper, we considered binary AIFV codes that use two code trees and decoding delay is at most two bits. We also extended the original binary AIFV codes the use of more code trees. We showed that when three and four code trees are allowed to be used, of binary AIFV-3 codes and binary AIFV-4 codes are improved to $\frac{1}{3}$ and $\frac{1}{4}$, respectively. For the future research, it is interesting to derive It may also be interesting to obtain other bounds (e.g., asymptotic redundancy [@szpankowski2000]) on redundancy of optimal binary AIFV codes, whose Huffman counterparts are already known. As regards binary AIFV-$m$ codes, it is an open problem to derive of the codes for any natural number $m$. Our conjecture is that under certain conditions on the size of alphabet, Furthermore, it is necessary to explore efficient algorithms to obtain optimal (or near-optimal) codes in the class of binary AIFV-$m$ codes and [^1]: W. Hu is with the Department of Computer Science, The University of Tokyo, Bunkyo-ku, Tokyo 113-8656, Japan. E-mail: hu@ms.k.u-tokyo.ac.jp H.Yamamoto and J. Honda are with the Department of Complexity Science and Engineering, The University of Tokyo, Kashiwa-shi, Chiba 277-8561, Japan E-mail: Hirosuke@ieee.org, honda@it.k.u-tokyo.ac.jp [^2]: The material in this paper is presented in part at the IEEE International Symposium on Information Theory, Barcelona, Spain, July 2016. [^3]:

2024-03-30T01:26:28.774034

https://example.com/article/3505

We have all witnessed some bloodshed in the crypto market over the past couple of days, but we cannot afford to be alarmed. We are confident in Ethereum, not because we are following hype around the value the token has generated since inception, but because the technology is fantastic — second generation scalable blockchain. We are keeping our eye on the next step in technology but until then, Ethereum seems to be sensible to follow. All dapps should also be thinking this way in order to succeed, and we will make sure this message is clear to all projects on our app. We must encourage building the infrastructure for the future, and ignore bad players who manipulate the market. Building a solid product and having a great community is always our focus. We must always be transparent about our policies, and even mistakes. We believe we can overcome any obstacle with your support. This is why we will be updating our progress and having you solve tasks on our app. We see you (the community) like a member of our company, with a voice and a vote. Product Let’s begin with the product, and how the smart contract will support our token movement model. As you know, we have token (ERC20) and non-token businesses on our application. ETH values displayed are just examples In the chart above, business pay for YUPs directly on our app, which is automated by purchasing on the exchange. To cover the costs we take a % rate fee. The plan is to make the YUP to dollar conversion visible on our app, similar to how Steemit uses dollars to show their token value from user comments. Tasks should be worth anywhere between $5 to $100, depending on task duration and difficulty. Non-token businesses only use YUPs (e.g 50 Yupies / task), while token businesses have a smaller % of YUP attached to their tasks.(e.g (10 YUP + 50 Beer tokens) / task) For ERC20 tokens, we take a small % which we hold. Thus if their token succeeds, we succeed, and our community succeeds. A win — win scenario. Monetary Policy Thank you all for contributing to our token supply amount task. There’s still time to answer before it expires. So if you have not given your feedback, please do here. What we need to solve has to do with the specific groups connected to the YUP: Investors, Startups, and Users. In order for our app to thrive, we must make sure all three groups benefit. Startups: They must not be affected by the volatility of the YUP. That’s why we introduced payments in ETH in order for quick and seamless process how to acquire ETH for YUP on our platform. Investors: If the value of the YUP grows too much, this means everyone will hold YUP and not distribute the tokens on our platform. This is an important economic issue many tokens will face in the future. In order to solve this, we must consider a max supply higher than the distributed supply. We will launch a task shortly so this can be discussed more deeply. Users: These are innovators who wants to be rewarded for their time and support of a business. The Yupie is the reward (plus bonus ERC20 tokens). You will then have the option to invest, spend, or save. However, we must make sure the YUP is not all held, but is actually used. Meaning users want to spend or invest in fresh business innovations and products. While completing our feature logic that will make our crowdsourcing system run smoothly, we must keep collecting data together in order to achieve this through the evolution of our product. To keep up with the evolution of our crypto community, we plan to allow the smart contract in the future to be adjustable. The reason why has to do with the current market moving fast, and one prediction mistake using a non-adjustable smart contract can hurt the business and even collapse it. Keep in mind, other businesses that don’t have this means they may have vulnerabilities in the future that will hurt them. However, any adjustments from our smart contract will be first requested by the community for approval as part of our process. Smart Contract Distribution This week, we have been focusing on the monetary policy (rules of our token) and next week we will distribute new tokens. It’s possible to do a ‘YUP airdrop,’ thus the wallet you used to initially receive Yupies will receive the new YUP token in place, taking account of any bonuses. If you transferred your YUP to a different wallet, the new tokens will still arrive in the origincal receiving wallet, not the wallet you transferred your YUP to. However, in order to be safe while we run the code, try to keep the old YUP tokens in the original receiving wallet. If you have moved them, we recommend putting them back for now. This will make it a lot easier for us to confirm everyone gets the correct quantity of the new token. We will keep updating you on a weekly basis. If you want to access our updates on a regular basis please join our Crowdholding News channel on Telegram. Keep up the good work y’all, and one last CH philosophy to think about: “Build today what you envision for the future.”

2024-01-23T01:26:28.774034

https://example.com/article/2860

“Kassardis, for his part, could do little but flee to the canyon, carrying the old swordmaster’s weapon and clad in near-rags. Once there, he hid himself among the reeds in a low pool in the bottom of the canyon. It was cool, and shady there, and the coming evening began to wash over the land, and Kassardis felt, for the first time in days, peace enter his heart. It was with dread then, that he heard the footfalls of his three wives entering the canyon not an hour later, and knew that his time had run out.” – Tales of the Silver Prince

2023-12-09T01:26:28.774034

https://example.com/article/3212

Q: C++ Trying to set pointers to new objects My program has a total of 10 objects which are set equal to an object pointer when created, here are the object pointers; a1,b1,b2,c1,c2,c3,d1,d2,d3, and d4. I have set each pointer to 0 initially. And I test for this in order for the program to know which objects of type A, B, C, or D have already been created. My problem is that the program does not do what I want, for type B objects, the first should be pointed to by b1 and then the next B object should be pointed to by b2, and likewise for C and D. But what happens is that b1 changes what it points to instead of the program recognizing that b1 is set and moving to b2. Here is a portion of the class member function: void Board::addShip(char type, int x1, int y1, int x2, int y2) { //Add a ship to the board. If the board already contains ten ships, the new ship should be ignored. Ship *a1=0,*b1=0,*b2=0,*c1=0,*c2=0,*c3=0,*d1=0,*d2=0,*d3=0,*d4=0; if (type == 'A' && a1==0) { cout << "a1" << endl; a1 = new AircraftCarrier(x1,y1,x2,y2); shipList.push_back(a1); } else if (type == 'B') { if (b1 == 0) { cout << "b1" << endl; b1 = new BattleShip(x1,y1,x2,y2); shipList.push_back(b1); } else if (b2 == 0) { cout << "b2" << endl; b2 = new BattleShip(x1,y1,x2,y2); shipList.push_back(b2); } } The cout statements are there for testing purposes. A: The problem is all of a1, b1... are local variables with automatic storage in the method addShip. So each time you call that method, these variables are created and initialzied to zero. That's why each time the first one is created (since for ex. a1==0 is true each time). Several solutions exists: You can make the variables static, so that they will be created only first time and will retain their values. Better solution would be to make them class member in class Board, because they represents components of Board (I guess). Then you will initialize them to zero(better NULL/nullptr) in the constructor of Board class.

2024-06-08T01:26:28.774034

https://example.com/article/9614

/* mc68ec.c -- Low level support for the Motorola mc68ec0x0 board. * Written by rob@cygnus.com (Rob Savoye) * * Copyright (c) 1995 Cygnus Support * * The authors hereby grant permission to use, copy, modify, distribute, * and license this software and its documentation for any purpose, provided * that existing copyright notices are retained in all copies and that this * notice is included verbatim in any distributions. No written agreement, * license, or royalty fee is required for any of the authorized uses. * Modifications to this software may be copyrighted by their authors * and need not follow the licensing terms described here, provided that * the new terms are clearly indicated on the first page of each file where * they apply. */ #include <sys/types.h> #include <sys/stat.h> #include <_ansi.h> #include <errno.h> #include "leds.h" /* * _exit -- exit the running program. We just cause an exception * which makes the program return to the boot monitor * prompt. It can be restarted from there. */ void _DEFUN (_exit, (status), int_status) { /* Use `i' constraint to get proper immediate-operand syntax for target assembler configuration. */ asm ("trap %0" : : "i" (0)); /* seems to be a harmless vector number */ } /* * delay -- delay execution. This is an ugly hack. It should * use the timer, but I'm waiting for docs. (sigh) */ void _DEFUN (delay, (num), int num) { while (num--) { asm ("nop"); } }

2023-08-16T01:26:28.774034

https://example.com/article/4135

This does work with the RELOADED release. The new -nomouseaccel commandline works a treat and makes the game so much more playable. The game is also generally more stable and less likely to crash back to desktop. The 5.1 surround sound+creative audigy bug is still there however. Can anyone report if this clears out the blue screen of death that a lot of people are having with the Reloaded release? I thought my rig was going bad but after a while i discovered that tons of people either had blue screen of death or could not get past the first few loading screens. Reloaded took a nose dive for me and so far they have not explained why people are getting the bsod’s….. Notes: * This release does not include any previous patches, thus should be used only after v1.0.0.17 patch is installed. * Use any existing local/online RGSC profile or create a new local profile to play.

2024-04-03T01:26:28.774034

https://example.com/article/6207

Multiparameter metabolic analysis reveals a close link between attenuated mitochondrial bioenergetic function and enhanced glycolysis dependency in human tumor cells. Increased conversion of glucose to lactic acid associated with decreased mitochondrial respiration is a unique feature of tumors first described by Otto Warburg in the 1920s. Recent evidence suggests that the Warburg effect is caused by oncogenes and is an underlying mechanism of malignant transformation. Using a novel approach to measure cellular metabolic rates in vitro, the bioenergetic basis of this increased glycolysis and reduced mitochondrial respiration was investigated in two human cancer cell lines, H460 and A549. The bioenergetic phenotype was analyzed by measuring cellular respiration, glycolysis rate, and ATP turnover of the cells in response to various pharmacological modulators. H460 and A549 cells displayed a dependency on glycolysis and an ability to significantly upregulate this pathway when their respiration was inhibited. The converse, however, was not true. The cell lines were attenuated in oxidative phosphorylation (OXPHOS) capacity and were unable to sufficiently upregulate mitochondrial OXPHOS when glycolysis was disabled. This observed mitochondrial impairment was intimately linked to the increased dependency on glycolysis. Furthermore, it was demonstrated that H460 cells were more glycolytic, having a greater impairment of mitochondrial respiration, compared with A549 cells. Finally, the upregulation of glycolysis in response to mitochondrial ATP synthesis inhibition was dependent on AMP-activated protein kinase activity. In summary, our results demonstrate a bioenergetic phenotype of these two cancer cell lines characterized by increased rate of glycolysis and a linked attenuation in their OXPHOS capacity. These metabolic alterations provide a mechanistic explanation for the growth advantage and apoptotic resistance of tumor cells.

2023-08-05T01:26:28.774034

https://example.com/article/2854

2019年04月13日 18時00分 ハードウェア 「民間初の月面着陸」に惜しくも失敗し墜落した探査機から送られた最期の写真 by Israel To The Moon 民間として初めて月面着陸ミッションに挑戦したイスラエルのSpaceILは、2019年4月11日、2月に打ち上げた月面探査機「Beresheet lander」の月面着陸がマシントラブルによって失敗したことを明らかにしました。Beresheet landerはそのまま月面に衝突したそうですが、その直前に撮影された写真がプロジェクトのスタッフによって公開されています。 This Is the Stunning Picture Israel’s Lunar Lander Took Right Before It Crashed - Motherboard https://motherboard.vice.com/en_us/article/kzmqez/this-is-the-stunning-picture-israels-lunar-lander-took-right-before-it-crashed SpaceILのメンバーであるElad Ratson氏が公開した、Beresheet landerによる最後の写真が以下。真っ暗な宇宙と太陽からの入射光によるレンズフレア、そして月面のクレーターがくっきりと映し出されています。 Just received from SpaceIL communication team what appears to be the last image #Beresheet spacecraft managed to beam to earth before it crashed on the moons surface pic.twitter.com/yDx2ioZiXy — Elad Ratson ???????? (@EladRatson) 2019年4月11日 イスラエルのSpaceILは2011年に設立された民間宇宙団体。Beresheet landerはGoogleがスポンサーとなって開催された月面無人探査コンテスト「Google Lunar X Prize」に向けて始まったプロジェクトでしたが、コンテストの期日である2018年3月31日に間に合わず、2019年2月にSpaceXのファルコン9ロケットで打ち上げられました。なお、「Beresheet」は旧約聖書の最初の書である「創世記」を意味するヘブライ語だとのこと。以下の映像はSpaceILによる月面着陸プロジェクトのプロモーションムービーです。 SpaceIL - Beresheet's Journey to the Moon - YouTube 以下の画像に写っているのがBeresheet lander。直径は2m、高さ1.5m、重量はおよそ150kgで、プロジェクトの費用はおよそ1億ドル(約110億円)といわれています。 by TaBaZzz Beresheet landerのミッションが成功すれば、イスラエルはアメリカ・ソ連・中国に続いて4番目に月面着陸を成功させることとなり、さらに月面着陸国家が関与しない民間のプロジェクトとして初の月面着陸達成という快挙となる予定でした。Beresheet landerは月面着陸への軌道に無事入ったものの、その後のエンジントラブルによって月面からの高度約149mというところで通信が途絶。そのまま月面に墜落したとみられています。 着陸実験はYouTubeでライブ配信されていて、以下からその録画を見ることができます。最後の画像を送信した後に突然探査船からの通信が途絶えてしまう瞬間は以下のムービーの35分14秒辺りから見ることができます。 LIVE broadcast - Beresheet lands on the Moon Fasten your seatbelts, we are about to land. - YouTube Ratson氏によると、Israel Aerospace Industries(イスラエル航空宇宙産業)から手に入れたBeresheet lander最後の写真は、高度およそ7500mの時点で送信されたものとのこと。 Got 2ⁿᵈ confirmation from @ILAerospaceIAI. This is the l̲a̲s̲t̲ image #Beresheet sent to earth before it crashed! Telemetry of moment it was taken not available yet, however, image received in mission control when Beresheet was 7.5㎞ above moon surface ????https://t.co/Hq9cSgm9JA pic.twitter.com/9UPQ5jeSZv — Elad Ratson ???????? (@EladRatson) 2019年4月12日 また、SpaceILのチームは「信じ続けてください。私たちはもう少しだったのに不幸にも着陸プロセスでうまくいきませんでした。今後のためにもさらなる改善を行います」というコメントと共に、金色に輝くイスラエルの国旗と月面の2ショットを公開しました。 Don’t stop believing! We came close but unfortunately didn’t succeed with the landing process. More updates to follow.#SpaceIL #Beresheet pic.twitter.com/QnLAwEdKRv — Israel To The Moon (@TeamSpaceIL) 2019年4月11日

2024-06-24T01:26:28.774034

https://example.com/article/7911

March 13, 2020 Dear Members of the Harvard Community, I write to follow up on the message you received Wednesday from HUHS Executive Director Giang Nguyen regarding two members of our community who have been tested for Coronavirus Disease 2019 (COVID-19). One individual received a presumptive positive test and is receiving medical care off campus. We await test results for the second individual. Additionally, a third individual who had close contact with the person who tested positive, is now being tested. Additional close contacts will be tested as needed. Ensuring the anonymity of these individuals is paramount. If you are aware of their identities, please respect their privacy so that they can focus completely on their health. The last thing they need—or any of us would want for them—is public attention and scrutiny. We will do everything we can to support these individuals through what is undoubtedly a disconcerting and difficult time. Guided by the Centers for Disease Control and local public health agencies, Harvard has established protocols for evaluating individuals who have symptoms of COVID-19. In line with those protocols, the Department of Public Health is taking the appropriate steps to communicate with members of the community who may have come into contact with the individual who tested positive. HUHS is supporting this effort. I recognize that the uncertainty around COVID-19, and now a confirmed case within our community, may cause stress and anxiety, and I urge you to be in touch with either Harvard Counseling and Mental Health Services or the Harvard Employee Assistance Program if you need assistance. I also encourage you to visit the University’s dedicated COVID-19 webpage for important information and updates related to our response. The interventions I announced on Tuesday, which are now under way, will decrease the density of people on our campus to help slow the spread of COVID-19. I know that many of you are concerned about the speed with which we are compelling you to act, and I understand that the changes we are asking you to make are very significant, but today’s confirmed case gives our efforts even greater urgency. At every level of the University, good people are working without pause to provide guidance and resources, to share the latest information, and to make decisions with a single end in mind—ensuring the safety of every member of our community. I must reiterate the responsibility that each of us has in keeping our community safe. Everyone should be following the preventive recommendations that have been shared previously. Please re-familiarize yourself with these practical and effective measures. No one knows what we will face in the weeks ahead, but everyone knows enough to understand that COVID-19 will test our capacities to be kind and generous, and to see beyond ourselves and our own interests. Our task now is to bring the best of who we are and what we do to a world that is more complex and more confused than any of us would like it to be. May we all proceed with wisdom and grace. With appreciation, Larry

2023-10-28T01:26:28.774034

https://example.com/article/9709

Tushar Kaushik By Express News Service BENGALURU: Demolition of a five-storey paying guest building at Ashwathnagar, near Marathahalli bridge, has raised questions on the regulation, quality and safety of construction projects in the city. The authorities took up demolition work on Friday after it was noticed that the hostel building had shifted slightly to its left, on Thursday evening. The process will continue over the next two or three days. On Thursday night, residents of the PG along with those in five adjacent buildings evacuated their respective residences. Sudhakar, a resident of the adjacent buildings, said that tenants of the demolished building had initially waited nearby, but eventually made alternative arrangements for their stay. Several instances of buildings tilting in this manner have occurred in the past too. In February this year, a five-storey under-construction building collapsed in Kasavanahalli, leaving four people dead and 15 injured. Fire department personnel bringing down the tilted structure at Ashwathnagar near Marathahalli bridge in Bengaluru on Friday (Photo | Pandarinath B) BBMP’s Chief Engineer for East Zone B S Prasad said that for newly-constructed buildings, both the architect and builder have to provide a signed affidavit, saying they are responsible for the quality and safety of the building. For already existing buildings, consultants deployed by the BBMP will inspect it and submit a report on its structural stability. “If the building is beyond a certain age, we notify it as ‘dilapidated’ and provide an order for demolition,” Prasad said. However, it is the building owner who should initiate such inspections. They are not taken up by the corporation. Architect Naresh Narasimhan said a certificate for structural stability of any structure is supposed to be issued by an engineer certified by the city corporation. “I don’t think people are even following the sanctioned plans, but building whatever they like. I think BBMP is short-staffed, so they are not able to regulate this issue,” he said. Bangalore Development Authority (BDA) does have such a provision, but only for major buildings, said engineer member B S Shivakumar. Cops arrest building owner, contractor The owner of the five-storey men’s paying guest building that tilted at Ashwathnagar, Marathahalli, on Thursday evening was arrested by HAL police. Shivaprasad, 35, the building owner, was booked under IPC Section 336 (act endangering life or personal safety of others). Meanwhile, police reportedly detained the building contractor, Venkatesh. “Preliminary probe established that the building foundation had sunk about three inches below the ground, which led to the slight tilt. It is due to substandard work by the contractor,” police added. ‘BBMP staffers demolish part of adjacent building’ The demolition work, however, is said to have caused trouble to neighbours. It is alleged that BBMP officials partially demolished a building next to the PG centre, while operating an earthmover. Manoj Pillai, a member of the house, alleged that the building compound, one room and a toilet were demolished “without any consultation” with the family. “BBMP officials who were at the spot, did not even bother to listen. They asked us to file a complaint against them when we tried to explain the situation. Besides, they did not even assure us that they would reconstruct the demolished part,” Pillai said.

2024-02-14T01:26:28.774034

https://example.com/article/6815

The present invention relates to a prosthesis for implantation in a body and more particularly to a prosthesis for maintaining the existence of a pocket or surface, either natural or surgically made, in the body and preventing the walls of the pocket or surface from adhering together or from adhering to tissue or organs. Prostheses for implantation in the human body are well known, having been used for breast augmentation, nose, ear and other body part reconstruction, lymphedema shunts, percutaneous skin access devices, insulin implants, paraplegic implantable cushions, tendon repair prosthesis, etc. Of course, perhaps the most well-known implantable prosthesis, and the most commonly used, is the prosthesis used for either breast reconstruction or breast augmentation. The procedure for using these prostheses typically involves forming a pocket, referred to hereafter as a body pocket, or cavity in a patient's breast and extending submuscularly/subglandularly/subcutaneously upwardly to overlay the superior/lateral part of the chest. This may involve simply the dissection of tissue in the breast area to form the pocket or the dissection of tissue as well as removal of diseased or unwanted tissue. In either case, a fairly large pocket is formed over much of the chest area. After formation of the body pocket, the selected implantable primary prosthesis (now typically constructed of a silicone envelope in which is contained some type of elastomer gel, liquid saline, or other fluid) is placed at the desired site in the body pocket or cavity which best provides the desired augmentation (or reconstruction) and appearance. Immediately after the implantation, the implanted envelope (as the primary prosthesis) is allowed to "flow" or move within the dissected pocket superiorly and laterally to give the breast an anatomically natural look and feel. However, after time, usually a matter of weeks, facing walls of the body pocket begin to re-adhere and a natural tissue capsule forms around the implant to prevent it from flowing or moving in the pocket. This natural tissue capsule may also contract to tighten around the implanted prosthesis causing it to be unnaturally firm, possibly distorted in form, and sometimes painful. Of course, with either reconstructive or augmentation surgery of a breast, it is desired that the resulting feature remain as natural in both appearance and feel as possible for as long as possible. With the procedures currently used, achieving this objective consistently is very difficult.

2023-11-06T01:26:28.774034

https://example.com/article/8741

Got my new mid length psa rifle kit that I ordered over Memorial Day weekend. After a few emails with palmetto with questions about the barrel profile I pulled the trigger on this awesome kit. Their customer service is top notch, I received a response within hours and they sent this kit 4 days after I ordered it. I received this kit 9 days after ordering so they were really quick with their shipping also. Hope you like it and please like share and subscribe. http://palmettostatearmory.com/index.php/ar-15-05/rifle-kits/psa-16-chf-mid-length-5-56-nato-1-7-ultra-light-moe-defender-rifle-kit.html published:10 Jun 2015 views:21403 world conqueror 3 nato 1 This is the 68th video i am making on a game called WorldConqueror 3. This is a game you can get for free on playstore. Good graphics , strategy oriented and historical based. Less than 60 mb, it lets you fight lots of wars agains human and aliens too. Warning! You may become addicted. Video report about the fight against terrorism. This report allows you to hear from people who are involved in the fight against terrorism on a day-to-day basis. They are not just soldiers but also scientists, intelligence officers, politicians and civil servants. They represent NATO's multifaceted response to the terrorist threat. http://www.nato.int/issues/terrorism/index.html NATO Homepage: http://www.nato.int NATO The North Atlantic Treaty Organization (NATO/ˈneɪtoʊ/; French:Organisation du traité de l'Atlantique Nord; OTAN), also called the North Atlantic Alliance, is an intergovernmentalmilitary alliance based on the North Atlantic Treaty which was signed on 4April 1949. The organization constitutes a system of collective defence whereby its member states agree to mutual defense in response to an attack by any external party. NATO's headquarters are located in Haren, Brussels, Belgium, where the Supreme Allied Commander also resides. Belgium is one of the 28 member states across North America and Europe, the newest of which, Albania and Croatia, joined in April 2009. An additional 22countries participate in NATO's Partnership for Peace program, with 15other countries involved in institutionalized dialogue programmes. The combined military spending of all NATO members constitutes over 70 percent of the global total. Members' defense spending is supposed to amount to 2 percent of GDP. Akakage Akakage(赤影,Red Shadow) is a fictional Japanesesuperhero that is featured in several manga, anime, live action movies and TV shows. Akakage first appears in the 1967 TV series, Kamen no Ninja Akakage which was produced by Toei Company Ltd.. Character Akakage, created by Mitsuteru Yokoyama, is a ninja who wears a red-and-black costume and a stylized red mask. His adventures take place in Feudal Japan, and he and his ninja sidekicks Aokage(青影,Blue Shadow, a little boy) and Shirokage(白影,White Shadow, an old man) fight evil warlords, imagery and daikaiju using modern high-tech gadgetry. (An oddity in the series feudal setting.) 1967 Tokusatsu series Kamen no Ninja Akakage(仮面の忍者 赤影,Masked Ninja Akakage), produced by Toei Company Ltd., aired on KTV and Fuji TV from April 5, 1967 to March 27, 1968, with a total of 52 episodes (divided into four segments). Akakage was played by Yuzaburo Sakaguchi, Aokage was played by Yoshinobu Kaneko (younger brother of fellow child actor Mitsunobu Kaneko of Akuma-kun and Giant Robo fame) and Shirokage was played by Fuyukichi Maki. Got my new mid length psa rifle kit that I ordered over Memorial Day weekend. After a few emails with palmetto with questions about the barrel profile I pulled the trigger on this awesome kit. Their customer service is top notch, I received a response within hours and they sent this kit 4 days after I ordered it. I received this kit 9 days after ordering so they were really quick with their shipping also. Hope you like it and please like share and subscribe. http://palmettostatearmory.com/index.php/ar-15-05/rifle-kits/psa-16-chf-mid-length-5-56-nato-1-7-ultra-light-moe-defender-rifle-kit.html 13:42 world conqueror 3 nato 1 Red Shadow *Bronze* world conqueror 3 nato 1 Red Shadow *Bronze* world conqueror 3 nato 1 Red Shadow *Bronze* world conqueror 3 nato 1 This is the 68th video i am making on a game called WorldConqueror 3. This is a game you can get for free on playstore. Good graphics , strategy oriented and historical based. Less than 60 mb, it lets you fight lots of wars agains human and aliens too. Warning! You may become addicted. NATO - Defence against terrorism 1/6 Video report about the fight against terrorism. This report allows you to hear from people who are involved in the fight against terrorism on a day-to-day basis. They are not just soldiers but also scientists, intelligence officers, politicians and civil servants. They represent NATO's multifaceted response to the terrorist threat. http://www.nato.int/issues/terrorism/index.html NATO Homepage: http://www.nato.int 1:05 s.nato 1 s.nato 1 s.nato 1 s.nato 1 5:02 Nato &Hilal demo Nato &Hilal demo Nato &Hilal demo 15:03 world conqueror 3 nato 1 Red Shadow *Gold* world conqueror 3 nato 1 Red Shadow *Gold* world conqueror 3 nato 1 Red Shadow *Gold* world conqueror 3 nato 1 This is the 105th video i am making on a game called WorldConqueror 3. This is a game you can get for free on playstore. Good graphics , strategy oriented and historical based. Less than 60 mb, it lets you fight lots of wars agains human and aliens too. Warning! You may become addicted. Got my new mid length psa rifle kit that I ordered over Memorial Day weekend. After a few emails with palmetto with questions about the barrel profile I pulled the trigger on this awesome kit. Their customer service is top notch, I received a response within hours and they sent this kit 4 days after I ordered it. I received this kit 9 days after ordering so they were really quick with their shipping also. Hope you like it and please like share and subscribe. http://palmettostatearmory.com/index.php/ar-15-05/rifle-kits/psa-16-chf-mid-length-5-56-nato-1-7-ultra-light-moe-defender-rifle-kit.html published: 10 Jun 2015 world conqueror 3 nato 1 Red Shadow *Bronze* world conqueror 3 nato 1 This is the 68th video i am making on a game called WorldConqueror 3. This is a game you can get for free on playstore. Good graphics , strategy oriented and historical based. Less than 60 mb, it lets you fight lots of wars agains human and aliens too. Warning! You may become addicted. NATO - Defence against terrorism 1/6 Video report about the fight against terrorism. This report allows you to hear from people who are involved in the fight against terrorism on a day-to-day basis. They are not just soldiers but also scientists, intelligence officers, politicians and civil servants. They represent NATO's multifaceted response to the terrorist threat. http://www.nato.int/issues/terrorism/index.html NATO Homepage: http://www.nato.int published: 02 Oct 2008 s.nato 1 s.nato 1 published: 25 Oct 2009 Nato &Hilal demo published: 08 Feb 2013 world conqueror 3 nato 1 Red Shadow *Gold* world conqueror 3 nato 1 This is the 105th video i am making on a game called WorldConqueror 3. This is a game you can get for free on playstore. Good graphics , strategy oriented and historical based. Less than 60 mb, it lets you fight lots of wars agains human and aliens too. Warning! You may become addicted. Got my new mid length psa rifle kit that I ordered over Memorial Day weekend. After a few emails with palmetto with questions about the barrel profile I pulled ... Got my new mid length psa rifle kit that I ordered over Memorial Day weekend. After a few emails with palmetto with questions about the barrel profile I pulled the trigger on this awesome kit. Their customer service is top notch, I received a response within hours and they sent this kit 4 days after I ordered it. I received this kit 9 days after ordering so they were really quick with their shipping also. Hope you like it and please like share and subscribe. http://palmettostatearmory.com/index.php/ar-15-05/rifle-kits/psa-16-chf-mid-length-5-56-nato-1-7-ultra-light-moe-defender-rifle-kit.html Got my new mid length psa rifle kit that I ordered over Memorial Day weekend. After a few emails with palmetto with questions about the barrel profile I pulled the trigger on this awesome kit. Their customer service is top notch, I received a response within hours and they sent this kit 4 days after I ordered it. I received this kit 9 days after ordering so they were really quick with their shipping also. Hope you like it and please like share and subscribe. http://palmettostatearmory.com/index.php/ar-15-05/rifle-kits/psa-16-chf-mid-length-5-56-nato-1-7-ultra-light-moe-defender-rifle-kit.html world conqueror 3 nato 1 Red Shadow *Bronze* world conqueror 3 nato 1 This is the 68th video i am making on a game called WorldConqueror 3. This is a game you can get for free on playstore. Good graphics ... world conqueror 3 nato 1 This is the 68th video i am making on a game called WorldConqueror 3. This is a game you can get for free on playstore. Good graphics , strategy oriented and historical based. Less than 60 mb, it lets you fight lots of wars agains human and aliens too. Warning! You may become addicted. world conqueror 3 nato 1 This is the 68th video i am making on a game called WorldConqueror 3. This is a game you can get for free on playstore. Good graphics , strategy oriented and historical based. Less than 60 mb, it lets you fight lots of wars agains human and aliens too. Warning! You may become addicted. NATO - Defence against terrorism 1/6 Video report about the fight against terrorism. This report allows you to hear from people who are involved in the fight against terrorism on a day-to-day ba... Video report about the fight against terrorism. This report allows you to hear from people who are involved in the fight against terrorism on a day-to-day basis. They are not just soldiers but also scientists, intelligence officers, politicians and civil servants. They represent NATO's multifaceted response to the terrorist threat. http://www.nato.int/issues/terrorism/index.html NATO Homepage: http://www.nato.int Video report about the fight against terrorism. This report allows you to hear from people who are involved in the fight against terrorism on a day-to-day basis. They are not just soldiers but also scientists, intelligence officers, politicians and civil servants. They represent NATO's multifaceted response to the terrorist threat. http://www.nato.int/issues/terrorism/index.html NATO Homepage: http://www.nato.int world conqueror 3 nato 1 Red Shadow *Gold* world conqueror 3 nato 1 This is the 105th video i am making on a game called WorldConqueror 3. This is a game you can get for free on playstore. Good graphics... world conqueror 3 nato 1 This is the 105th video i am making on a game called WorldConqueror 3. This is a game you can get for free on playstore. Good graphics , strategy oriented and historical based. Less than 60 mb, it lets you fight lots of wars agains human and aliens too. Warning! You may become addicted. world conqueror 3 nato 1 This is the 105th video i am making on a game called WorldConqueror 3. This is a game you can get for free on playstore. Good graphics , strategy oriented and historical based. Less than 60 mb, it lets you fight lots of wars agains human and aliens too. Warning! You may become addicted. Lisbon Vacation Travel Guide | Expedia https://www.expedia.com/Lisbon-District.d178278.Destination-Travel-Guides From its days as a Phoenician outpost to its expansion into a 16th century trading giant, from the GreatEarthquake of 1755 to its glorious reconstruction, Lisbon has long been a city of shifting fortunes. Lisbon has forever been linked to the sea and it’s on the waterfront where you’ll find the city’s grand gateway, Praça do Comércio. Pass beneath the triumphal arch, a tribute to the city’s reconstruction, and drift down Rua Augusta to another of Lisbon’s great squares, the Rossio. Climb aboard Tram 28, which passes some of the city’s most iconic sights, then climb the battlements of Castelo de São Jorge to see the red tiled roofs of Lisbon spread out before you. Although the Great Earthquake reduced much of ... published: 25 Oct 2017 What Do the UN and NATO Actually Do? Acronyms like NATO, the EU, and UNICEF are everywhere in the news and it can be hard keeping them all straight. What do each of these organizations do? Here’s our guide to decoding the alphabet soup of world organizations. Lake Bled Travel Guide | Day Trip from Ljubljana, Slovenia Join us as we visit LakeBled in this travel guide as a day trip from Ljubljana, Slovenia where we cover the top things to do in Lake Bled including visiting the castle by foot and island by boat trip. Just slightly over an hour by bus and roughly 45 minutes by car Lake Bled is easily accessible from Ljubljana. With most attractions clustered around the lake a perfect way to spend a day visiting Lake Bled is to walk around the lake, visit Bled Castle, eat local cake and have a leisurely lunch along with taking a boat trip out to the island. All of this can be done in a day allowing you to return to Ljubljana in the early evening. Let's find out what makes Lake Bled one of the most popular day trips for visitors traveling in Slovenia. Lake Bled in other languages: Slovenian: blejsko j... published: 01 Dec 2017 Around the Balkans in 20+ Days (Part 1/5) 15 years after hosting Europe's ugliest civil war since the Holocaust, VICE takes a road trip across the remnants of Old Yugoslavia. Watch more VICE documentaries here: http://bit.ly/VICE-Documentaries While most of us were still hung up on grunge, the republics of the former Yugoslavia spent the early 90s hung up on seceding into their own countries and mass-murdering people over infinitesimal ethnic differences. And the mid 90s. And the late 90s. To commemorate 12 years without a major attempted genocide, we decided to rent a Yugo and take a road trip through the Balkans to see what's going on and try to wrap our thinkers around what was up with all that ethnic cleansin'. Our first stop: A nostalgic amusement park in northern Serbia that recreates Marshall Tito's Socialist Federal Rep... Buenos Aires Vacation Travel Guide | Expedia http://www.expedia.com/Buenos-Aires.d178242.Destination-Travel-Guides Named for good sailing winds, Buenos Aires is the capital of Argentina, and home to nearly a quarter of the country’s two million residents. Come for the stunning European architecture, and stay for delicious cuts of meat, the city’s zest for soccer, and, of course, the tango. “The Paris of South America” boasts outstanding shopping and a friendly populace. A tour of Buenos Aires should cut through La BocaHarbor, where you’ll find numerous street vendors, restaurants, and street dancers willing to give you a spin. Wander down the streets to take in colorful artwork, and make a game out of asking the locals what neighborhood you should tour next. Here’s a hint: with so much to see, everyone will give you a different a... published: 23 Jun 2014 Sea Breeze: Turkey joins war games along with 15 NATO countries off Ukraine coast A Turkish frigate, an amphibious ship, and a submarine entered the port of Odessa, Monday. They will take part in the international ‘Sea Breeze-2017’ drills. The frigate F241 Turgutreis and the NL 214 landing ship stood at the berth of the seaport, with a Batiray S349 submarine was moored nearby. READ MORE: https://on.rt.com/8hga COURTESY: RT's RUPTLY video agency, NO RE-UPLOAD, NO REUSE - FOR LICENSING, PLEASE, CONTACT http://ruptly.tv RT LIVE http://rt.com/on-air Subscribe to RT! http://www.youtube.com/subscription_center?add_user=RussiaToday Like us on Facebook http://www.facebook.com/RTnews Follow us on Twitter http://twitter.com/RT_com Follow us on Instagram http://instagram.com/rt Follow us on Google+ http://plus.google.com/+RT Listen to us on Soundcloud: https://soundcloud.com/r... 10 Things to do in Zagreb, Croatia Travel Guide Join us we visit Zagreb, Croatia in this travel guide covering some of the top attractions and best things to do in the city. With a great food scene, plenty of... Join us we visit Zagreb, Croatia in this travel guide covering some of the top attractions and best things to do in the city. With a great food scene, plenty of green spaces and a charming historic core (Gornji Grad) you'll soon find out what makes Zagreb an underrated capital to visit. 10 Things to do in Zagreb City Tour | CroatiaTravelGuide: (Hrvatska) Intro - 00:01 1) Markets and Ban Josip Jelačić Square (Zagreb Central Market - Dolac Market) - 00:35 2) Zagreb Cathedral (Zagrebačka katedrala) - 02:14 3) RestaurantStreet in the Upper Town (Tkalčićeva Street) - 03:11 4) Museum of Broken Relationships (Muzej prekinutih veza) - 03:40 5) Church of St. Mark (Crkva sv. Marka) - 04:41 6) PromenadeViews Upper Town in Zagreb - 05:45 7) StoneGate in Zagreb (Kamenita Vrata) - 06:19 8) EatingCroatianFood (Truffles) in a Fotic Restaurant in Zagreb - 06:55 9) Zagreb 360 for views of Zagreb, Croatia - 10:31 10) Lenuci’s Horseshoe - 11:45 *Bonus* Ice Hockey game watching Medveščak Zagreb - 13:28 Outro - 14:07 GEAR WE USEPanasonicGH5: http://amzn.to/2yqTUyi Canon G7X ii: http://amzn.to/2yqtM6B Rode VideoMicro: http://amzn.to/2wTguTM Joby Gorilla Pod: http://amzn.to/1PgoY5F SanDisk 16GB Extreme Pro: http://amzn.to/25KEErs SOCIAL MEDIA & TRAVEL BLOGS AUDREY: blog: http://thatbackpacker.com/ instagram: https://www.instagram.com/thatbackpacker/ facebook: https://www.facebook.com/thatbackpacker twitter: https://twitter.com/ThatBackpacker SAMUEL: blog: http://nomadicsamuel.com/ facebook: https://www.facebook.com/nomadicsamuel twitter: https://twitter.com/NomadicSamuel instagram: https://www.instagram.com/nomadicsamuel/ Our visit Zagreb travel guide documentary covers some of the top attractions including a food guide (Croatian), top sightseeing tourist attractions and the city by day including visiting churches, parks, the old town, quirky neighborhoods, museums and a hockey game. We also cover off-the-beaten-path outdoor activities you won't find in a typical Zagreb tourism brochure, Zagreb itinerary or Zagreb, Croatia city tour also known as Zagreb, Hrvatska. 10 Things to do in Zagreb, Croatia Travel Guide Video Transcript: Our travels in Croatia brought us to Zagreb known for its lively street markets, vast green spaces, and varied architecture that spans numerous movements, we reached the capital and hit the ground running. In this video we’re going to show you some fun things to do in Zagreb, as well as share our favourite place for sampling the most delicious truffle dishes: From the main square you have the FlowerMarket, and if you head up the steps, that leads to Zagreb’s Central Market. Zagreb Cathedral is one the city’s main landmarks. This is the largest sacral building in the Gothic style southeast of the Alps, and it’s pretty easy to spot the spires wherever you are in the city. Our walk through the Upper Town eventually lead us to Tkalčićeva. These days you’ll find a lively street lined with restaurants, cafes and bars. We reached what may be the most memorable museum in the whole world: The Museum of BrokenRelationships. The museum is a global crowd-sourced project that deals with heartbreak. Inside you’ll find curious objects with a corresponding story. St. Mark’s Church bears the medieval coat of arms of Croatia, Dalmatia and Slavonia on the left-hand side, and the emblem of Zagreb on the right. To enjoy city views of the Lower Town there are some great vantage points along the promenade. On our way down from the Upper Town, we walked through Zagreb’s famed Stone Gate. Once the eastern gate into the medieval settlement now houses a small chapel. Let’s take a break from all the sightseeing to introduce you to one of our favourite restaurants in Zagreb when it comes to truffle dishes And craving more views of the city, we then went up Zagreb 360. Known as the Green Horseshoe, this park was named after Milan Lenuci who came up with the idea of creating connected green spaces right in the downtown. The horseshoe is home to several museums, galleries and archives. If you’re into hockey and you visit Zagreb during the season, you can catch a game in the city. We watched Medveščak Zagreb play. And that’s it for our visit to Zagreb! We hope you enjoyed this travel guide and that you got a few ideas of things to see, eat and do on your own visit. This is part of our Travel in Croatia video series showcasing Croatian food, Croatian culture and Croatian cuisine. This is part of our Travel in the Balkans video series showcasing Balkan food, Balkan culture and Balkan cuisine. Music by Lakey Inspired: https://soundcloud.com/lakeyinspired Join us we visit Zagreb, Croatia in this travel guide covering some of the top attractions and best things to do in the city. With a great food scene, plenty of green spaces and a charming historic core (Gornji Grad) you'll soon find out what makes Zagreb an underrated capital to visit. 10 Things to do in Zagreb City Tour | CroatiaTravelGuide: (Hrvatska) Intro - 00:01 1) Markets and Ban Josip Jelačić Square (Zagreb Central Market - Dolac Market) - 00:35 2) Zagreb Cathedral (Zagrebačka katedrala) - 02:14 3) RestaurantStreet in the Upper Town (Tkalčićeva Street) - 03:11 4) Museum of Broken Relationships (Muzej prekinutih veza) - 03:40 5) Church of St. Mark (Crkva sv. Marka) - 04:41 6) PromenadeViews Upper Town in Zagreb - 05:45 7) StoneGate in Zagreb (Kamenita Vrata) - 06:19 8) EatingCroatianFood (Truffles) in a Fotic Restaurant in Zagreb - 06:55 9) Zagreb 360 for views of Zagreb, Croatia - 10:31 10) Lenuci’s Horseshoe - 11:45 *Bonus* Ice Hockey game watching Medveščak Zagreb - 13:28 Outro - 14:07 GEAR WE USEPanasonicGH5: http://amzn.to/2yqTUyi Canon G7X ii: http://amzn.to/2yqtM6B Rode VideoMicro: http://amzn.to/2wTguTM Joby Gorilla Pod: http://amzn.to/1PgoY5F SanDisk 16GB Extreme Pro: http://amzn.to/25KEErs SOCIAL MEDIA & TRAVEL BLOGS AUDREY: blog: http://thatbackpacker.com/ instagram: https://www.instagram.com/thatbackpacker/ facebook: https://www.facebook.com/thatbackpacker twitter: https://twitter.com/ThatBackpacker SAMUEL: blog: http://nomadicsamuel.com/ facebook: https://www.facebook.com/nomadicsamuel twitter: https://twitter.com/NomadicSamuel instagram: https://www.instagram.com/nomadicsamuel/ Our visit Zagreb travel guide documentary covers some of the top attractions including a food guide (Croatian), top sightseeing tourist attractions and the city by day including visiting churches, parks, the old town, quirky neighborhoods, museums and a hockey game. We also cover off-the-beaten-path outdoor activities you won't find in a typical Zagreb tourism brochure, Zagreb itinerary or Zagreb, Croatia city tour also known as Zagreb, Hrvatska. 10 Things to do in Zagreb, Croatia Travel Guide Video Transcript: Our travels in Croatia brought us to Zagreb known for its lively street markets, vast green spaces, and varied architecture that spans numerous movements, we reached the capital and hit the ground running. In this video we’re going to show you some fun things to do in Zagreb, as well as share our favourite place for sampling the most delicious truffle dishes: From the main square you have the FlowerMarket, and if you head up the steps, that leads to Zagreb’s Central Market. Zagreb Cathedral is one the city’s main landmarks. This is the largest sacral building in the Gothic style southeast of the Alps, and it’s pretty easy to spot the spires wherever you are in the city. Our walk through the Upper Town eventually lead us to Tkalčićeva. These days you’ll find a lively street lined with restaurants, cafes and bars. We reached what may be the most memorable museum in the whole world: The Museum of BrokenRelationships. The museum is a global crowd-sourced project that deals with heartbreak. Inside you’ll find curious objects with a corresponding story. St. Mark’s Church bears the medieval coat of arms of Croatia, Dalmatia and Slavonia on the left-hand side, and the emblem of Zagreb on the right. To enjoy city views of the Lower Town there are some great vantage points along the promenade. On our way down from the Upper Town, we walked through Zagreb’s famed Stone Gate. Once the eastern gate into the medieval settlement now houses a small chapel. Let’s take a break from all the sightseeing to introduce you to one of our favourite restaurants in Zagreb when it comes to truffle dishes And craving more views of the city, we then went up Zagreb 360. Known as the Green Horseshoe, this park was named after Milan Lenuci who came up with the idea of creating connected green spaces right in the downtown. The horseshoe is home to several museums, galleries and archives. If you’re into hockey and you visit Zagreb during the season, you can catch a game in the city. We watched Medveščak Zagreb play. And that’s it for our visit to Zagreb! We hope you enjoyed this travel guide and that you got a few ideas of things to see, eat and do on your own visit. This is part of our Travel in Croatia video series showcasing Croatian food, Croatian culture and Croatian cuisine. This is part of our Travel in the Balkans video series showcasing Balkan food, Balkan culture and Balkan cuisine. Music by Lakey Inspired: https://soundcloud.com/lakeyinspired Lisbon Vacation Travel Guide | Expedia https://www.expedia.com/Lisbon-District.d178278.Destination-Travel-Guides From its days as a Phoenician outpost to its expansion into a 16th century trading gi... https://www.expedia.com/Lisbon-District.d178278.Destination-Travel-Guides From its days as a Phoenician outpost to its expansion into a 16th century trading giant, from the GreatEarthquake of 1755 to its glorious reconstruction, Lisbon has long been a city of shifting fortunes. Lisbon has forever been linked to the sea and it’s on the waterfront where you’ll find the city’s grand gateway, Praça do Comércio. Pass beneath the triumphal arch, a tribute to the city’s reconstruction, and drift down Rua Augusta to another of Lisbon’s great squares, the Rossio. Climb aboard Tram 28, which passes some of the city’s most iconic sights, then climb the battlements of Castelo de São Jorge to see the red tiled roofs of Lisbon spread out before you. Although the Great Earthquake reduced much of Lisbon to rubble, the ancient suburb of Alfama was spared. Lose yourself amid the cobblestones, where cafes, bars and artisan shops have taken residence in the dockworkers homes of old. As the sun gets low, join locals in a fado bar to hear heartrending songs of the working class. 20 miles west of the city is Cascais, a sleepy fishing village until Lisbon’s nobility discovered its golden bays in the late 1800s. Another playground for Portugal’s Monarchs was Sintra, which Hans Christian Andersen called the most beautiful place in Portugal. After Sintra, spend a few days exploring some of Europe’s most beautiful beaches, such as Praia das Maçãs, Adraga and Ursa. At Cape Roca, stand upon the clifftop, which until the 14th century was considered the end of the world. https://www.expedia.com/Lisbon-District.d178278.Destination-Travel-Guides From its days as a Phoenician outpost to its expansion into a 16th century trading giant, from the GreatEarthquake of 1755 to its glorious reconstruction, Lisbon has long been a city of shifting fortunes. Lisbon has forever been linked to the sea and it’s on the waterfront where you’ll find the city’s grand gateway, Praça do Comércio. Pass beneath the triumphal arch, a tribute to the city’s reconstruction, and drift down Rua Augusta to another of Lisbon’s great squares, the Rossio. Climb aboard Tram 28, which passes some of the city’s most iconic sights, then climb the battlements of Castelo de São Jorge to see the red tiled roofs of Lisbon spread out before you. Although the Great Earthquake reduced much of Lisbon to rubble, the ancient suburb of Alfama was spared. Lose yourself amid the cobblestones, where cafes, bars and artisan shops have taken residence in the dockworkers homes of old. As the sun gets low, join locals in a fado bar to hear heartrending songs of the working class. 20 miles west of the city is Cascais, a sleepy fishing village until Lisbon’s nobility discovered its golden bays in the late 1800s. Another playground for Portugal’s Monarchs was Sintra, which Hans Christian Andersen called the most beautiful place in Portugal. After Sintra, spend a few days exploring some of Europe’s most beautiful beaches, such as Praia das Maçãs, Adraga and Ursa. At Cape Roca, stand upon the clifftop, which until the 14th century was considered the end of the world. What Do the UN and NATO Actually Do? Acronyms like NATO, the EU, and UNICEF are everywhere in the news and it can be hard keeping them all straight. What do each of these organizations do? Here’s o... Acronyms like NATO, the EU, and UNICEF are everywhere in the news and it can be hard keeping them all straight. What do each of these organizations do? Here’s our guide to decoding the alphabet soup of world organizations. Acronyms like NATO, the EU, and UNICEF are everywhere in the news and it can be hard keeping them all straight. What do each of these organizations do? Here’s our guide to decoding the alphabet soup of world organizations. 10 Things to do in Ljubljana, Slovenia Travel Guide Join as we visit Ljubljana, Slovenia in this travel guide covering some of the best things to do in the city including highlighting the local food and restauran... Join as we visit Ljubljana, Slovenia in this travel guide covering some of the best things to do in the city including highlighting the local food and restaurant scene, museums worth visiting, the old town, castle, quirky neighborhoods and more. With a week in Ljubljana, Slovenia we had plenty of time to cover the main attractions in the city along with take some day trips. If you're thinking of visiting a weekend would be enough time for a busy trip but 3-4 days or longer would be more ideal for slower exploration. Now let's explore the capital city of Slovenia together! 10 Things to do in LjubljanaCity Tour | Slovenia TravelGuide:'(Slovenija) Introduction to Ljubljana - 00:01 1) Old Town of Ljubljana at Prešeren Square (Prešernov trg) + Franciscan Church (Frančiškanska cerkev) - 00:39 2) Bridges of Ljubljana = Triple Bridge (Tromostovje) + LoveLockBridge (Mesarski most) + Dragon Bridge (Zmajski most) - 00:46 3) Ljubljana Central Market (Osrednja ljubljanska tržnica) + Ljubljana Cathedral (ljubljanska stolnica) - 02:59 4) SlovenianFood at Allegria restaurant in Ljubljana - 03:57 5) Ljubljana Castle (Ljubljanski grad - Laibacher Schloss) on Castle Hill - 04:24 6) RiverCruise on the Ljubljanica River + Ice Cream (Cacao) - 06:54 7) Metelkova for street art in Ljubljana - 09:14 8) BalkanFood samplingBosnianCuisine at restaurant Sarajevo 84 - 10:43 9) Galleries and Museums Ljubljana including The National Gallery of Slovenia (Narodna galerija), the Museum of Modern Art (Moderna galerija), and the National Museum of Slovenia (Narodni muzej Slovenije) - 11:12 10) Tivoli City ParkGardens (Mestni park Tivoli) - 11:39 Outro to Ljubljana- 12:01 GEAR WE USEPanasonicGH5: http://amzn.to/2yqTUyi Canon G7X ii: http://amzn.to/2yqtM6B Rode VideoMicro: http://amzn.to/2wTguTM Joby Gorilla Pod: http://amzn.to/1PgoY5F SanDisk 16GB Extreme Pro: http://amzn.to/25KEErs Our visit Ljubljana travel guide documentary covers some of the top attractions including a food guide (Slovene, Balkan and Bosnian), top sightseeing tourist attractions and the city by day including visiting castles, churches, the old town, quirky neighborhoods, museums and along the river. We also cover off-the-beaten-path outdoor activities you won't find in a typical Ljubljana tourism brochure, Ljubljana itinerary or Ljubljana, Slovenia city tour also known as Laibach. 10 Things to do in Ljubljana, Slovenia Travel Guide Video Transcript: Prešeren Square is a central meeting spot in the heart of the Old Town, so it made sense to start our tour of Ljubljana here. You’ll find the Franciscan Church of the Annunciation, lots of gelato shops, and the baffling bridge we just mentioned. As for the reasoning behind the Triple Bridge and the famed dragon bridge, which is guarded by four dragons. Ljubljana’s Central Market is another spot worth checking out. We needed to sample some Slovenian food so we went to Allegria. Sam ordered Zlikrofi (zhlee-krofi), a Slovenian dumpling stuffed with potato + lamb goulash along with Slovenian sausage with cabbage & potatoes. Ljubljana Castle, which sits on Castle Hill overlooking the city. Built as a medieval fortress in the 11th century, Ljubljana Castle has seen many redesigns and renovations. Climb the Outlook Tower for 360 degree views of the city. There are departures for cruises down the Ljubljanica. We boarded a cruise directly underneath the Love Lock Bridge, which is actually called Mesarski Most. It was our favourite activity in Ljubljana and it was a super relaxed way to watch the city. Metelkova is home to the best street art. One place we really enjoyed was Sarajevo 84, a restaurant specializing in Balkan cuisine. The portions massive & everything we ordered was delicious. We had a feast featuring: grilled meat with pita and onions, baked beans and sausage, roasted peppers, and a flaky pastry stuffed with cheese. It only came to 23 Euros. Speaking of galleries and museums, a few you’ll find include: the National Gallery, the Museum of Modern Art, and the National Museum of Slovenia. We finished off at Tivoli, which is the largest park in Ljubljana. And that’s it for our time in Ljubljana. Our visit was short, tasty, and relaxing, and we’re really glad we made some time to visit this underrated capital. Now you guys know the drill; if there are any other things to do in Ljubljana that we may have missed in this travel guide, feel free to share your suggestions with fellow travellers below. This is part of our Travel in Slovenia video series showcasing Slovenian food, Slovenian culture and Slovenian cuisine. Music by Ikson: https://soundcloud.com/ikson Join as we visit Ljubljana, Slovenia in this travel guide covering some of the best things to do in the city including highlighting the local food and restaurant scene, museums worth visiting, the old town, castle, quirky neighborhoods and more. With a week in Ljubljana, Slovenia we had plenty of time to cover the main attractions in the city along with take some day trips. If you're thinking of visiting a weekend would be enough time for a busy trip but 3-4 days or longer would be more ideal for slower exploration. Now let's explore the capital city of Slovenia together! 10 Things to do in LjubljanaCity Tour | Slovenia TravelGuide:'(Slovenija) Introduction to Ljubljana - 00:01 1) Old Town of Ljubljana at Prešeren Square (Prešernov trg) + Franciscan Church (Frančiškanska cerkev) - 00:39 2) Bridges of Ljubljana = Triple Bridge (Tromostovje) + LoveLockBridge (Mesarski most) + Dragon Bridge (Zmajski most) - 00:46 3) Ljubljana Central Market (Osrednja ljubljanska tržnica) + Ljubljana Cathedral (ljubljanska stolnica) - 02:59 4) SlovenianFood at Allegria restaurant in Ljubljana - 03:57 5) Ljubljana Castle (Ljubljanski grad - Laibacher Schloss) on Castle Hill - 04:24 6) RiverCruise on the Ljubljanica River + Ice Cream (Cacao) - 06:54 7) Metelkova for street art in Ljubljana - 09:14 8) BalkanFood samplingBosnianCuisine at restaurant Sarajevo 84 - 10:43 9) Galleries and Museums Ljubljana including The National Gallery of Slovenia (Narodna galerija), the Museum of Modern Art (Moderna galerija), and the National Museum of Slovenia (Narodni muzej Slovenije) - 11:12 10) Tivoli City ParkGardens (Mestni park Tivoli) - 11:39 Outro to Ljubljana- 12:01 GEAR WE USEPanasonicGH5: http://amzn.to/2yqTUyi Canon G7X ii: http://amzn.to/2yqtM6B Rode VideoMicro: http://amzn.to/2wTguTM Joby Gorilla Pod: http://amzn.to/1PgoY5F SanDisk 16GB Extreme Pro: http://amzn.to/25KEErs Our visit Ljubljana travel guide documentary covers some of the top attractions including a food guide (Slovene, Balkan and Bosnian), top sightseeing tourist attractions and the city by day including visiting castles, churches, the old town, quirky neighborhoods, museums and along the river. We also cover off-the-beaten-path outdoor activities you won't find in a typical Ljubljana tourism brochure, Ljubljana itinerary or Ljubljana, Slovenia city tour also known as Laibach. 10 Things to do in Ljubljana, Slovenia Travel Guide Video Transcript: Prešeren Square is a central meeting spot in the heart of the Old Town, so it made sense to start our tour of Ljubljana here. You’ll find the Franciscan Church of the Annunciation, lots of gelato shops, and the baffling bridge we just mentioned. As for the reasoning behind the Triple Bridge and the famed dragon bridge, which is guarded by four dragons. Ljubljana’s Central Market is another spot worth checking out. We needed to sample some Slovenian food so we went to Allegria. Sam ordered Zlikrofi (zhlee-krofi), a Slovenian dumpling stuffed with potato + lamb goulash along with Slovenian sausage with cabbage & potatoes. Ljubljana Castle, which sits on Castle Hill overlooking the city. Built as a medieval fortress in the 11th century, Ljubljana Castle has seen many redesigns and renovations. Climb the Outlook Tower for 360 degree views of the city. There are departures for cruises down the Ljubljanica. We boarded a cruise directly underneath the Love Lock Bridge, which is actually called Mesarski Most. It was our favourite activity in Ljubljana and it was a super relaxed way to watch the city. Metelkova is home to the best street art. One place we really enjoyed was Sarajevo 84, a restaurant specializing in Balkan cuisine. The portions massive & everything we ordered was delicious. We had a feast featuring: grilled meat with pita and onions, baked beans and sausage, roasted peppers, and a flaky pastry stuffed with cheese. It only came to 23 Euros. Speaking of galleries and museums, a few you’ll find include: the National Gallery, the Museum of Modern Art, and the National Museum of Slovenia. We finished off at Tivoli, which is the largest park in Ljubljana. And that’s it for our time in Ljubljana. Our visit was short, tasty, and relaxing, and we’re really glad we made some time to visit this underrated capital. Now you guys know the drill; if there are any other things to do in Ljubljana that we may have missed in this travel guide, feel free to share your suggestions with fellow travellers below. This is part of our Travel in Slovenia video series showcasing Slovenian food, Slovenian culture and Slovenian cuisine. Music by Ikson: https://soundcloud.com/ikson Join us as we visit LakeBled in this travel guide as a day trip from Ljubljana, Slovenia where we cover the top things to do in Lake Bled including visiting the castle by foot and island by boat trip. Just slightly over an hour by bus and roughly 45 minutes by car Lake Bled is easily accessible from Ljubljana. With most attractions clustered around the lake a perfect way to spend a day visiting Lake Bled is to walk around the lake, visit Bled Castle, eat local cake and have a leisurely lunch along with taking a boat trip out to the island. All of this can be done in a day allowing you to return to Ljubljana in the early evening. Let's find out what makes Lake Bled one of the most popular day trips for visitors traveling in Slovenia. Lake Bled in other languages: Slovenian: blejsko jezero - blejski grad - blejski otok German: bleder see - veldeser see - burg veldes GEAR WE USEPanasonicGH5: http://amzn.to/2yqTUyi Canon G7X ii: http://amzn.to/2yqtM6B Rode VideoMicro: http://amzn.to/2wTguTM Joby Gorilla Pod: http://amzn.to/1PgoY5F SanDisk 16GB Extreme Pro: http://amzn.to/25KEErs SOCIAL MEDIA & TRAVEL BLOGS AUDREY: blog: http://thatbackpacker.com/ instagram: https://www.instagram.com/thatbackpacker/ facebook: https://www.facebook.com/thatbackpacker twitter: https://twitter.com/ThatBackpacker SAMUEL: blog: http://nomadicsamuel.com/ facebook: https://www.facebook.com/nomadicsamuel twitter: https://twitter.com/NomadicSamuel instagram: https://www.instagram.com/nomadicsamuel/ Lake Bled TravelGuide | Day Trip from Ljubljana, Slovenia Video Transcript: Lake Bled is probably the most popular day trip you can take from Ljubljana. This is a lake that sits on the Julian Alps, and in the middle of the lake you have a small island with a church - it’s about as picturesque as it gets and it draws massive crowds, but first, the journey there. Bled Castle is a medieval castle that was built on a cliff rising 130 meters over Lake Bled. According to written sources, this is the oldest castle in Slovenia, first being mentioned in a document from the year 1011. The castle is set up around two courtyards which are connected with a staircase. Once you’re there, you can visit the chapel, check out some of the exhibits, watch a demonstration at the castle forge, or eat at the castle coffee shop or restaurant. After the castle visit, we hiked back down and started our walk along Lake Bled because we were still feeling pretty stuffed from lunch. Little did we know this would take us several hours to complete. After eating our slice of Bled CreamCake, or Kremsnita, it was finally time to arrange a boat ride to Bled Island. While you can rent your own row boat to take out on the island, we chose to pay the 14 Euros per person to have someone else do the hard work. However, if you’re with a group of friends or travelling with family, it’s definitely cheaper to just rent a boat and row it yourself. Bled Island is very small and it got pretty crowded even though it was low season. Forty minutes turned out to be plenty of time to climb up, have a look around, and enjoy some ice cream. Now one last piece of advice: we visited in the off-season and at the end of the day, we found out there were not enough buses to transport everyone from Lake Bled back to Ljubljana. We weren’t able to get on one bus because it was full, so we waited an hour and a half for the next one. By then, more day-trippers like us had gathered, and once again, not everyone could get on the bus, leaving a lot of people stranded, having to find a taxi or other alternative. There was a lot of pushing and shoving, and many visitors with prepaid tickets were visibly upset. Because our bus was full, this also meant that even though there were several scheduled stops on the way back to Ljubljana, we couldn’t pick up any passengers along the way, many of them who had been waiting for hours. Lake Bled has experienced a boom in tourism, but the infrastructure to transport people hasn’t quite caught up yet. After a nice day visiting Bled, getting out of there proved to be very chaotic and stressful. Hopefully things will change in the future, but until then, know that leaving at the end can be tricky. This is part of our Travel in Slovenia video series showcasing Slovenian food, Slovenian culture and Slovenian cuisine. Music by NGL: https://soundcloud.com/itsnglmusic Join us as we visit LakeBled in this travel guide as a day trip from Ljubljana, Slovenia where we cover the top things to do in Lake Bled including visiting the castle by foot and island by boat trip. Just slightly over an hour by bus and roughly 45 minutes by car Lake Bled is easily accessible from Ljubljana. With most attractions clustered around the lake a perfect way to spend a day visiting Lake Bled is to walk around the lake, visit Bled Castle, eat local cake and have a leisurely lunch along with taking a boat trip out to the island. All of this can be done in a day allowing you to return to Ljubljana in the early evening. Let's find out what makes Lake Bled one of the most popular day trips for visitors traveling in Slovenia. Lake Bled in other languages: Slovenian: blejsko jezero - blejski grad - blejski otok German: bleder see - veldeser see - burg veldes GEAR WE USEPanasonicGH5: http://amzn.to/2yqTUyi Canon G7X ii: http://amzn.to/2yqtM6B Rode VideoMicro: http://amzn.to/2wTguTM Joby Gorilla Pod: http://amzn.to/1PgoY5F SanDisk 16GB Extreme Pro: http://amzn.to/25KEErs SOCIAL MEDIA & TRAVEL BLOGS AUDREY: blog: http://thatbackpacker.com/ instagram: https://www.instagram.com/thatbackpacker/ facebook: https://www.facebook.com/thatbackpacker twitter: https://twitter.com/ThatBackpacker SAMUEL: blog: http://nomadicsamuel.com/ facebook: https://www.facebook.com/nomadicsamuel twitter: https://twitter.com/NomadicSamuel instagram: https://www.instagram.com/nomadicsamuel/ Lake Bled TravelGuide | Day Trip from Ljubljana, Slovenia Video Transcript: Lake Bled is probably the most popular day trip you can take from Ljubljana. This is a lake that sits on the Julian Alps, and in the middle of the lake you have a small island with a church - it’s about as picturesque as it gets and it draws massive crowds, but first, the journey there. Bled Castle is a medieval castle that was built on a cliff rising 130 meters over Lake Bled. According to written sources, this is the oldest castle in Slovenia, first being mentioned in a document from the year 1011. The castle is set up around two courtyards which are connected with a staircase. Once you’re there, you can visit the chapel, check out some of the exhibits, watch a demonstration at the castle forge, or eat at the castle coffee shop or restaurant. After the castle visit, we hiked back down and started our walk along Lake Bled because we were still feeling pretty stuffed from lunch. Little did we know this would take us several hours to complete. After eating our slice of Bled CreamCake, or Kremsnita, it was finally time to arrange a boat ride to Bled Island. While you can rent your own row boat to take out on the island, we chose to pay the 14 Euros per person to have someone else do the hard work. However, if you’re with a group of friends or travelling with family, it’s definitely cheaper to just rent a boat and row it yourself. Bled Island is very small and it got pretty crowded even though it was low season. Forty minutes turned out to be plenty of time to climb up, have a look around, and enjoy some ice cream. Now one last piece of advice: we visited in the off-season and at the end of the day, we found out there were not enough buses to transport everyone from Lake Bled back to Ljubljana. We weren’t able to get on one bus because it was full, so we waited an hour and a half for the next one. By then, more day-trippers like us had gathered, and once again, not everyone could get on the bus, leaving a lot of people stranded, having to find a taxi or other alternative. There was a lot of pushing and shoving, and many visitors with prepaid tickets were visibly upset. Because our bus was full, this also meant that even though there were several scheduled stops on the way back to Ljubljana, we couldn’t pick up any passengers along the way, many of them who had been waiting for hours. Lake Bled has experienced a boom in tourism, but the infrastructure to transport people hasn’t quite caught up yet. After a nice day visiting Bled, getting out of there proved to be very chaotic and stressful. Hopefully things will change in the future, but until then, know that leaving at the end can be tricky. This is part of our Travel in Slovenia video series showcasing Slovenian food, Slovenian culture and Slovenian cuisine. Music by NGL: https://soundcloud.com/itsnglmusic 15 years after hosting Europe's ugliest civil war since the Holocaust, VICE takes a road trip across the remnants of Old Yugoslavia. Watch more VICE documentaries here: http://bit.ly/VICE-Documentaries While most of us were still hung up on grunge, the republics of the former Yugoslavia spent the early 90s hung up on seceding into their own countries and mass-murdering people over infinitesimal ethnic differences. And the mid 90s. And the late 90s. To commemorate 12 years without a major attempted genocide, we decided to rent a Yugo and take a road trip through the Balkans to see what's going on and try to wrap our thinkers around what was up with all that ethnic cleansin'. Our first stop: A nostalgic amusement park in northern Serbia that recreates Marshall Tito's Socialist Federal Republic of Yugoslavia with startling accuracy and grimness. Watch the rest here! Part 1/5: http://bit.ly/Balkans-1 Part 2/5: http://bit.ly/Balkans-2 Part 3/5: http://bit.ly/Balkans-3 Part 4/5: http://bit.ly/Balkans-4 Part 5/5: http://bit.ly/Balkans-5 FollowThomas on Twitter - http://twitter.com/Babyballs69 ** Subscribe for videos that are actually good: http://bit.ly/Subscribe-to-VICE Check out our full video catalog: http://www.youtube.com/user/vice/videos Videos, daily editorial and more: http://vice.com Like VICE on Facebook: http://fb.com/vice Follow VICE on Twitter: http://twitter.com/vice Read our tumblr: http://vicemag.tumblr.com 15 years after hosting Europe's ugliest civil war since the Holocaust, VICE takes a road trip across the remnants of Old Yugoslavia. Watch more VICE documentaries here: http://bit.ly/VICE-Documentaries While most of us were still hung up on grunge, the republics of the former Yugoslavia spent the early 90s hung up on seceding into their own countries and mass-murdering people over infinitesimal ethnic differences. And the mid 90s. And the late 90s. To commemorate 12 years without a major attempted genocide, we decided to rent a Yugo and take a road trip through the Balkans to see what's going on and try to wrap our thinkers around what was up with all that ethnic cleansin'. Our first stop: A nostalgic amusement park in northern Serbia that recreates Marshall Tito's Socialist Federal Republic of Yugoslavia with startling accuracy and grimness. Watch the rest here! Part 1/5: http://bit.ly/Balkans-1 Part 2/5: http://bit.ly/Balkans-2 Part 3/5: http://bit.ly/Balkans-3 Part 4/5: http://bit.ly/Balkans-4 Part 5/5: http://bit.ly/Balkans-5 FollowThomas on Twitter - http://twitter.com/Babyballs69 ** Subscribe for videos that are actually good: http://bit.ly/Subscribe-to-VICE Check out our full video catalog: http://www.youtube.com/user/vice/videos Videos, daily editorial and more: http://vice.com Like VICE on Facebook: http://fb.com/vice Follow VICE on Twitter: http://twitter.com/vice Read our tumblr: http://vicemag.tumblr.com Montenegro is in the process of joining NATO. The country was invited to join the NATO Membership Action Plan in December 2009. At a meeting of the NATO foreign ministers on 2 December2015, the Allies invited the country to start accession talks to join the Alliance. Montenegro actively supported the NATO-led operation in Afghanistan from 2010 to the end of 2014 and is now supporting the follow-on mission to train, advise and assist the Afghan security forces. ▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬ SUBSCRIBE to this channel http://bit.ly/NATOsubscribe SUBSCRIBE to NATO News http://bit.ly/NATONewsSubscribe SUBSCRIBE to NATO History http://bit.ly/NATOHistorySubscribe Connect with NATO online: Visit the Official NATO Homepage: http://bit.ly/NATOhomepage Find NATO on FACEBOOK: http://bit.ly/NATOfacebook Follow @NATO on TWITTER: http://bit.ly/NATOtwitter Follow NATO on Instagram: http://bit.ly/NATOinstagram Find NATO on Google+: http://bit.ly/NATOgoogleplus Find NATO on LinkedIn: http://bit.ly/NATOlinkedin Find NATO on Flickr: http://bit.ly/NATOflickr Montenegro is in the process of joining NATO. The country was invited to join the NATO Membership Action Plan in December 2009. At a meeting of the NATO foreign ministers on 2 December2015, the Allies invited the country to start accession talks to join the Alliance. Montenegro actively supported the NATO-led operation in Afghanistan from 2010 to the end of 2014 and is now supporting the follow-on mission to train, advise and assist the Afghan security forces. ▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬ SUBSCRIBE to this channel http://bit.ly/NATOsubscribe SUBSCRIBE to NATO News http://bit.ly/NATONewsSubscribe SUBSCRIBE to NATO History http://bit.ly/NATOHistorySubscribe Connect with NATO online: Visit the Official NATO Homepage: http://bit.ly/NATOhomepage Find NATO on FACEBOOK: http://bit.ly/NATOfacebook Follow @NATO on TWITTER: http://bit.ly/NATOtwitter Follow NATO on Instagram: http://bit.ly/NATOinstagram Find NATO on Google+: http://bit.ly/NATOgoogleplus Find NATO on LinkedIn: http://bit.ly/NATOlinkedin Find NATO on Flickr: http://bit.ly/NATOflickr http://www.expedia.com/Buenos-Aires.d178242.Destination-Travel-Guides Named for good sailing winds, Buenos Aires is the capital of Argentina, and home to nearly a quarter of the country’s two million residents. Come for the stunning European architecture, and stay for delicious cuts of meat, the city’s zest for soccer, and, of course, the tango. “The Paris of South America” boasts outstanding shopping and a friendly populace. A tour of Buenos Aires should cut through La BocaHarbor, where you’ll find numerous street vendors, restaurants, and street dancers willing to give you a spin. Wander down the streets to take in colorful artwork, and make a game out of asking the locals what neighborhood you should tour next. Here’s a hint: with so much to see, everyone will give you a different answer! Some will tell you to visit San Telmo for souvenirs, patio shopping, and crumbling historical buildings. Others will suggest Puerto Madero, a refurbished shipping port that boasts a mixture of old-world glamour and modern buildings. What everyone will suggest, however, is a stop by Plaza de Mayo. There you can take in the rosy architecture of the Casa Rosada, which was made famous by ArgentineFirst LadyEva Peron and the musical about her life, “Evita.” Take a tour and learn about her life, from her humble beginnings to her rise to power. Cap off your Buenos Aires sightseeing with an evening walk through Puerto Madero, where you can get a late dinner and dance until the next day arrives. What do you want to see in Buenos Aires? Visit our Buenos Aires travel guide page for more information or to plan your next vacation! -------------------------------------------------------------------------------------- Follow us on social media: Twitter: https://twitter.com/Expedia Facebook: https://www.facebook.com/expedia Instagram: http://instagram.com/expedia Pinterest: http://www.pinterest.com/Expedia/ Google+: https://plus.google.com/+Expedia -------------------------------------------------------------------------------------- Follow us on our travel blog, Viewfinder: http://viewfinder.expedia.com/ http://www.expedia.com/Buenos-Aires.d178242.Destination-Travel-Guides Named for good sailing winds, Buenos Aires is the capital of Argentina, and home to nearly a quarter of the country’s two million residents. Come for the stunning European architecture, and stay for delicious cuts of meat, the city’s zest for soccer, and, of course, the tango. “The Paris of South America” boasts outstanding shopping and a friendly populace. A tour of Buenos Aires should cut through La BocaHarbor, where you’ll find numerous street vendors, restaurants, and street dancers willing to give you a spin. Wander down the streets to take in colorful artwork, and make a game out of asking the locals what neighborhood you should tour next. Here’s a hint: with so much to see, everyone will give you a different answer! Some will tell you to visit San Telmo for souvenirs, patio shopping, and crumbling historical buildings. Others will suggest Puerto Madero, a refurbished shipping port that boasts a mixture of old-world glamour and modern buildings. What everyone will suggest, however, is a stop by Plaza de Mayo. There you can take in the rosy architecture of the Casa Rosada, which was made famous by ArgentineFirst LadyEva Peron and the musical about her life, “Evita.” Take a tour and learn about her life, from her humble beginnings to her rise to power. Cap off your Buenos Aires sightseeing with an evening walk through Puerto Madero, where you can get a late dinner and dance until the next day arrives. What do you want to see in Buenos Aires? Visit our Buenos Aires travel guide page for more information or to plan your next vacation! -------------------------------------------------------------------------------------- Follow us on social media: Twitter: https://twitter.com/Expedia Facebook: https://www.facebook.com/expedia Instagram: http://instagram.com/expedia Pinterest: http://www.pinterest.com/Expedia/ Google+: https://plus.google.com/+Expedia -------------------------------------------------------------------------------------- Follow us on our travel blog, Viewfinder: http://viewfinder.expedia.com/ published:23 Jun 2014 views:936742 back Sea Breeze: Turkey joins war games along with 15 NATO countries off Ukraine coast A Turkish frigate, an amphibious ship, and a submarine entered the port of Odessa, Monday. They will take part in the international ‘Sea Breeze-2017’ drills. Th... A Turkish frigate, an amphibious ship, and a submarine entered the port of Odessa, Monday. They will take part in the international ‘Sea Breeze-2017’ drills. The frigate F241 Turgutreis and the NL 214 landing ship stood at the berth of the seaport, with a Batiray S349 submarine was moored nearby. READ MORE: https://on.rt.com/8hga COURTESY: RT's RUPTLY video agency, NO RE-UPLOAD, NO REUSE - FOR LICENSING, PLEASE, CONTACT http://ruptly.tv RT LIVE http://rt.com/on-air Subscribe to RT! http://www.youtube.com/subscription_center?add_user=RussiaToday Like us on Facebook http://www.facebook.com/RTnews Follow us on Twitter http://twitter.com/RT_com Follow us on Instagram http://instagram.com/rt Follow us on Google+ http://plus.google.com/+RT Listen to us on Soundcloud: https://soundcloud.com/rttv RT (Russia Today) is a global news network broadcasting from Moscow and Washington studios. RT is the first news channel to break the 1 billion YouTube views benchmark. A Turkish frigate, an amphibious ship, and a submarine entered the port of Odessa, Monday. They will take part in the international ‘Sea Breeze-2017’ drills. The frigate F241 Turgutreis and the NL 214 landing ship stood at the berth of the seaport, with a Batiray S349 submarine was moored nearby. READ MORE: https://on.rt.com/8hga COURTESY: RT's RUPTLY video agency, NO RE-UPLOAD, NO REUSE - FOR LICENSING, PLEASE, CONTACT http://ruptly.tv RT LIVE http://rt.com/on-air Subscribe to RT! http://www.youtube.com/subscription_center?add_user=RussiaToday Like us on Facebook http://www.facebook.com/RTnews Follow us on Twitter http://twitter.com/RT_com Follow us on Instagram http://instagram.com/rt Follow us on Google+ http://plus.google.com/+RT Listen to us on Soundcloud: https://soundcloud.com/rttv RT (Russia Today) is a global news network broadcasting from Moscow and Washington studios. RT is the first news channel to break the 1 billion YouTube views benchmark. Nato Gelashvili Naxvamdis Nato Gelashvili Mikvarxaro Dzalian Nato Gelashvili Satrfialo published: 10 Feb 2013 Nato Gelashvili Gvinos Davlev Salxinos published: 10 Feb 2013 Nato Gelashvili Shemiyvarda Erti Bichi published: 10 Feb 2013 Pierangelo Bertoli - È Nato Si Dice KARAOKE GUITAR REQUEST Google Plus: http://tinyurl.com/zyb3rql Facebook: http://tinyurl.com/h34uerc FAQ: http://tinyurl.com/zzmkndp Readme: Are you singer? This is just place for you. Will you record your voice in these covers? You'd record your voice with possible USB audio interface, for best audio quality. Contact me for possible collaborations or requests for other songs. You'd sing with your friends in possible night fest on these vids. If you record with a webcam or camcorder of mobile phone; please use the headphones, than give me your voice record without instrumental track. In every case you should use the headphones and give me your voice record without instrumental track and without effects. You can give me your voice record at this email address: vocaltracks@tiscali.it Or alternatively use Google D... Google Plus: http://tinyurl.com/zyb3rql Facebook: http://tinyurl.com/h34uerc FAQ: http://tinyurl.com/zzmkndp Readme: Are you singer? This is just place for you. Will you record your voice in these covers? You'd record your voice with possible USB audio interface, for best audio quality. Contact me for possible collaborations or requests for other songs. You'd sing with your friends in possible night fest on these vids. If you record with a webcam or camcorder of mobile phone; please use the headphones, than give me your voice record without instrumental track. In every case you should use the headphones and give me your voice record without instrumental track and without effects. You can give me your voice record at this email address: vocaltracks@tiscali.it Or alternatively use Google Drive, hence give me just one private message with the link. Google Plus: http://tinyurl.com/zyb3rql Facebook: http://tinyurl.com/h34uerc FAQ: http://tinyurl.com/zzmkndp Readme: Are you singer? This is just place for you. Will you record your voice in these covers? You'd record your voice with possible USB audio interface, for best audio quality. Contact me for possible collaborations or requests for other songs. You'd sing with your friends in possible night fest on these vids. If you record with a webcam or camcorder of mobile phone; please use the headphones, than give me your voice record without instrumental track. In every case you should use the headphones and give me your voice record without instrumental track and without effects. You can give me your voice record at this email address: vocaltracks@tiscali.it Or alternatively use Google Drive, hence give me just one private message with the link. NATO | 1 | Multiplayer - Supreme Ruler Ultimate / Cold War Patreon: https://www.patreon.com/user?u=2905473 Website: http://bundeswehrbob.com/ Twitter: https://www.twitter.com/rjc_foxtrot Discord: https://discord.gg/0nJRdMbZyDoGDGOn Subscribe for more! -------------------------------------------- Playlist: https://www.youtube.com/playlist?list=PL0S8dkG6ausDV2aRC3MJbIq-Do0bPsjQZ Supreme Ruler Ultimate is available on Steam: http://store.steampowered.com/app/314980/Supreme_Ruler_Ultimate/ Supreme Ruler Cold War is available on Steam: http://store.steampowered.com/app/73220/Supreme_Ruler_Cold_War/ I brought along some community members to play a game of Supreme Ruler Ultimate with me. We decided on a Cold War start, playing as NATO powers. UtariOnzo as the United Kingdom Nanaya as FranceOddball as the United States Bundeswehr Bob as Italy http... Op0r8durr - Anthony's MSW NATO Kit - Part 1 Finally! Rejoice plebians, papa Pariano's updated gear video has finally emerged! If you're looking for some good tips and tricks on packing for a MilSim West game, make sure to check this video out and get a detailed list of a MSW Cadre's walking around kit! Stay tuned for Part 2 of Anthony's MSW NATO gear video, where he'll show you all of his sustainment and survival gear that he uses to get through the tough 40 hour MSW events! The Amped Opor8durr GearSeries, where Amped employees and close friends of the shop show off all their gucci gear swag load outs and guns then explain why they do things the way they do. Make sure to get all your questions and comments in down below and we'll do our best to get them all answered! As always, remember to play honorably, call your hits and have ... Povijest NATO saveza - 1. dio Oddball Overviews - Episode 1 - NATO kit You guys took a vote and said you wanted my first video to be on my main loadout. So here it is. My page: https://www.facebook.com/FilthyAKcasual/ Knowledge bombers: https://www.youtube.com/user/BritishTang https://www.youtube.com/user/AmpedAirsoft Patches: http://www.snakehoundmachine.com/ https://weaponsgradewaifus.com/ https://woodpatchs.com/ Patreon: https://www.patreon.com/user?u=2905473 Website: http://bundeswehrbob.com/ Twitter: https://www.twitter.com/rjc_foxtrot Discord: https://discord.gg/0nJRdMbZyDoGDGOn Subscribe for more! -------------------------------------------- Playlist: https://www.youtube.com/playlist?list=PL0S8dkG6ausDV2aRC3MJbIq-Do0bPsjQZ Supreme Ruler Ultimate is available on Steam: http://store.steampowered.com/app/314980/Supreme_Ruler_Ultimate/ Supreme Ruler Cold War is available on Steam: http://store.steampowered.com/app/73220/Supreme_Ruler_Cold_War/ I brought along some community members to play a game of Supreme Ruler Ultimate with me. We decided on a Cold War start, playing as NATO powers. UtariOnzo as the United Kingdom Nanaya as FranceOddball as the United States Bundeswehr Bob as Italy http://battlegoat.com/ BattleGoat Studios is pleased to present Supreme Ruler Ultimate, the pinnacle of sixteen years of development on the Supreme Ruler series of Real Time Geo-Political Military StrategyGames for PC and Mac. Supreme Ruler Ultimate incorporates the stories, campaigns, scenarios, and features from our previous releases and expands on them in our improved game engine. Take control of any nation in the world from World War II through the Cold War and into the near future as our world lurches from one crisis to the next. Play historical or modern Campaigns with specific objectives, attempt one of the many Set-Piece Scenarios for a shorter game, or customize your game experience by picking any nation in the various era Sandboxes and choosing your own preferred VictoryCondition. With so many options to choose from, Supreme Ruler Ultimate provides virtually unlimited replayability! - Play Historical or Futuristic Campaigns. - Take Control of any Nation in SandboxMode and impact the outcome of an era. - Challenge yourself with Historical Scenarios for a faster-paced gameplay experience. - The butterfly effect...Influence the timeline and outcome of thousands of historical events. - Use Diplomacy, Trade, Espionage, and Intimidation to influence the policies of other nations. - Guide your Nation through an era of unprecedented Scientific Advancement. - Modernize your economy to support your social and military policies. - Sophisticated Real-Time Strategic and TacticalControl of your Military Forces. - Detailed historically-accurate armies down to the Battalion level. - Choose your level of control. Make all decisions or use your Cabinet Ministers to help. - Battle the elements! Fully integrated weather model influences battlefield outcomes. - Up to 16 players in Multiplayer over local network or Internet (PC only) Building on Supreme Ruler 2010 and 2020, BattleGoat Studios invites you to relive the tension and uncertainty of the Cold War. As the 1950’s approach, the Korean War looms, the ArmsRace intensifies, the Berlin Crisis leads to the formation of NATO, and the world anticipates a new World War. As leader of the United States or the Soviet Union, you must make the correct Economic, Diplomatic, Domestic and Military decisions to successfully navigate your country through this dangerous historical era and increase your nation’s Sphere of Influence on the world stage. Key Features: -Play as the United States or Soviet Union in Campaign Mode -Control any Nation in Post-World War II Era in Sandbox Mode -Use Diplomacy, Trade and Espionage to influence the policies of other nations -Research new Technologies to give your nation an edge -Grow and Modernize your Economy -Control Military production and deployment, or let your Ministers take care of the details -And when Diplomacy Fails… Sophisticated Real-Time Strategic and Tactical Control of your Military Forces! -Enhanced Graphics and Sound including New 3D Terrain -Experience the redesigned GUI with improved On-Map feedback and streamlined controls Patreon: https://www.patreon.com/user?u=2905473 Website: http://bundeswehrbob.com/ Twitter: https://www.twitter.com/rjc_foxtrot Discord: https://discord.gg/0nJRdMbZyDoGDGOn Subscribe for more! -------------------------------------------- Playlist: https://www.youtube.com/playlist?list=PL0S8dkG6ausDV2aRC3MJbIq-Do0bPsjQZ Supreme Ruler Ultimate is available on Steam: http://store.steampowered.com/app/314980/Supreme_Ruler_Ultimate/ Supreme Ruler Cold War is available on Steam: http://store.steampowered.com/app/73220/Supreme_Ruler_Cold_War/ I brought along some community members to play a game of Supreme Ruler Ultimate with me. We decided on a Cold War start, playing as NATO powers. UtariOnzo as the United Kingdom Nanaya as FranceOddball as the United States Bundeswehr Bob as Italy http://battlegoat.com/ BattleGoat Studios is pleased to present Supreme Ruler Ultimate, the pinnacle of sixteen years of development on the Supreme Ruler series of Real Time Geo-Political Military StrategyGames for PC and Mac. Supreme Ruler Ultimate incorporates the stories, campaigns, scenarios, and features from our previous releases and expands on them in our improved game engine. Take control of any nation in the world from World War II through the Cold War and into the near future as our world lurches from one crisis to the next. Play historical or modern Campaigns with specific objectives, attempt one of the many Set-Piece Scenarios for a shorter game, or customize your game experience by picking any nation in the various era Sandboxes and choosing your own preferred VictoryCondition. With so many options to choose from, Supreme Ruler Ultimate provides virtually unlimited replayability! - Play Historical or Futuristic Campaigns. - Take Control of any Nation in SandboxMode and impact the outcome of an era. - Challenge yourself with Historical Scenarios for a faster-paced gameplay experience. - The butterfly effect...Influence the timeline and outcome of thousands of historical events. - Use Diplomacy, Trade, Espionage, and Intimidation to influence the policies of other nations. - Guide your Nation through an era of unprecedented Scientific Advancement. - Modernize your economy to support your social and military policies. - Sophisticated Real-Time Strategic and TacticalControl of your Military Forces. - Detailed historically-accurate armies down to the Battalion level. - Choose your level of control. Make all decisions or use your Cabinet Ministers to help. - Battle the elements! Fully integrated weather model influences battlefield outcomes. - Up to 16 players in Multiplayer over local network or Internet (PC only) Building on Supreme Ruler 2010 and 2020, BattleGoat Studios invites you to relive the tension and uncertainty of the Cold War. As the 1950’s approach, the Korean War looms, the ArmsRace intensifies, the Berlin Crisis leads to the formation of NATO, and the world anticipates a new World War. As leader of the United States or the Soviet Union, you must make the correct Economic, Diplomatic, Domestic and Military decisions to successfully navigate your country through this dangerous historical era and increase your nation’s Sphere of Influence on the world stage. Key Features: -Play as the United States or Soviet Union in Campaign Mode -Control any Nation in Post-World War II Era in Sandbox Mode -Use Diplomacy, Trade and Espionage to influence the policies of other nations -Research new Technologies to give your nation an edge -Grow and Modernize your Economy -Control Military production and deployment, or let your Ministers take care of the details -And when Diplomacy Fails… Sophisticated Real-Time Strategic and Tactical Control of your Military Forces! -Enhanced Graphics and Sound including New 3D Terrain -Experience the redesigned GUI with improved On-Map feedback and streamlined controls Op0r8durr - Anthony's MSW NATO Kit - Part 1 Finally! Rejoice plebians, papa Pariano's updated gear video has finally emerged! If you're looking for some good tips and tricks on packing for a MilSim West g... Finally! Rejoice plebians, papa Pariano's updated gear video has finally emerged! If you're looking for some good tips and tricks on packing for a MilSim West game, make sure to check this video out and get a detailed list of a MSW Cadre's walking around kit! Stay tuned for Part 2 of Anthony's MSW NATO gear video, where he'll show you all of his sustainment and survival gear that he uses to get through the tough 40 hour MSW events! The Amped Opor8durr GearSeries, where Amped employees and close friends of the shop show off all their gucci gear swag load outs and guns then explain why they do things the way they do. Make sure to get all your questions and comments in down below and we'll do our best to get them all answered! As always, remember to play honorably, call your hits and have fun! Enjoy! Also, please visit and follow our other accounts for even more! Get all your Airsoft needs in one place! www.AmpedAirsoft.com Facebook: Amped Airsoft Instagram: @AmpedAirsoftOfficial Vine: Amped Airsoft Official Twitter: AmpedAirsoft Snapchat: amped_airsoft tumblr: ampedairsoftofficial Gun Squad: ampedairsoftofficial live.me Phone App: Amped Airsoft Finally! Rejoice plebians, papa Pariano's updated gear video has finally emerged! If you're looking for some good tips and tricks on packing for a MilSim West game, make sure to check this video out and get a detailed list of a MSW Cadre's walking around kit! Stay tuned for Part 2 of Anthony's MSW NATO gear video, where he'll show you all of his sustainment and survival gear that he uses to get through the tough 40 hour MSW events! The Amped Opor8durr GearSeries, where Amped employees and close friends of the shop show off all their gucci gear swag load outs and guns then explain why they do things the way they do. Make sure to get all your questions and comments in down below and we'll do our best to get them all answered! As always, remember to play honorably, call your hits and have fun! Enjoy! Also, please visit and follow our other accounts for even more! Get all your Airsoft needs in one place! www.AmpedAirsoft.com Facebook: Amped Airsoft Instagram: @AmpedAirsoftOfficial Vine: Amped Airsoft Official Twitter: AmpedAirsoft Snapchat: amped_airsoft tumblr: ampedairsoftofficial Gun Squad: ampedairsoftofficial live.me Phone App: Amped Airsoft Oddball Overviews - Episode 1 - NATO kit You guys took a vote and said you wanted my first video to be on my main loadout. So here it is. My page: https://www.facebook.com/FilthyAKcasual/ Knowledge... You guys took a vote and said you wanted my first video to be on my main loadout. So here it is. My page: https://www.facebook.com/FilthyAKcasual/ Knowledge bombers: https://www.youtube.com/user/BritishTang https://www.youtube.com/user/AmpedAirsoft Patches: http://www.snakehoundmachine.com/ https://weaponsgradewaifus.com/ https://woodpatchs.com/ You guys took a vote and said you wanted my first video to be on my main loadout. So here it is. My page: https://www.facebook.com/FilthyAKcasual/ Knowledge bombers: https://www.youtube.com/user/BritishTang https://www.youtube.com/user/AmpedAirsoft Patches: http://www.snakehoundmachine.com/ https://weaponsgradewaifus.com/ https://woodpatchs.com/

2024-02-08T01:26:28.774034

https://example.com/article/6662

Background {#Sec1} ========== Acute respiratory distress syndrome (ARDS) is a life-threatening respiratory disease with a high mortality rate in critically ill patients \[[@CR1], [@CR2]\]. Although many in-depth studies on ARDS have been conducted, the specific pathogenesis and prognostic factors of the disease remain unclear. Indeed, despite improvements in ventilatory techniques and extensive research to date, ARDS continues to be associated with high mortality \[[@CR3], [@CR4]\]. Nonetheless, clinical and animal studies have shown that the activation of multiple inflammatory cells and the release of inflammatory mediators play important roles in the development and outcome of ARDS \[[@CR5]\]. The involvement of immune cells, including neutrophils \[[@CR6], [@CR7]\] lymphocytes \[[@CR8]\], and regulatory T-cell \[[@CR9], [@CR10]\], has become an active topic of research in ARDS pathogenesis. To date, few clinical studies on the immune status of ARDS patients have focused on aetiology, treatment and prognosis \[[@CR11]\]. Immunocompromised individuals represent a significant proportion of ARDS patients \[[@CR11], [@CR12]\], these patients do not have the ability to respond normally to an infection due to an impaired or weakened immune system. Some studies have shown that ARDS occurs in patients with previous immunodeficiencies, such as haematologic malignancies, active solid tumours, solid organ transplantation, and acquired immunodeficiency syndrome, as well as in patients taking long-term or high-dose corticosteroids or immunosuppressants, and those who use extra-corporeal membrane oxygenation (ECMO) may have a better prognosis \[[@CR13]\]. Compared with immunocompetent subjects, ARDS patients with typical immunodeficiency have higher mortality regardless of ARDS severity \[[@CR11]\]. In addition, atypical immunosuppression is frequently found among ARDS patients, and virus infections are also increasingly being reported in ARDS patients without typical immunosuppression \[[@CR13]\]. Overall, there is currently a lack of uniform molecular markers for patients with atypical immunosuppression or impaired status. Furthermore, it is not well known whether the status of atypical immunodeficiency affects the prognosis of ARDS. Managing patients with atypical immunosuppression in intensive care unit (ICU) can be challenging, updated epidemiological and outcomes studies are needed to evaluate the condition of these patients. This aim of our study was to identify a convenient and easy-to-use molecular biomarker to detect and evaluate the status of patients with atypical immunosuppression in ARDS patients. Methods {#Sec2} ======= Study design and patients {#Sec3} ------------------------- This retrospective observational cohort study was conducted with ARDS patients hospitalized in the critical care centre of a university-based tertiary care hospital (The Second Xiangya Hospital of Central South University) in Hunan, China, from January 2011 to August 2018. Institutional approval was provided by the Second Xiangya Hospital of Central South University Biomedical Research Ethics Committee (Hunan, China). Written informed consent was waived because of the retrospective observational design. All patient data were anonymously recorded to ensure confidentiality. Inclusion and exclusion criteria {#Sec4} -------------------------------- Patients admitted to the critical care centre with a diagnosis of ARDS based on the 2012 Berlin definition \[[@CR14]\] were included in our study if they met the inclusion criteria and none of the exclusion criteria. All eligible patients were over 18 years old with available neutrophil and lymphocyte count results within 24 h after ICU admission. Patients who were repeatedly admitted to the ICU, lack of neutrophil and lymphocyte records, had chronic haematological disorders, were under the age of 18 years, or died within 24 h of receiving a diagnosis of ARDS were excluded. In addition, we excluded patients who were defined as having an immunodeficiency with the following aetiologies: (1) haematological malignancies, (2) active solid tumours or specific anti-tumour treatment within a year, (3) solid organ transplant, (4) acquired immunodeficiency syndrome (AIDS), or (5) long-term or high-dose corticosteroid (CS) or immunosuppressant (IS) therapy. Long-term CS therapy was defined as \> 7.5 mg of prednisone/day for \> 3 months, and a high dose was defined as \> 1 mg/kg for \> 1 week within the previous 3 months. According to the PaO~2~/FiO~2~ ratio, patients were categorized as mild (200 mmHg\<PaO~2~/FiO~2~ ≤ 300 mmHg, *n* = 31), moderate (100 mmHg\<PaO~2~/FiO~2~ ≤ 200 mmHg, *n* = 61), and severe (PaO~2~/FiO~2~ ≤ 100 mmHg, *n* = 109) groups. In addition, 201 patients were included and divided into a survivor group (*n* = 80) and a non-survivor group (*n* = 121) according to the final clinical results. Data extraction and outcome {#Sec5} --------------------------- Demographic and baseline characteristics such as age, sex, body mass index (BMI), ARDS risk factors, severity of illness upon admission to the ICU (Acute Physiology and Chronic Health Evaluation (APACHE) II score) \[[@CR15]\], and the Sequential Organ Failure Assessment (SOFA) score \[[@CR16]\] were recorded and analysed. We recorded routine blood examination results within 24 h and within 3 days after ICU admission. Two authors completed the data collection independently. The primary outcome was mortality, and the secondary outcomes were ICU mortality and hospital mortality. We also calculated 28-day mortality and 100-day mortality rates. Blood measurements and flow cytometric analysis {#Sec6} ----------------------------------------------- The white blood cell count, C-reactive protein (CRP) level and procalcitonin (PCT) level were measured. Serum levels of haemoglobin, albumin, immunoglobulins (IgG, IgA, IgM, IgE), and complement components (C3, C4) (R&D Systems, USA) was determined by enzyme-linked immunosorbent assay (ELISAs) in accordance with the manufacturer's instructions. To analyse T-lymphocytes, cell staining kit (BD ingen™, USA) was used to detect CD4 + CD8 + CD3 + cells according to the manufacturer's protocol. Briefly, peripheral blood mononuclear cells (PBMCs) were incubated with a mixture of luciferin isothiocyanate anti-CD4 and apc anti-CD8 at 4 °C for 30 min. Facscalibur flow cytometry (BD Biosciences, USA) and CellQuest software (BD Biosciences, USA) were used for flow cytometry analysis. A homotype control was used to ensure antibody specificity \[[@CR17], [@CR18]\]. Statistical analysis {#Sec7} -------------------- We used the Kolmogorov-Smirnov test to assess distribution normality. The continuous variables were reported as the mean ± SD or median (IQR). An independent samples t-test was used to evaluate normally distributed data, and the Mann-Whitney test was employed to evaluate non-normally distributed data when comparing two groups. In multi-group comparisons, one-way ANOVA and Kruskal-Wallis test were used to analyze the normal and non-normal distribution data respectively, and the *P*-values adjusted by Bonferroni were used for multiple groups of comparison. Classification data number (percentage) aggregation, and Chi-square or Fisher's exact test. Spearman's rank correlation was adopted to determine correlations among variables. Area under the curve operating characteristic (ROC) was used to evaluate the prognostic value of the subject properties, diagnostic and test parameters. The cut-off point was obtained by determining the optimal den index (sensitivity+specificity-1). We used Kaplan-Meier plots and log-rank tests to compare the survival rate of each group. To calculate an independent predictor of mortality of 100 days, with a stepwise binary logistic regression variables for the regression values ​​of *P* \< 0.05 (one variable was entered when P \< 0.05, and one was deleted when *P* \> 0.10). The odds ratio (OR), *P*-value and 95% CI were used to represent results. All tests were double-tailed, and P \< 0.05 was considered statistically significant. All analyses were performeded using IBM SPSS 22.0 and MedCalc v.11.0. Results {#Sec8} ======= Baseline characteristics and patient outcome {#Sec9} -------------------------------------------- A total of 201 patients meeting the Berlin definition of ARDS from January 2011 to August 2018 were included in this study. Characteristics at enrolment and outcomes of the study population are shown in Table [1](#Tab1){ref-type="table"} and Table [2](#Tab2){ref-type="table"}. There were no statistically significant differences in age, sex or BMI among the mild, moderate and severe ARDS groups. The most common aetiologies of ARDS were pneumonia, sepsis and pancreatitis. According to the APACHE II score (*P* = 0.016), SOFA score (*P* = 0.027), and PaO~2~/FiO~2~ (*P* = 0.000), it can be seen that the severity of critical illness on the day of enrolment worsened from mild to severe ARDS, as shown in Tables [1](#Tab1){ref-type="table"} and [2](#Tab2){ref-type="table"}. The 100-day mortality rate for patients with ARDS was 60.2% (121/201). Compared to non-survivors, the survivors were significantly younger, with relatively low scores for APACHE II and SOFA. Survivors had higher BMIs and PaO~2~/FiO~2~ ratios than did non-survivors.[1](#Fig1){ref-type="fig"} [2](#Fig2){ref-type="fig"} Table 1Baseline characteristics of the enrolled study population. Normally distributed quantitative data are expressed as means±standard deviation. Non-normally distributed quantitative data are expressed as medians (IQR)VariablesAcute respiratory distress syndrome^**∆**^P-valueTotalMildModerateSevereNumber2013161109Age,years54.24 ± 16.3555.38 ± 15.6052.43±54.93 ± 16.030.579Sex,male/female,n130/7119:1240/2171/380.415BMI,kg/m^2^23.90 ± 3.8224.22 ± 3.9323.83 ± 4.0523.90 ± 3.820.896Cause of ARDS Pneumonia125193769 Non-pulmonary spesis3861517 Pancreatitis15474 Trauma7007 Aspiration2002 Others142210APACHE II score14.19(7.69 to 31.00)12.74(7.69 to 24.37)14.52 (9.86 to 27.69)14.34 (9.68 to 31.00)\*0.016SOFA score4.98(4.65 to 5.30)4.59(3.97 to 5.20)5.11 (4.71 to 5.53)5.26 (4.89 to 5.63)0.027PaO~2~/FiO~2,~mmHg123 (112 to 134)280 (267 to 294)140 (132 to 146)\*69 (65 to 72)\* ^\#^0.000CRP,mg/L129.82 (129.82 to 169.91)110.09 (76.59 to 143.59)163.90 (138.67 to 189.14)\*203.33 (115.97 to 290.68)\*0.011PCT,ng/ml12.20 (8.12 to 16.29)9.37 (5.45 to 13.30)10.15 (1.51 to 18.80)17.05 (7.58 to 27.73)\*0.175Albumin,g/L27.67 ± 5.8227.13 ± 3.1727.07 ± 6.0528.10 ± 6.05^\*^0.759Hemoglobin,g/L107.67 ± 28.32104.04 ± 23.76107.29 ± 28.05108.82 ± 29.730.759Leukocytes,10^9^/L11.33(10.12 to 12.54)10.98 (8.67 to 13.28)10.91 (9.62 to 12.22)13.65 (8.65 to 18.64)0.298Lymphocytes,10^9^/L1.10 (0.95 to 1.26)1.28 (0.86 to 1.75)1.10 (8.67 to 13.28)1.07 (0.87 to 1.27)\*0.025Neutrophils,10^9^/L10.78 (8.38 to 13.18)8.35 (6.91 to 9.78)11.66 (7.59 to 15.74)13.03 (7.31 to 18.76)0.371Lymphocyte/Neutrophil ratio0.19 ± 0.030.35 ± 0.230.17 ± 0.03^\*^0.15 ± 0.02^\*^0.001Virus infection,n,%23(11.44%)1(3.23%)10(16.39%)12(11.0%)28-day mortality,n,%103(51.24%)13(41.94%)31(50.82%)59(54.13%)100-day mortality,n,%121(60.20%)15(48.39%)37(60.66%)69(63.30%)ImmunoglobulinIgG,g/L10.87 ± 1.8611.71 ± 4.9610.82 ± 1.9410.59 ± 5.360.095IgA,g/L1.98 ± 0.241.92 ± 1.091.85 ± 0.722.11 ± 1.400.270IgM,g/L1.05 ± 0.861.32 ± 1.181.02 ± 0.921.00 ± 0.720.598IgE,ng/mL620.36 ± 145.111426.20 ± 119.89640.55 ± 32.45356.87 ± 78.73^\*^0.025Complement components C35.62 ± 1.7812.27 ± 1.837.13 ± 3.140.84 ± 0.33^\*^0.186 C41.33 ± 0.580.25 ± 0.130.24 ± 0.112.25 ± 0.95^\*^0.663T-lymphocytes subsets CD3+ cells,%62.75 ± 15.2971.00 ± 13.7863.35 ± 12.4460.62 ± 17.110.229 CD4+ cells,%35.15 ± 15.4836.40 ± 13.6934.10 ± 11.1435.66 ± 8.470.951 CD4+ cells count (PCS/ul)383.20 ± 67.18176.50 ± 67.18383.67 ± 94.79434.08 ± 78.660.708 CD8+ cells,%27.33 ± 13.4634.33 ± 6.3725.60 ± 11.5926.92 ± 14.010.275 CD8+ cells count (PCS/ul)212.33 ± 64.30134.00 ± 30.63286.67 ± 51.72178.91 ± 70.960.409 CD4+/CD8+ ratio1.95 ± 0.261.29 ± 0.231.91 ± 0.932.14 ± 0.480.623B-lymphocytes B-lymphocytes,%30.25 ± 17.2818.00 ± 3.2426.20 ± 7.8133.36 ± 7.810.598 B-lymphocytes cell count (PCS/μl)301.05 ± 73.7769.01 ± 8.89413.20 ± 41.42271.18 ± 78.370.665NK cell NK cells,%8.76 ± 5.9117.00 ± 4.419.40 ± 0.817.73 ± 4.580.331 NK cell count (PCS/ul)68.77 ± 46.4668.20 ± 7.6682.60 ± 14.8262.55 ± 15.150.751Qualitative data are presented as numbers (%). ^∆^*P*-value for the three groups (mild, moderate, and severe ARDS groups); \**P* \< 0.05 versus mild ARDS; ^\#^*P* \< 0.05 versus moderate ARDS. *BMI* body mass index, *APACHE* Acute Physiology and Chronic Health Evaluation *SOFA* Sequential Organ Failure Assessment, *CRP* C-reactive protein, *PCT* procalcitonin Table 2Comparison of clinical characteristics of ARDS patients according to survival status. Normally distributed quantitative data are expressed as means±standard deviation. Non-normally distributed quantitative data are expressed as medians (IQR)VariablesNon-survivors(***n*** = 121)Survivors(***n*** = 80)***P***-valueAge,years56.96 ± 17.0950.16 ± 14.330.004Sex,male/female,n76/4554/260.496BMI,kg/m^2^23.41 ± 3.8824.69 ± 3.930.027APACHE II score14.96(14 to 16)13.51 (13 to 15)0.036SOFA score5.42 (5 to 6)4.15 (4 to 5)0.000PaO~2~/FiO~2~,mmHg115 (102 to 188)135 (115 to 154)0.042CRP,mg/L152.20 (126.50 to 177.89)146.32 (113.27 to 179.37)0.778PCT,ng/Ml13.67 (5.49 to 21.89)11.30 (6.90 to 15.70)0.577Hemoglobin,g/L105.63 ± 27.68110.41 ± 30.740.298Albumin,g/L27.24 ± 5.6828.33 ± 6.020.223Leukocytes,10^9^/L12.19 (10.41 to 13.97)10.80 (9.47 to 12.14)0.012Lymphocytes,10^9^/L1.03 (0.86 to 1.201.21 (0.92 to 1.50)0.025Neotrophils,10^9^/L9.80 (8.29 to 11.31)8.80 (7.64 to 9.95)0.016Lymphocyte/Neotrophil ratio0.15 ± 0.050.20 ± 0.280.008Virus infection12(9.91%)11(13.75%)Immunoglobulin IgG,g/L9.95 ± 2.3712.42 ± 3.880.169 IgA,g/L1.80 ± 0.532.29 ± 1.040.156 IgM,g/L0.90 ± 0.251.22 ± 0.330.163 IgE,ng/mL351.97 ± 80.271030.29 ± 220.940.009Complement component C33.27 ± 0.9110.31 ± 2.060.018 C41.84 ± 0.460.25 ± 0.100.170T-lymphocyte subsets CD3+ cells,%61.90 ± 15.4963.83 ± 15.290.647 CD4+ cells,%33.93 ± 16.0636.67 ± 14.930.521 CD4+ cell count (PCS/μl)328.85 ± 72.23487.86 ± 65.040.512 CD8+ cells,%29.47 ± 5.4224.38 ± 9.750.190 CD8+ cell count (PCS/μl)152.75 ± 22.66331.50 ± 95.710.024 CD4+/CD8+ ratio1.79 ± 0.091.78 ± 0.120.428B-lymphocytes B-lymphocyte cells,%29.81 ± 8.8931.33 ± 5.490.169 B-lymphocyte cell count (PCS/μl)113.27 ± 29.45601.33 ± 52.260.009NK cell NK cells,%9.19 ± 3.288.00 ± 1.670.708 NK cell count (PCS/μl)56.55 ± 12.8791.17 ± 19.790.134*BMI* body mass index, *APACHE* Acute Physiology and Chronic Health Evaluation, *SOFA* Sequential Organ Failure Assessment, *CRP*,C-reactive protein, *PCT* procalcitonin Correlations of the lymphocyte/neutrophil ratio with disease severity and outcome {#Sec10} --------------------------------------------------------------------------------- Compared with the mild group, the frequencies of lymphocyte cells were decreased in severe ARDS patients (*P* = 0.025). Moreover, the lymphocyte/neutrophil ratio decreased progressively with increasing ARDS severity (*P* = 0.001). Among non-survivors, a significantly lower lymphocyte/neutrophil ratio was found compared with that of survivors (*P* = 0.008) (Table [2](#Tab2){ref-type="table"}), the frequencies of lymphocyte cells were lower than those in survivors (P = 0.025) (Table [2](#Tab2){ref-type="table"}),and the frequencies of leukocytes and neutrophil cells were both higher than those in survivors (*P* = 0.012,0.016) (Table [2](#Tab2){ref-type="table"}). There were no significant differences among the three severity groups in terms of the frequencies of leukocytes and neutrophils (Table [1](#Tab1){ref-type="table"}). Alterations in inflammatory biomarkers, immunoglobulins, complement components, circulating T-lymphocyte cells, B-lymphocyte cells and NK cells in ARDS {#Sec11} ------------------------------------------------------------------------------------------------------------------------------------------------------- CRP levels progressively increased with increasing ARDS severity (*P* = 0.011). The PCT level of patients with severe ARDS was higher than that of patients with mild ARDS (*P* = 0.002). Interestingly, the lymphocyte count decreased as the severity of ARDS increased (*P* = 0.025) (Table [1](#Tab1){ref-type="table"}). In addition, compared with survivors, non-survivors were older (*P* = 0.004), and had higher leukocyte and neutrophil counts (*P* = 0.012, 0.016) and lower BMI, lymphocyte counts and lymphocyte/neutrophil ratios (*P* = 0.027, 0.025, and 0.008) (Table [2](#Tab2){ref-type="table"}). CRP and PCT levels in the two groups were similar (Table [2](#Tab2){ref-type="table"}). The peripheral blood immunoglobulin IgE and complement C3 levels in patients with mild ARDS were significantly higher than those in patients with severe ARDS (*P* = 0.023, 0.019). Moreover, the levels of immunoglobulin IgE and complement C3 in non-survivors were lower than in survivors (*P* = 0.009, 0.018) (Table [2](#Tab2){ref-type="table"}). Peripheral blood complement C4 levels in patients with mild ARDS were significantly lower than those in patients with severe ARDS (*P* = 0.026) (Table [1](#Tab1){ref-type="table"}), but the level of complement C4 was similar between survivors and non-survivors (Table [2](#Tab2){ref-type="table"}). The level of peripheral blood B-lymphocyte cells was significantly lower in non-survivors than in survivors (P = 0.009), as was the level of peripheral blood CD8+ cells (*P* = 0.024), though the levels of both peripheral blood B-lymphocyte cells and CD8+ cells were similar in the three groups (Table [1](#Tab1){ref-type="table"}). In addition, the proportions of CD3+ cells, CD4+ cells, and NK cells and the CD4+/CD8+ ratio in peripheral blood showed no significant differences among the three groups of ARDS patients stratified by oxygenation index or between the survivor and non-survivor groups. Correlations of lymphocytes, the lymphocyte/neutrophil ratio, immunoglobulin IgE levels, complement C3 levels, T-CD8+ lymphocyte levels and B-lymphocyte levels with disease severity and outcome {#Sec12} ------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- We noted that in all ARDS patients, the lymphocyte/neutrophil ratio was moderately negatively correlated with age (r = − 0.153, *P* = 0.030, Fig.[1](#Fig1){ref-type="fig"}a), SOFA score (r = − 0.140, *P* = 0.038, Fig.[1](#Fig1){ref-type="fig"}b), and the APACHE II score (r = − 0.177, *P* = 0.012, Fig.[1](#Fig1){ref-type="fig"}c). We also observed that, there is a moderate positive correlation between the lymphocyte/neutrophil ratio and PaO~2~/FiO~2~ ratio (r = 0.143, *P* = 0.023, Fig.[1](#Fig1){ref-type="fig"}d). Moreover, significant mild positive correlations were found between the lymphocyte count and BMI (r = 0.145, *P* = 0.041), the lymphocyte count and the PaO~2~/FiO~2~ ratio (r = 0.110, *P* = 0.121), the immunoglobulin IgE level and the PaO~2~/FiO~2~ ratio (r = 0.288, *P* = 0.036), the C3 level and BMI (r = 0.342, *P* = 0.026), the T-CD8+ lymphocyte count and the lymphocyte count (r = 0.755, *P* = 0.001), the B-lymphocyte count and BMI (r = 0.588, *P* = 0.013), and the B-lymphocyte cell count and lymphocyte count (r = 0.582, *P* = 0.014). Fig. 1Relationships between the lymphocyte/neutrophil ratio and age, APACHE II score, SOFA score, and PaO~2~/FiO~2~ ratio in ARDS patients. Spearman rank correlation was used to assess associations between variables. The lymphocyte/neutrophil ratio correlated negatively with age (**a**), the SOFA score (**b**), and the APACHE II score (**c**) but positively with the PaO~2~/FiO~2~ ratio (D) in ARDS patients The area under the ROC curve (AUC) for the lymphocyte/neutrophil ratio for the prediction of 100-day survival in ARDS patients was 0.721 (95% CI 0.653 to 0.782) and was significantly higher than the AUC for the PaO~2~/FiO~2~ ratio alone (0.625, 95% CI 0.554 to 0.692, *P* = 0.0062,), the AUC for BMI alone (0.593, 95% CI 0.521 to 0.661, *P* = 0.0001) or the AUC for the lymphocyte count alone (0.592,95% CI 0.520 to 0.660, *P* = 0.0154) (Fig.[2](#Fig2){ref-type="fig"}). The AUC for the lymphocyte/neutrophil ratio in combination with the lymphocyte count for the prediction of 100-day survival in ARDS patients was 0.723 (95% CI 0.656 to 0.784), which was larger than both the AUC for the lymphocyte/neutrophil ratio alone (*P* = 0.8601) and the lymphocyte/neutrophil ratio in combination with the PaO~2~/FiO~2~ ratio (0.719, 95% CI 0.651 to 0.780, *P* = 0.7734) (Fig.[2](#Fig2){ref-type="fig"}). In predicting survival in patients with ARDS, the AUC for the lymphocyte/neutrophil ratio in combination with the lymphocyte count was significantly higher than those for the PaO~2~/FiO~2~ ratio alone (*P* = 0.0060), BMI alone (*P* = 0.0001), and lymphocyte count alone (*P* = 0.0067), and the AUC for the lymphocyte/neutrophil ratio in combination with the PaO~2~/FiO~2~ ratio was significantly higher than those for the PaO~2~/FiO~2~ ratio alone (*P* = 0.0014), BMI alone (P = 0.0001), and lymphocytes alone (*P* = 0.0162). Fig. 2Receiver operating characteristic (ROC) curves for predicting 100-day survival in patients with acute respiratory distress syndrome (ARDS). The area under the curve (AUC) was 0.721 (95% CI 0.656 to 0.784) for the lymphocyte/neutrophil ratio, 0.625 (95% CI 0.554 to 0.692) for the PaO~2~/FiO~2~ ratio, 0.593 (95% CI 0.521 to 0.661) for the BMI, 0.592 (95% CI 0.520 to 0.660) for the lymphocyte count, 0.723 (95% CI 0.656 to 0.784) for the lymphocyte/neutrophil ratio combined with the lymphocyte count and 0.719 (95% CI 0.651 to 0.780) for the lymphocyte/neutrophil ratio in combined with the PaO~2~/FiO~2~ ratio. The AUC was 0.369 (95% CI 0.292 to 0.446) for age, 0.425 (95% CI 0.345 to 0.505) for the APACHE II score, and 0.355 (95% CI 0.278 to 0.433) for the SOFA score (not shown) A cut-off value of the lymphocyte/neutrocyte ratio of \> 0.0537 was used to predict the survival of ARDS patients. The sensitivity was 83.8%, and the specificity was 80.2%. The positive likelihood ratio was 4.23, and the negative likelihood ratio was 0.20. Moreover, a leukocyte count cut-off of \> 0.415 (10^9^/L) was used to predict the survival of patients with ARDS. The sensitivity was 87.5%, and the specificity was 81.0%. The positive likelihood ratio was 4.61, and the negative likelihood ratio was 0.15. Predictors of 28-day and 100-day mortality in patients with ARDS {#Sec13} ---------------------------------------------------------------- Table [3](#Tab3){ref-type="table"} shows that age (per log~10~ years) (OR = 1.269, *P* = 0.019), BMI \< 24 (OR = 1.665, *P* = 0.015), SOFA score (OR = 1.287, *P* = 0.002), leukocyte count\< 0.415 (10^9^/L) (OR = 1.671, *P* = 0.042), and lymphocyte/neutrophil ratio (OR = 2.132, *P* = 0.009) were independent predictors of 100-day mortality in ARDS patients. Moreover, ARDS patients with a lymphocyte/neutrophil ratio \< 0.0537 had a higher 28-day mortality rate than did those with a lymphocyte/neutrophil ratio \> 0.0537 (*P* = 0.0283, Fig. [3](#Fig3){ref-type="fig"}a). Furthermore, 28-day and 100-day mortality rates were significantly lower in those under 40 years old and 40--60 years old than in those over 60 years old age (*P* = 0.0064, 0.0057, Fig. [3](#Fig3){ref-type="fig"}b, c). The 100-day mortality rate was significantly higher in those over 80 years old than in those under 40 years old, 40--60 years old and 60--80 years old (*P* = 0.0029, Fig. [3](#Fig3){ref-type="fig"}d). Table 3Logistic regression analysis of the prediction of mortality for patients with acute respiratory distress syndrome (ARDS)VariablesUnivariate analysisMultivariate analysisOdds ratio (95% CI)*P*-valueOdds ratio (95% CI)*P*-valueAge,per log~10~(years)1.269(1.040,1.548)0.0192.982(2.073,4.654)0.007BMI,\< 241.665(0.883,3.137)0.015APACHE II score,per point1.016(0.940,1.098)0.059SOFA score,per point1.287(1.098,1.509)0.0022.560(1.457,5.430)0.005PaO~2~/FiO~2~,per log~10~(mmHg)0.652(0.280,1.004)0.067PCT,per log~10~(ng/mL)1.028(0.797,1.810)0.063CRP,\> 150(mg/L)1.256(0.618,2.553)0.059Lymphocytes,\< 0.415 × 10^9^/L1.671(1.252,1.787)0.042Lymphocyte/Neutrophil ratio,\< 0.05374.137(1.452,6.832)0.0023.726(2.754,5.195)0.003*BMI* body mass index, *APACHE* Acute Physiology and Chronic Health Evaluation, *SOFA* Sequential Organ Failure Assessment, *PCT* procalcitonin, *CRP* C-reactive protein Fig. 3Kaplan-Meier survival curve for patients with ARDS using the cut-off values for the lymphocyte/neutrophil ratio and age obtained by ROC analysis. Log-rank test (*P* = 0.0283) (**a**), (*P* = 0.0064) (**b**), (*P* = 0.0057) (**c**), and (*P* = 0.0029) (**d**) Discussion {#Sec14} ========== In this study, we found associations between age, BMI, the SOFA score, and the lymphocyte/neutrophil ratio at ICU admission and clinical outcomes in patients with ARDS. Age (per log~10~ years), BMI \< 24, the SOFA score (per point) and the lymphocyte/neutrophil ratio were independent risk factors for predicting 100-day mortality in ARDS patients. Another discovery was that the lymphocyte/neutrophil ratio and age were related to ICU mortality and hospital mortality. We also found associations between the baseline lymphocyte/neutrophil ratio and age, the SOFA score, the APACHE II score, the PaO~2~/FiO~2~ ratio, and the severity of ARDS according to the Berlin classification. The lymphocyte/neutrophil ratio may help predict prognosis for ARDS patients with a high immunologic risk. Our study is a longitudinal clinical outcome study of ARDS patients, and the results demonstrate the predictive significance of the lymphocyte/neutrophil ratio. During the past decade, there have been a few investigations addressing the potential function of the lymphocyte/neutrophil ratio, which remains a useful test for the diagnosis of tuberculous pleuritis \[[@CR19]\] and acts as an early biomarker for predicting acute rejection after heart transplantation \[[@CR20]\]. Previous studies have focused on the poor prognosis of patients with severe lymphopenia from the first day of ICU admission \[[@CR21]\]. In our study, peripheral blood lymphopenia was very common in ARDS patients without typical underlying diseases, causing immunosuppression. The number of peripheral blood lymphocytes decreased significantly in patients with severe ARDS, and in non-survivors also. Moreover, the lymphocyte/neutrophil ratio progressively decreased with increasing ARDS severity, and a significantly lower lymphocyte/neutrophil ratio was found in non-survivors than in survivors. A decrease in the lymphocyte/neutrophil ratio is due to a decrease in the lymphocyte count and an increase in the neutrophil count. In our study, ARDS patients with a lymphocyte/neutrophil ratio \< 0.0537 had a higher 28-day mortality rate than did those with a lymphocyte/neutrophil ratio ≥ 0.0537. The lymphocyte/neutrophil ratio may reveal the balance between lymphocyte and neutrophil counts. Lymphocytes are important immune cells involved in response to ARDS and in prognosis. Multivariate analysis showed that a decrease in the lymphocyte count was associated with a 2.32--3.76-fold increase in the risk of death among patients with or without septic shock \[[@CR22]\]. In addition, both B-lymphocyte and CD8 + T-lymphocyte counts correlated positively with peripheral blood lymphocyte counts in our study, these counts in non-survivors were significantly lower than those in survivors, and the findings suggest increased risk of death in ARDS patients when the lymphocyte count decreases below a certain value. Neutrophils are another type of immune cell involved in the process of sepsis, and a relative increase in the total number of circulating neutrophils and the percent increase in neutrophils with immature morphology are also closely related to sepsis \[[@CR23], [@CR24]\]. Compared with counts in survivors, higher neutrophil counts were found in patients who eventually died as a result of sepsis-induced ARDS, and excessive accumulation of neutrophils in patients with ARDS may therefore contribute to disease progression \[[@CR6], [@CR8]\]. Therefore, the combination of lymphopenia and neutrophilia contributes to the outcome of ARDS, which may explain why the lymphocyte/neutrophil ratio in our study was a strong independent predictor of prognosis. Although the clinical scores, such as APACHE II \[[@CR25]\], SOFA \[[@CR26]\] and the PaO~2~/FiO~2~ ratio \[[@CR27]\], have been widely used to predict the results of clinical practice patients of ARDS. We further found that the lymphocyte/neutrophil ratio AUC was higher than the PaO~2~/FiO~2~ ratio, BMI, APACHE II score, and SOFA score alone in predicting 100-day survival in ARDS patients. In combination with the lymphocyte count slightly increased the AUC of the lymphocyte/neutrophil ratio in predicting 100-day survival, yet there was no difference compared with the lymphocyte/neutrophil ratio alone. Moreover, ARDS patients with a lymphocyte/neutrophil ratio ≥ 0.0537 had a lower 28-day mortality rate, and significantly moderate negative correlations were found between the lymphocyte/neutrophil ratio and age, the SOFA score, and the APACHE II score. In addition, a moderate positive correlation between the lymphocyte/neutrophil ratio and the PaO~2~/FiO~2~ ratio was been noted. These results suggest that the lymphocyte/neutrophil ratio can comprehensively and plausibly reflect the patient's physiological, pathophysiological and respiratory oxygenation index status. Taken together, our findings strongly suggest that the lymphocyte/neutrophil ratio is a potential indicator and good indicator for prognosis evaluation among ARDS patients. There have been many clinical studies on ARDS patients with typical immunodeficiency \[[@CR13], [@CR28]\], and immunodeficiency in ARDS patients is usually atypical. Although it does not reach the level found in typical immunodeficiency, there is already a degree of immune impairment. Nonetheless, there are few studies on atypical immune deficiency or impaired immunity in ARDS patients, and there is no uniform scale or biomarker to measure immune impairment in ARDS patients and its relationship with prognosis. A consensus has not been reached regarding whether viral infection causes immune deficiency, though it is commonly thought to induce immune impairment but not to the extent of immune deficiency. In our study, there was no significant difference in viral infection status between the survivor and non-survivor groups. However, we did observe that the lymphocyte/neutrophil ratio in the survivor group were higher than those in the non-survivor group. We hypothesize that a low lymphocyte/neutrophil ratio may be a marker of this atypical immunodeficiency in ARDS patients, affecting their prognosis. There are no recognized biomarkers to date that can be used to identify the immune status of ARDS patients. Accordingly, we propose a new biomarker for the identification of atypical immune status in patients with ARDS. This status may be due to abnormal inhibitors that have been be activated. We hope that by observing the association of the early lymphocyte/neutrophil ratio with prognosis may result in better detection and more timely treatment of an abnormal immune status. Our findings must be understood in view of the following limitations. First, this study had a relatively small sample size, even though it was the first study to explore the prognostic value of the lymphocyte/neutrophil ratio for prognosis in ARDS patients. Second, there may be a selection bias because only patients for whom absolute lymphocyte and neutrophil counts were measured soon after ARDS diagnosis were included. Third, the current study was not pre-specified but is a post hoc analysis from a retrospective controlled trial. Therefore, further prospective studies are needed. Conclusions {#Sec15} =========== We found age (per log~10~ years), BMI \< 24, the SOFA score, the lymphocyte count, and the lymphocyte/neutrophil ratio to be independent predictors of 100-day mortality in patients with ARDS. We also observed a moderate negative correlations between the lymphocyte/neutrophil ratio and age, the SOFA score, and the APACHE II score, and a significant mild positive correlation between the lymphocyte count and BMI was also found. However, we detected a moderate positive correlation between the lymphocyte/neutrophil ratio and the PaO~2~/FiO~2~ ratio in all patients with ARDS. The AUC was greatest for the lymphocyte/neutrophil ratio combined with the lymphocyte count for the prediction of 100-day survival in ARDS. In addition, the 28-day mortality rate of ARDS patients with a lymphocyte/neutrophil ratio \< 0.0537 was higher than that with a ratio of lymphocyte/neutrophil ≥0.0537. The lymphocyte/neutrophil ratio was also revealed to be a strong and independent predictor of prognosis in ARDS patients, particularly in those with atypical immunodeficiency. ARDS : Acute respiratory distress syndrome APACHE : Acute Physiology and Chronic Health Evaluation AUC : Area under the curve BALF : Bronchoalveolar lavage fluid BMI : Body mass index CI : Confidence interval CRP : C-reactive protein ICU : Intensive care unit LDH : Lactate dehydrogenase MOF : Multiple organ failure OR : Odds ratio PCT : Procalcitonin ROC : Receiver operating characteristic SAPS : Simplified Acute Physiology Score SD : Standard deviation SOFA : Sequential Organ Failure Assessment **Publisher's Note** Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations. Not applicable. All authors participated in the interpretation of the study results and review of the manuscript. MS designed and conducted all experiments, drafted the manuscript, and performed the statistical analyses. HL planned the study and drafted the manuscript. YJ L and ZW L participated in the data collection. HP and PC contributed to the study design and the revision of the manuscript. All authors read and approved the final manuscript. This work was supported by grants from by the National Natural Science Foundation of China (Grant number 81770002 and 81670062). Financial support was mainly provided for the collection and analysis of data and for staff costs. The datasets used and analysed during the current study are available from the corresponding author on reasonable request. The study protocol was approved by the ethics committee of the Second Xiangya Hospital, Central South University (approval number: 2019150), and written informed consent was waived because of the retrospective design. All personal identification data were anonymized before analysis. Not applicable. The authors declare that they have no competing interests.

2023-11-05T01:26:28.774034

https://example.com/article/4632

Print Options Baked Egg Rolls Recipe "My family enjoys a variety of different foods including these crisp egg rolls," remarks Barbara Lierman of Lysons, Nebraska. "They're packed with tasty ingredients and also low in fat." TOTAL TIME: Prep/Total Time: 25 min.YIELD:8 servings Ingredients 2 cups grated carrots 1 can (14 ounces) bean sprouts, drained 1/2 cup chopped water chestnuts 1/4 cup chopped green pepper 1/4 cup chopped green onions 1 garlic clove, minced 2 cups finely diced cooked chicken 4 teaspoons cornstarch 1 tablespoon water 1 tablespoon light soy sauce 1 teaspoon canola oil 1 teaspoon brown sugar Pinch cayenne pepper 16 egg roll wrappers Directions 1.Coat a large skillet with cooking spray; add the first six ingredients. Cook and stir over medium heat until vegetable are crisp-tender, about 3 minutes. Add chicken; heat through. 2. In a small bowl, combine the cornstarch, water, soy sauce, oil, brown sugar and cayenne until smooth; stir into chicken mixture. Bring to a boil. Cook and stir for 2 minutes or until thickened; remove from the heat. 3. Spoon 1/4 cup of chicken mixture on the bottom third of one egg roll wrapper; fold sides toward center and roll tightly. (Keep remaining wrappers covered with a damp paper towel until ready to use.) Place seam side down on a baking sheet coated with cooking spray. Repeat.

2023-09-26T01:26:28.774034

https://example.com/article/5752

UK Power Networks is to be the first network operator in the UK to trial Faraday Grid’s “revolutionary” exchanger technology. First unveiled at the end of 2017, Faraday Grid’s exchangers act as an autonomous, self-balancing network that stands to make it easier to incorporate greater quantities of intermittent generators – such as renewables – and emerging demand patterns from new technologies like electric vehicles. If implemented at scale, Faraday Grid claims the technology has the potential to double the amount of renewable generation any given electricity grid could carry. The exchangers work by essentially replacing current network infrastructure to allow power to flow bi-directionally across a network. It professes to be able to continuously and autonomously adapt to variations at network-scale, allowing existing systems to manage fluctuations in both supply and demand more efficiently. The agreement will see exchangers deployed on UKPN’s London network next spring. Tests will assess the impact of technology on the network. Ian Cameron, head of innovation at UKPN, said the firm had recognised Faraday Grid’s technology as having the potential to be “transformational” for the wider energy system. “The technology is aligned to our ambition to become an energy platform business. We are delighted to be the company’s lead UK partner for testing and demonstrating its impacts in a distribution network,” he said. In March, Current± sat down with Faraday Grid’s Andrew Scobie and Richard Dowling, who said the technology could unleash a revolution of the energy system akin to how the advent of the internet changed telecommunications.

2024-03-06T01:26:28.774034

https://example.com/article/8350

The Brisbane Lions have today announced a series of list changes ahead of the upcoming AFL Trade and Draft periods. Hugh Beasley, Billy Evans, Jackson Paine, Josh McGuinness and Josh Watts have all been delisted. It takes the Lions' total number of list changes to eight for the season, with retired trio Daniel Merrett, Trent West and Justin Clarke having already departed. Football Manager Matthew Francis thanked the players for their commitment and dedication to the Lions. “Of course it is disappointing when any player departs, and each of the guys have given great service to our Club. “We wish them all the best for their futures,” Francis said. The AFL Trade Period begins on Monday 10 October, while the 2016 NAB AFL National Draft will take place in Sydney on Friday 25 November. Hugh Beasley Draft Details: 2014 Rookie Draft, pick 22 overall Recruited from: Oakleigh Chargers Debut: 2015 Games: 6 Goals: - Billy Evans Draft Details: 2014 Rookie Draft, pick 4 overall Drafted: Bendigo Pioneers Debut: 2015 Games: 7 Goals: 2 Jackson Paine Draft Details: 2011 National Draft, pick 50 overall Recruited from: Sandringham Dragons/Collingwood, 2013 Lions debut: 2014 Games: 10 Goals: 3 Josh Watts Draft Details: 2014 National Draft, pick 65 overall Recruited from: Glenorchy Games: - Goals: - Josh McGuinness Draft Details: 2014 National Draft, pick 81 overall Drafted: Lauderdale Games: - Goals: -

2023-09-05T01:26:28.774034

https://example.com/article/5703

1. Field of the Invention The invention generally relates to an electronic device supporting serial transmission and, more particularly, to an electronic device supporting multi-port parallel transmission. 2. Description of the Related Art Universal serial bus (USB) is a bus configured to connect a computer device and many kinds of electronic devices. Lots of computer devices and peripheral devices have USB-compatible interface. A host module can support connecting up to 127 peripheral devices via a tiered structure. A hub is located at the center of each tier, and each area-connecting wire segment is a point to point connection between a host module and a hub, a device or a hub which is connected to other hubs of devices. Because the transmission rate of a serial advanced technology attachment (SATA) interface in an electronic device can be up to 3 Gb/s, but the transmission rate of USB interface is only up to 480 Mb/s, USB interface becomes a bottleneck of data transmission in an electronic device with SATA structure or other high speed structure.

2024-04-08T01:26:28.774034

https://example.com/article/3312

Investigation of multiphase multicomponent aerosol flow dictating pMDI-spacer interactions. The use of Pressurized metered dose inhalers (pMDIs) for the treatment of asthma and other chronic obstructive pulmonary diseases is frequently associated with breath-actuation synchronization problems and poor pulmonary delivery, particularly amongst the pediatric and geriatric population groups. Spacers, or Valved Holding Chambers (VHCs), are frequently used to address these problems. However, the performance of spacers with different pMDIs is also highly variable and needs to be investigated. The purpose of the current study is to develop a computational fluid dynamics (CFD) model which can characterize multiphase multicomponent aerosol flow issuing from a commercial suspension-based pMDI into a spacer. The CFD model was initially calibrated against published experimental measurements in order to appropriately model the spray characteristics. This model was subsequently used to examine several combinations of inhaler, spacer and USP Throat geometries under different discharge rates of coflow air. The CFD model predictions compared favorably with experimental measurements. In particular, the predictions show, in accordance with experimental determinations, a decrease of drug retained by the spacers with increasing coflow air. The recirculation observed near the obstructions in axial path of the spray within either spacer is considered to be central for increasing spray retention and drug deposition behavior. Fluid flow patterns within the spacers were correlated with drug deposition behavior through a dimensionless variable, the Recirculation index (RCI). Bigger particles were found to be selectively retained within the spacer.

2024-07-28T01:26:28.774034

https://example.com/article/8939

Ibrutinib Therapy Releases Leukemic Surface IgM from Antigen Drive in Chronic Lymphocytic Leukemia Patients. In chronic lymphocytic leukemia (CLL), disease progression associates with surface IgM (sIgM) levels and signaling capacity. These are variably downmodulated in vivo and recover in vitro, suggesting a reversible influence of tissue-located antigen. Therapeutic targeting of sIgM function via ibrutinib, an inhibitor of Bruton tyrosine kinase (BTK), causes inhibition and tumor cell redistribution into the blood, with significant clinical benefit. Circulating CLL cells persist in an inhibited state, offering a tool to investigate the effects of drug on BTK-inhibited sIgM. We investigated the consequences of ibrutinib therapy on levels and function of sIgM in circulating leukemic cells of patients with CLL. At week 1, there was a significant increase of sIgM expression (64% increase from pretherapy) on CLL cells either recently released from tissue or persisting in blood. In contrast, surface IgD (sIgD) and a range of other receptors did not change. SIgM levels remained higher than pretherapy in the following 3 months despite gradual cell size reduction and ongoing autophagy and apoptotic activity. Conversely, IgD and other receptors did not increase and gradually declined. Recovered sIgM was fully N-glycosylated, another feature of escape from antigen, and expression did not increase further during culture in vitro. The sIgM was fully capable of mediating phosphorylation of SYK, which lies upstream of BTK in the B-cell receptor pathway. This specific IgM increase in patients underpins the key role of tissue-based engagement with antigen in CLL, confirms the inhibitory action of ibrutinib, and reveals dynamic adaptability of CLL cells to precision monotherapy.See related commentary by Burger, p. 2372.

2023-08-19T01:26:28.774034

https://example.com/article/6621

using System; namespace Palmmedia.ReportGenerator.Core.Logging { /// <summary> /// Provides <see cref="ILogger"/> objects creation capabilities. /// </summary> public interface ILoggerFactory { /// <summary> /// Gets or sets the verbosity of <see cref="ILogger"/> objects. /// </summary> VerbosityLevel VerbosityLevel { get; set; } /// <summary> /// Initializes the logger for the given type. /// </summary> /// <param name="type">The type of the class that uses the logger.</param> /// <returns>The logger.</returns> ILogger GetLogger(Type type); } }

2024-05-22T01:26:28.774034

https://example.com/article/3865

February 2: AFC-NFC Pro Bowl, Honolulu, Hawaii (ABC). 18-24: Scouting Combine, Indianapolis, Indiana. 20: Deadline for clubs to designate franchise and transition players. 24: NFL Europe League training camps open. 27: Deadline for submission of qualifying offers by clubs to their restricted free agents whose contracts have expired and to whom they desire to retain a right of first refusal/compensation; Deadline for clubs to submit offer of minimum salary to retain exclusive negotiating rights to their players with fewer than three seasons of free agency credit whose contracts have expired. 28: Veteran free agency signing period begins; Trading period begins March 23-26: NFL Annual Meeting, Phoenix, Arizona. April 5: NFL Europe League season begins. 18: Signing period ends for restricted free agents. 25: Deadline for old club to exercise right of first refusal to restricted free agents. 26-27: NFL Draft, New York City. May 20-21: NFL Spring Meeting, Philadelphia, Pennsylvania. June 1: Deadline for old clubs to send tender to unsigned unrestricted free agents to receive exclusive negotiating rights for rest of season if player is not signed by another club by July 22; Deadline for old clubs to send tender to unsigned restricted free agents or to extend qualifying offer to retain exclusive negotiating rights. 8: NFL Europe League regular season ends. 14: World Bowl XI, Glasgow, Scotland. 15: Deadline for old clubs to withdraw original qualifying offer to unsigned restricted free agents and still retain exclusive negotiating rights by substituting tender of 110 percent of previous year’s salary. July 22: Signing period ends at 4:00 PM ET for unrestricted free agents who received June 1 tender.

2024-06-17T01:26:28.774034

https://example.com/article/6496

The telecommunication landscape, within a typical home or office, may encompass a number of independently developed radio access technologies and standards. These technologies were initially designed for target applications and they perform relatively well for these applications.

2023-09-15T01:26:28.774034

https://example.com/article/4467

// @(#)root/hist:$Id$ // Author: Rene Brun 12/12/94 /************************************************************************* * Copyright (C) 1995-2000, Rene Brun and Fons Rademakers. * * All rights reserved. * * * * For the licensing terms see $ROOTSYS/LICENSE. * * For the list of contributors see $ROOTSYS/README/CREDITS. * *************************************************************************/ #ifndef ROOT_TAxis #define ROOT_TAxis ////////////////////////////////////////////////////////////////////////// // // // TAxis // // // // Axis class. // // // ////////////////////////////////////////////////////////////////////////// #include "TNamed.h" #include "TAttAxis.h" #include "TArrayD.h" class THashList; class TAxis : public TNamed, public TAttAxis { private: Int_t fNbins; //Number of bins Double_t fXmin; //low edge of first bin Double_t fXmax; //upper edge of last bin TArrayD fXbins; //Bin edges array in X Int_t fFirst; //first bin to display Int_t fLast; //last bin to display UShort_t fBits2; //second bit status word Bool_t fTimeDisplay; //on/off displaying time values instead of numerics TString fTimeFormat; //Date&time format, ex: 09/12/99 12:34:00 TObject *fParent; //!Object owning this axis THashList *fLabels; //List of labels TList *fModLabs; //List of modified labels // TAxis extra status bits (stored in fBits2) enum { kAlphanumeric = BIT(0), // axis is alphanumeric kCanExtend = BIT(1), // axis can be extended kNotAlpha = BIT(2) // axis is forced to be not alphanumeric }; Bool_t HasBinWithoutLabel() const; public: // TAxis status bits enum EStatusBits { kDecimals = BIT(7), kTickPlus = BIT(9), kTickMinus = BIT(10), kAxisRange = BIT(11), kCenterTitle = BIT(12), kCenterLabels = BIT(14), //bit 13 is used by TObject kRotateTitle = BIT(15), kPalette = BIT(16), kNoExponent = BIT(17), kLabelsHori = BIT(18), kLabelsVert = BIT(19), kLabelsDown = BIT(20), kLabelsUp = BIT(21), kIsInteger = BIT(22), kMoreLogLabels = BIT(23) }; TAxis(); TAxis(Int_t nbins, Double_t xmin, Double_t xmax); TAxis(Int_t nbins, const Double_t *xbins); TAxis(const TAxis &axis); virtual ~TAxis(); TAxis& operator=(const TAxis&); Bool_t CanExtend() const { return (fBits2 & kCanExtend); } Bool_t CanBeAlphanumeric() { return !(fBits2 & kNotAlpha); } Bool_t IsAlphanumeric() const { return fBits2 & kAlphanumeric; } void SetAlphanumeric(Bool_t alphanumeric = kTRUE); void SetCanExtend(Bool_t canExtend) { fBits2 = canExtend ? (fBits2 | kCanExtend) : (fBits2 & ~kCanExtend); } void SetNoAlphanumeric(Bool_t noalpha = kTRUE) { fBits2 = noalpha ? (fBits2 | kNotAlpha) : (fBits2 & ~kNotAlpha); if (IsAlphanumeric() ) { SetCanExtend(kFALSE); SetAlphanumeric(kFALSE); } } void CenterLabels(Bool_t center=kTRUE); void CenterTitle(Bool_t center=kTRUE); const char *ChooseTimeFormat(Double_t axislength=0); virtual void Copy(TObject &axis) const; virtual void Delete(Option_t * /*option*/ ="") { } virtual Int_t DistancetoPrimitive(Int_t px, Int_t py); virtual TObject *DrawClone(Option_t * /*option*/ ="") const {return 0;} virtual void ExecuteEvent(Int_t event, Int_t px, Int_t py); virtual Int_t FindBin(Double_t x); virtual Int_t FindBin(Double_t x) const { return FindFixBin(x); } virtual Int_t FindBin(const char *label); virtual Int_t FindFixBin(Double_t x) const; virtual Int_t FindFixBin(const char *label) const; virtual Double_t GetBinCenter(Int_t bin) const; virtual Double_t GetBinCenterLog(Int_t bin) const; const char *GetBinLabel(Int_t bin) const; virtual Double_t GetBinLowEdge(Int_t bin) const; virtual Double_t GetBinUpEdge(Int_t bin) const; virtual Double_t GetBinWidth(Int_t bin) const; virtual void GetCenter(Double_t *center) const; Bool_t GetCenterLabels() const { return TestBit(kCenterLabels); } Bool_t GetCenterTitle() const { return TestBit(kCenterTitle); } Bool_t GetDecimals() const { return TestBit(kDecimals); } THashList *GetLabels() const { return fLabels; } TList *GetModifiedLabels() const { return fModLabs; } virtual void GetLowEdge(Double_t *edge) const; Bool_t GetMoreLogLabels() const { return TestBit(kMoreLogLabels); } Int_t GetNbins() const { return fNbins; } Bool_t GetNoExponent() const { return TestBit(kNoExponent); } virtual TObject *GetParent() const {return fParent;} Bool_t GetRotateTitle() const { return TestBit(kRotateTitle); } virtual const char *GetTicks() const; virtual Bool_t GetTimeDisplay() const {return fTimeDisplay;} virtual const char *GetTimeFormat() const {return fTimeFormat.Data();} virtual const char *GetTimeFormatOnly() const; const char *GetTitle() const {return fTitle.Data();} const TArrayD *GetXbins() const {return &fXbins;} Int_t GetFirst() const; Int_t GetLast() const; Double_t GetXmin() const {return fXmin;} Double_t GetXmax() const {return fXmax;} virtual void ImportAttributes(const TAxis *axis); Bool_t IsVariableBinSize() const { // true if axis has variable bin sizes, false otherwise return (fXbins.GetSize() != 0); } virtual void LabelsOption(Option_t *option="h"); // *MENU* void RotateTitle(Bool_t rotate=kTRUE); // *TOGGLE* *GETTER=GetRotateTitle virtual void SaveAttributes(std::ostream &out, const char *name, const char *subname); virtual void Set(Int_t nbins, Double_t xmin, Double_t xmax); virtual void Set(Int_t nbins, const Float_t *xbins); virtual void Set(Int_t nbins, const Double_t *xbins); virtual void SetBinLabel(Int_t bin, const char *label); void SetDecimals(Bool_t dot = kTRUE); // *TOGGLE* *GETTER=GetDecimals virtual void SetDefaults(); virtual void SetDrawOption(Option_t * /*option*/ ="") { } void ChangeLabel(Int_t labNum=0, Double_t labAngle = -1., Double_t labSize = -1., Int_t labAlign = -1, Int_t labColor = -1 , Int_t labFont = -1, TString labText = ""); // *MENU* virtual void SetLimits(Double_t xmin, Double_t xmax) { /* set axis limits */ fXmin = xmin; fXmax = xmax; } // *MENU* void SetMoreLogLabels(Bool_t more=kTRUE); // *TOGGLE* *GETTER=GetMoreLogLabels void SetNoExponent(Bool_t noExponent=kTRUE); // *TOGGLE* *GETTER=GetNoExponent virtual void SetParent(TObject *obj) {fParent = obj;} virtual void SetRange(Int_t first=0, Int_t last=0); // *MENU* virtual void SetRangeUser(Double_t ufirst, Double_t ulast); // *MENU* virtual void SetTicks(Option_t *option="+"); // *MENU* virtual void SetTimeDisplay(Int_t value) {fTimeDisplay = (value != 0);} // *TOGGLE* virtual void SetTimeFormat(const char *format=""); // *MENU* virtual void SetTimeOffset(Double_t toffset, Option_t *option="local"); virtual void UnZoom(); // *MENU* virtual void ZoomOut(Double_t factor=0, Double_t offset=0); // *MENU* ClassDef(TAxis,10) //Axis class }; //////////////////////////////////////////////////////////////////////////////// /// Center axis labels. If center = kTRUE axis labels will be centered /// (hori axes only) on the bin center default is to center on the primary tick marks /// This option does not make sense if there are more bins than tick marks inline void TAxis::CenterLabels(Bool_t center) { SetBit(kCenterLabels, center); } //////////////////////////////////////////////////////////////////////////////// /// Center axis title. If center = kTRUE axis title will be centered /// default is right adjusted inline void TAxis::CenterTitle(Bool_t center) { SetBit(kCenterTitle, center); } //////////////////////////////////////////////////////////////////////////////// /// Rotate title by 180 degrees. By default the title is drawn right adjusted. /// If rotate is TRUE, the title is left adjusted at the end of the axis and rotated by 180 degrees inline void TAxis::RotateTitle(Bool_t rotate) { SetBit(kRotateTitle, rotate); } //////////////////////////////////////////////////////////////////////////////// /// Sets the decimals flag /// By default, blank characters are stripped, and then the label is correctly aligned. /// If the dot is the last character of the string, it is also stripped, unless this option is specified. inline void TAxis::SetDecimals(Bool_t dot) { SetBit(kDecimals, dot); } //////////////////////////////////////////////////////////////////////////////// /// Set the kMoreLogLabels bit flag /// When this option is selected more labels are drawn when in log scale and there is a small number /// of decades (<3). /// The flag (in fBits) is passed to the drawing function TGaxis::PaintAxis inline void TAxis::SetMoreLogLabels(Bool_t more) { SetBit(kMoreLogLabels, more); } //////////////////////////////////////////////////////////////////////////////// /// Set the NoExponent flag /// By default, an exponent of the form 10^N is used when the label value are either all very small or very large. /// The flag (in fBits) is passed to the drawing function TGaxis::PaintAxis inline void TAxis::SetNoExponent(Bool_t noExponent) { SetBit(kNoExponent, noExponent); } #endif

2024-06-29T01:26:28.774034

https://example.com/article/9429