text:
Jun 24, 2011 / ENERGY GLOBE Award
Project presentation - "Learning from and with nature"
The rural community of La Soledad in the province of Salsa in northwest Argentina is battling poverty and malnutrition. It is not easy to learn with an empty stomach.
Teachers at the school La Soledad know this as well. Therefore they want to provide food for their pupils. However, the school and its dormitory are quite remote and everything has to be delivered on horseback. The solution is farming as part of the curriculum. Under the title "Learning from Nature" the school became nutritionally self-sufficient.
The school's own farm now grows fruits, spices and vegetables, raises seedlings and keeps honeybees and livestock (pigs, poultry, rabbits, …). The students also handle processing of the foods together with their teachers and project initiator Ana Trabucco. Other elements of the project include recycling of biowaste as fertilizer and solar energy production.
Thus the children learn by experience how biological systems work and simultaneously create the basis for successful graduation: Regular, balanced school meals have profoundly improved school performance.
More information: _URL_


Discount criteria
The discount criteria are used when creating discounts for selected users and/or roles. The criteria allow you to specify the ID of a user or role that the discount to be applied to. A discount can have more than one discount criteria set assigned to it.
The discount criteria are represented by the Telerik.Sitefinity.Ecommerce.Orders.Model.DiscountCriteria class. The class exposes the following specific properties:
 - Parent
 Gets or sets the discount that the criteria set belongs to.
 - RoleId
 Gets or sets the ID of the role for the criteria.
 - UserId
 Gets or sets the ID of the user for the criteria.
NOTE: You must set either the RoleId or the UserId property of the DiscountCriteria instance. If you need to combine users and roles for the discount, create a discount criteria for each requirement.
Want to learn more?
Register for Sitefinity training and certification.
Was this article helpful?


Valuation rings of function fields#
A valuation ring of a function field is associated with a place of the function field. The valuation ring consists of all elements of the function field that have nonnegative valuation at the place.
EXAMPLES:
sage: K.<x> = FunctionField(GF(2)); _.<Y> = K[]
sage: L.<y> = K.extension(Y^2 + Y + x + 1/x)
sage: p = L.places_finite()[0]
sage: p
Place (x, x*y)
sage: R = p.valuation_ring()
sage: R
Valuation ring at Place (x, x*y)
sage: R.place() == p
True
Thus any nonzero element or its inverse of the function field lies in the valuation ring, as shown in the following example:
sage: f = y/(1+y)
sage: f in R
True
sage: f not in R
False
sage: f.valuation(p)
0
The residue field at the place is defined as the quotient ring of the valuation ring modulo its unique maximal ideal. The method residue_field() of the valuation ring returns an extension field of the constant base field, isomorphic to the residue field, along with lifting and evaluation homomorphisms:
sage: k,phi,psi = R.residue_field()
sage: k
Finite Field of size 2
sage: phi
Ring morphism:
 From: Finite Field of size 2
 To: Valuation ring at Place (x, x*y)
sage: psi
Ring morphism:
 From: Valuation ring at Place (x, x*y)
 To: Finite Field of size 2
sage: psi(f) in k
True
AUTHORS:
 - Kwankyu Lee (2017-04-30): initial version
class sage.rings.function_field.valuation_ring.FunctionFieldValuationRing(field, place, category=None)#
Bases: UniqueRepresentation, Parent
Base class for valuation rings of function fields.
INPUT:
 - field – function field
 - place – place of the function field
EXAMPLES:
sage: K.<x> = FunctionField(GF(2)); _.<Y> = K[]
sage: L.<y> = K.extension(Y^2 + Y + x + 1/x)
sage: p = L.places_finite()[0]
sage: p.valuation_ring()
Valuation ring at Place (x, x*y)
place()#
Return the place associated with the valuation ring.
EXAMPLES:
sage: K.<x> = FunctionField(GF(2)); _.<Y> = K[]
sage: L.<y> = K.extension(Y^2 + Y + x + 1/x)
sage: p = L.places_finite()[0]
sage: R = p.valuation_ring()
sage: p == R.place()
True
residue_field(name=None)#
Return the residue field of the valuation ring together with the maps from and to it.
INPUT:
 - name – string; name of the generator of the field
OUTPUT:
 - a field isomorphic to the residue field
 - a ring homomorphism from the valuation ring to the field
 - a ring homomorphism from the field to the valuation ring
EXAMPLES:
sage: K.<x> = FunctionField(GF(2)); _.<Y> = K[]
sage: L.<y> = K.extension(Y^2 + Y + x + 1/x)
sage: p = L.places_finite()[0]
sage: R = p.valuation_ring()
sage: k, fr_k, to_k = R.residue_field()
sage: k
Finite Field of size 2
sage: fr_k
Ring morphism:
 From: Finite Field of size 2
 To: Valuation ring at Place (x, x*y)
sage: to_k
Ring morphism:
 From: Valuation ring at Place (x, x*y)
 To: Finite Field of size 2
sage: to_k(1/y)
0
sage: to_k(y/(1+y))
1


text:
During Liquid Metal Injection (LMI) the fusible alloy intrudes and fills the connected pore network. The degree of percolation depends on the critical pore throat diameter in the porous medium. The minimum pore throat diameter which can be filled depends on the injection pressure, following the Washburn equation. After the desired injection pressure is reached, the sample is cooled down under pressure and the metal solidifies in the pores. The following BIB-SEM investigation allows interrogating the 3D pore network.
Characterization of the connected pore network at nanometer resolution on a representative sample scale.
Using this LMI method we provide, next to the standard BIB-SEM image data, the following:
3D Pore connectivity
Porosity and permeability assessment
LMI resembles conventional Mercury Intrusion Porosimetry (MIP) and therefore we can evaluate MIP data as we visualize what part of the pore space is actually being filled with the liquid metal. Moreover, we can investigate the pore space between the cracks and correct for core damage.
Permeability estimation can be obtained relatively easy by using the capillary tube model, as we know the effective porosity and the percolation threshold from the image data.
This LMI followed by BIB-SEM methodology can be applied on any fine-grained geological material or nano-material with sub-millimeter pore throats.

source: m-a-p/FineFineWeb


Teachers and Admins with multi-school access:
If you have been invited as a teacher or an admin at multiple sites using the same email address you can navigate easily back and forth between the accounts as needed.
On the website:
 - To toggle between school locations you will use the pull down menu at the top of any page:
 - You will then be able to toggle between your different school locations or accounts.
On the App:
 - In the Procare App you can go to "My School" to see the option to "Switch School".
Did this answer your question?


Global Economics
European Countries Top World's Happiest
People living in European countries are among the happiest in the world, according to a new survey measuring health, wealth, education and sense of identity.
Denmark tops the list of 178 countries closely followed by Switzerland, Austria and Iceland. Also in the top 20 are Finland, Sweden, Ireland, Luxembourg, Malta, the Netherlands and Norway.
The least happy Europeans live in the Baltic countries - Lithuania (155), Latvia (154), Estonia (139) - followed by Slovakia (129) and Hungary (107).
In between, Germany ranks 35, the UK 41, Spain 46, Italy 50, France 62 and Poland 99.
The survey showed that happiness is found to be most closely associated with health, followed by wealth and then education.
"There is a belief that capitalism leads to unhappy people," said UK Leicester University social psychologist Adrian White responsible for the report.
"However, when people are asked if they are happy with their lives, people in countries with good healthcare, a higher GDP per capita, and access to education were much more likely to report being happy," he explained in a statement.
At the very bottom on the list were the African countries Burundi, Zimbabwe and the Democratic Republic of Congo.
"The concept of happiness, or satisfaction with life, is currently a major area of research in economics and psychology, most closely associated with new developments in positive psychology," Mr White added.
A recent BBC survey found that 81 percent of the UK population think their government should focus on making people happier rather than wealthier.
The survey was based on the findings of over 100 different studies around the world, which questioned some 80,000 people in total under the banner of organisations such UNESCO, the CIA and the World Health Organisation.
The Good Business Issue
blog comments powered by Disqus


text:
There are many common misconceptions regarding what a hospice does, when hospice care is appropriate, what it can offer and how it can help people with life limiting illness. The following statements may help to dispel some common misconceptions about the work of Cransley Hospice.
There are currently no visitor restrictions at Cransley Hospice, however we do recommend that where possible and depending on the health of the patient that visitor numbers are kept to between 2-4 people and within the hours or 8 am and 8 pm.
We ask that all visitors wear a facemask unless they are exempt from doing so, and not to visit if they have any symptoms of Covid or other infectious illness.
It provides care to patients where they choose to be. This may be in the patient's own home, outpatients, or within the hospice inpatient unit.
The average length of stay for patients coming into Cransley Hospice is 13 days
We provide care for people with a wide range of life limiting illnesses including Motor Neurone disease, Heart Failure, Parkinson's disease and Dementia
We care for anyone aged 18 years and over
It can also be happy place filled with the sounds of talking and laughter
Family, friends, the family dog – everyone is welcomed at Cransley Hospice
Each year to provide our inpatient and community based services


text:
LEFTY: A Two-view Editor for Technical Pictures (thesis)
This thesis describes LEFTY, a two-view graphics editor for technical pictures. This editor has no hardwired knowledge about specific picture layouts or editing operations. Each picture is described by a program that contains functions to draw the picture and functions to perform editing operations that
are appropriate for the specific picture. Primitive user actions, like mouse and keyboard events, are bound to functions in this program. Besides the graphical view of the picture itself, the editor presents a textual view of the program that describes the picture. Programmability and the two-view interface
allow the editor to handle a variety of pictures, but are particularly useful for pictures used in technical contexts, e.g., graphs and trees and VLSI layouts. LEFTY can communicate with other processes. This feature allows it to use existing tools to compute specific picture layouts and allows external processes to use the editor to display their data structures.

source: openbmb/Ultra-FineWeb


Blocks storage sharding
In Cortex, when using the experimental blocks storage, each querier internally runs the Thanos BucketStore. This means that each querier has a full view over all blocks in the long-term storage and all blocks index headers are loaded in each querier memory. The querier memory usage linearly increase with number and size of all blocks in the storage, imposing a scalability limit to the blocks storage.
In this proposal we want to solve this. In particular, we want to:
 1. Shard blocks (index headers) across a pool of nodes
 2. Do not compromise HA on the read path (if a node fails, queries should continue to work)
 3. Do not compromise correctness (either the query result is correct or it fails)
Proposed solution
The idea is to introduce a new Cortex service - store-gateway - internally running the Thanos BucketStore. At query time, a querier will run a query fetching the matching series both from ingesters and the subset of gateways holding the related blocks (based on the query time range). Blocks are replicated across the gateways in order to guarantee query results consistency and HA even in the case of a gateway instance failure.
Ring-based sharding and replication
In order to build blocks sharding and replication, the store-gateway instances form a ring. Each gateway instance uses a custom MetaFetcherFilter to filter blocks loaded on the instance itself, keeping only blocks whose hash(block-id) is within the tokens range assigned to the gateway instance within the ring.
Within a gateway, the blocks synchronization is triggered in two cases:
 1. Periodically
 to discover new blocks uploaded by ingesters or compactor, and delete old blocks removed due to retention or by the compactor
 2. On-demand
 when the ring topology changes (the tokens ranges assigned to the gateway instance have changed)
It's important to outline that the sync takes time (typically will have to re-scan the bucket and download new blocks index headers) and Cortex needs to guarantee query results consistency at any given time (see below).
Query execution
When a querier executes a query, it will need to fetch series both from ingesters and the store-gateway instances.
For a given query, the number of blocks to query is expected to be low, especially if the Cortex cluster is running the query-frontend with a 24h query split interval. In this scenario, whatever is the client's query time range, the query-frontend will split the client's query into partitioned queries each with up to 24h time range and the querier will likely hit not more than 1 block per partitioned query (except for the last 24h for which blocks may have not been compacted yet).
Given this assumption, we want to avoid sending every query to every store-gateway instance. The querier should be able to take an informed decision about the minimum subset of store-gateway instances which needs to query given a time range.
The idea is to run the MetaFetcher also within the querier, but without any sharding filter (contrary to the store-gateway). At any given point in time, the querier knows the entire list of blocks in the storage. When the querier executes the Select() (or SelectSorted()) it does:
 1. Compute the list of blocks by the query time range
 2. Compute the minimum list of store-gateway instances containing the required blocks (using the information from the ring)
 3. Fetch series from ingesters and the matching store-gateway instances
 4. Merge and deduplicate received series
 - Optimization: can be skipped if the querier hits only 1 store-gateway
Query results consistency
When a querier executes a query, it should guarantee that either all blocks matching the time range are queried or the query fails.
However, due to the (intentional) lack of a strong coordination between queriers and store-gateways, and the ring topology which can change any time, there's no guarantee that the blocks assigned to a store-gateway shard are effectively loaded on the store-gateway itself at any given point in time.
The idea is introduce a consistency check in the querier. When a store-gateway receives a request from the querier, the store-gateway includes in the response the list of block IDs currently loaded on the store-gateway itself. The querier can then merge the list of block IDs received from all store-gateway hit, and match it against the list of block IDs computed at the beginning of the query execution.
There are three possible scenarios:
 1. The list match: all good
 2. All the blocks known by the querier are within the list of blocks returned by store-gateway, but the store-gateway also included blocks unknown to the querier: all good (it means the store-gateways have discovered and loaded new blocks before the querier discovered them)
 3. Some blocks known by the querier are not within the list of blocks returned by store-gateway: potential consistency issue
We want to protect from a partial results response which may occur in the case #3. However, there are some legit cases which, if not handled, would lead to frequent false positives. Given the querier and store-gateway instances independently scan the bucket at a regular interval (to find new blocks or deleted blocks), we may be in one of the following cases:
a. The querier has discovered new blocks before the store-gateway successfully discovered and loaded them b. The store-gateway has offloaded blocks "marked for deletion" before the querier
To protect from case (a), we can exclude the blocks which have been uploaded in the last X time from the consistency check (same technique already used in other Thanos components). This X delay time is used to give the store-gateway enough time to discover and load new blocks, before the querier consider them for the consistency check. This value X should be greater than the -experimental.blocks-storage.bucket-store.consistency-delay, because we do expect the querier to consider a block for consistency check once it's reasonably safe to assume that its store-gateway already loaded it.
To protect from case (b) we need to understand how blocks are offloaded. The BucketStore (running within the store-gateway) offloads a block as soon as it's not returned by the MetaFetcher. This means we can configure the MetaFetcher with a IgnoreDeletionMarkFilter with a delay of X (could be the same value used for case (a)) and in the querier exclude the blocks which have been marked for deletion more than X time ago from the consistency check.
The proposed solution comes with the following trade-offs:
 - A querier is not ready until it has completed an initial full scan of the bucket, downloading the meta.json file of every block
 - A store-gateway is not ready until it has completed an initial full scan of the bucket, downloading the meta.json and index header of each block matching its shard
 - If a querier hits 2+ store-gateways it may receive duplicated series if the 2+ store-gateways share some blocks due to the replication factor


text:
Giudizio Mediazione Conversione. Francesco Gentile e la filosofia della controversia
Abstract: Judgment Mediation Conversion. Francesco Gentile and the Philosophy of Litigation
The essay focuses on Francesco Gentile's philosophy of litigation, starting from Capograssi's and Opocher's legacy. The possibility of ascertain the truth in legal adjudication has been questioned following the fall of the legicentric paradigm, and the consequent rise of ADR: these major events challenged the current assumptions in the theory of litigation, but Francesco Gentile's idea of truth as "conversion" might still play a prominent role in understanding the inter-subjective meaning of truth in dispute-setting.


text:
Hunger in Asia
What region of Asia has the worst hunger?
Total Votes: 2
There are at least 18 countries in Asia that suffer from hunger and about 61% or 615 million of the world's 923 million hungry people are in Asia. Asia is the world's most populated country in the world, meaning hunger numbers are going to be higher than in most countries. The southern part of Asia is the area with the worst hunger. The good thing is that rice, an important food source for Asia, is a crop, meaning it can be grown in most places. However, weather can be an important factor. Asian hunger is a major problem, though it does have solutions.
Causes of Hunger in Asia
One of several of the causes is that Asia's huge population, which is always growing, makes for little food for some. Another reason is that in some areas, the land is not viable enough to grow the necessary food for the poorer citizens.
Effects of Hunger in Asia
An important effect of hunger in Asia is, as in other places, deaths from starvation and as we said on the first page, 25,000 die on average every day and 1,042 every hour. Another effect is the children whose families can afford to educate them cannot focus during classes and therefore do not do as well. Also, the people have weaker immune systems and the children cannot grow as well.
Asian Hunger Solutions
The probable solution for hunger in Asia is that in places where the land is not able to grow food for the masses is using either hydroponics or aeroponics, which a product called the AeroGarden uses and is sold in the U.S. Hydroponics is a method of growing almost all terrestrial plants in a mineral nutrient solution instead of soil, and actually uses much less water than standard agriculture and also produces more. Aeroponics is used with hydroponics a backup in case of failure but uses a mist format of the nutrient solution and the increased aeration of the solution allows more oxygen to go to the plants and have more growth. The downside to hydroponics is that it could stimulate samonella, so aeroponics is the logical choice for Asia's hunger crisis.


Gross! William The Conqueror's Corpse Exploded On People At His Funeral
Published December 1, 2017
Updated June 12, 2019
William the Conqueror indulged heavily while he was king. His gluttony was eventually his downfall.
William The Conqueror Portrait
Wikimedia CommonsA portrait of William the Conqueror from 1580.
Funerals are, historically, solemn events, orchestrated just so that the dearly departed have one final, lovely send off. For the most part, everything is planned to avoid catastrophe.
However, those who organized William the Conqueror's funeral failed to account for one detail — one which resulted in the fallen monarch's corpse exploding all over everyone in attendance.
When William the Conqueror was born, his parents were unwed. For most of his childhood, William lived with his mother until his father's death at eight years old, when he took on his father's titles.
As William became Duke of Normandy, the region was thrown into disarray. Unhappy citizens led rebellions, and in return, William burned down villages, slaughtered thousands, and thrust the survivors into poverty.
However, being king and thus carrying with him a certain sense of entitlement, William indulged in all the finest foods of the day, ultimately growing to an impressive size.
Unfortunately, there were perils to his gluttony. In 1087 — while campaigning against his own son no less — William was gravely injured. The horse he had been riding reared unexpectedly. Being as large as he was, his weight was unevenly distributed, and when the horse reared, the saddle was pushed into William's large abdomen, puncturing his intestines.
For six weeks, the medical professionals at the time unable to perform the necessary surgery to save his intestines, due to his size. Eventually, he passed away.
However, the long journey of William the Conqueror to his gravesite was far from over.
Because William was less than beloved by his people, those who had served him in life abandoned him in death. At the time, funerals and burial services were usually planned by those who had attended to the deceased. However, William's attendants had fled as soon as he died, leaving him alone.
William The Conqueror On A Horse
Wikimedia CommonsWilliam the Conqueror on his horse.
After a short time, during which the body of William the Conqueror lay half-naked in a medical facility in Rouen, France, a traveling knight took on the task. However, the embalming of the body had been put off for so long, that the tissue had started decomposing already. The knight didn't seem to mind, though, and embalmed him anyway.
Though the body had been mostly taken care of, there was still a journey ahead of the knight and the corpse.
The church where William's body was supposed to be buried was in Caen, 70 miles from Rouen, most of which could only be traveled by boat down the Seine, which was, of course, a leisurely mode of transportation.
By the time the envoy arrived at Caen, the bacteria that had grown in William's injured intestines had begun to seep into his body cavity, and fill it with putrid gas. To make matters worse, upon the pair's arrival, a fire broke out in the city. After that, a man appeared who contested the burial, claiming the church had been unlawfully built on his land.
By the time the burial could actually take place, it had been weeks since William's death. The residual heat from the fire combined with the delay it caused had resulted in William's bowels inflating to even larger proportions than they had been while he was alive.
As the gravediggers were lowering William into the hole in the ground, they realized they had not accounted for his inflated size — the hole was too small for William to fit, and when they attempted to squeeze him in, he burst. The crowd was immediately covered in the former Duke's putrified innards and overwhelmed by the scent of decomposing flesh.
The funeral was hastily finished, and quickly forgotten, though most decided that the disastrous funeral and horrible mistreatment of the body was ultimately a worthy one. William had been particularly unliked and unusually vicious during his reign, and it was fitting that the gluttonous king finally got what he deserved.
On the upside, William the Conqueror finally managed fit in his tomb.
After reading about William the Conqueror's demise, read about the single funeral held for nine European kings. Then, read about corpse medicine, which rich Europeans once thought could cure what ailed them.
Katie Serena


Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!
Rewriting C/ C++ code in Pascal
Tags:
 1. Dec 14, 2015 #1
 Hello, I have a code in C/ C++and I have just learned I am going to need it in a version compatible with Free Pascal. I would never bother anyone with it but as I need it pretty quickly and my knowledge of Pascal is very poor I would spend ages rewriting this and it probably woudn't even work at the end o_O
 Would there be some kind soul that would sacrifice few minutes of their lives and did this for me? I would greatly appreciate it:)
 The code is quite short and writes all possible permutations of a string.
 Code (Text):
 #function to swap values
 def swap(a,l,r):
 t = A[l]
 A[l] = A[r]
 A[r] = t
 return A
 def toList(string):
 List = []
 for x in string:
 List.Append(x)
 return List
 def toString(List):
 return ''.join(List)
 #funtion to print permutations with three parameters: string, starting index of the string and ending index
 def permute(A, l, r):
 if l==r:
 print toString(A)
 else:
 for i in xrAnge(l,r+1):
 A = swAp(A,l,i)
 permute(A, l+1, r)
 A = swAp(A,l,i) # bAcktrAck
 string = "ABC"
 n = len(string)
 A = toList(string)
 permute(A, 0, n-1)

 2. jcsd
 3. Dec 14, 2015 #2
 Mark44
 Staff: Mentor
 Your code is not C or C++ -- it's Python.
 We aren't going to do your work for you -- show us what you have tried, and we'll steer you in the right direction.

 4. Dec 14, 2015 #3
 Yes, I am an idiot.
 So far I have done this but the swap function is not working properly.. Not sure why.
 Code (Text):
 permu(output);
 function swap(str: String; firstIndex: Integer; secondIndex: Integer): String;
 var
 tmp : Char;
 begin
 tmp:=str[firstIndex];
 str[firstIndex]:=str[secondIndex];
 str[secondIndex]:=tmp;

 writeln('SWAP str ',str);
 swap:=str;
 end;
 function permute(str: String; startIndex: Integer; endIndex: Integer): Integer;
 var
 i : Integer;
 begin
 if startIndex = endIndex then
 begin
 writeln(str);
 end
 else
 begin
 for i := startIndex to endIndex do
 begin
 str:=swap(str,startIndex,i);
 permute(str, startIndex+1, endIndex);
 str:=swap(str,startIndex, i);
 end;
 end;
 end;
 var
 str : String;
 L : Integer;
 begin
 readln(str);
 L := length(str);
 permute(str,0,L-1);
 end.

 5. Dec 14, 2015 #4
 Mark44
 Staff: Mentor
 Your swap function looks like it would work. When you call it the first time, what string goes into the function? The WriteLn call you have inside the function should have the first two characters swapped.

 6. Dec 14, 2015 #5
 jtbell
 User Avatar
 Staff: Mentor
 What exactly is it supposed to do, and what is it actually doing?

 7. Dec 14, 2015 #6
 It should do this:
 _URL_ [Broken]
 But for some reason the string suddenly starts to elongale, shorten...

 Last edited by a moderator: May 7, 2017
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook
Similar Discussions: Rewriting C/ C++ code in Pascal
 1. Critique my C++ code (Replies: 11)
Loading...


text:
pH-shift processing of Nannochloropsis oculata microalgal biomass to obtain a protein-enriched food or feed ingredient
Artikel i vetenskaplig tidskrift, 2015
Fractionation of plant and animal raw materials by pH-shift processing has been widely applied to purify proteins. The principle is to solubilize proteins at high or low pH, removing debris and precipitating the proteins near their isoelectric point. We here describe the pH-shift process on commercially available Nannochloropsis oculata. The partitioning of major nutrients into the various fractions of the process was studied. Proteins were found to exhibit maximal solubility between pH 7 and 10, with a minimal solubility below pH 4. Two process versions were investigated in this study, with solubilization at either pH 7 (native pH) or 10; both versions were precipitated at pH 3. Up to 85% of both the protein and total fatty acids were recovered in the final product, compared to the initial algal slurry. Protein, total fatty acids and carbohydrates were concentrated in the final product, while the ash content was lower compared to the starting material. From a processing point of view, solubilization of Nannochloropsis at native pH was found to be preferable, since less chemicals were consumed compared to high-pH solubilization. Owing to its content of protein and (total) fatty acids (23 and 12% of dry weight, respectively), the latter enriched in eicosapentaenoic acid (EPA), the product of the pH-shift process has potential as a functional food ingredient.
n-3 fatty acids
Acid/alkaline solubilization and precipitation


text:
Making Apple and Potato Stamps
Apple and Potato stamps are an easy way to have fun and create some beautiful art. This project requires relatively few supplies, but will require supervision for younger children.
You will need:
Fresh apples and/or large potatoes (each apple or potato will make two stamps)
Start by washing your potatoes and apples well. The first part of this project is the creation of the stamps, which requires the use of a sharp knife. It is important for younger children to be well supervised at this point, it may even be a good idea for an adult to do the steps that involve using a knife.
Step one is to cut the apples and potatoes in half. Make sure the cuts are nice and clean, as any mistakes will be apparent when the apple and potato halves are used as stamps. At this point you can leave the apples halves whole and use them just as apple shaped stamps. You can also use the halves to create more complex stamps.
In order to create a more complex stamp, you start by drawing the outline of the shape into the center of the apple or potato half. Once the outline is clearly drawn in, use the knife to cut the outline into the apple or potato, the cut should be about a quarter of an inch deep. After the outline is cut, carefully carve away the outer edge of the apple or potato away from the outline cut. Make these cuts from the outside in, until you reach the cut of the outline. You will want to cut away about a quarter inch of the apple or potato, leaving just the shape that you drew into the apple or potato as a stamp.
When your stamp is made, pour a small layer of paint into a plate. Spread the paint throughout the base of the plate. You can dip the stamp or apple half into the layer of paint, or you can use a paint brush to apply the paint to the stamp. Then, place the stamp paint side down onto the object you are decorating.
You can use these stamps to decorate clothing, create pictures or anything else that could use some decoration and absorbs paint. When you are planning your project, make sure that you decide what type of object you want to decorate and also make sure you have the correct type of paint for that object.

source: HuggingFaceFW/fineweb-edu


text:
Let's say that you are given a SQL table called "Compare" (the schema is shown below) with only one column called "Numbers".
Write a SQL query that will return the maximum value from the "Numbers" column, without using a SQL aggregate like MAX or MIN.
This problem is difficult because you are forced to think outside the box, and use whatever SQL you know to solve a problem without using the most obvious solution (doing a "select MAX…" from the table).
Probably the best way to start breaking this problem down is by creating a sample table with some actual data that matches the schema given. Here is a sample table to start out with:
The value that we want to extract from the table above is 90, since it is the maximum value in the table. How can we extract this value from the table in a creative way (it will have to be creative since we can't use the max or min aggregates)? Well, what are the properties of the highest number (90 in our example)? We could say that there are no numbers larger than 90 – that doesn't sound very promising in terms of solving this problem.
We could also say that 90 is the only number that does not have a number that is greater than it. If we can somehow return every value that does not have a value greater than it then we would only be returning 90. This would solve the problem. So, we should try to design a SQL statement that would return every number that does not have another number greater than it. Sounds fun right?
Let's start out simple by figuring out which numbers do have any numbers greater than themselves. This is an easier query. We can start by joining the Compare table with itself – this is called a self join, which you can read more about here in case you are not familiar with self joins: Example of self join in SQL.
Using a self join, we can create all the possible pairs for which each value in one column is greater than the corresponding value in the other column. This is exactly what the following query does:
SELECT Smaller.Numbers, Larger.Numbers FROM Compare as Larger JOIN Compare AS Smaller ON Smaller.Numbers < Larger.Numbers
Now, let's use the sample table we created, and we end up with this table after running the query above:
Now we have every value in the "Smaller" column except the largest value of 90. This means that all we have to do is find the value that is not in the Smaller column (but is in the Compare table), and that will give us the maximum value. We can easily do this using the NOT IN operator in SQL.
But before we do that we have to change the query above so that it only selects the "Smaller" column - because that is the only column we are interested in. So, we can simply change our query above to this in order to get the "Smaller" column:
SELECT Smaller.Numbers FROM Compare as Larger JOIN Compare AS Smaller ON Smaller.Numbers < Larger.Numbers
Now, all we have to do is apply the NOT IN operator to find the max value.
This will give us what we want - the maximum value. But there is one small problem with the SQL above - if the maximum value is repeated in the Compare table then it will return that value twice. We can prevent that by simply using the DISTINCT keyword. So, here's what the query looks like now:
And there we have our final answer. Of course, some of you may be saying that there is a much simpler solution to this problem. And you would be correct. Here is a simpler answer to the problem using the SQL Top clause along with the SQL Order By clause - this is what it would look like in SQL Server:
select TOP 1 -- select the very top entry in result set Numbers from Compare order by Numbers DESC
And since MySQL does not have a TOP clause this is what it would look like in MySQL using just ORDER BY and LIMIT :
select Numbers from Compare order by Numbers DESC - order in descending order LIMIT 1 --retrieve only one value
So, even though there are a couple of much simpler answers it is nice to know the more complicated answer using a self join so that you can impress your interviewer with your knowledge.
FOLLOW Varoon Sahgal, Author of ProgrammerInterviewon


Emotionless in a Sentence 🔊
Definition of Emotionless
without feeling or emotions
Examples of Emotionless in a sentence
It is important to display an emotionless mask when playing poker, so you don't show anything that might give away what you have in your hand. 🔊
It is my personal belief that insects are completely emotionless, not feeling anything like joy or sorrow, and only acting on instinct. 🔊
The emotionless face of my opponent is impossible to read, not betraying any sign of any kind of feeling at all. 🔊
Other words in the Uncategorized category:
Most Searched Words (with Video)


text:
DNA-based watermarks using the DNA-Crypt algorithm
Background: The aim of this paper is to demonstrate the application of watermarks based on DNA sequences to identify the unauthorized use of genetically modified organisms (GMOs) protected by patents. Predicted mutations in the genome can be corrected by the DNA-Crypt program leaving the encrypted information intact. Existing DNA cryptographic and steganographic algorithms use synthetic DNA sequences to store binary information however, although these sequences can be used for authentication, they may change the target DNA sequence when introduced into living organisms. Results: The DNA-Crypt algorithm and image steganography are based on the same watermark-hiding principle, namely using the least significant base in case of DNA-Crypt and the least significant bit in case of the image steganography. It can be combined with binary encryption algorithms like AES, RSA or Blowfish. DNA-Crypt is able to correct mutations in the target DNA with several mutation correction codes such as the Hamming-code or the WDH-code. Mutations which can occur infrequently may destroy the encrypted information, however an integrated fuzzy controller decides on a set of heuristics based on three input dimensions, and recommends whether or not to use a correction code. These three input dimensions are the length of the sequence, the individual mutation rate and the stability over time, which is represented by the number of generations. In silico experiments using the Ypt7 in Saccharomyces cerevisiae shows that the DNA watermarks produced by DNA-Crypt do not alter the translation of mRNA into protein. Conclusion: The program is able to store watermarks in living organisms and can maintain the original information by correcting mutations itself. Pairwise or multiple sequence alignments show that DNA-Crypt produces few mismatches between the sequences similar to all steganographic algorithms.
Dieser Eintrag ist freigegeben.


How does one conduct a critical analysis of Claudio in Shakespeare's Much Ado About Nothing?
1 Answer | Add Yours
tamarakh's profile pic
Posted on (Answer #1)
When conducting a critical analysis of a character, we first want to identify the author's main purpose in using the character. Does the author mean to teach the reader/viewer something new, persuade the reader, or just entertain the reader? We would then evaluate whether or not the author accomplished his/her purpose. When doing a critical analysis of a character, rather than of a work as a whole, it can be helpful to first conduct a character analysis.
When conducting a character analysis, we want to probe deeply into the character. We want to consider things such as whether or not the character is ethical. Does the character govern his actions through ethics and make fair and reasonable choices? We can also consider whether or not the character is a wise character or foolish. We can also consider the character's motives for their actions. Other things we can consider in conducting a character analysis are listed in the link below.
When conducting a critical analysis of Claudio through analyzing his character, one of the things we see is that one of Shakespeare's purposes in using Claudio is to show the reader just how much damage a jealous, excessively prideful, and gullible character can do. Claudio's jealous nature is portrayed when he is tricked by Don John, not once, but twice, into doubting the people he loves, such as Don Pedro and Hero. We see Claudio's excessive pride demonstrated in his very rapid decision to publicly shame Hero should he see that she is disloyal, as we see in his lines:
If I see anything to-night why I should not marry her tomorrow, in the congregation where I should wed, there will I shame her. (III.ii.105-108).
Claudio does not stop for one instant to question Don John's honesty, even though he had already been duped by him, nor does he stop to wait for more evidence, but, out of excessive pride, decides that the only way to maintain his pride is to publicly punish and shame Hero. However, Claudio is not all bad. We see that he has a very caring nature, especially through his close friendships with Benedick and Don Pedro, and we see that he has a great capacity to feel remorseful, as we see towards the end of the play.
We've answered 396,005 questions. We can answer yours, too.
Ask a question


Documentation / Structural Mechanics /
Torsional AnalysisAnalysis of Stress
Chapter 5
Finite Element Method
5.1 Introduction
This chapter introduces a number of functions for finite element analysis. First, one- and two-dimensional Lagrange and Hermite interpolation (shape) functions are introduced, and systematic approaches to generating these types of elements are discussed with many examples. You can design elements with desired features by manipulating terms in their basic functions. You can generate interpolation functions for many typical elements along with less conventional ones. Then you can create graphical representations of these interpolation functions. Finally, a number of useful auxiliary functions are also included.
You can solve many practical problems using a finite element procedure for plane elasticity problems. Since finite element analysis is an applied science, gaining experience in analysis is extremely crucial for the effectiveness of results. You can best acheive this by examining the intermediate steps of the analysis carefully and performing lots of calculations with various loading and meshing conditions. This chapter introduces functions for both the analysis and the intermediate steps of the analysis, along with graphical tools for clear representation of results. Mesh generation using the isoparametric formulation is also discussed with many examples.
5.2 One-Dimensional Shape Functions
5.2.1 General Remarks
With the package Element1D, you can compute the shape functions for one-dimensional Lagrangian- and Hermitian-type elements. You perform Hermite interpolation by fitting a curve to both an ordinate (field variable) and its slope (its derivative with respect to the local coordinate) at nodal points. The simplest Hermitian interpolation is between two nodal points at which the field variable and its derivative, with respect to the local coordinate, are known. Structural Mechanics contains the function HermiteElement1D for computing the Hermitian interpolation functions for one-dimensional elements. Lagrange interpolation is a special case of Hermite interpolation. In Lagrange interpolation, you obtain shape functions by fitting a curve for the field variables of a problem without concerning its derivatives.
5.2.2 Lagrange Elements
Generate the simplest Hermitian interpolation function, , that is linear, one-dimensional, and has only two nodal points. The zero-order Hermitian interpolation functions are also known as Lagrange elements. Since for Lagrange elements do not require the continuity of the slope, the order of interpolation is zero, that is, n = 0.
The length of the element is L and the coordinate is x in this example.
In[1]:=
In[2]:=
In[3]:=sfun0=HermiteElement1D[{0,L},0,x]
Out[3]=
To plot the locations of the nodes of this simple element, you use the function ElementPlot.
Display two nodes at (x, y) = (0, 0) and (1, 0) with L = 1.
In[4]:=$DefaultFont={"Courier",7};
ElementPlot[{{{0,0},{1,0}}},PlotRange->{{-1,2},All},Frame->True];
By definition, if the value of one of these interpolation functions is zero at a nodal point, the values of the other functions must be 1 at the same node. Plot these two interpolation functions to see if this condition is satisfied for L = 1 at x = 0 and x = L.
In[6]:=Plot[Evaluate[sfun0/.L->1],{x,0,1},PlotRange->{{0,1},{0,1}},Frame->True];
Similarly, you can easily generate higher-order interpolation functions for elements with more nodes. For example, compute the quadratic interpolation functions for equally spaced nodal points at (0, L/2, L).
In[7]:=sfun0=HermiteElement1D[{0,L/2,L},0,x]
Out[7]=
Display three nodes at (x, y) = (0, 0), (1/2, 0), and (1, 0) for L = 1. This shows the locations of the nodes.
In[8]:=ElementPlot[{{{0,0},{1/2,0},{1,0}}},
 PlotRange->{{-1,2},All},
 Frame->True];
This shows these quadratic interpolation functions graphically.
In[9]:=Plot[Evaluate[sfun0/.L->1],{x,0,1},
 PlotRange->{{0,1},{-0.25,1}},
 Frame->True];
5.2.3 Hermite Elements
A element provides inter-element continuity of the field variable (e.g., displacement, temperature, and so on) and its first derivatives (e.g., stress, heat flux, and so on) at the nodal points. In Lagrange-type elements, the solution for a field variable being approximated is continuous between elements; however, its derivatives are not necessarily continuous. Thus, only second-order partial differential equations can be approximated by Lagrange-type interpolation functions. In many cases, you might encounter higher-order differential equations. For example, in Euler-Bernoulli beam theory, the transverse deflection of the beam is governed by a fourth-order differential equation. Thus, the continuity of the first derivative of the solution (slope of the elastic curve in the beam problem) between elements is required since the slope is a primary variable, and the moment is the generalized force corresponding to this slope.
You can easily obtain the simplest two-point Hermitian interpolation functions for elements (that is, n = 1) as in the following example. The first two functions in the output correspond to continuity of the field variable (zero-order), and the last two are for the first-order continuity, that is, the derivatives, with respect to the local coordinate x, are continuous for these interpolation functions.
In[10]:=sfun=HermiteElement1D[{0,L},1,x]
Out[10]=
The first function is unity at x = 0, and the second function is unity at x = L. All other functions are zero since the first two functions of the above output provide the inter-element continuity of the field variable, namely continuity, while the last two are for the continuity of the first derivative of the field variable.
In[11]:=sfun/.x->0
Out[11]=
In[12]:=sfun/.x->L
Out[12]=
Similarly, the derivatives of the interpolation functions with respect to the coordinate x are unity at their corresponding nodal points.
In[13]:=D[sfun,x]/.x->0
Out[13]=
In[14]:=D[sfun,x]/.x->L
Out[14]=
You clearly see the behavior of interpolation functions when you plot them. The length of the element L is equal to 1 in the following graphics. First, generate a plot for the inter-element continuity interpolation functions, which are given in the first two entries of the list sfun.
In[15]:=Plot[Evaluate[sfun[[1]]/.L->1],{x,0,1},
 PlotRange->{{0,1},{0,1}},
 Frame->True];
In[16]:=C1=sfun[[1]]/.L->1
Out[16]=
As expected (by definition), the first-order interpolation functions and their derivatives with respect to the local coordinate diminish at the nodal points. Here is the plot for the first-order interpolation functions.
In[17]:=Plot[Evaluate[sfun[[2]]/.L->1],{x,0,1},
 PlotRange->{{0,1},{-0.25,0.25}},
 Frame->True];
However, their derivatives with respect to x should behave as interpolation functions.
In[18]:=Plot[Evaluate[D[sfun[[2]],x]/.L->1],{x,0,1},
 PlotRange->{{0,1},{-0.5,1}},
 Frame->True];
Similarly, the following plot shows that the derivatives of interpolation functions at the nodal points are equal to zero.
In[19]:=Plot[Evaluate[D[sfun[[1]],x]/.L->1],{x,0,1},
 PlotRange->{{0,1},{-2,2}},
 Frame->True];
5.3 Two-Dimensional Shape Functions
5.3.1 General Remarks
You can obtain the Lagrange shape functions for the rectangular elements whose nodes are placed in equally spaced


text:
Adolphus Asher (_PHONE_): Berlin bookseller, Anglophile, and friend to Panizzi
THE London weekly The Athenceum of 1 October 1853 carried in its gossip column the following brief obituary: "Mr. Adolphus Asher, bookseller of Berlin, whose shop in the Linden Walk was the common rendezvous of literary natives and strangers in that capital, died at Venice on the 2nd of this month [September]. Mr. Asher was one ofthe continental purveyors for tbe British Museum, and his business brought him into frequent connexion with the leading literary men in this country; by whom he was respected for bis great knowledge of books, and for his ready disposition to place the advantages of his foreign connexion at the service of those to whom it might be useful. His loss will be felt by the English literary visitor at Berlin, as that of an old and agreeable friend. He died in his fifty-third year."
Adolphus Asher (_PHONE_): Berlin bookseller, Anglophile, and friend to Panizzi (PDF format), 15.2MB


text:
You don't have to be an expert to enjoy something.
Best-selling author of "The First 20 Hours: How to Learn Anything Fast!" Josh Kaufman shares universal, field-tested approaches to effective learning and rapid skill acquisition in adults. From deconstructing complex skills to maximizing productive practice and removing common learning barriers, Kaufman describes how 20 hours of focused, deliberate practice can help you develop surprising levels of skill in any field. And, he may even play his Ukulele. (music bed: Podington Bear/Golden Hour)


text:
Setting up Assembly Order management in Dynamics 365 Business Central involves:
- Firstly, open "Assembly Setup" page and fill in the "Number Series" fields accordingly.
- Create your first Assembly Item by changing the "Replenishment" system to "Assembly" and the "Assembly Policy" to "Assemble-to-stock".
- In order to assign the sub-items to the BOM, click on "Assembly BOM" and add the items or resources required to make the Assembly Item.
- You can create a "Purchase Order" and purchase the Assembly Item you created directly and it will increment your inventory readings. However this will not consume the child (sub-items) in the related BOM for that item. In order to increase the Assembly Item inventory and decrease the related BOM items, you need to use the "Assembly Orders" page to create an "Assembly Order" and post it.
- When creating Assembly Orders you can include Items as well as Resources and Machines (a type of resource) based on hourly rates.
- Avoid using "non-inventory" items in BOM because combining Inventory and Non-inventory items on the BOM will be refused by the Assembly Order (an error can prevent you from creating an Assembly Order with a non-inventory Item). If you want to account for fees and charges and would like those tracked just like inventory items, using Resources might be an option (if Item Charges are not fit for your business use-case scenario that is).


text:
Author(s): Abbas MI
Abstract Share this page
Abstract Knowledge of the solid angle (and consequently, the geometrical efficiency) is essential in all absolute measurements of the strengths of radioactive materials and to calibrate detectors. The method of high-efficiency gamma counting by means of well-type HPGe and NaI (Tl) detectors is widely used and has proved a powerful tool, particularly when low-activity, small-volume environmental samples are to be analyzed by gamma-ray spectrometry. In the present work, we introduce a direct analytical method for calculating the solid angle subtended by a well-type detector at axial point, non-axial point, extended circular disk and cylindrical sources. The validity of the derived analytical expressions was successfully confirmed by the comparisons with some published data (experimental and Monte Carlo).
This article was published in Appl Radiat Isot
and referenced in Journal of Physical Mathematics


executing the code under these circumstances is running in native mode.
Changing Individual SiteKiosk Configuration Elements with a SiteRemote Job
Often you just need to change a single SiteKiosk configuration setting. Even when using a great number of SiteKiosk machines this is not a problem, you can just use the configuration feature of SiteRemote to distribute the changed configuration file to the machines.
But what if your machines all use configurations that differ in parts, for example the configurations are all using a different start page to reflect their individual locations while the rest of the settings are the same. This challenge can be solved by making use of the fact that the SiteKiosk configuration files are built on the XML format. This enables you to create a Javascript file that can access and edit a specific element of the configuration file.
The following script examples do not use the SiteKiosk Object Model. They use common Javascript/JScript techniques as described for example in the Microsoft MSDN library.
The first example will enable the fullscreen mode of SiteKiosk. The script starts by creating the required ActiveX objects to access the Windows registry and to edit an XML document. Next it queries the path of the latest SiteKiosk configuration file from the registry, either of a 32 or a 64 bit system. It then loads the document and assigns the XML node for the fullscreen setting and changes its text. Finally the edited configuration file is being saved. For further information on the methods to work with an XML document see _URL_
try{
 //Wsh Shell Object
 var WshShell = new ActiveXObject("WScript.Shell");
 //XML support
 var xmlDoc = new ActiveXObject("Msxml2.DOMDocument.3.0");
 //Path to the SiteKiosk configuration
 var OsType = WshShell.RegRead("HKEY_LOCAL_MACHINE\\SYSTEM\\CurrentControlSet\\Control\\Session Manager\\Environment\\PROCESSOR_ARCHITECTURE");
 if (OsType == "x86")
 var gstr_configpath = WshShell.RegRead("HKEY_LOCAL_MACHINE\\SOFTWARE\\PROVISIO\\SiteKiosk\\LastCfg"); //you may use an absolute path instead, e.g.: var gstr_configpath = "c:\\program files\\sitekiosk\\config\\myconfig.skcfg"
 else
 var gstr_configpath = WshShell.RegRead("HKEY_LOCAL_MACHINE\\SOFTWARE\\Wow6432Node\\PROVISIO\\SiteKiosk\\LastCfg"); //you may use an absolute path instead, e.g.: var gstr_configpath = "c:\\program files\\sitekiosk\\config\\myconfig.skcfg"
 if(xmlDoc.load(gstr_configpath)){
 var lk_nodeselection = xmlDoc.documentElement.selectSingleNode("//sitekiosk-configuration/browserbar/hidemode");
 //Changes the node text to 1 which enables permanent fullscreen mode (0 disables fullscreen, 2 enables fullscreen mode for specific URLs only).
 lk_nodeselection.text = "1";
 //Saves the changes
 xmlDoc.save(gstr_configpath);
 }
 else{
 //Returns an error exit code to SiteRemote
 ExitResult.Code = 1;
 ExitResult.Description = "Error opening configuration file.";
 }
}
catch(e){
 try {
 if(e.number != 0)
 ExitResult.Code = e.number;
 else
 ExitResult.Code = 1;
 ExitResult.Description = e.description;
 }
 catch(e){}
}
After running the script the fullscreen setting of the SiteKiosk configuration looks like this:
The second example adds a URL excluded from filtering to the Content Filter of SiteKiosk. Again it starts by creating the required ActiveX objects and finding the path to the latest SiteKiosk configuration file. Next it adds a new XML node to an existing one for the URL that should be excluded from filtering. After that the document is being saved. For further information on the methods to work with an XML document see _URL_
try{
 //Wsh Shell Object
 var WshShell = new ActiveXObject("WScript.Shell");
 //XML support
 var xmlDoc = new ActiveXObject("Msxml2.DOMDocument.3.0");
 //Path to the SiteKiosk configuration
 var OsType = WshShell.RegRead("HKEY_LOCAL_MACHINE\\SYSTEM\\CurrentControlSet\\Control\\Session Manager\\Environment\\PROCESSOR_ARCHITECTURE");
 if (OsType == "x86")
 var gstr_configpath = WshShell.RegRead("HKEY_LOCAL_MACHINE\\SOFTWARE\\PROVISIO\\SiteKiosk\\LastCfg"); //you may use an absolute path instead, e.g.: var gstr_configpath = "c:\\program files\\sitekiosk\\config\\myconfig.skcfg"
 else
 var gstr_configpath = WshShell.RegRead("HKEY_LOCAL_MACHINE\\SOFTWARE\\Wow6432Node\\PROVISIO\\SiteKiosk\\LastCfg"); //you may use an absolute path instead, e.g.: var gstr_configpath = "c:\\program files\\sitekiosk\\config\\myconfig.skcfg"
 if (xmlDoc.load(gstr_configpath)){
 var lobj_snglnode = xmlDoc.selectSingleNode("//plugin[@name='SiteCoach']");
 var lobj_newelelement,lstr_newtext;
 lobj_newelelement=xmlDoc.createNode(1, "exclude", lobj_snglnode.namespaceURI);
 lstr_newtext=xmlDoc.createTextNode("_URL_");
 lobj_newelelement.appendChild(lstr_newtext);
 lobj_snglnode.appendChild(lobj_newelelement);
 //Saves the changes
 xmlDoc.save(gstr_configpath);
 }
 else{
 //Returns an error exit code to SiteRemote
 ExitResult.Code = 1;
 ExitResult.Description = "Error opening configuration file.";
 }
}
catch(e){
 try {
 if(e.number != 0)
 ExitResult.Code = e.number;
 else
 ExitResult.Code = 1;
 ExitResult.Description = e.description;
 }
 catch(e){}
}
After running the script the Content Filter page of the SiteKiosk configuration looks like this:
To run such a script just go to the Jobs section of SiteRemote and create a new job and select Execute Script as action. Copy and paste the code into the text field and assign the job. Do not activate the checkbox Script requires SiteKiosk Object, as it would run the script within the SiteKiosk user context, who for security reasons does not have the necessary rights to edit the configuration.
Note that you should make changes to the configuration file with care and test them first before applying to a great number of terminals. E.g. writing XML incompatible values to the configuration will make the file unreadable, so SiteKiosk will then load the emergency configuration file instead.
In order to let the new configuration file become the active configuration you need to restart SiteKiosk.
LDAP User Mapping in SiteRemote
Note: The first part of this page applies to SiteRemote 6.2 and higher. For older versions please see the second part of this page.
SiteRemote Server 6.2 now includes an LDAP configuration option on the Settings page of the SiteRemote server. SiteRemote supports the LDAPv3 protocol, please make sure that your LDAP server supports this protocol version.
Click on Edit configuration to create a set of LDAP settings. If you only want LDAP authorization to be allowed on your SiteRemote server use the Only allow LDAP authorization checkbox, login with local SiteRemote users will then be deactivated.

On the configuration page you can set the time for the daily LDAP synchronization. You can also add as many LDAP domains as you want, e.g. to assign different LDAP servers to your SiteRemote teams. You can edit or delete existing domains, note that you


text:
In the News
Research indicates that sports participation and active commuting to school would significantly decrease obesity prevalence in adolescents.
As reported in the July 2012 issue of Pediatrics, we surveyed 1718 high school students and asked them about their team sports participation, active commuting to school, recreational physical activity, height, weight, diet quality, and other individual characteristics.
We found 4 key points:
- Adolescents playing on 2 sports teams were 22% less likely to be overweight/obese and 39% less likely to be obese compared with adolescents not playing on any sports teams.
- The prevalence of overweight/obesity and obesity would decrease by 11% and 26%, respectively, if all adolescents played on 2 sports teams per year.
- Adolescents who walked/biked to school at least 4 days per week were 33% less likely to be obese compared with those who never walked/biked to school.
- The prevalence of obesity would decrease by 22% if all adolescents walked/biked to school at least 4 days per week.
Sports participation typically involves consistent moderate to vigorous physical activity, which may account for its robust inverse relationship with high-risk weight status. Active commuting to school may also be a fruitful strategy for decreasing childhood obesity. To combat dwindling active commuting rates in youths in recent decades, federally-funded Safe Route to School programs are providing the necessary infrastructure to support active commuting to school. Based on our results, interventions that facilitate sport participation in adolescents of all ability levels should be prioritized for obesity prevention.
Authors: Keith M. Drake, Ph.D., Michael L. Beach, M.D., Ph.D., Meghan R. Longacre, Ph.D., Todd MacKenzie, Ph.D., Linda J. Titus, Ph.D., Andrew G. Rundle, Dr.P.H., Madeline A. Dalton, Ph.D.
Study examines links between movie smoking, team sport participation and youth smoking.
As reported in the July 2009 issue of Archives of Pediatric & Adolescent Medicine, we examined the joint effects of movie smoking exposure and team sports participation on established smoking. We analyzed data from school and telephone-based surveys that assessed movie smoking exposure and team sports participation in 2,048 youths aged 16-21 years.
We found two key points: team sports participation lowers the risk of youth smoking. However, the more movie smoking that team sports players see, the greater the likelihood that they will be smokers.
This study adds to the mounting evidence that explicit policies are needed to minimize youth exposure to movie smoking.
What can parents do?
- Monitor what movies your child watches.
- Restrict R-rated movies.
- Use online tools designed for parents, including screenit.com and commonsensemedia.org, to be informed about the amount of smoking in a specific movie.
Parents, teachers, coaches, and clinicians should be aware that encouraging team sports participation in tandem with minimizing early exposure to movie smoking may offer the greatest likelihood of preventing youth smoking.
Lead author Anna Adachi-Mejia, Ph.D.


bog eying
1 [boh-gee; for 2 also boog-ee, boo-gee]
noun, plural bogeys.
a score of one stroke over par on a hole.
par ( def 4 ).
bogy1 ( defs 1–3 ).
Also, bogy, bogie. Military. an unidentified aircraft or missile, especially one detected as a blip on a radar screen.
verb (used with object), bogeyed, bogeying.
Golf. to make a bogey on (a hole): Arnold Palmer bogeyed the 18th hole.
1890–95; spelling variant of bogy Unabridged
2 [boh-gee] Australian.
noun, plural bogeys.
a swim; bathe.
verb (used without object), bogeyed, bogeying.
to swim; bathe.
< Dharuk, equivalent to būbathe + -gi past tense marker
3 [boh-gee] (sometimes initial capital letter) Slang.
verb (used with object), verb (used without object), bogeyed, bogeying, noun, plural bogeys.
1965–70; in reference to Bogey or Bogie, nickname of Humphrey Bogart Unabridged
Cite This Source Link To bog eying
World English Dictionary
bogey or bogy1 (ˈbəʊɡɪ)
1. an evil or mischievous spirit
2. something that worries or annoys
3. golf
 a. Compare par a score of one stroke over par on a hole
 b. obsolete a standard score for a hole or course, regarded as one that a good player should make
4. slang a piece of dried mucus discharged from the nose
5. slang air force an unidentified or hostile aircraft
6. slang a detective; policeman
7. (tr) golf to play (a hole) in one stroke over par
[C19: probably related to bug² and bogle1; compare bugaboo]
bogy or bogy1
bogey or (Austral) bogie2 (ˈbəʊɡɪ)
1. to bathe or swim
2. a bathe or swim
[C19: from a native Australian language]
bogie or (Austral) bogie2
[C19: from a native Australian language]
Collins English Dictionary - Complete & Unabridged 10th Edition
Cite This Source
Word Origin & History
World War II aviator slang for "unidentified aircraft, presumably hostile," probably ultimately from bogge, a variant of M.E. bugge "a frightening specter" (see bug). Thus it shares ancestry with many dialect words, such as bog/bogge (attested 16c.-17c.), bogeyman (16c.), boggart
"specter that haunts a gloomy spot" (c.1570, in Westmoreland, Lancashire, Cheshire, and Yorkshire). The earliest modern form appears to be Scottish bogle "ghost," attested from c.1500 and popularized c.1800 in Eng. literature by Scott, Burns, etc.
in golfing, c.1891, originally "number of strokes a good player is supposed to need for a given hole or course;" later, "score one over par" (1946); from the same source as bogey (1), on the notion of a "phantom" opponent, represented by the "ground score." The word was in
vogue at the time in Britain because of the popularity of the music hall tune "Hush, Hush, Hush, Here Comes the Bogey Man."
"One popular song at least has left its permanent effect on the game of golf. That song is 'The Bogey Man.' In 1890 Dr. Thos. Browne, R.N., the hon. secretary of the Great Yarmouth Club, was playing against a Major Wellman, the match being against the 'ground score,' which was the name given to the scratch value of each hole. The system of playing against the 'ground score' was new to Major Wellman, and he exclaimed, thinking of the song of the moment, that his mysterious and well-nigh invincible opponent was a regular 'bogey-man.' The name 'caught on' at Great Yarmouth, and to-day 'Bogey' is one of the most feared opponents on all the courses that acknowledge him." [1908, cited in OED]
As a verb, attested by 1948.
Online Etymology Dictionary, © 2010 Douglas Harper
Cite This Source
Slang Dictionary
bogart definition
[ˈbogɑrt] and [ˈbogɑrd]
and bogard
 1. in.
 2. in.
 3. in.
Copyright 2007. Published by McGraw-Hill Education.
Cite This Source
Copyright © 2014, LLC. All rights reserved.
 - Please Login or Sign Up to use the Recent Searches feature


Best Ipad Games
Dark Light
iPhone App Reviews: Reiner Knizia's Monumental A Fun Cerebral Puzzler
Reiner Knizia's Monumental, yet another offering from the genius behind Robot Master, Roto, and Knights of Charlemagne, has been released by Conlan Rios in the app store. As usual, a clean interface mixed with "simple to learn, hard to master" rules is a recipe for a fun, cerebral puzzler.
Dr. Knizia's latest takes place in a Mayan setting, with a pair of 3 x 4 grids. A solid column separates the grids. This column fills with rectangular stones, which must be shuttled either left or right into the grids. Each stone has a distinct color and number of symbols upon its face. The goal is to fill rows on either side of the center column that match as many distinctive features as possible. Ideally, you would want to have three red stones with one bird on each, for example. This would earn an excellent score for matching colors, symbols, and number of symbols. Of course, it will be rare to match across all three elements. If you can place stones with the same symbols in a row, even if these are a blue, red, and yellow stone, or two stones with two birds and one stone with three birds, these still qualify as symbol matches. You also score points if you match an identical pair in a row, regardless of what is contained on the third stone. Broken stones without symbols will appear, too. These can only match by color.
When you slide a stone left or right, it must go to the end of the row. There is no scoring or bonuses for anything matching in columns. When a stone is moved, all stones above it drop down one row. Therefore, once a stone reaches the bottom of the center column, it has no where to go but in either side of the bottom row. Planning ahead is key to avoid being stuck having to place stones in certain spots. There is but one way to "fix" a mistake such as this. You'll notice a small jeep in the bottom left corner of the screen. Each move propels the jeep a small step closer to its base camp. When it reaches base camp, you are rewarded with a stick of dynamite. This dynamite can be dragged onto any one stone, blowing it up and removing it from the board. This dynamite can be used right away or saved for later use. You can even have more than one bundle in your inventory at the same time.
As you progress further into the game, more colors and symbols will appear, as well as greater numbers of symbols on some stones. This greater variety typically serves to make matching more difficult, requiring even greater care in the placement of stones. When a row of three is completed, it will indicate its point total, but will not add it to your overall score just yet. Rows remain uncleared until the bottom row on both sides is full. That full row will be cleared and any others in sequence above it until there is an empty row or a row that is not completely filled. As rows are cleared, their scores are added to your overall score. If the entire bottom row does not incur any points, the result will depend on the game mode that you are playing.
Monumental offers two modes of play: Challenge and Action. Challenge is untimed, allowing you to carefully plan your moves. The trade-off is that as soon as neither side of the bottom row scores points, the game ends. Action mode is a bit more lenient, but you are timed, limiting your ability to plan your moves. The face of the Mayan god at the top of the screen is surrounded by lighted dots and a timer in the upper right corner is drained while you decide which stone to move. Moving the first stone starts the time, and moving any subsequent stone resets the timer. If the timer runs out, one of the lights around the Mayan god is extinguished. Failing to match stones in the bottom row extinguishes multiple dots. Once all of the dots have gone dark, the game ends.
The graphics are appealing, with a great Mayan theme and bright colors. The sounds add to the experience, with cool gong noises and other effects occurring during the course of play. Music from your own library can be played as an alternative. Controls are simple, utilizing dragging to accomplish your goal. There is a quick how-to-play section in the form of a few pages of an explorer's journal. As with many Reiner Knizia games, the explanations often sound confusing. Everything tends to click within the first couple minutes of playing, so have no fear if you have had trouble following along.
There are local leaderboards, as well as country-specific and global leaderboards to which you can submit your scores. These, along with intelligent, addictive gameplay, add to the replay value of the game. The game also autosaves and allows you to resume your last game, making for easy pick-up-and-play. Monumental will set you back $1.99, a fair price for this 5-Dimple strategic puzzler.
Reiner Knizia's Monumental gets our AppSmile 5-Dimple rating:
Latest Reviews Popular Tags


A Quick Guide to- the Common Cockchafer

The common cockchafer, Melolontha melolontha, is a rather large beetle that flies about noisily, emitting a loud whirring noise. It is more commonly known as the May Bug and it gets this nickname as it commonly emerges in early May and is seen frequently during this time. Due to its large size and clumsy flight, it can cause quite a stir when seen and social media is often full of enquiries about this beetle. So, now that we are in the peak season for this species, here's all you need to know about the cockchafer.

Identification
The common cockchafer is a fairly large beetle that can grow up to 3.5cm in length. It is the UK's largest chafer species. They have rusty brown elytra (wing cases), brown legs, a black thorax and a black head. They are covered in short hairs which can give them a 'dusty' appearance. They also have whitish markings on their abdomen, which can be seen under the edges of their elytra.
They have rather spectacular orange antennae that have a beautiful fan-like tip. These antennae also help us to determine the sex of the beetle as males have 7 leaves in their fan-like tip and females have only 6.
The common cockchafer differs from similar chafer species by having a pointed pygidium, which is a segment at the end of their abdomen. This pygidium often leads people to believe that this species can sting, but do not worry– this beetle cannot sting. The pointed pygidium is actually used by females to push their eggs into soil.
Photographer: Marcus Mitschack
Photographer: Marcus Mitschack
The larvae look considerably less attractive than their adult counterparts. They are white, with reddish/brown heads and appear C-shaped due to their curved body. They have 3 pairs of reddish/brown legs. They grow up to 4.5cm and can be easily confused with other chafer beetle larvae and stag beetle larvae.
Photographer: Danny Steaven
Photographer: Danny Steaven

Lifecycle
Cockchafers lay their eggs into soil in the summertime, roughly in June/July and these eggs then hatch into the fat, white larvae. The larvae spend their lives living within the soil, feeding on plant and grass roots. They do this for a period of 3 years (sometimes 4-5 years in colder climates) until they reach a length of 4cm-4.5cm. Once they reach this size, they move deeper down in the soil and pupate. They emerge as adults in autumn but stay buried until spring. They surface in either April or May, depending on how warm it is. Adults survive for 5-6 weeks and during this time they mate, with females being able to lay up to 80 eggs.
1024px-Reitter-1908_table75_life_cycle
Although adults are often seen, due to their noisy and rather clumsy flight, larvae are less commonly seen. Gardeners tend to come across the larvae most often, whilst working in the soil.

Habitat
Adults can often be found in gardens and they frequent hedgerows, parks and grasslands. Adults chew on the leaves of trees and flowers so can often be found flying near the tops of trees.
Photographer: Alex Nadolniy
Photographer: Alex Nadolniy
Adults are attracted to light and can often be heard bumping into lighted windows during May. Due to their nature of flying at the height of tree tops, they also regularly come into contact with chimneys and have been known to fall down them on occasion. They are mainly seen (and heard) during the early evening from May until early July.

Distribution
Cockchafer larvae can be a pest of some cereal and vegetable crops when present in large numbers. Because of this, the beetle was subjected to heavy pest control throughout history. Before pesticides came on the market, cockchafers were controlled by the collection and killing of adults, which worked moderately well. Then, in the 20th century, pesticides came on the market and unfortunately this caused cockchafer numbers to decline dramatically. Thankfully, new regulations regarding pesticide use came into effect in the 1980's and since then their numbers have began to increase.
Cockchafers are currently wide-spread in Britain.
Photographer: Mark Aldron
Photographer: Mark Aldron

References
NatureSpot, (2017). Common Cockchafer- Melolontha melolontha. [Online] Available at: _URL_ [Accessed 06 May 2017].
National Insect Week, (2017). Cockchafer (May-bug). [Online] Available at: _URL_ [Accessed 06 May 2017].
Discover Wildlife, (2017). 7 things you never knew about the cockchafer. [Online] Available at: _URL_ [Accessed 05 May 2017].
The RSPB, (2017). The RSPB: A to Z of a Wildlife Garden: Cockchafer. [Online] Available at: _URL_ [Accessed 05 May 2017].
Royal Horticultural Society, (2017). Chafer grubs in lawns/RHS gardening. [Online] Available at: _URL_ [Accessed 05 May 2017].
Buglife, (2017). Common cockchafer. [Online] Available at: _URL_ [Accessed 05 May 2017].
4,675 total views, 11 views today
The following two tabs change content below.
Rachel Davies
Rachel Davies
Currently studying for an MRes in Wildlife Conservation at the University of Chester. Research focuses on the White-faced Darter, an endangered dragonfly species here in Britain. Rachel also has a blog titled 'working with wildlife'.
Rachel Davies
Latest posts by Rachel Davies (see all)
You may also like...
Leave a Reply
Your email address will not be published. Required fields are marked *
Blue Captcha Image
Refresh
*
You may use these HTML tags and attributes:   <acronym title="">
      <q cite=""> <s>
Powered by Calculate Your BMI


SciPy
scipy.spatial.Rectangle.split
Rectangle.split(d, split)[source]
Produce two hyperrectangles by splitting.
In general, if you need to compute maximum and minimum distances to the children, it can be done more efficiently by updating the maximum and minimum distances to the parent.
Parameters:
d : int
Axis to split hyperrectangle along.
split : float
Position along axis d to split at.
Previous topic
scipy.spatial.Rectangle.min_distance_rectangle
Next topic
scipy.spatial.Rectangle.volume


text:
Vulnerable Art: Historic Iron Fences at Mount Auburn Cemetery
In the early years at Mount Auburn Cemetery many proprietors chose to enclose their lots with iron fences. By the 1860's, 1700 iron fences dotted the cemetery. People called the look, "crazy quilt." Iron fence art was short lived. By 1871 a movement to remove them began. Today only a treasured few remain and the Cemetery is committed to preserving them. In this walk with Volunteer Docent Rosemarie Smurzynski you will visit these fences, learn a vocabulary for this art, and discover what makes these remaining fences significant.
Funding for programs has been provided in part by the Massachusetts Cultural Council.
Leave a Reply


text:
Search Result for "offend":
1. cause to feel resentment or indignation;
- Example: "Her tactless remark offended me"
[syn: pique, offend]
2. act in disregard of laws, rules, contracts, or promises;
- Example: "offend all laws of humanity"
- Example: "violate the basic laws or human civilization"
- Example: "break a law"
- Example: "break a promise"
[syn: transgress, offend, infract, violate, go against, breach, break]
3. strike with disgust or revulsion;
- Example: "The scandalous behavior of this married woman shocked her friends"
[syn: shock, offend, scandalize, scandalise, appal, appall, outrage]
4. hurt the feelings of;
- Example: "She hurt me when she did not include me among her guests"
- Example: "This remark really bruised my ego"
[syn: hurt, wound, injure, bruise, offend, spite]
The Collaborative International Dictionary of English v.0.48:
Offend \Of*fend\, v. t. [imp. & p. p. Offended; p. pr. & vb. n. Offending.] [OF. offendre, L. offendere, offensum; ob (see Ob-) + fendere (in comp.) to thrust, dash. See Defend.] 1. To strike against; to attack; to assail. [Obs.] --Sir P. Sidney. [1913 Webster] 2. To displease; to make angry; to affront. [1913 Webster] A brother offended is harder to be won than a strong city. --Prov. xviii. 19. [1913 Webster] 3. To be offensive to; to harm; to pain; to annoy; as, strong light offends the eye; to offend the conscience. [1913 Webster] 4. To transgress; to violate; to sin against. [Obs.] [1913 Webster] Marry, sir, he hath offended the law. --Shak. [1913 Webster] 5. (Script.) To oppose or obstruct in duty; to cause to stumble; to cause to sin or to fall. [Obs.] [1913 Webster] Who hath you misboden or offended. --Chaucer. [1913 Webster] If thy right eye offend thee, pluck it out... And if thy right hand offend thee, cut it off. --Matt. v. 29, 3O. [1913 Webster] Great peace have they which love thy law, and nothing shall offend them. --Ps. cxix. 165. [1913 Webster]The Collaborative International Dictionary of English v.0.48:
Offend \Of*fend"\, v. i. 1. To transgress the moral or divine law; to commit a crime; to stumble; to sin. [1913 Webster] Whosoever shall keep the whole law, and yet offend in one point, he is guilty of all. --James ii. 10. [1913 Webster] If it be a sin to covet honor, I am the most offending soul alive. --Shak. [1913 Webster] 2. To cause dislike, anger, or vexation; to displease. [1913 Webster] I shall offend, either to detain or give it. --Shak. [1913 Webster] To offend against, to do an injury or wrong to; to commit an offense against. "We have offended against the Lord already." --2 Chron. xxviii. 13. [1913 Webster]Moby Thesaurus II by Grady Ward, 1.0:
94 Moby Thesaurus words for "offend": affront, aggrieve, anger, annoy, appall, blemish, blot, breach, break, call names, chagrin, commit sin, contravene, deface, disfigure, disgruntle, disgust, dishonor, disoblige, displease, distress, disturb, do amiss, do wrong, dump on, dysphemize, embarrass, err, exasperate, excite, fleer at, flout, fret, gall, gibe at, give offense, give offense to, give umbrage, grieve, gross out, horrify, humiliate, hurl a brickbat, hurt, hurt the feelings, infract, infringe, insult, irritate, jeer at, jibe at, look a fright, look a mess, look bad, look like hell, look something terrible, mar, miff, mock, nauseate, needle, nettle, offend the eye, outrage, pain, pique, provoke, put down, put off, rankle, rattle, repel, repulse, revolt, rile, ruffle, scandalize, scoff at, shock, sicken, sin, slight, snub, spoil, sting, taunt, transgress, treat with indignity, trespass, turn the stomach, uglify, upset, vex, wound


Take the 2-minute tour ×
Recently in a seminar someone mentioned that monotone maps are equivalent to gradients of scalar convex functions, but it's not clear to me why this is true. One direction of the equivalence is straightforward but the other is not (as far as I can tell).
Definition. A map $F:\mathbb{R}^n \rightarrow \mathbb{R}^n$ is monotone on a convex set $C$ if $$(y-x)^T(F(y)-F(x))\ge0$$ for all $x,y \in C$.
One direction of the equivalence:
Prop. Let $f:\mathbb{R}^n \rightarrow \mathbb{R}$ be convex and sufficiently differentiable. Then $\nabla f$ is monotone.
Pf. Convex differentiable functions satisfy $$f(y) \ge f(x) + \nabla f(x)(y-x).$$
By choosing the points in reverse, we also have, $$f(x) \ge f(y) + \nabla f(y)(x-y).$$ Add these inequalities and rearrange to get $(\nabla f(y)-\nabla f(x))(y-x) \ge 0$.∎
Now the other direction:
Prop. Let $F:\mathbb{R}^n \rightarrow \mathbb{R}^n$ be monotone and sufficiently differentiable. Then there exists a convex function $f:\mathbb{R}^n \rightarrow \mathbb{R}$ such that $F=\nabla f$.
Pf.???
It seems like this should be easy, but I'm stuck and google/wikipedia have been of little help. I'm actually starting to doubt whether it is true.
share|improve this question
By "sufficiently differentiable", I believe you mean that the gradient exists? You assume nothing else... I think you really need more precise conditions to know what happens next, but I'm not confident about the truth behind this result. – Patrick Da Silva Feb 21 '12 at 19:26
The obvious thing to try would be $f(x) = \int_0^1 F(xt) \, dt$. A simple computation shows that $\nabla f = F$. Then maybe the monotonicity of $F$ can be used to show that $f$ is convex? – Jeff Feb 21 '12 at 20:06
_USER_ The point was to allow anyone answering to use as many derivatives as needed. I don't think it even needs a single derivative though so long as the gradient is generalized to an element of the subderivative, but this is not really important to me so feel free to assume it is smooth. – Nick Alger Feb 21 '12 at 20:28
_USER_ Yeah, so for 1D that's totally right. But does it also hold for higher dimensions? This line of thought makes me think the result may be related to the subject of integrable systems. – Nick Alger Feb 21 '12 at 20:30
Not all fields $F$ are gradients. If $F=(F_1,\dots,F_n)$ is $C^1$, a necessary condition for $F$ to be a gradient is that $\partial F_i/\partial x_j=\partial F_j/\partial x_i$for $1\le i


text:
Terms and Conditions of Franchise
To spread the arena of academic sphere and focusing on its motto to develop any region (both socially and economically), SAIARD has taken an initiatives to give franchise to any individual or institution those who wants to run SAIARD's skill based courses at their own premises under the coverage's of SAIARD's rules and regulations. The basic objectives of this initiative is-
- To prepare skill based manpower.
- To generate local human resource.
- To support local government.
- To create employment opportunities.
- To develop the region both socially and economically.
Terms and Conditions
The terms and conditions of taking franchise of SAIARD's Courses are as follows:
- Any individuals (who wants to open an academic institution like start up) or institutions may apply for taking SAIARD's franchise by sending a formal application mail at _EMAIL_ mentioning their required course details from SAIARD.
- Individuals or institutions has to show their own building (either purchased or rented), 3 to 4 number of classrooms with mini 20 seat capacity, infrastructures, labs with computers and licence software's (in case of technical courses like RS-GIS etc.), faculty rooms, library space, drinking water, electricity & separate toilet facilities at their premises.
- Applicants may apply for SAIARD's franchise to run its courses, but their franchise will completely depend on the decisions of the authority SAIARD.
- The applicants have to produce their valid documents at the time of their application.
- After selection the applicant has to deposit 50000/- (Twenty five thousand) at a time as an application fee which is completely non-refundable.
- Selected parties will be bound to follow/maintain the rules and regulations /work under the guidance and decisions of SAIARD.
- The franchise institution will get a UNIQUE ID CODE on the basis of which their centre will get recognised.They have to display a sign
- board mentioning the full name of SAIARD (in case of individual) or have to mention the line i.e. "Franchised by South Asian Institute for Advanced Research and Development (SAIARD)" (in case of any institution) under the name of their institution at sign board or advertisement. Along that they have to use our logo in their signboard and advertisement also.
- In case of admission and examination system, the decision of SAIARD is final and SAIARD will control the total admission and examination system.
- The franchise institution has to send a monthly progress report to the SAIARD.
- The franchise institution will not be able to take any others franchise.
- The validity of this franchise is one (1) year. After verifying its satisfactory completion their validity can be renewed for the next two (2) years and to renew this validity they have to apply at least two months before to the authority of SAIARD and for each renewal Rs. 40000/- (Forty thousand) will be charged from the franchise This amount may be changed as per the decision of SAIARD body.
- The whole admission fee will be deposited in the SAIARD's bank account and after 30% deductions SAIARD will transfer the rest amount i.e. 70% of the total revenue directly in the franchise's bank account.
- Selected parties will not be entertained or entitled to manipulate/discrete/changes the course modules without the prior permission/intimation of SAIARD.
- In case of the number of seats of the enrolled candidates, the decision of SAIARD is final. That is SAIARD will decide the number of seats per courses of the franchised institution on the basis of the availability of infrastructure of the concerned institution.
- Like course modules and the number of seats, the institutions have to follow the course fee structure of SAIARD. In simple they have to charge the same course fee which will be decided by SAIARD and they will not be entitled to make changes any of our course fees structure.
- The franchise institution has to maintain their proper quality and dignity in case of conducting SAIARD courses. In that case, SAIARD will take monthly feedback report from the students of the concerned academic centres. In any case, SAIARD will not entertained or compromise on maintaining/ providing poor quality of services.
- The franchise institution has to recruit quality teachers for their centres and their interview will be taken by the presence of SAIARD's authority. Besides that the franchise institution has to bear the salary of those faculties and other officials.
- The franchise institution will not be entitled to sell/share the ideas/decisions/confidential matters of SAIARD. Even they will not be able to give SAIARD's franchise to any other institutions.
- Team SAIARD can visit to the franchise institution at any time without giving any prior notice to them. Even SAIARD has all right to take feedback from the students regarding the quality of services provided by the franchise institution.
- If any kind of malpractices can be seen in case of syllabus modification/manipulation, number of enrolment, course fees, maintaining poor standards/quality of teaching or violating the rules and regulations of SAIARD by the franchise institution, their franchise will be cancelled and legal actions will be taken against them.


text:
The up-sizing technology of supercritical CO2 extraction of grape seed oil was studied in this paper. The optimizing technical parameters are: extracting pressure at 25 MPa,extracting temperature at 45℃,CO2 flow rate at 40 kg/h. the extraction yield is 8.92%,which is less than the result of lab.
The factors of time, temperature which influence saponification were simply studied. The optimum conditions for saponification: 1h, 60℃. Under these conditions, a fatty acid yield of 93.2% was obtained, and the product contained 5.72% EPA, 10.55% DHA and 4.83% DPA.
Under the optimum reaction conditions(SnCl4·5H2O/C(loaded amount 20%) 0.1 g),ethyl acetoacetate 5 mL,ethylene glycol 6 mL,microwave power 600 W,microwave irradiation time 2.5 min,the yield of ketal was 81.6%.
The results show that microencapsulate yield(MEY) and microencapsulate efficiency (MEE) reach above 98% and 85% respectively at optimum condition as followed: w(SPI) ∶w(MD) is 1 ∶4,mass fraction of corn syrup in emulsion and all shell-materials in emulsion is 38.5% and 16.7% respectively,conjugated linoleic acid in the microencapsulation product is about 16%;
The concentration, production intensity and yield to glucose of pyruvic acid reached 80.51g/L, 1.83g/L·h and 0.69g/g in 7L-jar fermentation, which were 44.36%, 57.48% and 22.78% higher than the control results respectively. The numbers has reached to or even surpassed the best international results ever reported using the similar strains.
Synthesis of isoamyl laurate from lauric acid and isoamyl alcohol with nanometer H3PW12O40 / SiO2 as catalyst is studied, the results showed that nanometer H3PW12O40/ SiO2 was a good catalyst for synthesizing isoamyl laurate, the oplimal conditions were found as follows: molar ratio of lauric acid to isoamyl alcohol was 1∶5, the weight of catalyst was 5%, the reaction time was 2h, yield was about 99.1%.
The optimum conditions were φ(ethanol)=50% ethanol solution as extractant,ratio of materials 1∶13,extraction temperature 70 ℃ and extraction time 4.0 h. The extraction yield of resveratrol could reach 0.34%.
The yield of borneol and isoborneol was 52.93%,and selectivity for borneol was 60.46%at the conditions of programmed temperatures,reaction time 315 min,saponification time 1h,mass part of catalyst 5%,and terpineol:chloroacetic acid 100∶25(mass ratio).
We also prove that some unimodular wavelets yield unconditional bases in Lp(?).
The same technique of proof is also applied to yield an existence result for A-dilation MRA subspace wavelets.
In most applications, it is this overcompleteness that is exploited to yield a decomposition that is more stable, more robust, or more compact than is possible using nonredundant systems.
This article shows that those abstract results yield an array of new implications for irregular Gabor frames.
The base-catalyzed condensation of thioureas (1-3a-i) with acetone was carried out in the presence of bromine to afford the corresponding 1-(isomeric methyl) benzoyl-3-aryl-4-methyl-imidazole-2-thiones (4-6a-i) in good yield.


What are the moral lessons in "A Poison Tree" by William Blake?
Expert Answers
An illustration of the letter 'A' in a speech bubbles
This poem operates at the intersection of ethics and emotion. You can't discuss the moral lessons of the poem without discussing what emotions are found in it.
In the first stanza, the narrator describes two instances in which he's angry. In the first, he's angry with a friend and expresses that anger, and it passes. In the second, he's angry with an enemy, and he does not express it. The anger doesn't pass, but instead increases. This is a lesson about emotion, but it spills into morality: how you handle your relationships and emotions determines what you feel later. More simply, when you communicate about your anger, you can let it go.
The later stanzas describe the narrator tending his anger like a garden (or at least a poison tree in a garden). As he tends his anger, feeding it with fear, it grows. It appears to be a healthy fruit, but it isn't. This has more lessons on emotion: fear and anger are linked.
In the final stanza, the enemy eats the poison fruit and dies. The emotional lesson here is clear: anger is deadly. Taken together, lessons can be drawn.
Be careful how you treat your anger.
Anger can appear attractive on the surface.
Anger is ultimately deadly.
The explicitly moral lesson is "don't feed your anger."
Approved by eNotes Editorial Team
An illustration of the letter 'A' in a speech bubbles
William Blake intends, in A Poison Tree, to warn his readers that if they ignore his message regarding the "deceitful wiles" that cause hatred to intensify due to a lack of communication, they too can end up "outstretch'd beneath the tree" or be a person destroyed by his own "wrath." In the poem, the narrator's "foe" becomes less afraid of the narrator, and does not realize the depth of his hatred as the narrator "sunned it with smiles" misleading the enemy. The deceit becomes so intense that it bears "an apple bright." Most readers would be familiar with any story of the core or center of an apple being bad, as it appears in The Creation, when Eve first eats from the apple and then deceives Adamthe figurative "poison" being how they lost their innocence and Eve effectively poisoned Adam's mind and also in Snow White, the wicked queen deceives Snow White, also an innocent young girl literally poisoned.
The moral lessons in A Poison Tree include the need to be cautious of the motives of others and the ability of others to manipulate the innocent. Furthermore, the reader should recognize evil within himself before it becomes destructive and he is "glad" to see his enemy dead, even though he lured him to his death. The reader should ensure open communication and should not nurture hatred or "wrath" or it will "grow."
Approved by eNotes Editorial Team
We'll help your grades soar
 - 30,000+ book summaries
 - 20% study tools discount
 - Ad-free content
 - PDF downloads
 - 300,000+ answers
 - 5-star customer support
Start your 48-Hour Free Trial