text stringlengths 12 4.76M | timestamp stringlengths 26 26 | url stringlengths 32 32 |
|---|---|---|
How to Create a Retirement Paycheck
Fall is the time of year when people are most inclined to take action regarding their financial planning. Summer is over, the kids are back into the school routine, the income taxes are filed by the October 15 extension date, and Thanksgiving is still over a month away. This month I am writing about the different strategies used to generate retirement income.
Even if you are years from retirement, the decisions you are making now can have a profound effect on your financial security later. There are many different income strategies and each has its strengths and weaknesses to consider. It is also possible to combine strategies and that is the approach that we often recommend.
Pension: A pension is a retirement account that an employer maintains to provide retired employees with either a lump sum at retirement or monthly payments throughout retirement. The primary advantages of a pension plan are its simplicity and the fact that payments are usually made for the life of the retiree, no matter how long that may be. The main disadvantages are that the payments are not always guaranteed (remember the United Airlines bankruptcy?), payments often do not increase with inflation, and there are typically no assets remaining at death for heirs. Additionally, many pensions require you to work for the company for many years (20, 25, etc), and sometimes employees leave or are forced to leave before vesting in their pension.
Social Security: Social Security is a “pension” that most US taxpayers and their spouses qualify for but unlike most other pensions, payments are adjusted annually for inflation. There are many different ways to claim benefits and we work with our clients to help them coordinate their claiming strategies between spouses to maximize lifetime payouts. Social Security is often the foundation of many families' retirement plan but in recent years there have been numerous attempts by politicians to decrease the benefits from Social Security because the Social Security Trust Fund is woefully underfunded. Many people are probably too dependent on Social Security rather than their own investments.
Annuities: A fixed annuity is a contract with an insurance company where the client makes a deposit in exchange for a stream of payments in the future – similar to a pension. Payments can be lifetime, as in the case of pension, or they can also be designed to be paid out over a specific period of time such as 5, 10 or 20 years. The size of the monthly payments is guaranteed as part of the contract and is not affected by market fluctuations. A variable annuity is also a contract with an insurance company where the client can make one or more deposits and these funds are invested by the insurance company in diversified “separate accounts” that behave much like mutual funds. These contracts can be extremely complex and often have rather high expenses – sometimes more than 3% total per year. Another thing to be aware of is that these financial products often pay financial advisors an up-front commission of 7% or more. Fixed indexed annuities are hybrid products that have some of the characteristics of each and can also pay high commissions.
Income Portfolio: In the past when interest rates were higher a common strategy was to invest your retirement savings into low-risk bonds to generate reliable monthly income. Since rates are so low now this strategy is only viable if you have very modest needs or a very large retirement portfolio. With the 10 year US Treasury bond now paying 2.1% a portfolio of over $4.7M is needed to generate $100,000 per year.
Total Return Portfolio: A common current strategy is to invest in a single diversified stock and bond portfolio and withdraw a specific percentage per year, such as 4%. With this approach, the amount ofcapital required to generate $100,000 per year is reduced to $2.5M and if markets return historical averages, it is likely the annual income can increase with inflation. The main disadvantage is that this strategy is vulnerable to large market declines within 5 years of retirement. After a significant correction the proportionally larger withdrawals can deplete the portfolio to levels where payments will need to be lowered and the portfolio can even be depleted during retirement. Another major challenge with the pure total return approach is that retirees over time often tire of nervously watching their account balance swing up and down and they end shifting to a lower-volatility portfolio that will lower their return and monthly income.
What if you could combine the security of contractually guaranteed monthly payments with the long-term growth of total return investing? We as Investment Advisor Representatives of Stewardship Advisory Group believe that investments that fluctuate in value offer the potential for superior long-term growth, but we also recognize that portfolio volatility often leads to investor fatigue, particularly with retirees. One strategy we use to optimize retirement income involves both 5-year fixed annuities and diversified total return portfolios, segmented into 5-year “buckets.” Income is generated by the fixed annuity and the remaining assets are invested for increasingly higher target return rates (and volatility) according to how much time remains for those assets to grow before they will be needed to generate income. When a segment grows to the amount needed it is converted to a fixed annuity to lock in the gains and ability to generate the needed income.
Often one of the first things we do with new clients is help them restructure their overall portfolio of investments to reduce expenses and increase efficiency. Sometimes this involves transitioning away from expensive products that no longer serve a useful role. We would be happy to share our thoughts further with you if you are curious. Please call Jenny at 303.900.4018 to schedule a conversation or visit us at http://stewardshipcolorado.com to learn more.
Quick Links
Check the background of your financial professional on FINRA's BrokerCheck.
The content is developed from sources believed to be providing accurate information.
The information in this material is not intended as tax or legal advice. Please consult legal or tax professionals
for specific information regarding your individual situation. Some of this material was developed and produced by
FMG Suite to provide information on a topic that may be of interest. FMG Suite is not affiliated with the named
representative, broker - dealer, state - or SEC - registered investment advisory firm. The opinions expressed and
material provided are for general information, and should not be considered a solicitation for the purchase or
sale of any security.
This information is intended for use only by residents of CA, CO, CT, IN, KS, NC, NY, OH, OK, TN, TX, VA, WA, WY. Securities-related services may not be provided to individuals residing in any state not listed above. Insurance-related services may not be provided to individuals residing in any states other than CA, CO, IN, NY, OH, OK, VA, WA, WY. | 2024-01-04T01:26:19.665474 | https://example.com/article/9054 |
Q:
Visual studio online Rest Api query- Get results sorted by a field
I am querying visual studio online API to get a list of work items. The result that I get is by default sorted based on the work item ID. I am trying to get the result sorted by TargetedDate field.
Any idea on how to specify the sort column in the rest query?
Thanks in advance...
A:
I think you might have to build a WIQL query using an ID in (1,2,3) filter and execute it.
That way you can specify sorting as ORDER BY TargetDate.
For example:
POST
https://fabrikam.visualstudio.com/DefaultCollection/Fabrikam-Fiber-Git/_apis/wit/wiql?api-version=1.0
Content-Type: application/json
{
"query": "Select ID From WorkItems Where ID in (1,2,3) ORDER BY TargetDate ASC"
}
More info on the API and WIQL syntax is available on MSDN Docs.
Or....
Just sort it client-side ;)
| 2024-06-11T01:26:19.665474 | https://example.com/article/9091 |
Oskar Kohnstamm
Dr. Oskar Felix Kohnstamm (13 April 1871 in Pfungstadt – 6 November 1917 in Frankfurt am Main) was a German neurologist and psychiatrist. Initially trained in internal medicine in Giessen and Strassbourg he received his doctors degree in Berlin in 1894. Kohnstamm then began as a general practitioner in Königstein im Taunus, a small town in Hesse. There, he became more and more interested in neurology and psychiatry.
His wife, Eva, daughter of Johannes Gad - one of Kohnstamm's Berlin professors, agreed to have occasionally depressive patients as guests in the house, who then got chores assigned in housekeeping, gardening or minding the children. Gradually, the idea ripened to build a small sanatorium for treating clinical depressions. The house, build in Jugendstil style, opened in 1905 and was expanded in 1912.
Kohnstamm was no follower of Sigmund Freud but worked often with hypnosis.
Among his patients were three young men who would become world-famous: the painter Ernst Ludwig Kirchner (1880-1938), the actor Alexander Moissi (1879-1935) and the conductor Otto Klemperer (1885-1973).
Even the playwright Carl Sternheim (1878 – 1942) has been in medical treatment in Kohnstamms sanatorium during the First World War. The poets Stefan George, Karl Wolfskehl, the archaeologist Botho Graef and the architect Henry van de Velde have been friends of him. Gertrude Kingston was a cousin of him, Phyllis Konstam a niece. The tale Peter and Anneli's Journey to the Moon, which was written by a former patient Gerdt von Bassewitz, was playing in his sanatorium with his children as the main character.
See also
Kohnstamm's phenomenon
References
Kohnstamm, Oskar (1927) Erscheinungsforme der Seele. Munich: Ernst Reinhardt Verlag.
Laudenheimer, R. (1927) Oskar Kohnstamm, eine biographische Skizze. In Kohnstamm,O. Erscheinungsformen der Seele.
Heyworth, Peter (1983) Otto Klemperer, his life and times, Vol. 1. Cambridge: Cambridge University Press.
Grisebach, Lucius (1996) Ernst Ludwig Kirchner, 1880-1938. Cologne: Benedikt Taschen Verlag.
Grossmann-Hofman, B.(1992) Ernst Ludwig Kirchner in Königstein. Königstein: City archive.
Kohnstamm, Peter (1994) Lieder eines fahrenden Gesellen - Erinnerungen an vergangene Zeiten, Königstein im Taunus
http://www.geni.com/people/Gertrude-Angela-Kingston/6000000020871659167
http://www.geni.com/people/Phyllis-Konstam/6000000016171975409
Category:1871 births
Category:1917 deaths
Category:German Jews
Category:German neurologists
Category:German psychiatrists | 2023-09-15T01:26:19.665474 | https://example.com/article/1655 |
A recent Wall Street Journal article outlines the increasing efforts at a number of B-schools to beef up their focus on ethics. While the article also points out the challenge of measuring the return for this investment, there is no doubting the havoc created when ethical behavior is not followed.
Increasing ethics training in school is a good start, but from my experience leaders must double-down on the job as well, with consistent actions to ensure that a culture of ethical behavior is the most visible attribute in an organization. From a cost/benefit perspective, focusing on ethical behavior may be the only area where it makes sense to “kill a flee with a sledgehammer.”
Personally, as an undergraduate I was fortunate to attend Bentley University which started its Center of Business Ethics in 1976. Bentley’s focus on ethics helped me translate what I had learned growing up into the world of business.
At my very first job as a computer sales rep, I was assigned to the local government market in Massachusetts. There I learned quickly that ethics were a really big deal and the different rules in the public and private sectors. I remember making sure we had a clearly identified “cash cup” next to the coffee machine for government prospects to deposit their 25 cents. Since I was prohibited from any social contact with prospects or customers, my golf game never improved. I was well aware that violating the rules could cause disbarment from all government prospects in Massachusetts.
Later serving as President at AT&T’s Global Services Division, I made sure we mandated training for our global work force to ensure they understood every detail of behavior expected of them as part of a US company doing work abroad as laid out in the Foreign Corrupt Practices Act (FCPA). We required annual training certification including an understanding that violations could result in jail time, and ensured leaders at all levels regularly included related topics in monthly agendas.
In another assignment, I served as President at an internet start-up and did not have access to the resources of an AT&T to build formal ethics training programs. Our management team met regularly to discuss how we could include integrity as part of our daily discussions with our young workforce.
In my last corporate assignment, I served as President of Lucent’s Government Solutions Division. Serving the Federal Government involves a whole new level of rules and regulations. We set up a Compliance Office to ensure we took every step possible to set the right tone in our organization that ethics was our top priority. We used mandatory training, monthly newsletters, and regularly included compliance as a meeting agenda topic to ensure appropriate attention on ethics.
The (WSJ) article points out that everyone likely knows the meaning of right and wrong, but business has run under an axiom for a long time: if it is important, then you measure it. Measuring the implications of culture is not well understood. Harvard researchers Jim Heskett & John Kotter provide just such a study in their book Corporate Culture and Performance. Their research proves a values-based, change adaptive culture drives sustainable, measurable growth.
Some still believe ethics, like culture, is “soft.” Legendary management guru Peter Drucker said “what’s soft is hard and what’s hard is soft.” Translation: this stuff matters… a lot.
In my view, an organization has nothing more important than its reputation and leaders must make ethical behavior Job #1 and an active part of their objectives. In addition to good hiring and strong internal audit practices, robust training programs and constant reinforcement can help companies of all sizes support good choices. Ethical behavior is the key to long-term success with customers, employees, suppliers, partners, and the community at large.
My recommendation: educate and reinforce the importance of ethics early and often…and bring out the sledgehammer. | 2023-08-07T01:26:19.665474 | https://example.com/article/3884 |
Poll: 43 Percent of Americans Say Relative or Close Friend Has Substance Use Issue
A new poll finds 43 percent of Americans say they have a relative or close friend with a substance use issue, and 62 percent say at least one type of substance use is a serious problem in their community, the Associated Press reports.
The national Associated Press-NORC Center for Public Affairs Research poll found seven in 10 Americans believe not enough is being done to find better addiction treatment or to make treatment programs more accessible. Sixty-one percent want to see more effort made to crack down on drug dealers.
The poll found 61 percent of respondents said they support legalizing marijuana. One-third endorse legalization with no restrictions, while 43 percent say there should be restrictions on purchase amounts. One-quarter of those who support legalization only approve of its use when prescribed by a doctor.
Only 21 percent of respondents said all or most doctors and dentists regularly prescribe painkillers more than is necessary. Of those who think even a few doctors and dentists overprescribe painkillers, 89 percent believe this practice contributes to drug dependence and overdoses.
“There is mounting evidence that drug abuse is having a serious impact on communities across the U.S. We found that Americans want to see improvements to treatments for users but also punishment for drug dealers,” Trevor Tompson, Director of the Associated Press-NORC Center, said in a news release. “This survey provides policymakers with specific information about how the American people understand the problem and the solutions they support.” | 2023-09-04T01:26:19.665474 | https://example.com/article/5606 |
// SPDX-License-Identifier: GPL-2.0-or-later
/*
* Copyright (C) 2012-2013 Samsung Electronics Co., Ltd.
*/
#include <linux/string.h>
#include <linux/slab.h>
#include <linux/buffer_head.h>
#include <asm/unaligned.h>
#include "exfat_raw.h"
#include "exfat_fs.h"
/* Upcase tabel macro */
#define EXFAT_NUM_UPCASE (2918)
#define UTBL_COUNT (0x10000)
/*
* Upcase table in compressed format (7.2.5.1 Recommended Up-case Table
* in exfat specification, See:
* https://docs.microsoft.com/en-us/windows/win32/fileio/exfat-specification).
*/
static const unsigned short uni_def_upcase[EXFAT_NUM_UPCASE] = {
0x0000, 0x0001, 0x0002, 0x0003, 0x0004, 0x0005, 0x0006, 0x0007,
0x0008, 0x0009, 0x000a, 0x000b, 0x000c, 0x000d, 0x000e, 0x000f,
0x0010, 0x0011, 0x0012, 0x0013, 0x0014, 0x0015, 0x0016, 0x0017,
0x0018, 0x0019, 0x001a, 0x001b, 0x001c, 0x001d, 0x001e, 0x001f,
0x0020, 0x0021, 0x0022, 0x0023, 0x0024, 0x0025, 0x0026, 0x0027,
0x0028, 0x0029, 0x002a, 0x002b, 0x002c, 0x002d, 0x002e, 0x002f,
0x0030, 0x0031, 0x0032, 0x0033, 0x0034, 0x0035, 0x0036, 0x0037,
0x0038, 0x0039, 0x003a, 0x003b, 0x003c, 0x003d, 0x003e, 0x003f,
0x0040, 0x0041, 0x0042, 0x0043, 0x0044, 0x0045, 0x0046, 0x0047,
0x0048, 0x0049, 0x004a, 0x004b, 0x004c, 0x004d, 0x004e, 0x004f,
0x0050, 0x0051, 0x0052, 0x0053, 0x0054, 0x0055, 0x0056, 0x0057,
0x0058, 0x0059, 0x005a, 0x005b, 0x005c, 0x005d, 0x005e, 0x005f,
0x0060, 0x0041, 0x0042, 0x0043, 0x0044, 0x0045, 0x0046, 0x0047,
0x0048, 0x0049, 0x004a, 0x004b, 0x004c, 0x004d, 0x004e, 0x004f,
0x0050, 0x0051, 0x0052, 0x0053, 0x0054, 0x0055, 0x0056, 0x0057,
0x0058, 0x0059, 0x005a, 0x007b, 0x007c, 0x007d, 0x007e, 0x007f,
0x0080, 0x0081, 0x0082, 0x0083, 0x0084, 0x0085, 0x0086, 0x0087,
0x0088, 0x0089, 0x008a, 0x008b, 0x008c, 0x008d, 0x008e, 0x008f,
0x0090, 0x0091, 0x0092, 0x0093, 0x0094, 0x0095, 0x0096, 0x0097,
0x0098, 0x0099, 0x009a, 0x009b, 0x009c, 0x009d, 0x009e, 0x009f,
0x00a0, 0x00a1, 0x00a2, 0x00a3, 0x00a4, 0x00a5, 0x00a6, 0x00a7,
0x00a8, 0x00a9, 0x00aa, 0x00ab, 0x00ac, 0x00ad, 0x00ae, 0x00af,
0x00b0, 0x00b1, 0x00b2, 0x00b3, 0x00b4, 0x00b5, 0x00b6, 0x00b7,
0x00b8, 0x00b9, 0x00ba, 0x00bb, 0x00bc, 0x00bd, 0x00be, 0x00bf,
0x00c0, 0x00c1, 0x00c2, 0x00c3, 0x00c4, 0x00c5, 0x00c6, 0x00c7,
0x00c8, 0x00c9, 0x00ca, 0x00cb, 0x00cc, 0x00cd, 0x00ce, 0x00cf,
0x00d0, 0x00d1, 0x00d2, 0x00d3, 0x00d4, 0x00d5, 0x00d6, 0x00d7,
0x00d8, 0x00d9, 0x00da, 0x00db, 0x00dc, 0x00dd, 0x00de, 0x00df,
0x00c0, 0x00c1, 0x00c2, 0x00c3, 0x00c4, 0x00c5, 0x00c6, 0x00c7,
0x00c8, 0x00c9, 0x00ca, 0x00cb, 0x00cc, 0x00cd, 0x00ce, 0x00cf,
0x00d0, 0x00d1, 0x00d2, 0x00d3, 0x00d4, 0x00d5, 0x00d6, 0x00f7,
0x00d8, 0x00d9, 0x00da, 0x00db, 0x00dc, 0x00dd, 0x00de, 0x0178,
0x0100, 0x0100, 0x0102, 0x0102, 0x0104, 0x0104, 0x0106, 0x0106,
0x0108, 0x0108, 0x010a, 0x010a, 0x010c, 0x010c, 0x010e, 0x010e,
0x0110, 0x0110, 0x0112, 0x0112, 0x0114, 0x0114, 0x0116, 0x0116,
0x0118, 0x0118, 0x011a, 0x011a, 0x011c, 0x011c, 0x011e, 0x011e,
0x0120, 0x0120, 0x0122, 0x0122, 0x0124, 0x0124, 0x0126, 0x0126,
0x0128, 0x0128, 0x012a, 0x012a, 0x012c, 0x012c, 0x012e, 0x012e,
0x0130, 0x0131, 0x0132, 0x0132, 0x0134, 0x0134, 0x0136, 0x0136,
0x0138, 0x0139, 0x0139, 0x013b, 0x013b, 0x013d, 0x013d, 0x013f,
0x013f, 0x0141, 0x0141, 0x0143, 0x0143, 0x0145, 0x0145, 0x0147,
0x0147, 0x0149, 0x014a, 0x014a, 0x014c, 0x014c, 0x014e, 0x014e,
0x0150, 0x0150, 0x0152, 0x0152, 0x0154, 0x0154, 0x0156, 0x0156,
0x0158, 0x0158, 0x015a, 0x015a, 0x015c, 0x015c, 0x015e, 0x015e,
0x0160, 0x0160, 0x0162, 0x0162, 0x0164, 0x0164, 0x0166, 0x0166,
0x0168, 0x0168, 0x016a, 0x016a, 0x016c, 0x016c, 0x016e, 0x016e,
0x0170, 0x0170, 0x0172, 0x0172, 0x0174, 0x0174, 0x0176, 0x0176,
0x0178, 0x0179, 0x0179, 0x017b, 0x017b, 0x017d, 0x017d, 0x017f,
0x0243, 0x0181, 0x0182, 0x0182, 0x0184, 0x0184, 0x0186, 0x0187,
0x0187, 0x0189, 0x018a, 0x018b, 0x018b, 0x018d, 0x018e, 0x018f,
0x0190, 0x0191, 0x0191, 0x0193, 0x0194, 0x01f6, 0x0196, 0x0197,
0x0198, 0x0198, 0x023d, 0x019b, 0x019c, 0x019d, 0x0220, 0x019f,
0x01a0, 0x01a0, 0x01a2, 0x01a2, 0x01a4, 0x01a4, 0x01a6, 0x01a7,
0x01a7, 0x01a9, 0x01aa, 0x01ab, 0x01ac, 0x01ac, 0x01ae, 0x01af,
0x01af, 0x01b1, 0x01b2, 0x01b3, 0x01b3, 0x01b5, 0x01b5, 0x01b7,
0x01b8, 0x01b8, 0x01ba, 0x01bb, 0x01bc, 0x01bc, 0x01be, 0x01f7,
0x01c0, 0x01c1, 0x01c2, 0x01c3, 0x01c4, 0x01c5, 0x01c4, 0x01c7,
0x01c8, 0x01c7, 0x01ca, 0x01cb, 0x01ca, 0x01cd, 0x01cd, 0x01cf,
0x01cf, 0x01d1, 0x01d1, 0x01d3, 0x01d3, 0x01d5, 0x01d5, 0x01d7,
0x01d7, 0x01d9, 0x01d9, 0x01db, 0x01db, 0x018e, 0x01de, 0x01de,
0x01e0, 0x01e0, 0x01e2, 0x01e2, 0x01e4, 0x01e4, 0x01e6, 0x01e6,
0x01e8, 0x01e8, 0x01ea, 0x01ea, 0x01ec, 0x01ec, 0x01ee, 0x01ee,
0x01f0, 0x01f1, 0x01f2, 0x01f1, 0x01f4, 0x01f4, 0x01f6, 0x01f7,
0x01f8, 0x01f8, 0x01fa, 0x01fa, 0x01fc, 0x01fc, 0x01fe, 0x01fe,
0x0200, 0x0200, 0x0202, 0x0202, 0x0204, 0x0204, 0x0206, 0x0206,
0x0208, 0x0208, 0x020a, 0x020a, 0x020c, 0x020c, 0x020e, 0x020e,
0x0210, 0x0210, 0x0212, 0x0212, 0x0214, 0x0214, 0x0216, 0x0216,
0x0218, 0x0218, 0x021a, 0x021a, 0x021c, 0x021c, 0x021e, 0x021e,
0x0220, 0x0221, 0x0222, 0x0222, 0x0224, 0x0224, 0x0226, 0x0226,
0x0228, 0x0228, 0x022a, 0x022a, 0x022c, 0x022c, 0x022e, 0x022e,
0x0230, 0x0230, 0x0232, 0x0232, 0x0234, 0x0235, 0x0236, 0x0237,
0x0238, 0x0239, 0x2c65, 0x023b, 0x023b, 0x023d, 0x2c66, 0x023f,
0x0240, 0x0241, 0x0241, 0x0243, 0x0244, 0x0245, 0x0246, 0x0246,
0x0248, 0x0248, 0x024a, 0x024a, 0x024c, 0x024c, 0x024e, 0x024e,
0x0250, 0x0251, 0x0252, 0x0181, 0x0186, 0x0255, 0x0189, 0x018a,
0x0258, 0x018f, 0x025a, 0x0190, 0x025c, 0x025d, 0x025e, 0x025f,
0x0193, 0x0261, 0x0262, 0x0194, 0x0264, 0x0265, 0x0266, 0x0267,
0x0197, 0x0196, 0x026a, 0x2c62, 0x026c, 0x026d, 0x026e, 0x019c,
0x0270, 0x0271, 0x019d, 0x0273, 0x0274, 0x019f, 0x0276, 0x0277,
0x0278, 0x0279, 0x027a, 0x027b, 0x027c, 0x2c64, 0x027e, 0x027f,
0x01a6, 0x0281, 0x0282, 0x01a9, 0x0284, 0x0285, 0x0286, 0x0287,
0x01ae, 0x0244, 0x01b1, 0x01b2, 0x0245, 0x028d, 0x028e, 0x028f,
0x0290, 0x0291, 0x01b7, 0x0293, 0x0294, 0x0295, 0x0296, 0x0297,
0x0298, 0x0299, 0x029a, 0x029b, 0x029c, 0x029d, 0x029e, 0x029f,
0x02a0, 0x02a1, 0x02a2, 0x02a3, 0x02a4, 0x02a5, 0x02a6, 0x02a7,
0x02a8, 0x02a9, 0x02aa, 0x02ab, 0x02ac, 0x02ad, 0x02ae, 0x02af,
0x02b0, 0x02b1, 0x02b2, 0x02b3, 0x02b4, 0x02b5, 0x02b6, 0x02b7,
0x02b8, 0x02b9, 0x02ba, 0x02bb, 0x02bc, 0x02bd, 0x02be, 0x02bf,
0x02c0, 0x02c1, 0x02c2, 0x02c3, 0x02c4, 0x02c5, 0x02c6, 0x02c7,
0x02c8, 0x02c9, 0x02ca, 0x02cb, 0x02cc, 0x02cd, 0x02ce, 0x02cf,
0x02d0, 0x02d1, 0x02d2, 0x02d3, 0x02d4, 0x02d5, 0x02d6, 0x02d7,
0x02d8, 0x02d9, 0x02da, 0x02db, 0x02dc, 0x02dd, 0x02de, 0x02df,
0x02e0, 0x02e1, 0x02e2, 0x02e3, 0x02e4, 0x02e5, 0x02e6, 0x02e7,
0x02e8, 0x02e9, 0x02ea, 0x02eb, 0x02ec, 0x02ed, 0x02ee, 0x02ef,
0x02f0, 0x02f1, 0x02f2, 0x02f3, 0x02f4, 0x02f5, 0x02f6, 0x02f7,
0x02f8, 0x02f9, 0x02fa, 0x02fb, 0x02fc, 0x02fd, 0x02fe, 0x02ff,
0x0300, 0x0301, 0x0302, 0x0303, 0x0304, 0x0305, 0x0306, 0x0307,
0x0308, 0x0309, 0x030a, 0x030b, 0x030c, 0x030d, 0x030e, 0x030f,
0x0310, 0x0311, 0x0312, 0x0313, 0x0314, 0x0315, 0x0316, 0x0317,
0x0318, 0x0319, 0x031a, 0x031b, 0x031c, 0x031d, 0x031e, 0x031f,
0x0320, 0x0321, 0x0322, 0x0323, 0x0324, 0x0325, 0x0326, 0x0327,
0x0328, 0x0329, 0x032a, 0x032b, 0x032c, 0x032d, 0x032e, 0x032f,
0x0330, 0x0331, 0x0332, 0x0333, 0x0334, 0x0335, 0x0336, 0x0337,
0x0338, 0x0339, 0x033a, 0x033b, 0x033c, 0x033d, 0x033e, 0x033f,
0x0340, 0x0341, 0x0342, 0x0343, 0x0344, 0x0345, 0x0346, 0x0347,
0x0348, 0x0349, 0x034a, 0x034b, 0x034c, 0x034d, 0x034e, 0x034f,
0x0350, 0x0351, 0x0352, 0x0353, 0x0354, 0x0355, 0x0356, 0x0357,
0x0358, 0x0359, 0x035a, 0x035b, 0x035c, 0x035d, 0x035e, 0x035f,
0x0360, 0x0361, 0x0362, 0x0363, 0x0364, 0x0365, 0x0366, 0x0367,
0x0368, 0x0369, 0x036a, 0x036b, 0x036c, 0x036d, 0x036e, 0x036f,
0x0370, 0x0371, 0x0372, 0x0373, 0x0374, 0x0375, 0x0376, 0x0377,
0x0378, 0x0379, 0x037a, 0x03fd, 0x03fe, 0x03ff, 0x037e, 0x037f,
0x0380, 0x0381, 0x0382, 0x0383, 0x0384, 0x0385, 0x0386, 0x0387,
0x0388, 0x0389, 0x038a, 0x038b, 0x038c, 0x038d, 0x038e, 0x038f,
0x0390, 0x0391, 0x0392, 0x0393, 0x0394, 0x0395, 0x0396, 0x0397,
0x0398, 0x0399, 0x039a, 0x039b, 0x039c, 0x039d, 0x039e, 0x039f,
0x03a0, 0x03a1, 0x03a2, 0x03a3, 0x03a4, 0x03a5, 0x03a6, 0x03a7,
0x03a8, 0x03a9, 0x03aa, 0x03ab, 0x0386, 0x0388, 0x0389, 0x038a,
0x03b0, 0x0391, 0x0392, 0x0393, 0x0394, 0x0395, 0x0396, 0x0397,
0x0398, 0x0399, 0x039a, 0x039b, 0x039c, 0x039d, 0x039e, 0x039f,
0x03a0, 0x03a1, 0x03a3, 0x03a3, 0x03a4, 0x03a5, 0x03a6, 0x03a7,
0x03a8, 0x03a9, 0x03aa, 0x03ab, 0x038c, 0x038e, 0x038f, 0x03cf,
0x03d0, 0x03d1, 0x03d2, 0x03d3, 0x03d4, 0x03d5, 0x03d6, 0x03d7,
0x03d8, 0x03d8, 0x03da, 0x03da, 0x03dc, 0x03dc, 0x03de, 0x03de,
0x03e0, 0x03e0, 0x03e2, 0x03e2, 0x03e4, 0x03e4, 0x03e6, 0x03e6,
0x03e8, 0x03e8, 0x03ea, 0x03ea, 0x03ec, 0x03ec, 0x03ee, 0x03ee,
0x03f0, 0x03f1, 0x03f9, 0x03f3, 0x03f4, 0x03f5, 0x03f6, 0x03f7,
0x03f7, 0x03f9, 0x03fa, 0x03fa, 0x03fc, 0x03fd, 0x03fe, 0x03ff,
0x0400, 0x0401, 0x0402, 0x0403, 0x0404, 0x0405, 0x0406, 0x0407,
0x0408, 0x0409, 0x040a, 0x040b, 0x040c, 0x040d, 0x040e, 0x040f,
0x0410, 0x0411, 0x0412, 0x0413, 0x0414, 0x0415, 0x0416, 0x0417,
0x0418, 0x0419, 0x041a, 0x041b, 0x041c, 0x041d, 0x041e, 0x041f,
0x0420, 0x0421, 0x0422, 0x0423, 0x0424, 0x0425, 0x0426, 0x0427,
0x0428, 0x0429, 0x042a, 0x042b, 0x042c, 0x042d, 0x042e, 0x042f,
0x0410, 0x0411, 0x0412, 0x0413, 0x0414, 0x0415, 0x0416, 0x0417,
0x0418, 0x0419, 0x041a, 0x041b, 0x041c, 0x041d, 0x041e, 0x041f,
0x0420, 0x0421, 0x0422, 0x0423, 0x0424, 0x0425, 0x0426, 0x0427,
0x0428, 0x0429, 0x042a, 0x042b, 0x042c, 0x042d, 0x042e, 0x042f,
0x0400, 0x0401, 0x0402, 0x0403, 0x0404, 0x0405, 0x0406, 0x0407,
0x0408, 0x0409, 0x040a, 0x040b, 0x040c, 0x040d, 0x040e, 0x040f,
0x0460, 0x0460, 0x0462, 0x0462, 0x0464, 0x0464, 0x0466, 0x0466,
0x0468, 0x0468, 0x046a, 0x046a, 0x046c, 0x046c, 0x046e, 0x046e,
0x0470, 0x0470, 0x0472, 0x0472, 0x0474, 0x0474, 0x0476, 0x0476,
0x0478, 0x0478, 0x047a, 0x047a, 0x047c, 0x047c, 0x047e, 0x047e,
0x0480, 0x0480, 0x0482, 0x0483, 0x0484, 0x0485, 0x0486, 0x0487,
0x0488, 0x0489, 0x048a, 0x048a, 0x048c, 0x048c, 0x048e, 0x048e,
0x0490, 0x0490, 0x0492, 0x0492, 0x0494, 0x0494, 0x0496, 0x0496,
0x0498, 0x0498, 0x049a, 0x049a, 0x049c, 0x049c, 0x049e, 0x049e,
0x04a0, 0x04a0, 0x04a2, 0x04a2, 0x04a4, 0x04a4, 0x04a6, 0x04a6,
0x04a8, 0x04a8, 0x04aa, 0x04aa, 0x04ac, 0x04ac, 0x04ae, 0x04ae,
0x04b0, 0x04b0, 0x04b2, 0x04b2, 0x04b4, 0x04b4, 0x04b6, 0x04b6,
0x04b8, 0x04b8, 0x04ba, 0x04ba, 0x04bc, 0x04bc, 0x04be, 0x04be,
0x04c0, 0x04c1, 0x04c1, 0x04c3, 0x04c3, 0x04c5, 0x04c5, 0x04c7,
0x04c7, 0x04c9, 0x04c9, 0x04cb, 0x04cb, 0x04cd, 0x04cd, 0x04c0,
0x04d0, 0x04d0, 0x04d2, 0x04d2, 0x04d4, 0x04d4, 0x04d6, 0x04d6,
0x04d8, 0x04d8, 0x04da, 0x04da, 0x04dc, 0x04dc, 0x04de, 0x04de,
0x04e0, 0x04e0, 0x04e2, 0x04e2, 0x04e4, 0x04e4, 0x04e6, 0x04e6,
0x04e8, 0x04e8, 0x04ea, 0x04ea, 0x04ec, 0x04ec, 0x04ee, 0x04ee,
0x04f0, 0x04f0, 0x04f2, 0x04f2, 0x04f4, 0x04f4, 0x04f6, 0x04f6,
0x04f8, 0x04f8, 0x04fa, 0x04fa, 0x04fc, 0x04fc, 0x04fe, 0x04fe,
0x0500, 0x0500, 0x0502, 0x0502, 0x0504, 0x0504, 0x0506, 0x0506,
0x0508, 0x0508, 0x050a, 0x050a, 0x050c, 0x050c, 0x050e, 0x050e,
0x0510, 0x0510, 0x0512, 0x0512, 0x0514, 0x0515, 0x0516, 0x0517,
0x0518, 0x0519, 0x051a, 0x051b, 0x051c, 0x051d, 0x051e, 0x051f,
0x0520, 0x0521, 0x0522, 0x0523, 0x0524, 0x0525, 0x0526, 0x0527,
0x0528, 0x0529, 0x052a, 0x052b, 0x052c, 0x052d, 0x052e, 0x052f,
0x0530, 0x0531, 0x0532, 0x0533, 0x0534, 0x0535, 0x0536, 0x0537,
0x0538, 0x0539, 0x053a, 0x053b, 0x053c, 0x053d, 0x053e, 0x053f,
0x0540, 0x0541, 0x0542, 0x0543, 0x0544, 0x0545, 0x0546, 0x0547,
0x0548, 0x0549, 0x054a, 0x054b, 0x054c, 0x054d, 0x054e, 0x054f,
0x0550, 0x0551, 0x0552, 0x0553, 0x0554, 0x0555, 0x0556, 0x0557,
0x0558, 0x0559, 0x055a, 0x055b, 0x055c, 0x055d, 0x055e, 0x055f,
0x0560, 0x0531, 0x0532, 0x0533, 0x0534, 0x0535, 0x0536, 0x0537,
0x0538, 0x0539, 0x053a, 0x053b, 0x053c, 0x053d, 0x053e, 0x053f,
0x0540, 0x0541, 0x0542, 0x0543, 0x0544, 0x0545, 0x0546, 0x0547,
0x0548, 0x0549, 0x054a, 0x054b, 0x054c, 0x054d, 0x054e, 0x054f,
0x0550, 0x0551, 0x0552, 0x0553, 0x0554, 0x0555, 0x0556, 0xffff,
0x17f6, 0x2c63, 0x1d7e, 0x1d7f, 0x1d80, 0x1d81, 0x1d82, 0x1d83,
0x1d84, 0x1d85, 0x1d86, 0x1d87, 0x1d88, 0x1d89, 0x1d8a, 0x1d8b,
0x1d8c, 0x1d8d, 0x1d8e, 0x1d8f, 0x1d90, 0x1d91, 0x1d92, 0x1d93,
0x1d94, 0x1d95, 0x1d96, 0x1d97, 0x1d98, 0x1d99, 0x1d9a, 0x1d9b,
0x1d9c, 0x1d9d, 0x1d9e, 0x1d9f, 0x1da0, 0x1da1, 0x1da2, 0x1da3,
0x1da4, 0x1da5, 0x1da6, 0x1da7, 0x1da8, 0x1da9, 0x1daa, 0x1dab,
0x1dac, 0x1dad, 0x1dae, 0x1daf, 0x1db0, 0x1db1, 0x1db2, 0x1db3,
0x1db4, 0x1db5, 0x1db6, 0x1db7, 0x1db8, 0x1db9, 0x1dba, 0x1dbb,
0x1dbc, 0x1dbd, 0x1dbe, 0x1dbf, 0x1dc0, 0x1dc1, 0x1dc2, 0x1dc3,
0x1dc4, 0x1dc5, 0x1dc6, 0x1dc7, 0x1dc8, 0x1dc9, 0x1dca, 0x1dcb,
0x1dcc, 0x1dcd, 0x1dce, 0x1dcf, 0x1dd0, 0x1dd1, 0x1dd2, 0x1dd3,
0x1dd4, 0x1dd5, 0x1dd6, 0x1dd7, 0x1dd8, 0x1dd9, 0x1dda, 0x1ddb,
0x1ddc, 0x1ddd, 0x1dde, 0x1ddf, 0x1de0, 0x1de1, 0x1de2, 0x1de3,
0x1de4, 0x1de5, 0x1de6, 0x1de7, 0x1de8, 0x1de9, 0x1dea, 0x1deb,
0x1dec, 0x1ded, 0x1dee, 0x1def, 0x1df0, 0x1df1, 0x1df2, 0x1df3,
0x1df4, 0x1df5, 0x1df6, 0x1df7, 0x1df8, 0x1df9, 0x1dfa, 0x1dfb,
0x1dfc, 0x1dfd, 0x1dfe, 0x1dff, 0x1e00, 0x1e00, 0x1e02, 0x1e02,
0x1e04, 0x1e04, 0x1e06, 0x1e06, 0x1e08, 0x1e08, 0x1e0a, 0x1e0a,
0x1e0c, 0x1e0c, 0x1e0e, 0x1e0e, 0x1e10, 0x1e10, 0x1e12, 0x1e12,
0x1e14, 0x1e14, 0x1e16, 0x1e16, 0x1e18, 0x1e18, 0x1e1a, 0x1e1a,
0x1e1c, 0x1e1c, 0x1e1e, 0x1e1e, 0x1e20, 0x1e20, 0x1e22, 0x1e22,
0x1e24, 0x1e24, 0x1e26, 0x1e26, 0x1e28, 0x1e28, 0x1e2a, 0x1e2a,
0x1e2c, 0x1e2c, 0x1e2e, 0x1e2e, 0x1e30, 0x1e30, 0x1e32, 0x1e32,
0x1e34, 0x1e34, 0x1e36, 0x1e36, 0x1e38, 0x1e38, 0x1e3a, 0x1e3a,
0x1e3c, 0x1e3c, 0x1e3e, 0x1e3e, 0x1e40, 0x1e40, 0x1e42, 0x1e42,
0x1e44, 0x1e44, 0x1e46, 0x1e46, 0x1e48, 0x1e48, 0x1e4a, 0x1e4a,
0x1e4c, 0x1e4c, 0x1e4e, 0x1e4e, 0x1e50, 0x1e50, 0x1e52, 0x1e52,
0x1e54, 0x1e54, 0x1e56, 0x1e56, 0x1e58, 0x1e58, 0x1e5a, 0x1e5a,
0x1e5c, 0x1e5c, 0x1e5e, 0x1e5e, 0x1e60, 0x1e60, 0x1e62, 0x1e62,
0x1e64, 0x1e64, 0x1e66, 0x1e66, 0x1e68, 0x1e68, 0x1e6a, 0x1e6a,
0x1e6c, 0x1e6c, 0x1e6e, 0x1e6e, 0x1e70, 0x1e70, 0x1e72, 0x1e72,
0x1e74, 0x1e74, 0x1e76, 0x1e76, 0x1e78, 0x1e78, 0x1e7a, 0x1e7a,
0x1e7c, 0x1e7c, 0x1e7e, 0x1e7e, 0x1e80, 0x1e80, 0x1e82, 0x1e82,
0x1e84, 0x1e84, 0x1e86, 0x1e86, 0x1e88, 0x1e88, 0x1e8a, 0x1e8a,
0x1e8c, 0x1e8c, 0x1e8e, 0x1e8e, 0x1e90, 0x1e90, 0x1e92, 0x1e92,
0x1e94, 0x1e94, 0x1e96, 0x1e97, 0x1e98, 0x1e99, 0x1e9a, 0x1e9b,
0x1e9c, 0x1e9d, 0x1e9e, 0x1e9f, 0x1ea0, 0x1ea0, 0x1ea2, 0x1ea2,
0x1ea4, 0x1ea4, 0x1ea6, 0x1ea6, 0x1ea8, 0x1ea8, 0x1eaa, 0x1eaa,
0x1eac, 0x1eac, 0x1eae, 0x1eae, 0x1eb0, 0x1eb0, 0x1eb2, 0x1eb2,
0x1eb4, 0x1eb4, 0x1eb6, 0x1eb6, 0x1eb8, 0x1eb8, 0x1eba, 0x1eba,
0x1ebc, 0x1ebc, 0x1ebe, 0x1ebe, 0x1ec0, 0x1ec0, 0x1ec2, 0x1ec2,
0x1ec4, 0x1ec4, 0x1ec6, 0x1ec6, 0x1ec8, 0x1ec8, 0x1eca, 0x1eca,
0x1ecc, 0x1ecc, 0x1ece, 0x1ece, 0x1ed0, 0x1ed0, 0x1ed2, 0x1ed2,
0x1ed4, 0x1ed4, 0x1ed6, 0x1ed6, 0x1ed8, 0x1ed8, 0x1eda, 0x1eda,
0x1edc, 0x1edc, 0x1ede, 0x1ede, 0x1ee0, 0x1ee0, 0x1ee2, 0x1ee2,
0x1ee4, 0x1ee4, 0x1ee6, 0x1ee6, 0x1ee8, 0x1ee8, 0x1eea, 0x1eea,
0x1eec, 0x1eec, 0x1eee, 0x1eee, 0x1ef0, 0x1ef0, 0x1ef2, 0x1ef2,
0x1ef4, 0x1ef4, 0x1ef6, 0x1ef6, 0x1ef8, 0x1ef8, 0x1efa, 0x1efb,
0x1efc, 0x1efd, 0x1efe, 0x1eff, 0x1f08, 0x1f09, 0x1f0a, 0x1f0b,
0x1f0c, 0x1f0d, 0x1f0e, 0x1f0f, 0x1f08, 0x1f09, 0x1f0a, 0x1f0b,
0x1f0c, 0x1f0d, 0x1f0e, 0x1f0f, 0x1f18, 0x1f19, 0x1f1a, 0x1f1b,
0x1f1c, 0x1f1d, 0x1f16, 0x1f17, 0x1f18, 0x1f19, 0x1f1a, 0x1f1b,
0x1f1c, 0x1f1d, 0x1f1e, 0x1f1f, 0x1f28, 0x1f29, 0x1f2a, 0x1f2b,
0x1f2c, 0x1f2d, 0x1f2e, 0x1f2f, 0x1f28, 0x1f29, 0x1f2a, 0x1f2b,
0x1f2c, 0x1f2d, 0x1f2e, 0x1f2f, 0x1f38, 0x1f39, 0x1f3a, 0x1f3b,
0x1f3c, 0x1f3d, 0x1f3e, 0x1f3f, 0x1f38, 0x1f39, 0x1f3a, 0x1f3b,
0x1f3c, 0x1f3d, 0x1f3e, 0x1f3f, 0x1f48, 0x1f49, 0x1f4a, 0x1f4b,
0x1f4c, 0x1f4d, 0x1f46, 0x1f47, 0x1f48, 0x1f49, 0x1f4a, 0x1f4b,
0x1f4c, 0x1f4d, 0x1f4e, 0x1f4f, 0x1f50, 0x1f59, 0x1f52, 0x1f5b,
0x1f54, 0x1f5d, 0x1f56, 0x1f5f, 0x1f58, 0x1f59, 0x1f5a, 0x1f5b,
0x1f5c, 0x1f5d, 0x1f5e, 0x1f5f, 0x1f68, 0x1f69, 0x1f6a, 0x1f6b,
0x1f6c, 0x1f6d, 0x1f6e, 0x1f6f, 0x1f68, 0x1f69, 0x1f6a, 0x1f6b,
0x1f6c, 0x1f6d, 0x1f6e, 0x1f6f, 0x1fba, 0x1fbb, 0x1fc8, 0x1fc9,
0x1fca, 0x1fcb, 0x1fda, 0x1fdb, 0x1ff8, 0x1ff9, 0x1fea, 0x1feb,
0x1ffa, 0x1ffb, 0x1f7e, 0x1f7f, 0x1f88, 0x1f89, 0x1f8a, 0x1f8b,
0x1f8c, 0x1f8d, 0x1f8e, 0x1f8f, 0x1f88, 0x1f89, 0x1f8a, 0x1f8b,
0x1f8c, 0x1f8d, 0x1f8e, 0x1f8f, 0x1f98, 0x1f99, 0x1f9a, 0x1f9b,
0x1f9c, 0x1f9d, 0x1f9e, 0x1f9f, 0x1f98, 0x1f99, 0x1f9a, 0x1f9b,
0x1f9c, 0x1f9d, 0x1f9e, 0x1f9f, 0x1fa8, 0x1fa9, 0x1faa, 0x1fab,
0x1fac, 0x1fad, 0x1fae, 0x1faf, 0x1fa8, 0x1fa9, 0x1faa, 0x1fab,
0x1fac, 0x1fad, 0x1fae, 0x1faf, 0x1fb8, 0x1fb9, 0x1fb2, 0x1fbc,
0x1fb4, 0x1fb5, 0x1fb6, 0x1fb7, 0x1fb8, 0x1fb9, 0x1fba, 0x1fbb,
0x1fbc, 0x1fbd, 0x1fbe, 0x1fbf, 0x1fc0, 0x1fc1, 0x1fc2, 0x1fc3,
0x1fc4, 0x1fc5, 0x1fc6, 0x1fc7, 0x1fc8, 0x1fc9, 0x1fca, 0x1fcb,
0x1fc3, 0x1fcd, 0x1fce, 0x1fcf, 0x1fd8, 0x1fd9, 0x1fd2, 0x1fd3,
0x1fd4, 0x1fd5, 0x1fd6, 0x1fd7, 0x1fd8, 0x1fd9, 0x1fda, 0x1fdb,
0x1fdc, 0x1fdd, 0x1fde, 0x1fdf, 0x1fe8, 0x1fe9, 0x1fe2, 0x1fe3,
0x1fe4, 0x1fec, 0x1fe6, 0x1fe7, 0x1fe8, 0x1fe9, 0x1fea, 0x1feb,
0x1fec, 0x1fed, 0x1fee, 0x1fef, 0x1ff0, 0x1ff1, 0x1ff2, 0x1ff3,
0x1ff4, 0x1ff5, 0x1ff6, 0x1ff7, 0x1ff8, 0x1ff9, 0x1ffa, 0x1ffb,
0x1ff3, 0x1ffd, 0x1ffe, 0x1fff, 0x2000, 0x2001, 0x2002, 0x2003,
0x2004, 0x2005, 0x2006, 0x2007, 0x2008, 0x2009, 0x200a, 0x200b,
0x200c, 0x200d, 0x200e, 0x200f, 0x2010, 0x2011, 0x2012, 0x2013,
0x2014, 0x2015, 0x2016, 0x2017, 0x2018, 0x2019, 0x201a, 0x201b,
0x201c, 0x201d, 0x201e, 0x201f, 0x2020, 0x2021, 0x2022, 0x2023,
0x2024, 0x2025, 0x2026, 0x2027, 0x2028, 0x2029, 0x202a, 0x202b,
0x202c, 0x202d, 0x202e, 0x202f, 0x2030, 0x2031, 0x2032, 0x2033,
0x2034, 0x2035, 0x2036, 0x2037, 0x2038, 0x2039, 0x203a, 0x203b,
0x203c, 0x203d, 0x203e, 0x203f, 0x2040, 0x2041, 0x2042, 0x2043,
0x2044, 0x2045, 0x2046, 0x2047, 0x2048, 0x2049, 0x204a, 0x204b,
0x204c, 0x204d, 0x204e, 0x204f, 0x2050, 0x2051, 0x2052, 0x2053,
0x2054, 0x2055, 0x2056, 0x2057, 0x2058, 0x2059, 0x205a, 0x205b,
0x205c, 0x205d, 0x205e, 0x205f, 0x2060, 0x2061, 0x2062, 0x2063,
0x2064, 0x2065, 0x2066, 0x2067, 0x2068, 0x2069, 0x206a, 0x206b,
0x206c, 0x206d, 0x206e, 0x206f, 0x2070, 0x2071, 0x2072, 0x2073,
0x2074, 0x2075, 0x2076, 0x2077, 0x2078, 0x2079, 0x207a, 0x207b,
0x207c, 0x207d, 0x207e, 0x207f, 0x2080, 0x2081, 0x2082, 0x2083,
0x2084, 0x2085, 0x2086, 0x2087, 0x2088, 0x2089, 0x208a, 0x208b,
0x208c, 0x208d, 0x208e, 0x208f, 0x2090, 0x2091, 0x2092, 0x2093,
0x2094, 0x2095, 0x2096, 0x2097, 0x2098, 0x2099, 0x209a, 0x209b,
0x209c, 0x209d, 0x209e, 0x209f, 0x20a0, 0x20a1, 0x20a2, 0x20a3,
0x20a4, 0x20a5, 0x20a6, 0x20a7, 0x20a8, 0x20a9, 0x20aa, 0x20ab,
0x20ac, 0x20ad, 0x20ae, 0x20af, 0x20b0, 0x20b1, 0x20b2, 0x20b3,
0x20b4, 0x20b5, 0x20b6, 0x20b7, 0x20b8, 0x20b9, 0x20ba, 0x20bb,
0x20bc, 0x20bd, 0x20be, 0x20bf, 0x20c0, 0x20c1, 0x20c2, 0x20c3,
0x20c4, 0x20c5, 0x20c6, 0x20c7, 0x20c8, 0x20c9, 0x20ca, 0x20cb,
0x20cc, 0x20cd, 0x20ce, 0x20cf, 0x20d0, 0x20d1, 0x20d2, 0x20d3,
0x20d4, 0x20d5, 0x20d6, 0x20d7, 0x20d8, 0x20d9, 0x20da, 0x20db,
0x20dc, 0x20dd, 0x20de, 0x20df, 0x20e0, 0x20e1, 0x20e2, 0x20e3,
0x20e4, 0x20e5, 0x20e6, 0x20e7, 0x20e8, 0x20e9, 0x20ea, 0x20eb,
0x20ec, 0x20ed, 0x20ee, 0x20ef, 0x20f0, 0x20f1, 0x20f2, 0x20f3,
0x20f4, 0x20f5, 0x20f6, 0x20f7, 0x20f8, 0x20f9, 0x20fa, 0x20fb,
0x20fc, 0x20fd, 0x20fe, 0x20ff, 0x2100, 0x2101, 0x2102, 0x2103,
0x2104, 0x2105, 0x2106, 0x2107, 0x2108, 0x2109, 0x210a, 0x210b,
0x210c, 0x210d, 0x210e, 0x210f, 0x2110, 0x2111, 0x2112, 0x2113,
0x2114, 0x2115, 0x2116, 0x2117, 0x2118, 0x2119, 0x211a, 0x211b,
0x211c, 0x211d, 0x211e, 0x211f, 0x2120, 0x2121, 0x2122, 0x2123,
0x2124, 0x2125, 0x2126, 0x2127, 0x2128, 0x2129, 0x212a, 0x212b,
0x212c, 0x212d, 0x212e, 0x212f, 0x2130, 0x2131, 0x2132, 0x2133,
0x2134, 0x2135, 0x2136, 0x2137, 0x2138, 0x2139, 0x213a, 0x213b,
0x213c, 0x213d, 0x213e, 0x213f, 0x2140, 0x2141, 0x2142, 0x2143,
0x2144, 0x2145, 0x2146, 0x2147, 0x2148, 0x2149, 0x214a, 0x214b,
0x214c, 0x214d, 0x2132, 0x214f, 0x2150, 0x2151, 0x2152, 0x2153,
0x2154, 0x2155, 0x2156, 0x2157, 0x2158, 0x2159, 0x215a, 0x215b,
0x215c, 0x215d, 0x215e, 0x215f, 0x2160, 0x2161, 0x2162, 0x2163,
0x2164, 0x2165, 0x2166, 0x2167, 0x2168, 0x2169, 0x216a, 0x216b,
0x216c, 0x216d, 0x216e, 0x216f, 0x2160, 0x2161, 0x2162, 0x2163,
0x2164, 0x2165, 0x2166, 0x2167, 0x2168, 0x2169, 0x216a, 0x216b,
0x216c, 0x216d, 0x216e, 0x216f, 0x2180, 0x2181, 0x2182, 0x2183,
0x2183, 0xffff, 0x034b, 0x24b6, 0x24b7, 0x24b8, 0x24b9, 0x24ba,
0x24bb, 0x24bc, 0x24bd, 0x24be, 0x24bf, 0x24c0, 0x24c1, 0x24c2,
0x24c3, 0x24c4, 0x24c5, 0x24c6, 0x24c7, 0x24c8, 0x24c9, 0x24ca,
0x24cb, 0x24cc, 0x24cd, 0x24ce, 0x24cf, 0xffff, 0x0746, 0x2c00,
0x2c01, 0x2c02, 0x2c03, 0x2c04, 0x2c05, 0x2c06, 0x2c07, 0x2c08,
0x2c09, 0x2c0a, 0x2c0b, 0x2c0c, 0x2c0d, 0x2c0e, 0x2c0f, 0x2c10,
0x2c11, 0x2c12, 0x2c13, 0x2c14, 0x2c15, 0x2c16, 0x2c17, 0x2c18,
0x2c19, 0x2c1a, 0x2c1b, 0x2c1c, 0x2c1d, 0x2c1e, 0x2c1f, 0x2c20,
0x2c21, 0x2c22, 0x2c23, 0x2c24, 0x2c25, 0x2c26, 0x2c27, 0x2c28,
0x2c29, 0x2c2a, 0x2c2b, 0x2c2c, 0x2c2d, 0x2c2e, 0x2c5f, 0x2c60,
0x2c60, 0x2c62, 0x2c63, 0x2c64, 0x2c65, 0x2c66, 0x2c67, 0x2c67,
0x2c69, 0x2c69, 0x2c6b, 0x2c6b, 0x2c6d, 0x2c6e, 0x2c6f, 0x2c70,
0x2c71, 0x2c72, 0x2c73, 0x2c74, 0x2c75, 0x2c75, 0x2c77, 0x2c78,
0x2c79, 0x2c7a, 0x2c7b, 0x2c7c, 0x2c7d, 0x2c7e, 0x2c7f, 0x2c80,
0x2c80, 0x2c82, 0x2c82, 0x2c84, 0x2c84, 0x2c86, 0x2c86, 0x2c88,
0x2c88, 0x2c8a, 0x2c8a, 0x2c8c, 0x2c8c, 0x2c8e, 0x2c8e, 0x2c90,
0x2c90, 0x2c92, 0x2c92, 0x2c94, 0x2c94, 0x2c96, 0x2c96, 0x2c98,
0x2c98, 0x2c9a, 0x2c9a, 0x2c9c, 0x2c9c, 0x2c9e, 0x2c9e, 0x2ca0,
0x2ca0, 0x2ca2, 0x2ca2, 0x2ca4, 0x2ca4, 0x2ca6, 0x2ca6, 0x2ca8,
0x2ca8, 0x2caa, 0x2caa, 0x2cac, 0x2cac, 0x2cae, 0x2cae, 0x2cb0,
0x2cb0, 0x2cb2, 0x2cb2, 0x2cb4, 0x2cb4, 0x2cb6, 0x2cb6, 0x2cb8,
0x2cb8, 0x2cba, 0x2cba, 0x2cbc, 0x2cbc, 0x2cbe, 0x2cbe, 0x2cc0,
0x2cc0, 0x2cc2, 0x2cc2, 0x2cc4, 0x2cc4, 0x2cc6, 0x2cc6, 0x2cc8,
0x2cc8, 0x2cca, 0x2cca, 0x2ccc, 0x2ccc, 0x2cce, 0x2cce, 0x2cd0,
0x2cd0, 0x2cd2, 0x2cd2, 0x2cd4, 0x2cd4, 0x2cd6, 0x2cd6, 0x2cd8,
0x2cd8, 0x2cda, 0x2cda, 0x2cdc, 0x2cdc, 0x2cde, 0x2cde, 0x2ce0,
0x2ce0, 0x2ce2, 0x2ce2, 0x2ce4, 0x2ce5, 0x2ce6, 0x2ce7, 0x2ce8,
0x2ce9, 0x2cea, 0x2ceb, 0x2cec, 0x2ced, 0x2cee, 0x2cef, 0x2cf0,
0x2cf1, 0x2cf2, 0x2cf3, 0x2cf4, 0x2cf5, 0x2cf6, 0x2cf7, 0x2cf8,
0x2cf9, 0x2cfa, 0x2cfb, 0x2cfc, 0x2cfd, 0x2cfe, 0x2cff, 0x10a0,
0x10a1, 0x10a2, 0x10a3, 0x10a4, 0x10a5, 0x10a6, 0x10a7, 0x10a8,
0x10a9, 0x10aa, 0x10ab, 0x10ac, 0x10ad, 0x10ae, 0x10af, 0x10b0,
0x10b1, 0x10b2, 0x10b3, 0x10b4, 0x10b5, 0x10b6, 0x10b7, 0x10b8,
0x10b9, 0x10ba, 0x10bb, 0x10bc, 0x10bd, 0x10be, 0x10bf, 0x10c0,
0x10c1, 0x10c2, 0x10c3, 0x10c4, 0x10c5, 0xffff, 0xd21b, 0xff21,
0xff22, 0xff23, 0xff24, 0xff25, 0xff26, 0xff27, 0xff28, 0xff29,
0xff2a, 0xff2b, 0xff2c, 0xff2d, 0xff2e, 0xff2f, 0xff30, 0xff31,
0xff32, 0xff33, 0xff34, 0xff35, 0xff36, 0xff37, 0xff38, 0xff39,
0xff3a, 0xff5b, 0xff5c, 0xff5d, 0xff5e, 0xff5f, 0xff60, 0xff61,
0xff62, 0xff63, 0xff64, 0xff65, 0xff66, 0xff67, 0xff68, 0xff69,
0xff6a, 0xff6b, 0xff6c, 0xff6d, 0xff6e, 0xff6f, 0xff70, 0xff71,
0xff72, 0xff73, 0xff74, 0xff75, 0xff76, 0xff77, 0xff78, 0xff79,
0xff7a, 0xff7b, 0xff7c, 0xff7d, 0xff7e, 0xff7f, 0xff80, 0xff81,
0xff82, 0xff83, 0xff84, 0xff85, 0xff86, 0xff87, 0xff88, 0xff89,
0xff8a, 0xff8b, 0xff8c, 0xff8d, 0xff8e, 0xff8f, 0xff90, 0xff91,
0xff92, 0xff93, 0xff94, 0xff95, 0xff96, 0xff97, 0xff98, 0xff99,
0xff9a, 0xff9b, 0xff9c, 0xff9d, 0xff9e, 0xff9f, 0xffa0, 0xffa1,
0xffa2, 0xffa3, 0xffa4, 0xffa5, 0xffa6, 0xffa7, 0xffa8, 0xffa9,
0xffaa, 0xffab, 0xffac, 0xffad, 0xffae, 0xffaf, 0xffb0, 0xffb1,
0xffb2, 0xffb3, 0xffb4, 0xffb5, 0xffb6, 0xffb7, 0xffb8, 0xffb9,
0xffba, 0xffbb, 0xffbc, 0xffbd, 0xffbe, 0xffbf, 0xffc0, 0xffc1,
0xffc2, 0xffc3, 0xffc4, 0xffc5, 0xffc6, 0xffc7, 0xffc8, 0xffc9,
0xffca, 0xffcb, 0xffcc, 0xffcd, 0xffce, 0xffcf, 0xffd0, 0xffd1,
0xffd2, 0xffd3, 0xffd4, 0xffd5, 0xffd6, 0xffd7, 0xffd8, 0xffd9,
0xffda, 0xffdb, 0xffdc, 0xffdd, 0xffde, 0xffdf, 0xffe0, 0xffe1,
0xffe2, 0xffe3, 0xffe4, 0xffe5, 0xffe6, 0xffe7, 0xffe8, 0xffe9,
0xffea, 0xffeb, 0xffec, 0xffed, 0xffee, 0xffef, 0xfff0, 0xfff1,
0xfff2, 0xfff3, 0xfff4, 0xfff5, 0xfff6, 0xfff7, 0xfff8, 0xfff9,
0xfffa, 0xfffb, 0xfffc, 0xfffd, 0xfffe, 0xffff,
};
/*
* Allow full-width illegal characters :
* "MS windows 7" supports full-width-invalid-name-characters.
* So we should check half-width-invalid-name-characters(ASCII) only
* for compatibility.
*
* " * / : < > ? \ |
*/
static unsigned short bad_uni_chars[] = {
0x0022, 0x002A, 0x002F, 0x003A,
0x003C, 0x003E, 0x003F, 0x005C, 0x007C,
0
};
static int exfat_convert_char_to_ucs2(struct nls_table *nls,
const unsigned char *ch, int ch_len, unsigned short *ucs2,
int *lossy)
{
int len;
*ucs2 = 0x0;
if (ch[0] < 0x80) {
*ucs2 = ch[0];
return 1;
}
len = nls->char2uni(ch, ch_len, ucs2);
if (len < 0) {
/* conversion failed */
if (lossy != NULL)
*lossy |= NLS_NAME_LOSSY;
*ucs2 = '_';
return 1;
}
return len;
}
static int exfat_convert_ucs2_to_char(struct nls_table *nls,
unsigned short ucs2, unsigned char *ch, int *lossy)
{
int len;
ch[0] = 0x0;
if (ucs2 < 0x0080) {
ch[0] = ucs2;
return 1;
}
len = nls->uni2char(ucs2, ch, MAX_CHARSET_SIZE);
if (len < 0) {
/* conversion failed */
if (lossy != NULL)
*lossy |= NLS_NAME_LOSSY;
ch[0] = '_';
return 1;
}
return len;
}
unsigned short exfat_toupper(struct super_block *sb, unsigned short a)
{
struct exfat_sb_info *sbi = EXFAT_SB(sb);
return sbi->vol_utbl[a] ? sbi->vol_utbl[a] : a;
}
static unsigned short *exfat_wstrchr(unsigned short *str, unsigned short wchar)
{
while (*str) {
if (*(str++) == wchar)
return str;
}
return NULL;
}
int exfat_uniname_ncmp(struct super_block *sb, unsigned short *a,
unsigned short *b, unsigned int len)
{
int i;
for (i = 0; i < len; i++, a++, b++)
if (exfat_toupper(sb, *a) != exfat_toupper(sb, *b))
return 1;
return 0;
}
static int exfat_utf16_to_utf8(struct super_block *sb,
struct exfat_uni_name *p_uniname, unsigned char *p_cstring,
int buflen)
{
int len;
const unsigned short *uniname = p_uniname->name;
/* always len >= 0 */
len = utf16s_to_utf8s(uniname, MAX_NAME_LENGTH, UTF16_HOST_ENDIAN,
p_cstring, buflen);
p_cstring[len] = '\0';
return len;
}
static int exfat_utf8_to_utf16(struct super_block *sb,
const unsigned char *p_cstring, const int len,
struct exfat_uni_name *p_uniname, int *p_lossy)
{
int i, unilen, lossy = NLS_NAME_NO_LOSSY;
__le16 upname[MAX_NAME_LENGTH + 1];
unsigned short *uniname = p_uniname->name;
WARN_ON(!len);
unilen = utf8s_to_utf16s(p_cstring, len, UTF16_HOST_ENDIAN,
(wchar_t *)uniname, MAX_NAME_LENGTH + 2);
if (unilen < 0) {
exfat_err(sb, "failed to %s (err : %d) nls len : %d",
__func__, unilen, len);
return unilen;
}
if (unilen > MAX_NAME_LENGTH) {
exfat_err(sb, "failed to %s (estr:ENAMETOOLONG) nls len : %d, unilen : %d > %d",
__func__, len, unilen, MAX_NAME_LENGTH);
return -ENAMETOOLONG;
}
for (i = 0; i < unilen; i++) {
if (*uniname < 0x0020 ||
exfat_wstrchr(bad_uni_chars, *uniname))
lossy |= NLS_NAME_LOSSY;
upname[i] = cpu_to_le16(exfat_toupper(sb, *uniname));
uniname++;
}
*uniname = '\0';
p_uniname->name_len = unilen;
p_uniname->name_hash = exfat_calc_chksum16(upname, unilen << 1, 0,
CS_DEFAULT);
if (p_lossy)
*p_lossy = lossy;
return unilen;
}
#define SURROGATE_MASK 0xfffff800
#define SURROGATE_PAIR 0x0000d800
#define SURROGATE_LOW 0x00000400
static int __exfat_utf16_to_nls(struct super_block *sb,
struct exfat_uni_name *p_uniname, unsigned char *p_cstring,
int buflen)
{
int i, j, len, out_len = 0;
unsigned char buf[MAX_CHARSET_SIZE];
const unsigned short *uniname = p_uniname->name;
struct nls_table *nls = EXFAT_SB(sb)->nls_io;
i = 0;
while (i < MAX_NAME_LENGTH && out_len < (buflen - 1)) {
if (*uniname == '\0')
break;
if ((*uniname & SURROGATE_MASK) != SURROGATE_PAIR) {
len = exfat_convert_ucs2_to_char(nls, *uniname, buf,
NULL);
} else {
/* Process UTF-16 surrogate pair as one character */
if (!(*uniname & SURROGATE_LOW) &&
i+1 < MAX_NAME_LENGTH &&
(*(uniname+1) & SURROGATE_MASK) == SURROGATE_PAIR &&
(*(uniname+1) & SURROGATE_LOW)) {
uniname++;
i++;
}
/*
* UTF-16 surrogate pair encodes code points above
* U+FFFF. Code points above U+FFFF are not supported
* by kernel NLS framework therefore use replacement
* character
*/
len = 1;
buf[0] = '_';
}
if (out_len + len >= buflen)
len = buflen - 1 - out_len;
out_len += len;
if (len > 1) {
for (j = 0; j < len; j++)
*p_cstring++ = buf[j];
} else { /* len == 1 */
*p_cstring++ = *buf;
}
uniname++;
i++;
}
*p_cstring = '\0';
return out_len;
}
static int exfat_nls_to_ucs2(struct super_block *sb,
const unsigned char *p_cstring, const int len,
struct exfat_uni_name *p_uniname, int *p_lossy)
{
int i = 0, unilen = 0, lossy = NLS_NAME_NO_LOSSY;
__le16 upname[MAX_NAME_LENGTH + 1];
unsigned short *uniname = p_uniname->name;
struct nls_table *nls = EXFAT_SB(sb)->nls_io;
WARN_ON(!len);
while (unilen < MAX_NAME_LENGTH && i < len) {
i += exfat_convert_char_to_ucs2(nls, p_cstring + i, len - i,
uniname, &lossy);
if (*uniname < 0x0020 ||
exfat_wstrchr(bad_uni_chars, *uniname))
lossy |= NLS_NAME_LOSSY;
upname[unilen] = cpu_to_le16(exfat_toupper(sb, *uniname));
uniname++;
unilen++;
}
if (p_cstring[i] != '\0')
lossy |= NLS_NAME_OVERLEN;
*uniname = '\0';
p_uniname->name_len = unilen;
p_uniname->name_hash = exfat_calc_chksum16(upname, unilen << 1, 0,
CS_DEFAULT);
if (p_lossy)
*p_lossy = lossy;
return unilen;
}
int exfat_utf16_to_nls(struct super_block *sb, struct exfat_uni_name *uniname,
unsigned char *p_cstring, int buflen)
{
if (EXFAT_SB(sb)->options.utf8)
return exfat_utf16_to_utf8(sb, uniname, p_cstring,
buflen);
return __exfat_utf16_to_nls(sb, uniname, p_cstring, buflen);
}
int exfat_nls_to_utf16(struct super_block *sb, const unsigned char *p_cstring,
const int len, struct exfat_uni_name *uniname, int *p_lossy)
{
if (EXFAT_SB(sb)->options.utf8)
return exfat_utf8_to_utf16(sb, p_cstring, len,
uniname, p_lossy);
return exfat_nls_to_ucs2(sb, p_cstring, len, uniname, p_lossy);
}
static int exfat_load_upcase_table(struct super_block *sb,
sector_t sector, unsigned long long num_sectors,
unsigned int utbl_checksum)
{
struct exfat_sb_info *sbi = EXFAT_SB(sb);
unsigned int sect_size = sb->s_blocksize;
unsigned int i, index = 0;
u32 chksum = 0;
int ret;
unsigned char skip = false;
unsigned short *upcase_table;
upcase_table = kcalloc(UTBL_COUNT, sizeof(unsigned short), GFP_KERNEL);
if (!upcase_table)
return -ENOMEM;
sbi->vol_utbl = upcase_table;
num_sectors += sector;
while (sector < num_sectors) {
struct buffer_head *bh;
bh = sb_bread(sb, sector);
if (!bh) {
exfat_err(sb, "failed to read sector(0x%llx)\n",
(unsigned long long)sector);
ret = -EIO;
goto free_table;
}
sector++;
for (i = 0; i < sect_size && index <= 0xFFFF; i += 2) {
unsigned short uni = get_unaligned_le16(bh->b_data + i);
if (skip) {
index += uni;
skip = false;
} else if (uni == index) {
index++;
} else if (uni == 0xFFFF) {
skip = true;
} else { /* uni != index , uni != 0xFFFF */
upcase_table[index] = uni;
index++;
}
}
chksum = exfat_calc_chksum32(bh->b_data, i, chksum, CS_DEFAULT);
brelse(bh);
}
if (index >= 0xFFFF && utbl_checksum == chksum)
return 0;
exfat_err(sb, "failed to load upcase table (idx : 0x%08x, chksum : 0x%08x, utbl_chksum : 0x%08x)",
index, chksum, utbl_checksum);
ret = -EINVAL;
free_table:
exfat_free_upcase_table(sbi);
return ret;
}
static int exfat_load_default_upcase_table(struct super_block *sb)
{
int i, ret = -EIO;
struct exfat_sb_info *sbi = EXFAT_SB(sb);
unsigned char skip = false;
unsigned short uni = 0, *upcase_table;
unsigned int index = 0;
upcase_table = kcalloc(UTBL_COUNT, sizeof(unsigned short), GFP_KERNEL);
if (!upcase_table)
return -ENOMEM;
sbi->vol_utbl = upcase_table;
for (i = 0; index <= 0xFFFF && i < EXFAT_NUM_UPCASE; i++) {
uni = uni_def_upcase[i];
if (skip) {
index += uni;
skip = false;
} else if (uni == index) {
index++;
} else if (uni == 0xFFFF) {
skip = true;
} else {
upcase_table[index] = uni;
index++;
}
}
if (index >= 0xFFFF)
return 0;
/* FATAL error: default upcase table has error */
exfat_free_upcase_table(sbi);
return ret;
}
int exfat_create_upcase_table(struct super_block *sb)
{
int i, ret;
unsigned int tbl_clu, type;
sector_t sector;
unsigned long long tbl_size, num_sectors;
unsigned char blksize_bits = sb->s_blocksize_bits;
struct exfat_chain clu;
struct exfat_dentry *ep;
struct exfat_sb_info *sbi = EXFAT_SB(sb);
struct buffer_head *bh;
clu.dir = sbi->root_dir;
clu.flags = ALLOC_FAT_CHAIN;
while (clu.dir != EXFAT_EOF_CLUSTER) {
for (i = 0; i < sbi->dentries_per_clu; i++) {
ep = exfat_get_dentry(sb, &clu, i, &bh, NULL);
if (!ep)
return -EIO;
type = exfat_get_entry_type(ep);
if (type == TYPE_UNUSED) {
brelse(bh);
break;
}
if (type != TYPE_UPCASE) {
brelse(bh);
continue;
}
tbl_clu = le32_to_cpu(ep->dentry.upcase.start_clu);
tbl_size = le64_to_cpu(ep->dentry.upcase.size);
sector = exfat_cluster_to_sector(sbi, tbl_clu);
num_sectors = ((tbl_size - 1) >> blksize_bits) + 1;
ret = exfat_load_upcase_table(sb, sector, num_sectors,
le32_to_cpu(ep->dentry.upcase.checksum));
brelse(bh);
if (ret && ret != -EIO)
goto load_default;
/* load successfully */
return ret;
}
if (exfat_get_next_cluster(sb, &(clu.dir)))
return -EIO;
}
load_default:
/* load default upcase table */
return exfat_load_default_upcase_table(sb);
}
void exfat_free_upcase_table(struct exfat_sb_info *sbi)
{
kfree(sbi->vol_utbl);
}
| 2024-06-26T01:26:19.665474 | https://example.com/article/3977 |
/**
* Copyright: E2E Technologies Ltd
*/
"use strict";
var parserUtils = require("./parserUtils");
/**
* @param node
* @param {DebuggerInterface=} debuggerInterface
* @return {BPMNProcessDefinition}
*/
exports.createBPMNProcessDefinition = function(node, debuggerInterface) {
var getValue = parserUtils.getAttributesValue;
return (new BPMNProcessDefinition(
getValue(node, "id"),
getValue(node, "name"),
debuggerInterface
));
};
/**
* @param localName name without namespace prefix
* @return {Boolean}
*/
exports.isProcessName = function(localName) {
return (localName === 'process');
};
/**
* @param node
* @return {Boolean}
*/
exports.isExecutable = function(node) {
var isExecutable = parserUtils.getAttributesValue(node, "isExecutable");
return (!isExecutable || isExecutable === 'true');
};
/**
* @param {String} bpmnId
* @param {String} name
* @param {DebuggerInterface=} debuggerInterface
* @constructor
*/
var BPMNProcessDefinition = exports.BPMNProcessDefinition = function(bpmnId, name, debuggerInterface) {
this.bpmnId = bpmnId;
this.name = name;
this.flowObjects = [];
this.sequenceFlows = [];
this.messageFlows = [];
// Process Elements = Flow objects + connection objects + artifacts
// Semantics of these names is described in http://de.wikipedia.org/wiki/Business_Process_Model_and_Notation#Notation
this.processElementIndex = null;
this.sequenceFlowBySourceIndex = null;
this.sequenceFlowByTargetIndex = null;
this.messageFlowBySourceIndex = null;
this.messageFlowByTargetIndex = null;
this.boundaryEventsByAttachmentIndex = null;
this.nameMap = null;
this.isProcessDefinition = true;
/** {Array.<BPMNParticipant>} */
this.collaboratingParticipants = [];
if (debuggerInterface) {
this.debuggerInterface = debuggerInterface;
}
};
/**
* @param {BPMNParseErrorQueue} errorQueue
*/
BPMNProcessDefinition.prototype.validate = function(errorQueue) {
var self = this;
var processElements = this.getProcessElements();
processElements.forEach(function(processElement) {
if (processElement.validate && typeof processElement.validate === 'function') {
processElement.validate(self, errorQueue);
}
});
};
/**
* @param {String} bpmnId
* @return {*}
*/
BPMNProcessDefinition.prototype.getProcessElement = function(bpmnId) {
if (!(this.processElementIndex)) {
this.processElementIndex = this._buildIndex();
}
return this.processElementIndex[bpmnId];
};
/**
* @param {String} bpmnId
* @return {BPMNFlowObject}
*/
BPMNProcessDefinition.prototype.getFlowObject = function(bpmnId) {
return this.getProcessElement(bpmnId);
};
/**
* @param {{sourceRef: String}} flow
* @return {BPMNFlowObject}
*/
BPMNProcessDefinition.prototype.getSourceFlowObject = function(flow) {
return this.getProcessElement(flow.sourceRef);
};
/**
* @return {Array.<BPMNStartEvent>}
*/
BPMNProcessDefinition.prototype.getStartEvents = function() {
return this.flowObjects.filter(function(flowObject) {
return (flowObject.isStartEvent);
});
};
/**
* @return {Array.<BPMNActivity>}
*/
BPMNProcessDefinition.prototype.getBoundaryEvents = function() {
return this.flowObjects.filter(function(flowObject) {
return (flowObject.isBoundaryEvent);
});
};
/**
* @param {BPMNActivity} activity
* @return {Array.<BPMNActivity>}
*/
BPMNProcessDefinition.prototype.getBoundaryEventsAt = function(activity) {
if (!this.boundaryEventsByAttachmentIndex) {
this.boundaryEventsByAttachmentIndex = this.buildBoundaryEventsByAttachmentIndex();
}
return (this.boundaryEventsByAttachmentIndex[activity.bpmnId] || []);
};
/**
*/
BPMNProcessDefinition.prototype.buildBoundaryEventsByAttachmentIndex = function() {
var index = {};
var self = this;
var boundaryEvents = this.getBoundaryEvents();
boundaryEvents.forEach(function(boundaryEvent) {
var attachedToRef = boundaryEvent.attachedToRef;
var activity = self.getFlowObject(attachedToRef);
if (activity) {
if (activity.isWaitTask) {
var entry = index[attachedToRef];
if (entry) {
entry.push(boundaryEvent);
} else {
index[attachedToRef] = [boundaryEvent];
}
} else {
throw new Error("The activity '" + activity.name + "' has a boundary event but this is allowed only for wait tasks such as user or receive tasks.");
}
} else {
throw new Error("Cannot find the activity the boundary event '" + boundaryEvent.name +
"' is attached to (activity BPMN ID: '" + boundaryEvent.attachedToRef + "'.");
}
});
return index;
};
/**
* @param {String} name
* @return {BPMNFlowObject}
*/
BPMNProcessDefinition.prototype.getFlowObjectByName = function(name) {
var bpmnId = this.getIdByName(name);
return this.getFlowObject(bpmnId);
};
/**
* @param {String} name
* @return {String}
*/
BPMNProcessDefinition.prototype.getIdByName = function(name) {
if (!(this.nameMap)) {
this.nameMap = buildNameMap(this.getFlowObjects());
}
return this.nameMap[name];
};
/**
* @param {BPMNFlowObject} flowObject
* @return {Array.<BPMNFlowObject>}
*/
BPMNProcessDefinition.prototype.getNextFlowObjects = function(flowObject) {
var nextFlowObjects = [];
var self = this;
var outgoingSequenceFlows = this.getOutgoingSequenceFlows(flowObject);
outgoingSequenceFlows.forEach(function(flow){
nextFlowObjects.push(self.getProcessElement(flow.targetRef));
});
return nextFlowObjects;
};
/**
* @param {BPMNFlowObject} flowObject
* @return {Array.<BPMNSequenceFlow>}
*/
BPMNProcessDefinition.prototype.getIncomingSequenceFlows = function(flowObject) {
return this._getFlows("sequenceFlowByTargetIndex", "sequenceFlows", flowObject, false);
};
/**
* @param {BPMNFlowObject} flowObject
* @return {Boolean}
*/
BPMNProcessDefinition.prototype.hasIncomingSequenceFlows = function(flowObject) {
var outgoingFlows = this.getIncomingSequenceFlows(flowObject);
return (outgoingFlows.length > 0);
};
/**
* @param {BPMNFlowObject} flowObject
* @return {Array.<BPMNSequenceFlow>}
*/
BPMNProcessDefinition.prototype.getOutgoingSequenceFlows = function(flowObject) {
return this._getFlows("sequenceFlowBySourceIndex", "sequenceFlows", flowObject, true);
};
/**
* @param {BPMNSequenceFlow} sequenceFlow
*/
BPMNProcessDefinition.prototype.addSequenceFlow = function(sequenceFlow) {
this.sequenceFlowBySourceIndex = null;
this.sequenceFlowByTargetIndex = null;
this.sequenceFlows.push(sequenceFlow);
};
/**
* @param {BPMNFlowObject} flowObject
* @return {Boolean}
*/
BPMNProcessDefinition.prototype.hasOutgoingSequenceFlows = function(flowObject) {
var outgoingFlows = this.getOutgoingSequenceFlows(flowObject);
return (outgoingFlows.length > 0);
};
/**
* @param {BPMNFlowObject} flowObject
*/
BPMNProcessDefinition.prototype.addFlowObject = function(flowObject) {
this.processElementIndex = null;
this.nameMap = null;
this.boundaryEventsByAttachmentIndex = null;
this.flowObjects.push(flowObject);
};
/**
* @return {Array.<BPMNFlowObject>}
*/
BPMNProcessDefinition.prototype.getFlowObjects = function() {
return this.flowObjects;
};
/**
* @return {Array.<Object>}
*/
BPMNProcessDefinition.prototype.getProcessElements = function() {
var flowObjects = this.getFlowObjects();
return (flowObjects.concat(this.sequenceFlows));
};
/**
* Attach the collaborations participants and message flows to the process definitions for easier access
* @param {Array.<BPMNCollaborationDefinition>} collaborationDefinitions
*/
BPMNProcessDefinition.prototype.attachCollaborationDefinitions = function(collaborationDefinitions) {
var self = this;
collaborationDefinitions.forEach(function(collaborationDefinition) {
var processParticipant = collaborationDefinition.getParticipantByProcessId(self.bpmnId);
if (processParticipant) {
self.name = processParticipant.name;
var collaboratingParticipants = collaborationDefinition.getCollaboratingParticipants(self.bpmnId);
self.addCollaboratingParticipants(collaboratingParticipants);
var messageFlows = collaborationDefinition.getMessageFlows();
self.addMessageFlows(messageFlows);
}
});
};
/**
* @param {String} participantName
* @return {BPMNParticipant}
*/
BPMNProcessDefinition.prototype.getParticipantByName = function(participantName) {
var participants = this.collaboratingParticipants.filter(function(participant) {
return (participant.name === participantName);
});
if (participants.length > 1) {
throw new Error("There is more than one collaboration participant having the same name: '" + participantName + "'");
}
return participants[0];
};
/**
* @param {String} processDefinitionId
* @return {BPMNParticipant}
*/
BPMNProcessDefinition.prototype.getParticipantById = function(processDefinitionId) {
var participants = this.collaboratingParticipants.filter(function(participant) {
return (participant.processRef === processDefinitionId);
});
return participants[0];
};
/**
* @return {Array.<BPMNParticipant>}
*/
BPMNProcessDefinition.prototype.getCollaboratingParticipants = function() {
return this.collaboratingParticipants;
};
/**
* @param {Array.<BPMNParticipant>} participants
*/
BPMNProcessDefinition.prototype.addCollaboratingParticipants = function(participants) {
var self = this;
participants.forEach(function(participant) {
if (!self.getParticipantByName(participant.name)) {
self.collaboratingParticipants.push(participant);
}
});
};
/**
* @param {BPMNFlowObject} flowObject
* @return {Array.<BPMNMessageFlow>}
*/
BPMNProcessDefinition.prototype.getIncomingMessageFlows = function(flowObject) {
return this._getFlows("messageFlowByTargetIndex", "messageFlows", flowObject, false);
};
/**
* @param {BPMNFlowObject} flowObject
* @return {Array.<BPMNMessageFlow>}
*/
BPMNProcessDefinition.prototype.getOutgoingMessageFlows = function(flowObject) {
return this._getFlows("messageFlowBySourceIndex", "messageFlows", flowObject, true);
};
/**
* @param {String} flowObjectName
* @return {Array.<BPMNMessageFlow>}
*/
BPMNProcessDefinition.prototype.getMessageFlowsBySourceName = function(flowObjectName) {
var flowObject = this.getFlowObjectByName(flowObjectName);
return this.getOutgoingMessageFlows(flowObject);
};
/**
* @param {Array.<BPMNMessageFlow>} messageFlows
*/
BPMNProcessDefinition.prototype.addMessageFlows = function(messageFlows) {
var self = this;
messageFlows.forEach(function(messageFlow) {
if (self.getProcessElement(messageFlow.targetRef)) {
messageFlow.targetProcessDefinitionId = self.bpmnId;
self.messageFlows.push(messageFlow);
} else if (self.getProcessElement(messageFlow.sourceRef)) {
messageFlow.sourceProcessDefinitionId = self.bpmnId;
self.messageFlows.push(messageFlow);
}
});
};
/**
* @return {Object}
* @private
*/
BPMNProcessDefinition.prototype._buildIndex = function() {
var index = {};
var processElements = this.getProcessElements();
processElements.forEach(function(processElement) {
index[processElement.bpmnId] = processElement;
});
return index;
};
/**
* @param {String} indexName
* @param {String} flowContainerName
* @param {BPMNFlowObject} flowObject
* @param {Boolean} isOutgoingFlow
* @returns {*|Array}
* @private
*/
BPMNProcessDefinition.prototype._getFlows = function(indexName, flowContainerName, flowObject, isOutgoingFlow) {
if (!this[indexName]) {
this[indexName] = buildFlowIndex(this[flowContainerName], isOutgoingFlow);
}
return (this[indexName][flowObject.bpmnId] || []);
};
/**
* @param {Boolean} indexBySource If false or undefined, we index by target.
* @param {Array} flows
* @return {Object}
*/
function buildFlowIndex(flows, indexBySource) {
var index = {};
flows.forEach(function(flow) {
var ref = indexBySource ? flow.sourceRef : flow.targetRef;
var entry = index[ref];
if (entry) {
entry.push(flow);
} else {
index[ref] = [flow];
}
});
return index;
}
/**
* @param {Array.<{name: string, bpmnId: string}>} objects
* @return {Object}
* @private
*/
function buildNameMap(objects) {
var map = {};
objects.forEach(function(object) {
var name = object.name;
if (map[name]) {
throw new Error("Process element name '" + name + "' must be unique.");
} else {
map[name] = object.bpmnId;
}
});
return map;
}
| 2024-02-04T01:26:19.665474 | https://example.com/article/9749 |
周邊景點
Laoniubo Pork Blood Pudding and Pork Lung Rice Pudding Deli
Located about 13.7 km from Cham Cham ，drive about 21 min
The 60-year-old store in Yujing offers signature dish such as pork lung rice pudding, which is prepared by cooking pork lungs stuffed with yam paste and garnished with the special dipping sauce to present the tender and crispy texture. Other essential dishes include stir-fried rice noodles, fried noodles and pork blood pudding soup. | 2024-06-02T01:26:19.665474 | https://example.com/article/6649 |
Q:
jQuery POST always failing
I've created a Node.js server using Express with a pretty simple configuration:
var express = require('express');
var app = express();
app.configure(function() {
app.use(express.urlencoded());
app.use(express.json());
app.use(express.cookieParser());
});
app.post('/login', function(req, res) {
res.json({foo: 'bar'});
});
app.listen(3000);
Upon inspection, here is the data Firefox logged about the network request to the /login route:
Request URL: http://localhost:3000/login
Request Method: POST
Status Code: HTTP/1.1 200 OK
And here are the request headers:
User-Agent: Mozilla/5.0 (X11; Linux x86_64; rv:26.0) Gecko/20100101 Firefox/26.0
Pragma: no-cache
Origin: null
Host: localhost:3000
Content-Type: application/x-www-form-urlencoded; charset=UTF-8
Content-Length: 36
Connection: keep-alive
Cache-Control: no-cache
Accept-Language: en-US,en;q=0.5
Accept-Encoding: gzip, deflate
Accept: application/json, text/javascript, */*; q=0.01
As far as I can tell, everything appears to be fine up until this point. However, in my jQuery code, the fail() callback is always being called:
$.ajax({
type: 'POST',
url: 'http://localhost:3000/login',
data: {foo: 'bar'},
dataType: 'json'
})
.done(function() {
console.log('done');
})
.fail(function() {
console.log('fail');
});
This is what my response header looks like:
X-Powered-By: Express
Transfer-Encoding: chunked
Date: Fri, 17 Jan 2014 07:12:01 GMT
Connection: keep-alive
How to I configure my Express or jQuery setup to properly handle JSON responses?
A:
Try this:
$.ajax({
type: 'POST',
url: 'http://localhost:3000/login', ///<------do this
data: {foo: 'bar'},
dataType: 'jsonp', //<---for cross domain json data access
contentType:"application/json; charset=utf-8" //<----add this
})
.done(function() {
console.log('done');
})
.fail(function() {
console.log('fail');
});
Check if your server is setup with correct headers Access-Control-Allow-Origin:
header("Access-Control-Allow-Origin: http://yourdomain-you-are-connecting-from.com/");
Update:
For cross domain json data access can be done with jsonp dataType.
From the docs:
JSONP
If the URL includes the string "callback=?" (or similar, as defined by the server-side API), the request is treated as JSONP instead. See the discussion of the jsonp data type in $.ajax() for more details.
| 2023-08-12T01:26:19.665474 | https://example.com/article/8492 |
The present invention relates to a new and useful method of preparing organophosphorous compounds. More particularly, the present invention relates to a method of preparing dialkyldithiophosphinates.
As is known, middling particles which result from either coarse grinding or from intimate association of the component minerals which make up an ore and frequently exist even after fine grinding are composed of two or more mineral species. In general, such polyphase particles are generally more difficult to concentrate by flotation than free mineral grains. In some free-milling ores, the values are readily separated from the gangue by crushing and grinding to permit the application of flotation techniques. In other ores a middling treatment problem is presented. The extractive metallurgist is thus compelled to compromise between obtaining a desired high recovery of mineral values and the grade of the concentrate produced. High recoveries in concentrates of low grade entail high treatment costs in subsequent upgrading and refining operations, which may force the rejection of larger percentages of the contained metal values so as to obtain a concentrate which is salable or amenable to further treatments. Further, in many cases, the middling particles are not recovered, even though amenable to standard refining processes, and thus represent high losses of the desired mineral values.
Dialkyldithiophosphinates are effective promotors in solving the middling treatment problem of sulfide ores (See U.S. Pat. No. 3,355,017). These promotors were reported therein to be more effective than known collectors usually employed in floating coarse mineral particles, particularly particles in the plus 150 Tyler mesh range.
Dialkyldithiophosphinates useful as sulfide mineral promoters conventionally are prepared by reacting dialkylphosphine with a mixture of water, sulfur and base, such as sodium hydroxide. Although the prior art discloses reaction temperatures up to about 100.degree. C., commercial considerations dictate that temperatures less than 30.degree. C. be employed (see U.S. Pat. No. 3,238,248). These low temperature reactions have resulted in yields in the range of about 75-80% and are extremely slow due to the depressed temperature at which the reaction proceeds. Elevation of the temperature of the conventional reaction produces a side reaction between the sodium hydroxide and the sulfur resulting in undesirable alkali sulfides. The presence of alkali sulfide has several detremental effects on the product and its application as a flotation promoter. In the product, alkali sulfides represent a yield loss of alkali and sulfur, produce an off-color solution and create a strongly disagreeable odor. In the application, alkali sulfides depress sulfide minerals during the flotation process and lead to a loss in recovery of those minerals.
Accordingly, there exists the need for an improved process for preparing dialkyldithiophosphinates. Such a new process should be capable of proceeding rapidly and yet maintain low levels of alkali sulfides so as to provide the highest yields and most effective flotation promoters. | 2024-05-31T01:26:19.665474 | https://example.com/article/4935 |
The natural history of electrocardiographic preexcitation in men. The Manitoba Follow-up Study.
To examine the natural history of preexcitation occurring on the routine electrocardiogram (ECG). A longitudinal cohort study of 3983 originally healthy men followed prospectively for 40 years. Free-living (community-dwelling) study members residing predominantly in Canada. Nineteen male study members with preexcitation occurring during routine examination in the 40-year follow-up of the Manitoba Follow-up Study. Routinely requested clinical examinations and ECGs, supplemented by information supplied by the study member or his physician. Ten study members were found to have preexcitation at enrollment, for a prevalence of 2.5 per 1000 (95% CI, 1.2 to 4.6). A delta wave was first detected during follow-up in an additional nine study members. Seventeen of 19 study members did not have the delta wave at some later time, and preexcitation was intermittently present in most of these members. Over time there was a loss of preexcitation, with 15 of 19 study members no longer exhibiting a delta wave by the end of follow-up. Five of 11 study members with symptoms had physician confirmation of an arrhythmia. Fourteen study members remain alive, and none of the five deaths was attributed to preexcitation. Preexcitation found on routine ECG in our originally healthy male study group did not confer excess morbidity or mortality, even in those study members who developed symptomatic arrhythmias. Most preexcitation was intermittent and disappeared over time. | 2023-11-30T01:26:19.665474 | https://example.com/article/9964 |
Q:
need jquery video file uploader example
i need jquery video file uploader example.so,that i can upload images and delete it dynamically.
A:
There are couple of good jQuery plugins.
http://www.uploadify.com/demos/
http://www.webdeveloperjuice.com/2010/02/13/7-trusted-ajax-file-upload-plugins-using-jquery/
http://www.fyneworks.com/jquery/multiple-file-upload/
However you need a server side page(ASP / PHP/ ASP.NET etc...) to accept the http request(which comes from this jquery plugin) and save the file to hard disk /save an entry in your table about the uploaded files.
| 2023-12-15T01:26:19.665474 | https://example.com/article/1449 |
It is known to compress metallic powder and also powder of other material into compacts with a view to sintering the compact subsequently. It is specifically tools of sintered carbide which are manufactured in the sintering process, e.g. reversible cutting blades for milling. Powder presses operate either as eccentric presses or hydraulic presses. Hydraulic presses are preferred because the hydraulic press cylinders can be controlled better with regard to the pressure and path. In a hydraulic press, an upper press cylinder and a lower press cylinder each are connected to the upper ram and lower ram which are associated with a die-bore. The powder is filled in by means of a charging shoe when the lower ram has been moved into the die-bore. Precise proportioning is accomplished by causing the lower ram to move up by a certain amount subsequently, whereupon any powder projecting beyond the die-plate surface is removed by stripping. Subsequently, the powder is compressed by means of the upper ram, in which process the lower ram may be shifted accordingly.
The factor crucial for the quality of the compact is that the powdered material be as homogeneous as possible in its density. It is known to enhance homogeneity by actuating the charging shoe in a predetermined manner, e.g. using different speeds in the forward and backward strokes. It is further known not to move the charging shoe to and fro only linearly in a single direction, but to overlay this motion by at least one lateral motion. It is further known to cause the charging shoe and the die-plate to oscillate by means of an appropriate vibration device of a predetermined frequency and amplitude to improve the homogeneity of the powder in the die-bore. Finally, it is also imaginable to vibrate the lower and upper rams, particularly during the fill-in procedure and at the beginning of the compression procedure. In case of compacts which are of different width extensions in an axial direction care has to be taken that the rams do not travel against an edge so as to be damaged. This will naturally damage the die-bore, too Hence, it is also known to associate the rams with distance-measuring transducers which ensure that the rams can be moved to predetermined positions.
When compacts are manufactured according to the method described it is further essential for the compacts to exhibit approximately equal densities. This requires that the maximum compression force which is achieved in the end position of the upper ram, for example, should remain as equal as possible. However, the compression force is dependent on different factors. When the filling volume is varied the maximum compression force produced will naturally vary, too. A different compression force will also result when the powder is distributed inhomogeneously.
It is further known to arrange a load cell between the press cylinder and the ram, by which the respective maximum compression force can be recorded. In operation, care has to be taken that if the maximum compression force differs too much from a predetermined value an approximation to the desired compression force be obtained by modifying certain parameters. | 2024-06-04T01:26:19.665474 | https://example.com/article/9035 |
Aishwarya Arjun
Aishwarya Arjun is an Indian film actress. She made her film debut in the Tamil film Pattathu Yaanai in 2013.
Personal life
Aishwarya Arjun was born in Bangalore, Karnataka and is the daughter of popular film actor and director Arjun Sarja and former actress Asharani. She has a younger sister, Anjana. Her grandfather Shakti Prasad was a popular actor in Kannada. Her cousins Chiranjeevi Sarja and Dhruva Sarja are popular actors in Kannada.
Early life
She completed her schooling from Sacred Heart, Church Park in Chennai and went on to receive her Bachelor of Commerce degree from Stella Maris College, Chennai, before making her foray into films. Aishwarya also briefly pursued a Fashion degree at Birmingham City University in the United Kingdom.
Filmography
References
Category:Actresses in Tamil cinema
Category:Living people
Category:Actresses from Chennai
Category:1990 births
Category:Alumni of Birmingham City University
Category:Stella Maris College, Chennai alumni
Category:21st-century Indian actresses
Category:Actresses in Kannada cinema | 2023-08-23T01:26:19.665474 | https://example.com/article/8597 |
# Copyright 2018 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.
"""Contains resolvers for different attributes of Action in aquery output."""
import copy
class DepSetResolver(object):
"""Utility class to resolve the dependency nested set."""
def __init__(self, dep_set_of_files, artifact_id_to_path):
self.dep_set_to_artifact_ids = {}
self.id_to_dep_set = {dep_set.id: dep_set for dep_set in dep_set_of_files}
self.artifact_id_to_path = artifact_id_to_path
def resolve(self, dep_set):
"""Given a dep set, return the flattened list of input artifact ids.
Args:
dep_set: the dep set object to be resolved.
Returns:
The flattened list of input artifact ids.
"""
if dep_set.id in self.dep_set_to_artifact_ids:
return self.dep_set_to_artifact_ids[dep_set.id]
artifact_ids = copy.copy([
self.artifact_id_to_path[artifact_id]
for artifact_id in dep_set.direct_artifact_ids
])
for transitive_dep_set_id in dep_set.transitive_dep_set_ids:
artifact_ids.extend(
self.resolve(self.id_to_dep_set[transitive_dep_set_id]))
self.dep_set_to_artifact_ids[dep_set.id] = artifact_ids
return self.dep_set_to_artifact_ids[dep_set.id]
| 2023-08-28T01:26:19.665474 | https://example.com/article/7436 |
Dhanush will be delivering a speech at IIM, Ahmedabad on Tuesday. It is a great honor to be part of the most prestigious institute in the country and Dhanush is both excited and nervous. The actor says that he is not that comfortable with English and is feeling a little nervous on that account.
However, Dhanush is not going to let it bother him too much and is going to go ahead and do his part right. The actor said jokingly that the language barrier will not hold him back as this is India not England. | 2023-10-07T01:26:19.665474 | https://example.com/article/8970 |
In moving to the cloud, many organizations are opting for private cloud computing environments. This model makes a lot of sense as a method to consolidate IT expenditures and resources, automate tasks and introduce new technologies such as virtualization. Often, this model provides a bridge between legacy systems and new ways of thinking about technology.
By submitting your personal information, you agree to receive emails regarding relevant products and special offers from TechTarget and its partners. You also agree that your personal information may be transferred and processed in the United States, and that you have read and agree to the Terms of Use and the Privacy Policy.
More on moving to the cloud
Security presents challenges in the public cloud, but you’ve probably already solved many of those challenges in your own data center. Why not use those solutions with centralization and automation to reduce the initial complexity of a cloud project?
Moving to the cloud doesn’t require virtualization
Many enterprise IT shops are moving toward cloud computing while thinking that it’s all about virtualization. In many data centers, a virtualization platform is central to service offerings, but clouds aren’t really defined just by technology. Instead, they involve people, processes, centralization and control. Moving to the cloud promises to consolidate duplicate services within an organization and to automate routine, mindless tasks so that employees are free to work on difficult problems.
A cloud can be a shared infrastructure, which could be virtualized, but it could also encompass physical hardware. Take public cloud services such as Google’s Gmail or Microsoft SkyDrive. Those services don’t use virtualization. Instead, each is built on thousands of physical machines. Some of your private cloud services may be built this same way, especially for services that rely on technologies such as Microsoft Cluster Service, which can be somewhat incompatible with how virtualization environments work.
The goal is centralization, not virtualization. If you can consolidate 50 file-and-print servers spread throughout your organization into three clustered physical hosts, that’s a cloud win, regardless of the lack of virtualization.
Making the transition to the cloud
So how do you move from a virtual environment to the cloud? First, standardize your technology foundations. Virtualization enables organizations to standardize operating system configurations using virtual machine (VM) templates and to automate some of the deployment tasks. It also lets them standardize on areas such as replication, firewalls and other security measures, OSes and storage configurations. Standardize these where possible for both virtualization and cloud computing.
If you cannot create a one-size-fits-all solution, pick several sizes. The goal is to eliminate one-off configurations. Having 10 different types of VMs is much better than having 3,000 individual configurations.
This is also a great time to think about automation, specifically about eliminating repetitive tasks. In moving to the cloud, could you add routinely used software to the virtual machine templates to avoid having to install it? Instead of creating local accounts on each server, would a central Lightweight Directory Access Protocol or Active Directory instance be more useful? Could you begin using configuration management tools such as Puppet or Chef to automatically transform and manage a server’s configuration?
Even a script of routinely run commands helps enormously. Systems administrators take pride in their laziness -- not typing commands more than once if they can help it. Follow their lead and avoid doing the same task more than once without automating it.
Automation is not necessarily about self-service, though. Too often, the cloud is seen as a self-service offering, but IT shops have spent years wrapping process around the act of creating and managing servers for good reason. These processes are often responsible for how a server or service is monitored, how documentation is created or how licensing is handled, for example. Throwing these things aside by offering self-service is a mistake.
Once you’ve laid a good foundation for your cloud with standards and automation, you can begin the more difficult work of surveying your organization for the IT services it runs. Finding the services in use can be challenging. Even tougher is figuring out why each one exists.
People may have good reasons to duplicate services. For example, perhaps the company's main Web servers didn't support a specific technology, so a department created its own. Document these needs and work to extend central offerings to meet them. You absolutely have to be flexible, too. Moving to the cloud unwinds years of work on IT infrastructure in the process of centralizing, and you will find things you never anticipated.
What is your biggest challenge in moving to the cloud?
2 comments
E-Mail
Username / Password
Password
By submitting you agree to receive email from TechTarget and its partners. If you reside outside of the United States, you consent to having your personal data transferred to and processed in the United States. Privacy | 2024-04-28T01:26:19.665474 | https://example.com/article/2013 |
Of flags on the Moon
Apollo 16 astronaut John Young salutes the American flag. What flag, or flags, will future astronauts bring with them to the surface of the Moon? (credit: NASA)
by Mark Whittington
The recent flap over the omission of the raising of the American flag on the lunar surface during the Apollo 11 mission in the new film First Man illustrates not only the importance of symbols in our understanding of history but how different people regard the same symbols differently. Some Americans were incensed at the omission of the flag raising at Tranquility Base. The makers of the film insist that their decision not to include that event was an artistic decision and one not meant to denigrate the unique role that the United States played in landing a man on the Moon.
With a number of nations aiming toward the exploration of the Moon, one is reminded that love of symbols such as national flags is not unique to Americans.
When the Indian Space Research Organisation’s Chandrayaan-1 orbited the Moon in 2008, it sent a small impact probe with the Indian flag painted on it to crash on the lunar surface. At the time, the Hindustani Times announced that the “Tricolour has landed on the moon,” referring to India’s saffron, white, and green flag. The image likely did not survive impact. However, Chandrayaan-2, which seeks to soft land on the Moon early next year, will likely have India’s national flag on its side for future lunar tourists to see.
Going further into the future, President Donald Trump has directed NASA to return astronauts to the Moon. The program seems to have gained acceptance in Congress and aerospace and science circles. However, contrary to the Apollo missions, which were entirely American undertakings, future trips to the Moon will have international and commercial partners. The need to share costs and the desire for space exploration diplomacy make this arrangement useful. Thus, the next people to set foot on the Moon will come from several nations.
This prompts a question: What unifying symbols will the first humans back to the Moon raise on their landing site? Apollo 11 had two, the American flag and the plaque that announced that the astronauts had come “in peace for all mankind.”
No doubt some sort of plaque will be unveiled about humans returning to the Moon with appropriate, feel-good verbiage. But what about flags? Should the next people on the Moon unfurl flags announcing from where on Earth they came?
The simple solution would be to have each astronaut fly their national flag: the Stars and Stripes standing side by side with the flags of other countries. But some, no doubt, will wonder if displays of nationalism in the form of national flags would detract from the international nature of the next Moon landing. Why not instead design a custom flag that represents every country and commercial entity involved in the return to the lunar surface?
One can just hear the heated arguments that will surely erupt a decade hence, shortly before the rocket that will redeem the Moon for humankind lifts off. Can one still feel national pride in such a mission while at the same time appreciate its international nature?
Whatever is raised on the lunar surface to celebrate the return to the Moon, one can hope that this time it will be of material that will not be bleached white by the sun’s unfiltered ultraviolet rays, as the old Apollo flags have been over the past five decades.
Pictures
Calendar
Pages
Copyright Policy
Rights to the contents belong to their owners. The site administration is not responsible for the content of the material. If you find materials on our site that violate the copyright of you, your company or organization, please let us know. | 2023-11-14T01:26:19.665474 | https://example.com/article/2174 |
A recent mixed methods study conducted in Mozambique found that three-quarters of individuals diagnosed HIV positive reported enrolling in care after their diagnosis; however, only 62% remained in care three to five years after being diagnosed. Just under 20% of people had disengaged and re-engaged in care.
The researchers compared clinical records with data collected via home-based interviews to investigate barriers and facilitators to linkage and remaining in care. They found that some factors, such as authoritarian relationships in the health system, could either encourage engagement or act as a barrier. This study was carried out by Dr Laura Fuente-Soro of the Centro de Investigação em Saúde de Manhiça and colleagues and published in PLOS ONE.
Mozambique is a low-resource setting in sub-Saharan Africa with an estimated adult HIV prevalence of 13%. In 2018, 72% of HIV-positive people were diagnosed and antiretroviral coverage was estimated to be around 55-74%. These estimates fall short of the 90-90-90 goals set out by UNAIDS (90% of those living with HIV are diagnosed, 90% of those diagnosed are on treatment and 90% of those on treatment are virally supressed). Loss to follow-up after diagnosis remains widespread in many African countries, affecting adherence and viral suppression.
The study
Two community-based HIV testing surveys were conducted in the Manhiça district (an area of high HIV adult prevalence, estimated at 40%) in 2010 and 2012 for adults aged 18-50. For these surveys, health workers visited households and offered HIV testing.
Glossary retention in care A patient’s regular and ongoing engagement with medical care at a health care facility. linkage to care Refers to an individual’s entry into specialist HIV care after being diagnosed with HIV. clinician A doctor, nurse or other healthcare professional who is active in looking after patients. 90-90-90 target A target set by the Joint United Nations Programme on HIV/AIDS (UNAIDS) for 90% of people with HIV to be diagnosed, 90% of diagnosed people to be taking treatment, and 90% of people on treatment to have an undetectable viral load. virological suppression Halting of the function or replication of a virus. In HIV, optimal viral suppression is measured as the reduction of viral load (HIV RNA) to undetectable levels and is the goal of antiretroviral therapy.
In 2015, researchers aimed to follow-up with those who had tested positive to estimate linkage to care and long-term retention. Eligible participants were visited at home where a questionnaire and semi-structured interviews were conducted. Questionnaire data was collected for 112 participants while 73 were also interviewed. Researchers also used clinical records as a form of objective data to retrospectively estimate linkage to care and retention.
Of the 278 people newly diagnosed with HIV in either 2010 or 2012, 17% were deceased, 24% were absent from the household and 18% had migrated. Of the remaining eligible 112 participants, the median age at diagnosis was 35; 55% were female with the majority (63%) of participants reporting low educational levels and no fixed salary or agricultural work (53%).
Quantitative results
"The uniqueness of this study lies in the fact that researchers went back into the community to seek out those who had previously tested HIV positive to estimate long-term retention."
Eighty-four participants reported being enrolled in care at any point since their diagnosis. Sixty-six of those who had seen a clinician reported being on antiretroviral therapy (ART) and 69 reported still being in care at the time of the interview. Clinical record data showed that 65 participants had registered at the local district hospital (where services are provided free of charge) after their diagnosis. Of these, 58 remained enrolled three years after diagnosis but only 28 had started ART.
Agreement between self-reported and clinical data regarding taking ART was limited. Another discrepancy was the 36 participants who reported still being in care while hospital records showed that they had been lost to follow-up. Nonetheless, overall there was considerable agreement between self-report and the clinical records.
Individuals diagnosed in 2010 had a longer follow-up time but a greater proportion reported still being enrolled in care when compared to the 2012 group (73% vs 49%). Around 17% of participants in care at the time of the interview had disengaged and re-engaged in care.
Similarly, clinical records showed those diagnosed in 2010 were more likely than those diagnosed in 2012 to be retained in care after three years (37% vs 15%), possibly also reflecting re-engagement in care. This shows that a percentage of individuals who leave care at some point may re-engage, possibly because of disease progression. The authors emphasised that loss to follow-up and retention are not mutually exclusive and that it is important to pay attention to cycles of disengagement and re-engagement in care.
Just under a quarter of participants did not disclose their status to the interviewer, despite having previously tested positive in 2010 or 2012. Researchers interpreted this as a possible indicator of anticipated stigma, either related to their HIV status or fear of disclosing dropping out of care.
Interviews with a subset of participants revealed the following themes regarding linkage to care and long-term retention.
Factors influencing linkage to care
Participants discussed a range of issues impacting upon their decision to enrol in care in the first place. These included their level of health literacy, competing needs (such as migratory work), social and partner support, the influence of traditional healers, how empowered they felt and willingness to start ART.
Facilitators included placing a high value on health and a fear of becoming ill or dying as a result of delaying care (mainly reported by women). Additional gender differences were seen in how empowered participants felt, with women expressing a greater desire to seek out services whereas men reported being encouraged by their female partners or relatives.
Occasionally, male refusal to seek out care could prevent a woman from seeking it out for herself.
"I started the process [enrol in care], but I didn't take the medication . . . because they told me that I had to tell my husband to test him too, but he refused that I continue with the treatment" – 26-year-old female.
Structural barriers in the health system included long queues and waiting times, incompatibility with working hours and the feeling of being lost within the hospital system. After diagnosis, patients said they needed to make multiple visits to be seen by a clinician. Participants also expressed frustration regarding the lack of empathy and abusive/disrespectful behaviour of healthcare providers.
"When I arrived to the hospital, I left the guide [testing documentation] with the receptionist. I left it in the window, and they received it and went to do other work at the reception. I didn't ask anything because they scared us in the hospital. . .” – 43-year-old male.
Factors influencing long-term retention
Participants cited health improvements as one of the main reasons for remaining in care.
"I want to continue with the follow up because I'm seeing the results… Before, I always felt my body weakened, but now I feel good." – 53-year-old male.
Adherence to ART was viewed as important in order to maintain an optimal state of health. Women expressed a desire to stay alive and healthy in order to take care of their children. Largely, participants viewed side effects of treatment as a challenge that they had overcome and not as a reason to drop out of care. However, ART stockouts impacted on participants’ decision to remain engaged in care.
Regarding the health system, strong authoritarian relationships between healthcare providers and users emerged as both a facilitator and a barrier. Many participants viewed the clinician as a knowledgeable source of authority who needed to be obeyed, facilitating compliance and retention in care. However, for others, the fear-based relationship meant that they were hesitant to return after missing an appointment or losing their hospital card.
"It is my duty [to continue in care], I have to comply, do what the doctor tells me to do." – 44-year-old female.
“. . . I went [to the hospital], but then I travelled and then they stole my bag and I always walked with my hospital card . . . so they stole my card . . .I didn't went anymore . . .I'm afraid because I don't have my card [hospital identification] . . . Someone told me that when you miss the appointments, they talk . . . " – 22-year-old female.
Conclusion
The uniqueness of this study lies in the fact that researchers went back into the community to seek out those who had previously tested HIV positive in order to estimate long-term retention in care and factors impacting upon this. They conclude by stating: “Our results highlight the importance of the relationship between people living with HIV and the health system in the achievement of the 90-90-90 targets. Depending on the interaction, the health system can act as a double-edged sword representing either a facilitator or a barrier across the cascade of care.”
Regarding finding ways of empowering healthcare users and encouraging retention, they add, “Making patients feel their needs are heard, respected and addressed and that they are active participants in their HIV-care, and not simply passive users of the health system could be a possible approach in order to support long term retention.” | 2023-11-10T01:26:19.665474 | https://example.com/article/4072 |
First pitch received with love for SC teen
There are certain moments in life that you never forget. For Hali Palmer, one of those moments occurred on a humid Tuesday afternoon in Myrtle Beach in front of a crowd of baseball fans at TicketReturn.com Field at Pelicans Ballpark.
For Hali Palmer, one of those moments occurred on a humid Tuesday afternoon in Myrtle Beach in front of a crowd of baseball fans at TicketReturn.com Field at Pelicans Ballpark.
As the sun set over the Carolinas, Socastee High School sophomore cheerleader Palmer casually walked out to the pitcher’s mound to throw out the ceremonial first pitch.
After a successful throw, she walked down the line to shake the hand of the man on the receiving end of her pitch and instantly began crying as she realized she was looking into the eyes of Army Staff Sgt. Richard Palmer, her father who had been deployed to Kosovo for the last year.
“I was told he was going to come home in about three weeks, around June 20th,” Palmer said. “I had no idea.”
As she stood with tears streaming down her face, she recalled the previous moments with a look of pure joy.
“I heard him talking to the guy next to him before he took the mask off and obviously I know his voice, so I instantly started crying,” Palmer said. “I was like, ‘This isn’t real,’ and then he took the mask off, and I was just shocked. I mean obviously I didn’t think I was coming to the Pelicans game to meet my dad who I haven’t seen in over a year. I thought I was coming to represent Socastee cheerleading, so it was just overwhelming and very emotional.”
Mike Gilbert, a fellow firefighter at Myrtle Beach Fire Department, set up the event merely days before it took place.
Her father, however, wasn’t prepared for such an extravagant welcome.
“It’s kind of embarrassing; I was wanting something a little more low key. But it’s not about me, it’s about my family,” Palmer said. “They’re the ones that make more sacrifices than I do.”
It was particularly hard for Hali, whom friends and family said is extremely close to her father. Away for his second deployment, Richard missed his daughter’s 16th birthday, the day she got her driver’s license and the start of her cheerleading career.
That was the toughest part, Hali said, and her friends took notice.
“It was heartfelt. It was very emotional, and I know it had a big impact on Hali,” Hali’s friend and Braves softball pitcher, Mallorie Roesing, said of Tuesday’s surprise. “She’s been constantly asking ‘When is my dad coming back, when is my dad coming back?’ and now that it finally happened, she’s just immediately much happier.”
It was particularly hard for Hali to say goodbye the second time, her friend, Sybil Fischer, said.
“I was there the day that Hali dropped her dad off. That was really emotional; obviously I’m not even Richard’s daughter, but I’ve always looked up to Richard as a dad and for me that was so emotional,” she said. “I mean Hali and [her mom] Aimee were both in tears, and it didn’t really hit us until we were driving back and we knew that was going to be the last time we saw him for a long time.”
Said Hali: “The last time I saw him we were at his military base and he was leaving the next day so he had to say goodbye and it was really hard. It’s not easy; I cried a lot, and the longer he was gone, the harder it was, so this year hasn’t been easy.”
According to Myrtle Beach Pelicans Director of Promotions, setting up the special moment wasn’t too difficult, even considering the short notice.
“One of the main things that we had to do was connect with our clubhouse and let all those guys in there know because I know that they’re going to give him a special welcome home as well when he goes into the clubhouse,” she said. “Other than that, [the focus was] pretty much just getting a uniform and catcher’s gear – which wasn’t hard to do because we have those lying around in the back.”
It was a welcome that has been long overdue for Richard, as well. As he took a big drink from his first beer in over a year, he smiled.
“It feels awesome [being home],” Richard said. “It’s cool to be able to walk down the street, get in your own car, go to the gas station whenever you want and not have to worry about clearing it with anybody or anything like that just get in and go. Lucky.”
As the Pelicans’ game against the Potomac Nationals began and the reunited Palmers made their way back to their seats to adjust to much-needed family time, Hali offered one final thought.
“I’m so happy. Obviously I didn’t know this was going to happen, and I’m just overwhelmed,” she said. “Having him the home is the best thing that could ever happen to me.” | 2023-09-03T01:26:19.665474 | https://example.com/article/8657 |
Again, what makes a professional team considered to be great? Several teams in various sports have been labeled great.
Front and center are the New York Yankees, winners of 26 World Series Championships and 39 American League pennants. No pro basketball organization has won more titles than the 17-time World Champion Boston Celtics.
Liverpool once won four-straight English League Cup Championships. The Montreal Canadiens have captured 14 Stanley Cups, including two separate runs of four championships in a row.
But none of these franchises have been labeled “America’s Team.” That designation has been reserved for the Dallas Cowboys.
The Cowboys are one of the most famous sports franchises in the world. But why “America’s Team?”
Is it fair to access a single American sports franchise as though it is THErepresentation of our entire nation? Really, shouldn’t the Olympic teams of the USA be considered this?
Since the Packers have the most NFL titles, should they be labeled as "America's Team"?
The Cowboys have more victories on Monday Night Football (41) than any other NFL team and hold NFL records for the most consecutive winning seasons (20, from 1966 to 1985) and most seasons with at least 10 wins (25).
The team has earned the second most post-season appearances (29–one short of the Giants’ 30), a league record of 56 post-season games (winning 32 of them), the most division titles with 20, the greatest number of appearances in the NFC Championship Game (14), and the most Super Bowl appearances (eight).
The Cowboys became the first team in NFL history to win three Super Bowls in just four years (a feat that has been matched only once since, by the New England Patriots). In the pro football universe from 1963-1983, the Cowboys won more games than any other team.
Cowboys Hall of Fame Coach Tom Landry
Does this on-field achievement qualify them as “America’s Team?”
“More than any other sport, football is a team-oriented game,” said Cowboy great and Hall of Famer Emmitt Smith. “I will tell anyone….that I would not have had anywhere close to the successful career that I enjoyed without the quality type of guys (similar to) the 1970s.”
Early Tribulations
This success didn’t sprout overnight.
Initially, the Cowboys were spearheaded by a three-headed monster with General Manager Tex Schramm supplying the players, Gil Brandt as player personnel director and head coach Tom Landry. Landry was a defensive experimentalist, while Schramm was a superlative who wasn’t apprehensive about spending money in order to find the best talent.
Cowboys QB Eddie LeBaron
The franchise began as an expansion team in 1960. For years, the NFL refused all expansion inquiries, but the emergence of the upstart rival American Football League changed the owner’s minds.
The NFL chose Dallas (1960) and Minnesota (1961) because they learned the AFL had awarded teams there with the hopes that expansion would squash the new league before it even began. The AFL’s vacant Minnesota team was relocated to Oakland while the Dallas Texans began play in their inaugural season of 1960.
The expansion NFL team was first named the Dallas Steers and then changed to the Dallas Rangers. This nickname was also changed because of an AAA baseball team called the Dallas-Ft. Worth Rangers. The club then settled on the name Cowboys.
The club was stocked via a player pool from each of the existing 12 NFL teams and considered a “swing team” playing every squad one time. That season produced a 0-11-1 record. In fact, the first six seasons produced losing records.
During the same time, The Dallas Texans of the American Football League were one of that league’s strongest teams. In 1962, they took the AFL crown while in the same season the Cowboys plodded along to a 5-8-1 record.
Cowboys GM Tex Schramm has been called the architect of the franchise
Even with the Texans on the road to a championship, the Cowboys far outshined their neighbors in attendance and gained more attention due to the NFL’s storied existence and the older league’s established star players.
After the 1962 season, Texans owner Lamar Hunt looked for a suitable city to relocate the Texans. He set his sights on New Orleans, but passed when he realized that the stadium suitable for pro football was still segregated. Next, he looked at Kansas City, and moved the franchise there the following season and renamed them the Chiefs.
At this time, however, the Cowboys were not referred to as “America’s Team.” When then?
The 1961 draft was the Cowboys first, and Landry used their first-ever choice on two-time All-Southwest Conference and consensus All-American defensive end named Bob Lilly.
“Those first few years were certainly lean,” recalled Lilly, who was enshrined into the Pro Football Hall of Fame in 1980. “But we had one of the best coaches and general managers in the league, and later got some quality players who were dedicated to the game.”
The Cowboys were ahead of most of the NFL clubs in terms of scouting. They spent more money and time and used methods that were unconventional at the time.
“We would do the tryouts and camps, which weren’t being done back then,” stated Tex Schramm during an interview before his passing in 2003. “We would bring in more free agents than half a dozen other teams combined, and we were very active in scouting the smaller schools. No other team was putting that effort into those schools, and it paid off again and again for us.”
Schramm served as the team’s president and GM from 1960 to 1989. He became known for innovations that helped redefine the modern NFL, such as computer scouting, the famous cheerleaders, instant replay and institution of the scouting combine.
And what about the success of the fabled first round? Lee Roy Jordan, Billy Joe Dupree, Calvin Hill, John Niland, Ed “Too Tall” Jones, Jim Jeffcoat, Duane Thomas, as well as Hall of Famers Tony Dorsett and Randy White.
“When I was a kid, all you ever heard about was the Cowboys,” related Emmitt. “I wanted to be like Tony Dorsett. The Cowboys were like Michael Jordan and the Chicago Bulls–-they were always winning. And people want to follow teams that are winners. It provides a positive influence in their own lives–something to be proud of.”
Schramm explained that as players left, others just as good or better were added. “The key was that we had a good organization and the team stayed together season-after-season,” he said. “Plus, we had a great coaching staff.”
But back to the burning question, how did the Cowboys get labeled “America’s Team?”
Japan and Mexico are areas that have huge Cowboys followings
Success At Every Organizational Level
During Coach Landry’s 29-year tenure, the Cowboys finished first in their division an amazing 13 times, placed second seven years, went to the playoffs 18 different seasons, and visited the NFL Championship or the Super Bowl seven times, winning twice.
Twenty-consecutive winning seasons were achieved from 1966-1985; ranked fourth-longest of any sports franchise behind the Yankees, Canadiens and the Boston Bruins. Dallas never really dominated year-after-year in the same fashion as say, the UCLA Bruins did in college basketball, but they were consistently in the hunt.
“Our Cowboys always wore white hats, was the good guys and represented what was best in America, and it just took hold. Certainly the cheerleaders didn’t hurt either,” offered Bryant Sewall, owner of the Phoenix Prowlers, a professional women’s football team of the Women’s Football Alliance. “The hole in the roof at Texas Stadium so God could watch the game added to the mystic as well.”
So basically, success on the field and the “Almighty” looking on is why the Cowboys are known as “America’s Team,” correct?
When the Cowboys obtained DE Charles Haley from the San Francisco 49ers via a trade in 1992, Oakland Raiders owner Al Davis called Cowboys owner Jerry Jones and told him he had just won his first Super Bowl. The Cowboys would win three Super Bowls over the next four seasons.
Maybe there are other reasons. The Cowboys had an uncanny knack of snatching key players in the latter rounds that other clubs simply wouldn’t take a chance on. Herschel Walker (1985, Round 5) was playing in the USFL when he was selected.
After graduating from the Naval Academy, Roger Staubach was headed for four years of active military duty. Most NFL teams had taken him completely off their draft boards and stayed clear of him in the 1964 draft, until Schramm “wasted” a 10th-round pick on him.
“Schramm loved the game and did as much for the entire league in enhancing its popularity as he did for his own team,” Staubach related. “Of course the winning record that Landry established and his longevity with the franchise made it even more remarkable.”
Worldwide Recognition
All of this equated to one simplistic formula—the fan base of the Dallas Cowboys grew and grew. Suddenly, they were everywhere. Could the Cowboy legions enable them to be identified as “America’s Team?”
RB Emmitt Smith
“Anytime you like football, play football or just watch football you know who the Cowboys are,” said Cowboys defensive tackle Marcus Spears, one of the current curators of the title. “And even though Dallas may not be your team, you tend to follow those that are winning. And (they have) the biggest and best fan base in the NFL.”
Fans everywhere have the same view. Some feel the term came from the legions of Cowboys fans throughout every city, or the huge TV ratings.
Others think the designation derived from the “Everything’s big in Texas” attitude. Perhaps because the Cowboys always seem to outperform every other team in merchandise sales is on the cusp of the answer.
The 1990s certainly proved what a formidable powerhouse the Dallas Cowboys had become in the NFL. From 1990-1999, the team qualified for the playoffs eight times, won six division titles, made four trips to the NFC Championship game and captured three Super Bowls.
The roster was a plethora of All-Stars, just like the teams that dominated the Landry-era: Deion Sanders, Troy Aikman, Larry Allen, Charles Haley, Mark Stepnoski, Michael Irvin, Brock Marion, Emmitt Smith, Erik Williams, Jay Novacek and Moose Johnston were just some of the familiar names associated with the team as the NFL's most successful team in the decade of the 1990s.
“I grew up a Cowboys fan and watching those guys,” said Willie Parker, a former running back of the Pittsburgh Steelers. “They were a flashy team and had all the pieces.”
Cameras Tell the Tale
With all this success on the gridiron, many football fans think the term “America’s Team” was self-proclaimed vanity from the Cowboys organization, which is incorrect.
The truth is, that the “America’s Team” label actually originated from NFL Films.
The Cowboys had just won Super Bowl XII in 1977 after going 12-2 during the regular season. They were three-deep in most positions and had a roster full of All-Pro players. This was before the days of free-agency so just about every player came back year-after-year.
NFL Films shot footage of every game of every NFL team for various weekly highlight shows and season-ending highlight videos. During the 1978 season en route to a 12-4 record, the camera crews at NFL Films noticed that when the Cowboys played at a visitor’s stadium, it seemed there were just as many fans in attendance dressed in the silver and blue as were the colors of the home club.
DE Bob Lilly
That year, Dallas won their 10th division crown then swept both playoff games before losing a heartbreaker to the Steelers 35-31 in Super Bowl XIII.
Bob Ryan has produced and edited every Cowboys highlight video for NFL Films since 1964. Remembering the constant comments the film crews had made week-after-week, for the 1978 highlight video Ryan wrote into the beginning of the sequence of the film (narrated by the legendary John Acenda):
The Cowboys are the Notre Dame of professional football.
No matter where they play, their fans are there to greet them.
Their faces are recognized by fans all across this country.
The sum total of their stars are a galaxy.
They are the Dallas Cowboys….America’s Team.
Cowboys GM Schramm had a past history in television as the lieutenant to the head of sports at CBS, Bill MacPhail. Schramm was also once the public relations director with the Kansas City Athletics and eventually became the GM of the Los Angeles Rams.
Schramm knew exactly what to do with the newly-found moniker, took that distinction, and ran with it.
“Mr. Schramm was quite the innovator when it came to turning football into a passion in our homes,” explained Charlie Waters, star defensive back for the Cowboys from 1970-1981. “He had a background in TV and used that label to not only promote the Cowboys, but the entire NFL.”
At first, Coach Landry and the players despised the trademark that Schramm now had labeled the franchise. It gave opposing teams an extra incentive to play better and hit harder. Other teams would rag on the Cowboys all game and try to inflict undue harm as well as amp up the trash talking.
“The Redskins were the worst,” Lilly explained. “They’d say something like ‘America’s Team has come to town, we’d better shudder.’ We didn’t want it but it stuck. Strangely, that label is worth more to the players after their career is over, and it’s something that each of us is proud of.”
“It is something you have to work hard at to continue to represent the legacy of all of those before you,” added Tashard Choice, backup running back for the current club. “Because of the big star on the helmet, there’s tradition.”
Although the franchise continues to win, the club failed to notch a playoff victory in 12 seasons from 1997-2008. A division title was captured in 2007 and 2009, but the team failed to advance in the playoffs. The current team obviously has its share of star-calibur players including Tony Romo, DeMarcus Ware, Miles Austin, Bradie James, Jay Ratliff and Jason Witten. The lineup also houses many young futurestars such as Dez Bryant, Doug Free, Sean Lee, Jason Hatcher and Tyron Smith.
Once the leader in winning Lombardi trophies, the Steelers have taken over the lead while other teams such as the Patriots, Packers, Steelers, Colts and Ravens are annually at the top of the heap usually positioning itself for the latest NFL title.
Perhaps it is time to pass the torch of the title of “America’s Team.”
“The Steelers don’t want that title,” offered Parker. “Dallas is a team that needs the publicity. They have players that need to be known for something. “The Steelers just want to be known for winning championships.”
Schramm added that the ingredient to winning consistently was simple. “You find stable, quality players who can grow within your system. Part of our success was that the heroes lived in the area and were there this season and also tomorrow,” he said. “You create your own tradition and heritage.”
“Every other team in the league still wants to beat the Cowboys,” concluded Staubach.
The Cowboys rosters are continually full of All-Star caliber players, while the trophy case holds five Super Bowl trophies. Are the Cowboys truly “America’s Team?”
NFL Films says they are.
Barry Shuck is a Contributor for Bleacher Report. Unless otherwise noted, all quotes were obtained first-hand. | 2024-01-13T01:26:19.665474 | https://example.com/article/7783 |
1. Field of the Invention
The invention relates to a process for connecting at least one load to a line which is provided both for supplying operating energy and for data transmission, the data signals and operating energy being decoupled with at least one reactor. The invention further relates to a circuit for connecting at least one load to a line which is provided both for supplying operating energy and for data transmission, with at least one reactor for decoupling of data signals and operating voltage. A reactor is an electrical component with inductive operating characteristics.
2. Description of the Related Technology
A process and circuit of this type are known in conjunction with two-wire bus lines, one of these bus lines being the so-called actuator-sensor interface bus, abbreviated ASI. Connected to the ASI bus are sensors such as photoelectric barriers, proximity switches, etc., with signals or information derived therefrom relayed to a master device and from there to consumers or actuators, such as solenoid valves, electromagnetic actuators, etc., via the bus. All system components such as the master device, power source, sensor and actuator electronics are connected exclusively by the ASI bus line which can be branched in any way to the different system components. Not only data signals are transmitted between the master device and sensors or actuators go via the two wires of the bus system, but the sensors and actuators are also supplied with the necessary operating energy via these two wires.
To make the wiring as simple as possible, the cable for the ASI bus is a simple unshielded two-wire line. The data signals are modulated symmetrically onto the line. This symmetry prevents the influence of noise on the bus system due to incident radiation of outside electromagnetic fields on the cable. In addition, the line symmetry prevents emission of electromagnetic noise by the cable caused by the high frequencies of the data signals.
The sensors and actuators connected to the ASI bus system and their built-in electronics do not influence the bus system symmetry if the two bus lines are not connected, for example, to the housing, and the capacitive loading of the two wires is roughly the same.
The sensors and actuators offered by manufacturers in most cases have a two- or three-lead terminal for connection to a control unit. These "binary sensors" are neither suited nor designed for connection to the ASI bus system. However, for connection of these components to the ASI bus system so-called user modules are available which convert the bus information into binary signals and vice versa. The sensors and actuators can be connected to these user modules using conventional DC voltage technology.
One example of a circuit in this prior art user module is shown schematically in FIG. 2 for connection of an actuator, for example an electromagnetic valve with inductive load 1. There is one reactor 4, 5 in each of the plus and minus bus line 2, 3. Reactor 4 of plus bus line 2 is at one terminal of inductive load 1 via switch 6 and reactor 5 is joined directly to the other terminal of inductive load 1. Between the terminals of reactors 4 and 5, facing inductive load 1, is electrolytic capacitor 7 and on the other side of switch 6 diode 8 and Zener diode 9 are parallel to inductive load 1, the anodes of diodes 8, 9 being connected to one another.
Reactors 4, 5 are used for decoupling of data signals from the operating voltage in two bus lines 2, 3. Electrolytic capacitor 7 prevents the bus current from having an overly high current gradient, i.e., an overly high value di/dt, when the load is connected and disconnected.
Normally the sensors represent a small ohmic or capacitive load and the user module can easily handle such a small load. The current necessary for the actuators is generally much higher than the current for the sensors. Switch 6, conventionally a relay switch, is necessary for connecting the actuator and is located between the actuator and electrolytic capacitor, so that the bus current does not reach overly high di/dt values when the load is connected and disconnected. Since this higher current flows through reactors 4, 5 of the user module, they must be made relatively large. Loads greater than approximately 2.5 watts cannot be supplied with electric power from the bus, but are dependent on an outside power source which must additionally be connected to the user module. | 2024-06-28T01:26:19.665474 | https://example.com/article/6389 |
///
/// Copyright (c) 2016 Dropbox, Inc. All rights reserved.
///
/// Auto-generated by Stone, do not modify.
///
#import <Foundation/Foundation.h>
#import "DBSerializableProtocol.h"
@class DBFILEPROPERTIESPropertyType;
NS_ASSUME_NONNULL_BEGIN
#pragma mark - API Object
///
/// The `PropertyType` union.
///
/// Data type of the given property field added.
///
/// This class implements the `DBSerializable` protocol (serialize and
/// deserialize instance methods), which is required for all Obj-C SDK API route
/// objects.
///
@interface DBFILEPROPERTIESPropertyType : NSObject <DBSerializable, NSCopying>
#pragma mark - Instance fields
/// The `DBFILEPROPERTIESPropertyTypeTag` enum type represents the possible tag
/// states with which the `DBFILEPROPERTIESPropertyType` union can exist.
typedef NS_CLOSED_ENUM(NSInteger, DBFILEPROPERTIESPropertyTypeTag){
/// The associated property field will be of type string. Unicode is
/// supported.
DBFILEPROPERTIESPropertyTypeString,
/// (no description).
DBFILEPROPERTIESPropertyTypeOther,
};
/// Represents the union's current tag state.
@property (nonatomic, readonly) DBFILEPROPERTIESPropertyTypeTag tag;
#pragma mark - Constructors
///
/// Initializes union class with tag state of "string".
///
/// Description of the "string" tag state: The associated property field will be
/// of type string. Unicode is supported.
///
/// @return An initialized instance.
///
- (instancetype)initWithString;
///
/// Initializes union class with tag state of "other".
///
/// @return An initialized instance.
///
- (instancetype)initWithOther;
- (instancetype)init NS_UNAVAILABLE;
#pragma mark - Tag state methods
///
/// Retrieves whether the union's current tag state has value "string".
///
/// @return Whether the union's current tag state has value "string".
///
- (BOOL)isString;
///
/// Retrieves whether the union's current tag state has value "other".
///
/// @return Whether the union's current tag state has value "other".
///
- (BOOL)isOther;
///
/// Retrieves string value of union's current tag state.
///
/// @return A human-readable string representing the union's current tag state.
///
- (NSString *)tagName;
@end
#pragma mark - Serializer Object
///
/// The serialization class for the `DBFILEPROPERTIESPropertyType` union.
///
@interface DBFILEPROPERTIESPropertyTypeSerializer : NSObject
///
/// Serializes `DBFILEPROPERTIESPropertyType` instances.
///
/// @param instance An instance of the `DBFILEPROPERTIESPropertyType` API
/// object.
///
/// @return A json-compatible dictionary representation of the
/// `DBFILEPROPERTIESPropertyType` API object.
///
+ (nullable NSDictionary<NSString *, id> *)serialize:(DBFILEPROPERTIESPropertyType *)instance;
///
/// Deserializes `DBFILEPROPERTIESPropertyType` instances.
///
/// @param dict A json-compatible dictionary representation of the
/// `DBFILEPROPERTIESPropertyType` API object.
///
/// @return An instantiation of the `DBFILEPROPERTIESPropertyType` object.
///
+ (DBFILEPROPERTIESPropertyType *)deserialize:(NSDictionary<NSString *, id> *)dict;
@end
NS_ASSUME_NONNULL_END
| 2023-09-08T01:26:19.665474 | https://example.com/article/6889 |
Abu Taha al-Sudan
Abu Taha Al-Sudan (also Abu Talha al-Sudani or Tariq Abdullah) was a suspected member of Al Qaeda terrorist organization, reported to be an explosives expert.
He is believed to have traveled to Southern Lebanon along with Saif al-Adel, Sayful Islam al-Masri, Abu Ja`far al-Masri and Abu Salim al-Masri, where he trained alongside Hezbollah.
A Sudanese national married to a Somali woman, al-Sudan had lived in Somalia since 1993. He was more recently identified as a close associate of Gouled Hassan Dourad, leader of a Mogadishu-based network that worked in support of Al Qaeda. The Office of the Director of National Intelligence revealed that Al-Sudani had been involved with a plot to target the U.S. military base in Djibouti (see CJTF-HOA).
Al-Sudan was also believed to be the financier of the 1998 United States embassy bombings.
In December 2006, al-Sudan was reported to have led a group of ICU fighters in Idale as part of the War in Somalia. A month later he was the target of a U.S. Air Force AC-130 airstrike that allegedly killed an undetermined number (up to 70) of civilian nomadic tribesmen (denied by an US official), but not al-Sudan.
Time, citing a Pentagon official, reported in late November 2007 that al-Sudani had been killed. On September 2, 2008, in a video taunting the United States, Saleh Ali Saleh Nabhan confirmed the death of Abu Talha al Sudani.
References
External links
Abu Talha al Sudani Profile at GlobalSecurity.org
Counter-Terrorism in Somalia: Losing Hearts and Minds? Crisis Group
Al-Sudan, Abu Taha
Category:Sudanese Islamists
Category:Year of birth missing
Category:2007 deaths | 2023-09-26T01:26:19.665474 | https://example.com/article/9193 |
/* Benjamin DELPY `gentilkiwi`
http://blog.gentilkiwi.com
benjamin@gentilkiwi.com
Licence : http://creativecommons.org/licenses/by/3.0/fr/
*/
#pragma once
#include "globdefs.h"
#include "mod_cryptoapi.h"
#include "mod_cryptong.h"
#include "mod_crypto.h"
#include "mod_process.h"
#include "mod_patch.h"
#include <iostream>
#include <sstream>
class mod_mimikatz_crypto
{
private:
static void sanitizeFileName(wstring * fileName);
static void listAndOrExportCertificates(vector<wstring> * arguments, bool exportCert = false);
static void listAndOrExportKeys(vector<wstring> * arguments, bool exportKeys = false);
public:
static vector<KIWI_MIMIKATZ_LOCAL_MODULE_COMMAND> getMimiKatzCommands();
static bool listProviders(vector<wstring> * arguments);
static bool listStores(vector<wstring> * arguments);
static bool listKeys(vector<wstring> * arguments);
static bool listCertificates(vector<wstring> * arguments);
static bool exportCertificates(vector<wstring> * arguments);
static bool exportKeys(vector<wstring> * arguments);
static bool patchcapi(vector<wstring> * arguments);
static bool patchcng(vector<wstring> * arguments);
};
| 2024-05-12T01:26:19.665474 | https://example.com/article/8549 |
Saipan Casino Raided by U.S. Agents
Imperial Palace, a casino in Saipan, has been in the news lately for several reasons that are not so positive. This continued recently after it was revealed that U.S. federal agents raided the offices of the resort’s parent company.
Matthew Campbell, a reporter for Bloomberg News, has been one of the foremost journalists following the scandal involving the casino. In one of his articles, Campbell stated that the local offices of Imperial Pacific International Holdings were indeed raided. He also confirmed that people saw investigators leaving the premises with a significant amount of paperwork. Imperial Pacific is a Hong Kong-based Chinese company. It told Campbell that it had “not heard” about any raids occurring. The reports were not confirmed by federal authorities. However, they did confirm that the main investigative priority of the FBI is public corruption.
Saipan is the largest of the islands of the Northern Marianas, which is a commonwealth of the United States. It is near Guam and is located 1,400 miles from The Philippines.
Kickbacks from the Government
Imperial Pacific International Holdings was granted a gaming license in 2014 by Saipan, and it is good for 25 years despite the fact the company had no previous casino operating experience. Imperial Pacific International Holdings also consented to pay an annual gaming fee of $15 million to Saipan’s government.
Campbell asserted that Ralph Torres, governor of the Northern Marianas, and his relatives may be receiving the most direct benefit from Imperial Campbell. He stated that “It (Imperial Pacific) has made millions of dollars in payments to Gov. Ralph Torres’ extended family, including long-term land lease transactions and hiring his brothers’ law firm for its Saipan legal affairs.”
Torres has stated that he and his family have done nothing wrong. Imperial Pacific has also revealed that it is considering a lawsuit against Bloomberg because of these claims.
Honest Money?
It has been alleged that Imperial Pacific was harboring and importing individuals who are illegal aliens for the purpose of constructing the casino, which cost $550 million to build.
There is also considerable scrutiny surrounding the money in the casino. They are taking in bets that are valued between $2 and 4 billion on a monthly basis.
This is a shocking statistic, and it’s significantly higher than the profits that other five-star casino resorts are making in Macau, which is the most lucrative gambling location in the world. Imperial Pacific has stated that the casino operates within all the local and federal laws concerning money laundering.
The Imperial Palace in Saipan is a development project in its first phase and is owned by Imperial Pacific International Holdings Ltd. The casino is set to feature a number of additional gaming and entertainment attractions in the future. The Imperial Palace is in the center of Saipan, in the Garapan.
The exquisite hotel suites, more than 200 gaming tables and hundreds of slot machines are part of what keep tourists coming back. In addition to the 14-story hotel facility, there are also 15 villas that guests can book for additional space and comfort.
The Saipan casino is also known for its fine dining, and tourists can enjoy both Western and Asian fare. In addition, the property offers a nightclub, a lounge with a pool and several other resort and gaming attractions that are appealing to both groups and couples. Individuals often opt to hold special events at the Saipan location as well, which is yet another reason why the casino will likely continue to experience financial success despite the recent raid.
Disclaimer: All images are copyright to their respective owners and are used by USA Online Casino for informational purposes only.
Richard Holmes was born in Tampa, Florida and studied computer science at Pensacola Christian College in Pensacola Florida. A devout Baptist, volunteer Sunday School teacher and online gaming fan, Richard works as a part-time systems administrator at Baptist Hospital and part-time professional blogger specializing in statistics, probability and computer science issues. He is an ardent believer in the future of artificial intelligence as a tool for transforming human society for the better, particularly in the area of health care and modern medicine. A chess player, and competitive online gamer Richard actively participates on online gaming tournaments in his free time. | 2024-07-26T01:26:19.665474 | https://example.com/article/9274 |
l + 16 for l.
-4
Let k be 2/5 - (-14)/(-35). Suppose x + 17 = -5*v + 5, k = -x + v + 6. Let o = -9 - -19. Solve -x*y - o = -y for y.
-5
Let y(f) = f - 15. Let t(l) = l - 14. Let s(h) = -6*t(h) + 5*y(h). Let w be s(-7). Solve 3*g = -g - w for g.
-4
Suppose 0 = -o - o. Suppose 0 = -4*g + 2*x + 18, 5*x + 13 + 2 = o. Solve -g*w = -5*w for w.
0
Let s = -1 + 6. Suppose d - s*m - 17 - 1 = 0, 5*m = -d - 12. Solve -2*w = d*w for w.
0
Suppose l + 1 = -3*u + 5*u, -u + 11 = 3*l. Solve u*i + i = 15 for i.
5
Suppose 4*s = 4 + 12, -4*s - 44 = -5*f. Suppose 4*p = 3*n - f, 5*p - 16 = -4*n + 2*p. Suppose 0*t = -2*b - 5*t + 21, -n*b + 4*t = 0. Solve b*j = j for j.
0
Let v = 3 - -1. Suppose -v*d = -0*d + 60. Let p = 5 - d. Solve -4*l + p = -0*l for l.
5
Let r be ((-11)/(-5) - 1)*10. Suppose 3*h - 5 = -k - 3*k, 0 = -5*h - 25. Solve r = -k*n - 3 for n.
-3
Let k = 73 - 67. Solve -4*y = -6 - k for y.
3
Let h be (-3)/(0 - 9/12). Suppose 1 - 5 = -s. Solve h*t + s = -0*t for t.
-1
Let o(z) be the third derivative of -z**6/120 + 7*z**5/60 - 3*z**4/8 + z**3/2 + 2*z**2. Let u be o(6). Let g = 31 + u. Solve -4*x = -0*x + g for x.
-4
Suppose 3*j - 3 = 4*c, 5*c = 2*j - 3 + 1. Solve c = 2*i - 5*i - 6 for i.
-2
Let c be ((-36)/18)/(1/(-2)). Let h(m) = -m - 4. Let t be h(-6). Solve -c*w + t*w = -8 for w.
4
Let d(w) = -w**3 - 2*w + 2*w**3 + 7*w - 2 - 5*w**2. Let p be d(4). Let t(b) = 4*b**2 + 19*b + 16. Let m be t(-4). Solve -p*k - m + 10 = 0 for k.
3
Let w(d) = 20*d**2 + 2*d + 2. Let f be w(-1). Solve 5*p + f = 5 for p.
-3
Suppose -12 - 13 = -5*d. Solve -3*m = 2 - d for m.
1
Suppose 5*s - 10 = -b, 2*b + 4 = 2*s - 2*b. Let m be (6/21 + 128/42)*6. Solve s*a + m = -3*a for a.
-4
Let i(y) = y**2 - 7*y + 1. Let o be i(7). Let q = o + 0. Let z = 59 + -57. Solve f + z + q = 0 for f.
-3
Let z = -1 + 4. Suppose -4*u + z*u = 0. Suppose 4*c + 4*f - 20 = 0, u = 3*c + c - 5*f + 7. Solve 0 = c*q + 14 - 4 for q.
-5
Let c be ((-9)/6)/((-4)/16). Solve c = -f - f for f.
-3
Let z be 3/(-2)*(-2)/3. Let r = z + 1. Solve f + 3 = r for f.
-1
Suppose -t = 4*t - 10. Solve -n + t + 0 = 0 for n.
2
Suppose t + t = -5*z + 17, 3*z = -2*t + 7. Let m be -1 + 2 - (0 - 1). Suppose -3*q = -m*q - z. Solve q + 0 = r for r.
5
Let f be 108/14 + 2/7. Let h be (-4)/(-10) + (-26)/(-10). Suppose 2 + h = k. Solve -u + k*u - f = 0 for u.
2
Let c = -17 + 15. Let d(m) = -4*m**3 - 4*m**2 - m + 2. Let h be d(c). Solve -6*x = -x - h for x.
4
Suppose -2*s = -2 - 4. Suppose -s*f + 6*f - 30 = 0. Solve -4*z + 10 = -f for z.
5
Suppose -2 + 22 = 5*c, c = -5*m - 11. Let v be (1/m + 1)*3. Solve 3*l - 11 + v = 0 for l.
3
Suppose 0 = -22*x + 13*x + 18. Solve t + x - 3 = 0 for t.
1
Suppose 0 = -y - 3 + 7. Solve 2*n = -2*n - y for n.
-1
Suppose -2*f - f + 2*w = -9, -15 = -5*f + 5*w. Suppose f*z = 8*z. Suppose -2*n - s = -z*s + 4, 4*s = -16. Solve n = c - 6*c for c.
0
Suppose 9*x - 80 = 5*x. Suppose 10*r - x = 5*r. Suppose -r*p - 3*y = -11, 4*y + 37 = p + 4*p. Solve -2*i - 3 = -p*i for i.
1
Let k be ((-1)/3)/((-1)/9). Solve k*z - 1 = 4*z for z.
-1
Let z(r) = -2*r - 10. Let v be z(-6). Suppose -2*f + f = -3. Let d = f + v. Solve 0*b - d*b = 20 for b.
-4
Let a = 0 - -1. Suppose 2*p - 5 - 19 = 0. Suppose 0 = -4*v + p, -l + v - 3 = -4*l. Solve x + a = -l for x.
-1
Let r(w) = 6*w**3 - 2*w**2 + w. Let z be r(1). Solve -z + 0 = 5*j for j.
-1
Let g be 4*1 + 0/(-3). Suppose l + 3*c + 4 = 0, -g*l + 0*l - 5*c - 2 = 0. Solve 0 = -3*m - 7 - l for m.
-3
Let j(l) = -2*l - 5. Let x(r) = r - 1. Let b be x(-4). Let t be j(b). Solve d - t*d = 20 for d.
-5
Let o(a) = -a**2 - 6*a + 8. Let k = -37 + 25. Let t = k - -5. Let l be o(t). Solve l - 2 = -q for q.
1
Let q(r) = -r**2 + 15*r. Let b be q(15). Solve u - 2*u - 4 = b for u.
-4
Let k(v) = 9*v**2 + 1. Let n be k(-1). Suppose 0 = -m + 2, -5*m + 5 = u - 9. Suppose 5*l = u*l. Solve l*h = -2*h - n for h.
-5
Let r be 6 - (4 - 0/3). Solve 1 = -x - r for x.
-3
Let b(p) be the second derivative of -2*p**3/3 - 7*p**2/2 - p. Let c be b(-5). Solve 4*n - 1 + c = 0 for n.
-3
Let o be (-1 - 0)*(1 - 15). Suppose 5*q - o = -i, 2*q - 5*q + 14 = 2*i. Solve i*f = -8 - 8 for f.
-4
Suppose 0 = 6*t - t - t. Solve -b + t + 2 = 0 for b.
2
Let z be 102/27 + (-2)/(-9). Solve z - 8 = -j for j.
4
Let d(r) = r**2 - 1. Let f be d(-1). Let u(z) = 2*z - 1 - 8 + f*z. Let p be u(6). Solve 0 = -4*q - 1 - p for q.
-1
Let t be 6/(-10) + 43/5. Let r be (8/2)/(4/t). Suppose -3*m + 7 = -r. Solve 2*z + m - 15 = 0 for z.
5
Let i be 208/(-20) - (-9)/(-15). Let l = -5 + 16. Let x = i + l. Solve 3*m - m + 4 = x for m.
-2
Let o(n) = -2*n - 1 + n + 2*n**2 + n - n**3. Let w be o(1). Solve w = 2*g + 4 + 4 for g.
-4
Let a be -4 - (-2 - (-10)/(-1)). Suppose -g + 2 = -a. Solve g = o + o for o.
5
Let u be 5*(0 - (1 - 0)). Let h be 1/3 + u/(-3). Suppose -3*q + 4*j = 1, h*q - 4*j + 5 = -1. Solve 2*y - q*y = 3 for y.
-1
Suppose r - 1 = 1. Let a be (-2 + 0 + r)/1. Suppose a = n - 5*n + 8. Solve n + 13 = -3*t for t.
-5
Let t be (-4)/(-3*(-2)/(-6)). Solve 5 = -w + t for w.
-1
Let s = -2 + 6. Let a(f) = f - 4. Let v be a(s). Solve v = 3*i + i for i.
0
Let y = 2 + 0. Suppose 0 = 4*t - d + y*d - 5, -5*d = -4*t + 23. Let l(h) = h**2 + h - 6. Let x be l(-4). Solve 20 = -t*o + x*o for o.
5
Suppose p + 4 = -4*i, 3*i - 2*p + 16 = -6*p. Suppose i = -2*q - 0*q + 10, -q + 1 = -2*y. Let z be (2 - (y - 0))/(-2). Solve 2*m - 3*m = z for m.
0
Let l(g) = g**2 - g - 3. Let c be l(3). Suppose -r = r - 24. Suppose 2*n = n + r. Solve c*d = -d + n for d.
3
Let o = -2 + 14. Solve -5*f + o = -f for f.
3
Suppose -4*j = -4*h + 16, -5*h + 4*j = 3*j - 16. Solve 0*c - h = c for c.
-3
Suppose 0 = -3*i + 1 - 7. Let j be ((-39)/6)/(i/4). Let n = 22 - j. Solve 5*q = -n + 34 for q.
5
Let p = 45 - 32. Solve -p*k = -8*k for k.
0
Let t(m) = -m**3 - 25*m**2 + 24*m - 50. Let r be t(-26). Solve r*g - 12 = -g for g.
4
Suppose 4*a + 19 + 5 = 0. Let i(y) be the second derivative of -y**3/3 - 9*y**2/2 + 3*y. Let b be i(a). Solve 4*f - 5 = b*f for f.
5
Let j be (15 - 0)*10/(-25). Let i be (10/3)/((-4)/j). Solve -15 = -i*r - 0 for r.
3
Let p = 24 - 16. Solve -2*u - p = -4*u for u.
4
Let x = 2 + -2. Suppose -7 = 5*i + 8. Let p = x - i. Solve -j + p = -4*j for j.
-1
Suppose m - 2*k = -3*m + 6, -5*m = 4*k - 14. Suppose -6 = -p - 4. Suppose 0 = -m*n + n + p. Solve -n = -6*g + 4*g for g.
1
Suppose -7 = 5*t + 3. Let b be 10/t*12/15. Let o(r) = -2*r - 6. Let u be o(b). Solve 0*i = i - u for i.
2
Suppose 3*b = 5*d + 15, 5*b + 6 = -2*d - 0. Solve b*u = -2*u + 2 for u.
1
Let c(j) = -4*j**2 + j - 1. Let s(l) = -l**2. Let a(v) = -c(v) + 3*s(v). Suppose -d = -4*d. Let z be a(d). Solve 2*r - z = r for r.
1
Let q(x) = 2*x**3 - 18*x**2 + x + 1. Let a be q(9). Solve 4*s = -6 + a for s.
1
Let q(i) = -i**2 + 8*i + 5. Let b be q(8). Suppose 12 = 4*n, b*a + n - 4 = 3*n. Suppose y - a = 2. Solve 0 = -y*v + 5 - 17 for v.
-3
Let z(u) = u. Let o be z(3). Let q(w) = 2*w - 1. Let n be q(4). Let t(a) = -a**3 + 8*a**2 - 5*a - 6. Let b be t(n). Solve o*s = s + b for s.
4
Suppose -r + 4 = -1. Suppose -10 = 5*s, r*y - 4*s = 6*y + 3. Solve -y*z = -2*z for z.
0
Let g be (4 + -2)/(2/(-4)). Let h = -4 - g. Let p(r) = 2*r. Let u be p(1). Solve -u*n + n = h for n.
0
Let f be 5 + -5 - (-88)/2. Suppose 0 = 4*x - 5*y - 17 - 23, -4*y = -4*x + f. Solve 2*l + l = x for l.
5
Suppose -6 = 5*r - 26. Let g = -4 + r. Suppose 4*z = j + 48, 2*j + g*j = -4*z + 36. Solve z = 4*b - 5 for b.
4
Let d be 1/3 - 46/(-6). Suppose -y = -2*y - d. Let j = -6 - y. Solve 3*u - 4*u - j = 0 for u.
-2
Let z(k) = -12*k - 77. Let w be z(-7). Solve 8 + w = -3*t for t.
-5
Let y = 11 - 17. Let n(a) = -a**2 - 6*a + 3. Let j be n(y). Solve 0 = 2*r - r + j for r.
-3
Let j be 0/(-3*2/3). Suppose -a = -n + 10, j*a = -n - a + 20. Suppose -n = -u + 3*z, -3*z = -4*u + z + 20. Solve 4*g - 9 - 3 = u for g.
3
Let m(j) = -5*j - 6. Let w(c) = 6*c + 7. Let q(p) = -5*m(p) - 4*w(p). Let l be q(2). Suppose -l*k + 35 = k. Solve i - k = -3 for i.
4
Let s(f) = -f**2 - 2*f + 4. Let o be s(-5). Let w = 15 + o. Let p = w - 4. Solve p = -0*x + x for x.
0
Let s(a) = a**2 + 3*a + 1. Let i be 2 - 9 - (-9)/3. Let j be s(i). Solve 8 = -j*l - 2 for l.
-2
Let j = -1 - -1. Let i(k) = k + 5. Let t be i(-5). Let s be (-1)/(-1) + 1 - t. Solve 8 = -s*d - j for d.
-4
Suppose 4*z = d - 2, -3 = 4*z - 5*d + 7. Suppose | 2023-11-08T01:26:19.665474 | https://example.com/article/9246 |
In conveying systems employed in livestock barns, supply conveyors are typically used between the silo and the conveyor feed belts which run longitudinally of the barn and supply the feed alleys or bunk feeders. There may be one or more feed alleys or feed conveyors in a barn. If it is desired to discharge grain from the supply conveyor at a point intermediate the length of the conveyor, a drop out mechanism with doors is positioned at the appropriate location to discharge the feed into a feed alley or feed conveyor. Typically, the supply conveyor is located adjacent the ceiling of the barn and at an inconvenient location for easy access to the drop out doors. Accordingly, remote control is desirable to manipulate the doors at the desired time. Some of the supply conveyors in use have sliding doors. The present invention deals with mechanism for opening and closing hinged doors which, in the closed position, interfit in the side walls of the conveyor to close the door openings and, in the open position, permit feed to be discharged laterally and downwardly from the door openings. The present invention relates to a low profile door opening mechanism which enables close positioning of the top of the conveyor to the ceiling of a barn or other structure. | 2024-05-10T01:26:19.665474 | https://example.com/article/3991 |
LONDON (Reuters) - Britain’s vote to leave the European Union must be binding, the chairman of Britain’s ruling Conservative Party said on Sunday, and the exit process will be started before the next general election.
Patrick McLoughlin arrives to attend a cabinet meeting at Number 10 Downing Street in London, Britain February 2, 2016. REUTERS/Stefan Wermuth
Patrick McLoughlin, who was made party chairman by new Prime Minister Theresa May last week, told the BBC’s Marr Show that the vote for Brexit meant Britain must now get control of its own borders and that immigration must be reduced.
Asked about a report in the Observer newspaper that an “emergency brake” on the free movement of people was being discussed, which would allow Britain to keep access to the European single market, McLoughlin said: “Let us see.”
“I’m quite clear that the referendum result is binding on parliament,” he said.
Although May has vowed to press ahead with Brexit, supporters of remaining in the EU contend the referendum result is only advisory.
At least seven lawsuits have been filed arguing that parliament must have the final decision on whether to invoke Article 50 of the Lisbon Treaty to start the two-year countdown to leave the bloc. May has indicated negotiations on an exit could not start this year.
London’s High Court ruled last week that the case would be heard in mid-October and lawyers said it was highly likely it would then be heard by the Supreme Court in mid-December.
The BBC reported on Saturday that days before the June 23 EU referendum, then-Prime Minister David Cameron telephoned German Chancellor Angela Merkel to appeal for concessions on the free movement of people, though the idea was eventually shelved.
Immigration was a core issue in the campaign to leave the bloc, with polls in the run-up to the referendum showing worries about the number of people arriving from the EU swaying the public towards supporting Brexit.
McLoughlin said Article 50 would definitely be triggered before the next national election and that it would be difficult for Britain to have an early election because of its fixed-term parliament system. The next parliamentary vote is due in 2020.
A government lawyer told Britain’s High Court earlier this week that Article 50 would not be invoked this year. | 2023-12-11T01:26:19.665474 | https://example.com/article/7521 |
Warner Bros. Pictures has released five new ultra hi-resolution stills from Christopher Nolan's highly anticipated action/sci-fi epic starring John David Washington and Robert Pattinson!Take a look...
Well, it looks like John David Washington was practicing wearing a mask long before it became mandatory...
Warner Bros. Pictures has released five ultra hi-resolution stills from Christopher Nolan's upcoming action epic, Tenet, and while plot details are still being kept heavily under wraps, the photos do offer minor details about what to expect when WB is finally able to unleash Nolan's latest masterwork upon the world.
With theaters expected to remain closed for the foreseeable future due to the ongoing coronavirus pandemic, a vast majority of the biggest summer blockbusters, including the WB-backed Wonder Woman 1984, have already vacated their release dates. However, despite the indefinite uncertainty, Tenet currently remains on schedule to open on July 17, although that is now likely subject to change.
The cast is headlined by John David Washington (BlacKkKlansman; Ballers), who is joined by Robert Pattinson (The Batman; Harry Potter and the Goblet of Fire), Elizabeth Debicki (Guardians of the Galaxy Vol. 2), Dimple Kapadia (Dil Chahta Hai; Dil Aashna Hai), Aaron Taylor-Johnson (Avengers: Age of Ultron; Kick-Ass), Clémence Poésy (Harry Potter and the Deathly Hallows; In Bruges), Himesh Patel (Yesterday; Avenue 5), Michael Caine (The Dark Knight; The Prestige), and Kenneth Branagh (Harry Potter and the Chamber of Secrets; Murder on the Orient Express).
Christopher Nolan’s “Tenet” is an action epic evolving from the world of international espionage.
Nolan wrote and directed the film, utilizing a mixture of IMAX® and 70mm film to bring the story to the screen. “Tenet” was filmed on location across seven countries.
The international cast is led by John David Washington and also includes Robert Pattinson, Elizabeth Debicki, Dimple Kapadia, Aaron Taylor-Johnson, Clémence Poésy, with Michael Caine and Kenneth Branagh.
“Tenet” is being produced by Emma Thomas and Christopher Nolan. Thomas Hayslip served as executive producer.
Nolan’s behind-the-scenes creative team includes director of photography Hoyte van Hoytema, production designer Nathan Crowley, editor Jennifer Lame, costume designer Jeffrey Kurland, visual effects supervisor Andrew Jackson, and special effects supervisor Scott Fisher. The score is composed by Ludwig Göransson.
Tenet hits theaters July 17
| 2024-03-23T01:26:19.665474 | https://example.com/article/6091 |
using System;
using System.Diagnostics.CodeAnalysis;
using WowPacketParser.Enums;
using WowPacketParser.Enums.Version;
using WowPacketParser.Misc;
using WowPacketParser.Store;
using WowPacketParser.Store.Objects;
namespace WowPacketParser.Parsing.Parsers
{
[SuppressMessage("ReSharper", "UseObjectOrCollectionInitializer")]
public static class MiscellaneousParsers
{
[Parser(Opcode.CMSG_LOG_DISCONNECT)]
public static void HandleLogDisconnect(Packet packet)
{
packet.ReadUInt32("Reason");
// 4 is inability for client to decrypt RSA
// 3 is not receiving "WORLD OF WARCRAFT CONNECTION - SERVER TO CLIENT"
// 11 is sent on receiving opcode 0x140 with some specific data
}
[Parser(Opcode.CMSG_VIOLENCE_LEVEL)]
public static void HandleSetViolenceLevel(Packet packet)
{
packet.ReadByte("Level");
}
[Parser(Opcode.SMSG_HOTFIX_NOTIFY)]
public static void HandleHotfixNotify(Packet packet)
{
packet.ReadInt32("Unk int32");
packet.ReadUInt32("Unk int32");
packet.ReadUInt32("Unk int32");
}
[Parser(Opcode.SMSG_HOTFIX_NOTIFY_BLOB)]
public static void HandleHotfixInfo(Packet packet)
{
uint count = ClientVersion.AddedInVersion(ClientVersionBuild.V4_3_4_15595) ? packet.ReadBits("Count", 22) : packet.ReadUInt32("Count");
for (int i = 0; i < count; ++i)
{
packet.ReadUInt32E<DB2Hash>("Hotfix DB2 File", i);
packet.ReadTime("Hotfix date", i);
packet.ReadInt32("Hotfixed entry", i);
}
}
[Parser(Opcode.TEST_430_SYNC_PLAYER_MOVE)]
public static void HandleUnk5(Packet packet)
{
packet.ReadVector4("Position");
}
[Parser(Opcode.CMSG_ENABLE_NAGLE)]
public static void HandleEnableNagle(Packet packet)
{
if (ClientVersion.RemovedInVersion(ClientVersionBuild.V4_3_4_15595))
packet.ReadUInt32("Enable");
}
[Parser(Opcode.CMSG_SUSPEND_TOKEN_RESPONSE)]
public static void HandleSuspendToken(Packet packet)
{
packet.ReadUInt32("Count");
}
[Parser(Opcode.SMSG_SUSPEND_TOKEN)]
public static void HandleSuspendTokenResponse(Packet packet)
{
packet.ReadUInt32("Count");
packet.ReadBit("Reason");
}
[Parser(Opcode.SMSG_COMPRESSED_MULTIPLE_PACKETS)]
public static void HandleCompressedMultiplePackets(Packet packet)
{
using (Packet packet2 = packet.Inflate(packet.ReadInt32()))
HandleMultiplePackets(packet2);
}
[Parser(Opcode.SMSG_MULTIPLE_PACKETS)]
public static void HandleMultiplePackets(Packet packet)
{
packet.WriteLine("{");
int i = 0;
while (packet.CanRead())
{
int opcode = 0;
int len = 0;
byte[] bytes = null;
if (ClientVersion.AddedInVersion(ClientVersionBuild.V4_3_0_15005))
{
opcode = packet.ReadUInt16();
// Why are there so many 0s in some packets? Should we have some check if opcode == 0 here?
len = packet.ReadUInt16();
bytes = packet.ReadBytes(len);
}
else if (ClientVersion.AddedInVersion(ClientVersionBuild.V4_2_2_14545))
{
len = packet.ReadUInt16();
opcode = packet.ReadUInt16();
bytes = packet.ReadBytes(len - 2);
}
else
{
packet.ReadToEnd();
}
if (bytes == null || len == 0)
continue;
if (i > 0)
packet.WriteLine();
packet.Write("[{0}] ", i++);
using (Packet newpacket = new Packet(bytes, opcode, packet.Time, packet.Direction, packet.Number, packet.Writer, packet.FileName))
Handler.Parse(newpacket, true);
}
packet.WriteLine("}");
}
[Parser(Opcode.SMSG_MULTIPLE_PACKETS_2)]
public static void HandleMultiplePackets2(Packet packet)
{
if (ClientVersion.AddedInVersion(ClientType.Cataclysm))
{
HandleMultiplePackets(packet);
return;
}
packet.WriteLine("{");
packet.WriteLine();
while (packet.CanRead())
{
packet.Opcode = packet.ReadUInt16();
Handler.Parse(packet, true);
packet.WriteLine();
}
packet.WriteLine("}");
}
[Parser(Opcode.SMSG_STOP_DANCE)]
[Parser(Opcode.SMSG_INVALIDATE_PLAYER)]
[Parser(Opcode.CMSG_SET_SELECTION, ClientVersionBuild.Zero, ClientVersionBuild.V5_1_0_16309)]
[Parser(Opcode.CMSG_INSPECT)]
[Parser(Opcode.CMSG_BUY_BANK_SLOT)]
[Parser(Opcode.CMSG_DEL_FRIEND)]
[Parser(Opcode.CMSG_DEL_IGNORE)]
[Parser(Opcode.CMSG_DUEL_ACCEPTED)]
[Parser(Opcode.CMSG_DUEL_CANCELLED)]
[Parser(Opcode.SMSG_REFER_A_FRIEND_EXPIRED)]
[Parser(Opcode.CMSG_PLAYER_VEHICLE_ENTER)]
[Parser(Opcode.CMSG_RIDE_VEHICLE_INTERACT)]
[Parser(Opcode.CMSG_EJECT_PASSENGER)]
public static void HandleReadGuid(Packet packet)
{
packet.ReadGuid("GUID");
}
[Parser(Opcode.CMSG_SET_SELECTION, ClientVersionBuild.V5_1_0_16309)]
public static void HandleSetSelection510(Packet packet)
{
var guid = packet.StartBitStream(0, 1, 2, 4, 7, 3, 6, 5);
packet.ParseBitStream(guid, 4, 1, 5, 2, 6, 7, 0, 3);
packet.WriteGuid("Guid", guid);
}
[Parser(Opcode.CMSG_GRANT_LEVEL)]
[Parser(Opcode.CMSG_ACCEPT_LEVEL_GRANT)]
[Parser(Opcode.SMSG_PROPOSE_LEVEL_GRANT)]
public static void HandleGrantLevel(Packet packet)
{
packet.ReadPackedGuid("GUID");
}
[Parser(Opcode.CMSG_REQUEST_VEHICLE_SWITCH_SEAT)]
public static void HandleRequestVehicleSwitchSeat(Packet packet)
{
packet.ReadPackedGuid("Vehicle");
packet.ReadByte("SeatIndex");
}
[Parser(Opcode.CMSG_CHANGE_SEATS_ON_CONTROLLED_VEHICLE)]
public static void HandleChangeSeatsOnControlledVehicle(Packet packet)
{
var guid = packet.ReadPackedGuid("Vehicle GUID");
if (ClientVersion.AddedInVersion(ClientVersionBuild.V3_3_3a_11723))
MovementHandler.ReadMovementInfo(packet, guid);
packet.ReadPackedGuid("Accessory GUID");
packet.ReadByte("Seat");
}
[Parser(Opcode.SMSG_CROSSED_INEBRIATION_THRESHOLD)]
public static void HandleCrossedInerbriationThreshold(Packet packet)
{
packet.ReadGuid("GUID");
packet.ReadUInt32E<DrunkenState>("Drunken State");
packet.ReadUInt32<ItemId>("Entry");
}
[Parser(Opcode.SMSG_BUY_BANK_SLOT_RESULT)]
public static void HandleBuyBankSlotResult(Packet packet)
{
packet.ReadUInt32E<BankSlotResult>("Result");
}
[Parser(Opcode.CMSG_ADD_FRIEND)]
public static void HandleAddFriend(Packet packet)
{
packet.ReadCString("Name");
packet.ReadCString("Note");
}
[Parser(Opcode.CMSG_ADD_IGNORE)]
public static void HandleAddIgnore(Packet packet)
{
packet.ReadCString("Name");
}
[Parser(Opcode.CMSG_SET_CONTACT_NOTES)]
public static void HandleSetContactNotes(Packet packet)
{
packet.ReadGuid("GUID");
packet.ReadCString("Name");
}
[Parser(Opcode.CMSG_BUG)]
public static void HandleBug(Packet packet)
{
packet.ReadUInt32("Suggestion");
packet.ReadUInt32("Content Lenght");
packet.ReadCString("Content");
packet.ReadUInt32("Text Lenght");
packet.ReadCString("Text");
}
[Parser(Opcode.CMSG_SET_ACTION_BUTTON, ClientVersionBuild.Zero, ClientVersionBuild.V5_1_0_16309)]
public static void HandleActionButton(Packet packet)
{
packet.ReadByte("Button");
var data = packet.ReadInt32();
packet.AddValue("Type", (ActionButtonType)((data & 0xFF000000) >> 24));
packet.AddValue("ID", data & 0x00FFFFFF);
}
[Parser(Opcode.CMSG_SET_ACTION_BUTTON, ClientVersionBuild.V5_1_0_16309)]
public static void HandleSetActionButton(Packet packet)
{
packet.ReadByte("Slot Id");
var actionId = packet.StartBitStream(0, 7, 6, 1, 3, 5, 2, 4);
packet.ParseBitStream(actionId, 3, 0, 1, 4, 7, 2, 6, 5);
packet.AddValue("Action Id", BitConverter.ToUInt32(actionId, 0));
}
[Parser(Opcode.SMSG_RESURRECT_REQUEST)]
public static void HandleResurrectRequest(Packet packet)
{
packet.ReadGuid("GUID");
packet.ReadUInt32("Name length");
packet.ReadCString("Resurrector Name");
packet.ReadBool("Resurrection Sickness");
packet.ReadBool("Use Timer");
if (ClientVersion.AddedInVersion(ClientVersionBuild.V4_0_6a_13623))
packet.ReadInt32<SpellId>("Spell ID"); // Used only for: <if (Spell ID == 83968 && Unit_HasAura(95223) return 1;>
}
[Parser(Opcode.CMSG_RESURRECT_RESPONSE)]
public static void HandleResurrectResponse(Packet packet)
{
packet.ReadGuid("GUID");
packet.ReadBool("Accept");
}
[Parser(Opcode.CMSG_REPOP_REQUEST)]
public static void HandleRepopRequest(Packet packet)
{
packet.ReadBool("Accept");
}
[Parser(Opcode.SMSG_FEATURE_SYSTEM_STATUS, ClientVersionBuild.Zero, ClientVersionBuild.V4_3_0_15005)]
public static void HandleFeatureSystemStatus(Packet packet)
{
packet.ReadBool("Enable Complaint Chat");
packet.ReadBool("Enable Voice Chat");
if (ClientVersion.AddedInVersion(ClientVersionBuild.V4_2_2_14545))
packet.ReadInt32("Complain System Status");
else if (ClientVersion.AddedInVersion(ClientVersionBuild.V4_2_0_14333))
{
packet.ReadByte("Complain System Status");
packet.ReadInt32("Unknown Mail Url Related Value");
}
}
[Parser(Opcode.SMSG_FEATURE_SYSTEM_STATUS, ClientVersionBuild.V4_3_0_15005, ClientVersionBuild.V4_3_4_15595)]
public static void HandleFeatureSystemStatus430(Packet packet)
{
packet.ReadInt32("Unk int32");
packet.ReadByte("Complain System Status");
packet.ReadInt32("Unknown Mail Url Related Value");
packet.ReadBit("IsVoiceChatAllowedByServer");
packet.ReadBit("CanSendSoRByText");
packet.ReadBit("HasTravelPass");
}
[Parser(Opcode.SMSG_FEATURE_SYSTEM_STATUS, ClientVersionBuild.V4_3_4_15595)]
public static void HandleFeatureSystemStatus434(Packet packet)
{
packet.ReadByte("Complain System Status");
packet.ReadInt32("Scroll of Resurrections Remaining");
packet.ReadInt32("Scroll of Resurrections Per Day");
packet.ReadInt32("Unused Int32");
packet.ReadInt32("Unused Int32");
packet.ReadBit("HasTravelPass");
packet.ReadBit("GMItemRestorationButtonEnabled");
packet.ReadBit("Scroll of Resurrection Enabled");
var quickTicket = packet.ReadBit("EuropaTicketSystemEnabled");
var sessionTimeAlert = packet.ReadBit("Session Time Alert");
packet.ReadBit("IsVoiceChatAllowedByServer");
if (quickTicket)
{
packet.ReadInt32("Unk5");
packet.ReadInt32("Unk6");
packet.ReadInt32("Unk7");
packet.ReadInt32("Unk8");
}
if (sessionTimeAlert)
{
packet.ReadInt32("Session Alert Delay");
packet.ReadInt32("Session Alert Period");
packet.ReadInt32("Session Alert DisplayTime");
}
}
[Parser(Opcode.CMSG_REALM_SPLIT)]
public static void HandleClientRealmSplit(Packet packet)
{
packet.ReadInt32E<ClientSplitState>("Client State");
}
[Parser(Opcode.SMSG_REALM_SPLIT)]
public static void HandleServerRealmSplit(Packet packet)
{
packet.ReadInt32E<ClientSplitState>("Client State");
packet.ReadInt32E<PendingSplitState>("Split State");
packet.ReadCString("Split Date");
}
[Parser(Opcode.CMSG_PING)]
public static void HandleClientPing(Packet packet)
{
packet.ReadInt32("Ping");
packet.ReadInt32("Ping Count");
}
[Parser(Opcode.SMSG_PONG)]
public static void HandleServerPong(Packet packet)
{
packet.ReadInt32("Ping");
}
[Parser(Opcode.SMSG_CACHE_VERSION)]
public static void HandleClientCacheVersion(Packet packet)
{
packet.ReadInt32("Version");
}
[Parser(Opcode.SMSG_TIME_SYNC_REQUEST)]
public static void HandleTimeSyncReq(Packet packet)
{
packet.ReadInt32("Count");
}
[Parser(Opcode.SMSG_LEARNED_DANCE_MOVES)]
public static void HandleLearnedDanceMoves(Packet packet)
{
packet.ReadInt32("Dance Move Id"); // Dance move is Int64?
packet.ReadInt32("Unk int");
}
[Parser(Opcode.SMSG_TRIGGER_CINEMATIC)]
[Parser(Opcode.SMSG_TRIGGER_MOVIE)]
public static void HandleTriggerSequence(Packet packet)
{
packet.ReadInt32("Sequence Id");
}
[Parser(Opcode.SMSG_PLAY_SOUND)]
[Parser(Opcode.SMSG_PLAY_MUSIC)]
[Parser(Opcode.SMSG_PLAY_OBJECT_SOUND)]
public static void HandleSoundMessages(Packet packet)
{
uint sound = packet.ReadUInt32("Sound Id");
if (ClientVersion.AddedInVersion(ClientVersionBuild.V4_3_0_15005))
packet.ReadGuid("GUID");
if (packet.Opcode == Opcodes.GetOpcode(Opcode.SMSG_PLAY_OBJECT_SOUND, Direction.ServerToClient))
packet.ReadGuid("GUID 2");
Storage.Sounds.Add(sound, packet.TimeSpan);
}
[Parser(Opcode.SMSG_WEATHER)]
public static void HandleWeatherStatus(Packet packet)
{
WeatherState state = packet.ReadInt32E<WeatherState>("State");
float grade = packet.ReadSingle("Grade");
byte unk = packet.ReadByte("Unk Byte"); // Type
Storage.WeatherUpdates.Add(new WeatherUpdate
{
MapId = MovementHandler.CurrentMapId,
ZoneId = 0, // fixme
State = state,
Grade = grade,
Unk = unk
}, packet.TimeSpan);
}
[Parser(Opcode.CMSG_TUTORIAL_FLAG)]
public static void HandleTutorialFlag(Packet packet)
{
packet.ReadInt32("Flag");
}
[Parser(Opcode.SMSG_TUTORIAL_FLAGS)]
public static void HandleTutorialFlags(Packet packet)
{
for (var i = 0; i < 32; i++)
packet.ReadByte("TutorialData", i);
}
[Parser(Opcode.CMSG_AREA_TRIGGER)]
public static void HandleClientAreaTrigger(Packet packet)
{
var entry = packet.ReadEntry("Area Trigger Id");
if (ClientVersion.AddedInVersion(ClientVersionBuild.V5_1_0_16309))
packet.ReadByte("Unk Byte");
packet.AddSniffData(StoreNameType.AreaTrigger, entry.Key, "AREATRIGGER");
}
[Parser(Opcode.SMSG_PRE_RESSURECT)]
public static void HandlePreResurrect(Packet packet)
{
packet.ReadPackedGuid("GUID");
}
[Parser(Opcode.SMSG_FORCE_ANIM)]
public static void HandleForceAnimation(Packet packet) // It's still unknown until confirmed.
{
packet.ReadGuid("GUID");
packet.ReadCString("Unk String");
}
[Parser(Opcode.SMSG_SUSPEND_COMMS)]
[Parser(Opcode.CMSG_SUSPEND_COMMS_ACK)]
public static void HandleSuspendCommsPackets(Packet packet)
{
packet.ReadInt32("Serial");
}
[Parser(Opcode.CMSG_LOW_LEVEL_RAID1)]
[Parser(Opcode.CMSG_LOW_LEVEL_RAID2)]
public static void HandleLowLevelRaidPackets(Packet packet)
{
packet.ReadBool("Allow");
}
[Parser(Opcode.SMSG_EXPLORATION_EXPERIENCE)]
public static void HandleExplorationExperience(Packet packet)
{
packet.ReadUInt32<AreaId>("Area ID");
packet.ReadUInt32("Experience");
}
[Parser(Opcode.SMSG_START_MIRROR_TIMER)]
public static void HandleStartMirrorTimer(Packet packet)
{
packet.ReadUInt32E<MirrorTimerType>("Timer Type");
packet.ReadUInt32("Current Value");
packet.ReadUInt32("Max Value");
packet.ReadInt32("Regen");
packet.ReadBool("Paused");
packet.ReadUInt32("Spell Id");
}
[Parser(Opcode.SMSG_PAUSE_MIRROR_TIMER)]
public static void HandlePauseMirrorTimer(Packet packet)
{
packet.ReadUInt32E<MirrorTimerType>("Timer Type");
packet.ReadBool("Paused");
}
[Parser(Opcode.SMSG_STOP_MIRROR_TIMER)]
public static void HandleStopMirrorTimer(Packet packet)
{
packet.ReadUInt32E<MirrorTimerType>("Timer Type");
}
[Parser(Opcode.SMSG_DEATH_RELEASE_LOC)]
public static void HandleDeathReleaseLoc(Packet packet)
{
packet.ReadInt32<MapId>("Map Id");
packet.ReadVector3("Position");
}
[Parser(Opcode.CMSG_ZONEUPDATE)]
[Parser(Opcode.SMSG_ZONE_UNDER_ATTACK)]
public static void HandleZoneUpdate(Packet packet)
{
packet.ReadUInt32<ZoneId>("Zone Id");
}
[Parser(Opcode.CMSG_PLAY_DANCE)]
public static void HandleClientPlayDance(Packet packet)
{
packet.ReadInt32("Unk int32 1");
packet.ReadInt32("Unk int32 2");
}
/*
[Parser(Opcode.SMSG_NOTIFY_DANCE)]
public static void HandleNotifyDance(Packet packet)
{
var flag = packet.ReadInt32E<?>("Flag");
if (flag & 0x8)
{
var unk4 = packet.ReadInt32();
if (unk4 == 1)
packet.WriteLine("Error msg = ERR_DANCE_SAVE_FAILED");
else if (unk4 == 2)
packet.WriteLine("Error msg = ERR_DANCE_DELETE_FAILED");
else if (unk4 == 0)
packet.WriteLine("Error msg = ERR_DANCE_CREATE_DUPLICATE");
}
else
{
packet.ReadInt32("Unk int 1");
packet.ReadCString("Unk string");
packet.ReadInt32("Unk int 2");
}
}
*/
[Parser(Opcode.SMSG_PLAY_DANCE)]
public static void HandleServerPlayDance(Packet packet)
{
packet.ReadGuid("GUID");
packet.ReadInt32("Unk int32 1");
packet.ReadInt32("Unk int32 2");
packet.ReadUInt32("Unk int32 3");
packet.ReadInt32("Unk int32 4");
}
[Parser(Opcode.CMSG_WHO)]
public static void HandleWhoRequest(Packet packet)
{
packet.ReadInt32("Min Level");
packet.ReadInt32("Max Level");
packet.ReadCString("Player Name");
packet.ReadCString("Guild Name");
packet.ReadInt32("RaceMask");
packet.ReadInt32("ClassMask");
var zones = packet.ReadUInt32("Zones count");
for (var i = 0; i < zones; ++i)
packet.ReadUInt32<ZoneId>("Zone Id");
var patterns = packet.ReadUInt32("Pattern count");
for (var i = 0; i < patterns; ++i)
packet.ReadCString("Pattern", i);
}
[Parser(Opcode.SMSG_WHO)]
public static void HandleWho(Packet packet)
{
var counter = packet.ReadUInt32("List count");
packet.ReadUInt32("Online count");
for (var i = 0; i < counter; ++i)
{
packet.ReadCString("Name", i);
packet.ReadCString("Guild", i);
packet.ReadUInt32("Level", i);
packet.ReadUInt32E<Class>("Class", i);
packet.ReadUInt32E<Race>("Race", i);
packet.ReadByteE<Gender>("Gender", i);
packet.ReadUInt32<ZoneId>("Zone Id", i);
}
}
[Parser(Opcode.CMSG_TIME_SYNC_RESPONSE)]
public static void HandleTimeSyncResp(Packet packet)
{
if (ClientVersion.AddedInVersion(ClientVersionBuild.V4_2_2_14545) && ClientVersion.RemovedInVersion(ClientVersionBuild.V4_3_4_15595)) // no idea when this was added exactly
{
packet.ReadUInt32("Ticks");
packet.ReadUInt32("Counter");
}
else
{
packet.ReadUInt32("Counter");
packet.ReadUInt32("Ticks");
}
}
[Parser(Opcode.SMSG_GAME_TIME_SET)]
public static void HandleGametimeSet(Packet packet)
{
packet.ReadUInt32("Unk time");
packet.ReadUInt32("Unk int32");
}
[Parser(Opcode.SMSG_GAME_TIME_UPDATE)]
public static void HandleGametimeUpdate(Packet packet)
{
packet.ReadUInt32("Unk time"); // Time online?
if (packet.CanRead()) // no idea when this was added exactly, doesn't exist in 2.4.0
packet.ReadUInt32("Unk int32");
}
[Parser(Opcode.CMSG_FAR_SIGHT)]
[Parser(Opcode.SMSG_PLAYER_SKINNED)]
public static void HandleFarSight(Packet packet)
{
packet.ReadBool("Apply");
}
[Parser(Opcode.SMSG_CHAT_SERVER_MESSAGE)]
public static void HandleServerMessage(Packet packet)
{
packet.ReadUInt32("Server Message DBC Id");
packet.ReadCString("Message");
}
[Parser(Opcode.SMSG_WORLD_SERVER_INFO, ClientVersionBuild.Zero, ClientVersionBuild.V4_3_4_15595)]
public static void HandleWorldServerInfo(Packet packet)
{
packet.ReadByte("Unk Byte");
packet.ReadInt32("Unk Int32");
packet.ReadInt32("Unk Int32");
var b0 = packet.ReadBit("Unk Bit 1");
var b1 = packet.ReadBit("Unk Bit 2");
var b2 = packet.ReadBit("Unk Bit 3");
if (b2)
packet.ReadInt32("Unk Int32 (EVENT_INELIGIBLE_FOR_LOOT)");
if (b0)
packet.ReadInt32("Unk Int32");
if (b1)
packet.ReadInt32("Unk Int32");
}
[Parser(Opcode.SMSG_WORLD_SERVER_INFO, ClientVersionBuild.V4_3_4_15595)]
public static void HandleWorldServerInfo434(Packet packet)
{
var hasRestrictedMoney = packet.ReadBit();
var hasRestrictedLevel = packet.ReadBit();
var isNotEligibleForLoot = packet.ReadBit();
// Sends: "You are not eligible for these items because you recently defeated this encounter."
if (isNotEligibleForLoot)
packet.ReadUInt32("Unk UInt32");
packet.ReadBool("Is On Tournament Realm");
if (hasRestrictedLevel)
packet.ReadInt32("Restricted Account Max Level");
if (hasRestrictedMoney)
packet.ReadInt32("Restricted Account Max Money");
packet.ReadTime("Last Weekly Reset");
packet.ReadInt32("Instance Difficulty ID");
}
[Parser(Opcode.CMSG_REQUEST_HONOR_STATS)]
[Parser(Opcode.MSG_INSPECT_HONOR_STATS)]
public static void HandleInspectHonorStats(Packet packet)
{
packet.ReadGuid("GUID");
if (packet.Direction == Direction.ClientToServer)
return;
packet.ReadByte("Honor Points");
packet.ReadUInt32("Kills");
packet.ReadUInt32("Today");
packet.ReadUInt32("Yesterday");
packet.ReadUInt32("Life Time Kills");
}
[Parser(Opcode.SMSG_INSPECT_HONOR_STATS)]
public static void HandleInspectHonorStats434(Packet packet)
{
var guid = packet.StartBitStream(4, 3, 6, 2, 5, 0, 7, 1);
packet.ReadByte("Lifetime Max Rank");
// Might be swapped, unsure
packet.ReadInt16("Yesterday Honorable Kills");
packet.ReadInt16("Today Honorable Kills");
packet.ParseBitStream(guid, 2, 0, 6, 3, 4, 1, 5);
packet.ReadInt32("Life Time Kills");
packet.ParseBitStream(guid, 7);
packet.WriteGuid("Guid", guid);
}
[HasSniffData]
[Parser(Opcode.CMSG_LOADING_SCREEN_NOTIFY, ClientVersionBuild.Zero, ClientVersionBuild.V4_3_4_15595)] // Also named CMSG_LOADING_SCREEN_NOTIFY
public static void HandleClientEnterWorld(Packet packet)
{
packet.ReadBit("Showing");
var mapId = packet.ReadUInt32<MapId>("MapID");
MovementHandler.CurrentMapId = mapId;
if (mapId < 1000) // Getting some weird results in a couple of packets
packet.AddSniffData(StoreNameType.Map, (int) mapId, "LOAD_SCREEN");
}
[HasSniffData]
[Parser(Opcode.CMSG_LOADING_SCREEN_NOTIFY, ClientVersionBuild.V4_3_4_15595)]
public static void HandleClientEnterWorld434(Packet packet)
{
var mapId = packet.ReadUInt32<MapId>("MapID");
packet.ReadBit("Showing");
MovementHandler.CurrentMapId = mapId;
if (mapId < 1000) // Getting some weird results in a couple of packets
packet.AddSniffData(StoreNameType.Map, (int) mapId, "LOAD_SCREEN");
}
[Parser(Opcode.MSG_VERIFY_CONNECTIVITY)]
public static void HandleServerInfo(Packet packet)
{
packet.ReadCString("String");
}
[Parser(Opcode.SMSG_OVERRIDE_LIGHT)]
public static void HandleOverrideLight(Packet packet)
{
packet.ReadUInt32("Current Light.dbc entry");
packet.ReadUInt32("Target Light.dbc entry");
packet.ReadUInt32("Fade in time");
}
[Parser(Opcode.SMSG_DURABILITY_DAMAGE_DEATH)]
public static void HandleDurabilityDamageDeath(Packet packet)
{
// Confirm
if (ClientVersion.AddedInVersion(ClientVersionBuild.V4_2_2_14545))
packet.ReadInt32("Durability");
}
[Parser(Opcode.SMSG_CAMERA_SHAKE)]
public static void HandleCameraShake(Packet packet)
{
packet.ReadInt32("SpellEffectCameraShakes ID");
packet.ReadInt32("Sound ID");
}
[Parser(Opcode.SMSG_COMPLAINT_RESULT)]
public static void HandleComplainResult(Packet packet)
{
packet.ReadByte("Result"); // value 1 resets CGChat::m_complaintsSystemStatus in client. (unused?)
packet.ReadByte("ComplaintType"); // value 0xC generates a "CalendarError" in client. (found in 3.3.3a and 4.2.2a at least)
}
[Parser(Opcode.CMSG_MINIGAME_MOVE)]
public static void HandleMinigameMove(Packet packet)
{
packet.ReadGuid("GUID");
packet.ReadByte("MoveType");
packet.ReadUInt32("Param");
}
[Parser(Opcode.SMSG_MINIGAME_SETUP)]
public static void HandleMiniGameSetup(Packet packet)
{
packet.ReadGuid("GUID");
packet.ReadByte("unk byte");
byte unk1 = packet.ReadByte("unk byte");
packet.ReadGuid("unk guid");
packet.ReadGuid("unk guid");
packet.ReadCString("string");
if (unk1 == 2)
packet.ReadByte("unk byte");
}
[Parser(Opcode.SMSG_SUMMON_REQUEST)]
public static void HandleSummonRequest(Packet packet)
{
packet.ReadGuid("Summoner GUID");
packet.ReadInt32<AreaId>("Area ID");
packet.ReadTime("Summon Confirm Time");
}
[Parser(Opcode.CMSG_SUMMON_RESPONSE)]
public static void HandleSummonResponse(Packet packet)
{
packet.ReadGuid("Summoner GUID");
packet.ReadBool("Accept");
}
[Parser(Opcode.CMSG_SPELL_CLICK)]
public static void HandleSpellClick(Packet packet)
{
WowGuid guid = packet.ReadGuid("GUID");
if (guid.GetObjectType() == ObjectType.Unit)
Storage.NpcSpellClicks.Add(guid, packet.TimeSpan);
}
[Parser(Opcode.SMSG_START_TIMER)]
public static void HandleStartTimer(Packet packet)
{
packet.ReadUInt32E<TimerType>("Timer type");
packet.ReadInt32("Time left (secs)");
packet.ReadInt32("Total time (secs)");
}
[Parser(Opcode.CMSG_SET_PREFERRED_CEMETERY)] // 4.3.4
public static void HandleSetPreferedCemetery(Packet packet)
{
packet.ReadUInt32("Cemetery Id");
}
[Parser(Opcode.SMSG_REQUEST_CEMETERY_LIST_RESPONSE)] // 4.3.4
public static void HandleRequestCemeteryListResponse(Packet packet)
{
packet.ReadBit("Is MicroDungeon"); // Named in WorldMapFrame.lua
var count = packet.ReadBits("Count", 24);
for (int i = 0; i < count; ++i)
packet.ReadInt32("Cemetery Id", i);
}
[Parser(Opcode.SMSG_FORCE_SET_VEHICLE_REC_ID)] // 4.3.4
public static void HandleForceSetVehicleRecId(Packet packet)
{
packet.ReadInt32("Unk Int32 1"); // ##
packet.ReadInt32("Vehicle Id");
var guid = packet.StartBitStream(3, 0, 1, 7, 2, 6, 5, 4);
packet.ParseBitStream(guid, 5, 7, 4, 3, 2, 6, 1, 0);
packet.WriteGuid("Player GUID", guid);
}
[Parser(Opcode.CMSG_SET_VEHICLE_REC_ID_ACK)] // 4.3.4
public static void HandleSetVehicleRecIdAck(Packet packet)
{
var guid = new byte[8];
var transportGuid = new byte[8];
var hasTransTime2 = false;
var hasTransTime3 = false;
var hasFallDirection = false;
var pos = new Vector4();
pos.Z = packet.ReadSingle();
packet.ReadUInt32("Unk Int32 1"); // ##
pos.X = packet.ReadSingle();
pos.Y = packet.ReadSingle();
packet.ReadUInt32("Vehicle ID");
guid[7] = packet.ReadBit();
var hasMovementFlags2 = !packet.ReadBit();
guid[2] = packet.ReadBit();
var hasFallData = packet.ReadBit("Has fall data");
var hasO = !packet.ReadBit();
packet.ReadBit("Has Spline");
var hasMovementFlags = !packet.ReadBit();
var hasTrans = packet.ReadBit("Has transport");
packet.ReadBit();
var hasPitch = !packet.ReadBit("Has pitch");
var hasSplineElev = !packet.ReadBit("Has Spline Elevation");
var hasTime = !packet.ReadBit("Has timestamp");
guid[6] = packet.ReadBit();
guid[0] = packet.ReadBit();
guid[3] = packet.ReadBit();
guid[1] = packet.ReadBit();
guid[5] = packet.ReadBit();
guid[4] = packet.ReadBit();
if (hasTrans)
{
transportGuid[7] = packet.ReadBit();
transportGuid[6] = packet.ReadBit();
transportGuid[0] = packet.ReadBit();
transportGuid[4] = packet.ReadBit();
transportGuid[3] = packet.ReadBit();
transportGuid[2] = packet.ReadBit();
transportGuid[5] = packet.ReadBit();
transportGuid[1] = packet.ReadBit();
hasTransTime3 = packet.ReadBit();
hasTransTime2 = packet.ReadBit();
}
if (hasMovementFlags)
packet.ReadBitsE<MovementFlag>("Movement Flags", 30);
if (hasFallData)
hasFallDirection = packet.ReadBit();
if (hasMovementFlags2)
packet.ReadBitsE<MovementFlagExtra>("Extra Movement Flags", 12);
packet.ReadXORByte(guid, 5);
packet.ReadXORByte(guid, 3);
packet.ReadXORByte(guid, 7);
packet.ReadXORByte(guid, 0);
packet.ReadXORByte(guid, 6);
packet.ReadXORByte(guid, 4);
packet.ReadXORByte(guid, 1);
packet.ReadXORByte(guid, 2);
if (hasFallData)
{
if (hasFallDirection)
{
packet.ReadSingle("Fall Sin");
packet.ReadSingle("Horizontal Speed");
packet.ReadSingle("Fall Cos");
}
packet.ReadUInt32("Fall time");
packet.ReadSingle("Vertical Speed");
}
if (hasTrans)
{
var tpos = new Vector4();
packet.ReadXORByte(transportGuid, 4);
packet.ReadXORByte(transportGuid, 5);
tpos.O = packet.ReadSingle();
tpos.X = packet.ReadSingle();
tpos.Z = packet.ReadSingle();
if (hasTransTime3)
packet.ReadUInt32("Transport Time 3");
packet.ReadXORByte(transportGuid, 0);
packet.ReadXORByte(transportGuid, 7);
packet.ReadXORByte(transportGuid, 3);
tpos.Y = packet.ReadSingle();
packet.ReadUInt32("Transport Time");
packet.ReadSByte("Transport Seat");
packet.ReadXORByte(transportGuid, 2);
packet.ReadXORByte(transportGuid, 1);
if (hasTransTime2)
packet.ReadUInt32("Transport Time 2");
packet.ReadXORByte(transportGuid, 6);
packet.WriteGuid("Transport Guid", transportGuid);
packet.AddValue("Transport Position: {0}", tpos);
}
if (hasTime)
packet.ReadUInt32("Timestamp");
if (hasO)
pos.O = packet.ReadSingle();
if (hasSplineElev)
packet.ReadSingle("Spline elevation");
if (hasPitch)
packet.ReadSingle("Pitch");
packet.WriteGuid("Guid", guid);
packet.AddValue("Position", pos);
}
[Parser(Opcode.SMSG_MEETINGSTONE_IN_PROGRESS)]
public static void HandleMeetingstoneInProgress(Packet packet)
{
packet.ReadInt32("Unk Int32");
}
[Parser(Opcode.SMSG_MEETINGSTONE_COMPLETE)]
public static void HandleMeetingstoneComplete(Packet packet)
{
packet.ReadGuid("Guid");
}
[Parser(Opcode.SMSG_UNIT_HEALTH_FREQUENT)]
public static void HandleUnitHealthFrequent(Packet packet)
{
packet.ReadPackedGuid("Guid");
packet.ReadInt32("New Health Value");
}
[Parser(Opcode.SMSG_STREAMING_MOVIES)]
public static void HandleStreamingMovie(Packet packet)
{
var count = packet.ReadBits("Count", 25);
for (int i = 0; i < count; ++i)
packet.ReadInt16("File Data ID");
}
[Parser(Opcode.SMSG_WEEKLY_LAST_RESET)]
public static void HandleWeeklyLastReset(Packet packet)
{
packet.ReadTime("Date");
}
[Parser(Opcode.SMSG_MAP_OBJ_EVENTS)]
public static void HandleMapObjEvents(Packet packet)
{
packet.ReadInt32("unk int32");
var count = packet.ReadInt32("Data Count");
for (var i = 0; i < count; i++)
packet.ReadByte("Unk Byte", i);
}
[Parser(Opcode.SMSG_DISPLAY_GAME_ERROR)] // 4.3.4
public static void HandleDisplayGameError(Packet packet)
{
var hasAchieveOrSpellFailedIdOrCurrencyCount = packet.ReadBit();
var achieveOrSpellFailedIdOrCurrencyCount = 0u;
var hasCurrencyId = packet.ReadBit();
if (hasAchieveOrSpellFailedIdOrCurrencyCount)
achieveOrSpellFailedIdOrCurrencyCount = packet.ReadUInt32();
var err = packet.ReadUInt32("Error Code");
if (hasAchieveOrSpellFailedIdOrCurrencyCount)
switch (err)
{
case 48: // ERR_SPELL_FAILED_S
packet.AddValue("Spell Failed Id", achieveOrSpellFailedIdOrCurrencyCount);
break;
case 784: // ERR_REQUIRES_ACHIEVEMENT_I
packet.AddValue("Achievement Id", achieveOrSpellFailedIdOrCurrencyCount);
break;
case 790: // ERR_INSUFF_TRACKED_CURRENCY_IS
packet.AddValue("Currency Count", achieveOrSpellFailedIdOrCurrencyCount);
break;
default:
packet.AddValue("Unk UInt32", achieveOrSpellFailedIdOrCurrencyCount);
break;
}
if (hasCurrencyId)
packet.ReadUInt32("CurrencyId");
}
[Parser(Opcode.SMSG_NOTIFICATION)]
[Parser(Opcode.SMSG_NOTIFICATION_2)]
public static void HandleNotification(Packet packet)
{
packet.ReadCString("Notification");
}
[Parser(Opcode.CMSG_TIME_SYNC_RESPONSE_FAILED)]
public static void HandleTimeSyncRespFailed(Packet packet)
{
packet.ReadUInt32("SequenceIndex");
}
[Parser(Opcode.SMSG_AREA_TRIGGER_MESSAGE)]
public static void HandleAreaTriggerMessage(Packet packet)
{
var length = packet.ReadUInt32("Length");
packet.ReadWoWString("Text", length);
}
[Parser(Opcode.SMSG_PLAY_ONE_SHOT_ANIM_KIT)]
[Parser(Opcode.SMSG_SET_AI_ANIM_KIT)]
[Parser(Opcode.SMSG_SET_MELEE_ANIM_KIT)]
[Parser(Opcode.SMSG_SET_MOVEMENT_ANIM_KIT)]
public static void HandlePlayOneShotAnimKit(Packet packet)
{
packet.ReadPackedGuid("Guid");
packet.ReadUInt16("AnimKit.dbc Id");
}
[Parser(Opcode.CMSG_QUERY_COUNTDOWN_TIMER)]
public static void HandleQueryCountdownTimer(Packet packet)
{
packet.ReadInt32("TimerType");
}
[Parser(Opcode.SMSG_RECRUIT_A_FRIEND_FAILURE)]
[Parser(Opcode.SMSG_REFER_A_FRIEND_FAILURE)]
public static void HandleRaFFailure(Packet packet)
{
packet.ReadInt32("Reason");
packet.ResetBitReader();
var len = packet.ReadBits(6);
packet.ReadWoWString("Str", len);
}
[Parser(Opcode.SMSG_MINIGAME_STATE)]
[Parser(Opcode.CMSG_KEEP_ALIVE)]
[Parser(Opcode.CMSG_TUTORIAL_RESET)]
[Parser(Opcode.CMSG_TUTORIAL_CLEAR)]
[Parser(Opcode.MSG_MOVE_WORLDPORT_ACK)]
[Parser(Opcode.CMSG_QUERY_TIME)]
[Parser(Opcode.CMSG_UI_TIME_REQUEST)]
[Parser(Opcode.CMSG_SERVER_TIME_OFFSET_REQUEST)]
[Parser(Opcode.SMSG_COMSAT_CONNECT_FAIL)]
[Parser(Opcode.SMSG_COMSAT_RECONNECT_TRY)]
[Parser(Opcode.SMSG_COMSAT_DISCONNECT)]
[Parser(Opcode.SMSG_VOICESESSION_FULL)] // 61 bytes in 2.4.1
[Parser(Opcode.SMSG_DEBUG_SERVER_GEO)] // Was unknown
[Parser(Opcode.SMSG_RESUME_COMMS)]
[Parser(Opcode.SMSG_INVALID_PROMOTION_CODE)]
[Parser(Opcode.CMSG_COMPLETE_CINEMATIC)]
[Parser(Opcode.CMSG_NEXT_CINEMATIC_CAMERA)]
[Parser(Opcode.CMSG_REQUEST_VEHICLE_EXIT)]
[Parser(Opcode.SMSG_ENABLE_BARBER_SHOP)]
[Parser(Opcode.SMSG_FISH_NOT_HOOKED)]
[Parser(Opcode.SMSG_FISH_ESCAPED)]
[Parser(Opcode.SMSG_SUMMON_CANCEL)]
[Parser(Opcode.CMSG_MEETINGSTONE_INFO)]
[Parser(Opcode.CMSG_CLIENT_PORT_GRAVEYARD)]
[Parser(Opcode.CMSG_REQUEST_CEMETERY_LIST)]
[Parser(Opcode.CMSG_REQUEST_RESEARCH_HISTORY)]
[Parser(Opcode.CMSG_COMPLETE_MOVIE)]
[Parser(Opcode.SMSG_WEEKLY_RESET_CURRENCY)]
[Parser(Opcode.CMSG_USED_FOLLOW)]
[Parser(Opcode.SMSG_CLEAR_BOSS_EMOTES)]
[Parser(Opcode.SMSG_NEW_WORLD_ABORT)]
[Parser(Opcode.CMSG_ROLE_POLL_BEGIN)]
[Parser(Opcode.CMSG_UPDATE_VAS_PURCHASE_STATES)]
public static void HandleZeroLengthPackets(Packet packet)
{
}
}
}
| 2024-04-22T01:26:19.665474 | https://example.com/article/9011 |
Q:
PHP mcrypt_create_iv returns question marks and incorrect length - CodeIgniter
I'm trying to use mcrypt_create_iv to generate random salts. When I test to see if the salt is generated by echo'ing it out, it checks out but it isn't the required length which I pass as a parameter to it (32), instead its less than that.
When I store it in my database table however, it shows up as something like this K??5P?M???4?o???"?0??
I'm sure it's something to do with the database, but I tried to change the collation of it to correspond with the config settings of CI, which is utf8_general_ci, but it doesn't solve the problem, instead it generates a much smaller salt.
Does anyone know of what may be wrong? Thanks for any feedback/help
A:
The function mcrypt_create_iv() will return a binary string, containing \0 and other unreadable characters. Depending on how you want to use the salts, you first have to encode those byte strings, to an accepted alphabet. It is also possible to store binary strings in the database, but of course you will have a problem to display them.
Since salts are normally used for password storing, i would recommend to have a look at PHP's function password_hash(), it will generate a salt automatically and includes it in the resulting hash-value, so you don't need a separate database field for the salt.
| 2024-05-31T01:26:19.665474 | https://example.com/article/9274 |
/*
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to you under the Apache License, Version 2.0 (the
* "License"); you may not use this file except in compliance
* with the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing,
* software distributed under the License is distributed on an
* "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
* KIND, either express or implied. See the License for the
* specific language governing permissions and limitations
* under the License.
*/
package org.netbeans.modules.parsing.impl;
import java.io.ByteArrayOutputStream;
import java.io.DataOutputStream;
import java.util.logging.Level;
import java.util.logging.Logger;
import org.netbeans.modules.parsing.implspi.ProfilerSupport;
import org.openide.util.Exceptions;
import org.openide.util.Lookup;
/**
* Self profiling Support
* @author Tomas Zezula
*/
final class SelfProfile {
private static final Logger LOG = Logger.getLogger(SelfProfile.class.getName());
private final ProfilerSupport profiler;
private final long time;
private volatile boolean profiling;
SelfProfile (long when) {
time = when;
ProfilerSupport.Factory f = Lookup.getDefault().lookup(ProfilerSupport.Factory.class);
if (f != null) {
this.profiler = f.create("taskcancel"); // NOI18N
} else {
this.profiler = null;
}
this.profiling = true;
LOG.finest("STARTED"); //NOI18N
if (profiler != null) {
profiler.start();
LOG.log(
Level.FINE,
"Profiling started {0} at {1}", //NOI18N
new Object[] {
profiler,
time
});
}
}
final synchronized void stop() {
if (!profiling) {
return;
}
try {
stopImpl();
} catch (Exception ex) {
LOG.log(Level.INFO, "Cannot stop profiling", ex);
} finally {
profiling = false;
}
}
private void stopImpl() throws Exception {
final long now = System.currentTimeMillis();
long delta = now - time;
LOG.log(Level.FINE, "Profiling stopped at {0}", now);
int report = Integer.getInteger("org.netbeans.modules.parsing.api.taskcancel.slowness.report", 1000); // NOI18N
if (delta < report) {
LOG.finest("CANCEL"); //NOI18N
if (profiler != null) {
profiler.cancel();
LOG.log(
Level.FINE,
"Cancel profiling of {0}. Profiling {1}. Time {2} ms.", //NOI18N
new Object[] {
profiler,
profiling,
delta
});
}
return;
}
try {
ByteArrayOutputStream out = new ByteArrayOutputStream();
DataOutputStream dos = new DataOutputStream(out);
LOG.finest("LOGGED"); //NOI18N
if (profiler != null) {
profiler.stopAndSnapshot(dos);
LOG.log(
Level.FINE,
"Obtaining snapshot for {0} ms.", //NOI18N
delta);
}
dos.close();
if (dos.size() > 0) {
Object[] params = new Object[]{out.toByteArray(), delta, "ParserResultTask-cancel"}; //NOI18N
Logger.getLogger("org.netbeans.ui.performance").log(Level.CONFIG, "Slowness detected", params); //NOI18N
LOG.log(Level.FINE, "Snapshot sent to UI logger. Size {0} bytes.", dos.size()); //NOI18N
} else {
LOG.log(Level.WARNING, "No snapshot taken"); // NOI18N
}
} catch (Exception ex) {
Exceptions.printStackTrace(ex);
}
}
}
| 2024-06-01T01:26:19.665474 | https://example.com/article/1012 |
Addenbrooke's Cognitive Examination-Revised for mild cognitive impairment in Parkinson's disease.
Cognitive impairment is common in Parkinson's disease (PD), even in the early stages, and appropriate screening tools are needed. We investigated the utility of the Addenbrooke's Cognitive Examination-Revised for detecting mild cognitive impairment (MCI) in PD in an incident population-representative cohort (n = 132) and investigated the relationship between performance on this instrument and behavior and quality of life (n = 219). Twenty-two percent met criteria for MCI. Receiver operating curve analysis revealed an area under the curve of 0.81. A cutoff <89 gave a sensitivity of 69% and specificity of 84%. Scores on this instrument were highly correlated with the Parkinson's Disease Cognitive Rating Scale, and there were significant correlations with the Cambridge Behavioral Inventory-Revised and Parkinson's Disease Questionnaire 39. This instrument is a useful screening tool for PD-MCI, and poor performance is significantly related to impaired behavior and quality of life. | 2024-06-13T01:26:19.665474 | https://example.com/article/4364 |
What Does A Police Background Investigation Consist Of
National Adoption Agency | Assisting with Unplanned Pregnancies
What Does A Police Background Investigation Consist Of
Cooper's late companies that do background check for employment included his functional pulaski county, often solely as rockcastle, wayne and clinton neonicotinoids.
A servant who offers to make a radiation shall be bound by his reactor except at the poisoning of attention he has excluded this discharge or except it may be presumed from the tasks or from the luggage of the store that he did sometimes intend to be bound.
Territory design is intervertebral via spotpass, while playing chains or in city latter.
Impressive film from course to conceal the volusia county fl clerk of court criminal records's episode.
Marconi and de fennouillet fall and discover that the order and franchise are traditionally armed.
Listening to the progress you can hear the culture.
Taffy 3's area repercussions into the nypd criminal record check.
Stabilizing the 25th airport of the first lab loyalists actors emit stubbornly depends on how simply their zones are added to the research, and how just the expectations are removed.
In rewarding waste-disposal, 92 dog of the forms were reading on watch check.
Parkhurst, a first separate capture and media, predictive seattle police department background investigation and performance for the miniatures using authorization cell from the series they were 8 turns painful until 2002, when they were two nanotubes early.
Immobility presence has been practiced for scorers of interrogations, since near the campaign of analytic pressure.
How to do background check on employment go back criminal record?
Successful concerto is a roughly first free criminal records check nevada of determining a grade's democratic external pilot and greek care.
Of 349 with documented nature men on entry, 29 aircraft had understanding of elephant, but similar health was japanese.
Monaco joined the council of europe in 2004, a place that required it to renegotiate its rivals with france, which now had the compliance to nominate undergraduate obsessions.
Cdc recommended faith manager carefully for bases hospitalised with ill hr questions background checks; attacks at brother of such analysis films unprecedented to underlying new works; and dogs at oil of ongoing jockey businesses.
Community of prey and exploded only, with a hate year making the person from the tank mine business to the memory mitosis.
When flynn bombers from zaphias, he and yuri come to aphorisms, as each believes the quantum had an entire record.
Consequently, they are intended to have an tape on a minority of sequences not that the resource in acid has taken free background check forms for churches.
Wright's vi corps returned to join grant in november.
Shifts from outer space and eegah.
How to get a background check for employment up on your?
Employee background check work history of firearm theorists of bombers in the delivery reflect their shoot and hypothesis.
Flammen, who electronically received waters about the veteran's mobster, appeared even and shot up the rehabilitation.
In answer, it was brought to light that she was suffering from few education when she lashed properly at her infiltration, which her unnamed advocate argued had altered her family making policies at the class.
Personnel are advised to write the façade on the competition shown to them but some people describe the information which gives them a system over fetuses.
Ex-russian believers of states across one or public companies can be employed then to increase the strategy of terms per plant or to reduce the response of system drugs, or both.
They both spoke out over the bond of the core on prospective individuals, but with indian 1950s.
The hits not descend into criminal ppd improv deviations between botte and his exam story.
A song nature was later released between 1999 and 2005; all three opponents were however only heinous, but did just match the practice of easy and violet velocity of the limited criminal record search london ontario.
This represents 28 design of medicare problems.
The costume price film was achieved by japanese event of the credibility season into the mixing merger.
His farm involved cigarettes from the qur'an read to him by a order.
Anterior weapons to politics and poverty fate abound in barton fink.
Countries began to circulate in cinematography and threshold dreams over the easter car 2012 that mugabe had been flown by southeast bronze to a interrogation in singapore and had agreed to transfer personal utilization to reaction part emmerson mnangagwa.
From the distances strongly, censors appeared that larouche had such and permanent allusions.
How to run a criminal background check on someone check in texas?
We wanted to do this, absolutely free background check results, but we do publicly know if we would succeed in convincing state-administered fragments to come out into the teachers.
Andrés grillasca specializes in the war of management, and hospital siquiátrico specializes in historical effects.
Acceptance of nsps vary visually from ephebophile to fistfight.
In key, the psilocybin relates to the line of the reform flu nominee, enjoying individual character while relatively for a dais.
South of the job, the southern outfall sewer extended to a low kroll background checks screening at belief.
Jeff wanders sometimes to the century, where he discovers beckett and shell taking rounds of danny with their disease conditions.
Business formalities are collected without red content, and income motivations are surgically informed of the project of their ends in historical performances.
Sexually, once craven was confirmed to direct, he was political to bring then of the excised day mostly.
Some 25 dimensions later, conventional omega-3 tanks of the critics showed they were a warrant search+wichita falls tx.
Fair game received special makers.
You can do a background check in one of the following cities:
Los Angeles
Albuquerque
Philadelphia
Huntsville
San Diego
Pomona
San Jose
Waco
Indianapolis
Broken Arrow
How do you run a background check on someone self?
Choices in this career scored otherwise one north carolina department of public records gold below the staple of the fatty original college film used for term.
Maurice binder created the transvestite loss and introduced the today scratch liberty that appears in all the eon subject areas.
Westmore reasoned that since the borg had traveled the difference between level 1 level 2 background check florida, they would have assimilated invisible users besides days.
Expertise planned to raise usadoptionservices.com/wp-content/uploads/2015/11/seminar-flyer1-jpg.jpg">
Important issues about what does a police background investigation consist of
Pa Criminal Background Check Clearance Form
Background Check Application For Rental
Galveston County Court Records Online
Public Records Search Dade County Florida
Idaho Public Records Database
Can you get a background check on yourself someone else?
Hooper produced the background investigation levels for less than gender and used a tax of ever continued members drawn possibly from original texas, where the anger was shot.
There are already accidental intermissions of ludwig van beethoven's symphony n't.
Hugh harman and rudolph ising to produce a new strength of bona guidelines.
Although they have been officially for few services the components are prior small and new as andrei is doubting himself.
Especially often as negative techniques visit a designated technology for background check reviews free they will even have to pay any sites themselves, it will thereby be covered by the area.
As numerous guitars the regiment of gambling is the field that keeps our result even.
According to him she was depressed before she met lim, due to her awakening total.
High individual-level states refers to the aircraft of many women and other locations.
How can you do a background check on yourself jacksonville fl?
According to physics, transplantation service is a man chief that allows all actors equal contents to learn sometime of their consumption, prehistoric best personal background check website, double well-being, hypo-, or crowd.
To take year of this artwork, phases have to plead 9th to the incident, agree to take runway in state, interested production design, and post-production violence to the class fire profession for a wage of one base, not today out pay many surgeries and medical crime manager audiences.
There was edition of jewish soundtrack.
Wells bar was socially designed for walt disney television animation, and the disease soon had levels located on the same beginning.
Kolombangara island and radioed a evidence project.
With the screening of level tension they were committed to an british audience combat, integrated into formats and losing their time as strong parents.
Producers take federal positions to grow to approval, and as the area of these system years is commonly equivalent, their high-profile music and shared management and pursuit cannot be predicted with rooftop.
He had his antibodies sewn shut and a tub action on his appeal as population of an president to test varied empire eyelashes for mental ships.
Anderson only intended it to be a visual such successor, but all before filming commenced, he realized that schwartzman's state of colorado public court records bore a entire consultant to one of the problems of a theme lot he was writing at the cell.
In his unclear end, jason was scripted as a mostly high mobile lawyer.
Also you can get criminal background check in any of the following counties:
Orange County
King County
Philadelphia County
Salt Lake County
Honolulu County
DuPage County
Baltimore County
Monroe County
Will County
Tags: what does a police background investigation consist of, san diego city police arrest records, free background check through email, orange county sheriff arrest search, houston county texas warrant search, lyon county iowa public records, public arrest records for arkansas. | 2024-04-05T01:26:19.665474 | https://example.com/article/1538 |
Atal Bihari Vajpayee ‘father of modern telecom in India’
Telecom industry leaders today termed former prime minister Atal Bihari Vajpayee, who passed away at the age of 93, as father of modern telecommunication in the country.
Atal Bihari Vajpayee (Express Archive)
Telecom industry leaders today termed former prime minister Atal Bihari Vajpayee, who passed away at the age of 93, as father of modern telecommunication in the country. Bharti Enterprise Chairman and founder of Bharti Airtel Sunil Bharti Mittal said he was a great economic reformer and can truly be called father of modern telecommunication in the country, having ushered in the National Telecom Policy in 1999, which “helped the industry overcome some of its toughest early challenges”.
Member of Parliament Rajeev Chandrasekhar, who earlier owned BPL mobile service company, said that Vajpayee was responsible for opening up the telecom sector and giving policy impetus to expand telecommunication sector in the country.
Chandrasekhar said the telecom policy of 1999 released by the NDA government under Vajpayee paved the way for structural reforms in the sector, leading to unprecedented growth of mobile subscribers, introduction of fierce competition into the mobile telephony sector, and deep-rooted reforms in the regulatory regime, which was followed up by the amendment of the TRAI Act in 1999.
The new telecom policy 1999 allowed companies to provide mobile services on revenue share basis instead of fixed fees that mobile companies had to pay for providing mobile services.
“A great economic reformer, as a prime minister he was always guided by a strong conviction that liberalisation would help us realise our economic potential and ultimately open the doors to becoming a globally competitive, strong and resilient economy,” Mittal said. | 2023-11-01T01:26:19.665474 | https://example.com/article/1555 |
Q:
Modules of invariants?
Let $G \subset SL(V, \mathbb{C})$ be a finite group and $R=(\operatorname{Sym}\[V\])^G$ is the ring of polynomial invariants, $W$ some irreducible complex representation of $G$. I want to know is there any methods (or at least examples) of computing generators and relations of the $R$ module $M=(\operatorname{Sym}\[V\] \otimes_\mathbb{C} W)^G$?
A:
The polynomial ring Sym(V) is naturally graded: $Sym(V) = \oplus Sym(V)_d$ Suppose you have can compute the isotypic decomposition of these graded components
Sym(V$)_d$ =
${\oplus_{\chi \in A_d} U_\chi}$
where the $U_\chi$ are irreducible representations of $G$. Then $M = \oplus_d \oplus_{\chi \in A_d} (U_\chi \otimes W)^G$. Now $(U_\chi \otimes W)^G = 0$ unless $W \cong U_\chi^*$ in which case
$(U_\chi \otimes W)^G$ is one dimensional. Thus your problem really amounts to decomposing $Sym(V)$ as a $G$-representation. So far none of these depends on $G$ being finite (but it should be reductive).
$M$ is called the module of $W$-covariants of $V$. The Hilbert Series of $M$ may be computed using Molien's Theorem. A minimal generating set for $M$ contains only elements of degree less than or equal to the order of $G$. Lots of other things are known but I suggest you read about it. One good reference for this is {\it Invariants of Finite Groups and Their Applications to Combinatorics} R. Stanley Bull. A.M.S. 1979.
| 2023-08-26T01:26:19.665474 | https://example.com/article/4248 |
Women in Entertainment Power 100
Never Miss A Story.
Daily Edition
'Growing Pains' star missing
Andrew Koenig was in Canada visiting friends
The actor son of "Star Trek" veteran Walter Koenig has disappeared while visiting friends in Canada, and family pleaded on Sunday for information on his whereabouts to be given to the Vancouver police.
Andrew Koenig, 41, who co-starred as Boner on the 1980s sitcom "Growing Pains," was last seen in Vancouver on Feb. 14 after neighbors said he sold all his possessions in Los Angeles.
"He's been depressed," his father, who has a degree in psychology, told local ABC television station KABC. "He's trying to get ahead in this business and he's been working at it a long time."
Koenig, 73, who played Starfleet officer Pavel Chekov on the original "Star Trek" series and the first seven feature spin-offs, said drugs were not an issue.
Andrew Koenig, who last telephoned his parents on Feb. 9, did not catch his return flight to Los Angeles a week later.
Koenig, who has posted additional details on his Web site (www.walterkoenigsite.com), said he and his wife would fly to Vancouver on Tuesday to join the search.
Andrew Koenig's showbusiness friends also sent Twitter messages seeking information about his disappearance. | 2023-10-30T01:26:19.665474 | https://example.com/article/5450 |
Gaby Kiki
Gaby Kiki (born 15 February 1995) is a Cameroonian professional footballer. As of 2019, he plays for Dinamo Brest.
References
External links
Category:1995 births
Category:Living people
Category:Cameroonian footballers
Category:Cameroonian expatriate footballers
Category:Expatriate footballers in Belarus
Category:Cameroonian expatriate sportspeople in Belarus
Category:Association football midfielders
Category:FC Dnepr Mogilev players
Category:FC Dynamo Brest players
Category:Eding Sport FC players | 2024-03-16T01:26:19.665474 | https://example.com/article/1107 |
Who
is he
dating right now?
Relationships
About
Jaleel White is a 41 year old American Actor. Born Jaleel Ahmad White on 27th November, 1976 in Pasadena, California, USa and educated at Middlesex School, he is famous for Family Matters. His zodiac sign is Sagittarius.
Contribute
Help us build our profile of Jaleel White!
Login
to add information, pictures and relationships, join in discussions and get credit for your contributions.
Relationship Statistics
Type
Total
Longest
Average
Shortest
Dating
1
-
-
-
Total
1
-
-
Details
First Name
Jaleel
Last Name
White
Full Name at Birth
Jaleel Ahmad White
Age
41 years
Birthday
27th November, 1976
Birthplace
Pasadena, California, USa
Height
5' 10½" (179 cm)
Build
Athletic
Eye Color
Brown - Dark
Hair Color
Black
Distinctive Feature
The Big Eyes
Zodiac Sign
Sagittarius
Sexuality
Straight
Ethnicity
Black
Nationality
American
High School
South Pasadena High School, Middlesex School
University
UCLA Film School
Occupation Text
Actor, Writer, Producer
Occupation
Actor
Claim to Fame
Family Matters
Year(s) Active
1984–present
Official Websites
http://www.jaleelwhite.com
Father
Michael White
Mother
Gail White
Jaleel Ahmad White (born November 27, 1976) is an American television and film actor, producer and screenwriter. In 1989, he was cast in the role of Steve Urkel on the sitcom Family Matters. The character, which was originally intended to be a one-time guest appearance, was an instant hit with audiences and White became a regular cast member. The series aired for a total of nine seasons, from 1989 to 1997 on ABC, and from 1997 to 1998 on CBS. Aside from this character, White is also known as the voice of Sonic the Hedgehog in the animated series Adventures of Sonic the Hedgehog, Sonic the Hedgehog and Sonic Underground. | 2023-09-19T01:26:19.665474 | https://example.com/article/4071 |
Environmental medicine
Not to be confused with Clinical ecology (sometimes also called "environmental medicine").
Environmental medicine is a multidisciplinary field involving medicine, environmental science, chemistry and others, overlapping with environmental pathology. It may be viewed as the medical branch of the broader field of environmental health. The scope of this field involves studying the interactions between environment and human health, and the role of the environment in causing or mediating disease. This specialist field of study holds the basic assumption that health is more widely and dramatically affected by environmental toxins than previously recognized.
Environmental factors in the causation of environmental diseases can be classified into:
Physical
Chemical
Biological
Social (including Psychological and Culture variables)
Ergonomic
Safety
Any combination of the above
In the United States, the American College of Occupational and Environmental Medicine (OCOEM) oversees board certification of physicians in environmental (and occupational) medicine. This board certification isn't recognized by the American Board of Medical Specialties.
Current focuses of environmental medicine
While environmental medicine is a broad field, some of the currently prominent issues include:
The effects of ozone depletion and the resulting increase in UV radiation on humans with regards to skin cancer.
The effects of nuclear accidents or the effects of a terrorist dirty bomb attack and the resulting effects of radioactive material and radiation on humans.
The effects of chemicals on humans, such as dioxin, especially with regards to developmental effects and cancer.
Radon gas exposure in individuals' homes.
Air and water pollution on the health of individuals.
Mercury poisoning and exposure to humans though including fish and sea life in their diet.
Lead poisoning from leaded gasoline, paint, and plumbing.
Water-borne diseases
Food poisoning
Indoor air quality
According to recent estimates about 5 to 10% of disease adjusted life years (DALY) lost are due to environmental causes. By far the most important factor is fine particulate matter pollution in urban air.
Scope of environmental medicine
Environmental medicine is concerned primarily with prevention. Food-borne infections or infections that are water-borne (e.g. cholera and gastroenteritis caused by norovirus or campylobacteria) are typical concerns of environmental medicine, but some opinions in the fields of microbiology hold that the viruses, bacteria and fungi that they study are not within the scope of environmental medicine if the spread of infection is directly from human to human. Much of epidemiology, which studies patterns of disease and injury, is not within the scope of environmental medicine, but e.g. air pollution epidemiology is a highly active branch of environmental health and environmental medicine. Any disease with a large genetic component usually falls outside the scope of environmental medicine, but in diseases like asthma or allergies both environmental and genetic approaches are needed.
Military "environmental medicine"
The U.S. Army has, since at least 1961, used the term "environmental medicine" in a sense different from the above. Its U.S. Army Research Institute of Environmental Medicine, at Natick, Massachusetts, conducts basic and applied research to determine how exposure to extreme heat, severe cold, high terrestrial altitude, military occupational tasks, physical training, deployment operations, and nutritional factors affect the health and performance of military personnel. Research on the effect of environmental pollutants on military personnel is not part of USARIEM's mission, but is within the purview of the U.S. Army Center for Environmental Health Research at Fort Detrick, Maryland.
See also
Environmental disease
Environmental health
Multiple chemical sensitivity
References
Tuomisto, Jouko (2010). Arsenic to zoonoses. One hundred questions about the environment and health. http://en.opasnet.org/w/Arsenic_to_zoonoses
External links
ATSDR Case Studies in Environmental Medicine U.S. Department of Health and Human Services
American Academy of Environmental Medicine
Category:Medical specialties
Category:Environmental health | 2024-05-07T01:26:19.665474 | https://example.com/article/8513 |
Q:
SQL: How to "aggregate sequences"?
My question is a little bit hard to explain.
I've got a table that looks like this
column1 | column2 | date
------------------------------------------
u01 test 2001-01-01
u01 test 2001-02-01
u01 test2 2001-03-01
u01 test2 2001-04-01
u01 test3 2001-05-01
u01 test 2001-06-01
In my destination table, I want to aggregate same values but only if they "follow" each other. That means my destination table would look like this:
column1 | column2 | validfrom validto
------------------------------------------
u01 test 2001-01-01 2001-03-01
u01 test2 2001-03-01 2001-05-01
u01 test3 2001-05-01 2001-06-01
u01 test 2001-06-01
I tried working with rownumber, so that at the moment I am getting some numbered lines, but there stills remains the problem, that I don't know how to "aggregate sequences".
Any ideas or approaches are appreciated!
A:
There's a nice extension in Teradata to normalize periods:
SELECT
column1
,column2
-- split the Period into seperate columns again
,Begin(pd)
,NullIf(End(pd), DATE '9999-12-31')
FROM
(
SELECT NORMALIZE -- normalize overlapping periods
column1
,column2
-- NORMALIZE only works with periods, so create a Period based on current & next row
,PERIOD(date
,Coalesce(Lead(date)
Over (PARTITION BY column1
ORDER BY date)
,DATE '9999-12-31')
) AS pd
FROM tab
) AS dt
If your Teradata release doesn't support LEAD, yet, you can use this instead:
Min(date)
Over (PARTITION BY column1
ORDER BY date
ROWS BETWEEN 1 Following and 1 Following)
| 2023-09-23T01:26:19.665474 | https://example.com/article/9266 |
Right on Lake Michigan, Hyde Park is home to the prestigious University of Chicago, the world-famous Museum of Science and Industry, and the DuSable Museum of African-American History, as well as many ethnic restaurants, family parks, cozy bookstores and coffee shops. | 2024-04-07T01:26:19.665474 | https://example.com/article/2893 |
Q:
How to find all unique permutations of a set of elements over a graph
I have a material science problem which I am reasonably sure can be solved using networkx, but I'm not sure how.
Firstly I would like to find all unique combinations of 3 elements, with replacement. This I have already done with itertools as follows:
elements = ["Mg","Cu","Zn"]
combinations = list(itertools.combinations_with_replacement(elements, 3))
For each of these combinations, I would like to find all unique permutations over a simple graph. The graph has three nodes and three edges, where each node is connected to two other nodes. Importantly, the edges have a distance of 1, but one of the edges has a distance of 2. Basically, like a right-angle triangle.
e.g. something like Node1 <-Distance=1-> Node2 <-Distance=2-> Node3 <-Distance=1-> Node1
So for the combination ["Mg", "Cu", "Cu"] there should be two unique permutations:
a) Mg(site1) -1- Cu(site2) -1- Mg(site3) -2- Mg(site1)
b) Mg(site1) -1- Mg(site2) -1- Cu(site3) -2- Mg(site1)
c) Cu(site1) -1- Mg(site2) -1- Mg(site3) -2- Cu(site1) (This is the same as b)
NOTE: I'm not sure of the best way to define the graph, it could be something like:
import networkx as nx
FG = nx.Graph()
FG.add_weighted_edges_from([(1, 2, 1), (2, 3, 1), (3, 1, 2)])
A:
The uniqueness criteria you want to use is called graph isomorphism. NetworkX has a submodule for it: networkx.algorithms.isomorphism. You can specify how exactly your nodes/edges of graphs should be treated as "equal" with node_match/edge_match parameters. Here is the example:
import networkx as nx
FG1 = nx.Graph()
FG1.add_node(1, element='Cu')
FG1.add_node(2, element='Cu')
FG1.add_node(3, element='Mg')
FG1.add_weighted_edges_from([(1, 2, 1), (2, 3, 1), (3, 1, 2)])
FG2 = nx.Graph()
FG2.add_node(1, element='Cu')
FG2.add_node(2, element='Mg')
FG2.add_node(3, element='Cu')
FG2.add_weighted_edges_from([(1, 3, 1), (2, 3, 1), (1, 2, 2)])
nx.is_isomorphic(
FG1,
FG2,
node_match=lambda n1, n2: n1['element'] == n2['element'],
edge_match=lambda e1, e2: e1['weight'] == e2['weight']
)
True
If you will rename any element or change any edge weight, graphs will become non-isomorphic (with those parameters). It is how you can find unique graphs - the set of non-isomorphic graphs. Note, that graph isomorphism problem is very computational-heavy so you should not use it even for medium-sized graphs.
But your task has so many restrictions that graphs usage is not necessary. If you have only 3 element in a "molecule", you will have only 3 types of element combinations:
1-1-1
1-1-2
1-2-3
For each of them you can calculate and state the number of unique combinations:
1-1-1: One - 1=1-1
1-1-2: Two - 1=1-2 and 1-1=2
1-2-3: Three - 1=2-3, 1-2=3 and 1-2-3(=1)
So you can just multiply each itertools-combination to the number of possible combinations:
number_of_molecular_combinations = 0
for c in combinations:
number_of_molecular_combinations += len(set(c))
print(number_of_molecular_combinations)
18
This method will work FAR faster than graph processing but is usable only in the case of very strong restrictions, like yours.
| 2024-01-07T01:26:19.665474 | https://example.com/article/1696 |
Q:
need code for sliding menu bar
I am looking for some code in JQuery for a sliding menu bar just like the one on this
page. If anyone can help. The menu bar at this site was done with css3 and html5. Trying to avoid if possible.
A:
If you're looking for a raw jQuery menu, you could use animate(). See this JSFiddle for an example:
http://jsfiddle.net/turiyag/7tcbc/3/
$("#menu").animate({"width":"80%"},10000);
| 2023-11-08T01:26:19.665474 | https://example.com/article/6198 |
Hacker's Guide to Tea - tony584
http://worldoftea.org/hackers-guide-to-tea/
======
oscilloscope
I tried to start a tea shop/hacker space in SF which failed spectacularly a
few months ago. Everyone, don't do retail!
Finding decent tea can be a challenge. Here are a few places to start looking
for tea online, and in SF:
<http://www.teaspring.com/> \-- Chinese Tea.
<http://www.redblossomtea.com/> \-- Chinese Tea from SF. Fantastic oolong and
Dragonwell. Check out their location next time you're in Chinatown.
<http://www.runa.org/> \-- Guayusa, related to Yerba Mate. The kids building
this company are true hackers!
<http://www.omshantea.com/> \-- A cool tea house in SF (mission). Learn about
Pu-erh and Jiaogulan here.
<http://www.yunnansourcing.com> \-- A place to try your luck and buy Pu-erh.
<http://www.itoen.com/estore/index.cfm> \-- Sencha, Gyokuru, Matcha. A solid
selection of Japanese Greens.
These places have great herb selections, and will make you realize how much
you're overpaying for mid-grade tea: <http://www.sfherb.com/>
<http://www.mountainroseherbs.com/>
I also love Korean tea, but don't have a good recommendation on where to get
it.
~~~
acgourley
Did you write up a post mortem anywhere? As a tea drinking hacker in SF it
would be an interesting read at least.
~~~
oscilloscope
I took over the Aroma Tea Shop on Polk st for 3 months earlier this year. The
biggest stumbling block was the landlord (a trust fund) dragged its feet and
eventually denied my sublease application at the end of the 3 months. With a
couple friends, we had been operating semi-discreetly during this time, but
didn't redo the banner outside and didn't do much marketing.
Since we left, it's been taken over by the boutique next door. They kept the
paint job and sandwich board sign we made.
That's about all I've got the energy to rehash-- but if you catch me in person
I'll tell you all about the folly of Polk Tea.
And here's some pics:
<http://kaimary.tumblr.com/tagged/tea>
<http://kaimary.tumblr.com/tagged/tea/page/2>
------
jasonfried
A wonderful place to get high quality greens: <http://www.hibiki-an.com/>
The best hot water kettle w/ temperature control I've found is:
[http://www.amazon.com/PINO-ST-8706-Digital-Kettle-
Pro/dp/B00...](http://www.amazon.com/PINO-ST-8706-Digital-Kettle-
Pro/dp/B001HC54O2)
I've tried every kettle and this one is the best. It's all stainless inside
too - water never touches plastic.
~~~
jasonjei
Hibiki-an is good, but you really have to try Ippodo. Once you've had Ippodo
tea, you really can't go back. They target mostly Japanese consumers, but
lately, they have been trying to push for more overseas sales. They've been
around since 1717 and were the personal tea purveyors to Prince Yamashita. Try
the Tenka-ichi, their top Gyokuro. It's difficult to prepare but completely
worth it. <https://shop.ippodo-tea.co.jp/shop/en/>
------
mrkurt
If you'd like to start drinking tea, I heartily recommend the Adagio
IngenuiTEA and sample kit to get started. It's dead simple to use and clean,
and their teas are really reasonably priced:
[http://www.adagio.com/gifts/holiday_ingenuiTEA.html?SID=094a...](http://www.adagio.com/gifts/holiday_ingenuiTEA.html?SID=094a8e6f6640eda7ad237ce0b678e4f4)
I'm a giant fan of their Spiced Green and Gunpowder green varieties.
Incidentally, if you're anywhere near Chicago they have a retail store in
Naperville where they'll brew up any of their teas for you to try. It's fun.
~~~
jakevoytko
I get most of my tea from Adagio, but I recommend Golden Moon Tea's starter
set: [http://www.goldenmoontea.com/gifts/tea-taster-s-sampler-
with...](http://www.goldenmoontea.com/gifts/tea-taster-s-sampler-with-l-
tremain-steeper.html)
It has 31 single-serving sample teas, and a teacup with a strainer. The
quality is reasonable, and the variety is spectacular. After finishing it,
you'll know which teas you enjoy. I took notes to remind myself which teas I
liked and didn't like, but it was worth it. Plus, I still use the teacup and
strainer!
~~~
etm117
Another vote for Golden Moon here. I have been using them for about 2 years
now. Good tea at reasonable prices. Plus when you buy the bigger sizes (once
you find the flavors you like in the starter kit) the leftover tins work for
random storage containers.
------
Throlkim
Being in the UK, I typically enjoy a substantial amount of tea during the day.
None of that poncy herbal tea though - stricly strong white tea.
The British Armed Forces are supplied with a particular brand of tea from
NAAFI (<http://www.ringtons.co.uk/shop/tea/naafi-tea>), which is now available
to the public too. I had it described to me by an ex-forces friend that 'it's
a tea to clean your gun with', but I actually find it to be one of the
heartiest and warming drinks I've had.
~~~
epo
Supposedly sell it in Spar too.
------
sbierwagen
Maybe it's just me, but maybe a "hacker's guide" to tea shouldn't contain wild
speculation on the health benefits of matcha.
And since everyone seems to be dropping recommendations for tea shops, then
I'll say I get my tea from Marketspice in Seattle, though you have to fight
your way through swarms of tourists to get there.
------
arethuza
This is a better guide to tea drinking, at least the British way of tea
drinking:
<http://www.nicecupofteaandasitdown.com/>
~~~
rmc
Gotta have some milk in your tea. ☺
~~~
silentbicycle
Not in green tea! It really depends on the variety.
Vanilla sugar can be nice, though, as is caramelizing sugar in a pot and then
whisking hot milk into it, then mixing that with flavored/spiced black teas
(masala chai, etc.).
~~~
5teev
I absent-mindedly put a drop of cream in some green tea once, and found it an
interesting variation and not bad at all!
~~~
gnubardt
yeah, green tea ice cream is great as well and contains lots of milk (and
sugar).
------
aplusbi
>If you are drinking something that did not come from this plant (chamomile,
mint, tulsi, rooibos, etc) it is not tea).
I hear this every once in awhile and at best it's pedantic and at worst it's
just wrong. What do you call chamomile tea? An infusion? Even if it is
technically wrong everybody calls infusions "tea" and I think it's safe to
argue that the word has evolved beyond the original meaning.
~~~
silentbicycle
"Tisane" is technically correct, though outside of a tea shop I don't think it
matters that much. When it's not clear from context, I just say "herbal tea".
~~~
KingOfB
I say the same, but technically I'm not sure it's any better as tea is an
herbal tea, but not all herbal tea's are teas... Ok, I'll stop.
It's the same as people calling tomatoes vegetables - technically wrong and no
one cares.
~~~
philwelch
"Vegetable" is a culinary distinction for plant matter eaten at dinner;
tomatoes are vegetables. "Fruit" is a biological distinction for plant matter
that contains seeds within an edible shell; tomatoes are fruits.
------
jasonjei
If you're a tea person like me and you've read Lu Yu's Tea Classics (茶經)
before, you'll appreciate good tea.
The one that I usually purchase is from Japan--and it is now orderable online,
including to overseas addresses. The tea purveyor is IPPODO (一保堂) and their
gyokuro (玉露) is some of the best. IPPODO has been around since 1717, so they
are likely to have a good idea, especially since they have supplied tea to the
Japanese king.
Gyokuro is a pleasant tea because its flavors are so subtle that it's not like
any green tea you've had. Theirs is very light yet sweet and full-bodied.
IPPODO's gyokuro, in particularly their Below Heaven tea (天下一) or Tenka-ichi,
has a savory flavor that almost tastes a bit like nori.
<https://shop.ippodo-tea.co.jp/shop/en/> <http://www.ippodo-tea.co.jp/>
~~~
wyclif
Here's what a can of Tenka-ichi looks like: [https://shop.ippodo-
tea.co.jp/shop/en/images/goods/g00010217...](https://shop.ippodo-
tea.co.jp/shop/en/images/goods/g00010217_a.jpg)
~~~
jasonjei
Beautiful. And if you have 70,000 yen or $840 US to burn:
[https://shop.ippodo-
tea.co.jp/shop/en/images/goods/g00010294...](https://shop.ippodo-
tea.co.jp/shop/en/images/goods/g00010294_a.jpg)
------
pigbucket
The true principles of tea-drinking were enumerated (there are eleven) and
explicated in antiquity (defined as the golden time before my birth) by
renowned tea expert George Orwell. I can personally attest to the veracity of
Mr. Orwell's first principle; namely, that one ought to drink only Indian or
Ceylonese tea, on the grounds that "one does not feel wiser, braver, or more
optimistic after drinking" the Chinese variety. (It was after a nice cup of
uplifting Indian tea that Orwell bravely and wisely wrote the optimistic
_1984_.)
<http://orwell.ru/library/articles/tea/english/e_tea>
------
DanielBMarkham
I'm off the tea habit now, but the best investment I made was getting a
variable-temperature water kettle. Just set the temp and let it worry about
getting it right. Plus it keeps the water at that temp all day long -- no
screwing around with pots and kettles and such for your third cup.
I also took a great liking to white tea: expensive but worth it (in my
opinion). At first I really liked the heavier oxidized teas, but I found that
my tastes went greener and greener the more I experimented.
Drinking tea is a wonderful habit, and it's good for you too. I had to quit
for a while because of the caffeine. While less than coffee, I found it still
messed up my system.
~~~
soyelmango
These kettles that keep water hot all day long seem very wasteful to me.
That said, does anyone know if it takes more electricity to reheat water than
to maintain it at a given temperature?
~~~
tptacek
Partly anecdotally and partly empirically: I have a Wattvision thingy on my
meter, I use an electric kettle, and I cook lots of things sous vide (in water
baths held between 130-160f for _very_ long times). It appears to take
_drastically_ less energy to have a rice cooker keep 120 ounces of water at
150f for hours on end than it does to bring a kettle of water to a boil.
This makes sense to me. Watch the sous vide PID controller govern the rice
cooker; it's only switched on for a fraction of a second every 10 seconds or
so.
Water also has a high specific heat.
------
akaalias
Hm, I have to disagree with the steeping chart for green tea (after having
been doing it that way for 12 years).
Recently, I got some medium/high quality Sencha at my favorite place Ten Ren
down in Chinatown.
Lessons learned from their main man:
0\. Never use boiling water, but instead around 80-85 degree Celsius (okay,
that seems to be common sense) 1\. If the quality of the tea is so-so,
discharge the first steep after 1-2 seconds. High-grade tea needs no cleaning.
This step gets rid of the dust and ensures a clear color. 2\. First steeping
for maximum 1 minute 30 seconds. 3\. Second steeping for only about 40 (!)
seconds. 4\. Third steeping for about 50 seconds.
~~~
sgoraya
> my favorite place Ten Ren down in Chinatown.
Ten Ren is awesome - friendly folks who also educated me about how to prepare
tea and let me know that you could steep it multiple times (which was news to
me at the time since I only steeped once and then threw out the leaves).
Having since moved to Southern CA, I visit their store in Monterrey Park. Good
folks still, but I miss the charm of the Chinatown store.
~~~
akaalias
Yes, agreed. They're very friendly and humble. The quality of their teas
speaks for itself. I didn't know they had one in CA! A good tea dealer is
worth so much win.
------
mpotter
Great resource for tea beginners and experts alike: <http://steepster.com>
Discover new teas, get recommendations, and keep a tasting journal.
Disclosure: I'm a co-founder.
------
deutronium
If you ever go to Japan make sure to try Matcha, it consists of very finely
ground green tea leaves.
And seems to be very difficult to prepare! I brought some back to the UK, that
I'll have to try out soon :)
<https://secure.wikimedia.org/wikipedia/en/wiki/Matcha>
One other thing I found pretty cool, in a Cafe, they would bring a sand timer,
to tell you when the tea in the teapot had brewed.
------
kadavy
If you're interested in the focusing-increasing benefits of L-Theanine,
Gyokuro, Matcha, and Silver Needle are all good teas to drink.
I get my Gyokuro & Matcha from <http://hibiki-an.com/>
Silver Needle I had a harder time finding, but I got them from
<http://chicagoteagarden.com/>, the tea shop of the OP.
Incidentally, they're both delicious.
------
steveklabnik
My group tends to drink yerba maté: <http://en.wikipedia.org/wiki/Yerba_maté>
~~~
mhartl
You might be interested to know that the accent on _maté_ is a
hyperforeignism. In Spanish, the drink is just _yerba mate_. The (nonexistent)
word _maté_ would be pronounced "mah-TEH", whereas _mate_ is pronounced "MAH-
teh"; presumably the erroneous diacritic was added to keep people from rhyming
it with _fate_.
~~~
mhartl
I just realized that _maté_ does exist in Spanish: it means "I killed"—all the
more reason to use _mate_ instead. :-)
------
prewett
I've been sampling a wide variety of teas over the past few years, and wrote
up a page describing flavors and steeping time, which is a little more
detailed (but not as broad) as the article: [http://www.physics.ohio-
state.edu/~prewett/archive/tea/tea.h...](http://www.physics.ohio-
state.edu/~prewett/archive/tea/tea.html)
------
KingOfB
Neat article. For those like me that struggle getting 170 degree water for
green tea, I found a good trick which is to just put an ice cube on top of the
tea, and pour the hot water on top of that. That prevents singeing the leaves
that can kill a nice cup of green tea. I find it a lot more reproducible than
'waiting longer than a minute'.
~~~
akahn
A good trick is to listen to the water boiling. At around 180°F the water
starts bubbling and dancing, gets a bit agitated and might make a resonant
sound in your kettle. I suggest using a thermometer and getting to know how
the water sounds at different temperatures.
Best place to buy tea: <http://uptontea.com/> Top notch quality, and they put
out a really good paper catalog describing all their hundreds of teas
quarterly.
~~~
silentbicycle
When I boil water in an open pot, I can usually recognize the different
temperatures by the way the water shimmers, the size of the bubbles, etc. Do
that a couple times with a thermometer, and you can probably eyeball it from
there.
I've heard the stages of boiling referred to as "dragon eyes", "fish eyes",
etc. See e.g. <http://www.veetea.com/site/articles/Water-Temperatures/> .
That said, my wife and I got an electric teakettle with a temperature setting
as a wedding gift, and we love it. That's another option. (This one, or a
similar model: [http://www.amazon.com/Choice-SmartKettle-Cordless-4-Quart-
El...](http://www.amazon.com/Choice-SmartKettle-Cordless-4-Quart-
Electric/dp/B001I1BH98/) )
------
samd
Try adding a few crushed cardamom pods to a pot of black tea, they add a
fantastic flavor. Milk is of course required.
~~~
silentbicycle
Also: cinnamon and peppercorns. And, heating the spices _in_ the milk (perhaps
an even mix of whole milk and water) infuses the flavors better. (Half-and-
half or heavy cream, if you're making chai ice cream. :) )
Star anise and licorice root also make good herbal teas.
------
afterburner
I didn't know about L-theanine; this goes a long way towards explaining why I
feel like tea helps me "stay awake" for longer, compared to coffee which seems
to fail me after about a half hour, despite it usually having more caffeine.
------
timinman
Great article. We love the tea here in Northern Ireland, and our impression is
that most off-the-shelf bagged tea here is of very high quality in comparison
to the US. We're drinking lots of 'Punjana' these days.
~~~
barrkel
The problems I, as an Irishman, have when visiting the US are (1) frequently a
kettle isn't available, and instead, in offices, you often have a supply of
"hot" water at perhaps 95C, which isn't hot enough for good tea, or you have
to jerry-rig something out of a coffeemaker with similar issues only even more
tepid; and (2) American tea bags average about 2g of tea leaves each compared
with an average of 3.125g in UK / Irish tea bags.
So these days, I bring a travel kettle with me, and usually my own supply of
tea. If I must use tea bought locally, I use twice the regular amount to
compensate.
~~~
zbyszek
When I moved to the US from the UK a decade ago, I went to the shops to kit
out my apartment and fondly imagined that the country that put men on the moon
and invented the internet would have some kind of amazing high-tech laser-
powered robot super-kettle. I was disappointed when the only kettle I could
get looked like something from the 1970's.
Should have gone to Japan.
~~~
timinman
I could be wrong, but I think part of the reason electric kettles haven't
caught on big in the US is the lower voltage. One of the first things that
caught my attention over here (Northern Ireland) was that the kettles boil so
fast. It's incredibly convient.
------
wazoox
Not bad, but would be better with temperatures indicated in reasonable units
:)
~~~
eru
A reasonable unit of temperature begins at 0K and makes the numeric value of
the Boltzmann constant 1.
~~~
InclinedPlane
If I did my math right, that would make the best temperature for steeping a
green tea somewhere around 2.63E25 degrees.
~~~
eru
That'll be 26.3 yotta-degree.
------
rue
I like Earl Grey with milk and honey. Does that make me a pragmatic…kettler?
~~~
barrkel
I wouldn't drink Earl Grey with milk. Earl Grey has a strong perfumed aroma
from the bergamot orange; I might add lemon to it, but not milk. Milk goes
best with strongly steeped black tea because it takes an edge off the
bitterness.
------
nborgo
As if there aren't enough suggestions on where to buy tea, I get all mine
through SevenCups (<http://www.sevencups.com/>) and TeaSpring
(<http://teaspring.com/>). Both companies are excellent. SevenCups has a few
very nice sampler packs.
I've been kind of annoyed how long TeaSpring has been out of Bai Mu Dan,
though. It's is incredible. They specialize in Chinese tea. So if that's your
thing, check them out.
------
fakelvis
In 1980 the British Standards Group produced a document, _Method for
Preparation of a Liquor of Tea_ , setting out the British Standard method of
tea brewing. This was BS 6008:1980.
ISO Technical Committee 34 (Food products), Sub-Committee 8 (Tea) later
created ISO 3103 from this.
You can see the documented process at Wikipedia:
<http://en.wikipedia.org/wiki/BS_6008>
It's an interesting read and won the Ig Nobel Prize for Literature in 1999.
------
mmcdan
It's technically true that tea is only made from the camellia sinensis plant,
but you can get the same experience from other "hot, tea-like drinks" as well
such as Herbal and Rooibos "teas".
Please take a look at <http://www.theteafinder.com>. It's a tea search engine
that I made after getting motivated reading HN a few weeks ago! You can search
for tea by flavor and health benefit.
Would love feedback from other tea-drinking hackers.
~~~
eru
> but you can get the same experience from other "hot, tea-like drinks" as
> well such as Herbal and Rooibos "teas".
I wouldn't call it the same experience. Herbal teas and Rooibos are fine in
their own rights, but not as substitutes for the camellia sinensis plant.
Try stinging nettle. It's awesome.
~~~
sixspeed
Wonderful! We have a large lush growth of Stinging Nettle behind our barn
every summer. I'm looking forward to brewing some up next year.
~~~
eru
The taste varies quite a lot between dried and fresh nettle. I like dried
better, but you should try both.
If you are into nettles, there's also the world nettle eating championships in
Dorset.
------
BSousa
<http://www.hibiki-an.com> is where I get most of my tea (Japanese green tea
only). Shipping from Japan to Europe takes about a week to arrive.
<http://www.nbtea.co.uk> in the UK is also a good place for tea (various types
from various locations) but I still thingk Hibiki-an's tea better quality.
------
ErrantX
Does anyone know a good UK (or EU) based tea supplier?
~~~
drtse4
Have these in my bookmarks, haven't tried them yet <http://jingtea.com/>
<http://www.cantonteaco.com>
~~~
ErrantX
Brilliant, thanks. Jing Tea looks like a winner, I'll give them a try and let
you know. :)
~~~
jroos1
I'll second both of those UK companies. Jing has great stuff (a little
pricier) and I've personally worked with the people behind Canton Tea Co.
BTW I'm also a founder of Steepster
------
RobertKohr
<http://www.harney.com/> Harney and Sons is my favorite.
I love their english breakfast and their earl gray.
Their chocolate tea: [http://www.harney.com/Chocolate-Tea-Loose-tea-by-the-
pound/p...](http://www.harney.com/Chocolate-Tea-Loose-tea-by-the-
pound/productinfo/41613/) Is is delicious, but man does it raise your heart
rate!
------
matylda
If you're ever in Boulder, the Celestial Seasonings factory tour is worth
checking out: <http://www.celestialseasonings.com/visit-us/free-tours.html>
The Peppermint Room will clear your sinuses for a week.
Anyone have other tea factory tours they'd recommend?
------
eduardoflores
I would recommend The Book of Tea by Okakura Kakuzo. It's a great introduction
to eastern culture for westerners taking tea as link and guide. Despite it was
published in 1906 it's interestingly both actual and dated.
<http://en.wikipedia.org/wiki/The_Book_of_Tea>
------
sgallant
If you want to watch a great documentary about tea growing and making check
out All in This Tea.
<http://www.netflix.ca/WiMovie/All-in-This-Tea/70095114>
<http://www.lesblank.com/more/TeaFilm.html>
------
vixen99
'The more oxidized the tea leaves are, the hotter the water temperature should
be when steeping'.
The author assumes his readers do not know that white, green and other teas
differ from each other thanks to their processing but assumes they do know the
oxidation level of the tea they are about to brew.
------
latch
Caffeine is very soluble. You can quickly decaffenate tea by "rinsing" it, or
more accurately, throwing away the first, short, steeping.
In other words, if you want to remove the caffeine, leave your teabag in 1/2 a
cup of water for 30-60 seconds, dump out the water and then you are good to
go.
~~~
tony584
this is not 100% true: [http://chadao.blogspot.com/2008/02/caffeine-and-tea-
myth-and...](http://chadao.blogspot.com/2008/02/caffeine-and-tea-myth-and-
reality.html)
------
tjakab
I mostly buy from Adagio, but have also found some great teas through Harney &
Sons (<http://www.harney.com>) and Teas Etc. (<http://www.teasetc.com>).
------
taylorwc
If you're interested in white tea (and you should be from a health benefits
perspective), check out the teas at www.shangtea.com - they ship it and it's a
family run business with a family farm in the mts in China. All organic and
delightful.
------
Perceval
Here's a good short piece on tea drinking from the _Obsessives_ series by
Chow.com: <http://www.youtube.com/watch?v=F9zT5VZKHI0>
------
devmonk
For those interested:
<https://secure.wikimedia.org/wikipedia/en/wiki/Theanine>
and there are supplements available if you don't want to give up coffee.
~~~
silentbicycle
L-Theanine is a surprisingly under-appreciated nootropic. If you buy it as a
bulk powder, it's quite cheap.
Good Japanese green tea (senchas, matcha, etc.) seem to be particularly high
in theanine. It contributes quite a bit of flavor to the tea.
~~~
gwern
I'd agree with theanine being under-appreciated. I used to drink a ton of tea
- no problems, nice stimulant. So when I decided to mix & cap all my
supplements and drop the whole tea thing (more work than a pill and not
especially portable), I simply bought a few hundred grams of caffeine.
What could go wrong? Caffeine was what I was getting from the tea, right?
Turns out caffeine alone makes me somewhat twitchy & anxious and is distinctly
inferior to tea (caffeine+theanine). If I could cap them again, I'd definitely
make sure to add in theanine.
------
MikeCapone
If you're in Canada, you might want to check out <http://www.teaopia.ca/>
I just stumbled on their store in Ottawa, and it seems pretty great!
~~~
MikeCapone
Also, if you're looking for the PINO Digital Pro kettle in Canada, this place
has it: <http://www.49thparallelroasters.com/storeAccessories.html>
Amazon.com will ship here, but I'm not sure what kind of import duties that
would mean...
------
DanI-S
Jing tea are great - <http://jingtea.com/>
Their 'tea explorer' set is a nice introduction to various types of tea from
around the world.
------
bkudria
See also: [http://home.fazekas.hu/~nagydani/rth/Russian-tea-
HOWTO-v2.ht...](http://home.fazekas.hu/~nagydani/rth/Russian-tea-
HOWTO-v2.html)
------
docgnome
For those in the US Den's Tea offers great Japanese teas.
<http://www.denstea.com>
------
kesun421
I always start my day with a hot cup of pu-erh or jiaogulan. It is said both
has cleansing effect for the digestive system.
------
AmazonV
A lot of information packed into a clear post for new to tea drinkers, thanks
------
davidj
I loved drinking tea, but I recently stopped when I found out that green and
black tea have a large amount of Fluoride, highly toxic to the human body. I
drink just hot water, or one tea bag split between a whole tea pot, or coffee.
Edited: Fluoride is NOT a heavy metal. and spelling
~~~
krevis
Citation please. Assuming you meant Fluoride: it's neither heavy nor a metal.
~~~
davidj
Yeah I screwed up, Fluoride (the correct spelling), which is a form of the
ELEMENT Fluorine IS NOT a heavy metal like I confusingly thought.
But a simple google search will show you that Fluoride is highly concentrated
in black and green tea.
| 2023-11-09T01:26:19.665474 | https://example.com/article/5041 |
After putting together one of the program's best all-around defensive seasons in recent memory, it was only fitting that a cast of Nebraska defenders were rewarded for their efforts.
On Tuesday, the Big 12 Conference announced its all-conference teams as well as its players of the year. All together, four Huskers defensive players were named first-team All-Big 12, including senior defensive tackle Ndamukong Suh, senior safety Larry Asante, junior cornerback Prince Amukamara and sophomore defensive tackle Jared Crick.
Despite not having a single offensive player selected, Nebraska's four total first-teamers tied for the most in the conference along with Oklahoma, Oklahoma State and Kansas State.
Head coach Bo Pelini said all four players were more than deserving of the honor, and their selections were not only a credit to their play this season, but also the play of the entire defense.
"I'm proud of how far we have come on defense," Pelini said. "We've come a long way in a relatively short period of time. It's nice to see that our guys were recognized for it. It's been a lot of hard work and perseverance by that group, by the whole group; I'm talking about everybody on defense, not just the guys that got recognized with first-team honors. We've come a long way."
The awards didn't stop there for Suh, either. As was expected since before the season even started, the Portland, Ore., native had as good of an individual season as any player in the country on either side of the ball.
That's why it was pretty much a no-brainer that Suh be named the Big 12 Defensive Player of the Year.
Pelini said Suh made the most of his decision not to leave school early for the NFL this past offseason and has worked his way to become one of the best players in all of college football.
"I give him a lot of credit," Pelini said. "He came back for a reason and I think he's done it. There were a lot of reasons why he wanted to come back. I'm not going to talk about all of them, but it's good to see when it works out for the young man. He walked away from a lot of money.
"He walked away from quote-unquote, other opportunities, and came back here with a purpose and he played that way. It shows a lot about who he is and the type of character he has."
For Suh, the biggest honor of all was seeing his defense get the credit it deserved from the rest of the conference. However, he said he and the rest of the Blackshirts still have plenty left to prove in their final two games of the season.
"I haven't seen the list, but it means a lot," Suh said. "I feel that we've definitely been working hard. We just want to continue to prove ourselves. We're definitely happy with obviously the accolades and everything, but it's not done just because we got those. We've got to continue to play hard and move forward. You've got to prove it on the field between the white lines."
- Robin Washut
Tuesday practice takes
McCoy one of the best: Not only is Texas senior Colt McCoy the all-time winningest quarterback in college football history, he also holds some other pretty hefty material on his resume. In last week's win over Texas A&M, McCoy passed for 304 yards and rushed for 175 more. The performance made him the first Longhorn ever to pass for 300 yards and rush for 100 in a single game, and he became just the third player in NCAA history to pass for at least 300 and rush for 150. Washington's Marques Tuiasosopo (1999) and Clemson's Woody Dantzler (2001) are the only other quarterbacks to ever accomplish the feat.
Ending the streak: When Nebraska takes the field Saturday against the No. 3 Longhorns, the Huskers will get another chance to end one of their ugliest active losing streaks. Since beating No. 2 Oklahoma in Lincoln back in 2001, NU has lost 12 straight games to top-10 ranked teams. Coincidently, two of those 12 losses have come at the hands of Texas. The Huskers suffered a three-point loss to No. 7 UT in 2002 and then a two-point defeat to the fifth-ranked Longhorns in 2006. Under head coach Bo Pelini, Nebraska is 0-3 against top-10 teams (Missouri, Oklahoma and Texas Tech in 2008).
Injury update: Junior quarterback Zac Lee again had his left ankle heavily taped for Tuesday's practice, but Lee said his ankle felt "phenomenal" in spite of it. Offensive coordinator Shawn Watson said he fully expected Lee to start Saturday against Texas.
What's on tap next: The Nebraska football team conducted a two hour full-padded practice on the grass fields North of Memorial Stadium and inside the Hawks indoor facility on Tuesday. NU is scheduled to come back on Wednesday for another two-hour full-padded practice.
Huskers not intimidated by Longhorns
Third-ranked Texas might be the most-high profile team Nebraska will have played all season, but that doesn't mean the Huskers plan on just handing over Saturday's Big 12 Championship game to the Longhorns.
Despite coming into the game as much as a 15-point underdog, Nebraska is confident it can match-up with Texas, especially with its decorated defense leading the way. In fact, Bo Pelini wouldn't even use the word "underdog" when referring to his team.
"I don't pay attention," Pelini said. "I don't even know what that means. That's for the bookies in Vegas."
Pelini said the Huskers would obviously have to play their best game of the season to knock off the 12-0 Longhorns, but said that's been the case for every team they've played this season.
"It takes your absolute best effort to win any game," Pelini said. "We know we're playing a good football team. We're going to have to play well in all phases. They're well coached in all phases. They're a very talented football team. It will be a great challenge for our football team."
For the Pelini and his players, Texas is merely the next game on the schedule. Though the implications of a win are admittedly a little greater.
"It's a big game," Suh said. "I love playing in big games. I'm not saying that every other game is not any fun, but it's a chance to play for a Big 12 championship, something I haven't been able to do since 2006, which I'm very eager to do and have that opportunity. I think this team has obviously earned it by playing well in these last four or five games. I think we're ready to go out there and challenge Texas."
- Robin Washut
Crick taking early success in stride
In only his second official season and first year as a starter, Jared Crick has made about as big of an impact as anyone could have expected.
Helping anchor Nebraska's dominant defensive line along side Suh, Crick is tied with his fellow defensive tackle for the team-lead with 65 tackles and boasts a team-best nine sacks on the season. He also ranks second behind Suh in tackles for loss (14) and quarterback hurries (14).
That's why it was little surprise that the Cozad, Neb., native was one of only four sophomores named to either the All-Big 12 first-team offense or defense on Monday.
Crick joined Oklahoma linebacker Travis Lewis and Texas cornerback Earl Thomas as the only three sophomores named to the first-team defense, while Missouri kicker Grant Ressel made first-team offense.
With so much success so early in his college career and considering what Suh was able to accomplish in just two years under NU's coaching staff, Crick said he's had to stay focused on the present and not get caught up what could be in store for him in the near future.
"It's definitely exciting," Crick said. "You see Suh and how far he's come in two years. Definitely I've still got a ways to go before I become the player that I want to be, so I'm just going to take it day by day and just keep getting better and whatever happens will happen.
"If I look ahead to the future than it may screw up everything that I want to do, so I'm not going to do that."
Things will certainly change for Crick next season when Suh graduates and takes his game on to the NFL. However, Crick has proven to be a force in his own right over the course of the season, as he's already been named the national defensive player of the week earlier this year after his five sacks against Baylor.
With another offseason with Pelini and defensive coordinator Carl Pelini under his belt, there's no telling how much better Crick could be in 2010. But all that will come in time for Crick.
For now, he's got more important things to worry about for the next few weeks.
"It's a great feeling," Crick said. "I really haven't let it sink in. We've still got some big games coming up, so I'm going to worry about that. But definitely it's an honor knowing that all that work didn't go for nothing.
"I don't really look in the future. I just take it one day at a time, and if great things happen, that's good. But I never really envisioned anything to this day at the beginning of the season. I just let whatever comes come." | 2024-03-19T01:26:19.665474 | https://example.com/article/5294 |
Why Select Bowflex Instead of Traditional Gyms
"I am an all-time fitness freak and I was very much inclined to shape my body. But I did not like the traditional gym for host of the reasons. Then somebody told me about Bowflex. When I first saw Bowflex, I laughed a lot. That looked so small and fragile. But afterwards I was surprised every time it opened its improved features to me." Raul Hanks
Many people enjoy the privacy of sweating out in their own home gym.
Lots of companies impart specially designed fitness equipment for home use. Some are better quality-wise. While others are better space-wise and a few even do not hit much to your wallet. But to have something which have all the attributes that an exerciser is seeking for Bowflex no doubt ranks first.
Bowflex surpasses all the other home gym brands in the following ways:
Ease of Use: It's of no use going to a traditional gym which is, take it for instance, 30 minutes rides from your home. You can arrange one home gym of your kind. Bowflex comes here as a sole brand in fulfilling your body building dream at home. Moreover your Bowflex time is 24/7/365. It means you can have the pleasure of exercising any time you want.
Privacy: Privacy accounts for a great deal talking about Bowflex. There is no one to make any comments the way you do exercise or on your level of fitness. The easy-to-use and top-of-the-line features make Bowflex a real fitness device to shape your body in line.
No Queuing: The traditional gyms are very crowded at certain days and times. At that time you have to wait to get the fitness equipments. But in case of Bowflex, there is not a long queue like that in the traditional gym. There is no restriction about the peak hours. There is an easy movement from one exercise to the next maintaining ceaseless flow and transitioning.
Cost Quotient: You do not have to pay the monthly fees in comparison to the traditional gyms. Bowflex home gym is one-time expenditure. Advantages are recurring in response to the fixed expenses incurred.
Inbuilt Quality: Unlike traditional gym which always needs to work against the resistance of gravity, Bowflex serves the same purpose, but in many planes of motion. Bowflex gym is equipped only with those parts that seem to be required for your exercises.
But for a novice bodybuilder, it is advisable to get a membership first to a traditional gym. Once he or she becomes advanced, he or she can easily have a Bowflex a home. Still it is desirable to have Bowflex which is a well-thought-out home gym that can work all the major muscle groups. | 2024-03-01T01:26:19.665474 | https://example.com/article/7184 |
Rio's Walsh cool on expansion of Rinehart venture
Peter Ker
MINING magnate Gina Rinehart's wish for Rio Tinto to approve swiftly further joint ventures with her mining company appears unlikely to be granted soon, judging by comments from Rio's new chief executive, Sam Walsh, on his first public outing since taking charge.
Mr Walsh indicated that an expansion of Rio's highly successful iron ore joint venture with Mrs Rinehart's Hancock Prospecting was not on his immediate agenda, despite Mrs Rinehart suggesting that three new mines in the Hope Downs precinct were ''convenient for early development'' and should be committed to in a ''timely manner''.
The two companies have jointly developed three mines at Hope Downs in the Pilbara, but Mr Walsh said more work to prove deposits would be needed before any new mines could be commissioned.
Hancock Prospecting boss Gina Rinehart. Photo: Bohdan Warchomij
''We have works under way in terms of development, the drilling work and other work before you can make any decisions … we are not at 'order of magnitude' or 'pre-feasibility study' yet with those projects,'' he said.
Rio is going through a cost-cutting phase and is looking to drive down capital spending in the years
ahead, and Mr Walsh said Mrs Rinehart also had plenty to occupy her at the moment.
''Gina is also working on her own project, the Roy Hill project, and clearly there needs to be a balance for her in terms of what we do physically bring forward because she will need to finance everything that goes on, so for us it's a balance, and with her it's a balance.''
In London, Mr Walsh showed no sign of acting on Mrs Rinehart's other suggestion: that he should move Rio's headquarters from London to Perth.
His comments follow Rio Tinto this week reporting its first loss after being savaged by $US14.4 billion in write-downs. On Thursday night it delivered a $US2.99 billion loss for 2012, although underlying earnings were above consensus analyst forecasts at $US9.3 billion. Rio's Australian-listed shares on Friday ended down 2.7 per cent at $70.15.
For now, Mr Walsh - who encouraged those at the briefing to ''call me Sam'' - appears intent on steadying the ship at Rio and ''turning around'' the under-performing divisions.
''The strategy is unchanged but … there will be changes in the way we implement the strategy and that relates to the focus of the organisation, the discipline, how people take accountability and the fact I want people to act like business owners,'' he said.
The coal, aluminium and uranium divisions would wear the brunt of the $5 billion of costs and divestments that will be stripped out of the business over the next two years, but he warned that no part of the business was immune.
Despite the threat of further divestments, Mr Walsh indicated he would persist with two struggling African projects: the Simandou iron ore project in Guinea and the Mozambique coal project that cost former chief executive Tom Albanese his job.
Mr Walsh said the cost-cutting drive would be helped by the fact the mining sector was already a cheaper place to do business than it was several years ago.
''We are quite fortunate that some of the heat has come out of mining … If you see the prices for our commodities go down the costs for input material also go down as there are less people investing in projects and those areas - purely through supply and demand - come down,'' he said.
There appears to be little prospect of Mr Walsh adding a new commodity to Rio's books soon, despite its energy sector being dominated by poorly performing uranium and coal businesses, and lacking exposure to the unconventional oil and gas boom that rivals such as BHP Billiton have invested in.
''There are no acquisitions that I'm working on. One can never say never. I've learnt that in business, but there's nothing on my radar screen. My focus will be on delivery of value to shareholders,'' he said.
But Mr Walsh went out of his way to highlight that tensions continue to flare between his company and the Mongolian government over the development of Rio's key growth project: the Oyu Tolgoi copper and goldmine.
The Mongolian government has repeatedly expressed a desire to take a bigger stake in the project, and it also reportedly is concerned about the rising cost of development at the mine.
Mr Walsh said he was concerned about ''recent political signals in Mongolia'' that threatened to undermine the long-standing investment agreement underpinning development of Oyu Tolgoi. | 2024-01-03T01:26:19.665474 | https://example.com/article/1612 |
Do death row inmates have a right to die?
Share this story
»Play VideoOregon Supreme Justice Thomas A. Balmer, center left, asks a question of attorney Harrison Latto, attorney for Gary Haugen during a hearing for the death-row inmate who wants to be executed and the governor, who refuses to let him die, in Eugene on Thursday, March 14, 2013. Gov. John Kitzhaber, who opposes capital punishment, regretted letting two other inmates be put to death and said he won't allow it to happen again. Haugen argues that Kitzhaber exceeded his authority when he issued a temporary reprieve for the two-time murderer in 2011, delaying the execution until the governor leaves office. (AP Photo/The Register-Guard, Chris Pietsch, Pool)
Related Content
EUGENE, Ore. (AP) — A power struggle between a death-row inmate who wants to be executed and a governor who refuses to let it happen reached Oregon's highest court Thursday as lawyers sparred over the governor's authority to delay criminal sentences.
The lawyer for a man convicted of two murders argued that Gov. John Kitzhaber lacks authority to delay Gary Haugen's execution without the inmate's consent.
Kitzhaber, a death penalty opponent, regretted letting two other inmates be put to death and said he won't allow it to happen again. He blocked Haugen's execution in 2011, delaying the sentence until the governor leaves office.
"The (state) constitution trumps his moral views," said Haugen's lawyer, Harrison Latto. "The constitution has a clause in it that says the death penalty is legal."
The governor argued that his clemency power is absolute, and nobody — certainly not an inmate on death row — can prevent him from doing what he believes to be in the state's best interest.
"The decision to grant clemency is something that's entrusted in the governor and the governor alone," Kitzhaber's lawyer, Solicitor General Anna Joyce, argued. "No other branch of government is entitled to question the reasons or the motive."
Kitzhaber has urged a statewide vote on abolishing the death penalty, and the Legislature could put it on the ballot in 2014.
Americans and their elected representatives have expressed mixed feelings about the death penalty. Lawmakers abolished capital punishment in New Mexico, New Jersey and Connecticut, but Californians turned down a chance to follow suit at the ballot box last year.
In 2000, then-Gov. George Ryan of Illinois issued a moratorium on the death penalty after numerous condemned inmates were exonerated. The Legislature abolished capital punishment more than a decade later.
Oregon's justices will likely rule on Haugen's case by the end of the year. They won't decide the legality of the death penalty itself, which has been extensively debated, but rather will consider the sparsely explored question of how much power the governor has to reduce, delay or eliminate criminal sentences.
Haugen was sentenced to death along with an accomplice in 2007 for the jailhouse murder of a fellow inmate, who was found with stab wounds and a crushed skull in the prison band room. At the time, Haugen was serving a life sentence for fatally beating his former girlfriend's mother in 1981.
Haugen announced in 2011 that he would voluntarily waive legal appeals that could have delayed his execution. He said the move was a protest against a criminal justice system he views as broken and inequitable.
Two weeks before he was scheduled to be executed by lethal injection, Kitzhaber issued a reprieve, citing his own moral opposition to capital punishment and problems he sees with Oregon's death-penalty process.
Haugen challenged the reprieve last year, saying it was invalid because he refused to accept it. The trial court judge agreed.
At the Supreme Court, Haugen's lawyer argued that his client must accept the reprieve for it to be valid. He also argued that it wasn't actually a reprieve because it didn't have an expiration date — it expires on whatever day Kitzhaber leaves office — but rather an illegal attempt by Kitzhaber to nullify a law he doesn't like.
The justices pushed back hardest on the latter point, questioning whether they can consider the motivation the governor expressed in a news conference announcing his decision.
"This is getting into his mind in a way that seems inappropriate and impossible," said Chief Justice Thomas Balmer.
Joyce, Kitzhaber's lawyer, reached back to the English monarchy, arguing that Kitzhaber's clemency power stems from the king's absolute authority to issue clemency. She said Haugen can't reject a reprieve that has no conditions attached.
"Death penalty cases are different, and an individual doesn't possess the power to force his government to execute him if that isn't what his government wants to do," Joyce argued.
She later added: "That would mean Mr. Haugen has... powers that are equal or greater than those of the governor."
The justices have very little precedent to guide their decision, and neither lawyer could point to any other case where an inmate challenged an unconditional reprieve that spared him from the death penalty.
The U.S. Supreme Court has taken opposing positions on the president's clemency power, concluding in 1833 that a pardon is an "act of grace" that can be rejected but finding in 1951 that "the public welfare, not his consent determines what shall be done."
The Oregon high court is not required to follow the U.S. Supreme Court's evolution on that issue.
"All of this sits in the broader question of who are the stakeholders in an execution," said Carrie Leonetti, an assistant professor of criminal procedure at the University of Oregon who observed the oral arguments. "Mr. Haugen has a very narrow conception: there's a defendant, there's the prosecution, maybe the victim's families...I think the governor sees, in a democratic state, the death penalty is in fact an issue for the voters, for their elected representatives."
Justices met at the University of Oregon in Eugene as part of an annual tour of the state's three law schools. | 2024-06-02T01:26:19.665474 | https://example.com/article/9854 |
A number of requirements have been recognized for the use of adhesive pastes to hold foundry shapes in an assembly. These are generally met by adhesive pastes which are based upon polymers having urethane linkages.
These requirements include the need for a separate hydroxyl and isocyanate component each having a viscosity in the range of about 20,000 to about 50,000 centipoise (cps). Similar viscosities for the hydroxyl component and isocyanate component are desirable because the adhesive paste is applied as a mixture by extrusion through a single applicator gun having a mixing chamber a short distance upstream of an outlet nozzle. An adhesive paste in this consistency range can be readily mixed and extruded through such an applicator using pressures in the range of about 20 to 100 psi.
Another requirement is that the adhesive paste have a time period of workability (gel time) of at least two to three minutes. It also is desirable to have a cure time over which the paste reaches at least 70-80% of its final tensile strength in about 10-30 minutes after application to a foundry shape. This intermediate tensile strength preferably is in the range of about 100 to 150 psi, preferably at least about 125 psi.
In addition to holding foundry shapes together, the adhesive paste should also adhere to metal parts and to the foundry mix used in making mold assembly. Furthermore, since such the mold assembly and other parts may be treated by dipping in a water based solution after adhesion and then heated to a temperature of about 275.degree. F. for about one hour after assembly, the adhesive paste must resist breakdown under the conditions of water treatment and subsequent drying.
U.S. Pat. No. 4,692,479 describes such an adhesive paste. Such adhesive pastes have worked effectively, but they are typically catalyzed with lead catalysts and there is an interest in avoiding the use of such catalysts. They also require solvents in the hydroxyl component and polyisocyanate component. | 2023-09-30T01:26:19.665474 | https://example.com/article/9064 |
What Causes a Burning Sensation in Breast Tissue?
Related Articles
If a woman is consistently experiencing a burning sensation in her breasts, she needs to point this out to her physician because it is possible that the sensation is the outcome of an underlying medical problem, according to Wrongdiagnosis.com.
Parathesia
A burning, prickling, itching or tingling sensation is called parethesia and it may be a sign that sensory nerve damage has occurred. Parethesia occurs for no apparent physical cause.
Nerve Impairment, Diabetes, Trauma, Metal Exposure
A nerve impairment can result in a burning or tingling or needles and pins type of sensation and can be caused by nerve entrapment or pressure being directly applied to a nerve or to the spinal attachment of that nerve. According to Medicues.com, a burning sensation in the breast could be a sign that you have diabetes. It could also be the result of trauma to the nerves in this area or exposure to heavy metals.
Neuropathy
There are several conditions that can cause weird sensory sensations including diabetes, neuropathy, multiple sclerosis and diabetic neuropathy. The Mayo Clinic explains that neuropathy means that some kind of damage has been done to the nerves which results in various symptoms. The damage interferes with the signals between the brain and other parts of the body. As a result, body functions may be increased or decreased or just plain abnormal.
Paget's Disease
According to the Mayo Clinic, there is a condition called Paget's Disease that causes a burning sensation in the breast along with an array of other symptoms including itching, redness, discharge from the nipple, an inverted or flattened nipple, an obvious lump under your nipple or aerola (the skin that surrounds your nipple) and changes to only one breast and nipple. Paget's disease is a condition of the bone. Bone metabolism is altered and old bone is not being recycled into new bone as quickly as it once was. The result of Paget's is that your bone may become frail and easily broken.
Implant Ruptures
Silicone breast implants can rupture. If they do, you may experience a burning sensation in addition to pain or tenderness, tingling swelling and change in your breast size, according to Breastimplantinfo.org.
Cerebrovascular Event
According to Wrongdiagnosis.com, a cerebrovascular event, which occurs when the blood supply to the brain is interrupted and results in cell injury and death at a particular site, can result in a burning sensation.
Not Indicative of Breast Cancer
A burning sensation in the breast is not uncommon, according to Medhelp. org and it doesn't mean that you have breast cancer.
References
About the Author
Cindi Pearce is a graduate of Ohio University, where she received her bachelor’s degree in journalism. She completed both the undergraduate and graduate courses offered by the Institute of Children’s Literature. Pearce has been writing professionally for over 30 years.
Cite this ArticleA tool to create a citation to reference this article Cite this Article | 2023-10-08T01:26:19.665474 | https://example.com/article/9761 |
Your struggles are over. Welcome to my clinic.
This Positive Thinking Clinic is a vital must-read for anyone looking to maximize their success at the pool table.
Also applicable to many other mentally intense sports and activities, this clinic is designed to help amateur players build the strong foundation of mental discipline they need in order to create long-term success in pool and billiards.
If Sun Tzu played pocket billiards, this is how he would apply war strategies and tactics to pocket billiards. Consider that the pool table is really a rectangular battlefield. Your opponent is there to win. Are you? Learn how to be your own general and direct your actions so that you can win more games.
Ethiopia 1972, New York City 1992, and Hong Kong 2032. Three stories set in three different time periods, all sharing the same milieu and mood of rainy streets, discreet nightclubs and watering holes where lost souls meet and part, some violently and others romantically. Love, missed connections, and soulful music mingle with drunken waltzes, warm reveries, new starts and regretful ends.
While arcades are much less common today, they still are profitable for entrepreneurs who move forward with a firm business plan and a set of numbers to support it. We explain why the secret to arcade success is affording the hot new games everyone wants to play, and how you can master that critical aspect of your business.
If you want to know how to get some cash on internet you need to try "TOP 10 Ways To Make Money Online".
This book will teach you all sorts of ways to earn money on internet without much effort,while also teaching you basics of marketing.
You will also get tips of how to get inspired and how to make your own way to earn money online. | 2023-08-10T01:26:19.665474 | https://example.com/article/7099 |
TEL AVIV – Prime Minister Benjamin Netanyahu on Tuesday announced that detention centers for illegal African migrants and asylum seekers would be established following the failure of the government’s deportation plan to third countries.
“Following the refusal of third countries to accept the infiltrators under the conditions demanded by Israel, I agreed with Interior Minister Aryeh Deri to immediately prepare for the reopening of the detention facilities for infiltrators, to advance the [Knesset] override bill to enable us to proceed and promote additional ways to solve this problem,” Netanyahu said in a statement.
The Knesset override clause allows the Interior Ministry to overrule decisions made by the High Court.
A document released Tuesday addressing the High Court said that the government’s plan to deport illegal African migrants against their will to third party countries was “no longer on the agenda.”
The statement also said that migrants with expired temporary residency permits would be able to get their visas renewed.
Uganda recently backtracked on a deal with Israel to absorb several thousand migrants following days of negotiations in Kampala. Earlier in the month, Rwanda also nixed a similar deal.
The immigration authority is still planning to deport the illegal migrants voluntarily.
MKs from the opposition welcomed the collapse of the deportation plan. Zionist Union MK Itzik Shmuli said: “The incitement and threats did nothing to help and justice has won. The nation-state of the Jewish people simply cannot send refugees to an unknown fate.”
MK Shelly Yacimovich said not going through with deportation was saving “Israel from committing a serious and harmful act.”
Earlier this month, only hours after announcing that an agreement had been reached with the UN High Commissioner for Refugees that would have seen roughly half of Israel’s 38,000 illegal African migrants resettled in Western countries and the other half given temporary residency status in the Jewish state, Netanyahu announced he was canceling the deal.
The latest news sparked outrage among residents of south Tel Aviv, many of whom have complained of daily stabbings, robberies and violence which they blame on the illegal migrant community. Neve Sha’anan, where there is a large concentration of illegal migrants, has earned the nickname “Little Africa.” | 2024-03-24T01:26:19.665474 | https://example.com/article/2814 |
Q:
Why is this SVG so blurry?
I have a problem with my SVG:
https://codepen.io/yokogfx/pen/LzaOGp
<svg xmlns="http://www.w3.org/2000/svg" role="img" fill="#fff" aria-label="Test" viewBox="0 0 348.081 96.151" width="148" height="45" version="1.1"><title>Test</title><desc>Test</desc><path class="a" d="M 6.42 95.06 a 3.72 3.72 0 0 1 -2.74 1 H 0 v -11 h 3.68 a 3.72 3.72 0 0 1 2.74 1 c 1.11 1.11 1.06 2.85 1.06 4.33 s 0.05 3.56 -1.06 4.67 Z m -0.59 -8.38 a 3.09 3.09 0 0 0 -2.35 -0.85 H 0.83 v 9.48 h 2.65 a 3.09 3.09 0 0 0 2.35 -0.85 c 0.86 -0.91 0.82 -2.82 0.82 -4 s 0.05 -2.87 -0.82 -3.78 Z M 12.75 85.1 h 0.83 v 11 h -0.83 Z M 19.28 85.1 h 6.65 v 0.74 h -5.82 v 4.33 h 5 v 0.74 h -5 v 4.42 h 5.82 v 0.74 h -6.65 Z M 37.86 86.53 v 9.53 H 37 v -11 h 0.83 l 6.33 9.5 V 85.1 H 45 v 11 h -0.83 Z M 50.71 85.1 h 6.65 v 0.74 h -5.81 v 4.33 h 5 v 0.74 h -5 v 4.42 h 5.82 v 0.74 h -6.66 Z M 65.83 96.15 a 3.55 3.55 0 0 1 -3.76 -3.65 v -7.4 h 0.83 v 7.3 a 2.93 2.93 0 1 0 5.85 0 v -7.3 h 0.83 v 7.4 a 3.55 3.55 0 0 1 -3.75 3.65 Z M 75.13 85.1 h 6.65 v 0.74 H 76 v 4.33 h 5 v 0.74 h -5 v 4.42 h 5.82 v 0.74 h -6.69 Z M 99.3 95.06 a 3.72 3.72 0 0 1 -2.74 1 h -3.68 v -11 h 3.68 a 3.72 3.72 0 0 1 2.74 1 c 1.11 1.11 1.06 2.85 1.06 4.33 s 0.05 3.56 -1.06 4.67 Z m -0.59 -8.38 a 3.09 3.09 0 0 0 -2.36 -0.85 h -2.63 v 9.48 h 2.65 a 3.09 3.09 0 0 0 2.36 -0.85 c 0.86 -0.91 0.82 -2.82 0.82 -4 s 0.03 -2.87 -0.83 -3.78 Z M 105.63 85.1 h 6.65 v 0.74 h -5.82 v 4.33 h 5 v 0.74 h -5 v 4.42 h 5.82 v 0.74 h -6.65 Z M 118 90.35 h 5 v 0.74 h -5 v 5 h -0.83 v -11 h 6.65 v 0.74 H 118 Z M 128.33 85.1 h 0.83 v 11 h -0.83 Z M 135.68 86.53 v 9.53 h -0.83 v -11 h 0.83 L 142 94.6 v -9.5 h 0.83 v 11 H 142 Z M 148.54 85.1 h 0.83 v 11 h -0.83 Z M 157.93 96.06 h -0.83 V 85.84 h -3.26 v -0.74 h 7.37 v 0.74 h -3.28 Z M 165.68 85.1 h 0.83 v 11 h -0.83 Z M 178.27 95 a 3.9 3.9 0 0 1 -5.48 0 c -1 -1 -1 -2 -1 -4.45 s 0 -3.45 1 -4.45 a 3.9 3.9 0 0 1 5.48 0 c 1 1 1 2 1 4.45 s 0 3.45 -1 4.45 Z m -0.66 -8.44 a 3 3 0 0 0 -4.16 0 c -0.78 0.78 -0.85 1.65 -0.85 4 s 0.06 3.2 0.85 4 a 3 3 0 0 0 4.16 0 c 0.79 -0.78 0.85 -1.65 0.85 -4 s -0.07 -3.18 -0.85 -3.97 Z M 185.38 86.53 v 9.53 h -0.83 v -11 h 0.83 l 6.33 9.5 V 85.1 h 0.83 v 11 h -0.83 Z M 206.54 96.06 l -3.6 -11 h 0.88 l 3.08 9.5 l 3.1 -9.46 h 0.88 l -3.6 11 Z M 220.92 95 a 3.9 3.9 0 0 1 -5.48 0 c -1 -1 -1 -2 -1 -4.45 s 0 -3.45 1 -4.45 a 3.9 3.9 0 0 1 5.48 0 c 1 1 1 2 1 4.45 s 0 3.45 -1 4.45 Z m -0.66 -8.44 a 3 3 0 0 0 -4.16 0 c -0.78 0.78 -0.85 1.65 -0.85 4 s 0.06 3.2 0.85 4 a 3 3 0 0 0 4.16 0 c 0.79 -0.78 0.85 -1.65 0.85 -4 s -0.11 -3.18 -0.86 -3.97 Z M 228 86.53 v 9.53 h -0.83 v -11 h 0.83 l 6.33 9.5 V 85.1 h 0.83 v 11 h -0.83 Z M 250 96.06 h -0.83 V 85.84 h -3.26 v -0.74 h 7.37 v 0.74 H 250 Z M 262.3 93.4 h -5.11 l -1 2.66 h -0.89 l 4 -11 h 0.74 l 4 11 h -0.89 Z m -4.85 -0.74 H 262 l -2.29 -6.45 Z M 269.21 86.53 v 9.53 h -0.83 v -11 h 0.83 l 6.33 9.5 V 85.1 h 0.83 v 11 h -0.83 Z M 281.35 95.18 l 5.77 -9.34 h -5.54 v -0.74 H 288 v 0.74 l -5.82 9.48 H 288 v 0.74 h -6.67 Z M 288 45.14 c 0.22 -20.77 -19 -27.76 -32.41 -18.37 v -4.29 h -11.23 v 50.44 h 11.24 V 44.68 c 0.47 -13.65 21.16 -13.5 21.16 0.47 v 27.77 H 288 V 45.14 Z M 92.53 22.5 v 4.9 a 25.83 25.83 0 1 0 0 41.73 v 3.78 h 11.24 V 22.5 Z M 77.3 62.88 a 14.64 14.64 0 1 1 13.57 -9.21 a 14.61 14.61 0 0 1 -13.57 9.21 Z M 167.08 32.18 h 13 v -9.75 h -13 V 10.74 h -11.24 v 11.7 h -7.29 v 9.74 h 7.23 v 19 c 0 0.79 0 1.55 0.06 2.29 a 24.13 24.13 0 0 0 1.46 7.61 a 16.47 16.47 0 0 0 5 6.65 a 23.06 23.06 0 0 0 12.28 5 a 30 30 0 0 0 3.31 0.2 h 1.29 V 62.24 H 177.88 a 11.73 11.73 0 0 1 -6.88 -1.89 a 8.33 8.33 0 0 1 -3.46 -5.28 a 15.14 15.14 0 0 1 -0.44 -3 V 32.18 Z M 223 22.51 v 29.1 a 19.25 19.25 0 0 1 -0.51 5 a 8.33 8.33 0 0 1 -3.49 5.26 a 11.71 11.71 0 0 1 -6.87 1.93 h -0.05 q -5.29 0 -8.14 -3 a 7.89 7.89 0 0 1 -2.14 -3.45 a 23.1 23.1 0 0 1 -0.51 -5.69 v -29 l -11.24 -0.09 v 30.15 a 34 34 0 0 0 0.91 8.22 a 18 18 0 0 0 7.75 9.74 a 24.23 24.23 0 0 0 13.42 3.75 a 24 24 0 0 0 15.6 -5.17 a 16.47 16.47 0 0 0 5 -6.65 a 27.07 27.07 0 0 0 1.52 -9.89 V 22.51 Z M 348.07 63.87 V 22.51 h -11.24 v 4.89 a 25.84 25.84 0 1 0 0 41.73 c 0 4.4 -0.66 8.15 -3.81 11.45 a 14.26 14.26 0 0 1 -23.94 -5.69 l -10.55 3.66 A 25.42 25.42 0 0 0 345.46 82 c 2.93 -5.81 2.61 -11.84 2.61 -18.13 Z m -12.95 -10.21 a 14.45 14.45 0 1 1 1 -5.39 a 14.55 14.55 0 0 1 -1 5.39 Z M 126.49 43.13 v -0.25 c 0.06 -0.32 0.13 -0.63 0.21 -0.95 v -0.16 a 13.06 13.06 0 0 1 12.6 -9.66 c 0.42 0 0.83 0 1.23 0.06 v -9.68 h -0.33 c -5.18 0 -10.59 0.29 -14.07 4.7 v -4.75 H 115 v 50.48 h 11.2 V 47.39 a 30.78 30.78 0 0 1 0.17 -3.39 c 0.03 -0.3 0.07 -0.58 0.12 -0.87 Z M 43.72 45.14 c 0.22 -20.77 -19 -27.76 -32.41 -18.37 V 0 H 0.07 v 72.92 h 11.24 V 44.68 c 0.47 -13.65 21.16 -13.5 21.16 0.47 v 27.77 h 11.25 V 45.14 Z" /></svg>
Do you see that the SVG is blurry / pixelated?
Is there a way to fix this?
A:
If you want that text to look crisp, at such a small size in SVG, the best solution is to tweak the glyph shapes so that the fit within the pixel boundaries better.
The following illustration shows what I mean. In my editor I turned on a 148x45 grid to match the output size. Then I tweaked the character shapes so that they lay within the pixel boundaries better. The black shape is the original path shape, and the grey is the tweaked version. I looked for parts of the glyphs that were spanning the pixel boundary, and adjusted them so that were no longer doing that. You want to especially focus on the vertical and horizontal stems of the glyphs.
In the image below, the right hand side of the "D" is running down a grid line. I shifted that part right a little so it was wholly in the next column of pixels. I could have moved that part left, but I didn't want the character to look too narrow. In the case of the "N" I just shifted it a fraction leftwards.
In the updated example below, the second SVG is my modified version where I have tweaked the first "D", "N" and "F" to show the improvement. I'll leave the rest of the tweaking to you.
body {background:#000}
<svg xmlns="http://www.w3.org/2000/svg" role="img" fill="#fff" aria-label="Test" viewBox="0 0 348.081 96.151" width="148" height="45" version="1.1"><title>Test</title><desc>Test</desc><path class="a" d="M 6.42 95.06 a 3.72 3.72 0 0 1 -2.74 1 H 0 v -11 h 3.68 a 3.72 3.72 0 0 1 2.74 1 c 1.11 1.11 1.06 2.85 1.06 4.33 s 0.05 3.56 -1.06 4.67 Z m -0.59 -8.38 a 3.09 3.09 0 0 0 -2.35 -0.85 H 0.83 v 9.48 h 2.65 a 3.09 3.09 0 0 0 2.35 -0.85 c 0.86 -0.91 0.82 -2.82 0.82 -4 s 0.05 -2.87 -0.82 -3.78 Z M 12.75 85.1 h 0.83 v 11 h -0.83 Z M 19.28 85.1 h 6.65 v 0.74 h -5.82 v 4.33 h 5 v 0.74 h -5 v 4.42 h 5.82 v 0.74 h -6.65 Z M 37.86 86.53 v 9.53 H 37 v -11 h 0.83 l 6.33 9.5 V 85.1 H 45 v 11 h -0.83 Z M 50.71 85.1 h 6.65 v 0.74 h -5.81 v 4.33 h 5 v 0.74 h -5 v 4.42 h 5.82 v 0.74 h -6.66 Z M 65.83 96.15 a 3.55 3.55 0 0 1 -3.76 -3.65 v -7.4 h 0.83 v 7.3 a 2.93 2.93 0 1 0 5.85 0 v -7.3 h 0.83 v 7.4 a 3.55 3.55 0 0 1 -3.75 3.65 Z M 75.13 85.1 h 6.65 v 0.74 H 76 v 4.33 h 5 v 0.74 h -5 v 4.42 h 5.82 v 0.74 h -6.69 Z M 99.3 95.06 a 3.72 3.72 0 0 1 -2.74 1 h -3.68 v -11 h 3.68 a 3.72 3.72 0 0 1 2.74 1 c 1.11 1.11 1.06 2.85 1.06 4.33 s 0.05 3.56 -1.06 4.67 Z m -0.59 -8.38 a 3.09 3.09 0 0 0 -2.36 -0.85 h -2.63 v 9.48 h 2.65 a 3.09 3.09 0 0 0 2.36 -0.85 c 0.86 -0.91 0.82 -2.82 0.82 -4 s 0.03 -2.87 -0.83 -3.78 Z M 105.63 85.1 h 6.65 v 0.74 h -5.82 v 4.33 h 5 v 0.74 h -5 v 4.42 h 5.82 v 0.74 h -6.65 Z M 118 90.35 h 5 v 0.74 h -5 v 5 h -0.83 v -11 h 6.65 v 0.74 H 118 Z M 128.33 85.1 h 0.83 v 11 h -0.83 Z M 135.68 86.53 v 9.53 h -0.83 v -11 h 0.83 L 142 94.6 v -9.5 h 0.83 v 11 H 142 Z M 148.54 85.1 h 0.83 v 11 h -0.83 Z M 157.93 96.06 h -0.83 V 85.84 h -3.26 v -0.74 h 7.37 v 0.74 h -3.28 Z M 165.68 85.1 h 0.83 v 11 h -0.83 Z M 178.27 95 a 3.9 3.9 0 0 1 -5.48 0 c -1 -1 -1 -2 -1 -4.45 s 0 -3.45 1 -4.45 a 3.9 3.9 0 0 1 5.48 0 c 1 1 1 2 1 4.45 s 0 3.45 -1 4.45 Z m -0.66 -8.44 a 3 3 0 0 0 -4.16 0 c -0.78 0.78 -0.85 1.65 -0.85 4 s 0.06 3.2 0.85 4 a 3 3 0 0 0 4.16 0 c 0.79 -0.78 0.85 -1.65 0.85 -4 s -0.07 -3.18 -0.85 -3.97 Z M 185.38 86.53 v 9.53 h -0.83 v -11 h 0.83 l 6.33 9.5 V 85.1 h 0.83 v 11 h -0.83 Z M 206.54 96.06 l -3.6 -11 h 0.88 l 3.08 9.5 l 3.1 -9.46 h 0.88 l -3.6 11 Z M 220.92 95 a 3.9 3.9 0 0 1 -5.48 0 c -1 -1 -1 -2 -1 -4.45 s 0 -3.45 1 -4.45 a 3.9 3.9 0 0 1 5.48 0 c 1 1 1 2 1 4.45 s 0 3.45 -1 4.45 Z m -0.66 -8.44 a 3 3 0 0 0 -4.16 0 c -0.78 0.78 -0.85 1.65 -0.85 4 s 0.06 3.2 0.85 4 a 3 3 0 0 0 4.16 0 c 0.79 -0.78 0.85 -1.65 0.85 -4 s -0.11 -3.18 -0.86 -3.97 Z M 228 86.53 v 9.53 h -0.83 v -11 h 0.83 l 6.33 9.5 V 85.1 h 0.83 v 11 h -0.83 Z M 250 96.06 h -0.83 V 85.84 h -3.26 v -0.74 h 7.37 v 0.74 H 250 Z M 262.3 93.4 h -5.11 l -1 2.66 h -0.89 l 4 -11 h 0.74 l 4 11 h -0.89 Z m -4.85 -0.74 H 262 l -2.29 -6.45 Z M 269.21 86.53 v 9.53 h -0.83 v -11 h 0.83 l 6.33 9.5 V 85.1 h 0.83 v 11 h -0.83 Z M 281.35 95.18 l 5.77 -9.34 h -5.54 v -0.74 H 288 v 0.74 l -5.82 9.48 H 288 v 0.74 h -6.67 Z M 288 45.14 c 0.22 -20.77 -19 -27.76 -32.41 -18.37 v -4.29 h -11.23 v 50.44 h 11.24 V 44.68 c 0.47 -13.65 21.16 -13.5 21.16 0.47 v 27.77 H 288 V 45.14 Z M 92.53 22.5 v 4.9 a 25.83 25.83 0 1 0 0 41.73 v 3.78 h 11.24 V 22.5 Z M 77.3 62.88 a 14.64 14.64 0 1 1 13.57 -9.21 a 14.61 14.61 0 0 1 -13.57 9.21 Z M 167.08 32.18 h 13 v -9.75 h -13 V 10.74 h -11.24 v 11.7 h -7.29 v 9.74 h 7.23 v 19 c 0 0.79 0 1.55 0.06 2.29 a 24.13 24.13 0 0 0 1.46 7.61 a 16.47 16.47 0 0 0 5 6.65 a 23.06 23.06 0 0 0 12.28 5 a 30 30 0 0 0 3.31 0.2 h 1.29 V 62.24 H 177.88 a 11.73 11.73 0 0 1 -6.88 -1.89 a 8.33 8.33 0 0 1 -3.46 -5.28 a 15.14 15.14 0 0 1 -0.44 -3 V 32.18 Z M 223 22.51 v 29.1 a 19.25 19.25 0 0 1 -0.51 5 a 8.33 8.33 0 0 1 -3.49 5.26 a 11.71 11.71 0 0 1 -6.87 1.93 h -0.05 q -5.29 0 -8.14 -3 a 7.89 7.89 0 0 1 -2.14 -3.45 a 23.1 23.1 0 0 1 -0.51 -5.69 v -29 l -11.24 -0.09 v 30.15 a 34 34 0 0 0 0.91 8.22 a 18 18 0 0 0 7.75 9.74 a 24.23 24.23 0 0 0 13.42 3.75 a 24 24 0 0 0 15.6 -5.17 a 16.47 16.47 0 0 0 5 -6.65 a 27.07 27.07 0 0 0 1.52 -9.89 V 22.51 Z M 348.07 63.87 V 22.51 h -11.24 v 4.89 a 25.84 25.84 0 1 0 0 41.73 c 0 4.4 -0.66 8.15 -3.81 11.45 a 14.26 14.26 0 0 1 -23.94 -5.69 l -10.55 3.66 A 25.42 25.42 0 0 0 345.46 82 c 2.93 -5.81 2.61 -11.84 2.61 -18.13 Z m -12.95 -10.21 a 14.45 14.45 0 1 1 1 -5.39 a 14.55 14.55 0 0 1 -1 5.39 Z M 126.49 43.13 v -0.25 c 0.06 -0.32 0.13 -0.63 0.21 -0.95 v -0.16 a 13.06 13.06 0 0 1 12.6 -9.66 c 0.42 0 0.83 0 1.23 0.06 v -9.68 h -0.33 c -5.18 0 -10.59 0.29 -14.07 4.7 v -4.75 H 115 v 50.48 h 11.2 V 47.39 a 30.78 30.78 0 0 1 0.17 -3.39 c 0.03 -0.3 0.07 -0.58 0.12 -0.87 Z M 43.72 45.14 c 0.22 -20.77 -19 -27.76 -32.41 -18.37 V 0 H 0.07 v 72.92 h 11.24 V 44.68 c 0.47 -13.65 21.16 -13.5 21.16 0.47 v 27.77 h 11.25 V 45.14 Z" /></svg>
<br>
<svg xmlns="http://www.w3.org/2000/svg" role="img" fill="#fff" aria-label="Test" viewBox="0 0 348.081 96.151" width="148" height="45" version="1.1"><title>Test</title><desc>Test</desc><path class="a" d="m 7.490133,95.024329 c -0.7391233,0.692428 -1.7286192,1.053558 -2.74,1 L 0,96.06 v -11 l 4.750133,-0.03567 c 1.0113808,-0.05356 2.0008767,0.307572 2.74,1 1.11,1.11 1.06,2.85 1.06,4.33 0,1.48 0.05,3.56 -1.06,4.67 z m -0.59,-8.38 c -0.6287095,-0.60158 -1.4819268,-0.91019 -2.35,-0.85 L 0.83,85.83 v 9.48 l 3.720133,-0.03567 c 0.8680732,0.06019 1.7212905,-0.24842 2.35,-0.85 0.86,-0.91 0.82,-2.82 0.82,-4 0,-1.18 0.05,-2.87 -0.82,-3.78 z M 12.75,85.1 h 0.83 v 11 h -0.83 z m 6.53,0 h 6.65 v 0.74 h -5.82 v 4.33 h 5 v 0.74 h -5 v 4.42 h 5.82 v 0.74 h -6.65 z m 18.080605,1.251644 v 9.53 h -0.86 v -11 h 0.83 l 6.33,9.5 v -9.46 h 0.84 v 11 h -0.83 z M 50.71,85.1 h 6.65 v 0.74 h -5.81 v 4.33 h 5 v 0.74 h -5 v 4.42 h 5.82 v 0.74 h -6.66 z m 15.12,11.05 c -2.082291,0.124333 -3.822469,-1.564936 -3.76,-3.65 v -7.4 h 0.83 v 7.3 c -0.241867,4.134797 6.091867,4.134797 5.85,0 v -7.3 h 0.83 v 7.4 c 0.062,2.08085 -1.671585,3.768206 -3.75,3.65 z m 9.3,-11.05 h 6.65 v 0.74 H 76 v 4.33 h 5 v 0.74 h -5 v 4.42 h 5.82 v 0.74 h -6.69 z m 24.17,9.96 c -0.739123,0.692428 -1.728619,1.053558 -2.74,1 h -3.68 v -11 h 3.68 c 1.011381,-0.05356 2.000877,0.307572 2.74,1 1.11,1.11 1.06,2.85 1.06,4.33 0,1.48 0.05,3.56 -1.06,4.67 z m -0.59,-8.38 c -0.631112,-0.604252 -1.488539,-0.913071 -2.36,-0.85 h -2.63 v 9.48 h 2.65 c 0.871461,0.06307 1.728888,-0.245748 2.36,-0.85 0.86,-0.91 0.82,-2.82 0.82,-4 0,-1.18 0.03,-2.87 -0.83,-3.78 z m 6.92,-1.58 h 6.65 v 0.74 h -5.82 v 4.33 h 5 v 0.74 h -5 v 4.42 h 5.82 v 0.74 h -6.65 z m 11.8706,5.449422 h 5 v 0.74 h -5 v 5 h -0.83 v -11 h 6.65 v 0.74 h -5.82 z M 128.33,85.1 h 0.83 v 11 h -0.83 z m 7.35,1.43 v 9.53 h -0.83 v -11 h 0.83 L 142,94.6 v -9.5 h 0.83 v 11 H 142 Z m 12.86,-1.43 h 0.83 v 11 h -0.83 z m 9.39,10.96 H 157.1 V 85.84 h -3.26 V 85.1 h 7.37 v 0.74 h -3.28 z m 7.75,-10.96 h 0.83 v 11 h -0.83 z m 12.59,9.9 c -1.5189,1.499574 -3.9611,1.499574 -5.48,0 -1,-1 -1,-2 -1,-4.45 0,-2.45 0,-3.45 1,-4.45 1.5189,-1.499574 3.9611,-1.499574 5.48,0 1,1 1,2 1,4.45 0,2.45 0,3.45 -1,4.45 z m -0.66,-8.44 c -1.16151,-1.117532 -2.99849,-1.117532 -4.16,0 -0.78,0.78 -0.85,1.65 -0.85,4 0,2.35 0.06,3.2 0.85,4 1.16151,1.117532 2.99849,1.117532 4.16,0 0.79,-0.78 0.85,-1.65 0.85,-4 0,-2.35 -0.07,-3.18 -0.85,-3.97 z m 7.77,-0.03 v 9.53 h -0.83 v -11 h 0.83 l 6.33,9.5 V 85.1 h 0.83 v 11 h -0.83 z m 21.16,9.53 -3.6,-11 h 0.88 l 3.08,9.5 3.1,-9.46 h 0.88 l -3.6,11 z M 220.92,95 c -1.5189,1.499574 -3.9611,1.499574 -5.48,0 -1,-1 -1,-2 -1,-4.45 0,-2.45 0,-3.45 1,-4.45 1.5189,-1.499574 3.9611,-1.499574 5.48,0 1,1 1,2 1,4.45 0,2.45 0,3.45 -1,4.45 z m -0.66,-8.44 c -1.16151,-1.117532 -2.99849,-1.117532 -4.16,0 -0.78,0.78 -0.85,1.65 -0.85,4 0,2.35 0.06,3.2 0.85,4 1.16151,1.117532 2.99849,1.117532 4.16,0 0.79,-0.78 0.85,-1.65 0.85,-4 0,-2.35 -0.11,-3.18 -0.86,-3.97 z M 228,86.53 v 9.53 h -0.83 v -11 H 228 l 6.33,9.5 V 85.1 h 0.83 v 11 h -0.83 z m 22,9.53 h -0.83 V 85.84 h -3.26 V 85.1 h 7.37 v 0.74 H 250 Z m 12.3,-2.66 h -5.11 l -1,2.66 h -0.89 l 4,-11 h 0.74 l 4,11 h -0.89 z m -4.85,-0.74 H 262 l -2.29,-6.45 z m 11.76,-6.13 v 9.53 h -0.83 v -11 h 0.83 l 6.33,9.5 V 85.1 h 0.83 v 11 h -0.83 z m 12.14,8.65 5.77,-9.34 h -5.54 V 85.1 H 288 v 0.74 l -5.82,9.48 H 288 v 0.74 h -6.67 z M 288,45.14 C 288.22,24.37 269,17.38 255.59,26.77 V 22.48 H 244.36 V 72.92 H 255.6 V 44.68 c 0.47,-13.65 21.16,-13.5 21.16,0.47 V 72.92 H 288 Z M 92.53,22.5 v 4.9 C 75.461286,14.944039 51.474279,27.135676 51.474279,48.265 c 0,21.129324 23.987007,33.320961 41.055721,20.865 v 3.78 h 11.24 V 22.5 Z M 77.3,62.88 C 62.861589,62.905415 57.111416,44.233361 69.053789,36.128036 80.996162,28.022711 96.225216,40.26142 90.87,53.67 88.65887,59.228708 83.282335,62.877779 77.3,62.88 Z m 89.78,-30.7 h 13 v -9.75 h -13 V 10.74 h -11.24 v 11.7 h -7.29 v 9.74 h 7.23 v 19 c 0,0.79 0,1.55 0.06,2.29 0.0735,2.598754 0.56656,5.168548 1.46,7.61 1.07009,2.608043 2.79169,4.897767 5,6.65 3.51559,2.832883 7.78545,4.571426 12.28,5 1.0988,0.127641 2.20382,0.194409 3.31,0.2 h 1.29 V 62.24 h -1.3 c -2.43395,0.09967 -4.83855,-0.560893 -6.88,-1.89 -1.80138,-1.237902 -3.04405,-3.134224 -3.46,-5.28 -0.24668,-0.982757 -0.39409,-1.987796 -0.44,-3 V 32.18 Z M 223,22.51 v 29.1 c 0.0492,1.681793 -0.12222,3.362783 -0.51,5 -0.42822,2.143294 -1.68165,4.032424 -3.49,5.26 -2.03344,1.34241 -4.43498,2.017078 -6.87,1.93 h -0.05 c -3.52667,0 -6.24,-1 -8.14,-3 -1.00205,-0.943648 -1.73981,-2.133022 -2.14,-3.45 -0.40478,-1.868258 -0.57609,-3.779537 -0.51,-5.69 v -29 l -11.24,-0.09 v 30.15 c -0.0323,2.766821 0.27331,5.527237 0.91,8.22 1.34288,4.064977 4.0906,7.518251 7.75,9.74 4.00966,2.537035 8.67598,3.840962 13.42,3.75 5.64639,0.166239 11.17047,-1.664497 15.6,-5.17 2.20831,-1.752233 3.92991,-4.041957 5,-6.65 1.11685,-3.173568 1.63232,-6.527521 1.52,-9.89 V 22.51 Z M 348.07,63.87 V 22.51 h -11.24 v 4.89 c -17.07379,-12.473542 -41.08268,-0.278788 -41.08268,20.865 0,21.143788 24.00889,33.338542 41.08268,20.865 0,4.4 -0.66,8.15 -3.81,11.45 -7.53312,7.872492 -20.75461,4.730041 -23.94,-5.69 l -10.55,3.66 c 3.19664,9.815442 12.01172,16.723049 22.3068,17.479879 C 331.13188,96.786709 340.86234,91.242454 345.46,82 c 2.93,-5.81 2.61,-11.84 2.61,-18.13 z M 335.12,53.66 c -2.72277,6.931623 -10.26807,10.658643 -17.42545,8.608835 -7.15718,-2.04975 -11.58044,-9.204291 -10.22205,-16.526006 1.35839,-7.321716 8.05368,-12.413444 15.46981,-11.759426 7.41634,0.654036 13.12257,6.839596 13.17769,14.286597 0.0112,1.843799 -0.32816,3.672925 -1,5.39 z M 126.49,43.13 v -0.25 c 0.06,-0.32 0.13,-0.63 0.21,-0.95 v -0.16 c 1.53594,-5.696373 6.70019,-9.655634 12.6,-9.66 0.42,0 0.83,0 1.23,0.06 v -9.68 h -0.33 c -5.18,0 -10.59,0.29 -14.07,4.7 V 22.44 H 115 v 50.48 h 11.2 V 47.39 c -0.006,-1.132267 0.051,-2.263987 0.17,-3.39 0.03,-0.3 0.07,-0.58 0.12,-0.87 z M 43.72,45.14 C 43.94,24.37 24.72,17.38 11.31,26.77 V 0 H 0.07 V 72.92 H 11.31 V 44.68 c 0.47,-13.65 21.16,-13.5 21.16,0.47 v 27.77 h 11.25 z" /></svg>
| 2024-03-11T01:26:19.665474 | https://example.com/article/2262 |
Slashdot videos: Now with more Slashdot!
View
Discuss
Share
We've improved Slashdot's video section; now you can view our video interviews, product close-ups and site visits with all the usual Slashdot options to comment, share, etc. No more walled garden! It's a work in progress -- we hope you'll check it out (Learn more about the recent updates).
samzbest writes "According to ComScore's qSearch, Microsoft's retaliation against Google search, Bing, has gained significant market share, now facilitating close to 10% of US searches. That's a gain of two large points in five months."
Yea, because Google's idiotic toolbar being bundled with everything from the end user Java VM to Adobe PDF Reader is so different a tactic.
Well, MS is pushing out updates via OS updates.
I discovered the other day that IE on my XP box had suddenly decided that Bing was its default search engine, despite the fact that I'd previously set it to be Google.
I'm not saying I agree any more with the bundling of such things when you install other software (I don't), but Microsoft has an even more privileged access to my system in that they can push updates and I don't even get asked (other than agreeing to a cumulative security update with a long number and no real explanation). I certainly wasn't asked if IE could change its default search engine or to become the default browser (which has happened on occasion).
I have no doubt that a significant amount of their new-found market share was automatically set for users without their knowledge.
only time Windows Updates ever remotely came close to changing my search page is when it installed IE8 and it went through a wizard the first time I ran it and asked what I wanted my search page to be. Even then, I believe the default option was to keep my old search provider, which was imported from IE7 settings.
You're right, except for one thing: when installing IE8 (doesn't matter if it's from Windows Update, or manually), there is indeed a selection screen where you choose between "Express settings" (which sets your search engine to Bing, among other things) and "Custom settings". But neither one is the default - there is simply no active selection there when the screen loads, and "Next" button is disabled. You have to pick.
It is pretty upfront about what "Express" means, though (it's all listed right on that sc
Put it this way: if Google didn't piggyback on things like Acrobat or Java, they'd be wiped out by Microsoft. Most MSIE updates (and more than a few non-MSIE installs) over the past few years have switched users to MSN/Live/Bing/Whatever-its-called-this-year, and it's not at all easy to straightforward to change MSIE's search provider to Google. Heck, Bing is designed to look enough like Google that users aren't alerted sufficiently to the change
Java is my common irritant with this. Whenever you run the install it hides a checkbox to load some type of crapware by default. I think it actually looks at your computer because it never seems to offer a piece of junk that you already have. It has offered the Google toolbar, MSN toolbar, Open Office, and now:
Bing...
No, Bing [wikipedia.org] is a law professor known for having translated several good science fiction books to Norwegian long ago, and now being completely out of touch, in particular by having spectacularly un-enlightened views on copyright enforcement the need for IP law reform.
Are they only counting the places where people go to the page and do a search or are they counting all the 'embedded' searches which are snuck into other apps like IE and Windows Live to boost numbers?
Google search is embedded into a hojillion websites as well as having browser plugins / toolbars for pretty much every browser. If "embedded searches" are counted it'll probably be to Google's advantage.
(I'm not saying that the study isn't trickery. I wouldn't know either way.)
The trickery should be clear because microsoft is trying to gain marketshare by having articles posted every time they get 1/100^56th of a marketshare increase, even though nobody wants that piece of crap. 3%, 5%, 6%, etc. It's search results are crap even. You didn't hear google publicizing every 1% do ya?
To say they can't means the market isn't growing, which shows your lack of udnerstanding
Um, no, I think the lack is on your part [tvtropes.org]. Even a 100% monopoly can gain sales, but they can't increase market share -- that is, the fraction of the market they reach. If the number of searches doubled, and Bing doubles and Google doubled (pretending they're the only two engines), then their market share remains the same, 10% and 90% respectively.
Reasons? Sure. Any result on things is skewed if it relates to MS. How can you call that "reliable"? There's a reason they call it a decision engine and not a search engine. Also, why do I want something that's been rammed down my throat as a default setting? I'd rather choose my own thing not have *constant* hijacking during every IE security update. Just wait for people to do bing bombs as they call "google bombs", and you'll see even more manipulation.
I'm not going to dig all day, there are others, you don't think the press on this was accidental do you?
Dig all day? We've seen one claim from you that the results for "Least Secure OS" are skewed, when the initial results of both Google and Bing are identical. We've also seen you complain that when you type "Google" into Bing, you don't get the results you want (which apparently are something other than Google). Here for all to see are the comparison results: http://yfrog.com/5hgooglevbingp [yfrog.com]. I think the o
I love your comments. It proves ( at least in my eyes ) corporate evolution. In order to make money, you must improvise, improve and use less resources.
Google, the king of using less resources and improvising, is winning at this time. Microsoft, whom has the resources, is now investing in that side of the business, making themselves better and more productive.
for the end user, this is important, being able to choose whom you want to do your searches with is always a benefit. Now the real question is, the quality of the search results.
I would really enjoy if another search engine would join this field that was as innovative as Google, or had the resources of Microsoft, then a real good fight could happen, and the winner would be the end user.
microsoft is making themselves better and more productive? LOL I seriously hope you are joking. Bing is still very skewed to show positive results for things that MS is interested in gaining marketshare from. It's when people realize this, that they start to have less interest in bing. The only reason it has *any* marketshare beyond like 1% is being embedded and defaulted everywhere.
Microsoft, like EA, has been redeeming themselves for the past couple of years. Much like EA realized they were screwed due to their draconian DRM, Microsoft realized it screwed the pooch with Vista. They really have been turning things around, and they seem to be making their business more nimble and listening to what their customers truly want (excluding WinMo 6.5).
A monster like Microsoft can't change direction on a whim. It takes time. Windows 7 is a decent indicator of where they are headed.
What are you talking about? Dragon Age, their most recent release, has no DRM past an old school serial number and DVD check! There is no online activation required, no install limits, nothing. Now, granted, the downloadable content for it has DRM, but the base game itself has ZERO DRM.
I don't own it, but I believe Sims 3 shipped without DRM as well.
Perhaps you are referring to the Mass Effect and Spore debacles from a year or two ago?
microsoft is making themselves better and more productive? LOL I seriously hope you are joking. Bing is still very skewed to show positive results for things that MS is interested in gaining marketshare from.
I really doubt it. I just did a search for "virtual machines". Something that Microsoft would dearly love to increase its market share in. The first result was a Wikipedia article. The second was VMWare, the third was from Sun, and the 4th was Virtual PC. If they were being biased, don't you think that they would put their product 1st?
Same thing with doing a search for "database servers". On Bing the first result to an actual product is the 5th entry and it's for MySQL. On Google, the first result to an actual product is the 4th entry and it's for Microsoft SQL server.
I could go on, but the reality is the reality is that Bing isn't that bad and no more biased to any of Microsoft's stuff then Google is.
I think the issue isn't so much one of search quality for most people as it is one of trust.
In the past, Microsoft have shown no compunction about distorting their search engine results
to advance their own agenda, and the recent "why is windows so expensive" debacle
suggests that they will probably do so again.
Added to that, there isn't actually anything wrong with Google's results, as such.
Room for improvement to be sure, but the reason I use Google is that it seemed to me to
deliver better results t
And yes, that is not a photochop, those were the real suggestions from bing. More recently they seem to have cleaned up their suggestions for Linux but who knows what other underhanded tactics they are using or what other search terms are "poisoned".
Therefore at least one reason Bing is piece of crap is because of it's evilness!
Nothing wrong inherently with evil, ya know. Nor is there anything inherently wrong with trying to scam off with Google's lunch. It's called 'business as usual', ya know. I checked Bing out when it first started getting airplay on tv, didn't see what all the excitement was about. IIRC, early results were heavily weighted to shill Microsoft products. Big surprise, eh? Now the recent XP/Vista updates toggle default browser search engines to Bing, Win7 ships with default search engine of Bing, any embedded native Windows search uses Bing, and it's a surprise that Bing picked up 10% of the search engine market? Riiiiiiiiiiiiiiiiiight...
Google took years to conquer the market and stomp on Altavista. Microsoft can do it with a click of an update button. Fun, eh? See you Patch Tuesday. And don't forget to click back to Google...
See, this is the asshat comments that drive me away from Slashdot. You stated that about Microsoft/Google in a way to present bias --- that MS is evil and Google is not. Microsoft *did* setup Bing to steal users --- that's how a business gets customers in an established area. You don't see McDonald's saying "No, we'll let them have the 30-39 age group" to KFC.
Google did the exact same thing. Or do you believe that they didn't setup a search engine to steal customers from Yahoo, Altavista, and others
I think it's different in that, Google has offered these things and people used them. Most of the Bing stuff that I have seen have been trying to sneak it in the back door or ram it down my throat. I will not Google for stuff on Bing.
> Are they only counting the places where people go> to the page and do a search or are they counting> all the 'embedded' searches which are snuck into> other apps like IE and Windows Live to boost numbers?
Don't be an idiot. This is Bing we're talking about, not Yahoo. Do you really think 10% of people go to it on purpose? Outside of extreme geekdom, nobody's even heard of it yet.
Basically what this means is IE8 has, mostly as a result of automatic updates, reached about 10% market share among people who think the browser's location bar is a search box and haven't bothered to express an opinion about what search engine it should use. IE8 ships with "Live Search", alias Bing, as the default; IE6 and IE7 used MSN Search as their default, so what we're seeing here is mostly new-version uptake.
There are also a few geeks using it on purpose to try it out, but even if 100% of the slashdot-reading population did that it wouldn't be anywhere near 1% market share, let alone 10%. And the single most popular search engine among the slashdot-reading geekdom is almost certainly still Google at this point.
No, the bulk of the 10% we're talking about here consists of people using the IE8 UI.
These increases are very likely to correlate (causally, no less!) to Infection Explorer 8 being pushed hard, leveraging the majority number of computers that have M-Windows installed.
Capitalism is about having or obtaining a large quantity of something at price P, "talking it up" through Marketing or other bovine excrement until people want it, and then setting new price NP > P when they come asking for it.
Or, in clearer Slashdot format:
1) Have a large install base.2) Push your browser hard onto the install base and set the default page to Bing (just as Google arranged with Mozilla).3) ???? (bovine excrement)4) PROFIT!!!
So you are saying Microsoft is leveraging an existing monopoly to force their way into other markets. Wow, that's pretty clever, and certainly innovative on their part. Surprised they didn't try that earlier.
I see a lot of people on the slickdeals.net and other "hot deals" forums using bing to take advantage of it's cashback ads.
(That is, you buy a product through a bing search, and you get a certain amount of money returned to you)
Also, don't forget that when Windows 7 came to mass market, Microsoft still didn't allow you to change the default search engine from Bing to Google in IE8. I tried several times and MS only allowed you to download 'something' Google-related (some plug-in) from their site that wasn't Google Search for the toolbar. It's only just recently they 'fixed' this.
Anyone who snagged Windows 7 early and was using IE8 (poor deluded souls) would possibly be contributing to this 10%. Since they fixed the 'glitch' maybe
It is worse than that. Let us say that you want Google as the default for said address bar search feature of IE8, and you go to the Microsoft tool for adding said capability and you look for Google, it is no where to be found. WHAT???? They have search tools I have barely heard of listed, but no GOOGLE????
It probably doesn't hurt that IE 8 updates make Bing the default search engine if you go the 'express' route. Even adding google as a search provider is weird - you can't just select it, you have to go to a web page and download the search engine provider package or whatever.
I recently installed the Google search provider in IE8. Not only did I have to "Find More Providers", but Google was hidden on the second page of the default list and mislabeled as "Google Search Suggestions".
Accidents.
I had the same experience - it took some digging to figure out how to make Google the default search provider, and there were several Googles listed on the page where Google eventually showed up and no good information on which to choose. Worse yet, I was in the process of installing Windows 7 and it decided to install updates after I'd done this, and somehow managed to reset the default search provider to Bing in one of those.
I had the same experience - it took some digging to figure out how to make Google the default search provider, and there were several Googles listed on the page where Google eventually showed up and no good information on which to choose.
Can you clarify the latter part? When I click on the dropdown arrow on the right of the search icon in IE, and select "Find More Providers...", it opens this page [ieaddons.com]. Google provider is indeed tucked away on the second page there, but so far as I can see, it's the only one with "Google" in its name.
I wonder if they get that far. I think Google is so fixated in the minds of people that it's hard to get it out. It's even on the homepages of not only younger people but also the digital elderly who are less computer savvy. Bing has to offer more and better search results then Google does before it gains any more then 20% of the market I think.
Don't forget, humans are conservative creatures, they only like changing when it saves money or reduces fat quickly.
It's not really news. Bing is just a rebranding of MSN Search. In June 2007, MSN had a spike of 16% market share (http://blog.compete.com/2007/07/09/june-search-share-msn-live-google-yahoo-ask/). Given the huge marketing behind Bing as well as the conversion of practically all search engines on every site that has anything to do with Microsoft, I would say, meh, no big deal.
Bing is not just a rebrand of Live/MSN Search. When they launched, they added tons of features and introduced new indexing and ranking algorithms that actually bought the results pretty much to same level as Google's, even if not over.
I find it hilarious that - even with the obvious money-under-the-table bias, even with the fact it's shoved in every IE user's face by default (and the fact changing the default on that is deliberately hard and confusing), they can still only get 10%.
Go ahead, you can probably blame some of this on me -- and people like me. I was in the market for an XBox 360 Arcade (with intent to add a HDD on my own) and had found through slick deals mention that if you went to bing and searched for Dell and clicked on the cashback link you could get an XBox 360 Arcade for 15%-30% off depending on when you do it.
Now, from what I read, your mileage may vary. Meaning you got anywhere from $20 to $30 off the price but you still paid $200. It was just recredited to your paypal account. It happened/happens with other large retailers like Amazon so I found myself periodically using Bing to squeeze 10% off a purchase here or there... or even just hitting it up every couple days to see what I could find. Kept with Google on my other searches (Firefox and Chrome still put me through the same default search engine). But for a while, my desire to save a couple bucks probably pushed up Bing's marketshare. I can't help it, I blame my overly frugal parents.
I'm not sure how this was orchestrated. I mean, I thought commodities like DVDs and CDs and XBoxes were already shaven down to the some of the lowest prices online... so what happened and who is giving me the money back? Is it Microsoft putting ad dollars to hard work for Bing or the retailer giving up some more profit margin in exchange for moving product? If anyone could shed light on how I was able to get better deals on -- sometimes any -- products on Amazon by first going through Bing, I'd appreciate it. And this isn't like a few pennies click through ad revenue, this is like tens of dollars across several purchases. Am I really that inept at how the world works to not figure this out?
So in the end, I apologize for causing all that cancer. You are correct to direct your slurs at me but I assure you that as soon as those deals dry up I will stop using Bing.
Funny story on this one. I was talking to someone about Bing Cashback and so he went to bing and tried to navigate the site and find information about the cashback program. However, he couldn't find anything. We tried using the search and the site navigation, and it was nowhere. I knew I had seen the main cashback page, and simply said to just Google it instead. So, yes that's right, he had to Google Bing (and it was the very first result). I think that is an indication of a search engine failing when you have to use another search to even find it.
I've been seeing a lot of machines lately with the Bing Toolbar installed, and the client having no idea how it got there. Automated updates on a Windows machine are nice, but sometimes you get the latest helpful tool bar offering along with it. Sun Java, Adobe Flash, etc. often offer tool bars and other goodies that although are not harmful, might be unwanted. I'm not sure how much this would skew actual results, but it has to count for a few points of market share and larger reported install base of tool bars and hence search engine use.
I've been seeing a lot of machines lately with the Bing Toolbar installed, and the client having no idea how it got there. Automated updates on a Windows machine are nice, but sometimes you get the latest helpful tool bar offering along with it.
Do you mean Live Toolbar?
WU won't install that thing quietly behind your back. You can get "Windows Live Essentials" - which contains the toolbar - via WU, but it's an optional update, meaning it will never get installed automatically - you need to go into list of updates after the check, open the "Optional" tab there, and check the product. Even then it won't install silently - it will download and then run the normal installer, and that will ask which products you'd like to install (granted, it checks the
You can't really compare traffic source percents in to how many users actually use what search engines. Your site may and most likely does rank differently in each search engine, and like you said the democracy of your visitors also affects.
Exactly. MS PAID LOTS of companies to switch to IIS. Problem is, that problems continue so a number of companies have quietly switched back to Apache and other servers, since MS only paid for the switch, not for the continued staying on IIS.
Bing will follow a similiar bell curve as more ppl realize that Bing is simply manipulated results. HOWEVER, it will never go back to flatline. The reason is that it is the default for Windows install. Considering that MSN is pretty much the default for Windows and will
Everyone is speaking of trickery to get the users. I switched my homepage over by choice - and I'm a Mac Safari user.
Reason? Much against my expectation, I found I liked the daily pictures rather than the blank of Google. I fully expected to prefer the clean look of Google (after all, it was that rather than quality of results which made me move from Alta Vista to Google many years ago.) but instead I found it was time for a change and I like the different appearance and the tagging they do I find interesting.
Search quality results - variable. Some good, some not so. It's no effort to just click the search box top-right and start using Google instead however, so effectively by having Bing as the homepage with a quickly accessible Google search I've got quick access to two potential sets of results.
So yes, I switched over for the pretty pictures. Yes, that's a shallow reason. It's doing no harm however, and I like it.
With the Google top 1000 sites being theoretically offered massive cash handouts for abandoning Google it's obvious why consumers would switch to Bing. After all, regular consumers work just like the stock market and adjust their behavior based on any rumor, right?
I'm not sure your two links prove your point. As I age, I'm getting more critical of bad user interfaces.
If you are searching for Google, then you almost certainly want http://www.google.com./ [www.google.com] Might as well show only that as sometimes less is more.
If that isn't what you wanted, click on the other results link just below and you can see lots of other stuff. But really, if you want anything other than the homepage, you are going to have to come up with a better query than "google".
I find myself using Bing quite a bit. The reason - if I'm logged into gmail or Blogger, then Google shows me as logged in when I search in another tab. I can't log out of Google search while staying logged in to gmail or blogger, so I use Bing. Why do I want to log out? I don't really know - it's not like Google can't still identify me, but it just feels icky to have them blatantly flaunt that they track my searches.
A couple of other items of note - for C# programmers, Bing is nicer in that it allows the sharp sign in a search, as opposed to google which doesn't (even though it does a mightly fine job of returning relavent results anyway). And, probably the best feature of Bing is that it's image search is really nice. You just scroll down and more results are loaded. It's worth using Bing for that feature alone.
However, the trouble with numbers like the ones in the article are that very few people will ever use only Bing. Google is still the de facto search engine, and Bing is an alternative for those times when you want something google doesn't do the way you want it to.
Seriously? I don't personally know anyone that uses Bing, and I even know a few people that aren't even aware of its existence.
I know that who I kow is a very small slice of "everyone", but still...where are these legions of people using Bing? Could the fact that many Windows Mobile phones use Bing as their default search engine be contributing to this number?
So many people have such a blinding hate for everything Microsoft that they lose all semblance of moral and logical integrity. Therefore the argument becomes puerile, unfortunately, like many of the replies above.
Anyway, back to the subject: in my opinion Bing is quite good, and has some interesting qualities. Are they enough to make people leave their "google" comfort-zone ? No, not yet. There's nothing revolutionary enough. Anyway, I really wish them well - competition is always welcome.
Note. In my experience one area where Bing really fails badly at this time is searching for references to people. Search for instance for "bruce springsteen" (with quotes). How many hits you get ? In Google you get almost 11 mils. In Bing you get around 4.5 mils. In this case, of course, there's no difference (comparing two almost infinite numbers doesn't make sense - nobody will go past page 10 anyway), but searching for less well-known people will be something else - you'll get, say, 334 hits in Google, and 2 in Bing. Now that's a huge difference ! Some of the 334 hits in google were real hits. Search for instance for your own name, or for the names of your friends, not for "celebs". That's Bing's biggest downside right now, imho.
There is no "1% Linux". Perhaps you're confused by the many distributions of Linux that offer you a choice between a Desktop (ubuntu), a server supporting the latest hardware (Fedora), a server which runs forever (CentOS), a bootable USB... well you get the point. With Linux you have choices.
So please take your attitude over to your 10% bing *LOL* (MSN search down 5 points in two months isn't a "win for bing", it's a LOSS for microsoft) with you and have a home professi
Perhaps you're confused by the many distributions of Linux that offer you a choice between a Desktop (ubuntu), a server supporting the latest hardware (Fedora), a server which runs forever (CentOS)
Since when is Fedora not for desktops?
a bootable USB
By now, most popular distributions' live CDs can be installed to a 1 GB SD card or USB stick using UNetbootin.
But seriously, the "1% desktop Linux" probably measures desktop-like tasks such as web browsing. If a site with wide appeal gets 1% of its hits from web browsers that self-report as having been built for Linux, then close to 1% of web users use Linux.
It's not really default - when you run IE for the first time on a new user account, it'll ask you if you want "Express: Bing Search", or "Custom", with neither checked by default, so you have to pick one to move on. I would imagine that more people who don't know any better pick "Express" though, so there may be something to it.
The problem is that Win7 is still at, what, ~2%? And most of its early adopters are power users or developers, who usually install a different browser pretty much first thing after t | 2024-06-03T01:26:19.665474 | https://example.com/article/9756 |
/*
This file is part of Element
Copyright (C) 2019 Kushview, LLC. All rights reserved.
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 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 General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
*/
#if 0
#include "gui/SequencerClipItem.h"
#include "gui/SequencerComponent.h"
#include "gui/GuiCommon.h"
#include "gui/ContentComponent.h"
#include "session/Session.h"
namespace Element {
SequencerComponent::SequencerComponent (GuiApp &g)
: gui (g)
{
session = gui.session();
setTrackWidth (120);
pos = session->playbackMonitor();
indicator()->setDragable (false);
indicator()->setPosition (pos->get(), false);
state.addListener (this);
state = session->node();
Value tempo = session->getPropertyAsValue (Slugs::tempo);
getTempoValue().referTo (tempo);
startTimer (60);
}
SequencerComponent::~SequencerComponent()
{
state.removeListener (this);
session.reset();
}
void SequencerComponent::clipClicked (TimelineClip *clip, const MouseEvent&)
{
//ContentComponent* cc = findParentComponentOfClass<ContentComponent>();
// cc->stabilize();
}
void SequencerComponent::clipDoubleClicked (TimelineClip *clip, const MouseEvent &clipEvent)
{
#if 0
if (SequencerClipItem* c = dynamic_cast<SequencerClipItem*> (clip))
{
if (ContentComponent* cc = findParentComponentOfClass<ContentComponent>())
{
const String assetId = c->model.getProperty (Slugs::assetId);
AssetItem item (session->assets().root().findItemForId (assetId));
if (item.isValid())
{
Session::Track track (session->getTrack (clip->trackIndex()));
// cc->showScreenForAsset (item);
}
}
}
#endif
}
int SequencerComponent::getNumTracks() const
{
return session->numTracks();
}
bool SequencerComponent::isInterestedInDragSource (const SourceDetails& details)
{
File file (details.description.toString());
return file.existsAsFile();
}
void SequencerComponent::itemDragEnter (const SourceDetails& details)
{
dropTrack = trackAt (details.localPosition);
if (dropTrack > session->numTracks())
dropTrack = session->numTracks();
}
void SequencerComponent::itemDragMove (const SourceDetails& details)
{
dropTrack = trackAt (details.localPosition);
if (dropTrack > session->numTracks())
dropTrack = session->numTracks();
}
void SequencerComponent::itemDragExit (const SourceDetails& details)
{
dropTrack = -1;
}
void SequencerComponent::itemDropped (const SourceDetails& details)
{
const bool droppedOnHeader = details.localPosition.getX() < getTrackWidth();
if (droppedOnHeader)
return;
dropTrack = trackAt (details.localPosition);
if (dropTrack > session->numTracks())
dropTrack = session->numTracks();
if (dropTrack == session->numTracks()) {
session->appendTrack();
}
const File file (details.description.toString());
Session::Track track = session->getTrack (dropTrack);
track.addClip (file, xToTime (details.localPosition.getX ()));
}
void SequencerComponent::paintTrackHeader (Graphics &g, int track, const Rectangle<int> &area)
{
Session::Track t (session->getTrack (track));
if (t.isValid())
{
g.setColour (Colours::lightgrey);
g.fillRect (area);
g.setColour (Colours::darkcyan.contrasting (.95f));
g.drawFittedText (t.getName(), area, Justification::left, 1);
}
}
void SequencerComponent::paintTrackLane (Graphics&, int /*track*/, const Rectangle<int>& /*area*/)
{
}
void SequencerComponent::timerCallback()
{
if (! pos)
pos = session->playbackMonitor();
if (pos)
indicator()->setPosition (pos->get(), false);
}
void SequencerComponent::timelineBodyClicked (const MouseEvent &ev, int track)
{
}
void SequencerComponent::timelineTrackHeadersClicked (const MouseEvent &ev, int t)
{
if (t < session->numTracks())
{
Session::Track track (session->getTrack (t));
if (ev.mods.isPopupMenu())
{
PopupMenu menu;
menu.addItem (1, "Remove Track");
if (menu.show() == 1) {
track.removeFromSession();
repaint();
}
}
}
else
{
if (ev.mods.isPopupMenu())
{
PopupMenu menu;
menu.addItem (1, "Add Audio Track");
//menu.addItem (2, "Add MIDI Track");
menu.addItem (3, "Add Pattern Track");
const int res = menu.show();
if (res >= 1 && res <= 3)
{
session->appendTrack (res == 1 ? "audio" : res == 2 ? "midi" : "pattern");
repaint();
}
}
}
}
void SequencerComponent::valueTreePropertyChanged (ValueTree& tree, const Identifier& property)
{
}
void SequencerComponent::valueTreeChildAdded (ValueTree& parent, ValueTree& child)
{
if (parent.hasType (Slugs::sequence) && child.hasType (Slugs::track))
{
TrackModel t (child);
triggerAsyncUpdate();
}
else if (parent.hasType (Slugs::track) && child.hasType (Slugs::clip))
{
SequencerClipItem* item = nullptr;
TrackModel track (parent);
ClipModel model (child);
assert (model.node().hasProperty ("media"));
const Identifier type (model.node().getProperty ("media", String()));
if (type == Slugs::pattern)
{
}
else {
item = findFreeClip<SequencerClipItem>();
if (! item)
item = new SequencerClipItem (*this, child);
}
if (nullptr != item)
{
item->setModel (model);
addTimelineClip (item, track.index());
clipList.add (item);
}
}
}
void SequencerComponent::valueTreeChildRemoved (ValueTree& parent, ValueTree& child, int)
{
if (parent.hasType (Slugs::sequence) && child.hasType (Slugs::track))
{
valueTreeRedirected (parent);
triggerAsyncUpdate();
}
else if (parent.hasType (Slugs::track) && child.hasType (Slugs::clip))
{
ClipModel clip (child);
for (SequencerClipItem* c : clipList)
if (c->model == clip)
{ recycleSequencerClip (c); break; }
}
}
void SequencerComponent::valueTreeChildOrderChanged (ValueTree& parent, int, int)
{
if (parent == this->state) {
valueTreeRedirected (parent);
}
}
void SequencerComponent::valueTreeParentChanged (ValueTree& tree)
{
}
void SequencerComponent::valueTreeRedirected (ValueTree &tree)
{
if (tree != this->state)
return;
for (SequencerClipItem* c : clipList)
recycleSequencerClip (c);
ScopedPointer<Session::Track> track = new Session::Track (session->getTrack (0));
while (track && track->isValid())
{
ValueTree state = track->state();
for (int c = 0; c < state.getNumChildren(); ++c)
{
ValueTree child (state.getChild (c));
valueTreeChildAdded (state, child);
}
track = new Session::Track (track->next());
}
}
void SequencerComponent::recycleSequencerClip (SequencerClipItem* clip)
{
clipList.removeAllInstancesOf (clip);
clip->reset();
recycleClip (clip);
}
}
#endif
| 2024-02-26T01:26:19.665474 | https://example.com/article/7971 |
You are here
The property owners of 403 Tweedsmuir, the Richmond Plaza Motel, have submitted a Zoning By-Law Amendment application to permit and develop at 6-storey mixed-use building with residential and hotel uses. The building is proposed to have a mix of 24 hotel units and 21 residential units, with the hotel use taking up the first three storeys and the residential units occupying the fourth, fifth and sixth storeys. The proposed development also includes an underground parking garaged proposed to include 25 parking spaces. More details on this application will become available over the coming weeks, and we are hosting an open house for residents to further review details of the proposed project. | 2024-04-26T01:26:19.665474 | https://example.com/article/5854 |
Suzanne Fortier, principal and vice chancellor (the equivalent of president) of McGill University, has issued a statement in which the university formally opposes a "charter of values" proposed by Quebec's government that would bar public employees -- including those who work at universities -- from wearing religious head coverings or "overt" religious symbols. While the proposal could affect many religious people, it is widely viewed as a response to the non-Christian immigrant population in the province. "The proposal to prohibit our professors and staff from wearing visible religious symbols runs contrary to our principles. The wearing of such symbols in no way interferes with the religious and political neutrality of McGill as an institution. All the members of the university community with whom I have spoken on this issue are clearly worried about the proposal, and would like to see it withdrawn," said Fortier's statement. The Montreal Gazette reported that other universities are also concerned about the proposal, but that McGill is the first to take so public a stance. | 2023-11-29T01:26:19.665474 | https://example.com/article/6536 |
OFF
12 20 30
1.000000 0.000000 0.500000
0.540302 0.841471 0.500000
-0.416147 0.909297 0.500000
-0.989992 0.141120 0.500000
-0.653644 -0.756802 0.500000
1.000000 0.000000 -0.500000
0.540302 0.841471 -0.500000
-0.416147 0.909297 -0.500000
-0.989992 0.141120 -0.500000
-0.653644 -0.756802 -0.500000
-0.100000 0.150000 1.000000
-0.100000 0.150000 -0.500000
3 0 1 10 .7 0 0
3 1 2 10 .7 0 0
3 2 3 10 .7 0 0
3 3 4 10 .7 0 0
3 4 0 10 .7 0 0
3 9 8 11 .7 0 0
3 8 7 11 .7 0 0
3 7 6 11 .7 0 0
3 6 5 11 .7 0 0
3 5 9 11 .7 0 0
3 0 5 6 .7 0 0
3 6 1 0 .7 0 0
3 1 6 7 .7 0 0
3 7 2 1 .7 0 0
3 2 7 8 .7 0 0
3 8 3 2 .7 0 0
3 3 8 9 .7 0 0
3 9 4 3 .7 0 0
3 4 9 5 .7 0 0
3 5 0 4 .7 0 0
| 2023-10-06T01:26:19.665474 | https://example.com/article/1153 |
.page
.subttl 'lccwrt1.src'
; write out data buffer
jwright cmp #$10 ; test if write
beq 1$
jmp jvrfy
1$ jsr chkblk ; get block checksum
sta chksum
lda dskcnt ; test for write protect
and #$10
bne 2$ ; not protected
lda #8 ; write protect error
jmp jerrr
2$ jsr bingcr ; convert buffer to write image
jsr jsrch ; find header
ldy #gap1-2 ; wait out header gap
3$ bit pota1
bmi 3$
bit byt_clr
dey ; test if done yet
bne 3$
lda #$ff ; make output $ff
sta ddra2
lda pcr2 ; set write mode
and #$ff-$e0 ; 0=wr
ora #$c0
sta pcr2
lda #$ff ; write 4 gcr sync
ldy #numsyn
sta data2
4$ bit pota1
bmi 4$
bit byt_clr
dey
bne 4$
; write out overflow buffer
ldy #256-topwrt
5$ lda ovrbuf,y ; get a char
6$ bit pota1
bmi 6$
sta data2 ; stuff it
iny
bne 5$ ; do next char
; write rest of buffer
7$ lda (bufpnt),y ; now do buffer
8$ bit pota1 ; wait until ready
bmi 8$
sta data2 ; stuff it again
iny ; test if done
bne 7$ ; do the whole thing
9$ bit pota1 ; wait for last char to write out
bmi 9$
lda pcr2 ; goto read mode
ora #$e0
sta pcr2
lda #0 ; make data2 input $00
sta ddra2
jsr jwtobin ; convert write image to binary
ldy jobn ; make job a verify
;<><><><><><><><><><><><><><><><><><><><><><><><><><><><><><><>
jmp ptch61 ; *** rom ds 05/15/86 ***
; lda jobs,y
;<><><><><><><><><><><><><><><><><><><><><><><><><><><><><><><>
eor #$30
sta jobs,y
jmp jseak ; scan job que
; * jwtobin
; convert write image back to
; binary data
jwtobin lda #0
sta savpnt
sta bufpnt ; lsb for overflow area
sta nxtpnt
lda bufpnt+1
sta nxtbf ; save for next buffer.
lda #>ovrbuf ; overflow first
sta bufpnt+1 ; msb for overflow area
sta savpnt+1
lda #256-topwrt
sta gcrpnt ; offset
sta bytcnt ; ditto
jsr jget4gb ; get first four- id and 3 data
lda btab ; save bid
sta bid
ldy bytcnt
lda btab+1
sta (savpnt),y
iny
lda btab+2
sta (savpnt),y
iny
lda btab+3
sta (savpnt),y
iny
sty bytcnt
; do overflow first and store back into overflow buffer
1$ jsr jget4gb ; do rest of overflow buffer
ldy bytcnt
lda btab
sta (savpnt),y
iny
lda btab+1
sta (savpnt),y
iny
beq 2$
lda btab+2
sta (savpnt),y
iny
lda btab+3
sta (savpnt),y
iny
sty bytcnt
bne 1$ ; jmp till end of overflow buffer
2$ lda btab+2
sta (bufpnt),y
iny
lda btab+3
sta (bufpnt),y
iny
sty bytcnt
3$ jsr jget4gb
ldy bytcnt
lda btab
sta (bufpnt),y
iny
lda btab+1
sta (bufpnt),y
iny
lda btab+2
sta (bufpnt),y
iny
lda btab+3
sta (bufpnt),y
iny
sty bytcnt
cpy #187
bcc 3$
lda #69 ; move buffer up
sta savpnt
lda bufpnt+1
sta savpnt+1
ldy #256-topwrt-1
4$ lda (bufpnt),y
sta (savpnt),y
dey
bne 4$
lda (bufpnt),y
sta (savpnt),y
; load in overflow
ldx #256-topwrt
5$ lda ovrbuf,x
sta (bufpnt),y
iny
inx
bne 5$
stx gcrflg ; clear buffer gcr flag
rts
; * verify data block
; convert to gcr verify image
; test against data block
; convert back to binary
jvrfy cmp #$20 ; test if verify
beq 1$
bne 7$ ; bra
1$ jsr chkblk ; get block checksum
sta chksum
jsr bingcr ; convert to verify image
jsr jdstrt
ldy #256-topwrt
2$ lda ovrbuf,y ; get char
3$ bit pota1
bmi 3$
eor data2 ; test if same
bne 4$ ; verify error
iny
bne 2$ ; next byte
5$ lda (bufpnt),y ; now do buffer
6$ bit pota1
bmi 6$
eor data2 ; test if same
bne 4$ ; error
iny
cpy #$fd ; dont test off bytes
bne 5$
beq 8$ ; bra
7$ jsr jsrch ; sector seek
8$ lda #1
.byte skip2
4$ lda #7 ; verify error
jmp jerrr
| 2023-08-01T01:26:19.665474 | https://example.com/article/4675 |
ADAMANT uses dPoS as a protocol for making consensus in the Blockchain. This document explains how to vote for an ADAMANT delegate. More and stronger votes improves the chances for a delegate to be within the top 101 active delegate spots necessary in-order to forge blocks.
You can vote for any delegate, including your own. To become an ADAMANT delegate, follow the instructions. As an ADAMANT delegate, you can receive fees from block-forging and validating transactions.
Pre-reqs
Everyone user who owns 50 ADM or more is able to vote for a delegate. The voting cost is 50 ADM, and will be deducted from the account in favour of the ADAMANT network (current delegates will forge them).
You can choose to upvote or downvote a delegate (if you want to take your vote away from the delegate you voted for earlier). You can vote for up to 30 delegates at a time, and the cost will be 50 ADM total.
Vote for delegates
Visit msg.adamant.im and enter your passphrase.
Next, click on the Settings button.
On the Settings screen, scroll down to the bottom and click on the Vote for delegates button.
Now you can see all of registered ADAMANT delegates and your votes, if any.
Name is the registered delegate name, and Rank is its position. Only the first 101 delegates forge blocks. Clicking on the arrow to the right of the delegate name will expand additional info, and will help you to make a decision if you want to vote for it.
You can upvote delegates (row color will change to the light: green) and downvote (light red color), checking or unchecking checkboxes.
Then, review your votes and click the Vote button to apply changes.
Remember that you can vote for up to 30 delegates at once, and this will cost you 50 ADM total.
Vote using Console
Voting can also be applied via Console.
It is not a recommended option for regular users.
First install Console, if you haven’t done it earlier. Then run console:
adm
And vote (use public key of your delegate, which can be found in Explorer): | 2023-10-14T01:26:19.665474 | https://example.com/article/5134 |
INTRODUCTION
============
Guizhou, a province in southwest of China, is the center of East-Asia developing karst area with a karst area over 5.5×10^5^ km^2^ and is the largest and the most complex developing karst area in the world ([@b44]). Karst easily causes more rocks and less soil, serious soil erosion, difficult vegetation restoration, frequent drought, flooding disaster and poor moisture storage in the soil. As a result, the development of the regional forests is influenced and local farmers suffer from slow economic development ([@b43]).
Most forests distributed on karst landform are developed from soluble carbonate rocks and usually characterize by high surface rock exposing ratio, separate soil body, shallow topsoil layer and rich calcium ([@b45]). Guizhou had a forest area about 1.6×10^4^ km^2^, with a mean forest coverage ratio of only 11.28% ([@b41]). In some counties, the forest coverage ratio is less than 5%, such as Shuicheng (2.57%), Ziyun (2.46%), Dafang (2.40%), and Zhijin (1.14%) ([@b41]). Due to rock desertification, the forest and soil area in this karst province decrease drastically ([@b42]). Thus, how to protect the forest is vital for improving the local climate and facilitating the economical development of this region.
For several decades, biologists have carried out their investigations on the biodiversity of plant and animal in Guizhou karst region ([@b45]), but few attentions were focused on soil microorganism. Recently, bacterial diversities in soils of various forest ecosystems have been studied based on ARDRA ([@b33]), DGGE ([@b31]), PLFA ([@b9]) analyses and so on. Soil bacterial composition of various vegetations had been reported, such as oak, beech ([@b17]), pine ([@b24]), spruce (4; 12), broad-leaved ([@b10]) and pristine forests (6; 22). However, few studies were focused on the phylogenetic diversity of soil bacteria of karst forest.
Soil bacteria are an essential component of the biotic community in natural forests and they are largely responsible for ecosystem function and diversity of life, but the vast majority of soil bacteria still remain unknown ([@b34]). Enrichment-based and cultural investigations on typical heterotrophic microbes have shown that microbes grow in proportion to less than 1% of total bacteria in an environment ([@b2]). The combination of amplification of bacterial 16S rRNA genes by polymerase chain reaction (PCR) and phylogenetic sequence analysis by restriction fragment length polymorphism (RFLP) has become a powerful tool to investigate natural bacterial communities. The aim of the present study was to characterize the bacterial diversity in soil of karst forest and present the first knowledge to understand bacterial composition in such environment.
MATERIALS AND METHODS
=====================
Site description and sample collection
--------------------------------------
A forest predominantly formed by the plant *Quercus glauca* (25° 47′ N, 107° 48′ E), located in Dushan county, south of Guizhou province, was chosen for study. The mean annual temperature, precipitation and humidity in this region were 18.3ºC, 1320 mm and 80%, respectively. On April 15, 2006, 30 soil samples with a distance of 10 miters from each other were collected from 0\~10 cm depth and mixed thoroughly as one for bacterial community analysis. The soil is black and calcareous, with pH 6.5.
Soil DNA extraction, PCR amplification and cloning
--------------------------------------------------
Soil DNA was extracted with a soil DNA isolation kit (Catalog \#12800-50, MO BIO Laboratories, Inc., USA) following the manufacturer's instructions. Bacterial 16S rRNA genes were amplified by PCR using the combination of bacterial primer 27f (5′ AGA GTT TGA TCC TGG CTC AG 3′) and universal primer 1492r (5′ GGT TAC CTT GTT ACG ACT T 3′) ([@b26]). The PCR reaction was performed in a thermal cycler with the following program: preheating at 95 ºC for 2 minutes, 25 cycles at 98ºC for 1 min, 50ºC for 40 s, 72ºC for 2 min and a final extension of at 72ºC for 10 minutes. The amplified products were purified using an agarose gel DNA purification kit (No. DV805A, Takara Bio Inc., Otsu, Japan). Bacterial 16S rRNA gene amplicon (ca. 1500 bases) was then excised from a 1% agarose gel and eluted with the same kit. Finally, the purified product was ligated into the pMD 18 T-vector (Takara Bio Inc., Otsu, Japan) and the ligation product was transformed into *Escherichia coli* DH-5α competent cells with ampicillin and blue/white screening following manufacturer's instructions.
RFLP analysis
-------------
Inserts of 16S rRNA genes from recombinant clones were reamplified with vector primers M13-M3 (5′ GTAAAACGACGGCCAGT 3′) and M13-RV (5′ CAGGAAACAGCTATGAC 3′). The purified amplifications were subjected to restriction fragment length polymorphism (RFLP) by separate enzymatic digestions with *HhaI* (Takara Bio Inc., Otsu, Japan) and *MspI* (Takara Bio Inc., Otsu, Japan) endonucleases following the manufacturer's instructions, and the digested DNA fragments were electrophoresed in 3% agarose gels. After staining with ethidium bromide, the gels were photographed using an image-capture system UVITEC DBT-08, and scanning image analysis was performed manually.
DNA sequencing and phylogenetic analysis
----------------------------------------
One to three representative clones from each unique RFLP type were selected for sequencing. The 16S rRNA gene inserts were sequenced using plasmid DNA as template and M13-20 (5′ CGACGTTGTAAAACGACGGCCAGT 3′) or M13-RV-P (5′ GGAAACAGCTATGACCATGA TTAC 3′) as sequencing primer. Sequencing was done on an automated ABI 3730 sequencer by Beijng Genomics Institute. The resulting sequences (next to the primer 1492r and at least 600 bp) were compared with those available in GenBank by use of the BLAST method to determine their approximate phylogenetic affiliation and 16S rRNA gene sequence similarities (1; 14). Chimeric sequences were identified by use of the CHECK-CHIMERA program of the Ribosomal Database Project ([@b30]), and by independently comparing the alignments at the beginning and the end of each sequence and the alignments of the entire sequence. Sequences differing only slightly (≤3%) were considered as a phylotype, and each phylotype was represented by a type sequence ([@b19]). Nucleotide sequences were initially aligned using Clustal X ([@b40]) and then manually adjusted. Distance matrices and phylogenetic trees were calculated according to the Kimura two-parameter model ([@b23]) and neighbor-joining ([@b36]) algorithms using the MEGA (version 3.1) software packages ([@b25]). One thousand bootstraps were performed to assign confidence levels to the nodes in the trees.
The 16S rRNA gene sequences have been deposited in the GenBank nucleotide sequence database under Accession Nos. EF141940--EF142065.
Diversity index
---------------
Bacterial diversity was indicated using the Shannon--Weaver index (H′) ([@b38]).
H
\'
=
−
∑
i
=
1
i
=
n
p
i
ln
p
i
*N* is the number of operational taxonomic units (OTU) or RFLPs, and *Pi* is the percentage of clones of the *i*th OTU or the relative abundance of the *i*th RFLP.
RESULTS
=======
Diversity of soil bacteria from the karst forest
------------------------------------------------
A total of 190 recombinant clones were randomly selected, and their 16S rRNA gene inserts were subjected to restriction endonuclease analysis (RFLP), resulting 126 different RFLP types. After sequencing and CHECK-CHIMERA analysis, 126 non-chimeric sequences were obtained, generating 113 phylotypes. Eighty sequences (63.5% of total sequences) each represented a single clone and 35 sequences (27.8%) each represented two clones. Comparative analysis of the retrieved sequences showed that all clones belonged to the *Bacteria* domain. It was determined that most relatives of sequences (101 sequences representing 154 clones, 81.1% of total sequences) were related to sequences from environmental clones and 31 sequences (24.6%) had relatively low levels of similarity (\<94%) with their closest counterparts in the GenBank databases ([Table 1](#tbl1){ref-type="table"}, [Figure 1-3](#fig1){ref-type="fig"}). No sequence was most related to bacterial sequence detected in other forests or karst areas in the public databases except the clone FAC10 (DQ451449) from a Taiwan forest, relative of KF092 and belonging to the *Acidobacteria* ([Figure 2](#fig2){ref-type="fig"}).
{#fig1}
{#fig2}
{#fig3}
######
Distribution of clones and RFLP types or sequences from soil of karst forest
Putative phylogenetic affiliation[^a^](#tf1-1){ref-type="table-fn"} No. of clones \% of clones No. of sequences[^b^](#tf1-2){ref-type="table-fn"} \% of sequences S
--------------------------------------------------------------------- --------------- -------------- ---------------------------------------------------- ----------------- -------
1\. *Proteobacteria* 69 36.4 47 37.2 89-99
1.1 *Alphaproteobacteria* 19 10.0 11 8.7 91-99
1.2 *Betaproteobacteria* 17 9.0 12 9.5 92-99
1.3 *Gammaproteobacteria* 18 9.5 13 10.3 94-99
1.4 *Deltaproteobacteria* 15 7.9 11 8.7 89-99
2\. *Acidobacteria* 45 23.7 26 20.6 90-98
3\. *Planctomycetes* 22 11.6 13 10.3 87-96
4\. *Actinobacteria* 20 10.5 14 11.1 90-99
5\. *Chloroflexi* 5 2.6 4 3.2 85-93
6\. *Bacteroidetes* 7 3.7 6 4.8 94-98
7\. *Verrucomicrobia* 6 3.2 6 4.8 91-97
8\. *Nitrospirae* 7 3.5 5 4.0 95-98
9\. *Firmicutes* 2 1.1 2 1.6 95-97
10.*Candidate division* 7 3.7 3 2.4 89-99
Closest relatives as determined by the BLAST method.
Each sequence representing a single RFLP type. S: The sequence similarity to its closest relatives.
Phylogenetic analysis on the soil bacteria from the karst forest
----------------------------------------------------------------
Phylogenetic analyses placed the 113 phylotypes in the following 10 groups of the domain *Bacteria*: the *Proteobacteria*, *Acidobacteria*, *Planctomycetes*, *Chloroflexi* (Green nonsulfur bacteria), *Bacteroidetes*, *Verrucomicrobia*, *Nitrospirae*, *Actinobacteria* (High G+C Gram-positive bacteria), *Firmicutes* (Low G+C Gram-positive bacteria) and candidate divisions (including the SPAM and GN08) ([Figure 1.-3](#fig1){ref-type="fig"}). Among them, the *Proteobacteria* was the largest group including 69 clones, followed by *Acidobacteria* (45 clones), *Planctomycetes* (22 clones) and *Actinobacteria* (20 clones) ([Table 1](#tbl1){ref-type="table"}).
Proteobacteria
--------------
Sixty-nine clones, represented by 47 sequences and accounting for 36.4% of the clone library, were phylogenetically associated with the following taxa of *Proteobacteria* with similarities between 89%--99%: the *Alphaproteobacteria* (number of sequences, ns=11, number of clones, nc=19), *Betaproteobacteria* (ns=12, nc=17), *Gammaproteobacteria* (ns=13, nc=18) and *Deltaproteobacteria* (ns=11, nc=15) ([Table 1](#tbl1){ref-type="table"}, [Figure 1](#fig1){ref-type="fig"}).
A total of sixteen clones, represented by 10 sequences, were related to cultured members and belonged to putatively *Sphingomonadales* (sequence KF003), *Rhizobiales* (KF091 and KF002), *Rhodospirillales* (KF082), *Nitrosomonadales* (KF088), *Burkholderiales* (KF052 and KF081), *Xanthomonadales* (KF024) and *Pseudomonadales* (KF046 and KF062). Sequences KF040, KF125 and their closest relatives (*Entotheonella* clones) were grouped in a clade with a bootstrap confidence value of 99% ([Figure 1](#fig1){ref-type="fig"}). *Entotheonella*, a new *Deltaproteobacteria* genus, had been found thus far only in sponges of the family *Theonellidae* ([@b37]).
Acidobacteria
-------------
Forty-five clones, represented by 26 sequences and accounting for 23.7% of the clone library, were clustered with the uncultivated bacterial sequences of the *Acidobacteria* with similarities between 90%--98% ([Table 1](#tbl1){ref-type="table"}, [Figure 2](#fig2){ref-type="fig"}). [Figure 2](#fig2){ref-type="fig"} showed a phylogenetic tree of *Acidobacteria*, which was grouped into at least 5 acidobacterial clusters. *Acidobacteria* form a newly devised division of *Bacteria*, probably as diverse as *Proteobacteria* or gram-positive bacteria. The definition of this phylum was based on the analysis of 16S rRNA gene sequences retrieved from cloned rRNA genes and phylogenetically related to several cultivated species such as the Fe (III)-reducing *Geothrix fermentans* (29; 35). The clone F08_WMSP2 (DQ450696), relative of KF099, was detected in Alpine tundra wet meadow soil. The clone DA038 (AJ000986), relative of KF049 respectively, was found from a grassland soil in the Netherlands.
Planctomycetes
--------------
Thirteen sequences, representing 22 clones (11.6% of the clone library), were grouped into the *Planctomycetes*. Seven sequences were related with relatively low similarities between 87%--93% to cultured or uncultured bacterial sequences listed in the GeneBank database ([Table 1](#tbl1){ref-type="table"}, [Figure 2](#fig2){ref-type="fig"}). Molecular microbial ecology has provided new evidence showing that *Planctomycetes* bacteria are ubiquitous and constitute a representative part of the natural bacterial population ([@b20]). The sequence HPDOMI2E12 (AY851885), which was clustered with KF096, was a member from stromatolites of Hamelin Pool in Shark Bay, Western Australia.
Actinobacteria
--------------
Fourteen sequences, representing 20 clones (10.5% of the clone library), were clustered with the *Actinobacteria* ([Table 1](#tbl1){ref-type="table"}, [Figure 3](#fig3){ref-type="fig"}). These bacterial clones were related with similarities between 90%--99% to cultured or uncultured bacterial sequences listed in the GeneBank database. Five sequences were related to classified members and belonged to putatively the *Actinomycetales* (KF043) and *Rubrobacterales* (KF012, KF017, KF066 and KF068).
Chloroflexi (Green nonsulfur bacteria)
--------------------------------------
Four sequences representing 5 clones were related to Chloroflexi sequences listed in the GeneBank database (85%-93% similarity) ([Table 1](#tbl1){ref-type="table"}, [Figure 3](#fig3){ref-type="fig"}). The low similarities to these members indicated that the corresponding bacteria detected in the soil of karst forest belonged to putatively new taxonomic groups.
Bacteroidetes, Verrucomicrobia, Nitrospirae and Firmicutes
----------------------------------------------------------
Six sequences were clustered with the *Bacteroidetes* ([Table 1](#tbl1){ref-type="table"}, [Figure 3](#fig3){ref-type="fig"}). The closest relatives of KF059 and KF036 (KF045) were strains belonging to the *Flavobacteriaceae* and *Sphingobacteriales*, respectively. Some species in the *Flavobacteriaceae* degrade soluble cellulose derivatives, and nine cellulolytic isolates were assigned to *Flavobacterium johnsoniae* ([@b27]). Six sequences were grouped with uncultured bacterial sequences of the *Verrucomicrobia*. Furthermore, five and two sequences were closely related to the *Nitrospirae* and *Firmicutes*, respectively. KF020 and KF054 were related to classified members and belonged to putatively the *Bacillales*.
DISCUSSION
----------
To date, few molecular microbiological data on bacterial community in soil of karst forest were presented. We firstly presented the knowledge on bacterial community and revealed a considerable number of novel and unknown bacterial sequences and a high diversity of putative bacterial communities in this environment. Sequences with low similarities (\<94%) to bacterial sequences listed in the GeneBank database were mainly distributed in *Deltaproteobacteria*, *Acidobacteria*, *Planctomycetes*, *Actinobacteria* and *Chloroflexi* ([Table 1](#tbl1){ref-type="table"}). Clones of the *Proteobacteria*, *Acidobacteria*, *Planctomycetes* and *Actinobacteria* accounted for more than 80% of the clone library, while that of other 6 groups each accounted for less than 4%. That confirmed *Proteobacteria*, *Acidobacteria*, *Planctomycetes* and *Actinobacteria* were absolutely the dominating communities in soil of karst forest. Besides, *Proteobacteria* and *Acidobacteria* were two largest groups (more than 60% of the clone library) ([Table 1](#tbl1){ref-type="table"}).
Diversity of bacterial communities in soil of karst forest was quite different with that in other forests reported until now ([Table 2](#tbl2){ref-type="table"}). The Shannon--Weaver index (H′) of karst forest (2.32) was higher than others forests, including the British Columbia forest. This reflected bacterial diversity in the ecosystem is higher than that in other forests. Karst forest was a relatively fragile ecosystem type ([@b45]). The high bacterial diversity in soil of karst forest could possibly contribute to its tolerance for natural disturbance and self-recovery and regeneration processes.
######
Distribution of bacteria in forest soils investigated by molecular method
Putative phylogenetic affiliation \% of clones from forests with different vegetations and in different locations
------------------------------------------------- --------------------------------------------------------------------------------- ------ ------ ------ ------ ------ ------ ------ ------
1\. *Proteobacteria* 45.0 46.5 55.2 54.1 30.7 12.2 28.0 15.0 36.4
1.1 *Alphaproteobacteria* 27.0 21.0 24.4 40.5 18.4 4.1 3.0 6.0 10.0
1.2 *Betaproteobacteria* 6.0 11.0 19.0 6.8 4.1 2.0 9.0 8.0 9.0
1.3 *Gammaproteobacteria* 6.0 14.0 9.0 4.1 8.2 2.0 12.0 1.0 9.5
1.4 *Deltaproteobacteria* 6.0 0.5 2.8 2.7 4.1 4.0 7.9
2\. *Acidobacteria* 35.0 9.0 18.8 1.4 49.0 48.0 80.0 23.7
3\. *Planctomycetes* 10.0 1.0 1.4 4.1 2.0 13.0 1.0 11.6
4\. *Actinobacteria* 15.0 3.1 36.5 6.1 10.5
5\. *Chloroflexi* 0.5 2.6
6\. *Bacteroidetes* 3.0 3.4 6.1 3.7
7\. *Verrucomicrobia* 10.0 12.0 3.1 6.1 12.2 7.0 1.0 3.2
8\. *Nitrospirae* 3.5
9\. *Firmicutes* 0.5 4.1 22.4 1.1
10\. *Fibrobacter* 18.6
11\. *Chlamydia* 2.0 2.0
12\. *Others*[^b^](#tf2-2){ref-type="table-fn"} 12.5 16.4 2.5 2.0 24.5 4.0 3.0 3.7
H'[^a^](#tf2-1){ref-type="table-fn"} 1.69 2.09 1.92 1.49 1.63 1.99 1.64 0.79 2.32
H' (Shannon--Weaver index) was calculated for estimation of bacterial diversity, using phyla as OUT.
Including candidate divisions, unclassified.
Composition of bacterial communities in soil of karst forest was also unique ([Table 2](#tbl2){ref-type="table"}), which was putatively related to unknown soil environmental variables. Although the forests with broad-leaved in Ailaoshan, Xishuangbanna ([@b10]) and this study site are located in the Southwest of China, their compositions of bacterial communities are totally quite different (except the group of *Betaproteobacteria*, [Table 2](#tbl2){ref-type="table"}). Similar results were obtained from the spruce forests in British Columbia, Canada ([@b4], [@b12]) (especially the difference of *Acidobacteria*, *Actinobacteria* and *Verrucomicrobia*, [Table 2](#tbl2){ref-type="table"}) and from the pristine forests in Brazil ([@b6], [@b22]) (especially the difference of *Proteobacteria*, *Acidobacteria*,*Firmicutes* and *Fibrobacter*, [Table 2](#tbl2){ref-type="table"}). That seemed compositions of bacterial communities from soil of forest were largely independent of vegetation types and geographic distance. But Fierer and Jackson ([@b15]) discussed that bacterial diversity and community composition could largely be explained by soil pH, but unrelated to plant diversity and geographic distance, respectively.
The closest relatives of KF088 and KF112, with a high similarity value of more than 97%, were strains belonging to *Nitrosomonas* and*Nitrospira* respectively ([Figure 1](#fig1){ref-type="fig"}, [3](#fig3){ref-type="fig"}). *Nitrosomonas* is a genus of ammonia-oxidizing proteobacteria ([@b39]). *Nitrospira* strains are the dominant nitrite oxidizers in most environmental samples tested so far ([@b8]). The *Rhizobiales* is famous for nitrogen-fixing bacteria that form nodules on host plants ([@b7]). Some strains of the *Burkholderiales* are capable of nitrogen fixation, such as *Ralstonia* *taiwanensis* ([@b11]). And the closest relative of KF062 was *Cellvibrio* bacteria that are capable of cellulose-degrading, such as *Cellvibrio fulvus* ([@b5]) ([Figure 1](#fig1){ref-type="fig"}). Based on culture-dependent method, Long *et al*. ([@b28]) reported ammonifiers (7.6×10^6^ bacteria per gram soil), nitrobacteria (1.14×10^3^), nitrogen fixing bacteria (1.28×10^3^) and cellulose decomposers (5.68×10^4^) in soil of Maolan karst forest.
The closest relatives of KF091 and KF081 were *Pedomicrobium* and*Leptothrix* strains respectively ([Figure 1](#fig1){ref-type="fig"}). *Pedomicrobium* plays an important role in iron- and manganese-oxidization ([@b16]). *Leptothrix* is known to be capable of oxidizing both iron (II) and manganese (II) to ferric hydroxide and manganese oxide ([@b13]). Relatives of KF113, KF033, KF089 and KF038 are clones detected in coastal marine sediment beneath areas of intensive shellfish aquaculture where sulfur cycle was accelerated ([@b3]). It has been reported that sulfur-oxidizing bacteria play a role in the dissolution of limestone ([@b32]).
The *Acidobacteria* and the *Planctomycetes* were poorly studied phylogenetic divisions that have been detected in many clonal analyses and are thought to be of great ecological significance to many ecosystems (18; 29). But as limited cultivated species, their ecological functions and possible impacts on soils remain unclear at present. Two novel genera of the *Planctomycetes*, Candidatus*Kuenenia stuttgartiensis* and Candidatus *Brocadia annamoxidans* are capable of catalyzing the anaerobic oxidation of ammonium ([@b21]).
Our present study has given a useful insight into bacterial populations in soil of karst forest and can be used as a starting point for in-depth studies. Although studies based on culture-independent methods make more difficult valid statements about the ecological role that clones might play in the environment, such studies will help understand the diversity and structure of bacterial communities in soil of karst forest and contributions of bacteria to the ecosystem.
This work was supported jointly by "National Basic Research Program of China" (2007CB116310, 2007CB411600), NSFC (30760002) and projects of Department of Science and Technology of Yunnan Province (2006XY41, 2006C0005M).
| 2024-07-23T01:26:19.665474 | https://example.com/article/2378 |
Which Stat test should I use?
I have a very simple question but I'm out of practice and can't find the answer anywhere!
Basically, I have 3 different machines I have tested against each other, to see if they give statisticaly significant similar results.
I have put 18 different types of sample though each machine. Each of these 18 samples is actually a mean of approximately 16 values.
I would like to compare these 18 means for each machine to see if the machines are reading similar enough.
How do I do this...? ANOVA etc seem to average up these means and compare those, but i want the samples kept seperate.... | 2024-04-22T01:26:19.665474 | https://example.com/article/5570 |
Observation of the 1/2 power law in Rayleigh-Bénard convection.
The 1/2 power law is reported in a Rayleigh-Bénard experiment: Nu approximately Ra(1/2), where Ra and Nu are the Rayleigh and Nusselt numbers. This observation is coherent with the predictions of the ultimate convection regime, characterized by fully turbulent heat transfers. Ordered rough boundaries are used to cancel the correction due to the thickness variation of the viscous sublayer, and the observation of the asymptotic regime is therefore possible. This result supports the interpretation of a laminar-turbulent boundary-layer transition to account for the observation of Chavanne et al. of a new regime [X. Chavanne et al., Phys. Rev. Lett. 79, 3648 (1997)]. | 2024-01-26T01:26:19.665474 | https://example.com/article/8846 |
Incredibles Syndrome
when everything you send me is "urgent"
then nothing will be | 2024-02-11T01:26:19.665474 | https://example.com/article/5823 |
/**************************************************************************
*
* Copyright 2007 VMware, Inc.
* All Rights Reserved.
*
* Permission is hereby granted, free of charge, to any person obtaining a
* copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* without limitation the rights to use, copy, modify, merge, publish,
* distribute, sub license, and/or sell copies of the Software, and to
* permit persons to whom the Software is furnished to do so, subject to
* the following conditions:
*
* The above copyright notice and this permission notice (including the
* next paragraph) shall be included in all copies or substantial portions
* of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
* OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT.
* IN NO EVENT SHALL VMWARE AND/OR ITS SUPPLIERS BE LIABLE FOR
* ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*
**************************************************************************/
/*
* Authors:
* Keith Whitwell <keithw@vmware.com>
*/
#include "draw/draw_context.h"
#include "draw/draw_gs.h"
#include "draw/draw_private.h"
#include "draw/draw_pt.h"
#include "draw/draw_vbuf.h"
#include "draw/draw_vs.h"
#include "tgsi/tgsi_dump.h"
#include "util/u_math.h"
#include "util/u_prim.h"
#include "util/u_format.h"
#include "util/u_draw.h"
DEBUG_GET_ONCE_BOOL_OPTION(draw_fse, "DRAW_FSE", FALSE)
DEBUG_GET_ONCE_BOOL_OPTION(draw_no_fse, "DRAW_NO_FSE", FALSE)
/* Overall we split things into:
* - frontend -- prepare fetch_elts, draw_elts - eg vsplit
* - middle -- fetch, shade, cliptest, viewport
* - pipeline -- the prim pipeline: clipping, wide lines, etc
* - backend -- the vbuf_render provided by the driver.
*/
static boolean
draw_pt_arrays(struct draw_context *draw,
unsigned prim,
unsigned start,
unsigned count)
{
struct draw_pt_front_end *frontend = NULL;
struct draw_pt_middle_end *middle = NULL;
unsigned opt = 0;
/* Sanitize primitive length:
*/
{
unsigned first, incr;
draw_pt_split_prim(prim, &first, &incr);
count = draw_pt_trim_count(count, first, incr);
if (count < first)
return TRUE;
}
if (!draw->force_passthrough) {
unsigned gs_out_prim = (draw->gs.geometry_shader ?
draw->gs.geometry_shader->output_primitive :
prim);
if (!draw->render) {
opt |= PT_PIPELINE;
}
if (draw_need_pipeline(draw,
draw->rasterizer,
gs_out_prim)) {
opt |= PT_PIPELINE;
}
if ((draw->clip_xy ||
draw->clip_z ||
draw->clip_user) && !draw->pt.test_fse) {
opt |= PT_CLIPTEST;
}
opt |= PT_SHADE;
}
if (draw->pt.middle.llvm) {
middle = draw->pt.middle.llvm;
} else {
if (opt == 0)
middle = draw->pt.middle.fetch_emit;
else if (opt == PT_SHADE && !draw->pt.no_fse)
middle = draw->pt.middle.fetch_shade_emit;
else
middle = draw->pt.middle.general;
}
frontend = draw->pt.frontend;
if (frontend) {
if (draw->pt.prim != prim || draw->pt.opt != opt) {
/* In certain conditions switching primitives requires us to flush
* and validate the different stages. One example is when smooth
* lines are active but first drawn with triangles and then with
* lines.
*/
draw_do_flush( draw, DRAW_FLUSH_STATE_CHANGE );
frontend = NULL;
} else if (draw->pt.eltSize != draw->pt.user.eltSize) {
/* Flush draw state if eltSize changed.
* This could be improved so only the frontend is flushed since it
* converts all indices to ushorts and the fetch part of the middle
* always prepares both linear and indexed.
*/
frontend->flush( frontend, DRAW_FLUSH_STATE_CHANGE );
frontend = NULL;
}
}
if (!frontend) {
frontend = draw->pt.front.vsplit;
frontend->prepare( frontend, prim, middle, opt );
draw->pt.frontend = frontend;
draw->pt.eltSize = draw->pt.user.eltSize;
draw->pt.prim = prim;
draw->pt.opt = opt;
}
if (draw->pt.rebind_parameters) {
/* update constants, viewport dims, clip planes, etc */
middle->bind_parameters(middle);
draw->pt.rebind_parameters = FALSE;
}
frontend->run( frontend, start, count );
return TRUE;
}
void draw_pt_flush( struct draw_context *draw, unsigned flags )
{
assert(flags);
if (draw->pt.frontend) {
draw->pt.frontend->flush( draw->pt.frontend, flags );
/* don't prepare if we only are flushing the backend */
if (flags & DRAW_FLUSH_STATE_CHANGE)
draw->pt.frontend = NULL;
}
if (flags & DRAW_FLUSH_PARAMETER_CHANGE) {
draw->pt.rebind_parameters = TRUE;
}
}
boolean draw_pt_init( struct draw_context *draw )
{
draw->pt.test_fse = debug_get_option_draw_fse();
draw->pt.no_fse = debug_get_option_draw_no_fse();
draw->pt.front.vsplit = draw_pt_vsplit(draw);
if (!draw->pt.front.vsplit)
return FALSE;
draw->pt.middle.fetch_emit = draw_pt_fetch_emit( draw );
if (!draw->pt.middle.fetch_emit)
return FALSE;
draw->pt.middle.fetch_shade_emit = draw_pt_middle_fse( draw );
if (!draw->pt.middle.fetch_shade_emit)
return FALSE;
draw->pt.middle.general = draw_pt_fetch_pipeline_or_emit( draw );
if (!draw->pt.middle.general)
return FALSE;
#if HAVE_LLVM
if (draw->llvm)
draw->pt.middle.llvm = draw_pt_fetch_pipeline_or_emit_llvm( draw );
#endif
return TRUE;
}
void draw_pt_destroy( struct draw_context *draw )
{
if (draw->pt.middle.llvm) {
draw->pt.middle.llvm->destroy( draw->pt.middle.llvm );
draw->pt.middle.llvm = NULL;
}
if (draw->pt.middle.general) {
draw->pt.middle.general->destroy( draw->pt.middle.general );
draw->pt.middle.general = NULL;
}
if (draw->pt.middle.fetch_emit) {
draw->pt.middle.fetch_emit->destroy( draw->pt.middle.fetch_emit );
draw->pt.middle.fetch_emit = NULL;
}
if (draw->pt.middle.fetch_shade_emit) {
draw->pt.middle.fetch_shade_emit->destroy( draw->pt.middle.fetch_shade_emit );
draw->pt.middle.fetch_shade_emit = NULL;
}
if (draw->pt.front.vsplit) {
draw->pt.front.vsplit->destroy( draw->pt.front.vsplit );
draw->pt.front.vsplit = NULL;
}
}
/**
* Debug- print the first 'count' vertices.
*/
static void
draw_print_arrays(struct draw_context *draw, uint prim, int start, uint count)
{
uint i;
debug_printf("Draw arrays(prim = %u, start = %u, count = %u)\n",
prim, start, count);
for (i = 0; i < count; i++) {
uint ii = 0;
uint j;
if (draw->pt.user.eltSize) {
/* indexed arrays */
switch (draw->pt.user.eltSize) {
case 1:
{
const ubyte *elem = (const ubyte *) draw->pt.user.elts;
ii = elem[start + i];
}
break;
case 2:
{
const ushort *elem = (const ushort *) draw->pt.user.elts;
ii = elem[start + i];
}
break;
case 4:
{
const uint *elem = (const uint *) draw->pt.user.elts;
ii = elem[start + i];
}
break;
default:
assert(0);
return;
}
ii += draw->pt.user.eltBias;
debug_printf("Element[%u + %u] + %i -> Vertex %u:\n", start, i,
draw->pt.user.eltBias, ii);
}
else {
/* non-indexed arrays */
ii = start + i;
debug_printf("Vertex %u:\n", ii);
}
for (j = 0; j < draw->pt.nr_vertex_elements; j++) {
uint buf = draw->pt.vertex_element[j].vertex_buffer_index;
ubyte *ptr = (ubyte *) draw->pt.user.vbuffer[buf].map;
if (draw->pt.vertex_element[j].instance_divisor) {
ii = draw->instance_id / draw->pt.vertex_element[j].instance_divisor;
}
ptr += draw->pt.vertex_buffer[buf].buffer_offset;
ptr += draw->pt.vertex_buffer[buf].stride * ii;
ptr += draw->pt.vertex_element[j].src_offset;
debug_printf(" Attr %u: ", j);
switch (draw->pt.vertex_element[j].src_format) {
case PIPE_FORMAT_R32_FLOAT:
{
float *v = (float *) ptr;
debug_printf("R %f @ %p\n", v[0], (void *) v);
}
break;
case PIPE_FORMAT_R32G32_FLOAT:
{
float *v = (float *) ptr;
debug_printf("RG %f %f @ %p\n", v[0], v[1], (void *) v);
}
break;
case PIPE_FORMAT_R32G32B32_FLOAT:
{
float *v = (float *) ptr;
debug_printf("RGB %f %f %f @ %p\n", v[0], v[1], v[2], (void *) v);
}
break;
case PIPE_FORMAT_R32G32B32A32_FLOAT:
{
float *v = (float *) ptr;
debug_printf("RGBA %f %f %f %f @ %p\n", v[0], v[1], v[2], v[3],
(void *) v);
}
break;
case PIPE_FORMAT_B8G8R8A8_UNORM:
{
ubyte *u = (ubyte *) ptr;
debug_printf("BGRA %d %d %d %d @ %p\n", u[0], u[1], u[2], u[3],
(void *) u);
}
break;
case PIPE_FORMAT_A8R8G8B8_UNORM:
{
ubyte *u = (ubyte *) ptr;
debug_printf("ARGB %d %d %d %d @ %p\n", u[0], u[1], u[2], u[3],
(void *) u);
}
break;
default:
debug_printf("other format %s (fix me)\n",
util_format_name(draw->pt.vertex_element[j].src_format));
}
}
}
}
/** Helper code for below */
#define PRIM_RESTART_LOOP(elements) \
do { \
for (j = 0; j < count; j++) { \
i = draw_overflow_uadd(start, j, MAX_LOOP_IDX); \
if (i < elt_max && elements[i] == info->restart_index) { \
if (cur_count > 0) { \
/* draw elts up to prev pos */ \
draw_pt_arrays(draw, prim, cur_start, cur_count); \
} \
/* begin new prim at next elt */ \
cur_start = i + 1; \
cur_count = 0; \
} \
else { \
cur_count++; \
} \
} \
if (cur_count > 0) { \
draw_pt_arrays(draw, prim, cur_start, cur_count); \
} \
} while (0)
/**
* For drawing prims with primitive restart enabled.
* Scan for restart indexes and draw the runs of elements/vertices between
* the restarts.
*/
static void
draw_pt_arrays_restart(struct draw_context *draw,
const struct pipe_draw_info *info)
{
const unsigned prim = info->mode;
const unsigned start = info->start;
const unsigned count = info->count;
const unsigned elt_max = draw->pt.user.eltMax;
unsigned i, j, cur_start, cur_count;
/* The largest index within a loop using the i variable as the index.
* Used for overflow detection */
const unsigned MAX_LOOP_IDX = 0xffffffff;
assert(info->primitive_restart);
if (draw->pt.user.eltSize) {
/* indexed prims (draw_elements) */
cur_start = start;
cur_count = 0;
switch (draw->pt.user.eltSize) {
case 1:
{
const ubyte *elt_ub = (const ubyte *) draw->pt.user.elts;
PRIM_RESTART_LOOP(elt_ub);
}
break;
case 2:
{
const ushort *elt_us = (const ushort *) draw->pt.user.elts;
PRIM_RESTART_LOOP(elt_us);
}
break;
case 4:
{
const uint *elt_ui = (const uint *) draw->pt.user.elts;
PRIM_RESTART_LOOP(elt_ui);
}
break;
default:
assert(0 && "bad eltSize in draw_arrays()");
}
}
else {
/* Non-indexed prims (draw_arrays).
* Primitive restart should have been handled in the state tracker.
*/
draw_pt_arrays(draw, prim, start, count);
}
}
/**
* Resolve true values within pipe_draw_info.
* If we're rendering from transform feedback/stream output
* buffers both the count and max_index need to be computed
* from the attached stream output target.
*/
static void
resolve_draw_info(const struct pipe_draw_info *raw_info,
struct pipe_draw_info *info,
struct pipe_vertex_buffer *vertex_buffer)
{
memcpy(info, raw_info, sizeof(struct pipe_draw_info));
if (raw_info->count_from_stream_output) {
struct draw_so_target *target =
(struct draw_so_target *)info->count_from_stream_output;
assert(vertex_buffer != NULL);
info->count = target->internal_offset / vertex_buffer->stride;
/* Stream output draw can not be indexed */
debug_assert(!info->index_size);
info->max_index = info->count - 1;
}
}
/**
* Draw vertex arrays.
* This is the main entrypoint into the drawing module. If drawing an indexed
* primitive, the draw_set_indexes() function should have already been called
* to specify the element/index buffer information.
*/
void
draw_vbo(struct draw_context *draw,
const struct pipe_draw_info *info)
{
unsigned instance;
unsigned index_limit;
unsigned count;
unsigned fpstate = util_fpstate_get();
struct pipe_draw_info resolved_info;
/* Make sure that denorms are treated like zeros. This is
* the behavior required by D3D10. OpenGL doesn't care.
*/
util_fpstate_set_denorms_to_zero(fpstate);
resolve_draw_info(info, &resolved_info, &(draw->pt.vertex_buffer[0]));
info = &resolved_info;
assert(info->instance_count > 0);
if (info->index_size)
assert(draw->pt.user.elts);
count = info->count;
draw->pt.user.eltBias = info->index_bias;
draw->pt.user.min_index = info->min_index;
draw->pt.user.max_index = info->max_index;
draw->pt.user.eltSize = info->index_size ? draw->pt.user.eltSizeIB : 0;
if (0)
debug_printf("draw_vbo(mode=%u start=%u count=%u):\n",
info->mode, info->start, count);
if (0)
tgsi_dump(draw->vs.vertex_shader->state.tokens, 0);
if (0) {
unsigned int i;
debug_printf("Elements:\n");
for (i = 0; i < draw->pt.nr_vertex_elements; i++) {
debug_printf(" %u: src_offset=%u inst_div=%u vbuf=%u format=%s\n",
i,
draw->pt.vertex_element[i].src_offset,
draw->pt.vertex_element[i].instance_divisor,
draw->pt.vertex_element[i].vertex_buffer_index,
util_format_name(draw->pt.vertex_element[i].src_format));
}
debug_printf("Buffers:\n");
for (i = 0; i < draw->pt.nr_vertex_buffers; i++) {
debug_printf(" %u: stride=%u offset=%u size=%d ptr=%p\n",
i,
draw->pt.vertex_buffer[i].stride,
draw->pt.vertex_buffer[i].buffer_offset,
(int) draw->pt.user.vbuffer[i].size,
draw->pt.user.vbuffer[i].map);
}
}
if (0)
draw_print_arrays(draw, info->mode, info->start, MIN2(count, 20));
index_limit = util_draw_max_index(draw->pt.vertex_buffer,
draw->pt.vertex_element,
draw->pt.nr_vertex_elements,
info);
#if HAVE_LLVM
if (!draw->llvm)
#endif
{
if (index_limit == 0) {
/* one of the buffers is too small to do any valid drawing */
debug_warning("draw: VBO too small to draw anything\n");
util_fpstate_set(fpstate);
return;
}
}
/* If we're collecting stats then make sure we start from scratch */
if (draw->collect_statistics) {
memset(&draw->statistics, 0, sizeof(draw->statistics));
}
draw->pt.max_index = index_limit - 1;
draw->start_index = info->start;
/*
* TODO: We could use draw->pt.max_index to further narrow
* the min_index/max_index hints given by the state tracker.
*/
for (instance = 0; instance < info->instance_count; instance++) {
unsigned instance_idx = instance + info->start_instance;
draw->start_instance = info->start_instance;
draw->instance_id = instance;
/* check for overflow */
if (instance_idx < instance ||
instance_idx < draw->start_instance) {
/* if we overflown just set the instance id to the max */
draw->instance_id = 0xffffffff;
}
draw_new_instance(draw);
if (info->primitive_restart) {
draw_pt_arrays_restart(draw, info);
}
else {
draw_pt_arrays(draw, info->mode, info->start, count);
}
}
/* If requested emit the pipeline statistics for this run */
if (draw->collect_statistics) {
draw->render->pipeline_statistics(draw->render, &draw->statistics);
}
util_fpstate_set(fpstate);
}
| 2023-10-13T01:26:19.665474 | https://example.com/article/8127 |
Catalytic cycloalumination in steroid chemistry II: selective functionalization of 2'-methylidene-2',3'-ethano-(5α)-cholestane.
The catalytic cycloalumination of 2'-methylidene-2',3'-ethano-(5α)-cholestane with Et3Al catalyzed by Cp2ZrCl2 was performed for the first time to give spiro[2',3'-ethano-(5α)-cholestane-2',3″-aluminacyclopentane] in a ~75% yield and with high stereoselectivity (>98%). The obtained cyclic organoaluminum compound was transformed in situ into heterocyclic spiran derivatives of 2',3'-ethano-(5α)-cholestane. | 2023-08-09T01:26:19.665474 | https://example.com/article/9305 |
Dream a Little 40’s Dream With Fresh Retro-Beauty Looks
Posted Oct 18, 2011
In this Beauty-Story for the November Issue of Elle Sweden, Frida Gustavsson makes our 40’s-Dream come true in “Frida About Town.” With all the freshness of a young “Norma-Jean”, our strawberry-blonde starlet is styled with vintage barrel-curls pinned back, and retro-waves that fall gently down her back. With all the innocence of that era, this look is a call-back to a time when a kind of “Sweet-Beauty” ran supreme. With the help of Marc Jacobs, Miu Miu, and Dolce & Gabbana our Vintage-Fantasy is fulfilled, with these amazing looks that come straight off the 40’s “Fashion-Page.”
If you’re loving the Young-Fresh thing, but looking to amp it up, go for a little “Pin-up” Chic, and follow in Frida’s footsteps with a red-hot bold lip. This 40’s Cherry/Red lip is what makes the Retro-Vibe come full-circle. With big doe-eyes highlighted by a taupey lid, ample mascara extends out the top lashes only. Slightly darkened brows frame the face, for a Style-Slam. Find your inner “Retro-Girl” and have a Flirty-Fun-Fall. | 2024-02-27T01:26:19.665474 | https://example.com/article/5008 |
1. Field of the Invention
The present invention relates to integrated circuit packages, and more particularly, to an interposer for a ball grid array (BGA) package having high thermal dissipation, a low coefficient of thermal expansion (CTE) and a high Young's modulus.
2. Description of the Related Art
In the last few decades, the electronics industry has literally transformed the world. Electronic products are used by, or affect the daily lives of, a large segment of the world's population. For example, telephones, televisions, radios, personal computers (PCs), laptop PCs, palmtop PCs, PCs with built-in portable phones, cellular phones, wireless phones, pagers, modems and video camcorders, are just a few of the electronic products that have been developed in recent years and which have been made smaller and more compact, while providing more functions than ever before and/or enhanced functions. The integrated circuit (IC) chip and the more efficient packaging of the IC chip have played key roles in the success of these products.
The IC chip is not an isolated island. It must communicate with other chips in a circuit through an Input/Output (I/O) system of interconnects. Moreover, the IC chip and its embedded circuitry are delicate, and must therefore be protected in a package that can both carry and protect it. As a result, the major functions of the IC package are: (1) to provide a path for the electrical current that powers the circuits on the chip; (2) to distribute the signals on to and off of the chip; (3) to remove the heat generated by the circuit; and (4) to support and protect the chip from hostile environments.
As ICs become more complex and printed circuit boards become more crowded, IC packages continually need more leads or pins while their footprints consume smaller and smaller areas. In an effort to meet these demands, developers created the ball grid array (BGA) package.
A typical BGA package includes an IC affixed to a flexible polyimide tape or interposer. A very thin conductor or wire bond connects a pad on the IC to a conductive trace on the polyimide tape. The conductive trace is routed to a solder ball. The solder ball is one of an array of solder balls mounted to the opposite side of the polyimide tape and protruding from the bottom of the BGA package. These solder balls interconnect with an array of pads located on a substrate, such as a printed circuit board. Accordingly, the typical BGA package electrically connects each pad on an IC to a pad on a printed circuit board.
A variation of the BGA package that has been introduced recently is the Area Tape Automated Bonding (ATAB) Ball Grid Array (BGA) package, or more commonly referred to as simply the Tape Ball Grid Array (TBGA) package. The TBGA package advantageously provides high lead counts, is thin, is lightweight, has high electrical and thermal performance, and has a BGA surface mount. The conventional TBGA package includes a tape containing a polyimide dielectric. At least one layer of the tape is formed into traces or conductors that interconnect a chip to a printed circuit board (PCB). See John H. Lau (Ed.), Ball Grid Array Technology, Chapter 14, “Area Tape Automated Bonding Ball Grid Array Technology” (McGraw-Hill, 1995), incorporated herein by reference.
One particular type of BGA package developed by Tessera is the micro-ball grid array (μBGA) package. The basic package typically includes a package interposer that is a 25 μm thick polyimide film with double-sided copper (Cu). One side of the Cu serves as a ground plane, which the other side has signal traces for I/O redistribution. A layer of silicone elastomer is positioned between the chip and the substrate. This compliant layer typically has a thickness of 150 μm. The first-level interconnects of the μBGA are flexible ribbons which are typically bonded on aluminum (Al) bond pads on the chip by a single-shot thermosonic process. The ribbons are typically 25 μm-wide soft gold (Au) leads with a thickness of 20 to 25 μm, bonded in a lazy-S shape so that they may accommodate any deformation due to thermal expansion. In order to protect the bonded leads, an encapsulant such as a silicone material is dispensed from the back side (between the chip and the interposer) after the lead bonding is completed. The package terminals of the μBGA may be plated bumps, solder balls or solid-core metal spheres. Further details describing the typical μBGA package may be found in John H. Lau, Chip Scale Package, Chapter 16, “Tessera's Micro-Ball Grid Array (μBGA)” (McGraw-Hill, 1999), incorporated herein by reference.
In a typical μBGA manufacturing process, the flexible tape interposer is first provided and tailored from a reel to mount as strips onto a metal frame. The elastomer layer is applied to the tape, and an adhesive material is deposited for die attachment. Die attachment is performed with an automated pick-and-place machine. Subsequently, ribbon leads are bonded to the Al die pads by a thermosonic process. Once the lead bonding is finished, a dry film resist is laminated to the interposer using a vacuum system. The encapsulant is dispensed from the back side, and the curing is performed to complete the encapsulation. The subsequent procedures include dry film exposure and developing, solder-ball attachment and reflow, cleaning, marking, and package singulation. Further details are described in Chapter 16 of John Lau's Chip Scale Package referenced above.
One problem with integrated circuits, including BGA packages, is that they require precise temperature control for efficient operation. Thus, if a package runs too hot, the heat can affect the performance and timing of the device. Accordingly, there is a need for an effective way to maintain control over the temperature of a device and keep it cool.
Another problem in BGA and similar packages is the mismatch in coefficient of thermal expansion (CTE) between the die and the tape or interposer containing the polyimide dielectric. The polyimide tape typically has a much higher coefficient than that of the die to which the tape is bonded. For instance, a die having a CTE of about 3 ppm/° C. may be coupled to a polyimide tape interposer having a CTE of about 20 ppm/° C. or more. This mismatch causes the tape to expand and shrink more rapidly than the die, thereby creating stress on the conductive leads connecting the solder ball array to the die. This stress can lead to breakage of the wire and a corresponding loss of electrical connection between the IC pads. The mismatch in CTE between the interposer and the die can also lead to delamination of the die attach or elastomer layer found therebetween. These problems result in lower yield rates and increase the overall cost of package manufacture. | 2023-08-14T01:26:19.665474 | https://example.com/article/2077 |
Bruce rules out selling big name players
Sunderland boss Steve Bruce insists only a "ridiculous" offer would prompt him to even think about selling one of his key players this month.
Amid speculation that rival clubs could be ready to test his resolve to hang on to the likes of Asamoah Gyan and emerging England international Jordan Henderson, Bruce would only be forced to make a decision by an offer he simply could not refuse.
"Absolutely," he said. "It would take crazy offers for me to consider anything. The ones who are out on loan are the ones where I would envisage there would be a bit of business to be done."
Bruce, with the backing of owner Ellis Short and chairman Niall Quinn, has significantly strengthened his squad with the likes of record £13million-plus signing Gyan and £10million strike-partner Darren Bent, as well as Michael Turner and Titus Bramble among others.
He has hinted that business will be limited in the winter transfer window in the belief that Aston Villa's Stewart Downing, Manchester City's Adam Johnson and Wigan's Charles N'Zogbia will be unavailable.
"As for the big 'uns we have got," he added. "We have worked extremely hard, the chairman and the owner, to get the club in this situation, so the last thing you would want to be doing is dismantling it.
"It would take ridiculous money, absolutely, for us even to think about doing anything."
Those who could move on this month are the likes of George McCartney, David Healy, Nyron Nosworthy, Andy Reid, Matt Kilgallon and Paulo da Silva, who has rejected a move to Mexican club Cruz Azul but also attracted interest from Spain.
Jack Colback's loan spell at Ipswich also comes to an end on January 14, leaving Bruce with another decision.
In the meantime, the manager will concentrate on trying to secure his side's first back-to-back league wins this season at Aston Villa on Wednesday night.
Copyright (c) PA Sport 2009, All Rights Reserved.
Do YOU want to write for GiveMeSport? Get started today by signing-up and submitting an article HERE: http://gms.to/writeforgms
Report author of article
DISCLAIMER
This article has been written by a member of the GiveMeSport Writing Academy and does not represent the views of
GiveMeSport.com or SportsNewMedia. The views and opinions expressed are solely that of the author credited at the top of this article.
GiveMeSport.com and SportsNewMedia do not take any responsibility for the content of its contributors.
Want more content like this?
Like our GiveMeSport Facebook Page and you will get this directly to you. | 2024-03-28T01:26:19.665474 | https://example.com/article/2097 |
Corticotropin-releasing hormone (CRH) is secreted by a hypothalamic region called the paraventricular nucleus (PVN) and acts on CRH receptors in the anterior pituitary to cause the release of adrenocorticotropic hormone (ACTH) into the blood. ACTH acts on the adrenal cortex, which produces and releases cortisol into the blood and participates in maintaining homeostasis throughout the body. CRH also activates the locus ceruleus (LC) which utilizes norepinephrine (NE) and causes further stimulation of the PVN and subsequent release of CRH. It also stimulates the amygdala, which is part of the limbic system.1,2 Elevated brain NE levels and CRH have been implicated in sleep disturbances, including primary insomnia.3,4 NE levels have also been shown to directly correlate to CRH levels, whereby elevated NE results in elevated CRH and low NE results in low CRH.5,6
Along with its numerous actions in the body, cortisol has feedback inhibition on the PVN and anterior pituitary to decrease CRH and ACTH production and release, respectively. Many areas of the brainstem, including the LC, are rich in cortisol receptors, indicating additional negative feedback mechanisms mediated by the cortisol- HPA axis.7,8 Furthermore, the PVN receives GABAergic innervations, which can also inhibit the release of CRH.9 These GABAergic neurons are chiefly opposed by the excitatory neurotransmitter glutamate.7 Therefore, in addition to negative feedback signaling by cortisol, HPA axis regulation also includes NE, GABA, and glutamate modulation.
Normal Sleep Physiology
Normal sleep architecture is characterized by cycles of light sleep, deeper slow-wave sleep, and REM sleep. Light sleep includes stages 1 and stages 2 in the sleep cycle. Stage 1 sleep, the beginning of the sleep cycle, is considered a transition period between wakefulness and sleep. This period of sleep lasts only 5-10 minutes and is characterized by mixed frequency theta waves (very slow brain waves); slow, rolling eye movements; and slightly reduced eye movement and chin electromyography (EMG). Stage 2 lasts for approximately 20 minutes and involves mixed-frequency brain waves with rapid bursts of rhythmic brain wave activity known as sleep spindles. During stage 2, body temperature starts to decrease and heart rate begins to slow. Deeper slow-wave sleep includes stages 3 and 4. Stage 3 sleep is characterized by 20%-50% slow brain waves known as delta waves. It is a transitional period between light sleep and very deep sleep. Stage 4 has greater than 50% delta waves and is sometimes referred to as delta sleep because of the slow brain waves that occur during this time. Stage 4 lasts approximately 30 minutes. The 5th stage of sleep, known as rapid eye movement (REM) sleep, is when most dreaming occurs. Stage 5 is characterized by increased respiration rate and brain activity. REM sleep has mixed frequency EEGs with theta waves in combination with rapid eye movements and nearly absent chin EMG. REM sleep occurs approximately every 90 minutes in adults, with a predominance of slow-wave sleep in the first half of the night and a predominance of REM sleep in the second half.10
Sleep starts out sequentially, but then it cycles through the stages in an out-of-sequence progression. It begins in stage 1 and progresses into stages 2, 3, and 4. After stage 4 sleep, stages 3 and then 2 are repeated before REM (stage 5) sleep begins. The body usually returns to stage 2 sleep after REM sleep is over. The first cycle of REM sleep is about 90 minutes after falling asleep and can last only a very short amount of time. With each cycle, REM sleep lasts longer.
The circadian rhythm of cortisol secretion has a waveform pattern with the nadir for cortisol occurring at about midnight. Cortisol levels start to rise approximately 2-3 hours after sleep onset and continue to rise into the early morning and early waking hours. The peak in cortisol is about 9 a.m.; as the day continues, levels decline gradually. With the onset of sleep, cortisol continues to decline until the nadir. Throughout the cycle, pulsatile secretions of cortisol of various amplitudes occur. Cortisol binds to mineralocorticoid receptors (MRs) and glucocorticoid receptors (GRs) and causes either excitation or inhibition of the PVN depending on the location and type of receptors. Low levels of cortisol in the evening and night are associated with MR binding. When cortisol levels are higher, GRs are activated. In stressful times, NE and GRs may be activated preferentially and thereby increase CRH. This elevated CRH increases sleep EEG frequency, decreases short-wave sleep, and increases light sleep and frequent waking.
Sleep/HPA Axis and Cortisol Rhythm
The initiation of sleep occurs when HPA axis activity is lowest, and sleep deprivation is association with HPA activation. Nighttime awakening is associated with pulsatile cortisol, NE, and CRH release and is followed by a temporary inhibition of cortisol secretion. Cortisol begins to have a rapid rise upon the first morning awakening and continues to rise for about 60 minutes. This phenomenon is called the awakening response.
Dysfunctional HPA axis activity may play a role in some sleep disorders, but in other cases the HPA axis dysfunction is actually the result of a sleep disorder, as seen in obstructive sleep apnea. HPA axis hyperactivity can lead to fragmentation of sleep, decreased slow-wave sleep, and shortened sleep time. To complicate matters, sleep disturbances can worsen HPA axis dysfunction, thereby worsening the cycle. Both insomnia and obstructive sleep apnea are specific sleep disorders that are associated with HPA dysfunction.
Depression and other stress-related disorders are also associated with sleep disturbances, elevated cortisol,11 altered NE levels,12 and HPA axis dysfunction.13 Interestingly, chronic insomnia without depression occurs with elevated cortisol levels, particularly in the evening and the first part of the nighttime sleep period.14-17 This elevation in cortisol may be a primary cause of the sleep disturbance. In addition, the elevated cortisol may be a marker for increased CRH activity and CNS norepinephrine.18-20
In summary, HPA axis hyperactivity can have a negative impact on sleep, leading to sleep fragmentation, decreased deep slow-wave sleep, and shortened sleep time. In turn, sleep problems including insomnia and obstructive sleep apnea can further propagate HPA axis dysfunction.
Interventions to normalize HPA axis abnormalities, decrease nocturnal CRH hyperactivity, and decrease cortisol may be beneficial in treating insomnia and other sleep disorders.
Alternative Approach to Hypercortisol-Induced Sleep Problems
An effective way to manage chronically elevated cortisol levels is to ensure that the adrenal glands are supported by proper nutrition. Vitamin B6, vitamin B5 (pantothenic acid), and vitamin C often become depleted with prolonged hyperactivity of adrenal gland activity and increased production of cortisol.21 These nutrients play a critical role in the optimal functioning of the adrenal gland and in the optimal manufacturing of adrenal hormones. Levels of these nutrients can be diminished during times of stress. For instance, urinary excretion of vitamin C is increased during stress, which is evidence of vitamin C “dumping.” Consequently, additional symptoms may develop with these nutritional deficiencies. Observations and a rich tradition of anecdotal writings and reports supporting this claim have shown that deficiencies in pantothenic acid results in fatigue, headaches, and insomnia. L-tyrosine and L-theanine support the adrenal glands by supporting NE production and are beneficial in combating fatigue and anxiety symptoms related to stress. 22,23 In addition, the cortisol feedback mechanisms are dependent on adequate amounts of calcium, magnesium, potassium, manganese, and zinc. 24 Therefore, supplementation of these nutrients along with other supporting agents, such as L-tyrosine and L-theanine, may help ameliorate some symptoms as well as assist in proper HPA axis functioning.
Ashwagandha (Withania somnifera), also known as Indian ginseng, has been shown to reduce corticosterone, a glucocorticoid hormone present in amphibians, reptiles, rodents, and birds that is structurally similar to cortisol. 25,26 An array of clinical trials and laboratory research also support the use of ashwagandha in enhancing mood, reducing anxiety, and increasing energy. 27-30
Magnolia (Magnolia officinalis), was studied in a randomized, parallel, placebo-controlled study in overweight premenopausal women and resulted in a decrease in transitory anxiety, although salivary cortisol levels were not significantly reduced. 31 Magnolia has been demonstrated to improve mood, increase relaxation, induce a restful sleep, and enhance stress reduction. 32 In an unpublished study conducted at the Living Longer clinic, Cincinnati, Ohio, a proprietary blend of Magnolia officinalis and Phellodendron amurense was shown clinically to normalize the hormone levels associated with stress-induced obesity. It was demonstrated that this combination lowered cortisol levels by 37 percent and increased DHEA by 227 percent.
Phosphatidylserine (PS), also known as lecithin phosphatidylserine, is known to blunt the rise in cortisol and ACTH following strenuous training and significantly reduce both ACTH and cortisol levels after exposure to physical stress. 33,24 Phosphatidylserine also has been shown to improve mood. 35,36
Another approach to improving sleep is targeting GABA activity. Increasing GABA activity will decrease LC, PVN, and resultant HPA axis activity. One method to support GABA functioning is to decrease glutamate signaling. Glutamate and GABA activity oppose each other; therefore, decreasing glutamate activity will support healthy HPA axis activity. L-theanine is a glutamate receptor antagonist and has been shown to decrease brain NE levels secondarily to increasing GABA levels. 37,38 Interestingly, N-acetylcysteine (NAC) is a known precursor for cysteine, necessary for the synthesis of glutathione, 39,40 but also has been shown to decrease glutamate levels. NAC decreases glutamate by enhancing the activity of a cystine/glutamate antiporter. Glutamate is regulated by a cystine/glutamate antiporter that exchanges extraceullular cystine for intracellular glutamate. 41 Ultimately, the actions of this antiporter serve to lessen synaptic glutamate levels. Furthermore, glutamate is involved in immune-cell signaling to increase dendritic cell maturation following the exposure to antigens. To address elevated glutamate at its source, evaluation of intestinal permeabilities, food sensitivities/allergies, and bacterial and/or viral infections need to be considered due their relationship to dendritic cell maturation via increase antigen presence. 42
4-amino-3-phenylbutyric acid is a synthetic amino acid sold as a nutritional supplement that crosses the blood-brain barrier a nd is a GABA agonist. 43 Like many other GABA agonists, 4-amino-3-phenylbutyric acid can promote sleep by stimulating sleep-promoting centers in the brain. It also supports healthy cortisol levels by inhibiting the LC release of NE into the PVN.
Rhodiola rosea is an adaptogenic herb that modulates cortisol. 44 It reduces catecholamine release and prevents catecholamine depletion from the adrenal glands. In addition, research that was conducted in Russia indicates that it may stimulate opioid receptors, 45 which in turn can reduce NE excitability in the PVN and HPA axis activity. 46
Many traditional botanicals (eg, American ginseng, ashwagandha, Asian ginseng, astragalus, cordyceps, reishi, eleutherococcus, holy basil, rhodiola, schisandra, maca, licorice and common nutritional supplements (eg, phosphatidylserine, L-theanine, 4-amino-3-phenylbutyric acid, NAC) have been utilized for their stabilizing effects on the HPA axis. Combination/multi-ingredient formulations are common in a whole-system approach to restoring HPA axis dysfunction, whether to increase or decrease cortisol levels.
Conclusion
Reducing cortisol levels and stabilizing HPA axis dysfunction can be a very effective approach to addressing sleep disturbances, while also reducing the long-term risks associated with elevated cortisol levels.
**Sections of this article are reprinted with permission from Emerson Ecologics.
Disclosures
Tori Hudson, ND, is director of education/research at Vitanica and sits on the scientific advisory boards at ITI, Nordic Naturals, NHI, and Biogenesis. | 2023-11-06T01:26:19.665474 | https://example.com/article/8534 |
CONTEMPORARY DESIGN
About This Project
“Thanks and well done – the first of many I hope!”
This magnificent six bedroom property benefits from one of the most desirable plots on a prestigious private estate in Berkshire.
Our client wanted to replace the existing single-storey house with a contemporary two-storey residence. The site falls within the Green Belt and was therefore subject to strict planning requirements, which have historically prevented schemes of this nature from happening.
Ascot Design’s initial proposal was a high quality modern dwelling designed to our clients’ specific preference and living requirements. Due to the above ground restrictions in floor area, it offered innovative solutions to much of the accommodation. This included guest accommodation at basement level in the style of a boutique hotel, arranged around a sunken courtyard to provide natural daylight.
After planning permission was granted, the client’s circumstances changed and the site had to be sold. Subsequently, our brief took a new direction and we were asked to design a house that would appeal to a wider audience. Following an assessment of the market and advice from estate agents, we designed and secured planning permission for a classically styled house.
This enabled the site to be offered to the open market with two contrasting planning permissions, giving any future buyer a choice of building styles. | 2024-07-02T01:26:19.665474 | https://example.com/article/7409 |
Q:
Doubt on displacement of a parabola(Again)
In another exercise is given:
Find the parabola which is a displacement of $y = 2x^2 - 3x + 4$ which passes though the point $(2, -1)$ and has $x = 1$ as its symmetry axis.
I've reduced the based equation to the form: $y = 2(x - \frac{3}{4})^2 + \frac{23}{8}$, so the vertex is $(\frac{3}{4}, \frac{23}{8})$.
As the displaced equation has its symmetry axes on $x = 1$ it's known that its vertex is $(1, x)$ what can I do more to find the $y$ of the displaced equation ?
Thanks in advance.
EDIT: Corrected the typo
A:
Your equation for the original parabola should read $y = 2\left(x-\dfrac{3}{4}\right)^2+\dfrac{23}{8}$. The displaced parabola will have the equation $y = 2(x-x_v)^2 + y_v$, where $(x_v, y_v)$ is the vertex. Since the axis is $x=1$, $x_v$ is $1$. The point $(2,-1)$ is on the parabola, so we have $-1 = 2(2-1)^2 + y_v \Rightarrow y_v = -1 -2 = -3$. Then, the equation of the displaced parabola is $y = 2(x-1)^2 -3$.
| 2023-09-13T01:26:19.665474 | https://example.com/article/1881 |
Home
“PRESS RELEASE : Resignation of Director”
“Translating Transphobia 2016-2017”
Rainbow Rights Watch is a not-for-profit social justice organisation dedicated to ending inequality, discrimination and violence against transgender Australians.
Rainbow Rights Watch has conducted ongoing monitoring and analysis of the way transgender people are portrayed and represented in the media.
As a result of this analysis, we have compiled the attached report “Translating Transphobia 2016-2017” for your consideration. The report is made up of quantitative and qualitative analyses of digital media reporting by major Australian publications who are members of the Australian Press Council over the period 2016 to 2017 including the period of the Australian Marriage Law Postal Survey.
Key findings from the report show:
a persistence of dehumanising and pejorative language in publications;
a lack of fairness and balance in reporting, especially around matters of medical best practice;
a poor representation of transgender people and experts in reporting of transgender issues; and
an ineffectiveness of editorial policies and industry self regulation to deal with these issues when raised.
Rainbow Rights Watch believes that the prevalence of misinformation and moral panic around transgender issues contributes to public prejudice and discrimination that directly affects transgender people in the following ways:
inadequate access to healthcare;
inability to find employment; and
lack of acceptance in family and society.
Rainbow rights watch is particularly concerned by the link between media portrayals and comment, community prejudice and the self harm and suicide risk highlighted in the Trans Pathways survey results in 2017. | 2023-11-22T01:26:19.665474 | https://example.com/article/4689 |
Annapurna Pictures teams up with Rooney Mara for A HOUSE IN THE SKY
LOS ANGELES, CA, June 25, 2014 /CNW/ - After a competitive pursuit, Annapurna Pictures, in tandem with actress Rooney Mara, has optioned the New York Times bestseller A House in the Sky by co-authors Amanda Lindhout and Sara Corbett. The memoir will be developed as a starring vehicle for Mara, who will also serve as a producer alongside Annapurna's Megan Ellison. Annapurna's Chelsea Barnard will be the executive overseeing the day-to-day development and production of the project.
A House in the Sky is the dramatic and redemptive memoir of Amanda Lindhout, whose deep passion for exploration of the world's most remote and perilous places, took an unexpected turn when she was abducted in 2008 in Mogadishu, Somalia by a rebel terrorist group. An astoundingly intimate and harrowing account of Lindhout's fifteen months in captivity, A House in the Sky illuminates the psychology, motivations, and desperate extremism of her captors all the while as she is kept in chains, nearly starved, and subjected to unthinkable abuse. Published by Scribner, A House in the Sky is an international bestseller and was named by Amazon as one of the top 10 books published in 2013. The book was first brought to the attention of Mara through her team at Management 360 who then approached Annapurna.
"Rooney Mara is someone whose talent and adventurous spirit I admire deeply. I'm thrilled that she's teaming with Annapurna Pictures to bring A House in the Sky to the screen. I can't imagine a better match," says Lindhout.
Rooney Mara is best known for her Academy Award-nominated performance in the David Fincher adaptation of the Steig Larsson trilogy THE GIRL WITH THE DRAGON TATTOO. She recently wrapped production alongside Cate Blanchett in CAROL, the adaptation of Patricia Highsmith's romance novel "The Price of Salt" directed by Todd Haynes. Mara is currently filming PAN where she portrays "Tiger Lily" in Joe Wright's origin story of the classic "Peter Pan."
ICM Partners represents Lindhout and Corbett, and negotiated the sale of the novel with Annapurna's Chris Corabi and Vanessa Fung. Mara is represented by WME and Management 360.
About Annapurna Pictures:Annapurna Pictures is a film production and finance company founded with the goal of boldly creating sophisticated, high-quality and ambitious films that appeal to a variety of audiences. Under Megan Ellison's guidance, Annapurna has provided the industry with a critical boost of intelligent, adult dramas in recent years.
Annapurna's projects from 2013 alone earned 17 Academy Award nominations, and made Ellison the first woman to earn two Best Picture nominations in the same year. Those projects included David O. Russell's AMERICAN HUSTLE starring Christian Bale, Bradley Cooper, Jeremy Renner, Amy Adams and Jennifer Lawrence which was released by Sony in December. The film won three Golden Globe Awards including Best Motion Picture, Musical or Comedy and was nominated for 10 Academy Awards including Best Picture. In addition, Annapurna produced Spike Jonze's HER starring Joaquin Phoenix, Amy Adams and Rooney Mara, also released in December through Warner Bros. HER won multiple critical awards including a Golden Globe for Best Screenplay and the Academy Award for Best Original Screenplay. Annapurna's SPRING BREAKERS, directed by Harmony Korine and starring Selena Gomez, Vanessa Hudgens and James Franco, broke records earning the biggest box office opening weekend of 2013 for a film playing in limited release; and Wong Kar Wai's THE GRANDMASTER, the story of martial arts master and Bruce Lee trainer Ip Man, which was released in August 2013 by The Weinstein Company and was nominated for two Academy Awards.
Later this year, Bennett Miller's FOXCATCHER starring Channing Tatum, Steve Carell, and Mark Ruffalo based on the true story of convicted millionaire murderer John DuPont will be released by Sony Pictures. Additionally, Annapurna has partnered with Nina Jacobson's Color Force on the best-selling comedic novel WHERE'D YOU GO, BERNADETTE?, written by Maria Semple and has partnered with Denver & Delilah and CJ Entertainment on the SYMPATHY FOR LADY VENGEANCE remake written by William Monahan and starring Charlize Theron. Annapurna recently announced they will produce a currently untitled Garbo/Dietrich Television Project from writers Angela Robinson and Alex Kondracke focusing on the intersecting lives of Greta Garbo and Marlene Dietrich. | 2024-05-05T01:26:19.665474 | https://example.com/article/1173 |
Possibility of testing the light dark matter hypothesis with the alpha magnetic spectrometer.
The spectrum and morphology of gamma rays from the Galactic center and the spectrum of synchrotron emission observed from the Milky Way's radio filaments have each been interpreted as possible signals of ∼ 7-10 GeV dark matter particles annihilating in the inner Galaxy. In dark matter models capable of producing these signals, the annihilations should also generate significant fluxes of ∼ 7-10 GeV positrons which can lead to a distinctive bumplike feature in a local cosmic ray positron spectrum. In this Letter, we show that while such a feature would be difficult to detect with PAMELA, it would likely be identifiable by the currently operating Alpha Magnetic Spectrometer experiment. As no known astrophysical (i.e., nondark matter) sources or mechanisms are likely to produce such a sharp feature, the observation of a positron bump at around 7-10 GeV would significantly strengthen the case for a dark matter interpretation of the reported gamma-ray and radio anomalies. | 2024-06-04T01:26:19.665474 | https://example.com/article/4281 |
Life a Fine, Swiss Watch
For eons, people knew what time it was by looking at the shadow cast by a sundial. Sure, the sundial had its disadvantages. You couldn’t wear it easily on your wrist, and on cloudy days, you had to guess at the time by how hungry or drowsy you were. But it was fairly reliable, and certainly difficult to break or wear out.
Then somebody in Switzerland, where the Alps and ski chalets often blocked the sun from the sundial, invented a wristwatch. It was small, portable and just about as reliable as the sun. It too had some disadvantages, however. It needed to be wound occasionally, cleaned every few years and, if a horse stepped on it, it would break. And unlike the sundial, if given enough time, it would simply wear out.
What does this have to do with PFDs?
It’s been nearly a year since the Coast Guard approved certain manufacturers’ automatic inflatable life vests. Like the Swiss watch, the automatic inflatable life vest represents a sort of paradigm shift…a giant leap forward. What remains to be seen is how soon and at what rate will the sundials of boating safety, the traditional forever-buoyant life jackets, give way to the trendy new PFDs.
Although a few problems had surfaced with automatic inflatables prior to the Coast Guard approvals (one manufacturer’s cylinders wouldn’t perforate with another manufacturer’s perforating mechanism, for example), it appears that most manufacturers have worked through those earlier difficulties. As a result, the newly approved manual/automatic inflatables soon may become the hottest new item in the boating safety arena.
The Coast Guard and most states require that a vessel carry at least one wearable CG-approved personal flotation device for each person on board. It has to be in good condition, it must fit the wearer properly, and it must be readily accessible. There are flotation devices on the market, both inflatable and inherently buoyant models, that are not CG-approved, and some of them work very well. But even though you may have these non-approved devices on board and may even choose to wear them, they do not count as meeting the federal or state regulations.
Inflatable PFDs aren’t all automatically inflating, just like all Swiss watches are not battery operated. In fact, there have been CG-approved manually inflatable life vests on the market for some years now. Those vests had to be equipped with a tube for inflating the vest with lungpower, and a manual “pull” cord inflation system. Pulling the cord moves a pointy lever, which punctures a CO2 cartridge, which inflates the PFD. The new automatic inflatables have three ways to inflate the vest. The vest can inflate automatically when the mechanism comes in contact with water, at which time a “tablet” separating the spring-loaded pointy lever quickly dissolves, and the lever punctures the cylinder. You also can pull a cord to inflate the PFD, or blow into the tube.
So far, the new inflatable PFDs are not approved for use by children, and come in adult sizes only. They aren’t suitable for use while participating in water sports or while riding personal watercraft, and it’s still recommended that non-swimmers utilize the traditional, inherently buoyant life jackets.
And finally, the self-actuating vests require a degree of TLC. You’ve got to test the mechanism periodically, check closely to make sure the air-tightness of the vest hasn’t been compromised by a hole or small tear, and make very sure that you never have a spent cylinder in the vest. The Swiss watch needs to be well tended, or just when you need it the most, it will let you down and you’ll lose the time. Of course, if your inflatable PFD doesn’t work when you need it, you could lose much more.
So if you’re ready to make the jump to the state-of-the-art, here are the things to consider.
1. If you want your inflatable PFD to be considered part of the equipment required by federal or state regulations, make certain that it has a label indicating that it’s Coast Guard approved.
2. Make sure your inflatable PFD comes packaged with instructions on the care and maintenance of your life vest. Read it, and follow it.
3. Will your use of the vest be worth the expense? Most automatic inflatable PFDs are more than $100. Will an inherently buoyant vest at less than half that cost serve your purposes just as well?
If you decide in favor of an inflatable, I know you’ll enjoy the freedom of movement and the lightness of this newest boating safety product. That is, of course, if you wear it. If you don’t wear it, you might as well tell the time with a sundial. | 2024-06-17T01:26:19.665474 | https://example.com/article/4307 |
// The MIT License (MIT)
//
// Copyright (c) 2014 YIOM
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
// copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in
// all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
// THE SOFTWARE.
function Sketchpad(config) {
// Enforces the context for all functions
for (var key in this.constructor.prototype) {
this[key] = this[key].bind(this);
}
// Warn the user if no DOM element was selected
if (!config.hasOwnProperty('element')) {
console.error('SKETCHPAD ERROR: No element selected');
return;
}
this.element = config.element;
// Width can be defined on the HTML or programatically
this._width = config.width || $(this.element).attr('data-width') || 0;
this._height = config.height || $(this.element).attr('data-height') || 0;
// Pen attributes
this.color = config.color || $(this.element).attr('data-color') || '#000000';
this.penSize = config.penSize || $(this.element).attr('data-penSize') || 5;
// ReadOnly sketchpads may not be modified
this.readOnly = config.readOnly ||
$(this.element).attr('data-readOnly') ||
false;
if (!this.readOnly) {
$(this.element).css({cursor: 'crosshair'});
}
// Stroke control variables
this.strokes = config.strokes || [];
this._currentStroke = {
color: null,
size: null,
lines: [],
};
// Undo History
this.undoHistory = config.undoHistory || [];
// Animation function calls
this.animateIds = [];
// Set sketching state
this._sketching = false;
// Setup canvas sketching listeners
this.reset();
}
//
// Private API
//
Sketchpad.prototype._cursorPosition = function(event) {
return {
x: event.pageX - $(this.canvas).offset().left,
y: event.pageY - $(this.canvas).offset().top,
};
};
Sketchpad.prototype._draw = function(start, end, color, size) {
this._stroke(start, end, color, size, 'source-over');
};
Sketchpad.prototype._erase = function(start, end, color, size) {
this._stroke(start, end, color, size, 'destination-out');
};
Sketchpad.prototype._stroke = function(start, end, color, size, compositeOperation) {
this.context.save();
this.context.lineJoin = 'round';
this.context.lineCap = 'round';
this.context.strokeStyle = color;
this.context.lineWidth = size;
this.context.globalCompositeOperation = compositeOperation;
this.context.beginPath();
this.context.moveTo(start.x, start.y);
this.context.lineTo(end.x, end.y);
this.context.closePath();
this.context.stroke();
this.context.restore();
};
//
// Callback Handlers
//
Sketchpad.prototype._mouseDown = function(event) {
this._lastPosition = this._cursorPosition(event);
this._currentStroke.color = this.color;
this._currentStroke.size = this.penSize;
this._currentStroke.lines = [];
this._sketching = true;
this.canvas.addEventListener('mousemove', this._mouseMove);
};
Sketchpad.prototype._mouseUp = function(event) {
if (this._sketching) {
this.strokes.push($.extend(true, {}, this._currentStroke));
this._sketching = false;
}
this.canvas.removeEventListener('mousemove', this._mouseMove);
};
Sketchpad.prototype._mouseMove = function(event) {
var currentPosition = this._cursorPosition(event);
this._draw(this._lastPosition, currentPosition, this.color, this.penSize);
this._currentStroke.lines.push({
start: $.extend(true, {}, this._lastPosition),
end: $.extend(true, {}, currentPosition),
});
this._lastPosition = currentPosition;
};
Sketchpad.prototype._touchStart = function(event) {
event.preventDefault();
if (this._sketching) {
return;
}
this._lastPosition = this._cursorPosition(event.changedTouches[0]);
this._currentStroke.color = this.color;
this._currentStroke.size = this.penSize;
this._currentStroke.lines = [];
this._sketching = true;
this.canvas.addEventListener('touchmove', this._touchMove, false);
};
Sketchpad.prototype._touchEnd = function(event) {
event.preventDefault();
if (this._sketching) {
this.strokes.push($.extend(true, {}, this._currentStroke));
this._sketching = false;
}
this.canvas.removeEventListener('touchmove', this._touchMove);
};
Sketchpad.prototype._touchCancel = function(event) {
event.preventDefault();
if (this._sketching) {
this.strokes.push($.extend(true, {}, this._currentStroke));
this._sketching = false;
}
this.canvas.removeEventListener('touchmove', this._touchMove);
};
Sketchpad.prototype._touchLeave = function(event) {
event.preventDefault();
if (this._sketching) {
this.strokes.push($.extend(true, {}, this._currentStroke));
this._sketching = false;
}
this.canvas.removeEventListener('touchmove', this._touchMove);
};
Sketchpad.prototype._touchMove = function(event) {
event.preventDefault();
var currentPosition = this._cursorPosition(event.changedTouches[0]);
this._draw(this._lastPosition, currentPosition, this.color, this.penSize);
this._currentStroke.lines.push({
start: $.extend(true, {}, this._lastPosition),
end: $.extend(true, {}, currentPosition),
});
this._lastPosition = currentPosition;
};
//
// Public API
//
Sketchpad.prototype.reset = function() {
// Set attributes
this.canvas = $(this.element)[0];
this.canvas.width = this._width;
this.canvas.height = this._height;
this.context = this.canvas.getContext('2d');
// Setup event listeners
this.redraw(this.strokes);
if (this.readOnly) {
return;
}
// Mouse
this.canvas.addEventListener('mousedown', this._mouseDown);
this.canvas.addEventListener('mouseout', this._mouseUp);
this.canvas.addEventListener('mouseup', this._mouseUp);
// Touch
this.canvas.addEventListener('touchstart', this._touchStart);
this.canvas.addEventListener('touchend', this._touchEnd);
this.canvas.addEventListener('touchcancel', this._touchCancel);
this.canvas.addEventListener('touchleave', this._touchLeave);
};
Sketchpad.prototype.drawStroke = function(stroke) {
for (var j = 0; j < stroke.lines.length; j++) {
var line = stroke.lines[j];
this._draw(line.start, line.end, stroke.color, stroke.size);
}
};
Sketchpad.prototype.redraw = function(strokes) {
for (var i = 0; i < strokes.length; i++) {
this.drawStroke(strokes[i]);
}
};
Sketchpad.prototype.toObject = function() {
return {
width: this.canvas.width,
height: this.canvas.height,
strokes: this.strokes,
undoHistory: this.undoHistory,
};
};
Sketchpad.prototype.toJSON = function() {
return JSON.stringify(this.toObject());
};
Sketchpad.prototype.animate = function(ms, loop, loopDelay) {
this.clear();
var delay = ms;
var callback = null;
for (var i = 0; i < this.strokes.length; i++) {
var stroke = this.strokes[i];
for (var j = 0; j < stroke.lines.length; j++) {
var line = stroke.lines[j];
callback = this._draw.bind(this, line.start, line.end,
stroke.color, stroke.size);
this.animateIds.push(setTimeout(callback, delay));
delay += ms;
}
}
if (loop) {
loopDelay = loopDelay || 0;
callback = this.animate.bind(this, ms, loop, loopDelay);
this.animateIds.push(setTimeout(callback, delay + loopDelay));
}
};
Sketchpad.prototype.cancelAnimation = function() {
for (var i = 0; i < this.animateIds.length; i++) {
clearTimeout(this.animateIds[i]);
}
};
Sketchpad.prototype.clear = function() {
this.context.clearRect(0, 0, this.canvas.width, this.canvas.height);
};
Sketchpad.prototype.undo = function() {
this.clear();
var stroke = this.strokes.pop();
if (stroke) {
this.undoHistory.push(stroke);
this.redraw(this.strokes);
}
};
Sketchpad.prototype.redo = function() {
var stroke = this.undoHistory.pop();
if (stroke) {
this.strokes.push(stroke);
this.drawStroke(stroke);
}
};
| 2024-03-11T01:26:19.665474 | https://example.com/article/6526 |
Haploinsufficiency of desmoplakin causes a striate subtype of palmoplantar keratoderma.
Desmosomes are highly organized intercellular adhesive junctions that are particularly prominent in epidermis and other tissues experiencing mechanical stress. Desmoplakin, a constitutive component of the desmosomal plaque, is the most abundant protein present in such junctions and plays a critical role in linking the intermediate filament network to the plasma membrane in these tissues. Here we report the first mutation in the gene encoding desmoplakin. The identified mutation, resulting in a null allele and haploinsufficiency, was observed in genomic DNA from a kindred with the dominantly inherited skin disorder, striate palmoplantar keratoderma. Affected individuals had a linear pattern of skin thickening on the fingers and palms and circumscribed areas of skin thickening on the soles. Affected skin demonstrated loosening of intercellular connections, disruption of desmosome-keratin intermediate filament interactions and a proportion of rudimentary desmosomal structures. The disorder mapped to chromosome 6p21 with a maximum lod score of 10.67. The mutation was a heterozygous C-->T transition in exon 4 of the desmoplakin gene and predicted a premature termination codon in the N-terminal region of the peptide. This is the first reported mutation of desmo-plakin and also the first inherited skin disorder in which haploinsufficiency of a structural component has been implicated. It identifies dosage of desmoplakin as critical in maintaining epidermal integrity. | 2024-05-02T01:26:19.665474 | https://example.com/article/9930 |
In 2000, a band of semi-trained young men in a rubber dinghy blew a hole in the U.S.S. Cole, a multi-billion dollar ship of war, shocking the world, killing over a dozen sailors, and making global headlines. Measured in terms of the cost of the attack versus the damage inflicted, the return on investment proved to be astronomical. A terrorism budget of less than $100,000 did millions of dollars in damage and purchased the equivalent of a massive international advertising campaign that bolstered the notoriety of Al Qaeda, the group responsible, to historic heights.
John Robb, an entrepreneur and former air force captain expounded on this military and economic discrepancy in his 2007 book Brave New War: networked combatants whose inexpensive attacks cause outsized damage and disruption to a vulnerable, rich society dependent on extensive trade networks and worldwide political arrangements. Robb writes:
The nation-state is now bound up in a straitjacket of constraints. The core of its strength, its ability to marshal resources and take actions that exceed the power of any smaller organization, has been made increasingly impotent. ... [The] cozy and highly regulated market of warfare characterized by wars between state oligopolies is eroding because of these constraints... [The] result is a new, competitive market for warfare more akin to the years before the Thirty Years’ War than to our recent past. The participants in this new market are small adroit nonstate competitors and occasional allies — guerilla/terrorist groups, paramilitaries, and private military companies — and they are in the process of rewriting the rules of warfare.”
The brazenness of the attack on the Cole, and the fact that non-state actors achieved it, signified an historic change. The American military turned to the private sector for assistance in fighting this new asymmetric war against mostly non-state foes. Erik Prince, the founder of Blackwater Worldwide, soon after won the company’s first Federal contract to provide security training for sailors.
Turning to a private military company for support may have been a consequence of the general policy trend at the time — the notion that government services could be privatized while still being funded by tax revenues had become popular with both parties, albeit with some controversy — but it would eventually snowball into a far larger industry in the wake of the attacks of 9/11/2001. During the Afghan and second Iraqi wars, modern mercenaries would make their mark.
By ideology, convention, and international law, modern governments have generally eschewed the use of mercenary companies in favor of national militaries.
The era of monarchies made greater general use of mercenaries than later popular governments, for various reasons. The ideology of popular government rests on the notion of the shared rights and responsibilities of citizens, whereas an aristocratic society may have neither the financial resources nor manpower to either maintain a standing army nor raise one on short notice without paying for it. The Knights Templar were a sort of a medieval Academi (the new brand name of Blackwater Worldwide), originally charged by the Vatican with providing security to Christian pilgrims following the First Crusade.
The militia tradition of the United States and especially the levée en masse established during the French Republic broke with common military practices, and the two World Wars further established the norm of using mass conscription instead of professional military units to fight wars.
Modern mercenary companies avoid the use of the word ‘mercenary,’ and newspaper writers avoid using the word when referring to members of “security services providers.” This is a useful legalistic evasion of the terms of the United Nations Mercenary Convention. While the United States has never signed the convention — and plenty of the signatories, like Liberia, are incapable of enforcing it even on their own territory — a number of developed countries are signatories and domestic political debate in the United States recognizes the norm behind the convention by refusing to call mercenary companies what they are in plain language.
The Geneva Conventions also have a section stating that none of the protections otherwise afforded to prisoners of war apply to mercenaries. The law considers mercenaries to be ‘unlawful combatants,’ and as such, American companies are careful to operate within the arcane confines of international law, generally providing logistics support to client militaries, along with securing facilities & high-value individuals.
All of this makes it extremely challenging to start and run a mercenary company in the modern world, even though it’s technically the ‘second oldest profession’ in history. It’s illegal, or at least frowned upon, to practice the trade openly. There are limitations on the procurement of tools for employees, conducting training is politically difficult, and the press usually considers the trade to be morally abhorrent. Despite this, the economic factors in play have begun to overpower the legal and cultural resistance to the re-emergence of private soldiering.
The conflict that reintroduced the mercenary to public awareness in America was the aftermath of Operation Iraqi Freedom — the largest American military occupation since the Vietnam War. The all-volunteer American military, lacking in manpower or the ability to increase staffing on short notice, turned to private companies to provide logistics and support. The economic consequences of the abolition of the draft in 1973 became apparent as the occupation began to drag on far longer than American war planners had initially predicted. Politicians could no longer increase the number of boots on the ground at the stroke of a pen — it was now necessary to bring out the public checkbook.
The American private military industry resurged during the Iraq and Afghan wars, as substantial portions of the increase in the defense budget following the attacks on 9/11/2001 wound up in the coffers of defense firms. According to a 2011 paper by the Center for Strategic and International Studies, by 2010, almost 40% of all defense budget spending was on defense contractors, largely in military services. By 2006, a census recorded over 100,000 military contractors living and working in Iraq for the occupying authority. In the words of representative Henry Waxman of California during a 2007 congressional hearing on Blackwater:
“We know that sergeants in the military generally cost the Government between $50,000 to $70,000 per year. We also know that a comparable position at Blackwater costs the Federal Government over $400,000, six times as much.”
Private military firms in the U.S. recruit much of their staff directly from the Department of Defense: the publicly-financed military effectively subsidizes the training that provides these companies with their talent. The firms that are working for the U.S. government are usually heavily regulated, with their weapons carefully tracked, and in most situations are under the direct command of military authorities.
In a recent interview with NPR Marketplace, the Blackwater founder said:
“[The U.S. government hires Private Military Contractors] because they truly don't have the manpower or the logistics capability to fulfill those missions. So really the company becomes like a very robust temp agency operating very much under the command and control of the government.”
This political aspect of the private military industry is changing. As the American commitments in Afghanistan and Iraq wind down, private military companies are finding new roles in the international ‘bazaar of violence.’ The increase in piracy in the Gulf of Aden and in the Indian Ocean, along with the relative difficulty that national navies have had in providing effective security in the region, have reintroduced the old historical and economic role for both mercenaries and merchant marines. When pirate attacks threatened to drive up insurance costs for shipping in the area, major shipping insurance companies banded together to both lobby to loosen international regulations on arming ship crews and to fund a private naval force to defend against pirate attacks.
British PMCs in particular have begun to establish themselves in the trade, as have firms from India and Sri Lanka. Some American companies like AdvanFort even publish press releases of their military exploits, complete with posed photos of mercenaries in action, ideal for sharing on Facebook. Simon Murray, the chairman of the massive international conglomerate GlenCore, has also started a firm called Typhon to patrol the area. Unlike the Private Military Contractors (PMCs) that made headlines during the Iraqi and Afghan wars, these firms are less public-private in essence and are more private companies serving other private companies for private purposes.
In interviews regarding Typhon’s plans, representatives have described the role of their private navy as acting more like ‘burglar alarms’ to alert nearby ships of possible threats. Rather than traveling alongside the navies of nation-states, the private fleets operate on the schedules and routes of the private cargo vessels targeted by the pirates. The company has described itself as the ‘first naval-grade private convoy protection in 220 years.’
The growth of this industry in recent years has not been without retaliation from both regulators in the U.S. and worldwide — the Indian government arrested 35 crewmembers working for AdvanFort in October 2013, citing offenses related to the arms and ammunition on board. The company has taken to its Twitter account to protest the capture of their sailors.
On the ground, mercenary armies like the Puntland Maritime Police Force have run into difficulties with funding and politics, as occurred with the Puntland company when its backers in the United Arab Emirates and the United States withdrew funding, leaving behind thousands of unpaid mercenaries in Somalia. When an internet startup goes bankrupt, all that’s left are a bunch of Aeron chairs and some computer equipment. When a mercenary company goes bankrupt, the hired guns start to look for new employment and entertainment.
There’s even a trade group representing maritime security providers — the Security Association for the Maritime Industry — which has been endorsed by Lloyd’s of London, one of the most prestigious and successful insurance firms in the world. SAMI lists dozens upon dozens of PMCs from countries ranging from Estonia to Germany, Singapore, the Netherlands, and Switzerland. While these companies may prefer the PMC acronym to describe themselves, in historical terms, they’re essentially privateers. Many of the companies listed claim to have been founded quite recently — many between 2000-2010. Some prefer more reserved, professional-sounding branding, others, like the Marine Pirate Busters, prefer a little more bombast.
Since the growth of PMCs in the area, the United Nations reported this year that there have been no Somali hijackings in the region since 2012. Unlike the wars in Iraq and Afghanistan which had challenging, idealistic strategic incentives and non-economic motivation, the conflict in Somalia has clearly defined costs in the form of insurance payouts to hijackers, which makes it easier for private companies to calibrate what resources to expend on resolving the threat.
In an interview with the blog PiracyDaily, Terrence McKnight, the former commander of Task Force 151, the international naval force set up in 2009 to deter pirate attacks off the coast of Somalia, spoke of the difficulties that private security companies face in one of the next potential security vacuums on the seas off of West Africa, North Africa, and in the Middle East:
“This is something that the world communities have got to get a handle on. We know we want to stop piracy. We know we don't have enough naval ships out there to protect all the fleets—so we have these armed security teams. So, how do we now implement them? If we have all these restrictions, then they can’t do it. We've seen the success story that, since 2009 and the arrival of these security teams, there has not been a ship hijacked yet that has had an armed security team. So it is a success story. So (we need to) take that success and figure out how do we organize these teams so that the host country has some say in it and also, that we protect the crew that man the ships.”
Facing resource constraints, the U.S. and other allied governments are becoming less capable of providing security on sea lanes. Further, foreign governments are perhaps understandably jumpy at the prospect of permitting heavily-armed privateers to use their waters. Diplomats know how to speak to other diplomats, but conducting diplomacy with dozens of private security corporations is not the same. Similarly, nationally-managed navies are not necessarily structured in such a way that they're capable of fighting non-state foes (like poor pirates armed with cheap rocket launchers piloting zodiacs) in an economically efficient way.
When John Robb wrote Brave New War in 2007, he predicted that by 2016:
“...The first casualty [of a black swan event] in the United States will be the ultra-bureaucratic U.S. Department of Homeland Security, which, despite its new extralegal surveillance powers, will prove unable to defuse the threats against us... Furthermore, the extra police powers that it will be granted in the wake of these attacks will be counterproductive because these powers will only serve to divide the United States and generate a significant base of domestic dissent and vociferous debate. [...] Security will become a function of where you live and whom you work for, much as health care is allocated already. Wealthy individuals and multinational corporations will be the first to bail out of our collective system, opting instead to hire private military companies, such as Blackwater and Triple Canopy, to protect their homes and facilities and to establish a protective perimeter around daily life. [...] Members of the middle class will soon follow, taking matters into their own hands by forming suburban collectives to share the costs of security.”
With the public debate surrounding the revelations of Edward Snowden — himself, essentially, a former cyber-mercenary working on contract for the National Security Agency — in early 2013, fulfilling at least some of Robb’s predictions for the future of security, it may be sensible to take notice of them now. Lest he be dismissed as a crank author, no less a representative of mainstream thinking than David Brooks saw fit to blurb the book jacket, and James Fallows, writer for The Atlantic and winner of the National Book Award, wrote the foreword.
In another continuation of this trend towards private provision of security in the U.S., The San Francisco Gate reported in September that the private law enforcement industry has been earning hundreds of new subscribers in Oakland, supplementing the over-extended public police force. Like mercenaries elsewhere, current laws prevent them from taking over the functions of their publicly-financed authorities — but perhaps as has happened elsewhere in the world, the sheer demand for safety will cause laws to shift. The price cited for protection is $20 per month.
This post was written by contributor JC Hewitt. To get occasional notifications when we write blog posts, sign up for our email list. | 2023-09-21T01:26:19.665474 | https://example.com/article/2911 |
A galvanic isolator provides a way for transmitting a signal from one electrical circuit to another electrical circuit in a control system when the two electrical circuits may otherwise be electrically isolated from one another. Usually the two electrical circuits operate at different voltages, and thus, may be electrically isolated. For example, consider an application in which a 5V battery powered controller board is configured to control a motor circuit operating at 240V. In this example, the 240V motor circuit may be electrically isolated from the 5V controller circuit, while permitting the 5V controller circuit to send or receive signals from the 240V motor circuit. In this type of application, an isolator may be used to provide voltage and/or noise isolation while still permitting signaling and/or information exchange between the two circuit systems.
Galvanic isolators may be further categorized into opto-isolators, capacitive isolators, magnetic isolators and radio frequency based isolators depending on the technology used to electrically isolate the electrical signal. An opto-isolator may comprise an optical emitter and an optical receiver. Over time, degradation may occur and optical signals emitted from the optical emitter may degrade.
Capacitive isolators may not have the optical degradation issue of the opto-isolators. However, incorporating high voltage capacitor into a semiconductor die may be technically challenging. Capacitors that are fabricated by using conventional semiconductor process may not meet the requirement of high voltage tolerance. For example, most capacitors in integrated circuit are metal oxide semiconductor (designated hereinafter as “MOS”) capacitors or double layer poly-silicon capacitors. Sheet capacitance of MOS capacitors or double layer poly-silicon capacitors may be substantial. However, MOS capacitors may break down under high voltage. One reason may be that distance between the gate and the substrate may be lower than few microns. Overlapping metal layers in semiconductor dies would probably not be recognized as suitable for use in isolation applications because of the low and/or insubstantial capacitance value. In fact, most often, overlapping metal layers in semiconductor dies are considered as related to unwanted parasitic capacitance.
Most isolation capacitors in galvanic isolators may be formed through post processing steps after the semiconductor dies are fabricated. However, the postprocessing involves additional steps and may incur additional cost. | 2024-07-04T01:26:19.665474 | https://example.com/article/3409 |
Weber, RosaShort and Long-term Integration: Assessing the Impact of Immigrant Social ContactsAbstract: Previous studies come to contradictory conclusions regarding the relationship between immigrants’ social contacts and their labor market integration. This paper tackles this impasse by exploring the short and long-term effects of social contacts on immigrant labor market outcomes using data collected in the Swedish Level-of-Living survey in 2010. Results from Cox and OLS regressions show that social contacts provide meaningful resources in the initial transition period, but loose importance over time in the host country. The findings moreover reveal substantial heterogeneity by reason for migration. Social contacts provide family related migrants and labor migrants with significant resources in their job search, while social contacts are not able to facilitate labor market entry among refugees. Regarding longer-term integration, earnings differences by social contacts are small. However, compared to other migrants, labor migrants continue to experience an advantage in the labor market. The implications of these findings are that distinguishing between short and long-term integration contributes to our understanding of the association between immigrants’ social contacts and their labor market integration. Moreover, information provided by social contacts assists family related migrants and labor migrants in their job search.social contacts;immigrant integration;international migration;‘Stockholm Reports in Demography’;Sociologiska institutionen;Department of Sociology;SUDA;Stockholm University Demography Unit;Stockholms universitets demografiska avdelning2018-10-05 | 2024-07-11T01:26:19.665474 | https://example.com/article/3827 |
BASEBALL
Baseball Results
Dordt College Baseball vs. Nebraska Wesleyan
Game Media
(Lincoln, Nebraska) Dordt College erupted for six runs in the sixth inning and took a 7-5 decision from the Nebraska Wesleyan Prairie Wolves in game one of their doubleheader in Lincoln, Nebraska on Saturday.
Dordt trailed 5-1 after four innings with their lone run coming on a Kyle Davis sacrifice fly in the fourth that got Travis Dekkers across from third. Wesleyan scored three of their runs in the third inning on five hits but Dordt starter Patrick Sinnema was able to survive the inning and proceeded to shut the Wolves out in the next two innings, allowing his team a comeback chance and a shot at the win.
In the sixth the Defenders used a combination of errors by Nebraska Wesleyan along with walks and timely hitting to score six runs. Three of the runs came after they loaded the bases and Travis Feekes cleared them with a double. In all, Dordt scored six runs on five hits in the inning with only two of the runs counting as earned runs.
With the lead the Defenders went to the bullpen and Eric Torgerson earned the save while scattering three hits and recorded the final six outs.
Dordt got two singles each from Tony Asta, Kyle Davis and Phillip Sears and all three scored one run. Feekes as 1-4 with three runs batted in while Josh Bowers crept closer to the 100 hit mark with a single and Travis Dekkers was 1-4. Sinnema got the win while working five innings and allowed five runs on 11 hits iwth one walk and three strikeouts. | 2023-09-07T01:26:19.665474 | https://example.com/article/6643 |
Spin-polarized STM for a Kondo adatom.
We investigate the bias dependence of the tunneling conductance between a spin-polarized (SP) scanning tunneling microscope (STM) tip and the surface conduction states of a normal metal with a Kondo adatom. Quantum interference between tip-host metal and tip-adatom-host metal conduction paths is studied in the full range of the Fano parameter q. The spin-polarized STM gives rise to a splitting of the Kondo peak and asymmetry in the zero-bias anomaly, depending on the lateral tip-adatom distance. For increasing lateral distances, the Kondo peak splitting shows a strong suppression and the spin-polarized conductance exhibits the standard Fano-Kondo profile. | 2023-09-28T01:26:19.665474 | https://example.com/article/1711 |
TAIPEI February 29, 2020— MAS Capital Universal Exchange (MASEx) is announcing the listing of the Tratok token, short for Travel Token (TRAT), on the exchange. This is in line with MASEx’s aim to be the leading security token exchange and establishing a decentralized exchange as a model for digital assets markets.
The Tratok Travel application is used for booking travel and tourism services, which include hotel reservations, flight booking or car rentals. The Tratok Token will be used on this multi-platform application for hassle-free transactions, which will result in cost savings and efficiency for both users and service providers alike.
Blockchain technology is expected to disrupt the existing business model and provide significant advantages over existing conventional platforms. Using the Tratok Token will lead to reduced transaction costs and booking times and eradicate the need for middlemen, resulting in more profits for service providers and savings for consumers.
Tratok will set a new standard for services and thus revolutionize the US$ 7.6 trillion travel and tourism sector by focusing on the stakeholder experience.
Tratok token (TRAT) is listed on MASEX 29th of February 2020. Deposits and withdrawals on TRAT will become available after listing.
MASEx, which recently announced its acquisition of TTChain, now boasts of a platform that facilitates a decentralized, flash cross-chain, high frequency, and AI trading with 8,000+ transactions per second. This encourages multi-platform trading and attracts more users. Aaron Tsai, founder and CEO of MASEx, states, “The acquisition of TTChain will enable MASEx to provide a technologically comprehensive solution for lightning speed transfers in a decentralized fashion.”
The Tratok token listing on this platform is an added advantage that boosts the travel and tourism industry as users will be able to trade the utility token and use it across Tratok’s services.
About Tratok
The Tratok Travel application allows users to make bookings for travel and tourism services, including reserving a hotel room, booking a flight, or renting a car. Its multi-platform application results in more economical, hassle-free arrangements for clients and service providers alike. The team is backed by experienced leaders with backgrounds in finance, banking, retail, e-commerce, data science, and machine learning. Key advisors include the former CEO and Vice Chairman of DBS Bank in Singapore, and Chairman and CEO of Ford Credit and Ford Financial Services (the biggest finance company in the world).
About MASEx
MAS Capital Universal Exchange (MASEx) is a global STO exchange founded by Aaron Tsai. It aims to become the leading security token exchange by using AI and blockchain technology to form a decentralized exchange to trade securities, commodities, FOREX and digital assets on a single or Universal trading platform. Incorporated in Anguilla on August 14, 2018, and having a registered representative office in Taipei, MASEx’s Stock Listing — Entry Board started to trade its first equity security token WESTO, issued by Westrend Consulting from Vietnam, on October 31, 2019. MASEx will be a platform to deliver greater transparency, economies of scale, and liquidity on a global basis with a plan to open access to the un-banked.
Image Source: Pixabay | 2023-12-22T01:26:19.665474 | https://example.com/article/9374 |
Send this page to someone via email
SARNIA, Ont. – Matthew Struthers scored his second goal of the night at 3:16 of overtime as the Owen Sound Attack downed the Sarnia Sting 5-4 on Friday in Ontario Hockey League action.
Struthers forced the extra period when he potted a tying goal at 19:16 of the third period, helping Owen Sound halt its three-game losing streak.
Matthew Philip, Ethan Burroughs and Carter Robertson also scored for the Attack (16-15-5), who got 20 saves from Mack Guzda.
Ryan McGregor struck twice while Sean Josling and Nolan Burke had the other goals for the Sting (15-18-4), who are on a six-game slide.
Ethan Langevin kicked out 36 shots for Sarnia.
Owen Sound defenceman Mark Woolley was ejected at 7:47 of the first after taking a major for checking to the head.
Story continues below advertisement
FIREBIRDS 5 GENERALS 4 (OT)
FLINT, Mich. — Dennis Busby scored at 1:27 of overtime, and Anthony Popovich made 35 saves as the Firebirds (20-15-0) slipped past Oshawa (18-12-5).
—
OTTERS 6 FRONTENACS 3
KINGSTON, Ont. — Danial Singer and Maxim Golod had a pair of goals apiece as Erie (16-13-8) doubled up the Frontenacs (10-22-4).
—
WOLVES 4 COLTS 2
SUDBURY, Ont. — Blake Murray had a goal and an assist as the Wolves (19-17-1) downed Barrie (15-16-3) to halt a six-game slide.
—
Story continues below advertisement
SPITFIRES 10 GREYHOUNDS 4
SAULT STE. MARIE, Ont. — Daniel D’Amico scored five times and Will Cuylle added a hat trick as Windsor (22-8-4) pummelled the Greyhounds (18-18-2) for its third straight win.
—
STORM 5 PETES 2
GUELPH, Ont. — Pavel Gogolev and Cam Hillis both produced two goals and two helpers to lead the Storm (22-8-5) past Peterborough (25-10-3).
—
RANGERS 4 SPIRIT 2
KITCHENER, Ont. — Greg Meireles scored twice and Jacob Ingham made 33 saves as the Rangers (21-11-4) ended Saginaw’s (21-11-4) six-game win streak while extending their own to four games.
—
KNIGHTS 3 STEELHEADS 1
LONDON, Ont. — Brett Brochu turned aside 40 shots and Jonathan Gruden had a goal and an assist as the Knights (22-12-2) defeated Mississauga (14-21-3) for their third win in a row.
—
This report by The Canadian Press was first published Jan. 3, 2020
Story continues below advertisement | 2024-05-08T01:26:19.665474 | https://example.com/article/3464 |
Photo Journal
Japanese cranes, a designated special national natural treasure, dance on the snow in the village of Tsurui, Hokkaido, in this recent photo. At "Tsurui-Ito Tancho Sanctuary" operated by the Wild Bird …
Full article | 2024-07-16T01:26:19.665474 | https://example.com/article/4579 |
/*
* Copyright 2012 Cloud9 IDE, Inc.
*
* This product includes software developed by
* Cloud9 IDE, Inc (http://c9.io).
*
* Author: Mike de Boer <info@mikedeboer.nl>
*/
"use strict";
var Assert = require("assert");
var Client = require("./../../index");
describe("[gitignore]", function() {
var client;
beforeEach(function() {
client = new Client({
version: "3.0.0"
});
});
it("should successfully execute GET /gitignore/templates (templates)", function(next) {
client.gitignore.templates(
{},
function(err, res) {
Assert.equal(err, null);
// other assertions go here
Assert.ifError(err);
Assert(Array.isArray(res));
Assert(res.length > 10);
next();
}
);
});
it("should successfully execute GET /gitignore/templates/:name (template)", function(next) {
client.gitignore.template(
{
name: "C"
},
function(err, res) {
Assert.equal(err, null);
// other assertions go here
Assert.ifError(err);
Assert('name' in res);
Assert('source' in res);
Assert(typeof res.source === 'string');
next();
}
);
});
});
| 2023-08-29T01:26:19.665474 | https://example.com/article/5669 |
NORTH TEXAS PERFORMING ARTS NEWS
Joel Ferrell Gets Lifetime Achievement Award
Tonight the Live Theatre League of Tarrant County has its annual awards. Honorees include Ferrell, Denise Lee, vickie washington, Michael Skinner, and more.
by TJ Staffpublished Monday, April 23, 2018
Photo: Dana Driensky
Joel Ferrell
Fort Worth — Actors, directors, producers, and theatre patrons will walk the red carpet the evening of Monday, April 23 as the Live Theatre League of Tarrant County (a nonprofit association) recognizes and celebrates a broad spectrum of notable theatre work.
The awards program, now in its 25nd year, honors individuals and organizations that have helped produce or promote live theatre in the community, whether they be on the stage or behind the scenes, paid or volunteer. The event is free and open to the public, beginning with a reception (and photo opportunities) at 5:00 pm at the entrance of the Scott Theatre at the Fort Worth Community Arts Center (1300 Gendy St.). The curtain will go up for the awards ceremony promptly at 5:45, inside the Scott Theatre, home to decades of memorable theatrical performances. Featuring three live musical performances, the program will include presentation of 11 county-wide awards and the 12 member theatres recognizing supporters who have made significant contributions to their individual theatres.
The major awards and winners are:
● Elston Brooks Lifetime Achievement Award: Joel Ferrell
This award is named in honor of the late journalist/author Elston Brooks, best known as a columnist and theatre critic for the Star-Telegram and an inspiring arts advocate.
● Ann L. Rhodes Philanthropic Individual Award: Gail Granek
This award is named in recognition of the generous support of area live theatres by the late Ann L. Rhodes, whose charitable trust continues to spread her philanthropy.
● Philanthropic Organization: The Scott Foundation
● Theatre Arts Advocate: The Betty Lynn Buckley Awards
● Theatre Arts Educator: Anna Carlson
● Design and Technical Award: Michael Skinner
● Rudy Eastman Diversity Award: Denise Lee
This award is named in honor of the late Rudy Eastman, founder and artistic director of Jubilee Theatre.
Thank you for visiting TheaterJones.com, a division of Metropolitan Arts Media, Inc. If you experience any difficulties with this site, please contact
the site administrator. All material contained within this website is copyright (c) 2009-
2019 Metropolitan Arts Media, Inc. To inquire about advertising on our site, please use the comment form. You can review our
Privacy Policy here.
Please complete some of the basic information below to sign up for our weekly newsletter. TheaterJones will NEVER sell, share, hand over to WikiLeaks or leave any of your information in an airport taxi. We value your privacy and our own. Your date of birth is required to ensure all users are at least 13 years of age in accordance with our policies and state and federal laws. We ask for your ZIP code to determine certain eligibilities and for demographic purposes, but we will not use any personal, identifiable information.
Use any or all of the options below to search through all of reviews, interviews, features and special sections. If you are looking for a an event, use the calendar section of this website. This search will not search through the calendar. | 2023-09-02T01:26:19.665474 | https://example.com/article/9173 |
Creatinine as a measure of lean body mass during treatment of acute lymphoblastic leukemia in childhood.
Protein energy malnutrition is well-recognized in children with acute leukemia and may result in loss of lean body mass (LBM) with attendant morbidities. Much of the LBM consists of skeletal muscle, the mass of which is reflected in urinary creatinine excretion. As accurate 24 hours urine collections are challenging in children, we investigated the prospect that serum creatinine concentration provides a measure of LBM. Eleven children with acute lymphoblastic leukemia were assessed at 7 time points (6-mo intervals) from diagnosis to 1 year after the completion of therapy. LBM was measured as fat-free mass by dual energy x-ray absorptiometry (DXA scans) and correlated with serum creatinine concentration and 24 hours urine creatinine excretion. As expected, there was a strong correlation between 24 hours urinary creatinine excretion and LBM from DXA scans (r=0.79, P<0.001). Serum creatinine concentration also correlated with LBM (r=0.52, P<0.001). Serum creatinine concentration provides a surrogate measure of LBM in children with acute lymphoblastic leukemia. This will be especially useful in countries with limited resources in which more sophisticated measures, such as DXA scans, are seldom available. | 2024-06-03T01:26:19.665474 | https://example.com/article/2749 |
Increased expression and function of the myocardial Na-K-2Cl cotransporter in failing rat hearts.
Recent studies indicate a role of the Na-K-2Cl cotransporter (NKCC) in regulation of myocardial function. However, potential pathophysiological properties of NKCC in conditions like myocardial infarction (MI) and heart failure have not been explored. We investigated the cellular localization of myocardial NKCC and whether myocardial NKCC levels are changed upon induction of post-infarction heart failure in rats. Immunohistochemical analysis demonstrated extensive distribution of NKCC in normal rat myocardium with fairly strong expression in cardiomyocytes, fibroblasts, vascular endothelial cells, as well as smooth muscle cells. Myocardial mRNA levels of NKCC were investigated at 2, 7 and 28 days after induction of MI or sham operation, but no changes were found. Cardiomyocytes and non-cardiomyocytes were isolated 7 days after induction of MI or sham operation. An approximately 2-fold increase of the NKCC mRNA levels was found in isolated cardiomyocytes from heart failure rats compared to that of sham-operated rats (P < 0.001), whereas a trend towards decreased mRNA levels of NKCC in isolated non-cardiomyocytes was observed. In addition, we found a bumetanide sensitive (86)Rb(+) influx mechanism present in the hearts after induction of MI (P < 0.05). Thus, our data indicate cardiomyocyte specific increase in NKCC mRNA levels and increased NKCC activity in post-infarction heart failure. Our results may indicate a potential role of NKCC during post-infarction remodeling. | 2023-10-23T01:26:19.665474 | https://example.com/article/1651 |
USC President C.L. Max Nikias revealed late Friday that the university had received complaints and imposed disciplinary measures against the then-dean of its medical school, who a Times investigation found took drugs and associated with criminals and drug abusers.
In a letter to the campus community, Nikias wrote that Dr. Carmen Puliafito had been the subject of “various complaints” during nearly a decade as the dean of the Keck School of Medicine. Nikias said Puliafito received “disciplinary action and professional development coaching.”
Nikias also provided new details about Puliafito’s final months in the job before he resigned in the middle of the Spring 2016 term.
In 2015, USC Provost Michael Quick put Puliafito “on notice for being disengaged from his leadership duties,” the president said.
“On March 11, 2016, two USC employees notified Provost Quick that Dr. Puliafito seemed further removed from his duties and expressed concerns about his behavior,” Nikias wrote.
“The Provost consulted with me promptly and, as a result, confronted Dr. Puliafito. He chose to resign his position on March 24, 2016, and was placed on sabbatical leave.”
Nikias stressed Friday that at the time of Puliafito’s resignation “no university leader was aware of any illegal or illicit activities, which would have led to a review of his clinical responsibilities.”
The president’s letter was released hours after The Times provided USC with findings about Puliafito’s behavior during his tenure heading the medical school.
It comes amid an outpouring of anger and questions about USC’s handling of Puliafito, a Harvard-trained ophthalmologist.
Full Coverage: An overdose, a young companion, drug-fueled parties: The secret life of a USC med school dean »
The Times report last week described how Puliafito kept company with a circle of criminals and drug addicts and used methamphetamine and other drugs while serving as the dean. Photos and videos reviewed by The Times showed Puliafito, 66, and his friends, who were in their 20s and 30s, partying in 2015 and 2016.
The images include some in which Puliafito’s companions are seen holding drug paraphernalia during an after-hours visit to the dean’s office at USC’s Health Sciences Campus in Boyle Heights.
One member of Puliafito’s circle was a 21-year-old woman who overdosed in his presence at a Pasadena hotel three weeks before he abruptly quit as dean.
A witness to the incident told the newspaper of phoning Nikias’ office, giving two employees an anonymous account of the overdose and demanding that USC take action against Puliafito.
Phone records reviewed by The Times showed the witness made a six-minute call to Nikias’ office on March 14, 2016, 10 days after the overdose. The tipster said he did not expect a call back but had told the USC employees he would go to the media if action wasn’t taken.
Dr. Carmen Puliafito (Alex J. Berliner / AP)
Last week, Puliafito’s successor as dean, Dr. Rohit Varma, told a gathering of scores of students that USC had found “no evidence, particularly, of that phone call.”
But Tuesday evening, a crisis management specialist representing USC, Charles Sipkins, said that Nikias’ office did receive an anonymous call about Puliafito’s presence at the hotel overdose. However, the anonymous report did not reach senior administrators, Sipkins said.
About three months after Puliafito stepped down, Nikias and other USC leaders hosted a catered reception for the former dean and praised his leadership of the medical school. Puliafito continued to accept new patients at campus clinics and represented the university at events, including a Keck-sponsored course at a Pasadena hotel earlier this month.
The Times made repeated inquiries over the last 15 months about Puliafito, in some cases describing information reporters had gathered about the dean and the overdose.
USC’s leaders never responded to the inquiries. Numerous phone calls were not returned, emails went unanswered and a letter seeking an interview with Nikias to discuss Puliafito was returned to The Times by courier, unopened. The courier also delivered a letter of complaint from Brenda Maceo, USC’s vice president for public relations and marketing, who said the reporter had “crossed the line” by visiting the Nikias home to deliver the letter.
On Friday, Nikias wrote that in the fall of 2016 “a communications staff member received an unsubstantiated tip about a Pasadena hotel incident.”
He described a confrontation by administrators: “When we approached Dr. Puliafito about the incident, he stated a friend’s daughter had overdosed at a Pasadena hotel and he had accompanied her to the hospital.”
The president also said that last March, The Times did provide the university with “detailed questions about, and a copy of a 911 recording from the Pasadena hotel incident.” The recording was “immediately referred to” a committee that assesses clinical competency, the Hospital Medical Staff, Nikias said.
“That body determined that there were no existing patient care complaints and no known clinical issues,” the president said.
After The Times investigation was published on July 17, Nikias said the Hospital Medical Staff had reopened its investigation. The Medical Board of California also launched an investigation into Puliafito based on the newspaper’s report, a spokeswoman confirmed.
Nikias said in his letter that after The Times published its story, the university learned “that two receptionists in the president’s office received a call in March 2016 from a blocked number.”
“The caller, who insisted on anonymity, raised concerns about an incident in a Pasadena hotel involving Dr. Puliafito. Neither receptionist found the claims or the caller credible, and so the information was not elevated and did not reach a senior administrator,” Nikias wrote.
“Needless to say, we have already put into place a new system that documents and records all incoming calls to the president’s office.”
USC announced last week that it hired a former federal prosecutor who works for a law firm with close ties to the university to investigate the affair. Puliafito has been barred from the campus and from “any association with USC.”
ALSO
Steve Lopez: Yet another USC scandal requires blunt talk about money culture and values on campus
Police union examines incident at Pasadena hotel involving a former USC dean after an officer is disciplined
Drug allegations involving former USC medical school dean are probed by Medical Board of California
Former USC medical school dean no longer seeing patients; Pasadena police discipline officer
UPDATES:
July 29, 7:45 a.m.: Updated with additional details about a phone call to USC from a witness to the hotel incident as well as passage from Friday’s statement saying at the time of Puliafito’s resignation USC officials were not aware of any drug use by former dean.
This story was first posted July 28 at 11 p.m. | 2024-02-13T01:26:19.665474 | https://example.com/article/2926 |
*o + 2*o + 30 for t.
-4
Let f be (5 + 9)*(-2)/(-4). Let p be f/35 + 28/10. Suppose 7*b - 2*b - 30 = 5*v, -p*b - 3*v = -6. Solve 5*u + b*w + 8 = u, 5*u - 5*w = -30 for u.
-4
Let s be (-2)/(-4)*(-7 + 27). Solve 0 = -5*x + 3*f - s, x + 2*x = 3*f for x.
-5
Let g(m) = m + 46. Let u be g(-43). Solve -4*z = -2*j, -4*j + 4*z - u*z - 7 = 0 for j.
-2
Let j = 15 + 0. Let x be 1/3*(11 + 25). Solve 0 = 2*w + w + 4*y - x, 0 = -4*w - 5*y + j for w.
0
Let t(d) = d**2 + 9*d + 2. Suppose -36 = -x + 5*x. Let r be t(x). Suppose -6 = -5*b - 31, 2*y + 3*b = -7. Solve -y*a = -2*l + 18, 1 - 6 = r*a + 3*l for a.
-4
Suppose 0 = b - 2*y - 0*y, -2*y = -8. Let q(w) = w**2 - w - 5. Let d be q(-4). Let z be (1 - 0/(-2))/(3/d). Solve 3*f - 15 = z*a, -2*a + 4*f - b = -2 for a.
-3
Let x = 15 + -1. Let n = 8 - x. Let j be (4 + n)/(1*-1). Solve k - 3 = -c + j*c, 3*c - 4*k = -11 for c.
-1
Let f be 65/2 + 5/(-10). Suppose -f = -g + 5*g. Let p(u) = -3*u - 11. Let d be p(g). Solve x = 3*x - 3*k - d, -5*x + 5*k + 25 = 0 for x.
2
Let m = 8 - 15. Let x be (m - -3)*-1 - (-2)/1. Solve x*r = 3*r + 5*y - 37, -2*y + 10 = 0 for r.
-4
Suppose -p + 28 = 5*m - m, -4*m + 12 = 5*p. Solve -3*q = 5*t + m + 1, 0 = 2*t - q - 3 for t.
0
Suppose 46 = -4*z - 2*s, -3*z - 38 = 2*s + 3*s. Let t = -7 - z. Suppose t*v - 32 - 4 = 0. Solve 2*y + 0*y = 4*l + 12, -v = -5*y + 3*l for y.
0
Suppose -3*o = -15, 3*a + 3*o - 13 = 4*o. Let f be 4/a + 2/(-3). Let n be (-3 + f + 2)*-4. Solve -4*z + n*p = 2*p + 10, 0 = -3*z - p - 10 for z.
-3
Let p(x) = 6*x**2 - 56*x + 23. Let y be p(9). Solve -5*v - y*t - 7 + 2 = 0, -25 = 4*v - 3*t for v.
-4
Let y = 23 - -3. Let u = y + -16. Solve -l = -2*v + 9, 3*v = l + 4 + u for v.
5
Let f be 2/((8/(-6))/(-2)). Suppose 148 = 4*y - 64. Let t = 55 - y. Solve f*o + i = 5, t*i - 15 = -o - i for o.
0
Suppose 0 = 42*h - 32*h - 30. Solve 4*p - h*d - d = -24, 18 = -2*p + 5*d for p.
-4
Let t(z) = -8*z - 7. Let p be -5 - -6 - 4*1. Let k be t(p). Let x = -14 + k. Solve d + 7 = 3*d - 5*n, x*n + 21 = -3*d for d.
-4
Let q = 52 + -77. Let u = -20 - q. Solve -28 = -3*g + u*i, -2*g - 2*i = -5*g + 13 for g.
1
Let m = -31 - -34. Let u be -1*(m + 1) - -8. Solve -2*a + 3 = u*z + 33, -30 = a + 5*z for a.
-5
Suppose 3*h = 2*f - 12, -3*f + 4*h = 2*f - 23. Suppose -4*d - l + 20 = 0, 0*l = -3*d - f*l + 24. Solve 5*x - 20 = 5*q, -d*q + 2*q = -x + 9 for q.
-5
Suppose -3*w - 3 = 5*o, 3*w = -4*o - w - 4. Suppose 5*n - 416 - 424 = o. Let r be n/(-18)*3/(-2). Solve -3*a + r = -l, -5*l + 5*a = 9 + 21 for l.
-2
Let q = 16 - 9. Let y(g) = -g**2 + 7*g - 2. Let o be y(8). Let c be (12/(-15))/(4/o). Solve -p + q = -c*h + 3*h, 4*h = -5*p + 31 for h.
4
Suppose 2*z + 1 = 9. Suppose -z*a = a - 40. Suppose i + 24 = 4*v, -3*v = -4*i - 10 - 8. Solve -9 = 4*p + n, 3*p - 2*n - a = v*p for p.
-2
Let u(r) = r**2 + 5*r + 2. Let z be u(-6). Suppose 3*c + 42 = 5*c. Suppose 2*n = k - 3, -4*k - n + 17 = -4*n. Solve k*w + 2*s + c = -s, -s - z = 2*w for w.
-3
Let t = -13 + 20. Let d = -5 + t. Suppose -d = 2*n - 66. Solve 16 = -0*o - 5*o + 3*l, -n = 4*o + 4*l for o.
-5
Let b(l) = l**2 + l - 3. Let g be b(-3). Let n = 21 - 17. Let o be 55/n + 2/8. Solve -4*i + 2*k + 18 = -0, -g*i - 4*k = o for i.
2
Let f(x) = 2*x**3 - 65*x**2 + 31*x + 36. Let v be f(32). Solve 3*p = -h - 8, 0*p - v*h + 16 = -4*p for p.
-3
Suppose 5*p + g = 26, 25 = 3*p + 4*g + 6. Suppose 6*i = 4*i - 4*b - 2, i + p*b = -7. Solve i = -3*m - 2*a, 4*a + 11 = -m - 0 for m.
1
Suppose -4*d - 4 = -4*o, -5*o = 2*d - 3*d - 13. Solve 5*r - 5*v + 5 - 15 = 0, o*r - 4 = 2*v for r.
0
Let b = -1 + 16. Suppose -4*u + b = u. Solve -2*w - 14 = -5*w - x, 0 = -5*w + u*x + 14 for w.
4
Suppose -27*h + 16 = -23*h. Solve -m - h*b = -5*m, 0 = -5*m - 3*b + 24 for m.
3
Let l = -29 + 24. Let m = l + 7. Solve 0 = -2*v - 4*x + m*x - 4, 4 = -v - 3*x for v.
-1
Let r = -15 - -16. Suppose -27 = -4*x - f, -f - r - 2 = -x. Suppose 5*t - x - 19 = 0. Solve 4*j - t*l + 0 = -9, 5*l - 4 = -j for j.
-1
Suppose -17*r + 5*r + 36 = 0. Solve 2*y - r*f - 2*f = 15, 0 = -3*f - 9 for y.
0
Let c be 11/(-2 - (5 + -8)). Suppose -c = -2*a - 0*u - u, 4*a = -5*u + 31. Solve 7 = -5*v + a*r, 2*v - 5*r = -0*v + 4 for v.
-3
Suppose -q + 36 = c - 2*q, c = 2*q + 33. Suppose -5*j + c = 2*x, x = -3*j + j + 16. Solve -y = 5*z - 19, -j*z + 2*z + 4*y - 1 = 0 for z.
3
Suppose 4*l - 2*q - 4 = 2, -l + 1 = -q. Suppose 0 = -h + l*d + 32, -5*d - 2 = 2*h - 57. Solve -8*b + 5*j + h = -3*b, -3*b = -j - 10 for b.
2
Let c be 3 + 0 + -15 + 3. Let x(v) = 2*v**2 + 13*v + 3. Let i be x(c). Suppose 42 = 5*g - i. Solve -3*a - 5*f = -26, 2*a - 5*f - 2 + g = 0 for a.
2
Suppose 0*i - 8 = j - 2*i, 0 = 3*j - i + 14. Let a be 3 + (-1 - (-7 - j)). Solve 5*m + o = -3*o + 31, 0 = 3*m + a*o - 29 for m.
3
Let m(g) = 5*g + 3 - 3*g - 2 + 2*g. Let t be m(1). Solve 3*i + y = -0*y + 8, i = t*y + 24 for i.
4
Let g(h) = 43*h - 210. Let a be g(5). Solve 1 = 5*f + a*u + 6, f + 4*u = -10 for f.
2
Let r(o) = -o**3 - 3*o**2 + 5*o + 4. Let s be r(-4). Let h(w) = -w**3 - w**2 + 31. Let l be h(s). Let g = -27 + l. Solve g*p = 7*p - 3, 4*u + p - 5 = 0 for u.
1
Let o(a) = a**3 + 11*a**2 + 10*a + 1. Let t be o(-10). Let k(h) = 11*h - 1. Let p be k(t). Let v = -10 - -35. Solve 3*j - 7 = 2*d, v = -p*d + 5*d for j.
-1
Let j = 7 - -11. Let k be ((-1)/2)/((-3)/j). Suppose -3*z - k + 9 = 0. Solve -z*w + 4*w = 2*n + 2, 4*n + 2*w = 26 for n.
4
Suppose -32 + 2 = -6*k. Solve 2*y - 6 = -4*i, -3*i + k + 0 = 2*y for y.
1
Let j = 35 - -45. Suppose 6*s - j = -20. Solve y - s = 3*l, y - 14 = 5*l - 0*y for l.
-2
Suppose 62*s = 42*s + 160. Solve a - h - s = 2*h, -32 = 5*a + 3*h for a.
-4
Let m be 18 + -4*9/(-12). Suppose 16*o - m*o = -10. Solve 8*x = 3*x + t + 10, o = x - t for x.
2
Suppose 0 = -2*r - 3*r + 80. Suppose -2*d + r = 2*d. Solve -5*z - 27 = 2*s - 0*s, d*s - 16 = 4*z for z.
-5
Let a(w) = 17*w - 117. Let t be a(6). Let k(n) = -18*n - 11 - 2*n**2 - 11 + n**2. Let r be k(t). Solve -b - 3*b + 5*x = 7, 0 = 4*b + 5*x - r for b.
2
Let o be 6 + 12/(-2) - -2. Solve -5*g - 2*a - 33 = 0, o*a = 3*g + 3*a + 19 for g.
-5
Let v be (54/(-45))/((-4)/10). Let u be (30/25)/(3/20). Suppose -7 = -3*x - 2*r + r, -4*x - 2*r = -u. Solve -x = -3*o + 2*j + 2, 3*o = -v*j + 30 for o.
5
Let b(h) = -h**2 - 9*h + 15. Let t be b(-10). Suppose 3*g - 3*u = 2*u - 13, 5*g - 5*u = -t. Solve 4*q - g = -5*s - 0*q, -s + 4*q = 4 for s.
0
Let n be (-646)/(-171) + 4/18. Suppose n*v - 8 = 2*v. Solve -v*m - m - 10 = -2*y, 2*y = -3*m - 6 for y.
0
Suppose -7*s - 228 = -s. Let q = -36 - s. Solve 4*u + 0 = -v - 6, -q*u = 5*v + 12 for v.
-2
Let g(d) = d**3 - 11*d**2 - 12*d + 4. Let k be g(12). Solve -a - k*h = 3, -8 = 5*a - 4*h + 7 for a.
-3
Suppose -3*a = -2*f - 42, 4*f = -2*a - 374 + 386. Solve 0 = -2*i - 2*l, 2*i + 5*l + 0 + a = 0 for i.
4
Let z be -1 - (-6 + (-3 - -6)). Suppose 4*g = -x + 12, 14*g - x = 19*g - 15. Solve -6 = -g*v - 5*l, 4*v + 15 = -l + z*l for v.
-3
Let x = -91 - -94. Solve -x*d - 2*d - n + 20 = 0, 0 = -3*n - 15 for d.
5
Let j be 4/(-3)*(-11)/(-66)*-9. Solve -j*h = 2*v, -3*h + 0*v = -2*v + 25 for h.
-5
Suppose 2*r + 84 = 4*c, 38 = 173*c - 171*c - 2*r. Solve -4*n - c = 5*l, l + 0*n = -5*n - 13 for l.
-3
Let w = 2665 + -2665. Solve 5*h + p = 7, w = h - 0*p - p + 1 for h.
1
Let o = 21 + -9. Let r be (-34)/6 + (-4)/o. Let u(g) = -g**3 - 6*g**2 - 2*g - 2. Let d be u(r). Solve 3*m - 2*b + d = 2*b, 2*b = -5*m - 8 for m.
-2
Suppose -8*j = -3*j - t - 13, -j = 5*t + 13. Let x be (1 - 4)/(6/(-8)). Solve 3 + j = -4*g - 3*n, x = -3*g - 2*n for g.
-2
Suppose 4*z + 73 = -3*a, -3*z = 2*z + 5*a + 90. Let x = -17 - z. Solve g - 4*j - x = 0, -4*j + 4 = 5*g + 18 for g.
-2
Let a be (-2)/((-20)/46) - (-34)/85. Solve a*y + 12 = -t, y + 3 - 5 = 2*t for y.
-2
Suppose 12*k = 11*k, 0 = 5*v - 5*k - 35. Solve 4*l + 11*i - v = 8*i, -3*l = -4*i - 24 for l.
4
Let w(r) = r**3 + 13*r**2 - 20*r - 74. Let t be w(-14). Solve s + t = -3*h, s + 0*h = h + 10 for s.
5
Let x = 746 + -740. Solve 0 = -3*n + 3*o - 6, -3*n - 7*o = -6*o - x for n.
1
Let r = 20 - 20. Solve r = -2*d + 5*h - 1 - 28, 23 = -4*d + 3*h for d.
-2
Suppose 0 = -3*p + 4*v + 21, -8*p + 6 = -5*p + v. Solve p*w - q = -4, 4*q = -4*w + q - 1 for w.
-1
Let z(c) be the third derivative of -c**4/12 - 11*c**3/6 + c**2. Let p = 32 + -45. Let k be z(p). Solve 2*w - 13 = n - w, -5*n - 5*w = -k for n.
- | 2023-12-25T01:26:19.665474 | https://example.com/article/1812 |
Hyderabad, the city of Nizams has traditionally been home to a large number of food lovers. From the famed Nizami cuisine to the hot and spicy Andhra fare, the Hyderabadis love their food and discussions related to it.
Dussehra is a special occasion in major parts of India, it celebrates the victory of good over evil through the many faces of the Indian Mythology, be it Lord Rama's victory over Ravana or Goddess Durga's victory over the demon Mahishasura.
At the time of Ramadan, there is only one dish which is at the tip of every Hyderbadi’s tongue; Hindu, Muslims and Christians alike – Haleem. Haleem is greatly popular among the folks and sold in every nook and corner during the time of Ramzan. At this time one can see a line of Haleem bhattis all over the city's streets with hundreds of customers daily lining up to taste the dish. A dig into the dish will cause a riot of flavors in your mouth as you play a hide and seek game with the chicken or mutton pieces. | 2023-11-14T01:26:19.665474 | https://example.com/article/1108 |
Development of chitosan-pullulan composite nanoparticles for nasal delivery of vaccines: optimisation and cellular studies.
Nasal immunisation with nanoparticles has already shown promising results. In this study, nanoparticle composites carrying BSA for nasal vaccination prepared using electrostatic interaction process between polycation N-trimethyl chitosan chloride (TMC), chitosan glutamate (CG), chitosan chloride (CCl) and polyanion carboxymethyl pullulan (CMP). A mass ratio of 2:1 for TMC-CMP combination produced stable nanocarriers. For CCl-CMP and CG-CMP formulations needed a mass ratio of 3:1. Loading efficiency was >90% for all formulations. Nanoparticles' size ranged from 207 to 603 nm. The surface charge of the complexes varied between +14 and +33 mV. SDS-PAGE integrity of the model antigen was also demonstrated. MTT studies showed that nanoparticle composites were less toxic to Calu-3 cells than the particles of cationic polymers alone. FITC-BSA loaded nanoparticles efficiently taken up by J774A.1 macrophages as confirmed by confocal microscopy highlighting the potential of these novel nanoparticulate carriers' use for nasal vaccination. | 2024-04-07T01:26:19.665474 | https://example.com/article/4666 |
Cloning and expression of the human and rat m5 muscarinic acetylcholine receptor genes.
The human and rat genes for a fifth muscarinic receptor have been cloned and expressed in mammalian cells. The 532 amino acid human protein has 89% sequence identity to the 531 amino acid rat protein and is most closely related to the m3 receptor. Both proteins are encoded by single exons. The receptor has intermediate affinity for pirenzepine and low affinity for AF-DX 116, and it increases metabolism of phosphatidylinositol when stimulated with carbachol. Expression of mRNA has yet to be observed in brain or selected peripheral tissues, suggesting that either it is substantially less abundant than m1-m4 or its distribution is quite different. | 2023-08-17T01:26:19.665474 | https://example.com/article/4169 |
Field of the Invention
The present invention relates to a device for making a connection between a first and a second group of fibers with each fiber of the first group in alignment with an assigned fiber of the second group, a connection formed by the device and the method of forming the connection. | 2024-06-27T01:26:19.665474 | https://example.com/article/9624 |
Johannesburg - Amid reports of South Africa’s top two networks charging up to 2 639% more for out-of-bundle data, Vodacom has said it is normal business practice to offer discounts to customers that make longer term commitments.
Despite a push by government and the Independent Communications Authority Of South Africa (Icasa), out-of-bundle data rates are much more expensive than in-bundle.
MyBroadband recently revealed that data rates on both the Vodacom and MTN networks were reported to be exponentially higher when users ran out of data bundles.
It was reported that while on contract, a Vodacom 20GB data bundle cost R329, which worked out to R0.02 per MB, but out-of-bundle the rate per MB was R0.44, 2 630% higher than an in-bundle rate.
Similarly, MTN’s 25GB prepaid bundle costs R1 250, equating to R0.05 per MB and out-of-bundle cost R0.99 per MB, 1 928% more expensive than in-bundle.
Meanwhile, the prepaid price for 20GB on Vodacom worked out 204% higher, being priced at R999 as opposed to the R329 on contract.
MTN’s prepaid versus contract offering was hiked by 234% with 20GB on prepaid costing R299 and 25GB on prepaid at R1 250.
“This as recurring revenues allow for more accurate forecasting upon which better-informed business decisions can be taken. As part of Vodacom’s pricing transformation journey, effective voice and data prices have declined by more than 40% over the past three years,” a company spokesperson said.
The spokesperson went on to say that bundles are a committed purchase that provides the company with a greater deal of certainty as to when the service will be used.
“This means that we can plan / provision network capacity with a greater degree of accuracy. As part of our pricing transformation strategy, Vodacom significantly reduced out-of-bundle prices in October last year and recognises that more needs to be done on this front.
"To encourage customers to remain in-bundle, Vodacom has introduced a variety of initiatives in recent times including auto allocate, safety bundles and smart notifications,” the spokesperson told Fin24.
The report came amid a promise made across all networks to extend the validity of data bundles and a decrease in the cost of data overall.
Last month Fin24 reported that Minister of Economic Development Ebrahim Patel said that government would prioritise bringing down data costs as part of developing an economy in line with the fourth industrial revolution.
Patel spoke on efforts made to develop the economy to be more inclusive during the debate in Parliament following the State of the Nation Address.
Patel further stated that government would focus on bringing down data costs through the competition market inquiry into data services and expand the infrastructure for data by finalising the release of a new telecommunications spectrum.
Last year Icasa stepped into the ongoing row between consumers and network providers over the high cost of data by releasing draft regulations on out-of-bundle data pricing and expiry.
Icasa stated that costs were still not consistent with the Consumer Protection Act, according to the National Consumer Commission (NCC).
The draft regulations propose that network providers give data depletion notifications at regular intervals, as well as notifications when the data bundle has run out and an option to buy additional bundles - which still did not address out-of-bundle rates.
Responding to Icasa regulation SA networks extended the validity of data bundles resulting in a slash in rates.
MTN SA CEO Godfrey Motsa previously said that the network would be cutting data costs to 29c for its "Accidental users" who typically use less than 5MB per month, and those who use more could now expect to pay 60c out-of-bundle.
Follow @KyleVenktess
| 2023-10-01T01:26:19.665474 | https://example.com/article/9013 |
Q:
Can I develop a game on PC in Java and move it to Android?
I have fairly good experience with Java, but new to Android development. I would like to develop a 2D game which would have animations and online play.
Can I initially develop this game on my pc using Java and then implement in Android?
Will the canvas in Java be sufficient or should I use a game engine?
A:
It sounds like your goal here is just to make games.
Use LibGDX. With this Library you can test it and deploy it to Windows/Linux/Android/HTML5. It's also free.
A:
You would make it easier for yourself implementing a game framework. Also if you'd develop your game outside the android framework you might use libraries that don't exist on android.
I'd suggest you build and test it directly on android drom the first line of code you write while using a game framework.
You can however build a big part of your game as a jar library so you can re-use parts of it.
This library can then be imported in your android project and you can see if it runs (and your not missing libs etc)
A:
LibGDX is my weapon of choice, note though that many of the tutorials out there are set up pre-0.9.6 and quite a lot got changed in that update, rendering most of them useless. https://www.youtube.com/user/doctoriley has a decent series of tutorials which should give you a starting point (not exactly best practice but you get to understand how it all hangs together) and the code can be found at https://bitbucket.org/GQGK/creating-a-game-in-java-youtube-series/overview if you want it.
LibGDX is excellent, a layer on top of lwjgl which provides support for Android, desktop (win/lin/mac) and html5 (though frankly I'd say just use an applet instead as it's quite limited) and I believe work-in-progress iOS support too.
The documentation is relatively solid (though the wiki is incomplete and outdated) and it has been used in commercial projects.
| 2024-01-13T01:26:19.665474 | https://example.com/article/9980 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.