text:
Click any word in a definition or example to find the entry for that word
It's rude to stare.
He lifted his head and stared at her.
They sat on the balcony, staring out across the valley.
He walked up to the house and stared through the window.
She was staring at me, so I stared back.
This is the British English definition of stare. View American English definition of stare.
the process of giving freedom and rights to someone


text:
Favored Strategies for Facing Fiscal Constraint
A 2005 research study finds that, when higher education administrators at public colleges and universities face budget challenges, they prefer generating additional revenue and developing outside partnerships to taking across-the-board cost cuts. Position type also plays a part in determining strategy preferences.
By Mark Garrett
When economic times are tough, decisions about dealing with financial shortfalls vary greatly depending on who's doing the deciding. At least, that's what indicated by the study "The Influence of Financial Pressure on Academic Administrators' Selection of Management and Resource Allocation Strategies," which I conducted in 2005. The study used a survey to explore the type of management and resource allocation strategies that college and university administrators implement to handle fiscal constraint. The most preferred actions were activities that generated additional revenue or developed partnerships with outside entities. The least popular were those strategies that required any type of reduction in, for example, staffing, cost of instruction, or other forms of budget cuts.
While based on responses to earlier periods of economic difficulty, the study provides insight into the wide variety of management and resource allocation options available to higher education leaders and how a leader's position—chief business officer, provost, or academic dean—might affect the decision preference.
In Search of Preferred Strategies
The survey instrument presented 34 statements designed to address the issue of the ways higher education leaders at public institutions would prefer to deal with economic challenges. Each of the statements represented a specific resource allocation or management strategy that can be used to handle fiscal constraint. The survey queried administrators as to how likely they were to adopt a particular strategy, with choices based on a five-point Likert scale ranging from one (never) to five (always).
Examples of the type of resource allocation and management strategies that survey respondents could choose from included deferring maintenance, increasing the number of adjunct faculty, initiating a hiring freeze, and so forth. Use of the Factor Analysis statistical procedure reduced the 34 individual strategies to a total of 8 index variables:
1. Increase revenue generation and partnerships.
2. Increase technology.
3. Introduce innovation.
4. Reduce cost of instruction.
5. Reduce staff positions.
6. Reduce funding.
7. Reduce activities.
8. Adopt across-the-board funding reductions.
The attached table shows the resulting means for each of the 34 management and resource allocation strategies, based on the ranking preferences of provosts, chief financial officers, and academic deans. The higher the mean, the more likely the administrator was to implement the designated strategy. The table is organized by category and includes a miscellaneous category of strategies that did not factor into any of the other eight categories. The overall mean for each category was calculated by adding together the total means for each strategy in that particular category and then dividing by the number of strategies in the designated category. The table is organized such that the category with the highest overall mean is listed first, followed by the second-highest category, and so forth.
Overall, the most popular category of strategies chosen to be implemented by administrators was the one that could be defined as generating additional revenues for the institution and developing partnerships with outside entities. Other popular types of strategies among all administrators included increasing the use of technology, and implementing innovative strategies that focus on improving the overall operations of the institution through resource sharing and a greater emphasis on teamwork.
The categories of strategies not favored for implementation by administrators were those that result in any type of reduction, whether in positions, funding, or activities. It would appear that administrators do not want to implement resource allocation and management strategies that they perceive could potentially harm the institution. It should be noted that these are preferences—for example, most institution leaders "prefer" not to have to reduce staff or make other budget cuts. But, we have seen during this recession and others before it that, if necessary, institution leaders can and will make such cuts.
Analyzing the mean responses to specific strategies by category type indicates there are similarities as well as differences among administrators based on their staff positions, as to the likelihood they will implement certain responses to fiscal constraint. Analysis of the eight categories resulted in the following findings:
Increase revenue generation and partnerships. These options were quite popular among all three types of administrators, with the strategies of increasing fundraising and development and cultivating alternative funding sources being the most likely to be implemented of the 34 types presented in this study. Use of the ANOVA (analysis of variance) means tests found the mean difference in responses to the strategy of cultivating alternative funding sources to be statistically significant, with provosts and deans more likely than chief financial officers to prefer this way of dealing with fiscal challenge.
Increase technology. The actions that make up this category are generally favored by all three types of administrators, with provosts and CFOs more likely than deans to implement such initiatives. One only has to look around our campuses to see how much the use of technology has increased in our day-to-day operations and how technology solutions can increase productivity and efficiency.
Introduce innovation. Based on mean responses, it appears that all three categories of administrators were more in favor of implementing new and creative ideas as compared to some of the other types of strategies. CFOs were more likely than provosts and deans to implement reengineering work tasks. It makes sense that CFOs would spend time examining work-related tasks and seeking ways to improve them. However, CFOs indicated that they were less likely than provosts and deans to favor options that emphasize coordination and resource sharing among academic units, which is appropriate given the business officer's areas of focus.
Reduce costs of instruction. These are also popular among all three types of administrators. The cost of instruction can be significant for an institution of higher education, so seeking out methods to reduce this cost while not devaluing quality seems appropriate.
Reduce staff positions. Actions in this category are not overly popular, especially those that result in any reduction in the number of faculty. There is a significant mean difference among strategies that reduce the number of administrative positions, with deans being less likely than provosts and CFOs to opt for such human resources changes. It could be argued that deans are more closely aligned with the staffing needs of their departments and thus are not as willing as other administrators to reduce positions as a cost saver. At the same time, all three types of administrators favored reallocating positions when openings became available, with provosts exhibiting a significantly higher mean response than that of deans and CFOs. It should be noted that, during the current recession, a number of institutions have, in fact, cut positions (many in the adjunct area).
Reduce funding. The options in this category were not favored by those in any of the three surveyed positions. The strategy of deferring maintenance was found to have a statistically significant mean difference among administrators, with academic deans being less inclined toward deferring necessary renovations and upgrades than provosts and CFOs. Similar to the surmised reason why deans would be less willing to reduce positions, it could be argued that deans are also more in tune with the physical needs of their buildings, thus not as accepting as other administrators to deferring maintenance needs.
Reduce activities. Administrators were less likely to select the actions that make up this category. It is conceivable that administrators interpreted these strategies as resulting in a negative circumstance for their institution, and thus were less inclined to consider them.
Adopt across-the-board funding reductions. These options were not favored by administrators, as indicated by mean responses, although CFOs were more willing than provosts and deans to allocate funds based on equal increments across programs. It can be argued that provosts and deans realize the need to allocate additional funds to certain programs based on need, prestige, and other factors.
Miscellaneous strategies. Various resource allocation and management strategies that did not fit in one of the other eight categories were grouped in the miscellaneous section of the table. Although these options could not be categorized, they were still important to the study because of their popularity or lack thereof. For example, the idea of increasing student tuition and fees was favored by all administrators, especially provosts and CFOs. While not popular with the public or elected officials, raising tuition and fees is one sure way of generating additional income. Of course, in many states, the setting of tuition is controlled by the state legislature—so it is sometimes the case that CFOs and presidents might not want to raise tuition or have a preference for that strategy, but they have no other choice than to do so.
The strategies of encouraging the development of new programs, allocating funds based primarily on program needs, decentralizing and revamping administrative functions, and outsourcing services previously provided internally all exhibited significant mean differences in responses depending on administrator type. The strategy of limiting institutional enrollment is not one that is implemented by administrators to any great extent.
MARK GARRETT is graduate programs coordinator, Weldon School of Biomedical Engineering, Purdue University, West Lafayette, Indiana.

source: openbmb/Ultra-FineWeb


text:
NOTKIN, NATA (Nathan Note of Shklov, also Nathan Shklover; d. 1804), Russian merchant and army contractor. Notkin was a champion of the improvement of the status of Jews in Russia at the beginning of the 19th century. Born in Shklov, he lived in Mogilev and later in Moscow and St. Petersburg. He was introduced by General Zorich, the squire of Shklov, to Count Kurakin, and used this opportunity to act in behalf of his fellow Jews. He presented the count with a project for the establishment of large-scale agricultural colonies for the Jews of "New Russia" as well as plans for industrial plants near the ports of the Black Sea, which he hoped would direct the Jews to productive labor. Toward the end of 1802 he was invited by G.R. *Derzhavin to be a member at the Committee for the Betterment of the Jews. In all of his writings and projects Notkin tried to demonstrate to the government ways to improve the condition of the Jews, e.g., the gradual removal of Jews from the liquor business, the establishment of Jewish schools, and the direction of Jews toward productive labor. Notkin was one of the founders of the St. Petersburg Jewish community.
[Encyclopaedia Judaica (Germany)]

source: HuggingFaceFW/fineweb-edu


in the phloem sap reaches the sugar sink, it must be unloaded
What happens once the phloem sap reached the sugar sink?
unloaded by the sucroseH+ transport protein and ATPase to sink cells, now V is lower outside the phloem (in the sink cells) so there is bulk flow of water through osmosis out of the phloem to xylem and sink, once there is increased water in the xylem bulk flow will start there as well and the water will be moved back towards the sugar source via the xylem
How is C stored and then mobilized?
C is stored as polysaccharides in granules in the chlpst of leaves or in plastids of parenchyma cells of storage roots or stems.
enzymes are utilized to either polymerized glucose into starch when sugar is plentiful, or, other enzymes depolymerize starch into glucose and then glucose is loaded into the phloem for transport to whatever the glucose is required.
What happens when C changes in C storage?
whether an organ is a sugar sink or source can change as demand for C changes, the demand may vary from season to season and even day to night in some cases.
How is water of the xylem sap held together?
cohesion: which is simply identical compounds sticking together
Please allow access to your computer's microphone to use Voice Recording.
Having trouble? Click here for help.
We can't access your microphone!
Reload the page to try again!
Press Cmd-0 to reset your zoom
Press Ctrl-0 to reset your zoom
Please upgrade Flash or install Chrome
to use Voice Recording.
For more help, see our troubleshooting page.
Your microphone is muted
For help fixing this issue, see this FAQ.
Star this term
You can study starred terms together
NEW! Voice Recording


text: In this paper we show how using a representation of an elliptic curve as the intersection of two quadrics in $\PP^3$ can provide a defence against Simple and Differental Power Analysis (SPA/DPA) style attacks. We combine this with a 'random window' method of point multiplication and point blinding. The proposed method offers considerable advantages over standard algorithmic techniques of preventing SPA and DPA which usually require a significant increased computational cost, usually more than double. Our method requires roughly a seventy percent increase in computational cost of the basic cryptographic operation, although we give some indication as to how this can be reduced. In addition we show that the Jacobi form is also more efficient than the standard Weierstrass form for elliptic curves in the situation where SPA and DPA are not a concern.


Mathematics and Clinical Concepts, Part V: Using Relations to Organize Clinical Information
We saw in the last post that taking the Cartesian product of two sets results in a collection of ordered pairs. Now, we are going to explore how ordered pairs and larger groupings can be used to organize information using relations.
Here is the definition of a relation taken from Discrete Mathematics with Applications, by Epp:
Let A and B be sets. A relation R from A to B is a subset of A x B. Given an ordered pair (x, y) in A x B, x is related to y by R, written x R y, if, and only if, (x, y) is in R. The set A is called the domain of R and set B is called its co-domain. (1)
This definition makes it clear that a relation R is a subset of the Cartesian product of two sets. It further clarifies that the subset of ordered pairs contained in the relation is determined by whatever R is. Here is an example. Suppose we have two sets: A= {1, 2, 3}, B = {2,3,4}. The Cartesian product of these two sets is the set of ordered pairs:
A x B = {(1, 2), (1,3), (1,4), (2,2), (2,3), (2,4), (3,2), (3,3), (3,4)}
From here, we can define a relationship on A x B that selects out the type of ordered pairs we are interested in. Let's say we are interested in a relation x R y where R = x < y. Analyzing A x B, we can see that the ordered pairs that fulfill the x < y relation are:
x R y = {1,2), (1,3), (1,4), (2,3), (2,4), (3,4)}
Using relations
Even though relations are defined as a subset of a Cartesian product, there is no requirement that they be generated in that way. Here is a clinical example. Suppose we are building a clinical app and the goal is to track patients and their diagnoses. We can began by defining a relation from the set of patients to the set of diagnoses – specifically that a patient x has diagnosis y. We will call this relation Problem List (PL). (The ellipses indicates that there are many more pairs than are listed.)
PL = {(Doe, headache), (Smith, chest pain), (Green, asthma), …}
This relation could have been created by taking a list of patients and a list of diagnoses, generating the Cartesian product, then checking each pair to see if it actually represents a real situation (i.e., Mr. Doe actually has complained of headaches). However, it could just as easily have been generated by clinicians adding patient problems into our app. The important thing is that relations obey certain mathematical rules, and we can make use of those rules for any relation regardless of how it was created.
Databases and relations
Since we know that relations are derived from sets, we can use a relation to generate a set. For example, we know that ordered pairs in the relation PL have a patient's name for the first value and a diagnosis for the second. With this knowledge, we could reconstruct the set of all known ailments (at least among this patient population) by simply collecting into a set all of the diagnosis elements from the ordered pairs. We could do the same with the patient elements and find everyone who has at least one problem. Assuming the pairs exist in our software as a collection of PL objects, we could generate the list of all ailments using code similar to this:
Add_SecondValue to Ailment_List
Of course, there is no reason to limit the relation to ordered pairs (referred as a binary relation); relations may have an arbitrary number of elements. Such relations are referred to as n-ary relations, and they are the starting point for relational databases.
We can expand our PL relation to contain more elements by adding DOB, diagnosis date and doctor.
Expanded PL = (Name, DOB, Diagnosis, Diagnosis_Date, Doctor)
(Doe, 12/15/1967, headache, 03/15/2013, Jones)
(Smith, 06/07/1949, chest pain, 05/11/2013, Brown)
(Green, 10/09/1988, asthma, 09/25/2013, Smythe)
Using this relation, we can ask more complex questions such as: "How many doctors are there?"; "Who has asthma"; "When was Mr. Doe diagnosed with a headache?" Relational algebra, the mathematical basis of relational databases, provides the formal rules for manipulating n-ary relations (queries, joins, selections, projections, etc.).
Equivalence relations
Thus far, I have discussed relations between two or more sets. However, relations on a single set are interesting and useful as well. Using relations on a single set, we can explore general relation properties such as reflexivity, symmetry, and transivity (1). Let's start with a clinical example. Suppose we have a set of terms for medical ailments.
A = {MI, myocardial infarction, hypertension, HBP, high blood pressure, …}
We will apply the relation: x R y such that R= x is a synonym for y. A set of ordered pairs that meet this requirement is listed below.
x R y = x is a synonym for y = {(MI, MI), (myocardial infarction, myocardial infarction), (MI, myocardial infarction), (myocardial infarction, MI), (hypertension, HBP), (HBP, high blood pressure), (HBP, hypertension), (hypertension, high blood pressure), (high blood pressure, hypertension), high blood pressure, HBP), (HBP, HBP), (hypertension, hypertension), (high blood pressure, high blood pressure) }
Pairs such as (MI, MI) and (high blood pressure, high blood pressure) demonstrate reflexivity because each term is synonymous with itself. This is the same as saying x is a synonym for x.
Symmetry is illustrated by pairs such as (MI, myocardial infarction), (myocardial infarction, MI), which demonstrate that the relation is bi-directional. In other words, it shows that just as x is related to y, y is related to x. In plain English: MI is a synonym for myocardial infarction (MI, myocardial infarction) and myocardial infarction is a synonym for MI (myocardial infarction, MI).
The pairs (hypertension, HBP), (HBP, high blood pressure), (hypertension, high blood pressure) demonstrate the link between terms. Namely, hypertension is a synonym for HBP; HBP is a synonym for high blood pressure; therefore, hypertension is a synonym for high blood pressure.
Any relation that exhibits reflexivity, symmetry, and transivity is referred to as an equivalence relation (1).
If a relation is an equivalence relation, it can be used to generate equivalence classes. An equivalence class is the set of all terms that are related to a specific term in the relation (1). An equivalence class is represented symbolically as [a] (1). Thus the equivalence classes for hypertension and myocardial infarction are represented as:
[hypertension] = {HBP, high blood pressure, hypertension}
[myocardial infarction] = {MI, myocardial infarction}
Equivalence classes can be useful in a number of situations. For example, using the above synonym relation, we could create a thesaurus that could automatically map synonyms to a preferred term. One possible use case would be mapping various terms in an EHR to the preferred SNOMED term for that ailment.
Partial-order relations
Mathematically speaking, partial order relations are relations on a single set that are reflexive, transitive, and anti-symmetric. Partial order relations are useful for organizing things into hierarchies. A good example of a partial order relation for real numbers is "<=". Using this relation, numbers can be sorted in ascending order: 1<=2<=3<=4…
Partial order relations are everywhere. Courses for a college major have prerequisites and must be taken in a specific order. If we say that for a biology degree, the courses that must be completed are the set {101, 102, 115, 201, 202, 234, 267, 301, 305, 410, 421, 431}, and lower-numbered courses must be completed before those with higher numbers, this represents a type of less-than relation.
This prerequisite relation will contain pairs such as (101,101), (202,202), thereby demonstrating reflexivity. (Of course, we can ignore this property when advising students.)
Anti-symmetry enters the picture because pairs such as (101, 201) and (201, 301) are included, indicating that 101 must be taken before 201 and 201 must be taken before 301. However, it is impossible to take 201 before 101 or 301 prior to 201. Therefore, these relations are not symmetric; they go only one way—from lower to higher.
Finally,


Kabalabarhisha, Kabalabarhiṣa: 1 definition
The Sanskrit term Kabalabarhiṣa can be transliterated into English as Kabalabarhisa or Kabalabarhisha, using the IAST transliteration scheme (?).
In Hinduism
Purana and Itihasa (epic history)
[«previous next»] — Kabalabarhisha in Purana glossary
Source: archive.org: Puranic Encyclopedia
Kabalabarhiṣa (कबलबर्हिष).—A King of Vṛṣṇivaṃśa. (See under VṚṢṆIVAṂŚA).
Purana book cover
context information
Discover the meaning of kabalabarhisha or kabalabarhisa in the context of Purana from relevant books on Exotic India
See also (Relevant definitions)
Relevant text
Like what you read? Consider supporting this website:


Climate impact induced crisis in Europe: an exploration of scenarios
Submitted by Robin Hocquet | published 9th Oct 2020 | last updated 17th Feb 2021
Flooded street in Venice
Major concurrent coastal and river flooding in Europe could result in widespread destruction of property and cause a financial crisis. Photo: Roberto Trombetta / Flickr - CC BY-NC 2.0
Given the reality of globalisation, climate risk is in many cases "borderless" in nature. Climate impacts in one country will create risks and opportunities in other countries, due to cross-border connectivity within regions and globally.
PlanAdapt, in collaboration with Global Climate Forum, conducted a study on near term climate impacts with significant economic risks for the European economy. The relevance of climate impacts for Europe was explored through the development of qualitative future scenarios. Climate-impact induced crises in Europe may be triggered by climate impacts occurring either within or beyond Europe and can be triggered by both direct physical impacts on people or physical assets and indirect impacts. Indirect impacts refer to all impacts that are not direct physical impacts and can be categorised as supply chain interdependencies and financial system interdependencies.They may be beyond the range of typical experience.
The report provides orientation regarding potential future developments by examining six scenarios of climate impacts that can trigger social, political, economic or financial crises in Europe in the next decade. The scenarios have been identified through literature review and interviews with domain experts
*Download the full publication from the right-hand column. The key messages from the publication are provided below. See the full text for more detail.
*The study was embedded in the "Transformative responses to the crisis" project by Finance Watch Deutschland and Heinrich-Böll-Foundation that aims at developing scenarios for future economic and financial crisis and creating policy proposals that transform our economic system towards sustainable economies.
Crisis Scenario 1: Major flooding in central and western Europe
 - Scenario: Major river flooding in central Europe or coastal defence failure during a major storm surge in western Europe, causing hundreds of billions in damages.
 - Climate change contribution: Sea-level rise of 4 cm per decade; and increases in precipitation intensity.
 - Exposure: Assets and population in coastal and river floodplains; e.g. €130 billion in physical assets in Germany alone.
 - Critical threshold:
 - Direct impacts: Impacts greater than 1% EU GDP attained for 1-in-250 year flood in Germany, Austria, Czech (€198 billion in damages).
 - Indirect impacts: Overwhelmed disaster risk financing mechanisms lead to slow recovery and depression.
Crisis Scenario 2: Drought in southern Europe
 - Scenario: Prolonged drought in southern Europe leads to crop loss, decreased tourist arrivals, and conflict between water users. Social unrest exacerbates the economic impacts leading to economic crisis.
 - Climate change contribution: Increasing temperature and decreasing precipitation in southern Europe likely across even low emission scenarios.
 - Exposure: Farmers and tourism operators in southern Europe: e.g. tourism contributes more than 10% of GDP in Mediterranean countries, and agricultural is large employer.
 - Critical threshold:
 - Direct impacts: Agriculture production loss and tourism losses (€30 billion); decreased household water consumption.
 - Indirect impacts: Conflicts and unrest lead exacerbate slowdown leading to economic crisis (€110 billion).
Crisis Scenario 3: European electricity grid vulnerability
 - Scenario: Power supply failure due to an extreme weather event (e.g. storm, flooding) or a demand peak, during cooling water shortages due to drought and high temperatures.
 - Climate change contribution: Increases temperature and droughts, reducing cooling water availability for energy sector.
 - Exposure: Regions with water scarcity, high cooling water needs and electricity demands peaks e.g. for air conditioning.
 - Critical threshold:
 - Direct impacts: Relatively small direct impact threshold, if it triggers failure of interregional transmission during period of low production capacity.
 - Indirect impacts: Blackouts longer than a few days, as critical infrastructure breaks down, can trigger crisis.
Crisis Scenario 4: US coastal real estate market collapse
 - Scenario: Flooding induces a rapid drop in US coastal real estate prices inducing a global financial crisis.
 - Climate change contribution: Global mean sea-level rise of 4cm/decade sea-level rise, possibly accelerating beyond 2050.
 - Exposure: US coastal real estate in the 1-in-100 year coastal flood plain ($1.4 trillion); and system-relevant investors exposed to these risks, e.g. as owners or lenders.
 - Critical threshold:
 - Direct impacts: Modest flood events (e.g. Superstorm Sandy, $65 billion in damages) may trigger a major correction across several regional real estate markets.
 - Indirect impacts: Difficult to quantify financial crisis inducing thresholds in advance; depends on exposure of European financial institutions.
Crisis Scenario 5: Global agricultural supply chain collapse
 - Scenario: Extreme weather events in key producing regions and transportation hubs disrupting agricultural trade flows.
 - Climate change contribution: Increase in frequency and intensity of extreme weather events affecting production and transportation networks (e.g. ports).
 - Exposure: Small, open industrialised economies, of which Europe has many, highly dependent on agricultural imports.
 - Critical threshold
 - Direct impacts: Crop losses (greater than $1 billion in value) in multiple world regions due to extreme weather.
 - Indirect impacts: Concurrent with transportation hub disruption, e.g. storm damage and flooding of key ports, leading to food price spikes, and protectionist policy responses
Crisis Scenario 6: Large-scale migration due to conflicts in Africa
 - Scenario: Temperature rises, and prolonged droughts in Africa, and particularly the Sahel region, leads to decreasing agricultural production, which in turn leads to the outbreak of armed conflicts and state collapse. Large-scale migration ensues resulting in a migration crisis in Europe.
 - Climate change contribution: The link between climate and armed or violent conflict is contentious.
 - Critical threshold
 - Direct impacts: One mechanism for increasing conflict risk is that drought leading to agricultural failure can in turn lead to large-scale internal displacement from rural areas to urban centers.
 - Indirect impacts: Indirect impacts that could trigger a migration crisis in Europe would be migrant arrivals exceeding those of the past decade. A survey of demographics in Sahelian countries, and past experiences in regard to the proportion of migrants that flee conflict and civil war, shows that major conflict in Sahelian countries does have the potential to produce crisis in Europe.
Discussion and Conclusions
The six climate-induced crisis scenarios until 2030 show that threats to Europe arise from a range of different hazards in different parts of the world, and that climate change is already increasing the likelihood of these events.
Climate-induced crisis remain however‚ tail risk' events for Europe at least in the relatively near-term. The first one is a tail risk of an event or conjunction of events that can be quantified with some (low) probability, such as flooding events, where adaptation or preparation measures might be calculated. A second type of tail risk' events are those for which it is not possible to assign probabilities, such as electricity grid failures and US real estate correction leading to a global financial crisis and conflict migration. Measures to reduce these risks can be taken on a more 'precautionary principle' or 'no regrets' basis, aiming to adjust systems in such a way as to avoid that these risks materialise at all.
Another important observation is that for nearly all of the scenarios discussed above climate change interact with one or several other socio-economic conditions in order to produce the scale of impacts needed to induce a crisis.
The key role played by socio-economic conditions in crisis scenarios points to the need for responses to these crises that do not simply return to business-as-usual, but rather that improve resilience to such events in the future, or avoid their occurrence altogether, i.e. to "build back better".
Finally, the authors emphasise that a lack of considering long-term resilience in economic recoveries, would leave such recoveries prone to failure, laying the seeds for the next, even more catastrophic collapse.


text:
Dogs may use Earth's magnetic field to navigate
A team of researchers from Czech University of Life Sciences, Virginia Tech and Barry University has found evidence that suggests dogs may use Earth's magnetic field as a navigational aid. In their paper in the eLife Sciences initiative, the group describes their study of dog navigation and what they learned from it.
Prior research has shown that dogs tend to orient themselves in a north-south position when urinating a finding that suggests they may have the ability to sense the Earth's magnetic field. In this new effort, the researchers conducted two experiments to further study magnetic field sensing in dogs and whether they use it for navigation.
The two experiments were essentially the same, they both involved attaching GPS sensors to multiple dogs, taking them out into a natural environment and releasing to run about. In all cases, the dogs soon returned to the person who had released them. The only difference in the experiments was the number of dogs involved, in the first, it was just four, and in the second it was 27.
In studying the routes the dogs took, both when heading out on an expedition and when returning, the researchers found they used one of two types of return. The first was called tracking, which meant a dog made its way back by following the same path it had taken out presumably using its nose. The team called the other type of return scouting, because the dogs followed an unfamiliar path to get back to where they had begun their adventure. The researchers also found something else, for a large percentage of the scouting returns, the dogs first engaged in an odd behavior. They ran north-south along a 20-meter length a few times before heading back to their starting point, doing so appeared to help the dogs get their bearings, as those that did it were more efficient in their return.
The researchers suggest the north-south running is evidence of the dogs using the magnetic field to orient themselves in unfamiliar surroundings, which in turn helps them find their way home. Further testing involved the owner hiding as the dog made its trek, testing wind direction and speed and noting the gender of the dog. No other factors made a difference in improving navigational efficiency, further supporting the idea that the dogs were able to use the Earth's magnetic field to navigate.
Bob Yirka, Phys.org


Historical data on timing of ringing of nestling birds
The dates at which nestling birds were historically ringed by volunteer ringers yields information about the timing of breeding seasons. The current dataset consists of ringing data of nestling birds over the period _PHONE_. Fieldnames are largely self-explanatory, data follows the EURING 2000+ code. For a detailed explanation and preferred citation, see the link in the field 'Relation', below, or paste the following URL in your browser _URL_ The dataset consisted of 157.978 records at 14-2-2014. More data will be added during 2014 and 2015.Belong to publication:... nioo ....
Date made available17 Feb 2014
Temporal coverage1911 - 1959
Date of data production1911 - 1959
Cite this


text:
Case 1: Workers has different rates
Work rate × Time to finish the job = 1 job done
Work rate = (1 job done) / (Time to finish the job)
Time of doing the job = (1 job done) / (Work rate)
Albert can finish a job in A days
Bryan can finish the same job in B days
Carlo can undo the job in C days
1/A = rate of Albert
1/B = rate of Bryan
1/C = rate of Carlo
Albert and Bryan work together until the job is done: (1/A + 1/B)t = 1
Albert is doing the job while Carlo is undoing it until the job is done: (1/A - 1/C)t = 1
Lejon can finish a job in 6 hours while Romel can do the same job in 3 hours. Working together, how many hours can they finish the job?
Case 2: Workers has equal rates
Work load = no. of workers × time to finish the job
Work done = no. of workers × time of doing the job
To finish the job
Work done = Work load
If a job can be done by 10 workers in 5 hours, the work load is 10(5) = 50 man-hours. If 4 workers is doing the job for 6 hours, the work done is 4(6) = 24 man-hours. A remaining of 50 - 24 = 26 man-hours of work still needs to be done.
Eleven men could finish the job in 15 days. Five men started the job and four men were added at the beginning of the sixth day. How many days will it take them to finish the job?


How to create and enforce employee termination procedures
In this Ask the Expert Q&A, Shon Harris, our security management expert, reviews how the the security group, HR and management should work together to define and enforce employee termination policies, and reviews what should be done during each stage of employment.
The following are specific strategies for building a structure for dealing with employees even before they are hired.
Step 1: Before employment begins
Perform background checks on all personnel prior to hiring them. The degree of this should depend on the employee's position and the level of access to company resources the individual will have. For example, someone applying for an entry-level position at a paper mill will not require the same level of background check as someone applying for a position with the Secret Service. However, if the individual were applying for a position within the paper mill that has access to funds or other sensitive materials, a more thorough check would be in order.
Due to the sensitive nature of background checks, it's wise to consult with legal counsel, before conducting one, regardless of the intended depth. This can help you determine if there are any state/federal legal restrictions and obligations you must abide by, and help avoid any legal troubles.
Step 2: Hiring and orientation
The hiring and orientation process is your first direct chance to stress security's importance within the organization and to equip employees with proper security awareness training, as well as their position's security requirements. Your organization should require that new employees sign a non-disclosure agreement, promising to protect sensitive and confidential data. During the security awareness training, employees should also sign a document stating they have read and understand the company's security policies and the ramifications for non-compliance. These signed documents will protect the company in a legal capacity, if it needs to suspend, terminate or prosecute an employee for their actions.
Establishing a level of expectation from the beginning makes it easier to maintain during the course of their employment. The management team and supervisors should also work together to understand and enforce the messages the employees are exposed to during orientation.
Step 3: Employment
Security training doesn't end with orientation. It's an ongoing process that should continually evolve to meet the needs of the organization. Security requirements will change from one organization to another and, depending upon the security needs of the environment, some practices may be more appropriate than others. For instance, repeated background checks may be necessary to determine if an employee has become a security risk. Once again, if this were necessary, to avoid serious legal repercussions, having legal counsel present would be in your company's best interest. Also, if any actions are taken as a result of information gleaned from an investigation, it should be cleared with an attorney.
Throughout the duration of employment, every employee should have a supervisor who understands that they are not only responsible for this person's performance, but also for this person's lack of compliance. Therefore, supervisors must be aware of the expectations of their staff, follow up and ensure expectations are met, be told if an employee contributes to an incident and know how to deal with incidents properly. When dealing with governance and compliance, it is of utmost importance that senior and mid-level management understand these topics even more so than the employees, because they'll be the enforcers.
Step 4: After the employee termination
When an employee leaves, whether voluntarily or involuntarily, there is always a degree of risk involved. Therefore, it is vital that the process be as fluid as possible. Holding an exit interview reduces this risk as it is a good time to remind employees that they are legally bound to comply with the organization's security policies, as dictated by the non-disclosure and confidentiality agreements they signed. Additionally, it is important to retrieve physical items like keys and keycards, disable accounts, and deactivate the employee's access to areas and services that were once privilege. This will prevent them from remotely accessing services and information they should not be.
The team responsible for your organization's security polices should take these steps into account, because the greatest vulnerability can be the people that work for the organization. However, it's important to remember that while the security team helps create the policies and procedures for suspending a user's access, they should not be the ones to make the decision.
Unfortunately, employee termination is inevitable. To minimize the risks that a termination can create, it's important to plan accordingly for this situation. With that said, use this checklist, which highlights key factors to consider when developing employee termination procedures:
 - Always have at least one other individual present when informing any employee of their termination. For instance, have a meeting with the employee, their supervisor and a human resource manager. Do not fire them in a public manner -- that can be embarrassing and draw further attention to the situation.
 - Deactivate access to the network and vital services that the employee once had.
 - Retrieve all physical access devices such as IDs, keys and smart cards.
 - An exit interview should always be performed.
 - The employee must return any equipment that is the property of the organization, including any off-site devices.
 - Notify HR prior to terminating an employee, so they can prepare final paychecks (including vacation pay) and the exit interview. Also, discuss employee benefits (health insurance, stock options, retirement, life insurance, etc.) with human resources, so the proper steps are taken to either transfer or cease these benefits with the employee's knowledge and understanding.
 - Return any personal property from to the employee's work space. Inspect and examine any media or documentation that may contain confidential or proprietary data and information that is the legal property of the organization.
The most important thing to remember about a termination procedure is that without it, an organization may find security gaps and other security vulnerabilities that someone, the disgruntled employee per say, can take advantage of. While organizations don't like to terminate their employees, with the proper procedures they should be able to handle this unfortunate scenario.
This was first published in April 2006
Dig Deeper on Network Access Control Basics
Have a question for an expert?
Please add a title for your question
Get answers from a TechTarget expert on whatever's puzzling you.
You will be able to add details on the next page.
Forgot Password?
Your password has been sent to:


text:
Unsaturated Soils: A fundamental interpretation of soil behaviour
June 2010, Wiley-Blackwell
This price is valid for United States. Change location to view local pricing and availability.
Other Available Formats: Paperback
The study of unsaturated soil is a practical subject, linking fundamental science to nature. Soils in general are inherently variable and their behaviour is not easy to analyse or predict, and unsaturated soils raise the complexity to a higher level. Even amongst practicing engineers, there is often lack of awareness of the intricacies of the subject. This book offers a perspective of unsaturated soils based on recent research and demonstrates how this dovetails with the general discipline of soil mechanics.
Following an introduction to the basic soil variables, the phases, the phase interactions and the relevance of soil structure, an up-to-date review of laboratory testing techniques is presented. This includes suction measurement and control techniques in triaxial cell testing. This is followed by an introduction to stress state variables, critical state and theoretical models in unsaturated soils.
A detailed description of the thermodynamic principles as applied to multi-phase materials under equilibrium conditions follows. These principles are then used to explore and develop a fundamental theoretical basis for analysing unsaturated soils. Soil structure is broken down into its component parts to develop equations describing the dual stress regime. The critical state strength and compression characteristics of unsaturated soils are examined and it is shown how the behaviour may be viewed as a three-dimensional model in dimensionless stress-volume space. The analysis is then extended to the work input into unsaturated soils and the development of conjugate stress, volumetric and strain-increment variables. These are used to examine the micromechanical behaviour of kaolin specimens subjected to triaxial shear strength tests and lead to observations not detectable by other means.
Unsaturated Soils: A fundamental interpretation of soil behaviour covers a rapidly advancing area of study, research and engineering practice and offers a deeper appreciation of the key characteristics of unsaturated soil. It provides students and researchers with a framework for understanding soil behaviour and demonstrates how to interpret experimental strength and compression data.
- provides engineers with a deeper appreciation of key characteristics of unsaturated soils
- covers a rapidly advancing area of study, research and engineering practice
- provides students and researchers a framework for understanding soil behaviour
- shows how to interpret experimental data on strength and compression
- the limited number of books on the subject are all out of date


$ realizing $\delta$, the following holds: $0\in H$ if and only if there exists $x_k$ with $\langle P, P-x_k\rangle >0$. (Very compact proof: If one of those exists, one can reduce $\delta$ by using the method of 3. As the new minimum may not lie on the boundary as it has not been found in the first run, $0\in H$ has to hold. Otherwise assume $0\in H$ and no scalar product fulfills the given condition. Then one can write $0$ as convex combination of the $x_i$ and express $0<||P||_2^2=\langle{P,P-0}\rangle$ and, using linearity of the scalar product, show that this is $\leq 0$ and thus getting a contradiction).
Putting all of this together one yields the following algorithm:
 1. Init $d_\min = \infty$.
 2. For $i\in\{0,\ldots, n-1\}$ do:
 1. Compute $n_i$ = $||x_i||_2^2$
 2. For ($j \in \{i+1,\ldots, n-1\}$ do
 1. Compute $s_{i,j}=\langle x_i, x_j\rangle$.
 2. Compute $n_j=||x_j||_2^2$.
 3. Decide:
 - If $s_{i,j}\geq n_i$ set $d=n_i, c=1$.
 - If $s_{i,j}\geq n_j$ set $d=n_j, c = 0$.
 - Else set $c = (n_i-s_{i,j})/(n_i+n_j-2s_{i,j})$ and $d=n_i- (n_i-s_{i,j})\cdot c$.
 4. If $d (1-c)s_{i,k}+c s_{j,k}$ return 0.
 4. Return $d_\min$.
This algorithm is based on the rules 1-5 above, however, the conditions are formulated a bit more efficient. Please apologize the incomplete reasoning. I found this solution appealing as it allows a lot of optimization in my special scenario. I already computed all norms of the $x_i$ somewhere else, so this is no further effort. Furthermore, the parent algorithm scans a set of values, successively replacing one $x_i$ with another $x_i'$ and then again computing the distance to the convex hull. This means that most of the distances can be saved and used later and for each iteration I only have to do very little work in updating and computing very few (as for my main problem, where $n=4$ it is 3) scalar products.
Thank you for your support and the in fact very valuable input.
share|improve this answer
Your Answer


The residential landscape in Australian capital cities is evolving to demand a better use of space and increased functionality, to service what is becoming a higher and denser population. It is vital that housing availability adapts to provide for the population, with the continued trend away from detached housing to multi-residential or higher density living.
This white paper examines the factors driving the changing residential landscape in Australia, and the need to create living spaces that are efficient, functional and sustainable.
Privacy Policy | Terms and Conditions


Kids Health
Senses Experiment: No Flavor Without Saliva
Senses Experiment: No Flavor Without Saliva
(Experimento: No hay sabor sin saliva)
 - A friend or two
 - Paper towels
 - Foods to taste (cookies, crackers, pretzels, or other dry food)
 - Drinking water for everyone
 1. Use a clean paper towel to dry off your tongue.
 2. Taste each food, one by one. How does it taste?
 3. Have a drink of water.
 4. Taste each food again, letting your saliva do its magic!
Your Tongue
What Are Taste Buds?
Reviewed by: Eric H. Chudler, PhD


text:
This action is used to get a tile index on a given layer. The layer is specified from the layer name given (a string, as used to name the layer in the Room Editor), and then you give an x and y position to find the tile to get the index of. The tile will be the one that the given position falls within in the room, and the index will be returned to the target variable. The x and y position can be flagged as being relative to the position of the calling instance, and the target variable can be flagged as a temporary (local) variable that can be used until the end of the event.
Argument Description Layer The layer to set the tile on x The x position to check y The y position to check Target The target variable to store the tile index
The above action block code checks for a mouse left button press and if one is detected it gets the index of the tile cell that the position of the mouse falls within. This tile index is then checked and if it is not 0, it is set to 0.


text:
How to access the Rate of Rise graph on IKAWA Pro App
During the roast the 'actual' RoR is also mapped on the graph (in yellow). This allows you to see how the actual RoR is following the prescribed one, which is particularly useful to see if the roast 'stalls' after first crack, or how the roaster managed the beans going exothermic, then compensating quickly afterwards.
The IKAWA Pro Sample Roaster measures the temperature every second to the nearest 1/10th of a degree Centigrade, and you can see this level of precision on the Actual line of the Temperature graph during a roast. The readings for the Actual RoR are based on the temperature measurements at 15 second intervals. We have not applied any 'smoothing' algorithms, so the graph looks slightly angular, but is very useful for showing the trend.
If users want to delve even deeper into looking at Rate of Rise per second, you can do this by exporting the data for each second of the roast in CSV format and doing some analysis on excel. Our Roast Log feature means you can download unique roast data from all roasts you do on the 2.0 app.
WHY IS RATE OF RISE IMPORTANT?
The rate of rise is the speed that temperature increases (or decreases) during the roast at any given time – for further reading there's a clear and articulate post about this by Morten Münchow on Coffee Minds. Conventional wisdom is that from just after the Turning Point, a good roast will have a steadily decreasing RoR.
The IKAWA roaster has the ability to heat up very quickly – much faster than conventional sample roasters, or large roasters too, and the small batch size means the Turning Point tends to happen within the first minute.
In our experience, people pay most attention to the end of the roast. At the time of the first crack, it's particularly important to be aware of the RoR and use it to ensure roast profiles are getting the best from the coffee.
After first crack, the temperature itself should continue to rise slowly, but if that Rate of Rise increases after first crack it can make the coffee baked – even on light roasts. Matt Perger's excellent Let's Talk About Roasting post quotes Sang Ho from Square Mile by referring to it as the Flick of Death.
Similarly, it's important that the roast doesn't stall after first crack. This will happen if the rate of rise goes negative – i.e. temperature in the roast chamber decreases. This can lead to underdeveloped coffee and the qualities that go with that.
We'd love to know how this feature helps you to design and amend your profiles, and even translate them to larger roasters. Please drop us a line at _EMAIL_.


text:
How to Build A Hay Box
A hay box (or hay cooker, insulated box, straw box or fireless cooker) is a method of cooking that saves energy.
From Wikipedia: "Food items to be cooked are heated to boiling point, and then insulated. Over a period of time, the food items cook by the heat captured in the insulated container. Generally, it takes three times the normal cooking time to cook food in a hay box."
Hay and straw, even blanketing can be used as insulation — but we now have so many insulation options. A quick trip to a big hardware store reveals that, that we can build super-insulated hay cookers.
This is old technology that is now being revived. You can get fancy with the box building it out of wood or as in the following video keep it simple by using a cardboard box. According to Wikipedia, in the past, "Some types were provided with soapstone or iron plates which were heated during the preliminary cooking on the stove and then placed in the fireless cooker either over or under the cooking pot. In these types, a non-inflammable insulating material was used."
Advantage: Can save on huge amounts of energy. Risk/Disadvantage: Again via Wiki "…there is a risk of bacterial growth if the food items are allowed to remain in the danger zone for one or more hours. For this reason, food cooked in hay boxes is normally reheated to boiling before eating. Using a food thermometer eliminates the guesswork."
In this video Aaron Mackley shows us how to build a hay box using a cardboard box, styrofoam panels and aluminum foil. I would probably go with an insulator other than styrofoam, especially around something hot because it is just nasty, toxic stuff, but…


Ψάξε όποια λέξη θες, όπως b4nny:
Sprattah (Noun): A small desert island off the coast of Scotland. No one understands why it is a desert and has a temperature of 200 degrees C when Scotland rarely has a temperature of anything higher than 2 degrees C.
Sprattah is a real island I tell you!
από Protome 25 Μάρτιος 2008
Words related to Sprattah
200c island protome scotland


text:
The Goddess Blessing is one of the most unique characteristics of Shaiya. Each side of the war seeks the Blessing of their Goddess. Points for the Goddess Blessing are awarded when you slay a member of the opposing faction or when you destroy an enemy relic. The Goddess Blessing is bestowed not only upon you, but the entire realm. The blessing has a multitude of positive effects on you and your faction.
Benefits of Goddess Blessing
- Increased success rate for upgrading weapons.
- Increase in attack power.
- Increase of maximum HP, MP, SP.
- Increase of HP, MP, SP restoration during rest.
- Increase of MP, SP power restoration during the major battle.
- Increase of Magic Attacking Power.
- Increase of Defending Power (physical, shooting, magic).
- Reduced experience value loss during resurrection.
- Reduced repair costs of damaged equipment.
- Reduce cool-down time when consuming items.


›› Convert kilogram-force to megapond
›› More information from the unit converter
How many kgf in 1 megapond? The answer is 1000.
We assume you are converting between kilogram-force and megapond.
You can view more details on each measurement unit:
kgf or megapond
The SI derived unit for force is the newton.
1 newton is equal to 0.10197162129779 kgf, or 0.00010197162129779 megapond.
Use this page to learn how to convert between kilograms-force and megaponds.
›› Quick conversion chart of kgf to megapond
1 kgf to megapond = 0.001 megapond
10 kgf to megapond = 0.01 megapond
50 kgf to megapond = 0.05 megapond
100 kgf to megapond = 0.1 megapond
200 kgf to megapond = 0.2 megapond
500 kgf to megapond = 0.5 megapond
1000 kgf to megapond = 1 megapond
›› Want other units?
You can do the reverse unit conversion from megapond to kgf, or enter any two units below:
Enter two units to convert
›› Common force conversions
kgf to zeptonewton
kgf to yottanewton
kgf to yoctonewton
kgf to nanonewton
kgf to dekanewton
kgf to ounce
kgf to attonewton
kgf to centinewton
kgf to gram
kgf to kilopond
›› Definition: Kilogram
The deprecated unit kilogram-force (kgf) or kilopond (kp) is the force exerted by one kilogram of mass in standard Earth gravity (defined as exactly 9.80665 m/s²). One kilogram-force is equal to exactly 9.80665 newtons.
›› Definition: Megapond
So 1 megapond = 106 ponds.
›› Metric conversions and more


By Topic
Intelligent Schema Integrator (ISI): A tool to solve the problem of naming conflict for schema integration
Sign In
Formats Non-Member Member
$31 $13
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button
puzzle piece
Learn more about:
IEEE membership
IEEE Xplore subscriptions
3 Author(s)
Ahmad, K. ; Fac. of Inf. Sci. & Technol., Univ. Kebangsaan Malaysia, Bangi, Malaysia ; Hea Khim Chiew ; Samad, R.
The data stored in the data warehouse are mostly coming from different sources. It may be developed using different model or structure for the schema. In order to improve the usability of these data, the process of combining or integrating is needed so that it can provide users with a unified view or a global view of these data. The most important issue in data integration is the schema integration: that is to solve the problem of "how can equivalent real-world entities from multiple data sources be matched up?" This is referred to as entity identification process. Terms may be given a different interpretation at different sources by different people. For example, how can data analyst be sure that customer_id in one database and cust_number in another refer to the same entity? In this paper, a tool which is called an Intelligent Schema Integrator (ISI) is built to increase the uses of data from the data warehouse and to make the process more simple, systematic and impressive. ISI is an intelligent tool which can be used to integrate two different schemas from different sources into a unified schema (global schema). ISI is developed to solve the problems of naming conflict which are homonym conflict and synonym conflict. Homonym conflict means the same element name is used to represent different concept. Synonym conflict means different element name is used to represent the same concept. Thesaurus is used to get the meaning of each element concept and compares it with the other concept. An interface is built to allow the user to choose which elements are going to be renamed or removed, if there are occurrences of homonym and synonym conflicts in the schemas. These are the intelligence features built for ISI. The methodology used in this study consists of 4 phases: Design the Input and Output, Extraction, Comparison, and Integration. The development of this tool is an important direction for more efficient and effective implementation of data integrati- - on in data warehousing.
Published in:
Electrical Engineering and Informatics (ICEEI), 2011 International Conference on
Date of Conference:
17-19 July 2011


Word Sorter
To sort words into alphabetical order paste your text into the box on the left and click the green "sort" button.
What is this tool?
This tool sorts words in a block of text from a to z. You do not need to remove characters that are typically found in paragraphs such as commas and full stops as this is automatically done during the sorting process.
To copy the output you can click the small icon on the bottom right of the output text area.


Help Privacy Policy Disclaimer
 Advanced SearchBrowse
How big is an OMI pixel?
Sihler, H.
Satellite Remote Sensing, Max Planck Institute for Chemistry, Max Planck Society;
External Resource
No external resources are shared
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
de Graaf, M., Sihler, H., Tilstra, L. G., & Stammes, P. (2016). How big is an OMI pixel? Atmospheric Measurement Techniques Discussions, 9.
Cite as: _URL_
The Ozone Monitoring Instrument (OMI) is a push-broom imaging spectrometer, observing solar radiation backscattered by the Earth's atmosphere and surface. The incoming radiation is detected using a static imaging CCD (charge-coupled device) detector array with no moving parts, as opposed to most of the previous satellite spectrometers, which used a moving mirror to scan the Earth in the across-track direction. The field of view (FoV) of detector pixels is the solid angle from which radiation is observed, averaged over the integration time of a measurement. The OMI FoV is not quadrangular, which is common for scanning instruments, but rather super-Gaussian shaped and overlapping with the FoV of neighbouring pixels. This has consequences for pixel-area-dependent applications, like cloud fraction products, and visualisation. The shapes and sizes of OMI FoVs were determined preflight by theoretical and experimental tests but never verified after launch. In this paper the OMI FoV is characterised using collocated MODerate resolution Imaging Spectroradiometer (MODIS) reflectance measurements. MODIS measurements have a much higher spatial resolution than OMI measurements and spectrally overlap at 469 nm. The OMI FoV was verified by finding the highest correlation between MODIS and OMI reflectances in cloud-free scenes, assuming a 2-D super-Gaussian function with varying size and shape to represent the OMI FoV. Our results show that the OMPIX-COR product 75FoV corner coordinates are accurate as the full width at half maximum (FWHM) of a super-Gaussian FoV model when this function is assumed. The softness of the function edges, modelled by the super-Gaussian exponents, is different in both directions and is view angle dependent. The optimal overlap function between OMI and MODIS reflectances is scene dependent and highly dependent on time differences between overpasses, especially with clouds in the scene. For partially clouded scenes, the optimal overlap function was represented by super-Gaussian exponents around 1 or smaller, which indicates that this function is unsuitable to represent the overlap sensitivity function in these cases. This was especially true for scenes before 2008, when the time differences between Aqua and Aura overpasses was about 15 min, instead of 8 min after 2008. During the time between overpasses, clouds change the scene reflectance, reducing the correlation and influencing the shape of the optimal overlap function.


From FedoraProject
< PackagingDrafts
Jump to: navigation, search
Currently local server virtual provides are used in fedora, the one I am aware is smtpdaemon for a mail server listening on the smtp port. webserver is also another potential candidate, but as seen below it doesn't seems to be used for a web server listening on the http port. Therefore the naming and the exact meaning of those virtual provides is not clear. There is no way to discover the name of such virtual provides, nor to list them all.
This draft proposes a naming scheme for virtual provides corresponding with local servers listening on a specific port, with a strict meaning of the provides and a naming scheme generic and rule based.
The aim is not to inflate the number of virtual provides, they should only be added if needed, but to provide a more systematic naming scheme.
Virtual provides corresponding with local servers should be named along
port_name being the service name associated with that port number in /etc/services, or the port number when no record exists in /etc/services (but in that case it is doubtful that a virtual provides is useful).
So, for example a virtual provides for a server listening on port 80 should be server(http).
Things to do if the proposal is accepted
collect the virtual server provides
Currently smtpdaemon. Don't hesitate to add more if you know them.
change the virtual provides
For the known existing virtual provides.
smtpdaemon should be changed to server(smtp).
# repoquery --whatprovides smtpdaemon
It looks like all the packages that should provide this virtual provide are listed here.
# repoquery --whatrequires smtpdaemon
I remember having inspected those packages and if I recall well, they really requires a local smtp server.
webserver status is less clear. Indeed there are packages that set up an http server that are not providing this virtual provide:
# repoquery --whatprovides webserver
And it seems that none of the packages that requires webserver requires a local http server:
# repoquery --whatrequires webserver
Instead most of them seem to require a cgi server, and some clearly requires the apache web server since they install their files in apache specific directories.
Therefore the semantics of the webserver virtual provides may be more along a web server providing cgi support (namazu-cgi, nut-cgi, darcs-server, qdbm-cgi) and therefore can stay. Sometimes it means a cgi server, but also also means a server with apache like web server configuration directory and config file (bugzilla, htdig-web, phpMyAdmin, postgresql-pgpoolAdmin, wordtrans-web) in that case the requires may better be httpd, but this is out of the scope of that proposal.
nut-devel seems to be a mistake (hopefully the merge review isn't still done).
A server(smtp) provides should be added to the packages providing smtpdaemon by F-9. The Requires for all Fedora packages should be changed to use the new provides by F-9, too. When you implement the new Provides, please leave the old ones so that third party packages that have grown to depend on them can continue to function, at least for F-9. After F-9 keeping or removing the provides is left to the packager.
PatriceDumas will fill bugs and provide patches for spec files as soon as (and if) FESCo ratifies this proposal.
There is a need for a server(xdmcp) in ltsp5, and for the corresponding virtual provides in gdm, kdm, xdm, wdm. PatriceDumas is also volunteering to take care of that.


text:
İnançlardaki Cehennem Tasvirlerinin Sanatta Duyguların İfadesi Olarak Yorumlanması
xmlui.mirage2.itemSummaryView.MetaDataShow full item record
Belief in hell which is a place of punishment for the spirits of wicked people go after death is common in almost all religions. Hell can have different names and structures in different religions but the common point is that it is a place of torment and suffering. Despite having these negative features, the visual depictions and artistic interpretations of hell continue to be produced and attract attention to this day since the first emergence of belief in hell. The depictions, interpretations, and metaphors of the concept of hell in art make the significance of hell worth examining. The reason why hell has an important place for itself in art and popular culture is in line with the reasons of religions that produce it. When examining why the concept of hell exists in religions and what it means to people, an evaluation can be made on the reasons and significance of the depictions and interpretations of hell in art. The fact that the concept of Hell can be used as a metaphor in expressing feelings such as pain, fear, and hate makes it valuable beyond terms of religion. While the similarity of the concept of hell with life on the earth makes it seem more realistic in the human mind compared to other religious concepts, expressing life on the earth through the metaphor of hell offers a realistic approach to life itself.


Explore BrainMass
Explore BrainMass
 Molecular mimicry hypothesis and autoimmunity
 Molecular mimicry hypothesis and autoimmunity is explained with an example of multiple sclerosis.
 © BrainMass Inc. brainmass.com October 1, 2020, 11:24 pm ad1c9bdddf
 Solution Preview
 The mechanism of molecular mimicry has been postulated to explain the development of autoimmunity. According to molecular mimicry mechanism, the infectious agents or pathogens trigger an immune response against the autoantigens. According to this hypothesis a susceptible host gets infected with a pathogen that has antigens immunologically similar to the host antigens but differ sufficiently to induce an immune response when presented to T cells. Consequently, tolerance to autoantigens breaks down leading to cross-reaction of the pathogen-specific immune response...
 Solution Summary
 Molecular mimicry hypothesis and autoimmunity are assessed.


Weather Forecast
Find more about Weather in Holyoke, CO
Click for weather forecast
Planning for Droughts PDF Print E-mail
Written by Julie Elliott, NRCS rangeland management specialist
Take a yardstick or a ruler that has been sharpened a bit to a point with you or tie it to a sharpened dowel rod to hold it up. Take your camera or a cell phone so you can take pictures of the yardstick both standing up and laying on the ground.
When on the range you need to look down, not across. You want to see how much grass is out there and what kinds of grasses are out there.
The next features to note are dead grass plants, bare ground and litter. Dead grasses have a black or dark grey color in winter and summer. Dead grasses are not going to grow, no matter how much water you pour on them. Bare range ground heats up faster, evaporates more moisture, soaks in water slower, and is more likely to wash or blow than ground that is covered. The more litter cover we have, the faster our range will recover.
In addition to these above ground features, we need to consider what is happening below ground. When the leaf volume is reduced, either due to overgrazing or drought, root growth and replacement is reduced or stopped. Smaller root systems lead to plants that are less capable of recovering from drought or grazing. If the plant cannot make enough food, it will burn the roots for energy.
Holyoke Enterprise April 3, 2014


Working with recurrence relations in SAS
Many textbooks and research papers present formulas that involve recurrence relations. Familiar examples include:
 - The factorial function: Set Fact(0)=1 and define Fact(n) = n*Fact(n-1) for n > 0.
 - The Fibonacci numbers: Set Fib(0)=1 and Fib(1)=1 and define Fib(n) = Fib(n-1) + Fib(n-2) for n > 1.
 - The binomial coefficients (combinations of "n choose k"): For a set that has n elements, set Comb(n,0)=1 and Comb(n,n)=1 and define Comb(n,k) = Comb(n-1, k-1) + Comb(n-1, k) for 0 ≤ k ≤ n.
 - Time series models: In many time series models (such as the ARMA model), the response and error terms depend on values at previous time points. This leads to recurrence relations.
Sometimes the indices begin at 0, other times they begin at 1. Working efficiently with sequences and recurrence relations can be a challenge. The SAS DATA step is designed to processes one observation at a time, but a recurrence relation requires looking at past values. If you use the SAS DATA step to work with recurrence relations, you need to use tricks to store and refer to previous values. Another challenge is indexing: most SAS programmers are used to one-based indexing, whereas some formulas use zero-based indexing.
This article uses the Fibonacci numbers to illustrate how to deal with some of these issues in SAS. There are several definitions of the Fibonacci numbers, but we'll look at the definition that uses zero indexing: F0 = 1, F1 = 1, and Fn = Fn-1 + Fn-2 for n > 1. In this article, I will use n ≤ 7 to demonstrate the concepts.
Recurrence relations by using arrays
The SAS DATA step supports arrays, and you can specify the indices of the arrays. Therefore, you can specify that an array index starts with zero. The following DATA step generates "wide" data. There is one observation, and the variables are named F0-F7.
data FibonacciWide;
array F[0:7] F0-F7; /* index starts at 0 */
F[0] = 1; /* initialize first values */
F[1] = 1;
do i = 2 to 7; /* apply recurrence relation */
 F[i] = F[i-1] + F[i-2];
drop i;
proc print noobs; run;
You can mentally check that each number is the sum of the two previous numbers. Using an array is convenient and easy to program. Unfortunately, this method is not very useful in practice. In practice, you usually want the data in long form rather than wide form. For example, if you simulate time series data, each observation represents a time point and the values depend on previous time points.
Recurrence relations by using extra variables
In the DATA step, you can use the concept of "lags" to implement a recurrence relation. A lag is any previous value. If we are currently computing the n_th value, the first lag is the (n-1)th value, which is the previous observation. The second lag is the (n-2)th value and so forth. One way to look at previous values is to save them in an extra variable. The following DATA step uses F1 to hold the first lag of F and F2 to hold the second lag of F. Recall that the SUM function will return the sum of the nonmissing values, so sum(F1, F2) is nonmissing if F1 is nonmissing.
data FibonacciLong;
F1 = 1; F2 =.; /* initialize lags */
i=0; F = F1; output; /* manually output F(0) */
do i = 1 to 7; /* now iterate: F(i) = F(i-1) + F(i-2) */
 F = sum(F1, F2);
 F2 = F1; /* update lags for the next iteration */
 F1 = F;
proc print noobs;
 var i F F1 F2;
Recurrence relations by using the LAG function
The DATA step supports a LAGn function. The LAGn function maintains a queue of length n, which initially contains missing values. Every time you call the LAGn function, it pops the top of the queue, returns that value, and adds the current value of its argument to the end of the queue. The LAGn functions can be surprisingly difficult to use in a complicated program because the queue is only updated when the function is called. If you have conditional IF-THEN/ELSE logic, you need to be careful to keep the queues up to date. I confess that I am often frustrated when I try to use the LAG function with recurrence relations. I find it easier to use extra variables.
But since the documentation for the LAGn function includes the Fibonacci numbers among its examples, I include it here. Notice the clever use of calling LAG1(F) and immediately assigning the new value of F, so that the program only needs to compute the first lag and does not use any extra variables:
/* modified from documentation for the LAG function */
data FibonacciLag;
i=0; F=1; output; /* initialize and output F[0] */
/* lag1(F) is missing when _N_=1, but equals F[i-1] in later iters */
do i = 1 to 7;
 F = sum(F, lag(F)); /* iterate: F(i) = F(i-1) + F(i-2) */
proc print noobs; run;
The values are the same as for the previous program, but notice that this program does not use any extra variables to store the lags.
Recurrence relations in SAS/IML
Statistical programmers use the SAS/IML matrix language because of its power and flexibility, but also because you can vectorize computations. A vectorized computation is one in which an iterative loop is replaced by a matrix-vector computation. Unfortunately, for many time series computations, you cannot completely get rid of the loops because the series is defined in terms of a recurrence relation. You cannot compute the n_th value until you have computed the previous values.
The easiest way to implement a recurrence relation in the SAS/IML language is to use the DATA step program for generating the "wide form" sequence. The PROC IML code is almost identical to the DATA step code:
proc iml;
N = 8;
F = j(1, N, 1); /* initialize F[1]=F[2]=1 */
do i = 3 to N;
 F[i] = F[i-1] + F[i-2]; /* overwrite F[i] with the sum of previous terms, i > 2 */
labls = 'F0':'F7';
print F[c=labls];
The program is efficient and straightforward. The output is not shown. The SAS/IML language does not support 0-based indexing, so for recurrence relations that start at 0, I usually define the indexes to match the recurrence relation and add 1 to the subscripts of the IML vectors. For example, if you index from 0 to 7 in the previous program, the body of the loop becomes F[i+1] = F[i]+ F[i-1].
Linear recurrence relations and matrix iteration
The Fibonacci sequence is an example of a linear recurrence relations. For a linear recurrence relation, you can use matrices and vectors to generate values. You can define the Fibonacci matrix to be the 2 x 2 matrix with values {0 1, 1 1}. The Fibonacci matrix transforms a vector {x1, x2} into the vector {x2, x1+x2}. In other words, it moves the second element to the first element and replaces the second element with the sum of the elements. If you iterate this transformation, the iterates generate the Fibonacci numbers, as shown in the following statements:
M = {0 1, /* Fibonacci matrix */
 1 1};
v = {1, 1}; /* initial state */
F = j(1, N, 1); /* initialize F[1]=1 */
do i = 2 to N;
 v = M*v; /* generate next Fibonacci number */
 F[i] = v[1]; /* save the number in an array */
print F[c=labls];
You can use this method to generate sequences in any linear recurrence relation. Previous methods work for linear or nonlinear recurrence relationships. The SAS/IML language also supports a LAG function, although it works differently from the DATA step function of the same name.
This article shows a few ways to work with recurrence relations in SAS. You can use DATA step arrays to apply relations for "wide form" data. You can use extra variables or the LAG function for long form data. You can perform similar computations in PROC IML. If the recurrence relation is linear, you can also use matrix-vector computations to apply each step of the recurrence relation.
About Author
Rick Wicklin
Distinguished Researcher in Computational Statistics
 - Rick Wicklin
 Most children first encounter a recurrence relation in school when arithmetic sequences are introduced. For example, the arithmetic sequence
 1, 5, 9, 13,....
 can be described by the recurrence relation


text:
Recently someone told me the term 'salty dog' refers to the practice of early maritime sailors taking dogs aboard ships as mascots because dogs could smell land before the sailors could see it, and would alert them when they were approaching a land mass so they wouldn't sail past it in the dark. I had no idea if the statement was true or false, so I looked it up. 'Salty dog' is indeed a nautical term, but refers to a sailor who has spent extended periods of time at sea; however, there was an early practice of rubbing salt through a dog's coat as an archaic practice to repel fleas. In theory, it probably worked because the dog, no doubt, died from sodium poisoning.
This does raise an interesting question. There is an Blues song, 'Salty Dog Blues', and the first line is, 'Let me be your salty dog, or I don't wanna be your man at all.' What do you suppose that means?


text:
April 30 – National Raisin Day
Posted on April 30, 2012
National Raisin Day
Five Food Finds about Raisins
- In 1873, a freak hot spell withered the grapes on the vine. One enterprising San Francisco grocer advertised these shriveled grapes as "Peruvian Delicacies" and the rest is history.
- It takes more than 4 tons of grapes to produce 1 ton of raisins.
- The finest raisins come from Malaga in Spain.
- Raisin – comes from the Latin racemus and means "a cluster of grapes or berries".
- Fresno, California is the Raisin Capital of the World.
Today's Food History
on this day in…
1792 John Montague, 4th Earl of Sandwich died. Captain Cook named the Sandwich Islands after him (now known as Hawaii). He is supposed to have invented the sandwich as a quick meal so as not to interrupt his gambling sessions.
1904 The Louisiana Purchase Exposition opened in St. Louis (St. Louis World's Fair). It was at the Fair that the ice cream cone was supposed to have been invented. The hot dog and iced tea were also popularized at the Fair.
1952 Mr. Potato Head is introduced to the world. Mr. Potato Head is the also the first toy to be advertised on television.
1955 'Cherry Pink & Apple Blossom White' by Perez Prado hits number one on the charts.
1981 Dunkin Donuts opened its first store in the Philippines.


text:
UNZEN VOLCANO, Western Kyushu
(June 1, 1996)
Slow deformation of lava dome after the halt of magma supply was monitored successfully with GPS and EDM analyses by the Shimabara Earthquake and Volcano Observatory (SEVO), Kyushu University. The deformation shows the tendency that endogenous dome is flattening: the maximum subsidence and lateral movement during this one year are about 1.5 m and 1 m, respectively; the averages are 0.5 and 0.4 m, respectively. The temperature measurement of fumarolic gas at the top of the dome by SEVO showed that gas had cooled from 500-700 deg. C to 300-500 deg. C during this one year.
Several small block-and-ash flows occurred on 10, 12 and 13 February 1996, leaving one-year quiescence, though magma supply had stopped since February 1995. According to the Shimabara Earthquake and Volcano Observatory (SEVO), Kyushu University, these flows descended to SE, traveling about 1.0 km from the source; surge-like (ash-dominated) deposits were associated with the flows. These deposits were colored in reddish brown, and the temperature of lava blocks in them was measured >60 oC using the infrared camera of the Public Work Research Instiute. These flows were generated by partial collapse of old lava (lobe 7 or 8). The witness told that the ash-cloud accompanied by these flows was much similar to those of pyroclastic (block-and-ash) flows that took place frequently during 1991-94. Simple rockfalls (without ash-cloud) also occurred simultaneously and reached about 1.5 km from the source, beyond the front of block-and-ash flows!
No volcanic earthquakes occurred before and after these events. Tiltmeter close to the dome did not show any change during these events. These partial collapses may be due either to cooling shrinkage of the dome or seasonal temperature change.
Generation of pyroclastic flows and major deformation of lava dome had stopped in February 1995. Refer to Decade Page for the _PHONE_ eruption history.
(right photo) Pyroclastic flows, Unzen Volcano, on Jun. 24, 1993 (taken by S. Nakada).
To eruption menu


that the minimal value of the transformation of each set, say \(A=\{e,i,o\}\) and \(B=\{a,e\}\), according to a new orderding, \(\pi_X\), is equal to the Jackard Coefficient. In this case we can compute the Jackard Coefficient exactly and it is:
$$\frac{|\{e,i,o\}\cap\{a,e\}|}{|\{e,i,o\}\cup\{a,e\}|} =\frac{|\{e\}|}{|\{a,e,i,o\}|} = \frac{1}{4} $$
This number means that whenever we pick a transformation \(\pi\) from the set of all possible transformations \(\Pi\) the probability that the smaller number is the same in both sets is equal to 0.25. Think that we are talking here about a probability and that it is not a rule. If the permutation choosen at random was the previously defined function \(\pi_X\) then we would have, \(\min\pi_X(A)=\min\{2,3,1\}=1\) that is not the same value as \(\min\pi_X(B)=\min\{5,2\}=2\).
Hashing functions
Defining a random ordering for all the elements of a universe is costly. We have to maintain in memory the tables we saw for the vowels and that can not be practical when the universe of objects is large. So instead of maintaining the explicit random permutation we use the implicit permutation that hashing functions with good properties give us. The good properties we need is that the probability of collision in the universe is low because a random permutation is a 1 to 1 relationship between elements and positions and thus collisions in the hashing function would break this property.
From now on, I'm going to assume that every universe we need to work with is smaller than the range of integers and thus restrict all the derivations to integer since every set and ordering could be mapped to the natural integer ordering (\([0..2^{32}]\)).
Possible hashing functions for integers could be:
 - Use the FNV-1 hashing function of the string representation of your integer. This has the advantage that naturally deals with hashing sets of integers by means of concatenating their string representations.
 - Use a pseudo-random number generator by picking a large prime number, say \(p=_PHONE_\) and a set of coefficients \(\{a_i,b_i\}\) such our hashing functions are defined as \(\pi_i = (a_i x + b_i) \% p \)
In this post we will use the second kind of functions expresed in this Haskell code:
p :: Int
coefs :: [Int]
coefs = unfoldr (Just. randomR (0,p)) $ mkStdGen 0
hashFuncs :: [Int->Int]
hashFuncs = go coefs
 go theCoefs = let (a:b:[],rest) = splitAt 2 theCoefs
 in (\x -> (a*x+b) 'mod' p) : go rest
So, given a hashing function, which is the minimum hash over a given set? This code gives you that result
minHash :: (Int->Int) -> [Int] -> Int
minHash f = foldl' hashAndMin maxBound
 hashAndMin a b = min a (f b)
OK, now you want to compare two sets, A and B to see how similar they are. The similarity measure here will be the number of items they both share, the Jackard coefficient. The time complexity of the set intersection is \(O(n+m)\) if you first build a Hash Map and then query it with the second set for existence. If both sets are already sorted you can compare them in \(O(n)\) \(O(m+n\log n+ m\log m)\).
Can you compare them faster? Yes, but only if you want to trade accuracy. The property in the probability formula at the beginning of the post states that with probability the Jackard coefficient the min hashes of the two sets will be equal. That means that if we take r different hashing functions (permutations) and we name s the Jackard coefficient between the tow sets, the probability that all k hashes of each set are equal is \(s^r\). Since this is a collection of Bernoulli trials, the distribution of having k min hashes equal in both sets follows a Binomial distribution with density probability function equal to:
$$f(k;r,s)= {r \choose k}s^k(1-s)^{r-k}$$
It is known that a random variable distributed according to the binomial distribution, \(X \sim B(r,s)\) has \(E[X]=rs\), so a good estimator of \(s\) would be to divide the number of matches by the number of hashing functions. This would give you the estimated value of the Jackard coefficient. But before comparing two fingerprints we have to compute them:
shingle :: Int -> [Int] -> [Int]
shingle c nums = [minHash f nums | f <- take c hashFuncs]
The shingle function gives us a set of c fingerprints of our original big set of numbers.
So let's see it in action. Imagine that we want to compute the Jackard coefficient between the bag of letters in the phrase Humpty Dumpty sat on a wall and Humpty Dumpty had a great fall. First let's compute the Jackard coefficient according to the definition
import Data.List
import System.Random
import Data.Char
import Data.List
phrase1="Humpty Dumpty sat on a wall"
phrase2="Humpty Dumpty had a great fall"
mkSet = nub. filter isAlpha. map toLower
-- Set 1 is the collection of letters in the first phrase
-- "humptydsaonw"
set1 = map ord $ mkSet phrase1 -- "humptydsaonwl"
-- Set 2 is the collection of letters in the second phrase
-- "humptydagrefl"
set2 = map ord $ mkSet phrase2 -- "humptydagrefl"
jackard = a/b
 a = fromIntegral $ length (set1 'intersect' set2) ::Double
 b = fromIntegral $ length (set1 'union' set2) ::Double
p :: Int
coefs :: [Int]
hashFuncs :: [Int->Int]
hashFuncs = go coefs
minHash f = foldl' hashAndMin maxBound
 hashAndMin a b = min a (f b)
shingles1 = map (\x -> shingle x set1) [1..]
shingles2 = map (\x -> shingle x set2) [1..]
jackard2 = map approxJackard shingles
 shingles = zip shingles1 shingles2
 approxJackard :: ([Int],[Int]) -> Double
 approxJackard (as,bs) = let pairs = zip as bs
 matches = filter (\(a,b) -> a == b) pairs
 num = fromIntegral $length matches :: Double
 den = fromIntegral $ length as :: Double
 in num/den
If we plot jackard2 we have an approximation based on the number of shingles:
Approximating Jackard Coefficient
OK, let me summarize a little bit.
 1. You came here because you have a problem of comparing and object against N different objects and N is very large.
 2. The comparison you want to perform is by computing intersections between the attributes of objects and compute how many are equal.
 3. You want a cheap procedure for computing 2)
So the solution is to transform each object into a set of different values, and then perform the Jackard coefficient on the reduced set of values. For instance, each object could be the set of friends in a social network, and the value c could be for instance just 10. Here we reduce the computation of the intersection from the hundreds to just 10 values. Your friends got summarized in a set of 10 values.
Can we do better? Yes. Here we reduced the number of comparison from the cardinality of the number of features of the object to the small number c. But we still have to perform N comparisons against the N individuals in the population. Wouldn't it be nice to just pick the individuals we think are more likely to have a high Jackard Coefficient? That's possible with the use of bands but since this post is already very long, I'll leave that for another post.
 1. Minwise independent permutations The paper with the math that demonstrates the link between the Jackard Coefficient and the probability.
 2. Chapter 3 of the excellent book "Minning massive datasets"
Categories: Data Mining Tags:,
Training Gradient Boosting Trees with Python
November 5th, 2012 6 comments
I've been doing some data mining lately and specially looking into Gradient Boosting Trees since it is claimed that this is one of the techniques with best performance out of the box. In order to have a better understanding of the technique I've reproduced the example of section 10.14.1 California Housing in the book The Elements of Statistical Learning. Each point of this dataset represents the house value of a property with some attributes of that house. You can get the data and the description of those attributes from here.
I know that the whole exercise here


Cleaning the surroundings
Grade Nursery will conduct a virtual activity on "Cleaning the surroundings" on Friday, 23.04.2021.
In this activity children will have to speak about cleanliness and will have to demonstrate how to clean and organize their personal belongings like cupboards, toys, books, playroom etc.
This activity will help children to learn the basic life skills like cleanliness, sorting, organizing etc.


text:
In this article, we have covered different topics that fall under GST Payment. Here is the table content for the same:
Under the GST regime, there are various types of GST payment and they are:
Intra-state supply; wherein the taxpayer is required to pay CGST that goes into the Central Government Account and SGST/UTGST that goes into the account of the concerned Union Territory or State.
Inter-state supply; in this type of supply, the taxpayer is required to pay IGST which will have components of both CGST and SGST and GST payment received directly remits to the Central Government account.
Generally, every supplier supplying goods and services is required to pay GST online. However, there are certain cases where the recipient is required to pay GST online such as imports and other notified supplies. These kinds of supplies are known as reverse charge supplies. Moreover, there are certain cases where the liability to pay tax is on 3rd person, the common example of such supplies are TCS and TDS.
As per section 12 and 13 of the GST Act, the taxpayer is required to pay GST on goods or services at the time of their supply. The supply time as per the GST Act is generally the earliest of the following,
Here is a process through which a taxpayer can make GST payment online:
STEP-1 Log in to the GST Portal (_URL_) using valid credentials and captcha code
STEP-2 From the drop-down of services choose payments and under the payments option you can find the link of creating challan
STEP-3 After entering the amount of payment, choose the method of GST payment. There are three option to make GST Payment online and they are
Once all the details have been furnished, click on the Generate Challan button.
Note: For over the counter GST payment there is a limit of 10K INR per challan.
STEP-4 After clicking on the Generate Challan button a challan will generate containing all the details of taxes. Once you make GST Payment online or offline the amount paid will reflect into the cash ledger of the taxpayer.
Ans. A challan is valid for 15 days from the date of its generation. Howsoever, the taxpayer can generate a new challan after the expiry of the previous one.
Ans. CPIN is an acronym for Common Portal Identification Number that is a fourteen digit identification number that helps in identification of the generated challan.
Ans. CIN is Challan Identification Number that is of 17 digits where the first 14 digits are CPIN and the following 3 digits are bank code. CIN is generated by authorized bank or RBI when the amount is credited into the relevant account of government. The CIN generated is communicated to both the taxpayer and GSTN.