text
stringlengths 1
3.78M
| meta
dict |
|---|---|
Francois Truffaut’s The 400 Blows is being revived as part of San Francisco Film Society’s second annual French Cinema Now festival, which runs the week of October 29 through November 4 at the city’s Clay Theatre.
City of Borders, the debut film by Bay Area filmmaker Yun Suh, follows several Palestinian characters seeking refuge at a gay bar. The film testifies to the intolerance that members of the LGBTQ community face in addition to all of the other walls, physical and social, separating people in the region.
Now past its third-decade anniversary, SFILGBTFF — the producing organization keeps trying to change its public-recognition name to something more manageable, which this annum would be Frameline31 — now has filmmakers and distributors banging on its door.
|
{
"pile_set_name": "Pile-CC"
}
|
1. British Archaeology and the Bell Beaker
British archaeologists have long been aware of a late prehistoric artifact culture found across the British Isles, and across large areas of Western Europe. It bridged the Late Neolithic and Early Bronze Age periods around 4,400 to 3,800 years ago. It was characterised by the use of fine bell-shaped beaker pots, usually red ceramic fabric, heavily decorated with simple motifs. These motifs were characteristically impressed with a fine toothed comb or dentated spatula. Many Bell beaker burial rituals have been excavated and studied. The inhumed body would usually be crouched on the side, roughly on a north to south alignment. A bell beaker would often be stood near to the body, at the feet, or near the head. Other grave goods often included barbed and tanged flint arrowheads, flint flakes and blades, antler picks, sometimes one or two more beakers, amber beads, copper awls, and gold earrings / hair rings. 64% of British Beaker burials were flat graves, but sometimes a barrow or cist would be erected above it (Beaker Pottery of Great Britain & Ireland. DL Clarke. CUP 1970).
Above, a flint barbed & tanged arrowhead of the Beaker Culture, that I found and recorded during a surface collection survey some years ago.
Archaeologists studying the artifact culture in Britain, compared the British finds to those on the Continent in order to try to find an origin for these people. They suggested either Brittany in North West France, or the Lower Rhine Valley, in the Netherlands and Northern Germany. Some alternatively promoted Iberia as the origin.
Then British Archaeology entered an intellectual phase where it became fashionable to dismiss migration or invasions of people, in favour of cultural exchange. Pots not People. Rather like today, we British wear denim, t-shirts, listen to R&B, and drink coke. However, we have not been displaced by North Americans - we just absorbed the artifacts of another culture. From the 1970s on, many late prehistoric migrations were dismissed by British archaeologists as cultural exchanges rather than representing population displacement.
2. The New Population Genetics and the Steppe Pastoralists.
A new field of study has been gathering pace with the arrival of the 21st Century, that uses genetic evidence, to explore past migrations, movements, admixtures, and origins of peoples. The earliest pioneers used blood types, then mitochondrial DNA mutations, followed by STR of Y-DNA. Some of the early conclusions supported the new orthodoxy of British Archaeology. Stephen Oppenheimer's infamous publication "The Origins of the British" championed that there had been little change in British populations since the Ice Age. They were to be proven wrong. Early conclusions, based on little evidence, misunderstandings that were later corrected with more data, seriously damaged the reputation of population genetics in British prehistoric studies.
The most common Y-DNA haplogroup of Western Europe, particularly of Ireland and Britain was R1b. Early mistakes gave this male haplogroup an Ice Age origin of the Basque Region in Southwest Europe. As more data gathered, and debate developed, it became apparent that the origin was not the Basque region, but the Pontic and Caspian Steppes of Eurasia! It became associated with an archaeological culture in Southern Russia called the Yamna. The R1b and R1a haplogroups appeared to have spilled off the Steppes into Europe during the Copper Age during a significant migration event around 4,900 - 4,600 years ago. In Eastern and Central Europe, this migration of pastoralists appears to be responsible for the fused artifact culture known as the Corded Ware (again, after a prehistoric pottery style).
A few lectures on Youtube to watch:
Havard lecture by David Reich 2015.
CARTA lecture by Johannes Krause 2016
That brings us up to date. In summary, population geneticists have discovered a movement of people, not just pots, from the Steppes into Europe. Modern Europeans descend from an admixture of three major founder populations: 1) the Western Eurasian hunter-gatherers, then a layer of 2) Early Neolithic farmers (that originated in Anatolia and the Middle East), and finally, 3) the Steppe Pastoralists. The actual mix varies not only from person to person, but also regionally across Europe.
So how does the Bell Beaker Culture of Britain and Western Europe fit into all of this? The strong assumption over the past couple of years was that the diffusion of R1b Y-DNA haplogroups occurred then, so therefore, it was a simple extension of this westward drift across Europe that originated on the Pontic and Caspian Steppes. It first spawned the Corded Ware Culture in Central Europe, but then when it met Western Europe, spawned the Bell Beaker Culture. However, until now, this hypothesis hadn't been tested.
The Beaker phenomenon and genetic transformation of Northwest Europe 2017
Has now examined some of these questions, through the examination of an unprecedented scale of ancient DNA sampling. The link to their published document (which is still awaiting peer review) is at the top of this post, and I'd invite others to read it for themselves. An article covering the document can also be read on the Scientific American. However, I personally with my layman head take five suggestions from the study.
They found that the DNA of human remains on Continental Europe did not suggest one cohesive or homogeneous population. There was in this case, evidence of cultural diffusion. Different peoples were taking on the Bell Beaker artifact assemblage in Western Europe. Pots rather more than people. This was a great surprise, as we still know from the earlier study, that much of our DNA and Y-DNA in particular, originated around 400 years earlier from the Eurasian Steppes. However, although the Central European Corded Ware Culture does still appear to have been a response to that great influx of new people from the Steppes, the picture with the Western European Bell Beaker is more complex.
An exception was Britain. Here, the remains associated with Bell Beaker Culture were all one population, and they were very different to the earlier Neolithic population of Britain. It appears to have been a case of population displacement. They suggest at least 90% displacement! It means that very few or none of our Neolithic ancestors built the amazing monuments of Neolithic Britain. They were built by earlier peoples, that our ancestors displaced.
They confirm a Lower Rhine origin as most likely for the British Beaker People. The ancient DNA that most closely matched British Beaker DNA, came from Beaker human remains in the Netherlands and Northern Germany. This correlates nicely with the 1970 archaeological study mentioned above.
It's confirmed. Previous to their entry into the British Isles, there is no evidence of any Steppe ancestry, no Steppe autosomal DNA, no Steppe Y haplogroups such as R1b-L21 here. (Nor any mtDNA haplogroup H6a1). The Beaker people from the Lower Rhine, brought the initial layers of this DNA to Britain. The founder population were admixed, but with significant percentages of Steppe ancestry, particularly on Y lines.
The previous Neolithic Farmer population were mainly Y haplogroup I2, and appear to have descended mainly from populations in the South, from Iberia, rather than from the Danube, although before that from Anatolia. The modern population that is closest to them today are Sardinians.
Also as a layman, I guess that this suggests that most, or even any "Neolithic Farmer" DNA suggested by our ancient ancestry calculators, was most likely picked up elsewhere than Britain, and brought here by later migrants (descended through that mixture of cultural diffusion and admixture), rather than directly from the British Neolithic population.
I also notice a correlation with an Irish study last year ("Neolithic and Bronze Age migration to Ireland and
establishment of the insular Atlantic genome" Cassidy etal. Queens University Belfast 2016), that again, suggested major displacement of earlier peoples in Ireland, at the end of the Neolithic, by a population with largely Steppes origins.
Tags
Today... I managed my first visit to the Flag Fen "archaeology park", for maybe nine or ten years. This park was inspired by a number of finds here, lead by Francis Pryor. Pryor and his team excavated prior to cable and pipework laying for a new gas fired power station at Peterborough. They found a large number of well preserved (in the moist peat soils) felled and cut timbers, that using dendrochronological methods, they dated to between 1400 BC and 900 BC, during the mid to late British Bronze Age.
They created this wetland, or recreated it, in order to conserve and preserve the archaeology that the excavation revealed. To keep it wet. The Fens are an area of Wetlands that have been increasingly drained over the centuries. The concern is that timber archaeology like that found on this site, is quickly perishing now.
These shears were found with their preserved wooden case here. Flag Fen was a timber palisade, that crossed a flooded area, with a wooden platform in the middle of the new lake. This platform was surrounded with lots of deposits, many in bronze - swords, axes, blades, etc. Many of these tools had been snapped or damaged. The excavator suggested that this was ritual. Removing sacrifices from the world, to that mirror world below the water. It revokes the Arthurian tale of the Lady and the Sword.
Yamna theorists should love this one. As far as I know, the earliest dated actual wheel found in the British Isles. Okay, we know they were around longer - but this wooden wheel dates to 3,000 years ago.
A reconstructed, and aged ... Bronze Age British roundhouse. I'm not sure though if roundhouses have been dated to the Bronze Age. Certainly a feature of the Iron Age - the roundhouse was strong enough to resist British weather. The lower photo shows it in it's wetland Fennish environment.
Some of the preserved (using constant water sprays) timbers of the palisade leading onto the platform. The opposite wall displays an artist's impression of the timbers above water level. Pryor suggested that with rising sea levels threatening the rich pastures, that Bronze Age farmers here constructed this platform in order to make scarifices and to perform rituals, to try to control the flooding, to turn back the rise in water levels, and maybe at the same time, to celebrate that life above water, and life below water - as in life and death, a mirror.
Artists impression.
Some of the artifact finds.
More artifacts, including bronze axe handles.
A reconstructed Bronze Age axe composite.
Anyone that has ever read archaeologist Francis Pryor's reports, will know that he is very keen to relate prehistoric archaeology to farming. Here, a soay lamb rests in the Sun. They keep a flock here as closest-to-period sheep that the Bronze Age farmers most likely bred here.
When I visited this park many years ago, they were busy trying to preserve the timbers of the Sea Henge, excavated on the North Norfolk Coast. Those timbers have successfully been preserved, and are now locally in Kings Lynn Museum:
Photo taken by myself at Kings Lynn in 2008.
Currently though, they are hosting the preserved timbers of a number of finds from another Cambridgeshire wetland excavation - from Must Hill Farm. The above photos were taken during the excavation that recovered a number of log boats dated to the Bronze Age (from 1,500 BC) through to the Iron Age. These log boats were clearly made using bronze axes like those above. A large number of well preserved eel nets were also excavated, suggesting that fishing was important to this Bronze Age community.
I hope that some of you enjoy sharing my photo tour from today, especially those that share ancestors here, but live far away today.
Tags
Image above, last year, holding an artifact from the Neolithic Tomb of the Sea Eagles in Orkney.
Today in this post, I am celebrating my Neolithic heritage. Another ancestral genetics enthusiast pointed out that rather than Anglo-Saxon, for a Brit and North West European, I actually had indications of enhanced Neolithic Farmer ancestry on most ancient DNA calculators (more on that below). I was actually quite pleased to have that pointed out, and this post explains why I love the idea of being a modern Neolithic Man.
I remember being fascinated by the past as quite a young child. On holidays across the British isles, I craved nothing more than visits to castles. At home in Norwich, I'd haunt the local museums. However, a love of the Neolithic took hold during my twenties. First, a fishing and drinking tour of Ireland with my brother, took me to the Newgrange Passage Grave site in the Boyne Valley. Awesome impact. Then several years later, I picked up the broken butt end of a Neolithic polished flint axe head on farmland behind my cottage.
The above photo is an image of another broken Neolithic flint axe head that I recorded during a surface collection survey many years later in Thetford Forest.
This eventually pulled me into a phase of looking for more prehistoric flint, which I later formalised into the Thetford Forest Survey. During that period, in collaboration with the Forestry Commission, Norfolk Archaeology, and Suffolk Archaeology, I recorded thousands of struck flint and ceramic artifacts - many from the Neolithic.
Above image taken at the Castlerigg Stone Circle in Cumbria in 2006.
Any chance that I got, I'd also visit Neolithic sites across the British Isles - and continue to do so, hence last year I had a cycling tour of many late prehistoric sites in Orkney. Absolutely love the Neolithic. Even though an atheist, I have to confess that some of these sites give me a special vibe. I have half-seriously told neo-pagan friends, that If I had to choose some gods, Then maybe they would be those of the Neolithic. Something about the remote sites.
Our New Understanding of the Neolithic of Europe
What I really want to write about here though, is how recent population genetics, over the past ten years, is transforming how we see the Western Eurasian Neolithic. Archaeologists had long pondered, our relationship to the British Neolithic people, and going further back and in turn - their relationship to the earlier Mesolithic hunter-foragers of the British Isles.
What recent research of both ancient and modern DNA has so far revealed is that after the last Ice Age, hunter-foragers moved up to Britain from Southern Europe. Meanwhile, new cultures and economies were developing in the Middle East of SW Asia. Across the Fertile Crescent, that ran up the Levant, East Anatolia, eastwards, then down the fertile valleys of the Tigris and Euphrates river valleys - people started to settle, domesticate wheat, barley, goats, sheep, cattle and pigs. They started to farm for the very first time. This was the Neolithic Revolution. The first fired ceramics - pottery was added to the recipe, along with polished stone tools. Eventually these populations also absorbed the very first metallurgy, literacy, and town building - falling into the southern half of those river valleys in Mesopotamia.
Image above - Standing Stone at Stillaig, Argyll, Scotland.
From the Levant and Anatolia, both along the Mediterranean, and direct across the Balkans by land, Neolithic culture and farming technology spread westwards and northwards across Europe. Population genetics now tells us that this WAS carried by people. It was not just a transfer of culture and artifacts. DNA from South-West Asia was strongly carried across Europe. The Neolithic farmers were a people, with roots in the Near East.
What happened to the old European hunter-foragers? It seems a mixture of displacement and admixture. As the Neolithic Revolution rolled across Europe, it did pick up some hunter-gatherer DNA. However, few of the male haplogroups. By the time that the First Farmers reached the British Isles, they would have had an ancestry mixed between Near East Asian and European hunters. Without a doubt, brides and perhaps slaves were taken along that long route from Anatolia to Britain. This pattern perhaps continued when they reached the Irish and British Isles, and confronted some of the last hunter-gatherer populations of North West Europe.
Image above. Ring of Brodgar, Orkney.
All of this was fine. The British Isles were settled by Neolithic peoples around 4,100 BC. I've seen many of their monuments, studied excavation reports of their archaeological sites, and held many of their flint artifacts. It was a dominant culture here for two thousand years. Religious systems may have come and go. They erected so many monuments here that still survive. Causewayed enclosures, long barrows, cursuses, henges, monoliths, cairns, standing stone circles, timber circles, mounds, Silsbury Hill - and of course, the internationally renown Stone Henge. However, we now realise that they carried much DNA from South West Asia!
They must have thought that they, their beliefs, and their social systems would last until the end of time. We currently think that their populations and farming declined towards the end of their period. There is a little evidence that they may have been subject to plague from Asia. This might have weakened them for the next invasion and displacement.
Image above of Skara Brae, Orkney Neolithic settlement.
Image above of Mottistone Longstone, Isle of Wight.
The arrival of the Sons of the Steppes - the Beaker
I'll write more about these guys in a later post. Around 2,100 BC, a new people and culture turned up in the British Isles. Whereas the Neolithic peoples had largely originated in SW Asia, south of the Caucasus (with some European hunter-gatherer DNA picked up on the way), these new arrivals largely originated to the NORTH of the Caucasus, on the Pontic and Caspian Steppes. Their Steppe ancestors perfected the domestication of the horse, bronze metallurgy, and wheeled wagons. The founder Steppe population has been identified by archaeologists as the Yamnaya. They rolled into Eastern and Central Europe, where their arrival appears to have spawned the Corded Ware Culture. Their descendants in turn appear to have spawned the Bell Beaker Culture in Western Europe. In turn, the Bell Beaker appears to have developed into the Atlantic Seaboard Celtic Culture of fame and fashion.
The Eurasian Steppe male haplogroups absolutely dominate present day Europe. However, again, they appear to have absorbed some women with Neolithic and even earlier Hunter-Gatherer populations into their genome.
The Three Way across Europe
Across modern Europe, we are a mixture of three distinct late prehistoric populations or genetic out-layers - from most recent to oldest:
Yamnaya or Steppe
Neolithic Farmer
Western Eurasian Hunter-Gatherer
The above image is from CARTA lecture. 2016. Johannes Krause of the Max Planck Institute. All Rights Reserved.
As can be seen above, some Neolithic DNA has survived in present day Europe. It is strongest in Southern Europe. Yamnaya ancestry is more of an influence in Northern Europe, although, old Hunter-Gatherer survives strong in the Baltic Republics. The modern population closest to our Neolithic ancestors are the Sardinians. So close, that when Ötzi, a frozen preserved Neolithic body was discovered in the Alps, his DNA was seen as so similar to present day Sardinians, that some incorrectly suggested that he had travelled to the Alps from Sardinia!
My Neolithic Admixture
David Wesolowski's K7 Basal-rich test
Basal-rich
The Basal Eurasians are a hypothetical "ghost" population derived from DNA studies. It is suggested that they splintered from other modern humans 45,000 years ago, presumably outside of Africa, somewhere around the Middle East. They significantly contributed DNA to the Early Neolithic Farmers of the Fertile Crescent and Anatolia, and consequently, on to all of us modern West Eurasians.
David gives the English average as 26.5%. My result is 28.8%
Global 10 Test
The recent Global 10 test, run by my friend Helgenes50 of the Anthrogenica board, resulted in:
55% Baalberge_MN (European Middle Neolithic)
FT-DNA My Ancient Origins
47% Farmer (Neolithic)
My Eurasia K9 ASI Oracle:
27% Early Neolithic Farmer
My Gedrosia K15 Oracle:
25% Early European Farmer
My MDLP K16 Modern Admixture
31% Neolithic (modeled on genomes of first neolithic farmers of Anatolia)
My MDLP Modern K11 Oracle:
Admix Results (sorted):
#
Population
Percent
1
Neolithic
37.33
Image above. Grimes Graves Late Neolithic flint mine complex, Norfolk
My Neolithic ancestry appears to be strong, for a Brit. However - my Neolithic ancestors may not have all - or even at all, have lived in the British Isles. My Neolithic ancestry may have been picked up along the way, across Europe, by ancestors as they travelled across Western Eurasia.
Tags
You might think that following my recent posts, that I've lost all faith in DNA testing for Ancestry. Not at all. I just object when people take the analysis results of autosomal DNA tests for ancestry, as infallible truths. They are clearly not.
So far this year, I have commissioned two 23andMe tests, and three FT-DNA tests, a FullGenomes analysis, and a YFull analysis. I have also used free analysis at WeGene and DNA.land, and have run three raw files on GEDmatch calculators. You'd might also think that I've done enough testing for one year! I thought that as well. Then a new service just entered the market.
Living DNA Ancestry attracted my commission on two particular points. 1) it has an incredible British reference, that promises to break ancestry composition into 30 British regions - in addition to global analysis. If it works, then this is a must for people with significant British ancestry. 2) it uses the latest cutting edge test chip. The latest Illumina chip based on Global Screen Array (GSA). In addition, it uses a European based lab (Denmark), it tests Y-DNA, mtDNA, and autosomes. It tests more SNPs on all three counts, than other current chips used by competitors offering autosomal plus tests. Raw files for the test results will be available for download.
The British Reference
Living DNA will be using a British reference broken down into an incredible 30 regions, across England, Scotland, Wales, Orkney, and Northern Ireland. The reference uses the much heralded POBI (Peopling of the British Isles 2015) data set. This project collected 4,500 blood samples from people that could claim four grandparents in the same area, from across the regions of Britain.
A little about the POBI project below:
The British reference does not include the Republic of Ireland. However, LivingDNA are confident that they have collected a good global reference, and I understand, that they are seeking a similar quality Irish data-set for the future.
In comparison, other providers of DNA tests for ancestry, only reference to Britain, or the British Isles & Ireland, as a single reference point. And as can be seen by my previous posts, with limited success.
They also hope to provide imports for formats of raw file from other test companies in the future. LivingDNA do not themselves currently offer relative matching, or health information. Their service is for now, primarily for ancestry.
The Chip
They will be using a custom version of the latest Illumina chip technology, the Global Screen Array (GSA). It is encoded with:
650,000 autosomal DNA SNPs
20,000 Y-DNA SNPs
4,000 MT-DNA SNPs.
In comparison for example, the 23andMe V4 chip scans for:
577,000 atDNA SNPs
2,329 Y-DNA SNPs
3,100 MT-DNA SNPs.
I hope that LivingDNA will also use up-to-date haplogroup nomenclature and information. 23andMe with their V4 chip still use very dated 2009 nomenclature.
So, let's see if this new service is any improvement to my results, compared with the hit and miss of 23andMe, and Family Tree DNA (FT-DNA). Will they be able to identify and locate my English roots successfully? What will the improved chip make of my haplogroups?
|
{
"pile_set_name": "Pile-CC"
}
|
Q:
jQuery / JSON sort results
I have a ColdFusion method getData() which returns a query object as follows:
CustomerCode ServiceCode SubscriberCode Status UserName
-------------------------------------------------------------
811101 8 gertjan OPEN gertjan@blah.net
811101 8 gertjan CLOSING gertjan@blah.net
811101 2 99652444 CLOSED gertjan@blah.net
811101 2 99655000 OPEN gertjan@blah.net
Note the first two rows - exactly the same except for Status OPEN and CLOSING respectively.
The following function creates a new select option for each row where ServiceCode=8 and Status is either OPEN or CLOSING, which would be the case for both the first two rows.
The data ultimately comes via a web service which is out of my control to change. I need to change the jQuery such that if BOTH an OPEN and CLOSING record exists for the same ServiceCode/SubscriberCode combination, which is the case for the first two rows, then only create an option for the OPEN record.
function getInternetLines(){
var CustomerCode=global_customerCode;
var SessionID=global_sessionID;
var lines=[];
$.getJSON("/system.cfc?method=getData&returnformat=json&queryformat=column",
{"SessionID":SessionID,"CustomerCode":CustomerCode},
function(res,code) {
if(res.ROWCOUNT > 0){
for(var i=0; i<res.ROWCOUNT; i++) {
var ServiceCode = res.DATA.ServiceCode[i];
var SubscriberCode = res.DATA.SubscriberCode[i];
var Status = res.DATA.Status[i];
if(ServiceCode == 8 && (Status == 'OPEN' || Status == 'CLOSING')){
lines.push(SubscriberCode);
$('#selInternet').append(
$('<option></option>').val(SubscriberCode).html(SubscriberCode)
);
}
}
global_internet_lines = lines;
if(lines.length == 0){
$('#divBroadbandUsage').html('No Active Broadband Connections.');
}
}else{
$('#divBroadbandUsage').html('No Active Broadband Connections.');
}
});
}
HTML
<select name="selInternet" id="selInternet" style="width:120px">
</select>
Any assistance greatly appreciated in getting the cleanest approach to this, without multiple loops of the same dataset, for example.
A:
You would need to keep a hash as you read the data, ignoring data if an 'OPEN' was already found. Then loop through the hash items and output the data:
if(res.ROWCOUNT > 0){
var hash = {}; // Hash to store data
for(var i=0; i<res.ROWCOUNT; i++) {
var ServiceCode = res.DATA.ServiceCode[i];
var SubscriberCode = res.DATA.SubscriberCode[i];
var Status = res.DATA.Status[i];
if(ServiceCode == 8 && (Status == 'OPEN' || Status == 'CLOSING')){
if( hash[SubscriberCode] != undefined && hash[SubscriberCode].status == 'OPEN' ) {
// If we already have OPEN, don't load the data
continue;
} else {
// Else override whatever data you have for this SubscriberCode
hash[SubscriberCode] = { status: Status, subscriber: SubscriberCode, service: ServiceCode };
}
}
}
// loop through the hash and output the options
for(var x in hash) {
lines.push(hash[x].subscriber);
$('#selInternet').append(
$('<option></option>').val(hash[x].subscriber).html(hash[x].subscriber)
);
}
global_internet_lines = lines;
if(lines.length == 0){
$('#divBroadbandUsage').html('No Active Broadband Connections.');
}
}
I'm not sure what your cases are, but this covers your description I believe. I realize it is silly to have the hash key stored in the data, but for demonstration, this is how you would retrieve other data. This code stores Status, SubscriberCode, and ServiceCode, but your example only uses SubscribercCode. If this is really the case, it is much simpler:
if(res.ROWCOUNT > 0){
var hash = {}; // Hash to store data
for(var i=0; i<res.ROWCOUNT; i++) {
var ServiceCode = res.DATA.ServiceCode[i];
var SubscriberCode = res.DATA.SubscriberCode[i];
var Status = res.DATA.Status[i];
if(ServiceCode == 8 && (Status == 'OPEN' || Status == 'CLOSING')){
// If we see the subscriber code, add it to our hash
hash[SubscriberCode] = 1;
}
}
// loop through the hash and output the options
for(var sub in hash) {
lines.push(sub);
$('#selInternet').append(
$('<option></option>').val(sub).html(sub)
);
}
global_internet_lines = lines;
if(lines.length == 0){
$('#divBroadbandUsage').html('No Active Broadband Connections.');
}
}
|
{
"pile_set_name": "StackExchange"
}
|
Parathyroid hormone regulates the expression of rat osteoblast and osteosarcoma nuclear matrix proteins.
Parathyroid hormone (PTH) alters osteoblast morphology. How these changes in cell shape modify nuclear structure and ultimately gene expression is not known. Chronic exposure to rat PTH (1-34) [10 nM] attenuated the expression of 200, 190, and 160 kD proteins in the nuclear matrix-intermediate filament subfraction of the rat osteosarcoma cells, ROS 17/2.8 [Bidwell et al. (1994b): Endocrinology 134:1738-1744]. Here, we determined that these same PTH-responsive proteins were expressed in rat metaphyseal osteoblasts. We identified the 200 kD protein as a non-muscle myosin. Although the molecular weights, subcellular distribution, and half-lives of the 190 and 160 kD proteins were similar to topoisomerase II-alpha and -beta, nuclear matrix enzymes that mediate DNA topology, the 190 and 160 kD proteins did not interact with topoisomerase antibodies. Nevertheless, the expression of topoisomerase II-alpha, and NuMA, a component of the nuclear core filaments, was also regulated by PTH in the osteosarcoma cells. The 190 kD protein was selectively expressed in bone cells as it was not observed in OK opossum kidney cells, H4 hepatoma cells, or NIH3T3 cells. PTH attenuated mRNA expression of the PTH receptor in our cell preparations. These results demonstrate that PTH selectively alters the expression of osteoblast membrane, cytoskeletal, and nucleoskeletal proteins. Topoisomerase II-alpha, NuMA, and the 190 and 160 kD proteins may direct the nuclear PTH signalling pathways to the target genes and play a structural role in osteoblast gene expression.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
Hello, welcome to my channel!
In this video
as indicated in the previous
I am going to try
our Formula 1
from NSR
Powered by Black Arrow
which is the one I normally use
in my cars.
The Siux motor.
We will see first
the magnetic attraction
the both motors
We put the NSR
and this is the magnetic attraction
of this motor, the King.
6.40 grams
Now the Sioux of Black Arrow
3.24 grams
Almost half of magnetic attraction
I am going to mount this motor in the car
and to try it
and see the difference there is
with the Black Arrow Ferrari
Good!
I want to show you a little one
peculiarity
from
NSR Formula 1
When you have one, look
they have the reverse transmission
Crown to the other side
and the motor mounted upside down too
Let's go with the test on the track
NSR Formula 1
with Siux motor
by Black Arrow
The same as the Ferrari.
We have made the 20 laps.
Minor motor magnet effect noted
curved, brake
go a little more, little
the car is still going very well
but if it shows
that less effect magnet
Times have been very good
Somewhat older but very good.
Let's see the results.
Fast lap
5.903 seconds
Next
5.905 seconds
And next
5.910 seconds
Let's look at the total time.
1 minute
59 seconds
655 thousandths
At the end
the difference is in 3 or 4 tenths
I think I remember
in 20 laps
this is nothing
I honestly like it better like this
no magnet effect
I must be allergic to the magnet!
I don't like it, I prefer cars
more real
Tell you that
their rear tires are very soft
they grab a lot
Conclusion,
a fantastic car
to take out of the box
and run championships
Very good for single brand racing
Without doing anything
Take them out of the box and run
And enjoy!
I liked it a lot.
I hope you enjoy it as I do.
And that's all
thanks for follow me
and until the next video.
|
{
"pile_set_name": "YoutubeSubtitles"
}
|
Getting the World's Ear
IT'S fall gridlock time at the United Nations. New York's men and women in blue block off streets and unscramble traffic tie-ups. Inside, officials from the 184-member nations take turns at the marble podium reviewing UN successes and failures. The speeches go on until mid-October in this launch of the 49th General Assembly.
Though UN troops are bogged down in conflicts from Somalia to Bosnia, the timing of this year's debate - on the eve of the UN's 50th anniversary in 1995 - adds an air of expectancy to the Assembly session. Any celebration, speakers say, must include reform and renewal.
Most speakers offer reform suggestions. Russian President Boris Yeltsin proposed the five nuclear powers sign a new treaty to reduce the number of atomic weapons. US President Clinton suggested an agreement to reduce the number and spread of land mines.
Though the world focuses most intently on the UN's peacekeeping role, Secretary-General Boutros Boutros-Ghali says in his annual report and recent speeches that the primary mission in the next half-century should be economic and social development. Lack of such progress, he says, is a leading cause of war.
His proposed shift of focus strikes a sympathetic chord. Amara Essy, foreign minister of Cote d'Ivoire and the new Assemby president, says many African nations are liberalizing their economies and moving toward political pluralism, but that all of Africa's current problems have economic roots.
Yet when the bloodshed of war appears on world TV screens, pressure on the UN to do something remains strong. The world body currently operates 16 peacekeeping missions at a cost of $3.3 billion a year. It has faced such trouble recently recruiting troop and equipment offers that top peacekeeping officials held a special press briefing a few days ago to explain why it takes so long to get UN troops in place. ``Political will is the key factor - when it's there, there's a way,'' says UN Undersecretary-General for Peacekeeping Kafi Annan.
That often missing ingredient and the UN's well-publicized lack of muscle has led to a new variety of freelance operations under UN auspices. Russian troops in Georgia, French troops in Rwanda (now departed), and US troops in Haiti are cases in which the Council gave its blessing.
The point is a sensitive one for many UN members. In his speech, Mexico's President Carlos Salinas de Gortari said using force is not valid when world peace is not in danger. Similarly, Celso Luiz Nunes Amorim, foreign minister of Brazil, said new interpretations of the principle of nonintervention contradict the UN charter. The result he said, ``evokes traumas and scars, which are still very vivid in the memory of Latin America.''
In his Sept. 26 speech to the Assembly, US President Clinton insisted that the US has no desire to be ``the world's policeman,'' but that, when US national-security interests are threatened, the US will act alone and use force if it must. He cited the global response to the Rwanda crisis as a remarkable example of the world community joining in a common cause. ``The problem,'' he said, ``is deciding when we must respond and how we shall overcome our reluctance.''
Much of the optimism voiced in the Assemby hall these days is focused more on hope for UN peace efforts than on solid accomplishment. Progress in the Middle East and Northern Ireland and the evolution to a democratic South Africa are the most commonly cited foreign policy successes. Yet only the governmental change in South Africa, a nation long under UN economic sanctions, has any significant link to the UN.
|
{
"pile_set_name": "Pile-CC"
}
|
Tax dollars should not go to buy out flooded homes
William Perlman/ The Star-LedgerFloodwaters rush past the Island Park Bridge in Paterson last year
You have to feel bad for the many New Jersey homeowners whose houses have been damaged or destroyed by flooding in recent years. Yes, we should feel compassion for these folks. But we should not give them any state or federal tax dollars.
As reported by The Star-Ledger on Thursday, thousands of homeowners, mostly in northern and central New Jersey, are applying for the government to purchase their homes, which have been damaged or destroyed by repeated flooding.
The appeals represent a record number of people applying for such state and federal help. The upsurge in applications comes on top of the nearly 400 homeowners who received such government help since 1998.
We feel bad for homeowners struggling with flooding, and compassion is a good thing. But it is wrong – morally and fiscally – to use precious taxpayer dollars to bail out individual homeowners who purchased homes in areas ordinarily subject to flooding.
In the first place, unlike federal aid for once-in-a-lifetime disasters, such a bailout is not in response to an unexpected emergency.
“I just can't deal with this anymore,” a Little Falls resident told the Star-Ledger reporter. The woman’s house, located along the Passaic River, “has been hit repeatedly by major flooding since she moved in 15 years ago,” according to the newspaper report. “I love my house,” the woman added, “but I have to get on with my life.”
I suspect that the reporter included this quote, the first in his front-page story, to give a sense of the woman's dire predicament. But as the woman stated, her home has been hit repeatedly by major flooding for the last decade and a half. The flooding is not an unexpected event, calling for emergency help. No, the flooding is a constant and very predictable event, something she likely knew when she purchased her house.
Next, it is bad policy for the government to spend big bucks to help just a few people.
I did the math. As the article states, the government has spent “tens of millions of dollars” to buy out and bulldoze some 400 homes in the last 14 years. Assuming tens of millions of dollars means between $10 million and $100 million, the government is giving between $25,000 and $250,000 to each homeowner.
That is different than the federal government spending money for a highway or a national park in a particular state. Those projects also cost big dollars, but the money benefits many people. Tens of thousands of dollars is not spent on each of just a few individuals.
What would happen, for example, if homeowners in Denver, Colorado, asked the federal government to rescue homeowners harmed by snowstorms? The need would certainly be there, as snow causes tree limbs to fall onto roofs.
But how would it make sense for the federal government to pay money to help those residents? Snowstorms are a fact of life in the Rocky Mountains. It would not be right to use federal tax dollars to bail out those residents.
The unspoken assumption among the New Jersey homeowners is that everybody does it. Everybody feeds at the federal trough. If we don’t get ours, then we will be putting money into the federal kitty without getting something in return. And after all, New Jersey on average pays more in taxes than it receives in return. (True enough, but mostly because salaries, and thus tax rates, are higher here.)
The typical price of the homes in flood-prone areas was not mentioned, but I suspect that many of the homeowners paid somewhat less for their homes because of where they were located. They got a cheaper house because of the expected danger of flooding. Ordinarily, caveat emptor. But these homeowners took advantage of a better deal – and now they want the government to bail them out.
Perhaps not surprisingly, the Star-Ledger story was written so as to tug on the emotions. One homeowner wanting government help, for example, was quoted as saying her situation was “heartbreaking.”
Meanwhile, the story conveyed a sense that government money is a free pot of gold. Homeowners in trouble need only tell a sad story for readers to exclaim – “How can the government be so heartless as to deny these poor folks some relief? Give them some money!”
Unfortunately, there was no mention that taxpayer money isn’t really free. There was no acknowledgement that taxpayer money comes from other taxpayers coughing up their hard-earned cash.
Not surprisingly, Sen. Frank Lautenberg, who has never met a piece of domestic federal spending he didn’t like, was mentioned favorably in the story. The New Jersey Democrat announced that he was seeking another $21 million in federal assistance to help beleaguered homeowners.
The problem with this approach to the use of federal tax dollars goes beyond just giving money to homeowners beset by flooding. This same kind of story – how the government can provide “free” services to bail out any and every need – is told by compassionate reporters over and over.
In that telling, federal money is free. (Or it would be, if only “the rich” would pay their “fair share.”) All we need to do to loosen the state and federal purse strings is to tell of a human need in a gripping way.
With the federal government in hock up to its eyeballs (and beyond), this attitude of grab for all the cash you can does not bode well for the nation’s fiscal future. Without a change of attitude, there can be little hope for a return to fiscal sanity.
|
{
"pile_set_name": "Pile-CC"
}
|
Q:
how can I self sign a tar ball so that later I can verify it was not altered intentionally
I know of md5 or sha256 hashing it won't work for my case -- see "My needs" section
I am having a tar file which resides on a server and the file is consumed by several clients over the internet. I want to ensure that the tar file is not tampered. Clients are programmed using python and I have control over their source code (which means I can reprogram clients to verify certificate).
My needs:
even if someone hacked into the server he should not be able to attack the client by altering the tar file in the server. so md5, or sha256 hashing won't work(attacker can change it on the server)
My questions are?
I have heard openssl making x.509 certificates but I believe openssl is not fit for this purpose because openssl is for providing security over internet not for code signing. Is my assumption correct ?
If the above assumption was correct then what tool or technology should i use to sign a tar ball?
Is there any built in support for this in python ? (Note : the tar ball is the output of "python setup.py sdist")
A:
You can sign your tar.gz file using python-gnupgp - this uses the gnupgp package so you will need that as well. You may need to send the signature separately from the tar.gz file.
|
{
"pile_set_name": "StackExchange"
}
|
Simon Lyndon
Simon Lyndon (born 18 February 1971 in London) is a British Australian actor and director who grew up in Fremantle, Western Australia. He is a WAAPA graduate.
Career
Lyndon played Jimmy Loughlin in Chopper with Eric Bana, for which he won an AFI award for Best Supporting Actor and a Film Critics Circle of Australia Award for best supporting actor. He received AFI nominations for Best Supporting Actor for Blackrock (as "Ricko") and Best actor in a telefeature or mini-series for his role in My Brother Jack. Other films include Fresh Air, Sample People, The Thin Red Line, From the Outside Caught Inside, Falling into Paradise, The Glenmore Job The Well and Dust off the Wings He has appeared on stage That Eye the Sky, Blackrock, Cloudstreet and Popcorn. His TV appearances include Police Rescue, Heartbreak High, Wildside, Underbelly Canal Road and Spirited 2 [Foxtel]. He has directed Tamarama Rock Surfers production of "Road" featuring among others Bojana Novakovic, Jeremy Cumpston, Zena Cumpston and Angie Milliken and Tamarama Rock Surfers production of " Diary of a Madman" starring Alan Morris.
Simon also appeared in FOX network show Roar in 1997 as a tribe leader named Colm. The lead role of Connor Der Kilte was played by fellow Australian and Blackrock co-star Heath Ledger.
In 2011 he played a younger Jack Thompson in Paper Giants: The Birth of Cleo on ABC 1. He played the miner who died, Larry Knight, in the TV film Beaconsfield about the 2006 mine disaster. Also in 2011 Simon appeared in Spirited in the second series, on Foxtel, playing a ghost known as "The King" or Darren Bonney, who lives in an apartment with a dentist Claudia Karvan who is in love with another ghost resident.
Simon appeared in TV series Puberty Blues as a surfing teacher called Gumby in 2012. In 2013 he was in a four-person play called "Anaconda " by Sarah Doyle, with Tamarama Rock Surfers at Bondi Pavilion.
In June/July 2017 Simon appeared Sunset Strip, a four person play by Suzie Miller, performed by Stables Theatre Company at Griffin Theatre in Darlinghurst.
References
External links
Category:Australian male film actors
Category:People educated at John Curtin College of the Arts
Category:People from Fremantle
Category:1971 births
Category:Living people
Category:Male actors from Western Australia
Category:Edith Cowan University alumni
|
{
"pile_set_name": "Wikipedia (en)"
}
|
1. Field of the Invention
The present invention is generally concerned with fitting ophthalmic lenses into the rings or surrounds that an eyeglass frame comprises for this purpose and it is more particularly but not exclusively directed to the case of corrective ophthalmic lenses.
2. Description of the Prior Art
As is known, unprocessed ophthalmic lenses as supplied to optometrists by the manufacturers have a circular contour at the periphery and, for obvious economic reasons, for a given type of ophthalmic lens optometrists are offered a plurality of unprocessed ophthalmic lenses of different peripheral diameters, the cost of unprocessed ophthalmic lenses being proportional to the diameter.
Thus for each eyeglass frame to be fitted with lenses the optometrist has to determine which of the available unprocessed ophthalmic lenses is the most economical to use, given the particular shape of the rings or surrounds of the eyeglass frame; in other words, he has to determine the lens within the contour of which the contour of the ring or surround will fit most closely.
As it happens, the problem is that more often than not the optometrist does not actually have the corresponding unprocessed ophthalmic lenses available to him, but only cards carrying diagrams of the ophthalmic lenses, and that in the case of corrective ophthalmic lenses he must take into account, conjointly, the physiological characteristics of the patient concerned and the optical characteristics of the corrective ophthalmic lenses.
In practice, the principal factor that the optometrist has to take into account is the horizontal distance between the pupils of the patient concerned, more precisely half the patient's interpupillary distance, for proper alignment of the optical center of the corresponding ophthalmic lens relative to the normal axis of vision of each eye of the patient.
In the case of progressive ophthalmic lenses, that is to say ophthalmic lenses of which the lower part, used for close vision, features progressively varying optical power along one meridian at least, unlike the upper part which is reserved for far vision and is usually of constant refractive power, the optometrist also has to take into account the vertical distance between the horizontal line passing through the pupil of the patient concerned for far vision and the bottom of the ring or surround of the eyeglass frame to be fitted with lenses.
Various instruments and apparatus have already been proposed to facilitate the task of the optometrist in determining the diameter of the unprocessed ophthalmic lenses to fit a particular eyeglass frame.
In one relatively simple formula, as described in the French patent filed Feb. 2, 1970 under application No. 70 03453 and published under number 2.307.340, this is a simple rule which, carrying diagrams of the available unprocessed ophthalmic lenses, may be equipped with a cursor movable along its length on which the eyeglass frame to be fitted with lenses may be placed.
As no support specifically for holding the eyeglass frame is provided, the operation to be undertaken is relatively clumsy and imprecise, and there may result some uncertainty as to the determined diameter.
Also, it is not possible with an instrument like this to take into account the aforementioned vertical distance.
In a more sophisticated formula, as described for example in the European patent application filed June 19, 1980 under the number 80400903.3 and published under the number 0 021 998, the apparatus proposed for determining the diameter of an unprocessed ophthalmic lens to fit a particular eyeglass frame comprises, on a base, a guide on said base adapted to receive a card carrying diagrams of available unprocessed ophthalmic lenses and a support on said base adapted to receive the eyeglass frame to be fitted with lenses.
In this way, and advantageously, the frame may be more firmly held.
In practice, however, this apparatus is relatively complex, expensive and bulky, in particular because the guide adapted to receive a card is mobile relative to the base whereas the support adapted to receive the eyeglass frame to be fitted with lenses is fixed relative to the base and, as these components are spaced from each other, to achieve virtual superposition of the corresponding images it is necessary to employ an optical system with light source and mirror.
Furthermore, using an apparatus like this is also relatively complicated; for example, two separate operations are necessary just to allow for the interpupillary distance, or rather half the interpupillary distance, of the patient concerned.
An object of the present invention is an apparatus for determining the diameter of an unprocessed ophthalmic lens to fit a particular eyeglass frame advantageously free of these disadvantages.
|
{
"pile_set_name": "USPTO Backgrounds"
}
|
/*
**********************************************************************
* Copyright (c) 2004-2006, International Business Machines
* Corporation and others. All Rights Reserved.
**********************************************************************
* Author: Alan Liu
* Created: April 26, 2004
* Since: ICU 3.0
**********************************************************************
*/
#ifndef __CURRENCYUNIT_H__
#define __CURRENCYUNIT_H__
#include "unicode/utypes.h"
#if !UCONFIG_NO_FORMATTING
#include "unicode/measunit.h"
/**
* \file
* \brief C++ API: Currency Unit Information.
*/
U_NAMESPACE_BEGIN
/**
* A unit of currency, such as USD (U.S. dollars) or JPY (Japanese
* yen). This class is a thin wrapper over a UChar string that
* subclasses MeasureUnit, for use with Measure and MeasureFormat.
*
* @author Alan Liu
* @stable ICU 3.0
*/
class U_I18N_API CurrencyUnit: public MeasureUnit {
public:
/**
* Construct an object with the given ISO currency code.
* @param isoCode the 3-letter ISO 4217 currency code; must not be
* NULL and must have length 3
* @param ec input-output error code. If the isoCode is invalid,
* then this will be set to a failing value.
* @stable ICU 3.0
*/
CurrencyUnit(const UChar* isoCode, UErrorCode &ec);
/**
* Copy constructor
* @stable ICU 3.0
*/
CurrencyUnit(const CurrencyUnit& other);
/**
* Assignment operator
* @stable ICU 3.0
*/
CurrencyUnit& operator=(const CurrencyUnit& other);
/**
* Return a polymorphic clone of this object. The result will
* have the same class as returned by getDynamicClassID().
* @stable ICU 3.0
*/
virtual UObject* clone() const;
/**
* Destructor
* @stable ICU 3.0
*/
virtual ~CurrencyUnit();
/**
* Equality operator. Return true if this object is equal
* to the given object.
* @stable ICU 3.0
*/
UBool operator==(const UObject& other) const;
/**
* Returns a unique class ID for this object POLYMORPHICALLY.
* This method implements a simple form of RTTI used by ICU.
* @return The class ID for this object. All objects of a given
* class have the same class ID. Objects of other classes have
* different class IDs.
* @stable ICU 3.0
*/
virtual UClassID getDynamicClassID() const;
/**
* Returns the class ID for this class. This is used to compare to
* the return value of getDynamicClassID().
* @return The class ID for all objects of this class.
* @stable ICU 3.0
*/
static UClassID U_EXPORT2 getStaticClassID();
/**
* Return the ISO currency code of this object.
* @stable ICU 3.0
*/
inline const UChar* getISOCurrency() const;
private:
/**
* The ISO 4217 code of this object.
*/
UChar isoCode[4];
};
inline const UChar* CurrencyUnit::getISOCurrency() const {
return isoCode;
}
U_NAMESPACE_END
#endif // !UCONFIG_NO_FORMATTING
#endif // __CURRENCYUNIT_H__
|
{
"pile_set_name": "Github"
}
|
The Turkish government has been rounding up refugees and transporting them to detention centers where they are abused and mistreated, according to Amnesty International. From there, many are deported back to "warzones" in Iraq and Syria.
In a Wednesday report titled 'Europe's Gatekeeper,' Amnesty alleges that Turkey has been “herding scores – possibly hundreds – of refugees and asylum-seekers onto buses” and transporting them “more than 1,000 kilometers to isolated detention centers where they have been held incommunicado,” the organization said in a press release.
It goes on to cite refugees who claim they were beaten and shackled for days before being sent back to the same countries they had fled.
Read more
“We have documented the arbitrary detention of some of the most vulnerable people on Turkish soil. Pressuring refugees and asylum-seekers to return to countries like Syria and Iraq is not only unconscionable, but it’s also in direct breach of international law,” said Amnesty International’s director for Europe and Central Asia, John Dalhuisen.
According to Amnesty, the mistreatment occurred “in parallel” with Turkish-EU migration talks which resulted in the EU pledging to provide €3 billion (US$3.3 billion) to help improve refugees' conditions in Turkey, in exchange for Turkey strengthening measures to restrict the flow of refugees towards the EU.
However, Amnesty alleges that the EU risks being a "complicit in serious human rights violations” by “engaging Turkey as a gatekeeper for Europe.”
The organization went on to confirm that EU officials in Ankara confirmed that six EU-funded open reception centers outlined in an October draft action plan would actually be detention centers.
“It is shocking that EU money is being used to fund an unlawful detention and return program. The EU must ensure that its funding and migration cooperation with Turkey promotes rather than undermines the rights of refugees and migrants,” Amnesty wrote on Wednesday.
Ankara has slammed the report, saying that less than 1 percent of Syrians face any kind of heightened restrictions, and insisting that all returnees are interviewed by UN staff.
Turkey hosts the world's largest number of refugees, including 2.2 million Syrians.
|
{
"pile_set_name": "OpenWebText2"
}
|
AMD Ryzen 3 3300X CPU Review
The Ryzen 3 3300X lands three years after the first Ryzen hit the world and AMD is still fighting strong.
Our Verdict
Budget gaming just got a new hero. The Ryzen 3 3300X represents incredible value for money and strong performance across the board.
For
Incredible value and performance
PCIe Gen 4 and Zen 2 architecture
Includes Wraith Stealth cooler
Against
Limited overclocking
Awaiting B550 motherboards
AMD has now launched the Zen 2-powered Ryzen 3 3100 and Ryzen 3 3300X, offering the same core and thread counts but for $99 and $120 respectively. These budget chips might have slightly lower clocks than a $350 Core i7 7700K, but are serious gaming CPUs and come with PCIe 4.0 support, for those speedy M.2 PCIe SSDs. Three years is clearly a long time in computing.
Ryzen 3 3100 specifications
Three years ago AMD released its first Ryzen CPUs into the wild. At that time the top gaming processor was the Core i7 7700K. Intel's 4-core, 8-thread CPU was the go to chip for gaming, and at a reasonable $350 found itself at the top of most CPU buying guides. It was fast in games, and that healthy thread count meant it could turn its hand to what some might call more serious tasks too.
In that time we've seen three generations of Ryzen CPUs, and while it's fair to say the first generation had their issues (patchy memory support and lackluster gaming performance), the latest generation has confined those problems to the history books. AMD Ryzen 3000 CPUs are now in a very good place, and a genuine alternative to Intel throughout the stack.
AMD Ryzen 3000 CPU Stack
Processor
Cores/Threads
Base/Turbo clocks
Cache
TDP
Price
Ryzen 9 3950X
16 / 32
3.5 / 4.7GHz
72MB
105W
$749
Ryzen 9 3900X
12 / 24
3.8 / 4.6GHz
70MB
105W
$499
Ryzen 7 3800X
8 / 16
3.9 / 4.5GHz
36MB
105W
$399
Ryzen 7 3700X
8 / 16
3.6 / 4.4GHz
36MB
65W
$329
Ryzen 5 3600X
6 / 12
3.8 / 4.4GHz
35MB
95W
$249
Ryzen 5 3600
6 / 12
3.6 / 4.2GHz
35MB
65W
$199
Ryzen 3 3300X
4 / 8
3.8 / 4.3GHz
18MB
65W
$120
Ryzen 3 3100
4 / 8
3.6 / 3.9GHz
18MB
65W
$99
Intel does still have the slimmest of edges in gaming, and its imminent Comet Lake Core i9 10900K will hold the title as the 'fastest gaming processor', but only by drawing ungodly amounts of power. Elsewhere Intel has another iteration of its 14nm production node, with the rest of the 10th Gen roundup, which will see its own core counts increase and HyperThreading support make a welcome return across the range. The Core i3 10100 in particular is a dead ringer for these new chips from AMD, with four core and eight threads too.
Into this somewhat odd market, AMD has decided to release a budget-focused pair of chips that punch well above the price weight. Both featuring SMT (Simultaneous Multi-Threading), meaning these quad-core chips are capable of handling eight threads at once. They're basically in the same ballpark as that venerable Core i7 7700K, but cost around a third the price. They don't overclock as well, but that seems like a reasonable hit for the cash being asked.
Apart from the Ryzen 3 3100 and 3300X, there's more AMD goodness on the way in the form of the B550 chipset, which should be making its way to an affordable motherboard near you on the 16th June. This is important, because if there is an issue with these CPUs right now, is that in order to get the most from them, you're limited to using an X570 motherboard, which generally start at the $250 mark—double the price of the CPU. You can use an X470 or a B450, but you'll miss out on support for PCIe Gen4 if you do so.
AMD B550 chipset
B450 Chipset
B550 Chipset
X570 Chipset
CPU Graphics Support
x16 PCIe Gen 3
x16 PCIe Gen 4
x16 PCIe Gen 4
CPU Storage Support
PCIe Gen 3
PCIe Gen 4
PCIe Gen 4
CPU USB Ports
USB 3.1 Gen 1
USB 3.2 Gen2
USB 3.2 Gen2
Dual Graphics Support
No
Yes
Yes
General Purpose Lanes
PCIe Gen 2
PCIe Gen 3
PCIe Gen 4
CPU Chipset Uplink
PCIe Gen 3
PCIe Gen 3
PCIe Gen 4
Overclocking Support
Yes
Yes
Yes
There's no indication on the pricing of these B550 motherboards yet, but given B450 motherboards start around the $75 mark, I'm hopeful these will be roughly about the $100-$125 mark. When looking at the value proposition of these chips, that's what I've got in mind, rather than having to drop money on a X570 at the same time.
Both CPUs come with Wraith Stealth Coolers, which are the shortest versions of the Wraith available, and lack the RGB lighting of the top-end coolers, but like all the Wraiths they do the job well. This isn't a cooler designed to handle serious overclocking, but in testing temperatures only reached 66C for the 3300X and only 64C for the 3100 under full load, both of which are absolutely fine. It isn't a noisy cooler either.
One thing that may be of interest to those trying to save cash is Eco Mode, which effectively reduces the TDP (and the performance) of the 3100 and 3300X from 65W down to 45W. Useful if your machine is on all the time or if you simply want to reduce power draw.
Another thing of note is that despite the fact that the Ryzen 3 3100 and 3300X have the same number of cores and threads, they are actually configured very differently. The Ryzen 3 3100 has two active cores per CCX, while the Ryzen 3 3300X has all four cores in one CCX (and the other one is redundant). This gives the 3300X a further advantage over the higher clock speeds as there is less potential core-to-core latency.
The Ryzen 3 3100 and Ryzen 3 3300X have very different core configurations. (Image credit: AMD)
Before we get to the testing, a quick note on our benchmarks: The impact of the coronavirus means that a lot of our usual testing hardware is trapped in the office, and like the rest of us, that office is in lockdown. This primarily impacts the graphics card we use for testing, so instead of turning to a 2080 Ti for the usual barrage of benchmarks, we've instead reached for a trusty GTX 1070. We already have comparable results for for some relevant chips, namely the Core i7 7700K (4-core, 8-threads, $350 at launch) and the Core i5 8400 (6-cores, 6-threads, $182 at launch). Intel's 10th Gen processors are on the way though, so expect more benchmarks when they do finally arrive.
(Image credit: AMD)
Image 1 of 9
(Image credit: Future)
Image 2 of 9
(Image credit: Future)
Image 3 of 9
(Image credit: Future)
Image 4 of 9
(Image credit: Future)
Image 5 of 9
(Image credit: Future)
Image 6 of 9
(Image credit: Future)
Image 7 of 9
(Image credit: Future)
Image 8 of 9
(Image credit: Future)
Image 9 of 9
(Image credit: Future)
Ryzen 3 3300X testbed
The takeaway from these benchmarks is that the Ryzen 3 3300X compares favorably to both the 7700K and the 6-core 8400. It scores much higher in serious tests like Cinebench R15, X264 v5.0 and PCMark, while also maintaining the lead in games. Admittedly the difference there is often slight and in some cases within the margin of error, but importantly it isn't any slower.
The Ryzen 3 3100 puts in an impressive show as well, although the core configuration does seem to affect it adversely in gaming. It's still a good chip, but it doesn't quite have the performance chops of its bigger brother. Given there's only $20 between these two CPUs, the Ryzen 3 3300X is just the better option.
Recent Ryzen 3000 processors haven't wowed with their overclocking prowess, and the same is true here. The fact of the matter is that it doesn't really help performance. Both chips are unlocked, so if you do fancy playing around with the clocks to get the most from them, then it is at least an option.
You can overclock in the BIOS, but the AMD Ryzen Master software makes the whole process a little easier. Precision Boost should be your first port of call as that can improve clocks fairly easily, while Auto can potentially push it even further. Alternatively you can enter the murky waters of manual overclocking.
In testing, this is what I saw from trying these out on the 3300X. It's something that I'll revisit, potentially with a beefier cooler, but right now these chips appear to stick to the general ethos that this generation of Ryzen doesn't overclock very well. Importantly though, they don't really need to.
(Image credit: Future)
So in summary, the Ryzen 3 3300X is an impressive chip. AMD has taken its excellent Zen 2 architecture and given it a new lease of life for the budget-conscious gamer. It's fast, supports PCI Express 4.0, has enough cores and threads for current gaming, and doesn't cost the earth. It does need a B550 motherboard to really make the value proposition make sense, but those board should be here very shortly.
Is the Ryzen 3 3300X the best processor ever? No, of course not, it's a budget CPU that has half as many cores as our top recommendation. But that doesn't stop it being an incredible CPU for gaming, and for the money, there's nothing out there right now that's close. In fact the next best thing would be the six-core, 12-thread Ryzen 5 3600. At least that's the case until the Core i3 10100 drops.
Should you consider building a system around the 3300X? Absolutely. Processor pricing has been creeping up for a while now (as the power has increased to be fair), but these two chips reset that. Paired with a budget motherboard, a cheap but speedy SSD, and affordable memory (the faster the better), and you have a great base to plug your graphics card of choice into. Something like an AMD 5600 XT would make for a solid, yet affordable system.
|
{
"pile_set_name": "Pile-CC"
}
|
Q:
What does "no device" mean when running iostat -En
We presume to have a faulty cable that connects the SAN to a direct I/O LDOM. This is a snippet of the error when running iostat -En
c5t60060E8007C50E000030C50E00001067d0 Soft Errors: 0 Hard Errors: 696633 Transport Errors: 704386
Vendor: HITACHI Product: OPEN-V Revision: 8001 Serial No: 504463
Size: 214.75GB <214748364800 bytes>
Media Error: 0 Device Not Ready: 0 No Device: 6 Recoverable: 0
Illegal Request: 1 Predictive Failure Analysis: 0
What does No Device: 6 mean here?
A:
A search through the Illumos fiber-channel device code for ENODEV shows 13 uses of ENODEV in the source code that originated as OpenSolaris.
Of those instances, I suspect this is the one most likely to cause your "No device" errors:
pd = fctl_hold_remote_port_by_pwwn(port, &pwwn);
if (pd == NULL) {
fcio->fcio_errno = FC_BADDEV;
return (ENODEV);
}
That code is in the fp_fcio_login() function, where the code appears to be trying to login to a remote WWN. It seems appropriate to assume a bad cable could prevent that from happening. Note that fiber-channel error code is FC_BADDEV, which also seems appropriate for a bad cable.
In short, a review of the source code indicates that ENODEV errors are consistent a bad cable.
You can use dTrace to more closely identify the association if necessary. Given that both hard and transport errors occur about 5 or 6 orders of magnitude more frequently, IMO that effort isn't necessary until the ENODEV errors occur after the other errors are addressed and no longer occur.
|
{
"pile_set_name": "StackExchange"
}
|
Q:
Motion verbs and ところ
As I understand it, something like 帰るところだ usually means you are in the process of going home, say on the train. But ところ often has the meaning of "just about to do something."
Does something like 帰るところだ also have this meaning? e.g. Can you say it if you are still in the office and about to leave in a couple minutes?
If so, my main question is I'm wondering if ところ always has this ambiguity (at least from the English perspective) between meaning both "in the process of doing" and "just about to do"? Or is it something special to motion verbs and other verbs that are sometimes called stative verbs?
What I mean by stative is 帰っている does not mean "is in the process of going" it means "went home and is now there." I'm wondering if ところ just seems to have two meanings in English because when you sitting on the train going home you are still "just about to go home" from the perspective of Japanese because 帰る is stative and you haven't completely arrived yet.
Basically I'm wondering if this is correct:
雨が降るところだ = "It is just about to rain." (NEVER "It is in the process of raining.")
雨が降っているところだ = "It is in the process of raining."
帰るところだ = "I'm just about to go home (at the office)." OR "I'm in the process of going home (on the train)."
And I would guess 帰っているところだ sounds strange and doesn't make much sense(?)
A:
When it's するところ, it means "about to do (something)."
したところ means someone has just done something.
しているところ means someone is doing something.
していたところ means someone has been doing something.
Literally, ところ means 'place', but it's also used for a figurative place as this dictionary page defines it as
2 抽象的な場所。
オ ちょうどその所「さっき着いたところだ」
Also this page puts it as
形式名詞
「こと・の・ところ・ほう・わけ・はず・つもり」など、
今テレビを見ているところです。
Now
Does something like 帰るところだ also have this meaning? e.g. Can you say it if you are still in the office and about to leave in a couple minutes?
Yes, you can say that when you are still at the office but about to go home.
And is the reason that 帰るところだ can be interpreted as "in the process of going home" because motion verbs don't complete until you reach the destination?
Theoretically, yes. But if we are just in front of our home, then we probably choose a different expression such as 今もう家の前にいるんだ or もう今家に着くところなんだ.
[replying to additional request from the OP]
雨が降るところだ = "It is just about to rain." (NEVER "It is in the process of raining.")
雨が降るところだ is an unusual thing to say. To mean "It is just about to rain," we likely say 雨が降りそうだ.
雨が降っているところだ = "It is in the process of raining."
This is not bad, however we more likely say 雨が降っている.
帰るところだ = "I'm just about to go home (at the office)." OR "I'm in the process of going home (on the train)."
Yes, these are correct.
And I would guess 帰っているところだ sounds strange and doesn't make much sense(?)
Doesn't sound so bad if you are on the train, but if you are still at the office, it does sound strange.
What I mean by stative is 帰っている does not mean "is in the process of going" it means "went home and is now there."
Right. I am aware that Japanese continuation form ている is actually more of state than progression. I find that is why we need ところ to make it progressive.
I'm wondering if ところ just seems to have two meanings in English
because when you sitting on the train going home you are still "just
about to go home" from the perspective of Japanese because 帰る is
stative and you haven't completely arrived yet.
I think 帰る itself is not necessarily stative. The form ている makes it stative.
|
{
"pile_set_name": "StackExchange"
}
|
Q:
bash shell array output range to csv
Is there an easier way to do the below? I am reading in a large cvs file and want to only display ranges on the index per line and output back into a csv format.
while IFS=$',' read -r -a myArray
do
echo ${myArray[44]},${myArray[45]},${myArray[46]},${myArray[47]},${myArray[48]},${myArray[65]},${myArray[66]},${myArray[67]}
done < $SHEET
A:
You can use the substring operator with array parameter expansion:
while IFS=, read -r -a myArray
do
( IFS=,; echo "${myArray[*]:44:5},${myArray[*]:65:3}" )
done
|
{
"pile_set_name": "StackExchange"
}
|
without replacement from {e: 12, n: 6}?
1/51
Calculate prob of sequence jz when two letters picked without replacement from {b: 1, i: 1, r: 2, z: 1, j: 4}.
1/18
Calculate prob of sequence ai when two letters picked without replacement from iiawdaaauiu.
6/55
Two letters picked without replacement from {g: 5, q: 3}. Give prob of sequence gq.
15/56
Two letters picked without replacement from {l: 1, k: 3}. Give prob of sequence kl.
1/4
Four letters picked without replacement from {l: 5, w: 1, j: 1, k: 1, v: 2}. What is prob of sequence vwlj?
1/504
What is prob of sequence htdc when four letters picked without replacement from chhthtthtjed?
2/1485
Two letters picked without replacement from {t: 11, a: 3}. What is prob of sequence tt?
55/91
Two letters picked without replacement from qlfyvgv. Give prob of sequence vf.
1/21
What is prob of sequence jh when two letters picked without replacement from cggtghthjgtgtgjg?
1/60
Four letters picked without replacement from {o: 7, b: 1, w: 3, z: 3}. Give prob of sequence ozbw.
3/1144
What is prob of sequence ggg when three letters picked without replacement from gffgg?
1/10
Two letters picked without replacement from cggtggggtgtggttggggg. What is prob of sequence cg?
7/190
Four letters picked without replacement from {a: 2, c: 2, k: 6, x: 8}. What is prob of sequence kaxa?
1/765
What is prob of sequence ss when two letters picked without replacement from occcycbcoyossoccy?
1/136
What is prob of sequence ppp when three letters picked without replacement from {f: 1, p: 11}?
3/4
Three letters picked without replacement from {p: 1, s: 2, c: 7}. What is prob of sequence ccs?
7/60
Calculate prob of sequence zz when two letters picked without replacement from {u: 4, z: 4, w: 1, p: 1}.
2/15
Three letters picked without replacement from ucsuisdccc. Give prob of sequence ssu.
1/180
Three letters picked without replacement from {s: 3, t: 1}. What is prob of sequence sts?
1/4
Calculate prob of sequence cxoj when four letters picked without replacement from jocpejx.
1/420
What is prob of sequence mn when two letters picked without replacement from nmnnnnnn?
1/8
Two letters picked without replacement from qqevzyyqzeqv. What is prob of sequence vq?
2/33
Two letters picked without replacement from epereppjefbe. What is prob of sequence jr?
1/132
What is prob of sequence cpcd when four letters picked without replacement from {d: 3, p: 4, c: 4, y: 4}?
2/455
Calculate prob of sequence oofy when four letters picked without replacement from mrorfymffcmyoyfr.
1/1820
Three letters picked without replacement from fffffff. What is prob of sequence fff?
1
What is prob of sequence xsx when three letters picked without replacement from {s: 1, x: 2, m: 2, i: 1}?
1/60
Two letters picked without replacement from ipfii. What is prob of sequence fi?
3/20
Calculate prob of sequence fxzf when four letters picked without replacement from {f: 4, z: 1, x: 2}.
1/35
Three letters picked without replacement from gggnggnggngnggrgn. Give prob of sequence grn.
11/816
What is prob of sequence kkk when three letters picked without replacement from {n: 1, k: 3}?
1/4
Two letters picked without replacement from {s: 5, j: 3, r: 4}. Give prob of sequence rs.
5/33
What is prob of sequence xnxs when four letters picked without replacement from {m: 1, u: 2, s: 7, x: 3, n: 4, y: 1}?
7/3060
Two letters picked without replacement from gmhuhugfmhmhhmmhgguu. Give prob of sequence hm.
3/38
Three letters picked without replacement from nndddnnnnnnnnn. Give prob of sequence ndn.
55/364
Two letters picked without replacement from ggtgtqgtgqgggwcgg. Give prob of sequence qc.
1/136
Three letters picked without replacement from ccccmcmcc. Give prob of sequence ccc.
5/12
Two letters picked without replacement from eheehueheeueeeeueueh. What is prob of sequence ue?
12/95
Calculate prob of sequence hll when three letters picked without replacement from {h: 3, l: 5}.
5/28
Calculate prob of sequence ak when two letters picked without replacement from qqkaazxqkzqaazkz.
1/20
Calculate prob of sequence wmmm when four letters picked without replacement from {w: 1, m: 12}.
1/13
Calculate prob of sequence dt when two letters picked without replacement from tttdddt.
2/7
Two letters picked without replacement from hxhx. What is prob of sequence xx?
1/6
Three letters picked without replacement from {n: 1, b: 1, l: 1, m: 5, j: 2}. What is prob of sequence mnb?
1/144
Calculate prob of sequence vvrm when four letters picked without replacement from zmvmzrvzzvzrrzk.
1/910
Calculate prob of sequence oh when two letters picked without replacement from {o: 1, h: 1, j: 1, c: 1, t: 2, a: 1}.
1/42
Two letters picked without replacement from {g: 5, o: 3, f: 2, y: 1, a: 1, j: 1}. Give prob of sequence ag.
5/156
Three letters picked without replacement from {b: 5, z: 6, f: 1, a: 2, t: 2, n: 1}. Give prob of sequence bfb.
1/204
Three letters picked without replacement from {k: 3, s: 1, j: 1}. What is prob of sequence kjk?
1/10
What is prob of sequence oja when three letters picked without replacement from {o: 1, a: 5, z: 2, s: 1, j: 1}?
1/144
Calculate prob of sequence anx when three letters picked without replacement from aapnpxpyaynyxnnyxyy.
2/323
Calculate prob of sequence xrrx when four letters picked without replacement from {x: 7, r: 3}.
1/20
What is prob of sequence gg when two letters picked without replacement from {g: 2, w: 2}?
1/6
Four letters picked without replacement from kqqqqqqkqkqqqkqk. What is prob of sequence qqqq?
33/182
Calculate prob of sequence vzvz when four letters picked without replacement from jvjzvz.
1/90
Three letters picked without replacement from uuuuu. Give prob of sequence uuu.
1
What is prob of sequence ycct when four letters picked without replacement from ccqtlcllyqctltlycl?
1/612
Calculate prob of sequence aea when three letters picked without replacement from {p: 1, e: 7, a: 2}.
7/360
Four letters picked without replacement from yxsssyyss. What is prob of sequence xsys?
5/252
Three letters picked without replacement from {o: 8, j: 2, f: 5}. What is prob of sequence jjo?
8/1365
Two letters picked without replacement from mmmeeemmmm. What is prob of sequence em?
7/30
Calculate prob of sequence mj when two letters picked without replacement from {m: 2, j: 6, i: 6, l: 1, b: 2}.
3/68
What is prob of sequence osm when three letters picked without replacement from soseme?
1/60
What is prob of sequence zwz when three letters picked without replacement from {z: 9, w: 1, d: 1, i: 3}?
3/91
Two letters picked without replacement from {z: 1, q: 1, a: 14}. What is prob of sequence az?
7/120
What is prob of sequence exfd when four letters picked without replacement from ndexf?
1/120
Three letters picked without replacement from {f: 4, l: 8, k: 1}. What is prob of sequence flk?
8/429
Calculate prob of sequence moym when four letters picked without replacement from {y: 2, m: 5, i: 2, o: 4}.
4/429
Four letters picked without replacement from wwwwwwwwww. Give prob of sequence wwww.
1
Two letters picked without replacement from {f: 1, t: 1, x: 4, h: 3, g: 2}. What is prob of sequence xg?
4/55
Three letters picked without replacement from ztzztzztzztztttttzt. What is prob of sequence ztz?
40/323
Four letters picked without replacement from {d: 2, x: 2, q: 1, s: 6}. Give prob of sequence sqdx.
1/330
Calculate prob of sequence eeq when three letters picked without replacement from {t: 4, q: 3, e: 7}.
3/52
What is prob of sequence bbbg when four letters picked without replacement from gggbbgbbgg?
1/35
Calculate prob of sequence mmp when three letters picked without replacement from mpmpm.
1/5
Two letters picked without replacement from zxxxxzxzxzzx. What is prob of sequence zz?
5/33
Four letters picked without replacement from {i: 1, s: 2, d: 4, e: 1, c: 2}. What is prob of sequence dece?
0
Three letters picked without replacement from {z: 7, q: 2, x: 1}. Give prob of sequence qqz.
7/360
Four letters picked without replacement from iiivqvvvqqvqiqvsiviq. Give prob of sequence viqq.
7/646
What is prob of sequence fi when two letters picked without replacement from iwiwifiwawpwinni?
1/40
Calculate prob of sequence ll when two letters picked without replacement from {l: 11, m: 2}.
5
|
{
"pile_set_name": "DM Mathematics"
}
|
TL;DR — Red4Sec finished, more audits coming, and an update regarding mainnet
Red4Sec, our auditor for the last 7 weeks, has completed their audit and submitted their report to QRL. Red4Sec consists of a talented team that has spent much of the past 2 months poring over our code 8 hours a day, 5 days a week. They were joined in parallel by our own team, also scouring our codebase for vulnerabilities and mishaps, as well as dealing with issues raised by Red4Sec as they came up.
During the analysis, whose report runs over 200 pages, a total of 67 vulnerabilities were detected. Many of these vulnerabilities did not pose any risk by themselves and therefore have been classified as informative.
All vulnerabilities were classified according to the impact level defined by CVSS (Common Vulnerability Scoring System): critical, high, medium, low and informative.
A summary of the issues per project area is described below.
What Red4Sec covered
Red4Sec’s report was exhaustive, and covered the entirety of our project space, with the exception of our Post Quantum Cryptography, which will be covered by a further audit as it’s more specialized in nature. Below is a rundown of issues raised by Red4Sec by section of our network, as well as impact level.
Blockchain
QRL (Python)
Critical : 6 issues identified — All fixed by end of audit
High : 3 issues identified — All fixed by end of audit
Medium : 4 issues identified — 2 fixed by end of audit, outstanding fixes have now been applied (everything is fixed)
Low/Informative : 21 issues or queries which have all been reviewed by the team, with changes made to the codebase where necessary.
: 6 issues identified — All fixed by end of audit : 3 issues identified — All fixed by end of audit : 4 issues identified — 2 fixed by end of audit, outstanding fixes have now been applied (everything is fixed) : 21 issues or queries which have all been reviewed by the team, with changes made to the codebase where necessary. Qryptonight (C++)
Critical : 1 issue identified — fixed by end of audit
: 1 issue identified — fixed by end of audit Qrllib (C++)
Informative: 1 issue which was closed by the end of the audit.
Public facing Infrastructure
QRL Wallet (JS)
Critical : 1 issue identified — fixed by end of audit
High : 1 issue identified as informative by Red4Sec — the team rated it as High, however, and it was fixed by the end of the audit
: 1 issue identified — fixed by end of audit : 1 issue identified as informative by Red4Sec — the team rated it as High, however, and it was fixed by the end of the audit Block Explorer (JS)
Low/Informative : 1 Low and 1 Informative level issue which were both closed by the end of the audit.
: 1 Low and 1 Informative level issue which were both closed by the end of the audit. theqrl.org (JS)
Medium: 1 issue identified — fixed by the end of audit
Backend & Team processes
Infrastructure includes nodes, cloud services, mail services and any other service that QRL relies upon for development and other team processes.
Medium: 5 issues identified — all fixed by end of audit.
Low/Informative: 11 issues have been identified and all have been fixed.
Some words from Red4Sec:
In general terms, it has been detected that the design and logic of the project is well defined. The project code follows a methodology of safe programming and good practices. The project has great support from the team as some of the vulnerabilities have been resolved at the time they were detected by Red4Sec, mitigating the possible impact and repercussion that could cause to the project.
The whole QRL team thanks Red4Sec for their professionalism and attention to detail in improving the quality of our ecosystem.
More audits
As our codebase and ecosystem grows, it is important to continually appraise the security of our implementations.
We are, therefore, pleased to announce that we have signed an agreement with X41 D-Sec GmbH to undertake a secondary security audit in the coming months. This audit will be differently focused than the Red4Sec audit, leveraging some of the specific expertise at X41 such as covering the Post Quantum Cryptography portion of QRL.
Mainnet Progress Update
It has been a long ride to reach our main network, and our launch is just the beginning of the overall QRL journey.
A date for the launch of the QRL main network has been finalized and will be announced in the coming days.
|
{
"pile_set_name": "OpenWebText2"
}
|
Other Titles by Clive Cussler
Description
Information
Titles in Series
2 CDs.
The past and future collide for Dirk Pitt when he faces his most perilous assignment yet, in 'Valhalla Rising'.
It is July 2003 and the luxury cruise ship "Emerald Dolphin" is on her maiden voyage when she suddenly catches fire and sinks. NUMA special projects director Dirk Pitt races to rescue passengers and investigate this shocking disaster; but he has no idea of the bizarre chain of events - both real and mythical - that are about to engulf him. At the end of it all, though many lives will be lost and many saved, it is Pitt's own life that will be changed forever . . .
Full of dazzling suspense and breathtaking action, 'Valhalla Rising' is Clive Cussler at the height of his storytelling powers.
RRP refers to the Recommended Retail Price as set out by the original publisher at time of release.
The RRP set by overseas publishers may vary to those set by local publishers due to exchange rates and
shipping costs. Due to our competitive pricing, we may have not sold all products at their original RRP.
|
{
"pile_set_name": "Pile-CC"
}
|
Let's chalk up some rules before iPads enter every classroom
Jul 17, 2014 by Natalia Kucirkova, The Conversation
Adults and youngsters are willing to queue overnight to get their hands on the latest product release from Apple and children appear to be drawn to iPads because of the immediate feedback they get when they use them.
But as excited as many of us are about how these devices can be used in the classroom, they're still a long way from revolutionising public education.
Tablets certainly have some distinct advantages: they are portable (unlike whiteboards), light-weight (unlike netbooks and laptops), compact and touch-screen (unlike desktop computers) and they offer, so far, the widest range of apps designed for educational purposes.
This software and hardware combo makes them attractive but what really makes teachers excited is the potential to make each lesson tailored towards each individual child's needs. Such personalised learning has been heralded as one of the 21st century's great learning innovations.
However, in all this enthusiasm, we should not gloss over the day-to-day reality. Even in affluent Western countries, iPads are still outside of the budgets of most schools.
In schools where they are used, iPads are a great motivational tool but also harm concentration, as one study of 6,000 pupils in Canada found. Even the students themselves – more than 99% of them – reported they found the tablet a distraction. As for teachers, just one out of the 302 surveyed didn't mention distraction as a "major challenge".
Other schools have found iPads are incompatible with their existing technologies and that security issues have negatively affected their use.
Despite the novel features of iPads, we seem to have forgotten some lessons learnt with previous technologies. Research by Nesta in 2012 found relatively little evidence that technology in schools actually works, considering the money invested. Therefore, to get the best out of iPads we need to think seriously about exactly how they are used as learning tools, and train teachers in the best techniques.
Security lockers and internet firewalls alone won't be good enough to minimise distractions and motivate kids to use their new toys for learning. This is the new technological "playground", and it needs some ground rules. The more we can involve children in making these rules, the easier it will be to uphold them.
Technology and the science of education work together so if we want to see a change, we need to continue develop both. That means not just adding attractive tools like iPads but also devising well-informed guidance for their effective use and integration with the curricular objectives.
Playground rules
We already know a few things that will be needed to make the rules on iPads work well. Some carefully designed studies which look at the intersection of specific technology features with pedagogical principles would be a good start. So that we can reliably say what works, we also need randomised controlled trials and design-based research to allow us to separate assumptions from evidence.
We need more examples of schools where tech solutions have worked. Some steps in this direction have been undertaken, with companies like Airwatch enabling teachers to tailor and customise their lessons using an innovative suite of teacher tools.
And although it has been said before, it bears repeating: we all need to work together. More and more government-funded schemes are trying to encourage collaboration between developers and researchers but these efforts need to be extended to include input from designers, researchers, teachers and parents. All these people are bound by a shared commitment to children and they need to be formally supported to work towards the same goal.
Finally, we need more innovative projects where children are involved in the coding process of the programs they use and where teachers co-design the apps they deploy in classrooms. In other words, we need active participation of all involved, especially children. Because ultimately such joint action will speak louder than words.
We are unlikely to see a revolution, but we can sow some seeds for change if we foster creative thinking and cooperation between all those who care about children and their education.
Kindergarten classes are supplementing crayons, finger paints and flashcards with iPads, a development that excites supporters but that detractors worry is wasted on pupils too young to appreciate the expense.
Michael Gove is ploughing ahead with plans to gather an elite team of computer science experts to help bring coding into schools. He has rightly acknowledged that teaching programming in schools is vital if w ...
Just as students receive report cards at the end of each school year, so too does the United States – and the country's most recent report card paints a bleak picture of the current state of reading instruction. According ...
Recommended for you
Why does time seem to crawl if you're waiting in line at the post office, but hours can fly by in minutes when you're doing something fun? A new study in the Journal of Consumer Research examines the factors that determine how co ...
Why do some consumers make choices based on their feelings instead of rational assessments? According to a new study in the Journal of Consumer Research, consumers who consider themselves independent are more inclined to rel ...
Why is it so hard for consumers to save money? According to a new study in the Journal of Consumer Research, consumers are often impatient and do not think about the long-term consequences of spending money. ...
How do consumers react to products with diverse online reviews? According to a new study in the Journal of Consumer Research, a mix of positive and negative reviews can benefit products that are evaluated based on person ...
If you're traveling at 60 miles per hour, just a few milliseconds can mean the difference between life and death when you need to come to a quick stop. According to a new study in the Journal of Consumer Research, driver ...
|
{
"pile_set_name": "Pile-CC"
}
|
The U.S. military shut down a troll operation orchestrated by the Kremlin-supported Internet Research Agency's networks during the 2018 midterms in an effort to curb election interference, according to officials interviewed by the Washington Post.
The big picture: The Internet Research Agency was one of three entities indicted by Robert Mueller for conspiring to interfere in the 2016 election. This action, described as a success by Pentagon officials, is the first of its kind by U.S. Cyber Command, which was granted more authority by the Trump administration last year. The U.S. blocked networks in order to prevent potential disinformation campaigns and election interference.
Go deeper: Senate-commissioned reports show scale of Russian misinformation campaign
|
{
"pile_set_name": "OpenWebText2"
}
|
[Mechanism of synergism of the sympathetic and parasympathetic nervous system in regulating cardiac and gastric activity].
The authors studied the mechanism of the higher vagus suppression of cardiac performance, which occurs when irritation of the sympathetic nerve is added to that of the vagus and when gastric motility occurring with the irritation of the sympathetic trunk is stimulated. Preganglionic serotonic fibers synaptically connected with serotoninergic intramural neurons are involved in showing these mechanisms.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
Neotonic Software
Neotonic Software was a San Francisco based company that produced technology for email customer support, founded by David Jeske and Brandon Long in 2001. Google acquired the company in April 2003, bringing its Trakken CRM product in-house where it was still in use as recently as March 2009.
The company also developed the ClearSilver web templating language and the Archive email web archive. ClearSilver is Open Source and is used by several Google products and other projects such as Trac. The ideas behind Archive formed the basis for Google Groups.
Prior to Neotonic Software, David Jeske and Brandon Long worked together at eGroups and at Yahoo on Yahoo! Groups. Both also attended the University of Illinois.
Notes
Category:Defunct software companies
Category:Google acquisitions
Category:Companies established in 2001
|
{
"pile_set_name": "Wikipedia (en)"
}
|
How We Do It
Donations are organized in the States, sent to Kuwait with coordination with the US Armed Forces, and then distributed by Army personnel across the Gulf Region. We are working to leverage valuable relationships in Iraq and the surrounding areas to identify areas of need for our equipment drops.
To donate, please contact donate@iraqisoccerproject.org for a nearby collection point.
For more information regarding how to contribute, please visit iraqisoccerproject.org or email info@iraqisoccerproject.org.
|
{
"pile_set_name": "Pile-CC"
}
|
There are, of course, many reasons why the physical characteristics of a particular volume of air might be of interest. For instance, knowing the temperature, humidity and air flow parameters of a volume of air can be very helpful in determining the effect the air may have on a specific environment. Aside from weather observations, where massive volumes of air must be considered important, there are also many instances when rather small volumes of air need to be analyzed. Specifically, consider air conditioning systems.
Most air conditioning systems rely on the circulation of air through a cycle wherein air from the particular environment to be controlled is passed through equipment that cools the air and returns it to the environment. Whether the particular air conditioning equipment is efficient for accomplishing this task is a matter of some concern. For instance, power efficiency is of interest, as well as is the ability of the equipment to comply with its control inputs.
In the past, in order to determine whether air conditioning equipment was efficient for its intended purposes it was typically necessary to compare the equipment's actual operating characteristics with the operational specifications that are established for the equipment by the manufacturer. Often times, this required invasive measurements of the system coolant. More recently, it has been recognized that the efficiency of an air conditioning system can be noninvasively determined by merely analyzing characteristics of the air that passes through the equipment. For example in U.S. application Ser. No. 08/914,475 which was filed on Aug. 19, 1997 for an invention entitled "DIAGNOSTIC UNIT FOR AN AIR CONDITIONING SYSTEM", and which is assigned to the same assignee as the present invention, noninvasive equipment for diagnosing the efficiency of an air conditioning system has been disclosed.
All systems for diagnosing air conditioning equipment must rely on either measurements of the equipment's operating parameters, measurements of the air that is being conditioned by the equipment, or a combination of the two. When direct measurements of the air are taken, it is necessary to obtain such measurements from a good representative sample of the air. Otherwise, the measurements will be essentially meaningless. For very small volumes of air, this may be a relatively easy matter. Indeed, for very small volumes of air one sensor unit will normally suffice for taking measurements of temperature, humidity and fluid volumetric flow velocities. When larger volumes of air are involved, however, the situation becomes somewhat more complicated.
In order to measure characteristics in the flow of a volume of air through rather large ducts, such as are common for both commercial and residential air conditioning systems, it may be necessary to take several measurements of the air volume. Typically, this is done at several different locations in the fluid air flow. For example, in order to accurately measure the characteristics of air flowing through a five or six square foot orifice of an air duct, ten or twelve samples of the air may need to be taken at as many different locations in the orifice. Otherwise, meaningful and reliable readings for the total flow of air through the orifice may not be obtainable. Not surprisingly, this can be time consuming and tedious.
In light of the above it is an object of the present invention to provide an air sampling system which is able to simultaneously collect diverse samples from a volume of air and combine them into a single sample that is representative of the entire volume of air as it flows through an orifice. Another object of the present invention is to provide an air sampling system which is able to direct a representative sample of air toward a single sensor for an analysis which determines the average characteristics of the entire volume of air from which the sample is taken. It is yet another object of the present invention to provide a method for measuring selected characteristics of a volumetric air flow which are useful for diagnosing air conditioning equipment. Still another object of the present invention is to provide a system for sampling volumetric air flow, together with its concomitant method of operation, which is relatively easy to manufacture, simple to use, and comparatively cost effective.
|
{
"pile_set_name": "USPTO Backgrounds"
}
|
8月8日、サッカー日本代表が2対2で引き分けたコロンビア戦は、オウンゴールを決めてしまった藤春廣輝選手に強烈なヤジが飛んだ。
そんな中、ゴールキーパーの中村航輔選手が語ったとされるコメントが話題を呼んだ。
中村航輔「全て自分の責任。弾く方向を間違えた自分の責任。藤春さんのアレは結果論。あそこにコロンビアの選手がいてもおかしくなかった」
チームメイトをかばう謙虚な内容であることから、TwitterやFacebookなどで「カッコイイ」「さすが」「素敵」と賞賛されていた。
ところで、このコメントの出所はどこか。
試合後にテレビの中継で本人が語っていたわけではないし、そのようなコメントをしたと伝える記事も見当たらない。現地にいる記者やスポーツジャーナリストがSNSで発信した痕跡もない。
BuzzFeed Newsが見つけた限りでは、2ちゃんねる（2ch）のあるスレッドへの投稿が、その“情報源”だ。8月8日12時30分。上述のコメントが、一言一句まで同じテキストで綴られている。スレッドの文脈としてはネタのようにも見える。
12時35分、同じテキストを、あるTwitterユーザーが投稿した。話を聞かせてもらえないかとリプライを送ったが、返信はない。
13時頃、2chまとめブログ「Samurai GOAL」が、上述のスレッドを元にした記事「GK中村航輔のコメントがカッコイイ！！「全て自分の責任。弾く方向を間違えた自分の責任。藤春さんのアレは結果論」」を掲載した。
また、ほぼ同時刻、2chまとめブログ「SAMURAI Footballers」が、上述のスレッドを元にした記事「リオ五輪･日本代表GK中村航輔のオウンゴール藤春へのコメントが男前すぎるwww」を掲載した。
13時8分、8万超のフォロワーを抱える、サッカー情報を発信するTwitterアカウント「SOCCER DAILY【話題＆最新】」が、2chに投稿されたコメントに「中村航輔がカッコよすぎる」と書き添え、中村選手の画像とともに投稿した。リツイート数は7000件を超えている。
|
{
"pile_set_name": "OpenWebText2"
}
|
Q:
Explaination about a statement in LISP about format function
I have to convert a decimal number to binary in lisp. I came across this code while searching on web .
(defun :bits (value &optional (size 64))
(format t "~v,'~B" size value))
So please explain me what will each attribute of the code will do.
A:
So (format nil "~B" 23) will output the number in it's binary form :
> (format nil "~B" 23)
"10111"
But we want to specify the size of output string, we can do this by adding the size as a prefix in the format string.
> (format nil "~8B" 23)
" 10111"
But we don't want to pad it with spaces. We want to pad it with ~.
> (format nil "~8,'~B" 23)
"~~~10111"
Now we don't want to hard code the size of the output in the format string, we want this passed in as a parameter. This is where ~v comes in:
> (format nil "~v,'~B" 8 23)
"~~~10111"
Now note I have been passing nil as the second parameter rather than t. Passing nil means format returns the formatted string rather than printing it. You would probably rather do this.
A:
Mongus Pong's answer describes the actual behavior of the code you're looking at pretty well, but I think it's always worth mentioning where to find the answer, too. The Common Lisp HyperSpec is the best source of Common Lisp documentation, but there are parts of it that are a little bit hard to read. Sometimes the documentation of directives for format can be a bit dense. In this case, you'll need to see a few sections, because some of the things in your example can apply to more than just the binary directive, ~B.
You'd want to start with 22.3 Formatted Output, which describes the syntax of format strings:
A directive consists of a tilde, optional prefix parameters separated
by commas, optional colon and at-sign modifiers, and a single
character indicating what kind of directive this is. There is no
required ordering between the at-sign and colon modifier. The case of
the directive character is ignored. Prefix parameters are notated as
signed (sign is optional) decimal numbers, or as a single-quote
followed by a character. For example, ~5,'0d can be used to print an
integer in decimal radix in five columns with leading zeros, or ~5,'*d
to get leading asterisks.
So we're expecting to see a tilde, then (optionally) parameters separated by colons, an (optional) at sign (@), an (optional) colon (:), and the actual prefix directive (which is case sensitive). That means that
~v,'~B
is broken down as
~ ; initial tilde
v ; prefix parameter (could also be V)
, ; separator between prefix parameters
'~ ; prefix parameter (character following single quote)
B ; directive (could also be b)
So we have two prefix parameters: v and ~, and the directive is B. The next paragraph in the documentation describes what v does when it's a prefix parameter:
In place of a prefix parameter to a directive, V (or v) can be used.
In this case, format takes an argument from args as a parameter to the
directive. The argument should be an integer or character. If the arg
used by a V parameter is nil, the effect is as if the parameter had
been omitted.
Now, to find out what ~B does in general, you'll need to see 22.3.2.3 Tilde B: Binary, although it will pretty much redirect you elsewhere:
This is just like ~D but prints in binary radix (radix 2) instead of
decimal. The full form is therefore
~mincol,padchar,commachar,comma-intervalB.
That documentation describes the prefix parameters that are accepted (mincol, padchar, commachar, and comma-interval). These are filled in from left to right. The example ~v,'B has two of those, so v is mincol and ' is padchar. But we still need to see 22.3.2.2 Tilde D: Decimal for what each of those mean:
~mincolD uses a column width of mincol; spaces are inserted on the
left if the number requires fewer than mincol columns for its digits
and sign. If the number doesn't fit in mincol columns, additional
columns are used as needed.
~mincol,padcharD uses padchar as the pad character instead of space.
… The : modifier causes commas to be printed between groups of digits;
commachar may be used to change the character used as the comma.
comma-interval must be an integer and defaults to 3. When the :
modifier is given to any of these directives, the commachar is printed
between groups of comma-interval digits.
So, mincol, the width of the result is v, which means that it will be read from the list of arguments, and padchar, the padding character, is ~. Thus:
CL-USER> (bits 13 10)
~~~~~~1101 ; 10 characters wide, padded with ~
CL-USER> (bits 1022 10)
1111111110 ; 10 characters wide, no need for padding
CL-USER> (bits 1022 11) ; 11 characters with, padded with ~
~1111111110
|
{
"pile_set_name": "StackExchange"
}
|
"Look at all these people just sitting here and not tipping, working on their computers." "This guy has a brand-new Apple." "I've been eating the same apple for a week." "I blame Steve Jobs." "These people are more like Steve-I-have-no-jobs." "All right, that's it." "Earl, I need to get the wireless router." "Oh, is that what this is?" "I thought it was a cookie-warmer." "Attention deadbeat diners." "You can't just sit here all night and only order coffee." "This is not a Starbucks." "And I know that because we don't sell" "Norah Jones CDs or bananas." "This is the router for the free Wi-Fi." "And that is a waitress who needs to make some tips." "Seriously, guys, I need actual cash." "This guy just offered to pay me in ideas." "If I pull this plug, the Internet will go down." "And you--that sad email you're in the middle of writing to your ex-boyfriend, the one you shouldn't send anyway--gone." "And you-- that vaguely pornographic anime film you've been illegally downloading for the past three hours-- gone." "And you--that screenplay you've been writing, you can keep working on it, but we all know how it ends:" "With you moving back in with your mother." "Now, who's gonna order?" "Great, I'll go get some menus." "Here, Caroline, put this back." "[All gasp]" "Ooh, my cookie-warmer." "♪ Ooh ooh ooh ooh ooh" "[Cash register bell dings]" "♪ Ooh ooh ooh ooh ooh ooh ooh ♪" "[Overlapping chatter, laughter]" "Table ten just ordered cocktails." "Yeah, 'cause we're that kind of a place." "Does anyone know how to make sex on the beach?" "Easy." "I put on my speedo and wait." "[Shrill laughter]" "Those girls have been drinking for hours." "Just press every button on the gun and add rum." "[Laughter]" "Look at them." "Not a care in the world." "Having a great time." " I hate them." " I hate them, too." "I hate them more." "I hate that you hate them more." "So jealous." "[Both cackling]" "[Laughs mockingly]" "Okay, ready for party of four." "Excuse me." "Pardon me." "Excuse me." "Hey, baby!" "Looking good." "Mm, always." "I'll be in my booth." "Sophie, you cannot take up a whole booth alone." "There are people waiting." "You must leave." "Go stand in the corner now!" "Before I bend you across my knee and spank you in front of the whole class." "Well, I was going to stand in the corner anyway." "But tomorrow night, smaller table." "Go stand in the corner now!" "Okay, I'm over being jealous of them." "[High-pitched laughter]" "Still?" "What are they-- sitting on vibrators?" "Let it go." "They're not having that good of a time." "No, Max, we're not having that good of a time." "All we do is work." "When's the last time we took a day and just had fun?" "[Both cackling]" "I mean, those two idiots remind me how much fun it was when I'd go out to lunch and have cocktails with my girlfriends and watch them pretend to eat." "I think you're talking about day-drinking, and I think I like it." "All right, let's do something fun." "[Accent] I'll put on my bolo tie and my best vest and take my girl out to eat." "So, what is this lunch spot you're taking me to?" "Is it French?" "Do you think the chef will send an amuse-bouche to the table?" "No, but this morning I shaved a smiley face into my bouche, and it's very amusing." "You know what?" "It's just so fun to get dressed up and have someone wait on us for a change." "I even bought new panty hose from dooahnay rayahdey." "You mean Duane Reade?" "Oh, is that how you pronounce it?" "Well, we're here." "Better get in line." "Oh, there's a line." "Popular place." "What's the name?" ""Soup Kitchen." That's a cute name." "Very Williamsburg." "Like, "let's take our upscale urban bistro"" ""And make it seem like it's just a soup kitchen" ""open to everyone, but it's not really a soup kitchen."" "Oh, that's nice." "They let them use the bathroom." "And sit at a table." "Oh, my God!" "This is really a soup kitchen." "This is your idea of treating me to lunch?" "We're not homeless." "No, but we are soup-less." "And it's not just homeless people who eat here." "Okay, maybe they're the target audience." "Look, there's a lot of other people who can't afford to go out to eat." "You're right." "Why are there so many hipsters here?" "Because this place isn't just for people who don't have jobs, it's for people who don't want them." "Well, it does smell good." "Excuse me." "We'd like to take a look at your lunch menu." "Menu changes every day." "Also, there is no menu." "There's, like, four things." "Oh, okay." "So what do you recommend?" "Oh, what do I recommend?" "Don't share needles, and and use condoms." "But you didn't hear that last one from me." "Are nuns even allowed to be sarcastic?" "If they are, I have some serious thinking to do about my future." "This sloppy Joe is the most amazing terrible thing I've ever eaten." "[Muffled] I love that it's basically pre-chewed, so all you really have to do is swallow." "So good, I used to have these every day when I was a kid." "Well, then I guess your childhood" " wasn't all that bad." " Mm." "We couldn't afford the real Manwich Mix, so my mom's boyfriend, Dirty Carl, used to bring us leftover meat scraps and then bash 'em together with old ketchup packets he'd found in cars at the junkyard." "Now I understand why you think this is a nice restaurant." "Have you noticed the more you drink, the better this place gets?" "I've noticed the more I drink, the better everything gets." "Why don't we drink every day?" "Some of we do." "I'm having a great time." "Thank you, Max." "Well, yesterday, you were so bummed about your life," "I thought I'd take you somewhere you could feel good about yourself." "Okay, I've been wanting to say this the whole time." "I feel like we're the hottest people in this room." " Is that terrible?" " Yes." "[Both laughing]" "[Both gasp]" "Both:" "Speaking of hot people..." "Wait." "Are we drunk or do we finally have one brain" " and the same taste in guys?" " I don't know, but this is suddenly my new favorite restaurant." "Let's go get ourselves some of that man-wich." "I kind of like "drunk Caroline" way more than the other Caroline." "I kind of like her better, too." "[Laughter]" "[Clears throat]" "Excuse me, sisters." "Do you know the guy who just came in here?" " The cute one." " He's so cute, right?" "His name is Andy, and he just opened a candy store across the way." "Shut up!" "Candy?" "I love candy." "Question:" "What would make this day even better?" "Candy?" "You should totally go for the hot guy." "Or you can go for him." "Let's think about this." "He's clean and not a drug addict, so he's more my type." "Well, he's got a store full of candy and a penis, so he's more my type." "You know what?" "Go for it." "You've got dibs." "Aww, that's so nice of you, Max." "Yeah, and while you're doing him in the back room," "I'll be pocketing some candy." "Oh, no." "It's closed." "Hey, Max, you know what'd be fun?" "If we threw that trash can through the front window?" "I was gonna say we should leave him a note." "And what would be fun about throwing that can through a window?" "Have you ever done it?" "It's fun!" "Oh, the sign's turned around." "He can see us." "He's smiling at us." "[Giggles]" "Should we go in?" "If I learned anything as a child, it's when a stranger offers you candy, you say yes." "Hi." "We thought the sign said you were closed." "Yeah, I turned it around." "I wanted you guys to come in." "[Gene Wilder singing Pure Imagination]" "♪ Come with me" "♪ and you'll be" "♪ in world of pure imagination ♪" "If this isn't your thing," "I also have some Sabbath and some Beastie Boys." "So, if this is "Candy Andy's Sweets and Treats,"" "are you Candy Andy?" "Oh, please." "We hardly know each other." "Call me Candrew Andrew." "I'm Caroline, and this is Max." "Max, say something." "Can't." "It's all too wonderful." "Look at all the candy crammed in this little space." "It's like we're inside Willy Wonka's colon." "Thanks." "Yeah, it's kind of the look I was going for too." "And I know it's accurate because I had the Oompa Loompas help me." "They were expensive, but what are you gonna doom-pa-dee-doo?" "Normally I'd ring the bell after something that golden, but I don't want to scare you." "Well, now I have to hear the bell." "♪ Anything you want to [Rings bell]" "Now that's all I want to hear." "Do you do free samples?" "You do, by the way." "Let me hook you guys up." "On the house." "Marry this guy right now." "It's a small store." "I can hear you." "Good." "Moves things along faster." "Hey, come by the Williamsburg diner sometime." "We work there." "We'll give you free samples of food you shouldn't have to pay for anyway." "So, what brings you in to this neighborhood?" "Oh, we were having lunch at the-- this ...is a really adorable space." "Thank you." "You know, candy is my passion." "Yeah, I said it." "Always has been." "Even as a kid, I would have my G.I. Joes sell sweet tarts to my Transformers." "Gum drops, gummy bears, gummy worms, gummy hot dogs, gummy pizza." "Ooh, I just had a gummy-gasm." "So what was your favorite candy as a kid?" "Actually, I didn't eat a lot of candy as a child." "Okay, I'm gonna overlook that because you're pretty, but maybe we could talk about your terrible childhood over coffee sometime." "Yeah?" "[Rings bell]" "I'd leave you two alone, if this place wasn't filled with candy." "Okay, so what's your favorite flavor?" "Coconut." "And I'm walking to the "C"s." "The candy's alphabetical?" " Now I'm marrying you too." " Okay." "Let's see." "Coconut watermelon slice." "How's that sound?" "Um, not so good." "Actually, please don't say anything more about candy." "Is it hot in here?" "No, it's awesome in here." "Boston baked beans?" "Didn't know they weren't real beans till I was 20." "Please stop." "Is it cold in here?" "Is it hot and cold in here?" "Max, I feel weird." "Relax, it's just your lady parts waking up from hibernation." "Again, small store." "Can hear everything." "[Gags]" "I am so sorry." "Pardon me." "Oh, uh, are you okay?" "I'm fine." "Max, I am not fine." "I'm gonna be sloppy joanne in about two seconds." "Tiny, tiny store." "Do you need to use the" "No." "We're fine." "We'll just be going." "Nice to meet you." "[Gagging]" "Nope, I'm not gonna make it." "Where is the" "Right--right there." "[Clears throat]" "I'm sure she'll be all right." "[Retches]" "[Music volume increases]" "I'm just gonna step outside." "The sound of someone throwing up makes me" "Oh, dude, I've been trying to not throw up this whole time." "[Toilet flushes]" "Whew, what happened there, right?" "Feeling better?" "[Retches]" " [Gags] - [Gags]" "Did she tell you she projectile-puked soup and sloppy seconds all over a really cute guy and his floor?" "Let me put it this way, Caroline." "In my heroin days, that would have been a perfectly acceptable first date." "I don't understand it." "We ate the exact same thing." "How could you have not have gotten sick?" "You must still have "rich girl" stomach." "I'm used to poor food." "What made you sick made my skin clear up." " Hi, girls." " Hey, Sophie." "I'll be in my booth." "Oh." "Well, this is weird." "It's okay." "You didn't know." "Don't let it happen again." "Okay, good-bye now." "Sophie, what do you think you're doing?" "What?" "They were sitting in my booth." "It is not your booth, it's my booth." "If it was your booth, wouldn't it have a booster seat?" "Oh, Sophie wants to dance?" "We gonna dance." "Max." "Hi." "It's Andy." "From the store." "The guy who let you walk out with a push pop in your pocket." "That wasn't a push pop, Andy." "I was happy to see you." "Well, you're gonna be even happier in a minute." "Yay!" "But these come with a catch." "Invites for Caroline and you to a party at my candy store." "But maybe don't wear that uniform." "People are gonna think you're a giant sugar daddy." "So, she's still going at it, huh?" "Such a skinny girl." "How much more can come out of her?" "Nah, she's just a little embarrassed." "Something about self-esteem." "I don't know." "She throws it around like it means something." "Well, I'd love her to come." "No pressure." "But if you can talk her into it, there'll be unlimited candy for you for the rest of your life." "[Rings bells]" "Look at him, stealing my bit." "The candy man came with invitations to a party at his store." "What, you think I wasn't listening at the door?" "I heard everything." "All the vomit jokes." "I heard them all." "[Gasps]" "Jewelry, already?" "Your new husband likes to throw the cash around." "He is not my new husband." "And now he never will be." "Ooh, bubble tape." "I finally meet an adorable, sweet guy." "A guy so sweet, the word "sweet"" "is next to his name on actual real estate." "And I completely destroy any chance I have with him." "You didn't destroy anything." "And it's good to let him know right off the bat that you have a gag reflex." "Oh!" "Oh, that's lovely." "Happy Valentines' Day." "I am not going to that party." "I can never see him again." "Well, do you mind if I still go?" "Being in a candy store after midnight is on my bucket list." "Funny, I thought that was the impossible one." "You should go." "Have fun." "I think you're missing out, because you two are perfect for each other." "You're like Hansel and Gretel." "They were brother and sister." "So?" " So, no Caroline, huh?" " Uh, no." " She couldn't make it." " Hmm." "Well, I'm feeling very sad, but you'll never know it." "You're fine." "You don't seem to be short on other female party guests." "Oh, come on." "They're fiends." "Some of them I know from the neighborhood." "Some I worked with on Wall Street." "Wall Street?" "Did you have a little candy tray you walked around with?" "I wish." "That would have been awesome." "I was stuck in an office pushing stock in pharmaceutical companies." "Wait." "You know people who have access to pills?" "And just when I thought you couldn't get any better." "Yeah, one day, I went into the firm, and there was no firm." "Bankrupt." "Boom." "End of job, no money." "Nothing." "And after I drank nonstop for a week," "I figured, hey, now I can do what I've always dreamed of." "Open a candy store, be my own boss." "So I used all my savings and opened up this place." "And pretty soon," "Candy Andy will rule the world of sweets and treats." "That sound braggy?" "No." "All right, kick everybody out, and let's go back to my place." "Ah..." "Max, no offense, but I'm more into your friend." "Um, Andy, no offense, but I'm more into the candy than the Andy." "I want you to come to my apartment and say hey to Caroline." "I was right." "You two are perfect for each other." "Yeah?" "I mean, it would be nice to hang with her in pants I don't care about." "[Laughs]" "She's not here." "She must have taken the horse for a walk." "Wait, you have a horse, and I'm just hearing about this now?" "I have a candy store and it's out of my mouth, in the first 30 seconds." "Be right back." "I have to pee." "She'll be okay with me being here, right?" "Yeah, she was just embarrassed." "She'll get over it." " [Shrieks] - [Screams]" "What are you doing?" "Knock first!" "Why are your legs up in the air like that?" "And why were you holding the shower head down by your-- [Laughs] Oh!" "I'm sorry." "I thought you'd be home feeling bad for yourself, not feeling your bad self." "What are you doing home already?" "Why aren't you at the Candy Andy party?" "Oh, don't look at me like that." "It's not like I'm the only person in the world who masturbates." "[Clears throat]" "Also, Andy's here." "We wanted to surprise you." "But then you surprised us." "[Door closes]" "It's not a big deal." "That kind of situation happens to a lot of people." "Who?" "Who has that ever happened to?" "I know this might be a delicate area right now, but I'm thinking you should probably pay more than half of our water bill." "Hey, girls." "I need some hot tea to warm me up." "There's no hot water in our building when I tried to take a shower." "That's because it's all in Caroline." "Max!" "You are too tense." "Here." "Take this and relax a little." "Eh?" "This doing anything for you?" "[Laughs]" "Well, I'll be in my booth." "Hello, Sophie." "What are you doing in my booth?" "It's not your booth, it's my booth." "And look." "All the other booths are taken." "So you'll have to sit at small table, as is customary for lone diners." "This is my booth." "It's okay, you didn't know." "Okay, bye-bye now." "Hello, Max." "Check out my new booth." "I think it's better." "Oh, no." "I don't want to see him again." "Look, he's already seen you at your worst." "You vomited and masturbated." "That's your full range." "Hi." "Look, I know you're really embarrassed about-- well, everything." "And there's really nothing I can say to convince you not to be." "So..." "[Laughs]" "Who's embarrassed now?" "And to further my embarrassment," "I will now do gymnastics in public." "That is not embarrassing." "It was amazing." "All right." "Well, then come back to my house and watch me masturbate." "Or we could just get coffee." "Yay, I'm so happy!" "Thanks, Max." "No, not for you." "For me." "I'm getting unlimited candy and maybe some pills."
|
{
"pile_set_name": "OpenSubtitles"
}
|
Sesfontein Constituency
Sesfontein Constituency is an electoral constituency of Namibia. Located in Kunene Region, it has a population of 7,358. Its district capital is the settlement of Sesfontein. It is bordered by Khorixas Constituency to the south, Kamanjab Constituency to the east, Opuwo Rural to the north and Okahao Constituency in Omusati Region to the northeast.
Sesfontein is the only settlement in this constituency but this vast area contains a number of tourism facilities like the Palmwag and Warmquelle lodges.
Politics
Sesfontein Constituency voters traditionally supported electing opposition parties for the National Assembly and President.
2004
In 2004, it was one of the few constituencies in Namibia to vote for an opposition candidate for President in the latest Presidential election, 2004. In that year, Justus ǁGaroëb of the United Democratic Front) received the most votes for President with 1,259 (46.01%) total votes, while Hifikepunye Pohamba of the South West Africa People's Organization (SWAPO), who won more than 76% of the national vote, received only 896 votes (32.78%) in the Constituency. Nationally, Sesfontein represented approximately 4% of ǁGaroëb's vote despite only representing less than .0033% of the national vote for President. Likewise, Sesfontein supported an opposition candidate, Hendrik Gaobaeb also of the UDF, for regional council.
2009
In 2009, Sesfontein Constituency again supported the UDF (1142 or 38.36%), though to a lesser degree than in 2004. SWAPO improved their vote total and percentage to 1092 from 896 (32.78% to 36.68%).
2015
The 2015 regional election was won by Julius Koujova of the SWAPO Party with 1,514 votes, Hendrik Gaobaeb of the United Democratic Front (UDF) came second with 1,063 votes. Independent candidates Asser Ndjitezeua and Timotheus Hochobeb followed with 328 and 272 votes respectively. Amon Kapi of the Rally for Democracy and Progress (RDP) also ran and received 87 votes.
References
Category:Constituencies of Kunene Region
|
{
"pile_set_name": "Wikipedia (en)"
}
|
Blue laser light has very widespread applications. For example, the blue laser light may be applicable to high-density optical storage or even medical science. Conventionally, the high-density optical data stores are operated with red diodes at the wavelength of about 650 nm. Through the use of shorter-wavelength blue laser radiation (about 405 nm), the next generation of optical data stores, e.g. DVDs, are currently introduced onto the market to be written or read by means of a blue laser light in a high-density manner. Generally, the DVDs applied in the blue laser technology are classified into two types, for example blu-ray discs and advanced optical discs (AODs).
According to the blue laser technology, the light-absorbent substances used in the optical discs are very important for adsorbing blue laser light. Generally, the light-absorbent substances include organic dyes and inorganic phase-changeable materials. The organic dyes displaying an intense absorption in the wavelength range of 390 to 490 nm (e.g. 405 nm) can be used for adsorbing the blue laser light. Examples of the organic dyes include cyanines, porphyrins, polyenes, azo compounds, dicyanovinylphenyl compounds, etc.
To achieve excellent optical properties, the dyes should have a high molar extinction coefficient at the blue light absorption wavelength. Moreover, photosensitivity, solubility, light fastness and writing power are also important for selecting suitable dyes.
Therefore, there is a continuous need of providing better blue laser light-absorbent substances, which can satisfy the abovementioned requirement profile particularly well.
|
{
"pile_set_name": "USPTO Backgrounds"
}
|
“Palestine Legal recently published a report noting that the majority of suppression of Palestine advocacy in the US targets students and faculty. In particular, 89% of such incidents occurred on college campuses in 2014, and 74% in 2019.”
“Forty-four years ago today, the Israeli police shot six Palestinian citizens of Israel dead as they were protesting against the Israeli government’s expropriation of thousands of acres of Palestinian land in the Galilee. Since then, March 30 has been known as Land Day and is an important date in the Palestinian political calendar.”
“I phoned my mother to ask: ‘What were we doing during curfew times in the Intifada?’ My mother laughed, and replied: ‘We baked. A lot.’ Indeed, I remember our house in Ramallah being full of the aromas of all the different cakes.”
“Palestinians are holding their breath as they wait to see if the Palestinian Authority’s desperate attempts to contain the spread of the novel coronavirus (COVID-19) to the city of Bethlehem is working.”
“After U.S. President Donald Trump on Tuesday unveiled his long-awaited ‘peace deal’ for the Israel-Palestine conflict, Sen. Bernie Sanders condemned the proposal as ‘unacceptable’ and called for an end to Israel’s decades-long occupation of Palestinian territories.”
“ALEX ODEH WAS born in 1944 in British Mandate Palestine to a Christian family in the West Bank village of Jifna, near Ramallah, just four years before the founding of Israel. He immigrated in 1972 to the United States, where he became a spokesperson for the Arab American community, challenging negative portrayals of Middle Easterners and Muslims, which were back then at least as commonplace as they are today.”
“In 1919, Arthur James Balfour, the foreign secretary, wrote that in Palestine, the British government did not ‘propose even to go through the form of consulting the wishes of the present inhabitants of the country’.”
|
{
"pile_set_name": "Pile-CC"
}
|
Ginataang hipon
Ginataang hipon is a Filipino seafood soup made from shrimp in coconut milk and spices. It differs from other types of ginataan (which also commonly include shrimp), in that it does not use vegetables. It is a type of ginataan. Variants of the dish includes ginataang curacha and ginataang sugpo, which use spanner crabs and prawn (or lobster) in place of shrimp, respectively.
Description
Ginataang hipon is one of the simpler types of ginataan. The basic recipe includes unshelled shrimp with the heads intact, coconut milk, onion, garlic, ginger/turmeric, patis (fish sauce) or bagoong alamang (shrimp paste), and salt and pepper to taste. It can also be spiced with siling haba or labuyo peppers. The onion and garlic are first sautéed in oil in a pan, followed by the shrimp, then the rest of the ingredients are added until cooked. Some recipes prefer to boil the coconut milk until it is reduced and oily, while others keep the dish soupy. Coconut cream is also preferred if available, instead of thin coconut milk. The dish does not normally include any type of vegetables. Some versions, however, add leafy vegetables, bamboo shoots (labong), tomatoes, and/or cucumber.
Variants
Ginataang hipon can also be cooked with spanner crabs (ginataang curacha) or prawns/lobsters (ginataang sugpo). A notable variant of ginataang curacha is curacha Alavar.
See also
Halabos
Pininyahang hipon
Coconut soup
List of dishes using coconut milk
List of soups
References
Category:Philippine soups
Category:Foods containing coconut
Category:Shrimp dishes
Category:Philippine seafood dishes
|
{
"pile_set_name": "Wikipedia (en)"
}
|
cpu <null>
cpuacct <null>
cpuset /not/really/sys/fs/cgroup/cpuset
memory <null>
devices <null>
freezer /not/really/sys/fs/cgroup/freezer
blkio <null>
net_cls /not/really/sys/fs/cgroup/net_cls
perf_event /not/really/sys/fs/cgroup/perf_event
name=systemd <null>
unified /not/really/sys/fs/cgroup/unified
|
{
"pile_set_name": "Github"
}
|
Taste and odor compounds associated with aquatic plants in Taihu Lake: distribution and producing potential.
The odor problem caused by the decay of aquatic plants is widespread in many freshwater lakes. In this study, the spatial distributions of seven taste and odor (T&O) compounds (dimethyl sulfide, dimethyl disulfide, dimethyl trisulfide, 2-methylisoborneol, geosmin, β-cyclocitral, and β-ionone) in the sediments and overlying water of the east of Taihu Lake were investigated. The effects of plant and physico-chemical parameters on the release of T&O compounds were also analyzed. The results showed that high concentrations of T&O compounds were detected in the area where Eichhornia crassipes was flourishing. Volatile organic sulfur compounds were not found in the water source area, which was not covered by aquatic plants. High plant biomass and aquiculture activities might increase the release of the taste and odor compounds. The correlation between the concentrations of odorous compounds and nutrients in the sediment was also analyzed. The production of odorants was positively correlated with the nitrogen, and they may migrate from sediment to overlying water. The result suggested that controlling the plant density and aquaculture activities could reduce the release of odorous compounds.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
Fillum on Facebook
If everyone is not forgetting, the incident where Akshay asked wife Twinkle to open his jeans button when he walked on ramp, this let to controversies and the couple had to see a case filed against them for vulgarity,
After that just because Salman requested, Akshay walked on ramp for Being Human, otherwise Akshay has said no to any shows offer,
This time also the brand owners had tough time to convince Akshay to walk on ramp for them, and finally Akshay has said yes, its a vest brand he has endorsee. For this Akshay has come with an idea of wearing a TShirt that says ‘No Controversies Please’.
Source Said,
The company had a very tough time convincing Akki to walk the ramp again. Last time, when he walked at a fashion show, he and Twinkle were booked and arrested for obscenity.
Later on, he was heard telling his friends that anybody could get up and do anything even if he did something funny with one’s own wife!
After that incident, a wary AK refused to walk the ramp for any shows. He only walked for Being Human once because Salman Khan requested him to.
For today’s event, he will be wearing a specially made T-shirt with ‘No Controversies Please’ printed on it in bold letters. It was his idea to wear such a tee. And no, Twinkle won’t attend the event.
|
{
"pile_set_name": "Pile-CC"
}
|
The natriuretic peptides.
The natriuretic peptides are a family of widely distributed, but evolutionarily conserved, polypeptide mediators that exert a range of actions throughout the body. In cardiovascular homeostasis, the endocrine roles of the cardiac-derived atrial and B-type natriuretic peptide (ANP and BNP) in regulating central fluid volume and blood pressure have been recognised for two decades. However, there is a growing realisation that natriuretic peptide actions go far beyond their volume regulating effects. These pleiotropic actions include local (autocrine/paracrine) regulatory actions of ANP and BNP within the heart, and of another natriuretic peptide, CNP, within the vessel wall. Effects on function and growth of the local tissue environment are likely to be of great importance, especially in disease states where tissue and circulating levels of ANP and BNP rise markedly. At present, the relevance of other natriuretic peptides (notably uroguanylin and DNP) to human physiology and pathology remain uncertain. Other articles in this issue of Basic Research in Cardiology review the molecular physiology of natriuretic peptide signalling, with a particular emphasis on the lessons from genetically targetted mice; the vascular activity of natriuretic peptides; the regulation and roles of natriuretic peptides in ischaemic myocardium; and the diagnostic, prognostic and therapeutic roles of natriuretic peptides in heart failure.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
11 Jan 2016
Today I’ve released verson 0.6 of the three main Cap’n Proto crates: the runtime, the code generator, and the remote procedure call system.
The biggest change is that the RPC system is now asynchronous, built on top of the GJ event loop library.
promises
Cap’n Proto’s RPC protocol allows method calls to be made on distributed objects. It has a built-in notion of pipelining that can minimize network round-trips, and it allows object references to be transmitted within messages, alongside plain-old-data.
Such a system has an inherent need to deal with concurrency, both in its internal implementation in its publicly-exposed interfaces.
For example, it’s common for a user to want to implement an RPC method that makes a bunch of other RPC calls and then collects their results before returning. How should these actions compose? In the new version of capnp-rpc , which uses GJ’s Promise abstraction, each of the inner method calls returns a promise, and those promises can be collected with Promise::all() to form a new promise which can then be returned from the outer method.
To see more concretely what this kind of thing looks like, take a look at the calculator example, which also showcases some fancier features. There are also some more-practical examples in the form of Sandstorm apps: a simple GET/PUT/DELETE server and a word game.
error handling
A Promise<T, E> is essentially a deferred Result<T, E> , so it should be no surprise that today’s release pertains to our continuing story about error handling.
Last time, we described our switch to using Result<T,E> pervasively, so that we could return an Err(e) on a decode error, rather than panicking. That switch had some costs:
We now need to sprinkle try!() s in our code, one for any time we dereference a Cap’n Proto pointer. We also need to edit some return types from T to Result<T, E> , and in some cases need to define helper functions so that try!() has a place to return to.
In my opinion, (1) is not so bad, and it has the advantage of making control flow more clear. The proposed ? operator would make this even nicer.
In the asynchronous world of Cap’n Proto RPC, (2) becomes less of a hassle, because most functions that need to read a Cap’n Proto message are asynchronous, and therefore already return a Promise<T, E> . In such cases, we can use the pry!() macro that GJ defines. The pry!() macro acts like try!() , but in the early return case returns Promise::err(e) rather than Result::Err(e) .
a simpler error type
One error-related question that often arises when designing interfaces that use Promise<T,E> is: what concrete error type should be plugged in for E ?
In previous versions of capnproto-rust, I had defined an error enum capnp::Error with various cases, one of which wrapped a std::io::Error . This got me into trouble when I wanted to start using Promise::fork() , which requires that E be Clone . The problem is that std::io::Error is not Clone !
To address this problem, I have redefined ::capnp::Error to follow the design of kj::Exception. It’s now a very simple struct with a String description and an ErrorKind enum, where the only variants of ErrorKind are Failed , Disconnected , Overloaded , and Unimplemented . The observation here is that there seems to be very little gained by defining hierarchies of errors wrapping other errors.
-- posted by dwrensha
|
{
"pile_set_name": "OpenWebText2"
}
|
This course caters to education students who are taking EDUC 221. The delivery of this course is being administered using a blended modality to provide students with the opportunity to share ideas both face-to-face and online
|
{
"pile_set_name": "Pile-CC"
}
|
This is in great condition and appears to have been taken care of. The power supply has been cut, and it is therefore untested. All 4 Electron tubes are still intact. They are RCA 811A tubes. The item "Gonset GSB-101 Model 3262 Linear Ham Radio Amplifier for Untested with Tube CLEAN" is in sale since Thursday, July 19, 2018. This item is in the category "Consumer Electronics\Radio Communication\Ham, Amateur Radio\Ham Radio Amplifiers". The seller is "toad_ps2" and is located in Spokane, Washington. This item can be shipped to United States, Canada, United Kingdom, Denmark, Romania, Slovakia, Bulgaria, Czech republic, Finland, Hungary, Latvia, Lithuania, Malta, Estonia, Australia, Greece, Portugal, Cyprus, Slovenia, Japan, China, Sweden, South Korea, Indonesia, Taiwan, Belgium, France, Hong Kong, Ireland, Netherlands, Poland, Spain, Italy, Germany, Austria, Israel, New Zealand, Philippines, Singapore, Switzerland, Norway, Saudi arabia, Ukraine, United arab emirates, Qatar, Kuwait, Bahrain, Croatia, Malaysia.
|
{
"pile_set_name": "Pile-CC"
}
|
---
author:
- 'D. Kaledin[^1]'
date: '*To Yu. I. Manin, the founder, on the occasion of his 70-th birthday*'
title: Cyclic homology with coefficients
---
Introduction {#introduction .unnumbered}
============
Ever since it was discovered in 1982 by A. Connes [@C1] and B. Tsygan [@tsy], cyclic homology occupies a strange place in the realm of homological algebra. Normally in homological algebra problems, one expects to start from some data, such e.g. a topological space $X$, then construct some abelian category, such as the category of sheaves on $X$, and then define the cohomology of $X$ by computing the derived functors of some natural functor, such as e.g. the global sections functor $\Gamma(X,-)$. Admittedly, this is a modern formulation, but it had certainly been current already in 1982. Cyclic homology starts with an associative algebra $A$, and defines its homology groups $HC_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(A)$, but there are absolutely no derived functors in sight. Originally, $HC_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(A)$ were defined as the homology of an explicit complex, – which anyone trained to use triangulated categories cannot help but take as an insult. Later A. Connes [@C] improved on the definition by introducing the abelian category of so-called cyclic vector spaces. However, the passage from $A$ to its associated cyclic vector space $A_\#$ is still done by an explicit [*ad hoc*]{} formula. It is as if we were to know the bar-complex which computes the homology of a group, without knowing the definition of the homology of a group.
This situation undoubtedly irked many people over the years, but to the best of my knowledge, no satisfactory solution has been proposed, and it may not exist – indeed, many relations to the de Rham homology notwithstanding, it is not clear whether cyclic homology properly forms a part of homological algebra at all (to the point that e.g. in [@FT] the word “homology” is not used at all for $HC_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(A)$, and it is called instead [*additive $K$-theory*]{} of $A$). In the great codification of homological algebra done in [@GM1], cyclic homology only appears in the exercises. This is not surprising, since the main unifying idea of [@GM1] is the ideology of “linearization”: homological algebra linearizes geometry, just as functional analysis used to do 50 years ago; triangulated categories and adjoint functors are modern-day versions of Banach spaces and adjoint linear operators. This has been an immensely successful and clarifying point of view, in general, but $HC_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(A)$ sticks out on a complete tangent – there is simply no natural place for it in this framework.
This paper arouse as one more attempt to propose a solution to the difficulty – to find a natural triangulated category where $HC_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(-)$ would be able to live with a certain level of comfort (and with all the standard corollaries such as the notion of cyclic homology with coefficients, the ability to compute cyclic homology by whatever resolution is convenient, not just the bar resolution, and so on).
In a sense, our attempt has been successful: we define a triangulated category which can serve as the natural “category of coefficients” for cyclic homology of an algebra $A$, and we prove the comparison theorem that shows that when the coefficients are trivial, the new definition of cyclic homology is equivalent to the old one. In fact, the algebra $A$ enters into the construction only through the category $A{\operatorname{\!-\sf bimod}}$ of $A$-bimodules; we also show how to generalize the construction so that $A{\operatorname{\!-\sf bimod}}$ is replaced with a more general tensor abelian category ${{\mathcal C}}$.
From a different point of view, though, out attempt failed miserably: the correspondence $A \mapsto A_\#$, being thrown out of the window, immediately returns through the door in a new and “higher-level disguise”: it is now applied not to the algebra $A$, but to the tensor category ${{\mathcal C}}= A{\operatorname{\!-\sf bimod}}$. Then in practice, the freedom to choose an arbitrary resolution to compute the derived functors leads, in our approach to $HC_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(-)$, to complexes which are even larger than the original complex, and at some point the whole exercise starts to look pointless.
Still, we believe that, all said and done, some point can be found, and some things are clarified in our approach; one such thing is, for instance, the version of Gauss-Manin connection for cyclic homology discovered by E. Getzler [@getz]. Beside, we do propose a definition of cyclic homology which makes sense for a general tensor category; and in some particular questions, even the computations can be simplified. As for the presence of the $A_\#$-construction, this might be in the nature of things, after all – not a bug of the theory, but a necessary feature. However, we best leave it to the reader to be the judge.
The paper is organized as follows. In Section 1 we recall A. Connes’ second definition of cyclic homology which uses the cyclic category $\Lambda$; we also recall some facts about homology of small categories that we will need. We have tried to give only the absolute minimum – the reader not familiar with the material will have to consult the references. In Section 2 we introduce our main object: the notion of a [*cyclic bimodule*]{} over an associative algebra $A$, and the derived category of such bimodules. We also introduce cyclic homology $HC_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(A,M)$ with coefficients in a cyclic bimodule $M$. In Section 3 we give a very short derivation of the Gauss-Manin connection; strictly speaking, the language of cyclic bimodules is not needed for this, but we believe that it shows more clearly what is really going on. In Section 4, we show how to replace the category $A{\operatorname{\!-\sf bimod}}$ everywhere with a more general tensor abelian category ${{\mathcal C}}$. Section 5 is a postface, or a “discussion” (as they do in medical journals) – we discuss some of the further things one might (and should) do with cyclic bimodules, and how to correct some deficiencies of the theory developed in Sections 2 and 4.
Acknowledgements. {#acknowledgements. .unnumbered}
-----------------
In the course of this work, I have benefited greatly from discussions with A. Beilinson, E. Getzler, V. Ginzburg, A. Kuznetsov, N. Markarian, D. Tamarkin, and B. Tsygan. I am grateful to Northwestern Univeristy, where part of this work was done, and where some of the results were presented in seminars, with great indulgence from the audience towards the unfinished state they were in. And, last but not least, it is a great pleasure and a great opportunity to dedicate the paper to Yuri Ivanovich Manin on his birthday. Besides all the usual things, I would like to stress that it is the book [@GM1], – and [@GM2], to a lesser extent – which shaped the way we look at homological algebra today, at least “we” of my generation and of Moscow school. Without Manin’s decisive influence, this paper certainly would not have appeared (as in fact at least a half of the papers I ever wrote).
Recollection on cyclic homology.
================================
We start by recalling, extremely briefly, A. Connes’ approach to cyclic homology, which was originally introduced in [@C] (for detailed overviews, see e.g. [@L Section 6] or [@FT Appendix]; a brief but complete exposition using the same language and notation as in this paper can be found in [@Ka Section 1]).
Connes’ approach relies on the technique of homology of small categories. Fix a base field $k$. Recall that for every small category $\Gamma$, the category ${\operatorname{Fun}}(\Gamma,k)$ of functors from $\Gamma$ to the category $k{\operatorname{\it\!-Vect}}$ of $k$-vector spaces is an abelian category with enough projectives and enough injectives, with derived category ${{\mathcal D}}(\Gamma,k)$. For any object $E \in {\operatorname{Fun}}(\Gamma,k)$, the homology $H_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(\Gamma,E)$ of the category $\Gamma$ with coefficients in $E$ is by definition the derived functor of the direct limit functor $$\displaystyle\lim_{\overset{\to}{\Gamma}}:{\operatorname{Fun}}(\Gamma,k) \to k{\operatorname{\it\!-Vect}}.$$ Analogously, the cohomology $H^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}(\Lambda,E)$ is the derived functor of the inverse limit $\displaystyle\lim_{\overset{\gets}{\Gamma}}$. Equivalently, $$H^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}(\Gamma,E) = {\operatorname{Ext}}^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}(k,E),$$ where $k \in {\operatorname{Fun}}(\Gamma,k)$ is the constant functor (all objects in $\Gamma$ go to $k$, all maps go to identity). In particular, $H^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}(\Gamma,k)$ is an algebra. For any $E \in {\operatorname{Fun}}(\Gamma,k)$, the cohomology $H^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}(\Gamma,E)$ and the homology $H_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(\Gamma,E)$ are modules over $H^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}(\Gamma,k)$.
We also note, although it is not needed for the definition of cyclic homology, that for any functor $\gamma:\Gamma' \to \Gamma$ between two small categories, we have the pullback functor $\gamma^*:{\operatorname{Fun}}(\Gamma,k) \to {\operatorname{Fun}}(\Gamma',k)$, and for any $E \in
{\operatorname{Fun}}(\Gamma,k)$, we have natural maps $$\label{dir.im}
H_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(\Gamma',\gamma^*E) \to H_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(\Gamma,E),\qquad
H^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}(\Gamma,E) \to H^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}(\Gamma',\gamma^*E).$$ Moreover, the pullback functor $\gamma^*$ has a left adjoint $\gamma_!:{\operatorname{Fun}}(\Gamma',k) \to {\operatorname{Fun}}(\Gamma,k)$ and a right-adjoint $f_*:{\operatorname{Fun}}(\Gamma',k) \to {\operatorname{Fun}}(\Gamma,k)$, known as the left and right Kan extensions. In general, $f_!$ is right-exact but it need not be left-exact. We will need one particular case where it is exact. Assume given a covariant functor $V:\Gamma \to {\operatorname{Sets}}$ from a small category $\Gamma$ to the category of sets, and consider the category $\Gamma'$ of pairs $\langle [a],v \rangle$ of an object $[a] \in \Gamma$ and an element $v \in V([a])$ (maps in $\Gamma'$ are those maps $\gamma:[a] \to [a']$ which send $v \in V([a])$ to $v' \in V([a'])$. Such a category is known as a [*discrete cofibration*]{} over $\Gamma$ associated to $V$, see [@SGA]. Then the Kan extension $f_!$ associated to the forgetful functor $f:\Gamma' \to \Gamma$, $\langle [a],v \rangle \mapsto [a]$ is exact, and is easy to compute: for any $E \in {\operatorname{Fun}}(\Gamma',k)$ and $[a] \in \Gamma$, we have $$\label{discr}
f_!E([a]) = \bigoplus_{v \in V([a])}E(\langle [a],v \rangle).$$ Moreover, for any $E \in {\operatorname{Fun}}(\Gamma,k)$, this imediately gives the projection formula: $$\label{projj}
f_!f^*E \cong E \otimes F_!k,$$ where, as before, $k \in {\operatorname{Fun}}(\Gamma',k)$ stands for the constant functor.
For applications to cyclic homology, one starts with introducing the [*cyclic category*]{} $\Lambda$. This is a small category whose objects $[n]$ are numbered by positive integers $n \geq 1$. One thinks of an object $[n]$ as a circle $S^1$ with $n$ distinct marked points; we denote the set of these points by $V([n])$. The set of maps $\Lambda([n'],[n])$ from $[n']$ to $[n]$ is then the set of homotopy classes of continuous maps $f:S^1 \to S^1$ such that
- $f$ has degree $1$, sends marked points to marked points, and is non-decreasing with respect to the natural cyclic order on $S^1$ (that is, if a point $a \in S^1$ lies between points $b$ and $c$ when counting clockwise, then the same is true for $f(a)$, $f(b)$ and $f(c)$).
In particular, we have $\Lambda([1],[n]) = V([n])$. This topological description of the cyclic category $\Lambda$ is easy to visualize, but there are also alternative combinatorial descriptions (e.g. [@GM1 Exercize II.1.6], [@L Section 6], or [@FT A.2], retold in [@Ka Section 1.4]). All the descriptions are equivalent. Objects in ${\operatorname{Fun}}(\Lambda,k)$ are usually called [*cyclic vector spaces*]{}.
The cyclic category $\Lambda$ is related to the more familiar [*simplicial category*]{} $\Delta^{opp}$, the opposite to the category $\Delta$ of finite non-empty linearly ordered sets. To understand the relation, consider the discrete cofibration $\Lambda_{[1]}/\Lambda$ associated to the functor $V:\Lambda \to
{\operatorname{Sets}}$ – equivalently, $\Lambda_{[1]}$ is the category of objects $[n]$ in $\Lambda$ eqipped with a map $[1] \to [n]$. Then it is easy to check that $\Lambda_{[1]}$ is equivalent to the $\Delta^{opp}$. From now on, we will abuse the notation and identify $\Lambda_{[1]}$ and $\Delta^{opp}$. We then have a natural projection $\Delta^{opp} = \Lambda_{[1]} \to \Lambda$, $\langle
[n],v \rangle \mapsto [n]$, which we denote by $j:\Delta^{opp} \to
\Lambda$.
For any cyclic $k$-vector space $E \in {\operatorname{Fun}}(\Lambda,k)$, we have its restriction $j^*E \in {\operatorname{Fun}}(\Delta^{opp},E)$, a simplicial vector space. One defines the cyclic homology $HC_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(E)$ and the Hochschild homology $HH_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}$ of $E$ by $$HC_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(E) {\overset{\text{\sf\tiny def}}{=}}H_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(\Lambda,E), \qquad HH_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(E) {\overset{\text{\sf\tiny def}}{=}}H_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(\Delta^{opp},j^*E).$$ By , we have a natural map $HH_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(E) \to
HC_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(E)$ (moreover, since $j:\Delta^{opp} \to \Lambda$ is a discrete cofibration, the Kan extension $j_!$ is exact, so that we have $HH_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(E) \cong HC_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(j_!j^*E)$, and the natural map is induced by the adjunction map $j_!j^*E \to E$). It has been shown by A. Connes that this map fits into a long exact sequence $$\label{connes}
\begin{CD}
HH_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(E) @>>> HC_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(E) @>{u}>> HC_{{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}-2}(E) @>>>.
\end{CD}$$ Here the map $u$ is the so-called [*periodicity map*]{} on $HC_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(E)$: one shows that the algebra $H^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}(\Lambda,k)$ is isomorphic to the polynomial algebra $k[u]$ in one generator $u$ of degree $2$, and the periodicity map on homology is simply the action of this generator. This allows to define a third homological invariant, the [*periodic cyclic homology*]{} $HP_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(E)$ – to do it, one inverts the periodicity map.
For any cyclic $k$-vector space $E \in {\operatorname{Fun}}(\Lambda,k)$, the [*periodic cyclic homology*]{} of $E$ is defined by $$HP_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(E) = \dlim_{\overset{u}{\gets}}HC_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(E),$$ where $\dlim_{\gets}$ denotes the derived functor of the inverse limit $\displaystyle\lim_{\gets}$.
Assume now given an associative unital algebra $A$ over $k$. To define its cyclic homology, we associate to $A$ a canonical cyclic vector space $A_\#$ in the following way. We set $A_{\#}([n]) =
A^{\otimes V([n])}$, the tensor product of $n$ copies of the vector space $A$ numbered by marked points $v \in V([n])$. Then for any map $f \in \Lambda([n'],[n])$, we define $$\label{hash.def}
A_\#(f) = \bigotimes_{v \in V([n])}m_{f^{-1}(v)}:A^{\otimes V([n'])} =
\bigotimes_{v \in V([n])}A^{\otimes f^{-1}(v)} \to A^{\otimes
V([n])},$$ where for any linearly ordered finite set $S$, $m_S:A^{\otimes S}
\to A$ is the canonical multiplication map induced by the associative algebra structure on $A$ (and if $S$ is empty, we set $A^{\otimes S} = k$, and $m_S$ is the embedding of the unity). This is obviously compatible with compositions, and it is well-defined since for any $v \in V([n])$, its preimage $f^{-1} \subset V([m])$ carries a natural linear order induced by the orientation of the circle $S^1$.
\[alg.def\] For any associative unital algebra $A$ over $k$, its Hochschild, cyclic and periodic cyclic homology $HH_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(A)$, $HC_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(A)$, $HP_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(A)$ is defined as the corresponding homology of the cyclic $k$-vector space $A_\#$: $$HH_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(A) {\overset{\text{\sf\tiny def}}{=}}HH_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(A_\#),\quad
HC_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(A) {\overset{\text{\sf\tiny def}}{=}}HC_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(A_\#),\quad
HC_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(P) {\overset{\text{\sf\tiny def}}{=}}HP_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(A_\#).$$
Cyclic bimodules. {#naive}
=================
Among all the homology functors introduced in Definition \[alg.def\], Hochschild homology is the most accesible, and this is because it has another definition: for any associative unital algebra $A$ over $k$, we have $$\label{hh.def}
HH_{{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}} = {\operatorname{Tor}}^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}_{A^{opp} \otimes A}(A,A),$$ where ${\operatorname{Tor}}^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}$ is taken over the algebra $A^{opp} \otimes A$ (here $A^{opp}$ denotes $A$ with the multiplication taken in the opposite direction).
This has a version with coefficients: if $M$ is a left module over $A^{opp} \otimes A$, – in other words, an $A$-bimodule, – one defines Hochschild homology of $A$ with coefficients in $M$ by $$\label{hoch.coeff}
HH_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(A,M) = {\operatorname{Tor}}^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}_{A^{opp} \otimes A}(M,A).$$ The category $A{\operatorname{\!-\sf bimod}}$ of $A$-bimodules is a unital (non-symmetric) tensor category, with tensor product $- \otimes_A -$ and the unit object $A$. Hochschild homology is a homological functor from $A{\operatorname{\!-\sf bimod}}$ to $k{\operatorname{\it\!-Vect}}$.
To obtain a small category interpretation of $HH_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(A,M)$, one notes that for any $n,n' \geq 0$, the $A$-bimodule structure on $M$ induces a multiplication map $$A^{\otimes n} \otimes M \otimes A^{\otimes n'} \to M.$$ Therefore, if to any $\langle [n],v \rangle \in \Delta^{opp}$ we associate the $k$-vector space $$\label{M.Delta}
M^\Delta_\#([n]) = M \otimes A^{\otimes (V([n]) \setminus \{v\})},$$ with $M$ filling the place corresponding to $v \in V([n])$, then make perfect sense for those maps $f:[n'] \to [n]$ which preserve the distinguished points. Thus to any $M \in
A{\operatorname{\!-\sf bimod}}$, we can associate a simplicial $k$-vector space $M^\Delta_\# \in {\operatorname{Fun}}(\Delta^{opp},k)$. In the particular case $M=A$, we have $A_\#^\Delta = j^*A_\#$.
\[hoch\] For any $M \in A{\operatorname{\!-\sf bimod}}$, we have a canonical isomorphism $$\label{hh.iso}
HH_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(A,M) \cong H_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(\Delta^{opp},M^\Delta_\#).$$
[[*Proof.*]{}]{} It is well-known that for any simplicial $k$-vector space $E$, the homology $H_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(\Delta^{opp},E)$ can be computed by the standard complex of $E$ (that is, the complex with terms $E([n])$ and the differential $d = \sum_i(-1)^id_i$, where $d_i$ are the face maps). In particular, $H_0(\Delta^{opp},M^\Delta_\#)$ is the cokernel of the map $d:A \otimes M \to M$ given by $d(a \otimes m) =
am-ma$. The natural projection $M \to M \otimes_{A^{opp} \otimes A}
A$ obviously factors through this cokernel, so that we have a natural map $$\rho_0:H_0(\Delta^{opp},M^\Delta_\#) \to HH_0(A,M).$$ Both sides of are homological functors in $M$, and $HH_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(A,M)$ is a universal homological functor (=the derived functor of $HH_0(A,M)$); therefore the map $\rho_0$ extends to a map $\rho_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}:H_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(\Delta^{opp},M^\Delta_\#) \to HH_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(A,M)$. To prove that $\rho_{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}$ is an isomorphism for any $M$, it suffices to prove it when $M$ is free over $A^{opp} \otimes A$, or in fact, when $M = A^{opp} \otimes A$. Then on one hand, $HH_0(A,M)
= A$, and $HH_i(A,M) = 0$ for $i \geq 1$. And on the other hand, the standard complex associated to the simplicial $k$-vector space $(A^{opp} \otimes A)_\#^\Delta$ is just the usual bar resolution of the diagonal $A$-bimodule $A$.
It is more or less obvious that for an arbitrary $M \in A{\operatorname{\!-\sf bimod}}$, $M_\#^\Delta$ does not extend to a cyclic vector space – in order to be able to define $HC_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(A,M)$, we have to equip the bimodule $M$ with some additional structure. To do this, we want to use the tensor structure on $A{\operatorname{\!-\sf bimod}}$. The slogan is the following:
- To find a suitable category of coefficients for cyclic homology, we have to repeat the definition of the cyclic vector space $A_\# \in {\operatorname{Fun}}(\Lambda,k)$, but replace the associative algebra $A$ in this definition with the tensor category $A{\operatorname{\!-\sf bimod}}$.
Let us explain what this means.
First, consider an arbitrary associative unital monoidal category ${{\mathcal C}}$ with unit object $I$ (at this point, not necessarily abelian). For any integer $n$, we have the Cartesian product ${{\mathcal C}}^n =
{{\mathcal C}}\times {{\mathcal C}}\times \dots \times {{\mathcal C}}$. Moreover, the product on ${{\mathcal C}}$ induces a product functor $$m:{{\mathcal C}}^n \to {{\mathcal C}},$$ where if $n=0$, we let ${{\mathcal C}}^n={\operatorname{{\sf pt}}}$, the category with one object and one morphism, and let $m:{\operatorname{{\sf pt}}}\to {{\mathcal C}}$ be the embedding of the unit object. More generally, for any finite linearly ordered set $S$ with $n$ elements, we have a product functor $m_S:{{\mathcal C}}^S \to {{\mathcal C}}$, where ${{\mathcal C}}^S = {{\mathcal C}}^n$ with multiples in the product labeled by elements of $S$. Then for any $[n],[n'] \in \Lambda$, and any $f:[n'] \to [n]$, we can define a functor $f_!:{{\mathcal C}}^{V([n'])} \to {{\mathcal C}}^{V([n])}$ by the same formula as in : $$\label{trans.f}
f_! = \prod_{v \in V([n])}m_{f^{-1}(v)}:{{\mathcal C}}^{V([n'])} = \prod_{v \in
V([n])}{{\mathcal C}}^{f^{-1}(v)} \to {{\mathcal C}}^{V([n])}.$$ The natural associativity isomorphism for the product on ${{\mathcal C}}$ induces natural isomorphisms $(f \circ f')_! \cong f_! \circ f'_!$, and one checks easily that they satisfy natural compatibility conditions. All in all, setting $[n] \mapsto {{\mathcal C}}^{V([n])}$, $f
\mapsto f_!$ defines a weak functor (a.k.a. lax functor, a.k.a.$2$-functor, a.k.a. pseudofunctor in the original terminology of Grothendieck) from $\Lambda$ to the category of categories. Informally, we have a “cyclic category”.
To work with weak functors, it is convenient to follow Grothendieck’s approach in [@SGA]. Namely, instead of considering a weak functor directly, we define a [*category*]{} ${{\mathcal C}}_\#$ in the following way: its objects are pairs $\langle [n],M_n
\rangle$ of an object $[n]$ of $\Lambda$ and an object $M_n \in
{{\mathcal C}}^n$, and morphisms from $\langle [n'],M_{n'} \rangle$ to $\langle
[n],M_n\rangle$ are pairs $\langle f,\iota_f\rangle$ of a map $f:[n'] \to [n]$ and a bimodule map $\iota_f:f_!(M_{n'}) \to M_n$. A map $\langle f, \iota_f \rangle$ is called [*cocartesian*]{} if $\iota_f$ is an isomorphism. For the details of this construction, – in particular, for the definition of the composition of morphisms, – we refer the reader to [@SGA].
The category ${{\mathcal C}}_\#$ comes equipped with a natural forgetful projection $\tau:{{\mathcal C}}_\# \to \Lambda$, and this projection is a [*cofibration*]{} in the sense of [@SGA]. A [*section*]{} of this projection is a functor $\sigma:\Lambda \to {{\mathcal C}}_\#$ such that $\tau
\circ \sigma = {\operatorname{\sf id}}$ (since $\Lambda$ is small, there is no harm in requiring that two functors from $\Lambda$ to itself are equal, not just isomorphic). These sections obviously form a category which we denote by ${\operatorname{\sf Sec}}({{\mathcal C}}_\#)$. Explicitly, an object $M_\# \in
{\operatorname{\sf Sec}}({{\mathcal C}}_\#)$ is given by the following:
1. a collection of objects $M_n = M_\#([n]) \in {{\mathcal C}}^n$, and
2. a collection of transition maps $\iota_f:f_!M_{n'} \to M_n$ for any $n$, $n'$, and $f \in \Lambda([n'],[n])$,
subject to natural compatibility conditions.
A section $\sigma:\Lambda \to {{\mathcal C}}_\#$ is called cocartesian if $\sigma(f)$ is a cocartesian map for any $[n],[n'] \in \Lambda$ and $f:[n'] \to [n]$ – equivalently, a section is cocartesian if all the transition maps $\iota_f$ are isomorphisms. Cocartesian sections form a full subcategory ${\operatorname{\sf Sec}}_{cart}({{\mathcal C}}_\#)$
\[cycl.str\] The category ${\operatorname{\sf Sec}}_{cart}({{\mathcal C}}_\#)$ of cocartesian objects $M_\# \in
{\operatorname{\sf Sec}}({{\mathcal C}}_\#)$ is equivalent to the category of the following data:
1. an object $M = M_\#([1]) \in {{\mathcal C}}$, and
2. an isomorphism $\tau: I \times M \to M \times I$ in the category ${{\mathcal C}}^2 = {{\mathcal C}}\times {{\mathcal C}}$,
such that, if we denote by $\tau_{ij}$ the endomorphism of $I \times
I \times M \in {{\mathcal C}}^3$ obtained by applying $\tau$ to the $i$-th and $j$-th multiple, we have $\tau_{31} \circ \tau_{12} \circ \tau_{23}
= {\operatorname{\sf id}}$.
[[*Proof.*]{}]{} Straghtforward and left to the reader.
Thus the natural forgetfull functor ${\operatorname{\sf Sec}}_{cart}({{\mathcal C}}_\#) \to {{\mathcal C}}$, $M_\# \mapsto M_\#([1])$ is faithful: an object in ${\operatorname{\sf Sec}}_{cart}({{\mathcal C}}_\#)$ is given by $M_\#([1])$ plus some extra structure on it, and all the higher components $M_\#([n])$, $n \geq
2$, together with the transition maps $\iota_f$, can be recovered from $M_\#([1])$ and this extra structure.
Return now to the abelian situation: we are given an associative unital algebra $A$ over a field $k$, and our monoidal category is ${{\mathcal C}}= A{\operatorname{\!-\sf bimod}}$, with the natural tensor product. Then for every $n$, the product $A{\operatorname{\!-\sf bimod}}^n$ has a fully faithful embedding $A{\operatorname{\!-\sf bimod}}^n
\to A^{\otimes n}{\operatorname{\!-\sf bimod}}$, $M_1 \times M_2 \times \dots \times M_n
\mapsto M_1 \boxtimes M_2 \boxtimes \dots \boxtimes M_n$, and one checks easily that the multiplication functors $m_S$ actually extend to right-exact functors $$m_S:A^{\otimes S}{\operatorname{\!-\sf bimod}}\to A{\operatorname{\!-\sf bimod}};$$ for instance, one can define $m_S$ as $$m_S(M) = M/\{ a_{v'}m - ma_v \mid v \in S, a \in A, m \in M \},$$ where $a_v = 1 \otimes \dots \otimes a \otimes \dots \otimes 1 \in
A^{\otimes S}$ with $a$ at the $v$-th position, and $v' \in S$ is the next element after $v$. We can therefore define the cofibered category $A{\operatorname{\!-\sf bimod}}_\#/\Lambda$ with fiber $A^{\otimes V([n])}{\operatorname{\!-\sf bimod}}$ over $[n]
\in \Lambda$, and transition functors $f_!$ as in . We also have the category of sections ${\operatorname{\sf Sec}}(A{\operatorname{\!-\sf bimod}}_\#)$ and the subcategory of cocartesian sections ${\operatorname{\sf Sec}}_{cart}(A{\operatorname{\!-\sf bimod}}_\#) \subset {\operatorname{\sf Sec}}(A{\operatorname{\!-\sf bimod}}_\#)$.
\[sec.ab\] The category ${\operatorname{\sf Sec}}(A{\operatorname{\!-\sf bimod}}_\#)$ is a $k$-linear abelian category.
[[*Sketch of a proof.*]{}]{} This is a general fact about cofibered categories; the proof is straightforward. The kernel ${\operatorname{{\sf Ker}}}\phi$ and cokernel ${\operatorname{{\sf Coker}}}\phi$ of a map $\phi:M_\# \to M'_\#$ between objects $M_\#,M'_\# \in {\operatorname{\sf Sec}}(A{\operatorname{\!-\sf bimod}}_\#)$ are taken pointwise: for every $n$, we have an exact sequence $$0 \to ({\operatorname{{\sf Ker}}}\phi)([n]) \to M_\#([n]) \overset{\phi}{\to}
M'_\#([n]) \to ({\operatorname{{\sf Coker}}}\phi)([n]) \to 0.$$ The transtition maps $\iota_f$ for ${\operatorname{{\sf Ker}}}\phi$ are obtained by restriction from those for $M_\#$; for ${\operatorname{{\sf Coker}}}\phi$, one uses the fact that the functors $f_!$ are right-exact.
A [*cyclic bimodule $M$*]{} over a unital associative algebra $A$ is a cocartesian section $M_\# \in {\operatorname{\sf Sec}}_{cart}(A{\operatorname{\!-\sf bimod}}_\#)$. A [*complex of cyclic bimodules $M_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}$*]{} over $A$ is an object in the derived category ${{\mathcal D}}({\operatorname{\sf Sec}}(A{\operatorname{\!-\sf bimod}}_\#))$ whose homology objects are cocartsian.
Complexes of cyclic bimodules obviously form a full triangulated subcategory in ${{\mathcal D}}({\operatorname{\sf Sec}}(A{\operatorname{\!-\sf bimod}}_\#))$; consistent notation for this category would be ${{\mathcal D}}_{cart}({\operatorname{\sf Sec}}(A{\operatorname{\!-\sf bimod}}_\#))$, but for simplicity we will denote it ${{\mathcal D}}\Lambda(A{\operatorname{\!-\sf bimod}})$. We have to define complexes separately for the following reasons:
1. The category ${\operatorname{\sf Sec}}_{cart}(A{\operatorname{\!-\sf bimod}}_\#) \subset
{\operatorname{\sf Sec}}(A{\operatorname{\!-\sf bimod}}_\#)$ need not be abelian – since the transition functors $f_!$ are only right-exact, the condition of being cocartesian need not be preserved when passing to kernels.
2. Even if ${\operatorname{\sf Sec}}_{cart}(A{\operatorname{\!-\sf bimod}}_\#)$ is abelian, its derived category might be much smaller than ${{\mathcal D}}\Lambda(A{\operatorname{\!-\sf bimod}})$.
\[const.exa\] An extreme example of is the case $A = k$: in this case ${\operatorname{\sf Sec}}(A{\operatorname{\!-\sf bimod}}_\#)$ is just the category of cyclic vector spaces, ${\operatorname{Fun}}(\Lambda,k)$, and $E \in {\operatorname{Fun}}(\Lambda,k)$ is cocartesian if and only if $E(f)$ is invertible for any map $f:[n'] \to [n]$. One deduces easily that $E$ must be a constant functor, so that ${\operatorname{\sf Sec}}_{cart}(k{\operatorname{\!-\sf bimod}}_\#) = k{\operatorname{\it\!-Vect}}$. Then ${{\mathcal D}}\Lambda(k{\operatorname{\!-\sf bimod}})$ is the full subcategory ${{\mathcal D}}_{const}(\Lambda,k) \subset {{\mathcal D}}(\Lambda,k)$ of complexes whose homology is constant. If we were to consider $\Delta^{opp}$ instead of $\Lambda$, we would have ${{\mathcal D}}_{const}(\Delta^{opp},k) \cong {{\mathcal D}}(k{\operatorname{\it\!-Vect}})$ – since $H^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}(\Delta^{opp},k) = k$, the embedding ${{\mathcal D}}(k{\operatorname{\it\!-Vect}}) \to
{{\mathcal D}}(\Delta^{opp},k)$ is fully faithful, and ${{\mathcal D}}_{const}(\Delta^{opp},k)$ is its essential image. However, $H^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}(\Lambda,k)$ is $k[u]$, not $k$. Therefore there are maps between constant functors in ${{\mathcal D}}(\Lambda,k)$ which do not come from maps in ${{\mathcal D}}(k{\operatorname{\it\!-Vect}})$, and the cones of these maps give objects in ${{\mathcal D}}_{const}(\Lambda,k)$ which do not come from ${{\mathcal D}}(k{\operatorname{\it\!-Vect}})$.
This phenomenon is quite common in homological algebra – examples are, for instance, the triangulated category of complexes of étale sheaves with constructible homology, the category of complex of ${{\mathcal D}}$-modules with holonomic homology, or the so-called “equivariant derived category” of sheaves on a topological space $X$ acted upon by a topological group $G$ (which is not in fact the derived category of anything useful). The upshot is that it is the triangulated category ${{\mathcal D}}\Lambda(A{\operatorname{\!-\sf bimod}})$ which should be treated as the basic object, wherever categories are discussed.
\[const.rem\] We note one interesting property of the category ${{\mathcal D}}_{const}(\Lambda,k)$. Fix an integer $n \geq 1$, and consider the full subcategory $\Lambda_{\leq n} \subset \Lambda$ of objects $[n']
\in \Lambda$ with $n' \leq n$. Then one can show that $H^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}(\Lambda_{\leq n},k) = k[u]/u^n$, so that we have a natural exact triangle $$\label{conn.2}
\begin{CD}
H_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(\Lambda_{\leq n},E^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}) @>>> HC_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(E^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}) @>{u^n}>>
HC_{{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}+2n}(E) @>>>,
\end{CD}$$ for every $E^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}\in {{\mathcal D}}_{const}(\Lambda,k)$. We note that for any $E^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}\in {{\mathcal D}}(\Lambda,k)$, extends to a spectral sequence $$\label{conn.sp}
HH_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(E^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}})[u^{-1}] \Rightarrow HC_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(E),$$ where the expression on the left-hand side reads as “polynomials in one formal variable $u^{-1}$ of homological degree $2$ with coefficients in $HH_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(E^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}})$”. Then shows that for $E^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}\in {{\mathcal D}}_{const}(\Lambda,k)$, the first $n$ differentials in depend only on the restriction of $E^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}$ to $\Lambda_{\leq (n+1)} \subset \Lambda$. This is useful because in practice, one is often interested only in the first differential in the spectral sequence.
As in Lemma \[cycl.str\], a cyclic $A$-bimodule $M_\#$ essentially consists of an $A$-bimodule $M = M_\#([1])$ equipped with an extra structure. Explicitly, this structure is a map $\tau:A \otimes_k M
\to M \otimes_k A$ which respects the $A^{\otimes 2}$-bimodule structure on both sides, and satisfies the condition $\tau_{31}
\circ \tau_{12} \circ \tau_{23} = {\operatorname{\sf id}}$, as in Lemma \[cycl.str\].
Another way to view this structure is the following. One checks easily that for any cyclic $A$-bimodule $M_\#$, the restriction $j^*M_\# \in {\operatorname{Fun}}(\Delta^{opp},k)$ is canonically isomorphic to the simplicial $k$-vector space $M^\Delta_\#$ associated to the underlying $A$-bimodule $M$ as in . By adjunction, we have a natural map $$\tau_\#:j_!M^\Delta_\# \to M_\#.$$ Then $j_!M^\Delta_\#$ in this formula only depends on $M \in
A{\operatorname{\!-\sf bimod}}$, and all the structure maps which turn $M$ into the cyclic bimodule $M_\#$ are collected in the map $\tau_\#$.
We can now define cyclic homology with coefficients. The definition is rather tautological. We note that for any cyclic $A$-bimodule $M_\#$ – or in fact, for any $M_\# \in {\operatorname{\sf Sec}}(A{\operatorname{\!-\sf bimod}}_\#)$ – we can treat $M_\#$ as a cyclic vector space by forgetting the bimodule structure on its components $M_n$.
\[cycl.def\] The [*cyclic homology $HC_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(A,M_\#)$ with coefficients*]{} in a cyclic $A$-bimodule $M$ is equal to $H_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(\Lambda,M_\#)$.
Of course, , being valid for any cyclic $k$-vector space, also applies to $HC_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(A,M_\#)$, so that we automatically get the whole package – the Connes’ exact sequence, the periodicity endomorphism, and the periodic cyclic homology $HP_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(A,M)$. By Lemma \[hoch\], $HH_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(M_\#)$ coincides with $HH_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(A,M)$ as defined in .
Gauss-Manin connection. {#getz}
=======================
To illustate the usefulness of the notion of a cyclic bimodule, let us study the behavior of cyclic homology under deformations.
There are two types of deformation theory objects that one can study for an associative algebra $A$. The first is the notion of a [*square-zero extension*]{} of the algebra $A$ by a $A$-bimodule $M$. This is an associative algebra ${\widetilde}{A}$ which fits into a short exact sequence $$\begin{CD}
0 @>>> M @>{i}>> {\widetilde}{A} @>{p}>> A @>>> 0,
\end{CD}$$ where $p$ is an algebra map, and $i$ is an ${\widetilde}{A}$-bimodule map, under the ${\widetilde}{A}$-bimodule structure on $M$ induced from the given $A$-bimodule structure by means of the map $p$. In other words, the multiplication on the ideal ${\operatorname{{\sf Ker}}}p \subset {\widetilde}{A}$ is trivial, so that the ${\widetilde}{A}$-bimodule structure on ${\operatorname{{\sf Ker}}}p$ is induced by an $A$-bimodule structure, and $i$ identifies the $A$-bimodule ${\operatorname{{\sf Ker}}}p$ with $M$. Square-zero extensions are classified up to an isomorphism by elements in the second Hochschild cohomology group $HH^2(A,M)$, defined as $$HH^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}(A,M) = {\operatorname{Ext}}^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}_{A^{opp} \otimes A}(A,M).$$ In this setting, we can consider the cyclic homology of the algebra ${\widetilde}{A}$ and compare with the cyclic homology of $A$. Th. Goodwillie’s theorem [@go] claims that if the base field $k$ has characteristic $0$, the natural map $$HP_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}({\widetilde}{A}) \to HP_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(A)$$ is an isomorphism, and there is also some information on the behaviour of $HC_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(A)$.
A second type of deformation theory data includes a commutative $k$-algebra $R$ with a maximal ideal ${{\mathfrak m}}\subset R$. A [*deformation*]{} $A_R$ of the algebra $A$ over $R$ is a flat associative unital algebra $A_R$ over $R$ equipped with an isomorphism $A_R/{{\mathfrak m}}\cong A$. In this case, one can form the [*relative*]{} cyclic $R$-module $A_{R\#}$ by taking the tensor products over $R$; thus we have relative homology $HH_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(A_R/R)$, $HC_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(A_R/R)$, $HP_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(A_R/R)$. The fundamental fact discovered by E. Getzler [@getz] is that we have an analog of the Gauss-Manin connection: if ${\operatorname{Spec}}R$ is smooth, the $R$-module $HP_i(A_R/R)$ carries a canonical flat connection for every $i$.
Consider now the case when $R$ is not smooth but, on the contrary, local Artin. Moreover, assume that ${{\mathfrak m}}^2=0$, so that $R$ is itself a (commutative) square-zero extension of $k$. Then a deformation $A_R$ of $A$ over $R$ is also a square-zero extension of $A$, by the bimodule $A \otimes {{\mathfrak m}}$ (${{\mathfrak m}}$ here is taken as a $k$-vector space). But this square-zero extension is special – for a general square-zero extension ${\widetilde}{A}$ of $A$ by some $M \in A{\operatorname{\!-\sf bimod}}$, there does not exist any analog of the relative cyclic $R$-module $A_{R\#}
\in {\operatorname{Fun}}(\Lambda,R)$.
We observe the following: the data needed to define such an analog is precisely a cyclic bimodule structure on the bimodule $M$.
Namely, assume given a square-zero extension ${\widetilde}{A}$ of the algebra $A$ by some $A$-bimodule $M$, and consider the cyclic $k$-vector space ${\widetilde}{A}_\# \in {\operatorname{Fun}}(\Lambda,k)$. Let us equip ${\widetilde}{A}$ with a descreasing two-step filtration $F^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}$ by setting $F^1{\widetilde}{A} =
M$. Then this induces a decreasing filtration $F^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}$ on tensor powers ${\widetilde}{A}^{\otimes n}$. Since ${\widetilde}{A}$ is square-zero, $F^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}$ is compatible with the multiplication maps; therefore we also have a filtration $F^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}$ on ${\widetilde}{A}_\#$. Consider the quotient $$\overline{A_\#} = {\widetilde}{A}_\#/F^2{\widetilde}{A}_\#.$$ One checks easily that ${\operatorname{\sf gr}}^0_F{\widetilde}{A}_\# \cong A_\#$ and ${\operatorname{\sf gr}}^1_F{\widetilde}{A}_\# \cong j_!M^\Delta_\#$ in a canonical way, so that $\overline{A_\#}$ fits into a canonical short exact sequence $$\label{A.bar}
\begin{CD}
0 @>>> j_!M^\Delta_\# @>>> \overline{A_\#} @>>> A_\# @>>> 0
\end{CD}$$ of cyclic $k$-vector spaces.
Now assume in addition that $M$ is equipped with a structure of a cyclic $A$-bimodule $M_\#$, so that $M^\Delta_\# \cong
j^*M_\#$, and we have the structure map $\tau_\#:j_!M^\Delta_\# \to
M_\#$. Then we can compose the extension with the map $\tau_\#$, to obtain a commutative diagram $$\label{A.hat}
\begin{CD}
0 @>>> j_!M^\Delta_\# @>>> \overline{A_\#} @>>> A_\# @>>> 0\\
@. @V{\tau_\#}VV @VVV @|\\
0 @>>> M_\# @>>> {\widehat}{A_\#} @>>> A_\# @>>> 0
\end{CD}$$ of short exact sequences in ${\operatorname{Fun}}(\Lambda,k)$, with cartesian left square. It is easy to check that when ${\widetilde}{A} = A_R$ for some square-zero $R$, so that $M = A \otimes {{\mathfrak m}}$, and we take the cyclic $A$-bimodule structure on $M$ induced by the tautological structure on $A$, then ${\widehat}{A_\#}$ coincides precisely with the relative cyclic object $A_{R\#}$ (which we consider as a $k$-vector space, forgetting the $R$-module structure).
We believe that this is the proper generality for the Getzler connection; in this setting, the main result reads as follows.
\[spl\] Assume given a square-zero extension ${\widetilde}{A}$ of an associative algebra $A$ by an $A$-bimodule $M$, and assume that $M$ is equipped with a structure of a cyclic $A$-bimodule. Then the long exact sequence $$\begin{CD}
HP_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(A,M) @>>> HP_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}({\widehat}{A_\#}) @>>> HP_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(A) @>>>
\end{CD}$$ of periodic cyclic homology induced by the second row in admits a canonical splitting $HP_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(A) \to
HP_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}({\widehat}{A_\#})$.
[[*Proof.*]{}]{} By definition, we have two natural maps $$\label{comp}
\begin{aligned}
HP_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(\overline{A_\#}) &\to HP_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(A_\#) = HP_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(A),\\
HP_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(\overline{A_\#}) &\to HP_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}({\widehat}{A_\#}),
\end{aligned}$$ and the cone of the first map is isomorphic to $HP_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(j_!M^\Delta_\#)$. Since $j_!$ is exact, we have $HC_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(j_!M^\Delta_\#) \cong HH_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(M_\#)$, and the periodicity map $u:HC_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(j_!M^\Delta_\#) \to HC_{{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}-2}(j_!M^\Delta_\#)$ is equal to $0$, so that $HP_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(j_!M^\Delta_\#) = 0$. Thus the first map in is an isomorphism, and the second map is then the required splitting.
Assume given a commutative $k$-algebra $R$ with a maximal ideal ${{\mathfrak m}}\subset R$, and a deformation $A_R$ of the algebra $A$ over $R$. Then if ${\operatorname{Spec}}R$ is smooth, the $R$-modules $HP_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(A_R/R)$ carry a natural connection.
[[*Sketch of a proof.*]{}]{} Consider the $R \otimes R$-algebras $A_R
\otimes R$ and $R \otimes A_R$, and their restrictions to the first infinitesemal neighborhood of the diagonal in ${\operatorname{Spec}}(R \otimes R) =
{\operatorname{Spec}}R \times {\operatorname{Spec}}R$. Then Proposition \[spl\], suitably generalized, shows that $HP_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(-)$ of these two restrictions are canonically isomorphic. It is well-known that giving such an isomorphism is equivalent to giving a connection on $HP_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(A_R/R)$.
We note that we do not claim that the connection is [*flat*]{}. It certainly is, at least in characteristic $0$; but our present method does not allow one to go beyond square-zero extensions. Thus we cannot analyse the second infinitesemal neighborhood of the diagonal in ${\operatorname{Spec}}(R \otimes R)$, and we cannot prove flatness.
Unfortunately, at present, we do not understand what is the proper cyclic bimodule context for higher-level infinitesemal extensions. Of course, if one is only interested in an $R$-deformation ${\widetilde}{A} = A_R$ over an Artin local base $R$, not in its cyclic bimodule generalizations, one can use Goodwillie’s Theorem: using the full cyclic object ${\widetilde}{A}_\#$ instead of its quotient $\overline{A_\#}$ in Proposition \[spl\] immediately gives a splitting $HP_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(A) \to HP_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(A_R/R)$ of the augmentation map $HP_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(A_R/R) \to HP_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(A)$, and this extends by $R$-linearity to an isomorphism $HP_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(A_R/R) \cong
HP_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(A) \otimes R$. However, this is not quite satisfactory from the conceptual point of view, and it does not work in positive characteristic (where Goodwillie’s Theorem is simply not true). If ${\operatorname{\sf char}}k \neq 2$, the latter can be cured by using ${\widetilde}{A}_\#/F^3{\widetilde}{A}_\#$, but the former remains. We plan to return to this elsewhere.
Categorical approach. {#cat}
=====================
Let us now try to define cyclic homology in a more general setting – we will attempt to replace $A{\operatorname{\!-\sf bimod}}$ with an arbitrary associative unital $k$-linear tensor category ${{\mathcal C}}$ with a unit object ${\operatorname{{\sf I}}}\in {{\mathcal C}}$. We do not assume that ${{\mathcal C}}$ is symmetric in any way. However, we will assume that the tensor product $- \otimes -$ is right-exact in each variable, and we will need to impose additional technical assumptions later on.
The first thing to do is to try to define Hochschild homology; so, let us look more closely at . The formula in the right-hand side looks symmetric, but this is an optical illusion – the two copies of $A$ are completely different objects: one is a left module over $A^{opp} \otimes A$, and the other is a right module ($A$ just happens to have both structures at the same time). It is better to separate them and introduce the functor $${\operatorname{\sf tr}}:A{\operatorname{\!-\sf bimod}}\to k{\operatorname{\it\!-Vect}}$$ by ${\operatorname{\sf tr}}(M) = M \otimes_{A^{opp} \otimes A} A$ – or, equivalently, by $$\label{tr.A}
{\operatorname{\sf tr}}(M) = M/\{ am-ma \mid a \in A, m \in M \}.$$ Then ${\operatorname{\sf tr}}$ is a right-exact functor, and we have $HH_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(A,M) =
L^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}{\operatorname{\sf tr}}(M)$.
We want to emphasize that the functor ${\operatorname{\sf tr}}$ can not be recovered from the tensor structure on $A{\operatorname{\!-\sf bimod}}$ – this really is an extra piece of data. For a general tensor category ${{\mathcal C}}$, it does not exist a priori; we have to impose it as an additional structure.
Let us axiomatize the situation. First, forget for the moment about the $k$-linear and abelian structure on ${{\mathcal C}}$ – let us treat it simply as a monoidal category. Assume given some other category ${{\mathcal B}}$ and a functor $T:{{\mathcal C}}\to {{\mathcal B}}$.
\[trace.defn\] The functor $T:{{\mathcal C}}\to {{\mathcal B}}$ is a [*trace functor*]{} if it is extended to a functor ${{\mathcal C}}_\# \to {{\mathcal B}}$ which sends any cocartesian map $f:M \to
M'$ in ${{\mathcal C}}_\#$ to an invertible map.
Another way to say the same thing is the following: the categories ${\operatorname{Fun}}({{\mathcal C}}^n,{{\mathcal B}})$ of functors from ${{\mathcal C}}^n$ to ${{\mathcal B}}$ form a fibered category over $\Lambda$, and a trace functor is a cartesian section of this fibration. Explicitly, a trace functor is defined by $T:{{\mathcal C}}\to {{\mathcal B}}$ and a collection of isomorphisms $$T(M \otimes M') \to T(M' \otimes M)$$ for any $M,M' \in {{\mathcal C}}$ which are functorial in $M$ and $M'$ and satisfy some compatibility conditions analogous to those in Lemma \[cycl.str\]; we leave it to the reader to write down these conditions precisely. Thus $T$ has a trace-like property with respect to the product in ${{\mathcal C}}$, and this motivates our terminology.
Recall now that ${{\mathcal C}}$ is a $k$-linear abelian category. To define Hochschild homology, we have to assume that it is equipped with a right-exact trace functor ${\operatorname{\sf tr}}:{{\mathcal C}}\to k{\operatorname{\it\!-Vect}}$; then for any $M \in
{{\mathcal C}}$, we set $$\label{hh.def.gen}
HH_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(M) = L^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}{\operatorname{\sf tr}}(M).$$
The functor ${\operatorname{\sf tr}}:A{\operatorname{\!-\sf bimod}}\to k{\operatorname{\it\!-Vect}}$ canonically extends to a right-exact trace functor in the sense of Definition \[trace.defn\].
[[*Proof.*]{}]{} For any object $\langle [n],M_n \rangle \in A{\operatorname{\!-\sf bimod}}_\#$, $[n] \in \Lambda$, $M_n \in A^{\otimes n}{\operatorname{\!-\sf bimod}}$, let $${\operatorname{\sf tr}}(\langle [n],M_n \rangle) = M_n/\{ a_{v'}m - ma_v \mid v \in
V([n]), m \in M_n, a \in A \},$$ where $a_v = 1 \otimes 1 \otimes \dots \otimes a \otimes \dots
\otimes 1 \in A^{\otimes V([n])}$ has $a$ in the multiple corresponding to $v \in V([n])$, and $v' \in V([n])$ is the next marked point after $v$ counting clockwise. The compatibility with maps in the category $A{\operatorname{\!-\sf bimod}}_\#$ is obvious.
We note that here, in the case ${{\mathcal C}}=A{\operatorname{\!-\sf bimod}}$, the category $A{\operatorname{\!-\sf bimod}}_\#$ is actually larger than what we would have had purely from the monoidal structure on ${{\mathcal C}}$: $M_n$ is allowed to be an arbitrary $A^{\otimes n}$-bimodule, not a collection of $n$ $A$-bimodules. To do the same for general $k$-linear ${{\mathcal C}}$, we need to replace $A^{\otimes n}{\operatorname{\!-\sf bimod}}$ with some version of the tensor product ${{\mathcal C}}^{\otimes n}$. Here we have a difficulty: for various technical reasons, it is not clear how to define tensors products for sufficiently general abelian categories.
One way around it is the following. For any (small) $k$-linear abelian category ${{\mathcal B}}$, a $k$-linear functor ${{\mathcal B}}^{opp} \to k{\operatorname{\it\!-Vect}}$ is left-exact if and only if it is a sheaf for for the canonical Grothendieck topology on ${{\mathcal B}}$ ([@BD 5, §10]); the category ${\operatorname{Shv}}({{\mathcal B}})$ of such functors is abelian and $k$-linear, and ${{\mathcal B}}$ itself is naturally embedded into ${\operatorname{Shv}}({{\mathcal B}})$ by Yoneda. The embedding is a fully faithfull exact functor. Every functor in ${\operatorname{Shv}}({{\mathcal B}})$ is in fact a direct limit of representable functors, so that ${\operatorname{Shv}}({{\mathcal B}})$ is an inductive completion of the abelian category ${{\mathcal B}}$. Now, if are given two (small) $k$-linear abelian categories ${{\mathcal B}}_1$, ${{\mathcal B}}_2$, then their product ${{\mathcal B}}_1 \times {{\mathcal B}}_2$ is no longer abelian. However, we still have the abelian category ${\operatorname{Shv}}({{\mathcal B}}_1
\times {{\mathcal B}}_2)$ of bilinear functors ${{\mathcal B}}_1^{opp} \times {{\mathcal B}}_2^{opp} \to
k{\operatorname{\it\!-Vect}}$ which are left-exact in each variable, and the same goes for polylinear functors.
Moreover, for any right-exact functor $F:{{\mathcal B}}_1 \to {{\mathcal B}}_2$ between small abelian categories, we have the restriction functor $F^*:{\operatorname{Shv}}({{\mathcal B}}_2) \to {\operatorname{Shv}}({{\mathcal B}}_1)$, which is left-exact, and its left-adjoint $F_!:{\operatorname{Shv}}({{\mathcal B}}_1) \to {\operatorname{Shv}}({{\mathcal B}}_2)$, which is right-exact. The functor $F_!$ is an extension of the functor $F$: on Yoneda images ${{\mathcal B}}_i \subset {\operatorname{Shv}}({{\mathcal B}}_i)$, we have $F_! = F$. And, again, the same works for polylinear functors.
In particular, given our $k$-linear abelian tensor category ${{\mathcal C}}$, we can form the category ${\operatorname{Shv}}({{\mathcal C}})_\#$ of pairs $\langle E,[n]
\rangle$, $[n] \in \Lambda$, $E \in {\operatorname{Shv}}({{\mathcal C}}^n)$, with a map from $\langle E',[n'] \rangle$ to $\langle E,[n] \rangle$ given by a pair of a map $f:[n'] \to [n]$ and either a map $E' \to (f_!)^*E$, or map $(f_!)_!E' \to E$ – this is equivalent by adjunction. Then ${\operatorname{Shv}}({{\mathcal C}})_\#$ is bifibered category over $\Lambda$ in the sense of [@SGA].
The category of sections $\Lambda \to {\operatorname{Shv}}({{\mathcal C}})_\#$ of this bifibration can also be described as the full subcategory ${\operatorname{Shv}}({{\mathcal C}}_\#) \subset {\operatorname{Fun}}({{\mathcal C}}^{opp}_\#,k)$ spanned by those functors $E_\#:{{\mathcal C}}^{opp}_\# \to k{\operatorname{\it\!-Vect}}$ whose restriction to $({{\mathcal C}}^{opp})^n
\subset {{\mathcal C}}^{opp}_\#$ is a sheaf – that is, an object in ${\operatorname{Shv}}({{\mathcal C}}^n)
\subset {\operatorname{Fun}}(({{\mathcal C}}^{opp})^n,k)$. Since the transition functors $(f_!)_!$ are right-exact, ${\operatorname{Shv}}({{\mathcal C}}_\#)$ is an abelian category (this is proved in exactly the same way as Lemma \[sec.ab\]).
We denote by ${\operatorname{Shv}}_{cart}({{\mathcal C}}_\#) \subset {\operatorname{Shv}}({{\mathcal C}}_\#)$ the full subcategory of sections $E:\Lambda \to {\operatorname{Shv}}({{\mathcal C}})_\#$ which are cocartesian, and moreover, are such that $E([1]) \in {\operatorname{Shv}}({{\mathcal C}})$ actually lies in the Yoneda image ${{\mathcal C}}\subset {\operatorname{Shv}}({{\mathcal C}})$. We also denote by ${{\mathcal D}}\Lambda({{\mathcal C}}) \subset {{\mathcal D}}({\operatorname{Shv}}({{\mathcal C}}_\#))$ the full triangulated subcategory of complexes $E^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}_\# \in
{{\mathcal D}}({\operatorname{Shv}}({{\mathcal C}}_\#))$ with homology in ${\operatorname{Shv}}_{cart}({{\mathcal C}}_\#)$.
If ${{\mathcal C}}$ is the category of $A$-bimodules for some algebra $A$ – or better yet, of $A$-bimodules of cardinality not more than that of $A
\times {{\mathbb N}}$, so that ${{\mathcal C}}$ is small – then ${\operatorname{Shv}}({{\mathcal C}})$ is equivalent to $A{\operatorname{\!-\sf bimod}}$ (one shows easily that every sheaf $E \in {\operatorname{Shv}}({{\mathcal C}})$ is completely determined by its value at $A^{opp} \otimes A \in
{{\mathcal C}}$). In this case, ${{\mathcal D}}\Lambda({{\mathcal C}})$ is our old category ${{\mathcal D}}\Lambda(A{\operatorname{\!-\sf bimod}})$.
Now, we assume that ${{\mathcal C}}$ is equipped with a right-exact trace functor ${\operatorname{\sf tr}}:{{\mathcal C}}\to k{\operatorname{\it\!-Vect}}$, we would like to define cyclic homology $HC_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(M_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}})$ for any $M_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}\in {{\mathcal D}}\Lambda({{\mathcal C}})$, and we immediately notice a problem: for a general ${{\mathcal C}}$, we do not have a forgetful functor to vector spaces. However, it turns out that the forgetful functor [*is not needed*]{} for the definition – it can be replaced with the trace functor ${\operatorname{\sf tr}}$.
We proceed as follows. By definition, ${\operatorname{\sf tr}}$ is extended to a functor ${{\mathcal C}}_\# \to k{\operatorname{\it\!-Vect}}$; we extend it canonically to a functor ${\operatorname{Shv}}({{\mathcal C}})_\# \to k{\operatorname{\it\!-Vect}}$, and consider the product $${\operatorname{\sf tr}}\times \tau: {\operatorname{Shv}}({{\mathcal C}})_\# \to k{\operatorname{\it\!-Vect}}\times \Lambda,$$ where $\tau:{\operatorname{Shv}}({{\mathcal C}})_\# \to \Lambda$ is the projection. This is a functor compatible with the projections to $\Lambda$, and therefore, it induces a functor of the categories of sections. The category of sections of the projection $k{\operatorname{\it\!-Vect}}\times \Lambda \to \Lambda$ is tautologically the same as ${\operatorname{Fun}}(\Lambda,k{\operatorname{\it\!-Vect}})$, so that we have a functor $${\operatorname{\sf tr}}_\#:{\operatorname{Shv}}({{\mathcal C}}_\#) \to {\operatorname{Fun}}(\Lambda,k).$$ One checks easily that this functor is right-exact.
\[cycl.def.gen\] For any $M_\# \in {\operatorname{\sf Sec}}({{\mathcal C}}_\#)$, its cyclic homology $HC_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(M_\#)$ is defined by $$HC_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(M_\#) {\overset{\text{\sf\tiny def}}{=}}HC_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(L^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}{\operatorname{\sf tr}}_\#(M_\#)) =
H_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(\Lambda,L^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}{\operatorname{\sf tr}}_\#(M_\#)).$$
\[clean\] The pair $\langle {{\mathcal C}},{\operatorname{\sf tr}}\rangle$ is called [*homologically clean*]{} if for any $n$, the category ${\operatorname{Shv}}({{\mathcal C}}^n)$ has enough objects $E$ such that
1. $E$ is acyclic both for functors $(f_!)_!:{\operatorname{Shv}}({{\mathcal C}}^n) \to
{\operatorname{Shv}}({{\mathcal C}}^{n'})$, for any $f:[n] \to [n']$, and for the trace functor ${\operatorname{\sf tr}}:{\operatorname{Shv}}({{\mathcal C}}^n) \to k{\operatorname{\it\!-Vect}}$, and
2. for any $f:[n] \to [n']$, $(f_!)_!E \in {\operatorname{Shv}}({{\mathcal C}}^{n'})$ is acyclic for ${\operatorname{\sf tr}}:{\operatorname{Shv}}({{\mathcal C}}^{n'}) \to k{\operatorname{\it\!-Vect}}$.
\[cln.exa\] Assume that the category ${{\mathcal C}}$ has enough projectives, and moreover, $P_1 \otimes P_2$ is projective for any projective $P_1,P_2 \in {{\mathcal C}}$ (this is satisfied, for instance, for ${{\mathcal C}}=A{\operatorname{\!-\sf bimod}}$). Then the pair $\langle {{\mathcal C}},{\operatorname{\sf tr}}\rangle$ is homologically clean, for any trace functor ${\operatorname{\sf tr}}$. Indeed, ${\operatorname{Shv}}({{\mathcal C}}^n)$ then also has enough projectives, say sums of objects $$\label{box}
P = P_1 \boxtimes P_2 \boxtimes \dots \boxtimes P_n \in {\operatorname{Shv}}({{\mathcal C}}^n)$$ for projective $P_1,\dots,P_n \in {{\mathcal C}}\subset {\operatorname{Shv}}({{\mathcal C}})$, and these projectives automatically satisfy the condition . To check , one decomposes $f:[n] \to [n']$ into a surjection $p:[n] \to [n'']$ and an injection $i:[n''] \to [n']$. Since the tensor product of projective objects is projective, $(p_!)_!(P) \in
{\operatorname{Shv}}({{\mathcal C}}^{n''})$ is also an object of the type , so we may as well assume that $f$ is injective. Then one can find a left-inverse map $f':[n'] \to [n]$, $f' \circ f = {\operatorname{\sf id}}$; since $P'=(f_!)_!(P)$ is obviously acyclic for $(f'_!)_!$, and $(f'_!)_!(P') = ((f' \circ f)_!)_!(P) = P$ is acyclic for ${\operatorname{\sf tr}}$, $P'$ itself is acyclic for ${\operatorname{\sf tr}}= {\operatorname{\sf tr}}\circ (f'_!)_!$.
\[b.ch\] Assume that $\langle {{\mathcal C}},{\operatorname{\sf tr}}\rangle$ is homologically clean. Then for any object $[n] \in \Lambda$ and any $M_\# \in {\operatorname{Shv}}({{\mathcal C}}_\#)$, we have $$\label{equa}
L^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}{\operatorname{\sf tr}}_\#(M_\#)([n]) \cong L^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}{\operatorname{\sf tr}}(M_\#([n])).$$ For any $M_\#^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}\in {{\mathcal D}}\Lambda({{\mathcal C}})$, we have $L^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}{\operatorname{\sf tr}}_\#(M_\#)
\in {{\mathcal D}}_{const}(\Lambda,k) \subset {{\mathcal D}}(\Lambda,k)$.
[[*Proof.*]{}]{} The natural restriction functor ${\operatorname{Shv}}({{\mathcal C}}_\#) \to
{\operatorname{Shv}}({{\mathcal C}}^n)$, $M_\# \mapsto M_\#([m])$ has a left-adjoint functor $I_{n!}:{\operatorname{Shv}}({{\mathcal C}}^n) \to {\operatorname{Shv}}({{\mathcal C}}_\#)$; explicitly, it is given by $$\label{ind}
I_{n!}(E)([n']) = \bigoplus_{f:[n] \to [n']}(f_!)_!(E).$$ Let us say that an object $E \in {\operatorname{Shv}}({{\mathcal C}}^n)$ is admissible if it satisfies the conditions , of Definition \[clean\]. By assumption, ${\operatorname{Shv}}({{\mathcal C}}^n)$ has enough admissible objects for any $n$. Then ${\operatorname{Shv}}({{\mathcal C}}_\#)$ has enough objects of the form $I_{n!}E$, $[n] \in \Lambda$, $E \in {\operatorname{Shv}}({{\mathcal C}}^n)$ admissible, and to prove the first claim, it suffices to consider $M_\#=I_{n!}E$ of this form. In degree $0$, is the definition of the functor ${\operatorname{\sf tr}}_\#$, and the higher degree terms in the right-hand side vanish by Definition \[clean\] . Therefore it suffices to prove that $M_\#=I_{n!}E$ is acyclic for the functor ${\operatorname{\sf tr}}_\#$. This is obvious: applying ${\operatorname{\sf tr}}_\#$ to any short exact sequence $$\begin{CD}
0 @>>> M'_\# @>>> M''_\# @>>> M_\# @>>> 0
\end{CD}$$ in ${\operatorname{Shv}}({{\mathcal C}}_\#)$, we see that, since $M_\#([n'])$ is acyclic for any $[n'] \in \Lambda$, the sequence $$\begin{CD}
0 @>>> {\operatorname{\sf tr}}M'_\#([n']) @>>> {\operatorname{\sf tr}}M''_\# ([n']) @>>> {\operatorname{\sf tr}}M_\# ([n']) @>>> 0
\end{CD}$$ is exact; this means that $$\begin{CD}
0 @>>> {\operatorname{\sf tr}}M'_\# @>>> {\operatorname{\sf tr}}M''_\# @>>> {\operatorname{\sf tr}}M_\# @>>> 0
\end{CD}$$ is an exact sequence in ${\operatorname{Fun}}(\Lambda,k)$, and this means that $M_\#$ is indeed acyclic for ${\operatorname{\sf tr}}_\#$.
With the first claim proved, the second amounts to showing that the natural map $$L^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}{\operatorname{\sf tr}}\circ L^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}(f_!)_!(E) \to L^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}{\operatorname{\sf tr}}(E)$$ is a quasiismorphism for any $f:[n] \to [n']$ and any $E \in
{\operatorname{Shv}}({{\mathcal C}}^n)$. It suffices to prove it for admissible $M$; then the higher derived functors vanish, and the isomorphism ${\operatorname{\sf tr}}\circ
(f_!)_! \cong {\operatorname{\sf tr}}$ is Definition \[trace.defn\].
In the assumptions of Lemma \[b.ch\], for any complex $M^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}_\#
\in {{\mathcal D}}\Lambda({{\mathcal C}})$ with the first component $M^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}=
M^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}_\#([1])$ we have $$HH_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(M^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}) \cong HH_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(L^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}{\operatorname{\sf tr}}_\#(M^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}_\#)).$$
[[*Proof.*]{}]{} By Lemma \[b.ch\], the left-hand side, $HH_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(M^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}})$, is canonically isomorphic to the complex $L^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}{\operatorname{\sf tr}}_\#(M^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}_\#) \in {{\mathcal D}}(\Lambda,k)$ evaluated at $[1] \in
\Lambda$, and moreover, $L^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}{\operatorname{\sf tr}}_\#(M^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}_\#)$ lies in the subcategory ${{\mathcal D}}_{const}(\Lambda,k) \subset {{\mathcal D}}(\Lambda,k)$. It remains to apply the general fact: for any $E^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}\in
{{\mathcal D}}_{const}(\Lambda,k)$, we have a natural isomorphism $HH_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(E^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}) \cong E^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}([1])$. Indeed, by definition we have $$HH_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(E^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}) = H_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(\Delta^{opp},j^*E^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}),$$ and $j^*E^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}$ lies in the category ${{\mathcal D}}_{const}(\Delta^{opp},k)$ which is equivalent to ${{\mathcal D}}(k{\operatorname{\it\!-Vect}})$ (see Example \[const.exa\], and also Remark \[const.rem\]: the isomorphism we constructed here is a special case of for $n=1$).
The Lemma shows that if the pair $\langle {{\mathcal C}},{\operatorname{\sf tr}}\rangle$ is homologically clean, Definition \[cycl.def.gen\] is consistent with , and we get the whole periodicity package of – the periodicity map $u$, the Connes’ exact sequence $$\begin{CD}
HH_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(M^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}) @>>> HC_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(M^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}) @>{u}>> HC_{{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}-2}(M^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}) @>>>,
\end{CD}$$ and the periodic cyclic homology $HP_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(M^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}})$.
In general, objects in ${{\mathcal D}}\Lambda({{\mathcal C}})$ may be hard to construct, but we always have at least one – the identity section ${\operatorname{{\sf I}}}_\#:\Lambda
\to {\operatorname{Shv}}({{\mathcal C}})_\#$, given by $${\operatorname{{\sf I}}}_\#([n]) = {\operatorname{{\sf I}}}^{\boxtimes n} \in {{\mathcal C}}^{\otimes n},$$ where ${\operatorname{{\sf I}}}\in {{\mathcal C}}$ is the unit object. Thus we can define cyclic homology of a tensor category equipped with a trace functor.
\[cycl.cat\] For any $k$-linear abelian unital tensor category ${{\mathcal C}}$ equipped with a trace functor ${\operatorname{\sf tr}}:{{\mathcal C}}\to k{\operatorname{\it\!-Vect}}$, its Hochschild and cyclic homology is given by $$HH_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}({{\mathcal C}},{\operatorname{\sf tr}}) {\overset{\text{\sf\tiny def}}{=}}HH_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}({\operatorname{{\sf I}}}), \qquad
HC_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}({{\mathcal C}},{\operatorname{\sf tr}}) {\overset{\text{\sf\tiny def}}{=}}HC_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}({\operatorname{{\sf I}}}_\#),$$ where ${\operatorname{{\sf I}}}\in {{\mathcal C}}$ is the unit object, and ${\operatorname{{\sf I}}}_\# \in {{\mathcal D}}\Lambda({{\mathcal C}})$ is the identity section.
We now have to check that in the case ${{\mathcal C}}= A{\operatorname{\!-\sf bimod}}$, Definition \[cycl.def.gen\] is compatible with our earlier Definition \[cycl.def\] – in other words, that the cyclic homology computed by means of the forgetfull functor is the same as the cyclic homology computed by means of the trace. This is not at all trivial. Indeed, if for instance $M_\# \in {\operatorname{Shv}}({{\mathcal C}}_\#)$ is cocartesian, then, while $L^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}{\operatorname{\sf tr}}^\#M_\#$ lies in the subcategory ${{\mathcal D}}_{const}(\Lambda,k) \subset {{\mathcal D}}(\Lambda,k)$, the same is certainly not true for the object $M_\# \in {\operatorname{Fun}}(\Lambda,k)$ obtained by forgetting the bimodule structure on $M_n$.
Thus these two objects are different. However, they do become equal after taking cyclic (or Hochschild, or periodic cyclic) homology. Namely, for any $M_\# \in {\operatorname{\sf Sec}}(A{\operatorname{\!-\sf bimod}}_\#)$ we have a natural map $$\label{natu}
M_\# \to L^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}{\operatorname{\sf tr}}^\#M_\#$$ in the derived category ${{\mathcal D}}(\Lambda,k)$, and we have the following result.
\[main\] For every $M_\# \in {\operatorname{\sf Sec}}(A{\operatorname{\!-\sf bimod}}_\#)$, the natural map induces isomorphisms $$\begin{aligned}
HH_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(M_\#) &\cong HH_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(L^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}{\operatorname{\sf tr}}M_\#),\\
HC_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(M_\#) &\cong HC_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(L^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}{\operatorname{\sf tr}}M_\#),\\
HP_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(M_\#) &\cong HP_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(L^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}{\operatorname{\sf tr}}M_\#).\end{aligned}$$
[[*Proof.*]{}]{} By , it suffices to consider $HC_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(-)$; as in the proof of Lemma \[b.ch\], it suffices to consider $M_\# =
I_{n!}E$ given in , with $E$ being the free bimodule $$E = (A^{opp} \otimes A)^{\otimes n} \in {\operatorname{Shv}}({{\mathcal C}}^n) = A^{\otimes
n}{\operatorname{\!-\sf bimod}}$$ for some fixed $n$. Explicitly, we have $$\label{ind.2}
I_{n!}E([n']) = \bigoplus_{f:[n] \to [n']}\bigotimes_{v' \in V([n'])}
A^{opp} \otimes A^{\otimes f^{-1}(v')}$$ for any $[n'] \in \Lambda$. Then $L^p{\operatorname{\sf tr}}_\#I_{n!}E = 0$ for $p \geq 1$, and one checks easily that $${\operatorname{\sf tr}}_\# I_{n!}E = i_{n!}{\operatorname{\sf tr}}E = i_{n!}A^{\otimes n} \in {\operatorname{Fun}}(\Lambda,k),$$ where $i_n:{\operatorname{{\sf pt}}}\to \Lambda$ is the embedding of the object $[n] \in
\Lambda$ (${\operatorname{{\sf pt}}}$ is the category with one object and one morphism). Therefore $$HC_0(L^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}{\operatorname{\sf tr}}_\#I_{n!}E) = H_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(\Lambda,i_{n!}A^{\otimes n}) =
A^{\otimes n},$$ and $HC_p(L^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}{\operatorname{\sf tr}}_\#i_{n!}E) = 0$ for $p \geq 1$. We have to compare it with $HC_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(i_{n!}E)$.
To do this, consider the category $\Lambda_{[n]}$ of objects $[n']
\in \Lambda$ equipped with a map $[n] \to [n']$, and let $j_n:\Lambda_{[n]} \to \Lambda$ be the forgetful functor. Then $j_n$ is obviously a discrete cofibration. Comparing and , we see that $$I_{n!}E = j_{n!}E_\#^{[n]}$$ for some $E_\#^{[n]} \in {\operatorname{Fun}}(\Lambda_{[n]})$. Moreover, fix once and for all a map $[1] \to [n]$. Then we see that the discrete cofibration $j_n:\Lambda_{[n]} \to \Lambda$ factors through the discrete cofibration $j:\Lambda_{[1]} = \Delta^{opp} \to \Lambda$ by means of a discrete cobifbration $\gamma_n:\Lambda_{[n]} \to
\Lambda_{[1]}$, and we observe that $$E^{[n]}_\#([n']) = (A^{opp})^{\otimes n'} \otimes A^{\otimes n}$$ only depends on $\gamma_n([n']) \in \Delta^{opp}$. More precisely, we have $E^{[n]}_\# = \gamma^*_nE_n^{\Delta}$, where $E_n^{\Delta}
\in {\operatorname{Fun}}(\Delta^{opp},k)$ is as in , and $E_n$ is the free $A$-bimodule $$E_n = A^{opp} \otimes A^{\otimes (n-1)} \otimes A.$$ The conclusion: we have $$HC_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(I_{n!}E) = H_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(\Lambda_{[n]},E^{[n]}_\#)
= H_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(\Delta^{opp},\gamma_{n!}\gamma^*_nE_n^{\Delta}) =
H_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(\Delta^{opp},E_n^{\Delta} \otimes \gamma_{n!}k),$$ where we have used the projection formula in the right-hand side. The homology of the category $\Delta^{opp}$ can be computed by the standard complex; then by the Künneth formula, the right-hand side is isomorphic to $$H_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(\Delta^{opp},E_n^{\Delta}) \otimes
H_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(\Delta^{opp},\gamma_{n!}k)
\cong H_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(\Delta^{opp},E_n^{\Delta}) \otimes
H_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(\Lambda_{[n]},k).$$ By Lemma \[hoch\], $$H_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(\Delta^{opp},E_n^{\Delta}) \cong HH_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(A,E_n) \cong
A^{\otimes n}.$$ Since the category $\Lambda_{[n]}$ has an initial object $[n] \in
\Lambda_{[n]}$, we have $k = i_{n!k}$, so that the second multiple $H_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(\Lambda_{[n]},k)$ is just $k$ in degree $0$.
The essential point of Proposition \[main\] is the following: the cyclic object $A_\#$ associated to an algebra $A$ inconveniently contains two things at the same time – the cyclic structure, which seems to be essential to the problem, and the bar resolution, which is needed only to compute the Hochschild homology $HH_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(A)$. Replacing $A_\#$ with the cyclic complex $L^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}{\operatorname{\sf tr}}_\#A_\# \in {{\mathcal D}}(\Lambda,k)$ disentagles these two.
We note that while one still has to prove that this does not change the final answer, the construction itself looks pretty straightforward – if one wants to remove the non-essential bar resolution from the definition of the cyclic homology, Definition \[cycl.cat\] seems to be the obvious thing to try. However, it was actually arrived at by a sort of a reverse engeneering process. To finish the section, perhaps it would be useful to show the reader the first stage of this process.
Assume given an associative algebra $A$, and fix a projective resolution $P_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}$ of the diagonal $A$-module $A$. Then $HH_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(A,M)$ can be computed by the complex $${\operatorname{\sf tr}}(P_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}) = P_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}\otimes_{A^{opp} \otimes A} A.$$ How can one see the cyclic homology in terms of this complex? Or even simpler – what is the first differential in the spectral sequence , the Connes’ differential $B:HH_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(A)
\to HH_{{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}+1}(A)$?
There is the following recepy which gives the answer. Let $\tau:P_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}\to A$ be the augmentation map. Consider the tensor product $P_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}\otimes_A P_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}$. This is also a projective resotuion of $A$, and we actually have [*two*]{} natural quasiisomorphisms $$\tau_1,\tau_2:P_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}\otimes_A P_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}\to P_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}},$$ given by $\tau_1 = \tau \otimes {\operatorname{\sf id}}$, $\tau_2 = {\operatorname{\sf id}}\otimes
\tau$. These quasiisomorphisms are different. However, since both are maps between projective resolutions of the same object, there should be a chain homotopy between them. Fix such a homotopy $\iota:P_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}\otimes_A P_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}\to P_{{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}+1}$.
Now we apply the trace functor ${\operatorname{\sf tr}}$, and obtain two maps $\tau_1,\tau_2:{\operatorname{\sf tr}}(P_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}\otimes P_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}) \to {\operatorname{\sf tr}}(P_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}})$, and a homotopy $\iota:{\operatorname{\sf tr}}(P_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}\otimes P_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}) \to {\operatorname{\sf tr}}(P_{{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}+1})$ between them.
However, by the trace property of $\tau$, we also have an involution $\sigma:{\operatorname{\sf tr}}(P_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}\otimes_A P_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}})$ which interchanges the two multiples. This involution obviously also interchages $\tau_1$ and $\tau_2$, but there is no reason why it should fix the homotopy $\iota$ – in fact, it sends $\iota$ to a second homotopy $\iota':{\operatorname{\sf tr}}(P_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}\otimes_A P_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}) \to
{\operatorname{\sf tr}}(P_{{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}+1})$ between $\tau_1$ and $\tau_2$.
The difference $\iota' - \iota$ is then a well-defined map of complexes $$\label{homo}
\iota'-\iota:{\operatorname{\sf tr}}(P_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}\otimes_A P_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}) \to {\operatorname{\sf tr}}(P_{{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}+1}).$$ On the level of homology, both sides are $HH_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(A)$; the map $\iota'-\iota$ then induces exactly the Connes’ differential $B:HH_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(A) \to HH_{{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}+1}(A)$.
To justify this recepy, we use Proposition \[main\] and identify $HC_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(A)$ with $HC_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(L^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}{\operatorname{\sf tr}}_\#(A_\#))$ rather than $HC_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(A_\#)$. Then $L^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}{\operatorname{\sf tr}}_\#(A_\#)$ is an object in ${{\mathcal D}}_{const}(\Lambda,k)$. Therefore, as noted in Remark \[const.rem\], the Connes’ differential $B$ only depends on the restriction of $L^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}{\operatorname{\sf tr}}_\#(A_\#)$ to $\Lambda_{\leq 2}
\subset \Lambda$. In other words, we do not need to compute the full $L^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}{\operatorname{\sf tr}}_\#(A_\#)$ and to construct a full resolution $P^\#_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}$ of the cyclic $A$-bimodule $A_\#$; it suffices to construct $P^i_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}= P^\#_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}([i])$ for $i=1,2$ (and then apply the functor ${\operatorname{\sf tr}}$).
With the choices made above, we set $P^1_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}= P_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}$, and we let $P^2_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}$ be the cone of the map $$\begin{CD}
P_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}\boxtimes P_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}@>{(\tau \boxtimes {\operatorname{\sf id}})\oplus({\operatorname{\sf id}}\boxtimes \tau)}>> (A \boxtimes P_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}})\oplus(P_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}\boxtimes
A).
\end{CD}$$ The involution $\sigma:[2] \to [2]$ acts on $P^2_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}$ in the obvious way. We also need to define the transition maps $\iota_f$ for the two injections $d,d':[1] \to [2]$ and the two surjections $s,s':[2] \to [1]$. For $d_1$, the transition map $\iota_d:A
\boxtimes P_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}\to P^2_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}$ is the obvious embedding, and so is the transition map $\iota_{d'}$. For the surjection $s$, we need a map $\iota_s$ from the cone of the map $$\begin{CD}
P_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}\otimes_A P_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}@>{(\tau \otimes {\operatorname{\sf id}})\oplus({\operatorname{\sf id}}\otimes \tau)}>> P_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}\oplus P_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}\end{CD}$$ to $P_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}$. On $P_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}\oplus P_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}$, the map $\iota_s$ is just the difference map $a \oplus b \mapsto a - b$; on $P_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}\otimes_AP_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}$, $\iota_s$ is our fixed homotopy $\iota:P_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}\otimes_AP_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}\to P_{{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}+1}$. And similarly for the other surjection $s'$.
We leave it to the reader to check that if one computes $L^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}{\operatorname{\sf tr}}_\#(A_\#)\mid_{\Lambda_{\leq 2}}$ using this resolution $P^\#_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}$, then one obtains exactly for the Connes’ differential $B$.
Discussion
==========
One of the most unpleasant features of the construction presented in Section \[cat\] is the strong assumptions we need to impose on the tensor category ${{\mathcal C}}$. In fact, the category one would really like to apply the construction to is the category ${\operatorname{End}}{{\mathcal B}}$ of endofunctors – whatever that means – of the category ${{\mathcal B}}$ of coherent sheaves on an algebraic variety $X$. But if $X$ is not affine, ${\operatorname{End}}{{\mathcal B}}$ certainly does not have enough projectives, so that Example \[cln.exa\] does not apply, and it is unlikely that ${\operatorname{End}}{{\mathcal B}}$ can be made homologically clean in the sense of Definition \[clean\]. We note that Definition \[clean\] has been arranged so as not impose anything more than strictly necessary for the proofs; but in practice, we do not know any examples which are not covered by Example \[cln.exa\].
As for the category ${\operatorname{End}}{{\mathcal B}}$, there is an even bigger problem with it: while there are ways to define endofunctors so that ${\operatorname{End}}{{\mathcal B}}$ is an abelian category with a right-exact tensor product, it cannot be equipped with a right-exact trace functor ${\operatorname{\sf tr}}$. Indeed, it immediately follows from Definition \[cycl.cat\] that the Hochschild homology groups $HH_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}({{\mathcal C}})$ of a tensor category ${{\mathcal C}}$ are trivial in negative homological degrees. If ${{\mathcal C}}= {\operatorname{End}}{{\mathcal B}}$, one of course expects $HH_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}({{\mathcal C}}) = HH_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(X)$, the Hochschild homology $HH_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(X)$ of the variety $X$, which by now is well-understood (see e.g. [@w]). And if $X$ is not affine, $HH_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(X)$ typically is non-trivial both in positive and in negative degrees. If $X$ is smooth and proper, $HH_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(X)$ in fact carries a non-degenerate pairing, so that it is just as non-trivial in degrees $>0$ as in degrees $<0$. Thus the case of a non-affine algebraic variety is far beyond the methods developed in this paper.
The real reason for these difficulties is that we are dealing with abelian categories, while the theory emphatically wants to live in the triangulated world; as we explained in Example \[const.exa\], even our main topic, cyclic bimodules, are best understood as objects of a triangulated category ${{\mathcal D}}\Lambda({{\mathcal C}})$. Unfortunately, we cannot develop the theory from scratch in the triangulated context, since we do not have a strong and natural enough notion of an enhanced triangulated category (and working with the usual triangulated categories is out of the question because, for instance, the category of triangulated functors between triangulated categories is usually not a triangulated category itself). A well-developed theory would probably require a certain compromise between the abelian and the triangulated approach. We will return to it elsewhere.
Another thing which is very conspicously not done in the present paper is the combination of Section \[cat\] and Section \[getz\]. Indeed, in Section \[getz\], we are dealing with cyclic homology in the straightforward naive way of Section \[naive\], and while we define the cyclic object ${\widehat}{A_\#}$ associated to a square-zero extension ${\widetilde}{A}$, we make no attempt to find an appropriate category ${\widehat}{{\operatorname{\sf Sec}}(A{\operatorname{\!-\sf bimod}}_\#)}$ where it should live. This is essentially the reason why we cannot go further than square-zero extensions. At present, sadly, we do not really understand this hypothetical category ${\widehat}{{\operatorname{\sf Sec}}(A{\operatorname{\!-\sf bimod}}_\#)}$.
One suspects that treating this properly would require studying deformations in a much more general context – instead of considering square-zero extensions of an algebra, we should look at the deformations of the abelian category of its modules, or at the deformations of the tensor category of its bimodules. This brings us to another topic completely untouched in the paper: the Hochschild cohomology $HH^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}(A)$.
Merely [*defining*]{} Hochschild cohomology for an arbitrary tensor category ${{\mathcal C}}$ is in fact much simpler than the definition of $HH_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}({{\mathcal C}})$, and one does not need a trace functor for this – we just set $HH^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}({{\mathcal C}})={\operatorname{Ext}}^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}({\operatorname{{\sf I}}},{\operatorname{{\sf I}}})$, where ${\operatorname{{\sf I}}}\in {{\mathcal C}}$ is the unit object. However, it is well understood by now that just as Hochschild homology always comes equipped with the Connes’ differential, the spectral sequence , and the whole cyclic homology package, Hochschild cohomology should be considered not as an algebra but as the so-called [*Gerstenhaber*]{} algebra; in fact, the pair $HH_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(-),HH^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}(-)$ should form a version of “non-commutative calculus”, as proposed for instance in [@TT]. Deformations of the tensor category ${{\mathcal C}}$ should be controlled by $HH^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}({{\mathcal C}})$, and the behaviour of $HH_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}({{\mathcal C}})$ and $HC_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}({{\mathcal C}})$ under these deformations reflects various natural actions of $HH^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}(-)$ on $HH_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}(-)$.
We believe that a convenient development of the “non-commutative calculus” for a tensor category ${{\mathcal C}}$ might be possible along the same lines as our Section \[cat\]. Just as our category ${{\mathcal D}}\Lambda({{\mathcal C}})$ is defined as the category of sections of the cofibration ${{\mathcal C}}_\#/\Lambda$, whose definition imitates the usual cyclic object $A_\#$, one can construct a cofibration ${{\mathcal C}}^\#/\Delta$ which imitates the standard cosimplicial object computing $HH^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}(A)$ – for any $[n] \in \Delta$, ${{\mathcal C}}^\#([n])$ is the category of polylinear right-exact functors from ${{\mathcal C}}^{n-1}$ to ${{\mathcal C}}$, and the transition functors between various ${{\mathcal C}}^\#([n])$ are induced by the tensor product on ${{\mathcal C}}$. Then one can define a triangulated category ${{\mathcal D}}\Delta({{\mathcal C}})$, the subcategory in ${{\mathcal D}}({\operatorname{\sf Sec}}({{\mathcal C}}^\#))$ of complexes with cocartesian homology; the higher structures on $HH^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}({{\mathcal C}})$ should be encoded in the structure of the category ${{\mathcal D}}\Delta({{\mathcal C}})$, and relations between $HH_{{\:\raisebox{1pt}{\text{\circle*{1.5}}}}}({{\mathcal C}})$ and $HH^{{\:\raisebox{3pt}{\text{\circle*{1.5}}}}}({{\mathcal C}})$ should be reflected in a relation between ${{\mathcal D}}\Lambda({{\mathcal C}})$ and ${{\mathcal D}}\Delta({{\mathcal C}})$. We will proceed in this direction elsewhere. At present, the best we can do is to make the following hopeful observation:
- the category ${\operatorname{\sf Sec}}_{cart}({{\mathcal C}}^\#)$ is naturally a [*braided*]{} tensor category over $k$.
The reason for this is very simple: if one writes out explicitly the definition of ${\operatorname{\sf Sec}}_{cart}({{\mathcal C}}^{\#})$ along the lines of Lemma \[cycl.str\], one finds out that it coincides on the nose with the Drinfeld double of the tensor category ${{\mathcal C}}$.
[GM2]{}
I. Bucur and A. Deleanu, [*Introduction to the theory of categories and functors*]{}, Interscience Publication John Wiley & Sons, Ltd., London-New York-Sydney 1968.
A. Connes, [*Non-commutative differential geometry, I, II*]{}, preprint IHES oct. 1982, may 1983.
A. Connes, [*Cohomologie cyclique et foncteur ${\operatorname{Ext}}^n$*]{}, Comptes Rendues Ac. Sci. Paris Sér. A-B, [**296**]{} (1983), 953–958.
B. Feigin and B. Tsygan, [*Additive $K$-Theory*]{}, in Lecture Notes in Math. [**1289**]{} (1987), 97–209.
S. Gelfand and Yu. Manin, [*Methods of homological algebra*]{}, Nauka Publishers, Moscow, 1988 (in Russian).
S. Gelfand and Yu. Manin, [*Homological algebra*]{}, Itogi vol. 38 (Algebra V), VINITI, Moscow, 1989 (in Russian).
E. Getzler, [*Cartan homotopy formulas and the Gauss-Manin connection in cyclic homology*]{}, in [*Quantum deformations of algebras and their representations (Ramat-Gan, 1991/1992; Rehovot, 1991/1992)*]{}, Israel Math. Conf. Proc. [**7**]{}, Bar-Ilan Univ., Ramat Gan, 1993, 65–78.
Th. Goodwillie, [*Cyclic homology, derivations, and the free loopspace*]{}, Topology [**24**]{} (1985), 187–215.
A. Grothendieck, [*Expose VI: Catégories fibré et descente*]{}, in [*SGAI: Revétements étales et groupe fondamental*]{}, Lecture Notes in Math., [**224**]{}, Springer, Berlin; 145–194.
D. Kaledin, [*Non-commutative Hodge-to-de Rham degeneration via the method of Deligne-Illusie*]{}, math.KT/0611623.
J.-L. Loday, [*Cyclic Homology*]{}, second ed., Springer, 1998.
D. Tamarkin and B. Tsygan, [*The ring of differential operators on forms in noncommutative calculus*]{}, in [*Graphs and patterns in mathematics and theoretical physics*]{}. Proc. Sympos. Pure Math. [**73**]{}, AMS, Providence, RI, 2005; 105–131.
B. Tsygan, [*Homology of Lie algebras over rings and Hochshild homology*]{}, Uspekhi Mat. Nauk, [**38**]{} (1983), 217–218.
C. Weibel, [*Cyclic homology for schemes*]{}, Proc. AMS [**124**]{} (1996), 1655-1662.
[Steklov Math Institute\
Moscow, USSR]{}
[*E-mail address*]{}: [kaledin@mccme.ru]{}
[^1]: Partially supported by CRDF grant RUM1-2694-MO05.
|
{
"pile_set_name": "ArXiv"
}
|
package org.bouncycastle.crypto.generators;
import org.bouncycastle.crypto.CipherParameters;
import org.bouncycastle.crypto.Mac;
import org.bouncycastle.crypto.PBEParametersGenerator;
import org.bouncycastle.crypto.digests.SHA1Digest;
import org.bouncycastle.crypto.macs.HMac;
import org.bouncycastle.crypto.params.KeyParameter;
import org.bouncycastle.crypto.params.ParametersWithIV;
/**
* Generator for PBE derived keys and ivs as defined by PKCS 5 V2.0 Scheme 2.
* This generator uses a SHA-1 HMac as the calculation function.
* <p>
* The document this implementation is based on can be found at
* <a href=http://www.rsasecurity.com/rsalabs/pkcs/pkcs-5/index.html>
* RSA's PKCS5 Page</a>
*/
public class PKCS5S2ParametersGenerator
extends PBEParametersGenerator
{
private Mac hMac = new HMac(new SHA1Digest());
/**
* construct a PKCS5 Scheme 2 Parameters generator.
*/
public PKCS5S2ParametersGenerator()
{
}
private void F(
byte[] P,
byte[] S,
int c,
byte[] iBuf,
byte[] out,
int outOff)
{
byte[] state = new byte[hMac.getMacSize()];
CipherParameters param = new KeyParameter(P);
hMac.init(param);
if (S != null)
{
hMac.update(S, 0, S.length);
}
hMac.update(iBuf, 0, iBuf.length);
hMac.doFinal(state, 0);
System.arraycopy(state, 0, out, outOff, state.length);
if (c == 0)
{
throw new IllegalArgumentException("iteration count must be at least 1.");
}
for (int count = 1; count < c; count++)
{
hMac.init(param);
hMac.update(state, 0, state.length);
hMac.doFinal(state, 0);
for (int j = 0; j != state.length; j++)
{
out[outOff + j] ^= state[j];
}
}
}
private void intToOctet(
byte[] buf,
int i)
{
buf[0] = (byte)(i >>> 24);
buf[1] = (byte)(i >>> 16);
buf[2] = (byte)(i >>> 8);
buf[3] = (byte)i;
}
private byte[] generateDerivedKey(
int dkLen)
{
int hLen = hMac.getMacSize();
int l = (dkLen + hLen - 1) / hLen;
byte[] iBuf = new byte[4];
byte[] out = new byte[l * hLen];
for (int i = 1; i <= l; i++)
{
intToOctet(iBuf, i);
F(password, salt, iterationCount, iBuf, out, (i - 1) * hLen);
}
return out;
}
/**
* Generate a key parameter derived from the password, salt, and iteration
* count we are currently initialised with.
*
* @param keySize the size of the key we want (in bits)
* @return a KeyParameter object.
*/
public CipherParameters generateDerivedParameters(
int keySize)
{
keySize = keySize / 8;
byte[] dKey = generateDerivedKey(keySize);
return new KeyParameter(dKey, 0, keySize);
}
/**
* Generate a key with initialisation vector parameter derived from
* the password, salt, and iteration count we are currently initialised
* with.
*
* @param keySize the size of the key we want (in bits)
* @param ivSize the size of the iv we want (in bits)
* @return a ParametersWithIV object.
*/
public CipherParameters generateDerivedParameters(
int keySize,
int ivSize)
{
keySize = keySize / 8;
ivSize = ivSize / 8;
byte[] dKey = generateDerivedKey(keySize + ivSize);
return new ParametersWithIV(new KeyParameter(dKey, 0, keySize), dKey, keySize, ivSize);
}
/**
* Generate a key parameter for use with a MAC derived from the password,
* salt, and iteration count we are currently initialised with.
*
* @param keySize the size of the key we want (in bits)
* @return a KeyParameter object.
*/
public CipherParameters generateDerivedMacParameters(
int keySize)
{
return generateDerivedParameters(keySize);
}
}
|
{
"pile_set_name": "Github"
}
|
Q:
show the sum of specific columns based on rhandsontable values
I am trying to create a shiny app, that would show a sum of a column (say mtcars$mpg) when rows are selected by the users. e.g if the first two boxes are clicked in rhandsontable, then below i should see a sum of 21 and 21. I am unable to wrap my head around it, and have made this code so far:
library(shiny)
library(rhandsontable)
ui=fluidPage(
rHandsontableOutput('table'),
textOutput ('selected')
)
server=function(input,output,session)({
df <- data.frame(head(transform(mtcars, Selected = as.logical(NA) )))
output$table=renderRHandsontable(
rhandsontable(df,selectCallback = TRUE,readOnly = FALSE)
)
output$selected<-renderText({
})
}) # end server
shinyApp(ui = ui, server = server)
is there any way to achieve this ?
A:
I found a way ! saving the rhandsontable as an r object first and then applying subset & aggregate function , then rendering the result as a table :
i can use reactive like this
tab1 <- reactive({
if(!is.null(input$table )) {
nt <- hot_to_r(input$table)
nt.1<- subset(nt, Selected == TRUE, select = c(mpg,gear))
nt.2 <- aggregate(nt.1$mpg ~ nt.1$gear , data = nt.1 , FUN = 'sum') }
})
:-)
|
{
"pile_set_name": "StackExchange"
}
|
The Use of Propensity Scores for Nonrandomized Designs With Clustered Data.
In this article we propose several modeling choices to extend propensity score analysis to clustered data. We describe different possible model specifications for estimation of the propensity score: single-level model, fixed effects model, and two random effects models. We also consider both conditioning within clusters and conditioning across clusters. We examine the underlying assumptions of these modeling choices and the type of randomized experiment approximated by each approach. Using a simulation study, we compare the relative performance of these modeling and conditioning choices in reducing bias due to confounding variables at both the person and cluster levels. An applied example based on a study by Hughes, Chen, Thoemmes, and Kwok (2010) is provided in which the effect of retention in Grade 1 on passing an achievement test in Grade 3 is evaluated. We find that models that consider the clustered nature of the data both in estimation of the propensity score and conditioning on the propensity score performed best in our simulation study; however, other modeling choices also performed well. The applied example illustrates practical limitations of these models when cluster sizes are small.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
Q:
Why does Ramanuja refer to the PAshupata sect as the sect of "Black faces"?
Ramanuja attributed this philosophy to the tradition of the Kalamukha(s), the sect of "Black Faces" to which Lakulisha belonged.
What was the reason for referring to it as KAlamukha?
What were RAmanuja's views on the KApAlika and Pasupata sects and their doctrines?
A:
Ramanujacharya does not call Pashupatas as Kalamukhas. In fact, he explicitly states that they are different Shaivite sects, in this section of his Sri Bhashya:
So far it has been shown that the doctrines of Kapila, Kanâda, Sugata, and the Arhat must be disregarded by men desirous of final beatitude; for those doctrines are all alike untenable and foreign to the Veda. The Sûtras now declare that, for the same reasons, the doctrine of Pasupati also has to be disregarded. The adherents of this view belong to four different classes--Kâpâlas, Kâlâmukhas, Pâsupatas, and Saivas. All of them hold fanciful theories of Reality which are in conflict with the Veda, and invent various means for attaining happiness in this life and the next. They maintain the general material cause and the operative cause to be distinct, and the latter cause to be constituted by Pasupati. They further hold the wearing of the six so-called 'mudrâ' badges and the like to be means to accomplish the highest end of man. Thus the Kâpâlas say, 'He who knows the true nature of the six mudrâs, who understands the highest mudrâ, meditating on himself as in the position called bhagâsana, reaches Nirvâna. The necklace, the golden ornament, the earring, the head-jewel, ashes, and the sacred thread are called the six mudrâs. He whose body is marked with these is not born here again.'--Similarly the Kâlâmukhas teach that the means for obtaining all desired results in this world as well as the next are constituted by certain practices--such as using a skull as a drinking vessel, smearing oneself with the ashes of a dead body, eating the flesh of such a body, carrying a heavy stick, setting up a liquor-jar and using it as a platform for making offerings to the gods, and the like. 'A bracelet made of Rudrâksha-seeds on the arm, matted hair on the head, a skull, smearing oneself with ashes, &c.'--all this is well known from the sacred writings of the Saivas. They also hold that by some special ceremonial performance men of different castes may become Brâhmanas and reach the highest âsrama: 'by merely entering on the initiatory ceremony (dîkshâ) a man becomes a Brâhmana at once; by undertaking the kâpâla rite a man becomes at once an ascetic.'
As far as how Ramanujacharya feels about Pashupatas, Kapalikas, and others, in this section of the Sri Bhashya he discusses how their beliefs and practices are criticized in the Brahma Sutras:
With regard to these views the Sûtra says 'of pati, on account of inappropriateness.' A 'not' has here to be supplied from Sûtra 32. The system of Pasupati has to be disregarded because it is inappropriate, i.e. because the different views and practices referred to are opposed to one another and in conflict with the Veda. The different practices enumerated above, the wearing of the six mudrâs and so on, are opposed to each other; and moreover the theoretical assumptions of those people, their forms of devotion and their practices, are in conflict with the Veda. For the Veda declares that Nârâyana who is the highest Brahman is alone the operative and the substantial cause of the world, 'Nârâyana is the highest Brahman, Nârâyana is the highest Reality, Nârâyana is the highest light, Nârâyana is the highest Self'; 'That thought, may I be many, may I grow forth' (Kh. Up. VI, 2, 3); 'He desired, may I be many, may I grow forth' (Taitt. Up. II, 6, 1), and so on. In the same way the texts declare meditation on the Supreme Person, who is the highest Brahman, to be the only meditation which effects final release; cp. 'I know that great Person of sunlike lustre beyond the darkness. A man who knows him passes over death; there is no other path to go' (Svet. Up. III, 8). And in the same way all texts agree in declaring that the works subserving the knowledge of Brahman are only those sacrificial and other works which the Veda enjoins on men in the different castes and stages of life: 'Him Brâhmanas seek to know by the study of the Veda, by sacrifice, by gifts, by penance, by fasting. Wishing for that world only, mendicants wander forth from their homes' (Bri. Up. XI, 4, 22). In some texts enjoining devout meditation, and so on, we indeed meet with terms such as Pragâpati, Siva, Indra, Âkâsa, Prâna, &c., but that these all refer to the supreme Reality established by the texts concerning Nârâyana--the aim of which texts it is to set forth the highest Reality in its purity--, we have already proved under I, 1, 30. In the same way we have proved under Sû. I, 1, 2 that in texts treating of the creation of the world, such as 'Being only this was in the beginning,' and the like, the words Being, Brahman, and so on, denote nobody else but Nârâyana, who is set forth as the universal creator in the account of creation given in the text, 'Alone indeed there was Nârâyana, not Brahmâ, not Isâna--he being alone did not rejoice' (Mahopanishad I).--As the Pasupati theory thus teaches principles, meditations and acts conflicting with the Veda, it must be disregarded.
In subsequent sections of the Sri Bhashya he discusses how the Brahma Sutras refute the belief of these Shaivite sects that Ishwara is the efficient cause but not the material cause of the Universe.
|
{
"pile_set_name": "StackExchange"
}
|
Author
Topic: Lever action 22 (Read 131403 times)
What I really like about the Marlin is, you can shoot .22 short, long and long rifle out of them. Brownings are nice, but in terms of quality AND accuarcy AND ruggedness, it's hard to beat the Marlin.
Logged
To you gutless cowards and scumbags, who are trying to lie and rewrite history. To those out to commit genocide on the Southern people with your destruction of Confederate monuments and your attacks on Southern heritage and pride. Be happy for now. Because someday when that civil war you wanted starts. I will find you. And I will kill you.
When I was young I remember Browning had some real nice lever action .22's and they were made in Belgium. My thing was that a .22 is a gun you buy to use all the time and it's going to take some serious knocks, and the thought of a Belgium Browning being abused was just too much for my plebeian mind to accept. I've seen the Marlin shoot against the Browning and they're both killers, but at the end of the day, I'd rather have the Marlin since if I put a few knicks or scratches on the gun I wouldn't lose my mind like I would if I did the same thing to my Browning.
Logged
To you gutless cowards and scumbags, who are trying to lie and rewrite history. To those out to commit genocide on the Southern people with your destruction of Confederate monuments and your attacks on Southern heritage and pride. Be happy for now. Because someday when that civil war you wanted starts. I will find you. And I will kill you.
|
{
"pile_set_name": "Pile-CC"
}
|
1. Introduction {#sec0005}
===============
The prevalence of endometriosis in women during reproductive life is about 10%--15% \[[@bib0005]\]. It can affect not only peritoneum and ovary but also bowel, urinary tract, pericardium and lungs. Gastrointestinal localizations most commonly occur in the rectosigmoid. Colonic endometriosis can lead to a complete bowel obstruction \[[@bib0010], [@bib0015]\]. In emergency settings it is most frequently treated with stoma placement. This approach brings about all the risks related to emergency surgery and might have important psychological and biological side effects.
We herein present a case of sigmoid endometriosis with complete bowel obstruction treated with endoscopic stenting and delayed one step laparoscopic procedure. We only found another similar case reported in literature \[[@bib0020]\]. This work has been reported in line with the SCARE criteria \[[@bib0025]\].
2. Case report {#sec0010}
==============
A 38 years old woman presented at emergency care with a history of abdominal pain started two days earlier and constipation started nine days earlier, she reported nausea but no vomit.
The patient had personal history of endometriosis and laparoscopic right ovarectomy was carried out a few years before; no similar episodes of abdominal pain were reported. She had no family history of intestinal diseases.
The abdomen was meteoric and tender; vital signs were normal with the exception of tachycardia (105bpm). On laboratory exams the WBC was 14090/mm3 and CRP was 3,1 mg/L.
A plain abdominal X-ray was performed with evidence of small and large bowel distension and an Abdomen CT detected an irregular mass (diameter 2 cm) at the proximal sigmoid colon determining stenosis. In consideration of the occlusive state, of the radiologic findings and of the likelihood of endometriosis, emergency recto-sigmoidoscopy was performed. The procedure revealed only lumen narrowing without mucosal alterations. A metallic auto-expansible stent was placed to treat bowel obstruction and to delay surgery.
Fasting, parenteral rehydration, a double intravenous antibiotic therapy and analgesic drugs were started. Over the next 48 h the bowel obstruction was resolved. The patient underwent a transvaginal utltrasonography (TVUS) with evidence of peritoneal endometriosis in the Douglas pouch and suspected sigmoid deep endometrioid localization. CA-125 levels were increased (114,8 U/L). After 5 days from endoscopy a laparoscopic sigmoidectomy was performed without stoma placement.
Histological investigation revealed the presence of endometrioid foci with inflammation and fibrosis affecting the entire sigmoid wall \[[Fig 1](#fig0005){ref-type="fig"}\].Fig. 1Section of the sick sigma with the endoscopic metallic stent inside.Fig. 1
The patient was discharged at fifth postoperative day in good conditions and was referred to Gynecologists.
At one month surgical follow-up she had no more abdominal pain and constipation.
3. Discussion {#sec0015}
=============
Endometriosis is the growth of ectopic endometrium, most commonly on ovary and pelvic peritoneum \[[@bib0030]\].
It usually leads to pelvic pain, deep dyspareunia, dysmenorrhea and infertility \[[@bib0035], [@bib0040]\]. It can also affects other organs determining different clinical pictures. Even though intestinal localizations occur in about 5--15% of patients, only in about 1% bowel resection is required \[[@bib0010], [@bib0015]\].
Laparoscopy should be considered the diagnostic gold standard for Endometriosis.
At present clinical evaluation, imaging and serologic markers can lead to a correct diagnosis leaving surgery to selected patients with a "see and treat" rationale \[[@bib0045]\]. This is also true for deep infiltrating endometriosis; in fact TVUS has a reported sensitivity of 91% and specificity of 98% in detecting bowel localizations \[[@bib0050]\]. Furthermore elevated serum levels of CA-125 can be considered for diagnosis \[[@bib0055]\].
The low incidence of bowel obstruction due to Endometriosis makes the diagnosis unlikely. Contrast abdominal CT has a low specificity and clinical presentation (constipation, nausea, vomit, abdominal pain, rectal bleeding) is unspecific. Other much more common conditions such as Cancer, Inflammatory Bowel Disease and obstruction due to bowel adhesions have a similar onset \[[@bib0010]\]. This is why the diagnosis is usually made by gross histology once the therapeutic decision has already been taken. In the case described patient's age, personal history and the endoscopic findings guided the diagnostic and therapeutic flow-chart.
A very important aspect of the disease consists of the psycho-physical implication related to therapies that can drastically alter patient\'s quality of life \[[@bib0060]\]. For this reason the best management of endometriosis is by integrate approach of both medical and surgical treatment \[[@bib0045], [@bib0065], [@bib0070]\].
In the literature some cases of acute colonic obstruction due to endometriosis are described. Hartmann's procedure or direct anastomosis with defunctioning stoma were performed, either open or laparoscopic \[[@bib0075], [@bib0080], [@bib0085], [@bib0090]\].
Our patient was treated with endoscopic stenting as a bridge to elective laparoscopic surgery.
We consider that this approach should be taken into account when colonic obstruction due to endometriosis is suspected, especially in young women with positive personal history.
Endoscopic stenting is a relatively safe procedure, potentially avoids the costs of two steps surgical intervention and the psychological drawbacks related to stoma placement. Laparoscopic procedure also allows a higher pregnancy rate after surgery \[[@bib0005]\]. In the literature we only found another similar case reported to have good outcomes \[[@bib0020]\].
Conflict of interest {#sec0020}
====================
All the Authors declare that there is no potential personal conflict of interest or financial disclosures or acknowledgements.
Funding {#sec0025}
=======
This research do not receive any specific grant from funding agencies in the public, commercial or not-for-profit sector.
Ethical approval {#sec0030}
================
Ethical approval has been exempted by our Institution, because our paper is not a research but a case report.
Consent {#sec0035}
=======
Written informed consent has been obtained. A copy of the written consent is available for review by the Editor-in-Chief of this journal on request.
Author contribution {#sec0040}
===================
Pietro Calcagno: corresponding author who wrote the paper.
Matteo Viti: contribute by giving the paper concept.
Alessandro Cornelli: the consultant surgeon who managed the patient and run the operation.
Davide Galli: the assistance surgeon in patient's operation.
Corrado D'Urbano: head physician who receive the article and gave final approval.
Guarantor {#sec0045}
=========
Corrado D'Urbano.
|
{
"pile_set_name": "PubMed Central"
}
|
[Mirizzi syndrome with cholecystoduodenal fistula--a rare complication of cholecyctolithiasis].
Mirizzi syndrome is a rare complication of the long-term gallbladder stone disease. It's caused by a gallbladder stone impression to the common bile duct wall. The clinical appearance is an obstructive jaundice, pain in right subchondrium and dyspepsia. Higher pressure in the extrahepatal bile ducts leads to biliobiliary or enterobiliary fistula formation. In the described case a cholecystoduodenal fistula was found. Preoperative diagnosis of MS is a medical challenge, and majority of the diagnosis is set introperatively. Surgery is the treatment of first choice. Ignoring the possibility of MS can seriously damage patient's health by injuring bile ducts during the surgery.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
This cottage style bedroom offers classic elegance that will stand the test of time. The furniture pieces are all painted black for a striking and simple style, and the paint is rubbed away to create a slightly worn finish. #traditionaldecor #paintedfurniture #orientalrugs #inspirationboard #cottagebedroom http://distinctblog.wpengine.com/
Looking for new dining room chairs? Look no further! We have hand selected dozens of chairs that stand up to our rigorous standards for the “perfect” dining chair, based on color options, comfort, quality and style. #cottagechairs #cottagefurniture #diningchairs #inspiration#styleboard http://thedistinctivecottage.com
Looking for ideas to decorate your entryway? This inspiration board pulls together different pieces, like benches, an accent table, rugs, and throw pillows for a cozy and practical lake house entryway. #farmhouselook #lakehousedecor #lakehouse #lodgedecor http://distinctblog.wpengine.com/
Both driftwood and whitewashed furniture finishes are gaining popularity and demand in today’s decorating trends. Whether it is a modern living room, or a rustic dining room, these finishes fit in everywhere. #driftwoodwashcottage #driftwoodwash #coastaldecor #cottagedecor http://thedistinctivecottage.com
This adorable cottage style kid’s bedroom is full of color making it a fun and exciting place for them to be. #brightkidsrooms #colorfulkidsrooms #decoratingwithcolor #cottagestylekidsrooms http://thedistinctivecottage.com
Creating a graceful and soothing dining room is easy when working with a palette like this! The medley of sea foam greens, sage, robin’s egg blue, sand, and white has a relaxing effect in this understated room. A clean and simple dining room does not have to mean using all neutral tones. This is a great example of putting together a classic look without shying away from all color.
The Lake Pontchartrain Cabinet is an organizer’s dream, offering endless storage in a stylish way. The large bins are perfect for off season table and bed linens, while the drawers are small enough to house sewing needles, thread, and button jars. And everyone needs a place to fold laundry! The sky blue console table is the perfect size to properly spread out and fold piles of laundry. This piece also has shelves that are big enough to nicely fit baskets for additional storage.
What better way to rest after a long day hiking, swimming, or fishing than in a cozy cabin bedroom? The stately bed sets the tone for the fantastic rustic theme seen throughout the lake house bedroom, while the accent colors of warm brown, red, and blue reflect the woodsy atmosphere found outdoors. A kaleidoscope of earth tones are found in the braided rug, which enhance the warm and inviting feel of this restful room. And don’t forget the adorable moose accent pillow that adds a dose of country charm!
ABOUT US
Hello, we are the Cottage Home design team. Our passion is finding the perfect sofa for an awkward space,
or creating a cozy nook where there was once a bare space. We love all things design and are excited to share our passion with you!
|
{
"pile_set_name": "Pile-CC"
}
|
How To Compost: Everything You Need To Know To Start Composting, And Nothing.........- Kindle Books- Free
How To Compost: Everything You Need To Know To Start Composting, And Nothing You Don't!
How To Compost: Everything You Need To Know To Start Composting, And Nothing You Don't!: Lars Hundley: Amazon.com: Kindle Store
Show more
Show less
|
{
"pile_set_name": "Pile-CC"
}
|
De bevolking van Nederland groeide in de eerste drie kwartalen van 2017 met ruim 80 duizend inwoners. Het grootste deel van die groei was het gevolg van buitenlandse migratie. Het migratiesaldo kwam uit op 66 duizend. Daarnaast zijn er bijna 15 duizend kinderen meer geboren dan er mensen zijn overleden. Dat meldt het CBS op basis van de meest recente bevolkingscijfers.
Tot en met het derde kwartaal van 2017 schreven 181 duizend immigranten zich in bij een Nederlandse gemeente, vrijwel net zoveel als in de eerste negen maanden van vorig jaar. Ook het aantal emigranten bleef ongeveer gelijk: 115 duizend mensen vertrokken uit Nederland.
De groei door natuurlijke aanwas was lager dan in dezelfde periode vorig jaar, waardoor de totale bevolkingsgroei toch lager uitkwam. Tot eind september zijn 127 duizend kinderen geboren, bijna 4 duizend minder dan vorig jaar. Bijna 2 duizend mensen meer zijn overleden, 112 duizend.
Instroom Syriërs gedaald
De immigratie uit landen waar het onrustig is, zoals Syrië, is ten opzichte van de eerste drie kwartalen van vorig jaar gedaald. De grote aantallen die vanaf eind 2015 naar Nederland kwamen worden niet meer gehaald. Toch komen er per saldo nog altijd zo’n duizend Syriërs per maand bij. Zij vormen daarmee de grootste groep migranten.
Inmiddels telt Nederland
88 duizend
inwoners met een Syrische achtergrond,
0,5 procent
van de bevolking. De meesten (
71 duizend
) zijn recente immigranten. Zij hebben zich tussen 2014 en
1 oktober 2017
ingeschreven bij een gemeente. In Amsterdam zijn de meeste Syriërs gevestigd:
2 536
. In Rotterdam zijn
2 463
Syriërs, in Den Haag
1 533
In verhouding tot het aantal inwoners staan gemeenten met een asielopvanglocatie bovenaan. De daar ingeschreven asielmigranten zijn vaak nog in afwachting van woonruimte elders. Zo is in Noordenveld
2,3 procent
van de inwoners Syriër. In Cranendonck, waar een andere centrale ontvangstlocatie voor asielzoekers is gevestigd, is dat
1,5 procent
. Onder gemeenten met meer dan
100 duizend
inwoners tellen Arnhem en Enschede relatief de meeste recent gevestigde Syriërs, Leeuwarden de minste.
Meer immigratie uit landen in Europa
Uit andere landen is de immigratie juist toegenomen, vooral van mensen die geboren zijn in landen in Europa en op het Amerikaanse continent. Per saldo kwamen er bijvoorbeeld meer mensen uit de voormalige Soviet Unie, zoals Letland en Litouwen, maar ook meer mensen uit Turkije. Het vertrekoverschot - meer emigratie dan immigratie - van mensen die in Nederland geboren zijn is kleiner geworden. Het aantal Poolse migranten is nog altijd hoog, maar niet verder gegroeid.
Download CSV Toon tabel Bevolkingsgroei 2017, eerste drie kwartalen Bevolkingsgroei 2017, eerste drie kwartalen Totale bevolkingsgroei Natuurlijke aanwas Migratiesaldo 2000 93 50,5 40,1 2001 88,3 47,8 40,5 2002 67 45,5 21,5 2003 48,4 45,9 2,5 2004 31,6 43,9 -12,4 2005 22 39,5 -17,4 2006 14,7 36,6 -21,9 2007 35,9 38,4 -2,5 2008 59,5 38,7 20,8 2009 68,8 39 29,8 2010 63,8 36,3 27,5 2011 63,3 35,9 27,4 2012 42,3 28 14,2 2013 40,5 22,7 17,8 2014 58,2 29,5 28,7 2015 56,7 17,2 39,6 2016 83,4 20,3 63,1 2017 81,2 14,8 66,4
Natuurlijke aanwas blijft laag
Het aantal geboorten ligt de laatste jaren op een relatief laag niveau. Ook in 2017 zijn tot nu toe weinig kinderen geboren, terwijl het aantal vrouwen in de vruchtbare leeftijd weer toeneemt. Ten opzichte van de eerste drie kwartalen van 2016 kregen vooral minder vrouwen van rond
30 jaar
een kind.Doordat tegelijkertijd de migratie hoog is, is een steeds kleiner deel van de bevolkingsgroei afkomstig van natuurlijke aanwas. In 2017 was het aandeel natuurlijke groei tot en met september nog geen vijfde, in 2008 was het nog twee derde van de groei in de eerste drie kwartalen.
|
{
"pile_set_name": "OpenWebText2"
}
|
Introduction {#Sec1}
============
The relationships between different anatomical measurements are a fundamental aspect of human physiology, as has been elegantly depicted by Leonardo da Vinci in his seminal work 'The Vitruvian Man' (da Vinci [@CR12]; Vitruvius [@CR46]). This work shows these relationships are highly conserved, even for men of variable length. This ancient idea of describing *relationships* between different properties has reached many other fields of research, for example quantitative genetics (Steppan et al. [@CR36]) and individual differences psychology (Goldberg [@CR15]).
Also the levels of many metabolites in a biological system may be highly interrelated through the biochemical pathways. Perturbations of these biological systems (e.g. diet or disease) may alter enzyme activity and therefore the link between different metabolites. However, the extent of such alterations may also differ between individuals. Thereby also in- or decreases of the inter-individual metabolite level differences may indicate system change. Then not only absolute metabolite level differences between experimental groups, but also the relationships between the metabolites may indicate change. Such Between Metabolite Relationships (BMRs) therefore describe an aspect of metabolism that is complementary to the changes that are common to all individuals (Weckwerth et al. [@CR43]).
Recent advances in 'omics'-research brought the study of BMRs closer, because metabolomics emerges more and more as a system-wide approach to observe metabolism (Bino et al. [@CR3]; Fiehn [@CR13]; Hall [@CR16]). The data of a metabolomics study usually consists of a list of numerous metabolites, of which the levels are given for every measured sample (e.g. individual and/or time-point). Of prime interest to metabolomics studies may be to find the in- or decrease of specific metabolite levels between different groups of individuals (e.g. before and after an experimental perturbation) (Fig. [1](#Fig1){ref-type="fig"}a). However, this paradigm holds a major shortcoming for the system-wide view provided by metabolomics analyses, because it may disregard metabolite combinations that show interesting variation where the individual metabolites do not.Fig. 1Three paradigms to observe metabolic differences between two groups: **a** Level difference of an individual metabolite (e.g. ANOVA), **b** Level difference in a combination of, i.e. a component of more metabolites (e.g. PLS), **c** Changes in the combined relationship between metabolites (INDSCAL)
Univariate methods that quantify level changes of individual metabolites (e.g., ANalysis Of VAriance, ANOVA (Sokal and Rohlf [@CR35])) disregard the interrelations between levels of different metabolites and thereby the system-wide aspect of metabolism. Therefore in general multivariate methods are used to analyse data generated in metabolomics studies, mostly those from the 'Component Analysis' family such as PCA and PLS-DA (Barker and Rayens [@CR2], Jolliffe [@CR24]). These summarize data into a small number of 'components'---latent variables that gather information about the importance of all measured metabolites. These profiles are constructed based on the levels of all metabolites and express the relative importance of every metabolite in combination with all other metabolites. PCA or PLS-DA models in e.g. case--control studies enable to describe differences in metabolite combinations between groups, even if the levels of single metabolites are not significantly different (Fig. [1](#Fig1){ref-type="fig"}b).
However, neither ANOVA nor PLS-DA explicitly reveals the changes in the relationships between metabolites in different experimental groups. Also unsupervised methods like PCA (Jolliffe [@CR24]) may be insufficient to describe BMRs, because these methods cover all metabolic variation simultaneously. The BMRs---schematically depicted in Fig. [1](#Fig1){ref-type="fig"}c---usually remain entangled with other sources of metabolic change and remain beyond reach of any method in these two metabolomic paradigms.
Several studies focus on relations between metabolites (Steuer [@CR37]), enzymes and genes (van Erk et al. [@CR41]; Zhai et al. [@CR47]). These studies visualise such relations by Correlation Networks that show the relationships between all metabolite/enzymes/genes pairs (Steuer et al. [@CR38]). However, as already mentioned 'Due to the sheer number of pairwise metabolic correlations, large overview network graphs easily get incomprehensible' (Weckwerth et al. [@CR43]) which is specifically relevant in metabolomics. Therefore a method that both specifically focuses on BMRs and is based on interpretable components that describe the behaviour of the entire system (i.e. all pairwise metabolite relations together) is required. It will provide a novel and complementary view on metabolism.
In the field of individual differences psychology, a component method appropriate for the analysis of BMRs called Individual Differences Scaling (INDSCAL) is already available (Carroll [@CR7]). This method translates the changes in covariance or correlations between metabolites upon experimental manipulation into a series of scores and loadings, analogous to those from PCA or PLS-DA. A voluminous yet well-readable publication reveals that INDSCAL is a special version of Parallel Factor Analysis (PARAFAC) (Harshman and Lundy [@CR18]).[1](#Fn1){ref-type="fn"} The PARAFAC model has been used earlier to solve a range of questions in metabolomics studies that focused on changes in metabolite profiles, see e.g. (Montoliu et al. [@CR30]; Jansen et al. [@CR21]; Forshed et al. [@CR14]; Sinha et al. [@CR32]; Verouden et al. [@CR42]) and will therefore provide a view on BMRs intuitive to metabolomics researchers.
First BMRs and the INDSCAL model are presented. Then two metabolomics data sets are analysed with INDSCAL, one with a very prominent response of plant chemistry to herbivory and another with a much more subtle response of obese humans to catechin-enriched green tea extract (GTE). The results of standard data analysis methods used in metabolomics, such as ANOVA, PCA, and PLS-DA are compared to that of INDSCAL.
Theory {#Sec2}
======
In metabolomics experiments, one or more experimental factors can be manipulated (e.g. doses of a toxicant, different populations) to observe their effect on the metabolites present in an organism, often on different time-points after the manipulation. Metabolomic data consists of comprehensive biochemical descriptions of each sample as a list of metabolites with their corresponding levels. An 'experimental group' of multiple individuals---called biological replicates---undergo a combination of experimental factors. Technical and financial limitations usually lead to considerably more measured metabolites than the number of biological replicates.
The 'conceptual model' underlying most metabolomics experiments states that an experimental manipulation may change the levels of several metabolites. When this manipulation is performed on several biological replicates, their response should be similar to the other replicates, up to a certain deviation caused by natural and technical variation. When quantified in a linear model for one factor with groups 1...*k*...*K*, this leads to Eq. [1](#Equ1){ref-type=""}.$$\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$ {\mathbf{X}}_{k} = 1_{{I_{k} }} {\varvec{\upmu}}^{\text{T}} + 1_{{I_{k} }} {\varvec{\upmu}}_{k}^{\text{T}} + {\mathbf{S}}_{k} \quad {\text{for}}\,k = 1 \ldots K $$\end{document}$$where **X**~*k*~ is the (*I*~*k*~ × *J*) matrix containing the levels of each metabolite, indicated by 1...*j*...*J* in the biological replicates 1~*k*~...*i*~*k*~...*I*~*k*~ of experimental group *k*, **μ** is the length *J* 'centroid' vector of all samples, vector **μ**~*k*~ the centroid vector for group *k* expressed as a deviation from **μ**; matrix **S**~*k*~ contains the deviation of each individual biological replicate from vector **μ**~*k*~; see Supplementary Table 1 for a list of symbols used throughout the paper.
Equation [1](#Equ1){ref-type=""} is generally used to quantify the significance of this experimental manipulation on levels of a small subset of single metabolites. This can be done by ANOVA (Sokal and Rohlf [@CR35]) that estimates the treatment effects expressed in a series of vectors $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$ {\varvec{\upmu}}_{k} \left( {k = 1 \ldots K} \right) $$\end{document}$: interesting putative biomarkers are then identified as variables *j* for which variation across the *j*-th elements of $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$ {\varvec{\upmu}}_{k} \left( {k = 1 \ldots K} \right) $$\end{document}$ is high relative to the natural and technical variation of the biological replicates derived from **S**~*k*~. The model in Eq. [1](#Equ1){ref-type=""} does not make any assumptions about the relationships between metabolites, which falls in the realm of the component analysis paradigm.
Multivariate components {#Sec3}
-----------------------
A major objective in metabolomics is to understand the underlying biochemical system, which makes observation of the variations in each individual metabolite insufficient. The relations between different metabolites may both lead to a more parsimonious model---the biochemical system will constrain the complexity of the metabolic changes resulting from the experiment---and may lead to hitherto unknown relations between the metabolites that will provide a better insight into the observed system (Jansen et al. [@CR22]).
To model these system-wide relationships metabolomics embraced the multivariate 'component' paradigm that models the relationships between all *J* metabolite descriptors (Fig. [1](#Fig1){ref-type="fig"}b). The 'standard' methods in this field may also be expressed using the partitioning of the variation in Eq. [1](#Equ1){ref-type=""}. Principal Component Analysis simultaneously describes **μ**~*k*~ and **S**~*k*~, so that this model will give a convoluted description of the paradigms in Fig. [1](#Fig1){ref-type="fig"}b, c. The often-used method Partial Least Squares-Discriminant Analysis (PLS-DA) aims---like ANOVA---to describe **μ**~*k*~ at the expense of the 'biological variation' (inter-individual variation, natural variation) in matrix **S**~*k*~. Clearly, thereby PLS-DA does exactly the opposite of what is of interest to BMRs.
The analysis of BMRs requires separation of the variation in **μ**~*k*~ from that in **S**~*k*~, because the BMR-related information (between the individual biological replicates) is contained only in the latter matrix. Therefore a component analysis method needs to be developed that focuses on the relations between the metabolites within this contribution.
Between Metabolite Relationships {#Sec4}
--------------------------------
In characterising BMRs, the strength of relationship between metabolites is of high interest. However, also how much variation in each experimental group is associated with this relationship is important. Although Pearson correlations are widely used in metabolomics, they overlook this aspect, because in Pearson correlations the variation in the levels of both metabolites is scaled by their standard deviations. Therefore covariances are the preferred measure for BMRs.
A BMR-describing component model should focus upon the differences between groups in the systematic part of the biological variation. This information is hidden in **S**~*k*~, specifically in the relationships between the metabolites. A view on BMRs therefore necessarily revolves around quantifying relations between the columns of **S**~*k*~. This can be done by covariances, like in Eq. [2](#Equ2){ref-type=""}.$$\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$ {\mathbf{R}}_{k} = I_{k}^{ - 1} {\mathbf{S}}_{k}^{\text{\,T}} {\mathbf{S}}_{k} $$\end{document}$$where **R**~*k*~ is the covariance matrix of experimental group *k* with dimensions (*J* × *J*).
Because interpreting **R**~*k*~ may be tedious for many metabolite covariances, the holistic and simple view of a component model of BMRs may be highly desirable.
Individual differences scaling {#Sec5}
------------------------------
A component model for BMRs needs to describe the relations between metabolites, rather than the levels themselves as well as possible. An existing component model that does just this is INdividual Differences SCALing (INDSCAL) model (Kruskal and Wish [@CR27]; Harshman and Lundy [@CR18]; Carroll [@CR7]; Carroll and Chang, [@CR8]), which is given in Eq. [3](#Equ3){ref-type=""}.$$\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$ \begin{array}{lll} {\text{Model}}&{\mathbf{R}}_{k} = {\mathbf{AG}}_{k} {\mathbf{A}}^{\text{T}} + {\mathbf{E}}_{k} \hfill \\ {\text{Minimization}}&f\left( {{\mathbf{A}},{\mathbf{G}}_{k} } \right) = \sum\limits_{k = 1}^{K} {\left\|{{\mathbf{R}}_{k} - {\mathbf{AG}}_{k} {\mathbf{A}}^{\text{T}} }\right\|^{2} } \hfill \\ {\text{Constraints}}&diag\left({{\mathbf{A}}^{\text{T}} {\mathbf{A}}} \right) = 1_{R},\,\,\,{\mathbf{G}}_{k} \,\,\,{\text{is diagonal with nonnegative elements}} \hfill \\ \end{array} $$\end{document}$$where **G**~*k*~ is an (*R* × *R*) score matrix of group *k*; matrix **A** of size (*J* × *R*) contains the chemical loadings; **E**~*k*~ contains the residuals of which the sum-of-squares is minimized. The constraints are imposed to arrive at identified and meaningful solutions.
The INDSCAL model loadings **A** describe the important relations between metabolites and the scores **G**~*k*~ describe the magnitude of the variation of these relations within each experimental group, such that both important aspects of the BMRs are described.
The INDSCAL model is strongly related to Parallel Factor Analysis (PARAFAC) (Bro [@CR6]; Harshman [@CR17]; Smilde et al. [@CR33]), an often-used component model in metabolomics. The INDSCAL model can be fitted by modelling the covariance matrices **R**~*k*~ (arranged in a (*R* × *J* × *J*) three-way array) by PARAFAC (ten Berge and Kiers [@CR39]). The additional nonnegativity constraint on **G**~*k*~ can be straightforwardly imposed by publicly available software (Andersson and Bro [@CR1]). Like PARAFAC, the components of an INDSCAL model are unique.
Model visualization and interpretation {#Sec6}
--------------------------------------
Conventionally, the INDSCAL loadings **A** are shown in such a way that high loading values relate to the relevance of those metabolites in the BMRs important on each component. However, it may be better interpretable to rearrange the loadings following the structure of the covariance matrices, i.e. $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$ {\mathbf{R}}_{k} = \sum\nolimits_{r = 1}^{R} {g_{kr} } {\mathbf{a}}_{r} {\mathbf{a}}_{r}^{\text{T}} + {\mathbf{E}}_{k} = \sum\nolimits_{r = 1}^{R} {g_{kr} } {\mathbf{A}}_{r} + {\mathbf{E}}_{k} $$\end{document}$, where the matrices **A**~*r*~ of dimensions *J* × *J* are symmetric. Then high values in **A**~*r*~ directly indicate important relations between metabolites. It may therefore be easier to interpret a heat map of **A**~*r*~ than a conventional loading plot of **A** to identify relevant metabolites. However, since such heat maps do not allow comparison between components in one figure, both may be of value to gain insight in the BMRs. The scores **G**~*k*~ (or rather the diagonal elements g~*kr*~) show for which group *k* the relations in **A**~*r*~ are important. A score of zero implies that the corresponding relations are absent in group *k*.
Just like in PARAFAC, the components fitted for INDSCAL are not orthogonal. The amount of information explained by the model can therefore only be calculated for the entire model. Furthermore, adding INDSCAL components modifies all other components (Smilde et al. [@CR33]), which means a proper number of components has to be chosen before interpreting the model.
Number of components, stability and validation {#Sec7}
----------------------------------------------
The amount of information each component adds to the model may be used to determine the appropriate number of INDSCAL components, by comparing the information explained in a model to those with fewer components.
Whether the fitted model is prone to local optima can be tested by using multiple random starting values: the models need to be comparable, otherwise the model may contain too many components, thereby covering technical or other non-systematic variation.
Because the INDSCAL model describes entire experimental groups rather than individual biological replicates, the significance of observed effects is not expressed in the scores **G**~*k*~. An earlier-proposed jack-knife approach relies heavily on distributional assumptions (Weinberg et al. [@CR44]), not likely fulfilled by metabolomics data. Therefore we quantify this significance by resampling: the results (i.e. scores and loadings) of models where individual biological replicates are left out are compared to the original model, which shows how individual replicates influence the model. This resampling strategy is fully explained in the supplementary material. Also a schematic pipeline to describe BMRs by INDSCAL is given there (Supplementary Fig. 1).
Materials and methods {#Sec8}
=====================
Induced plant response study data set {#Sec9}
-------------------------------------
This experiment studied the 'induced plant response' of cabbage plants to simulated herbivory to the plant shoot (*SJA*) or root (*RJA*), by the plant hormone jasmonic acid. These plants were compared to control (*CON*) plants, not treated with the hormone. The defense was characterized by the glucosinolate compound class: 11 compounds were profiled in plants harvested at 1, 7 and 14 days after the simulated attacks. The dataset contains 6--10 replicate plants *per* herbivory type/harvest time. This study was described in much more detail in an earlier paper (Jansen et al. [@CR23]).
Human nutritional intervention study data set {#Sec10}
---------------------------------------------
In a double-blinded, placebo-controlled nutritional intervention study with a parallel design, 186 human subjects with abdominal obesity (BMI 25--35 kg/m^2^ and a waist circumference of over 80 cm for women or 95 cm for men) consumed either catechin-enriched green tea extract drink (GTE; 600 mg catechins/day, 87 subjects) or a placebo drink (placebo, green tea-flavoured drink without any active ingredients, 99 subjects) over a period of 12 weeks. The experiment was conducted at University of Nottingham and approved by the University of Nottingham Medical School Ethics Committee. Fasted serum samples were collected at the baseline (start of the experiment; T0) and after 4, 8 and 12 weeks of intervention (T4, T8 and T12). For each serum sample a metabolic profile was obtained, composed of 136 lipid metabolites expressed as ratios between the peak areas of the metabolite and internal standard. The supplementary material contains a description of the analytical method and Supplementary Table 2 lists the measured metabolites.
Software {#Sec11}
--------
All statistical analyses were carried out in MATLAB 2009a (The Mathworks Inc., Natick, Massachusetts, USA), using in-house routines, partly based on the N-way Toolbox (Andersson and Bro [@CR1]). They have been made available on [www.bdagroup.nl](http://www.bdagroup.nl).
Results and discussion {#Sec12}
======================
Induced plant response study---comparison of PCA and INDSCAL results {#Sec13}
--------------------------------------------------------------------
In the "induced plant response" study, the metabolic effect of shoot herbivory (SJA) or root herbivory (RJA) are of interest. Initially a PCA model was fitted, slightly modified to exclude the average time-profile of all plants related to uninteresting chemical variation (see earlier paper: Jansen et al. [@CR23]). The results of this analysis are given (again) in Supplementary Fig. 2.
The PCA results have been described in great detail in the earlier paper and are only briefly repeated here. The induced response to jasmonic acid consists of an increase in Glucobrassicin (GBC) and Neoglucobrassicin (NEO) for both treatments, but considerably larger for SJA. The RJA plants have higher levels of Progoitrin (PRO) and Glucobrassicanapin (GBN) after 7 and 14 days (PC 3). These changes are consistent for all the plants in the relevant treatment-time combinations and will therefore end up in **μ**~*k*~ in Eq. [1](#Equ1){ref-type=""}. The increase in NEO and GBC will differ between plants, but the model also revealed that SJA plants harvested after 7 and 14 days with more NEO, contain less GBC, this will typically end up in matrix **S**~*k*~ of Eq. [1](#Equ1){ref-type=""} and therefore be the target of INDSCAL analysis. The earlier study also showed the increase in PRO and GBN levels in RJA plants after 7 and 14 days is preceded by an increase in the natural variation of these levels, which should also be revealed by INDSCAL.
A 4-component INDSCAL model explains a highly unstable amount of information (see Table [1](#Tab1){ref-type="table"}), leading to three-components. This INDSCAL model (Fig. [2](#Fig2){ref-type="fig"}) corresponds very well to the PCA results. The first component explains a BMR in the *SJA* plants that increases from absence to an enormous contribution 14 days after harvest and explains the high NEO with low GBC levels (see Fig. [2](#Fig2){ref-type="fig"}c). The positive relation between PRO and GBN, expected to be high specifically high 1 day after *RJA* is indeed present in the second INDSCAL component (Fig. [2](#Fig2){ref-type="fig"}d). The component is also important 14 days after *SJA*, which after further inspection of the large confidence interval on the PCA scores. The third INDSCAL component describes the consistently larger variation in NEO and in GBC related to the natural variation between the different *SJA* (1--14 days) and *RJA* plants (1--7 days) described by the first PCA component (Fig. [2](#Fig2){ref-type="fig"}e). In this data set, the qualitatively observed BMRs in the earlier PCA model could be quantified in the INDSCAL model.Table 1Number of components for INDSCAL model of plant data set\# components% convergence% variance explained11009221009731009948099.555599.7The second column shows how many models converged to a stable solution and the third how much information is described by the modelFig. 2INDSCAL model of plant data set. **a** Group scores for component 1 vs. component 2, **b** Group scores for component 2 vs. component 3, *circles* refer to control group (CON), *squares* to root herbivory (RJA) and crosses to shoot herbivory (SJA). Loading are presented as heatplots separately for each component: **c** loadings for component 1, **d** loadings for component 2 and **e** loadings for component 3
Example of human nutritional metabolomics study and BMRs {#Sec14}
--------------------------------------------------------
In this section, BMR analysis is applied on lipid profiles from obese human subjects consuming either green tea extract (GTE) or placebo during 12 weeks. Changes in the lipidome were expected, because dietary supplementation of GTE has been proposed as a strategy for weight loss (Maki et al. [@CR29]; Kovacs and Mela [@CR26]). It has been hypothesized to promote lipolysis as a mechanism by which GTE stimulates fat oxidation (Westerterp-Plantenga [@CR45]) and to affect lipid metabolism by inhibiting lipid absorption and digestion (Koo and Noh [@CR25]).
The effect of GTE on the lipid profiles was analysed by investigating changes in individual metabolite levels, in multi-metabolite profiles and in BMR components fitted by INDSCAL. Variables were not scaled and INDSCAL was performed with covariances to compare all results to each other.
### Changes in individual metabolite levels {#Sec15}
Univariate, nonparametric U-Mann--Whitney statistic tests (Sokal and Rohlf [@CR35]) did not reveal any statistically significant changes in individual metabolite levels between T12 (end of intervention period) and T0 (baseline) (see Supplementary Table 3), for either GTE or placebo. This indicates GTE did not induce an effect stronger than the inter-individual variation. This is frequently observed in dietary intervention studies within healthy human subjects, where effects are typically subtle and obscured by large inter-individual variations.
### Profiles of multiple metabolites {#Sec16}
An unsupervised PCA model did not reveal any relevant difference between GTE and placebo groups (see Supplementary Fig. 3). A supervised PLS-DA model also did not provide statistically significant differences between the GTE and placebo group metabolite profiles between T0 and T12 (see Supplementary Table 4). A multiway-PLS-DA (N-PLS-DA) was employed to simultaneously evaluate time-related metabolic changes induced by GTE at all four time points (Bro [@CR5]; Castro and Manetti [@CR9]), while retaining the structure of the repeated measurements on the same individuals (Smilde et al. [@CR34]). The diagnostic outcome of this model was very weak: e.g. 47.1% of the samples were misclassified (see Supplementary Table 4). This shows GTE intervention did not change the serum lipid profiles significantly as observed by the 'standard' multivariate data analysis methods most widely used in metabolomics (Jansen et al. [@CR22]; Trygg et al. [@CR40]; Lindon et al. [@CR28]; Holmes et al. [@CR19]).
### Between Metabolite Relationships {#Sec17}
To include all available a priori knowledge about the experimental design into the INDSCAL model, a 'baseline' group (BL) was constructed of all individuals measured at the start of the experiment (T0), assuming all subjects to belong to a homogeneous population before the nutritional intervention. For the remaining samples, covariance matrices were calculated for each experimental groups, i.e. treatment and measurement time-point combination: GTE-T4, GTE-T8, GTE-T12, placebo-T4, placebo-T8 and placebo-T12.
To determine the number of INDSCAL components appropriate to model these covariance matrices, one to five components were fitted 20 times, starting from random values. Table [2](#Tab2){ref-type="table"} shows the percentages of explained information and of converged models. This table shows that the model requires two components, because 20% of the models with three components did not converge to a stable solution.Table 2Number of components for INDSCAL model for human nutritional data set\# components% convergence% variance explained110097.1210099.038099.446099.657099.8The second column shows how many models converged to a stable solution and the third how much information is described by the model
The INDSCAL scores of the GTE group (black circles in Fig. [3](#Fig3){ref-type="fig"}a) differ from those of the placebo group (white circles) after 4, 8 and 12 weeks of intervention and from the BL group (grey circle). The first INDSCAL component mainly describes a systematic drift of the GTE group from the region of the plot covered by the placebo group and the second component shows an additional variation in the BMRs of the GTE group, prominent at T4 (Fig. [3](#Fig3){ref-type="fig"}a).Fig. 3INDSCAL model of human nutrition data set. **a** Group scores: the *white circles* indicated the placebo group, the *black* the GTE group and the *grey* the common baseline group (sampled before start of intervention). The region around each score is obtained during model validation and refers to region of plot where 95% scores obtained from resampled models occurred. **b** Loadings with regions of confidence obtained during model validation analogously as for scores. **c** Heat plot of BMRs in *greyscale*; both inserts focus on the relations of TG28 with 29 and of TG54 with 42: these are indicated by the *white* frames
The resampling results (confidence intervals around the circles in Fig. [3](#Fig3){ref-type="fig"}a) show that the differences between GTE and placebo are highly significant after 4 and 12 weeks and that after 8 weeks the resampling interval of GTE has only very slight overlap with that of BL. The resampling results of the chemical loadings (intervals around the circles in Fig. [3](#Fig3){ref-type="fig"}b) show that the BMR response to GTE consists of the covariance between metabolites TG28, TG29, TG41 and TG42.
The first INDSCAL component is of most interest in this study, because it shows a consistent GTE-associated drift. The heat plot in Fig. [3](#Fig3){ref-type="fig"}c focuses upon these loadings. This heat plot shows BMRs rather than the contributions of the individual lipids to the loadings in Fig. [3](#Fig3){ref-type="fig"}b. The heat plot quantifies the BMRs in greyscale, showing for example that the covariance between TGs 28 and 29 is larger than between TGs 54 and 42, considerably less interpretable from Fig. [3](#Fig3){ref-type="fig"}b alone.
Selected lipids: level changes and BMRs {#Sec18}
---------------------------------------
The effect of GTE on the plasma lipids is clearly visible in both INDSCAL model representations in Fig. [3](#Fig3){ref-type="fig"}. It is mainly associated with relations between a very small subset of lipids. Most important are the triacylglycerols TG28-29 and TG41-42. Figure [4](#Fig4){ref-type="fig"}a shows that the variance of TG29 (those for TGs 28, 41 and 42 are comparable and not shown) is significantly affected by GTE compared to the control and the BL groups, although the mean group levels of these metabolites did not change (Supplementary Fig. 4). The Pearson correlation coefficients for these lipids did not change between GTE and placebo (see Supplementary Table 5), but the covariances did (Fig. [4](#Fig4){ref-type="fig"}b; Supplementary Fig. 4). The barplot in Fig. [4](#Fig4){ref-type="fig"}b corresponds closely to the INDSCAL scores (Fig. [3](#Fig3){ref-type="fig"}a). The INDSCAL results and the (co)variance plots show that the effect of GTE manifested itself by a systematic increase of the covariance between TG28 and TG29 during the entire study period and an additional increase of the covariance between TG41 and TG42 during the first 4 weeks of intervention, described by the second INDSCAL component. The last is related to a large inter-individual difference in time and magnitude of response at the beginning of the intervention.Fig. 4Variance and covariance of selected metabolites. **a** Variance of TG29 and **b** covariance between TG28 and TG29; *BL* baseline group, *GTE* catechin-enriched green tea extract group, *placebo* placebo group, significantly different: \*\**P* \< 0.05 and \*\*\**P* \< 0.01
Interpretation of the observed GTE effect {#Sec19}
-----------------------------------------
The INDSCAL model shows that supplementation of GTE significantly affects relationships between a small subset of triacyloglycerols (see Supplementary Table 6 for the isomer composition). Similar TGs have been reported to play an important role in diet-induced weight loss for metabolic syndrome in a 33-week intervention (Schwab et al. [@CR31]). These changes were not shown by the standard uni- and multivariate statistical analyses, because these focus upon responses in metabolite levels similar for all treated individuals (i.e. PLS-DA or Mann--Whitney tests). Figures [3](#Fig3){ref-type="fig"} and [4](#Fig4){ref-type="fig"} show the observed BMRs relate to an increase in the variation in the levels of selected triacyloglycerols between subjects that received the same intervention.
Observed changes in metabolite covariances show that their changes are dependent between metabolites and therefore the observed effect of GTE can be explained on a system biology level. Inter-individual variation in the levels of selected triacylglycerols could be related to individual differences in the activities of transcription factors or enzymes regulating these metabolites (individual phenotype). Depending on the characteristics of the individual phenotype, GTE could induce the increase or decrease of these specific metabolite levels (see Supplementary material for a simulation example). For example, it has been stated that there is a wide variability in the flavonoid O-methylation by catechol-*O*-methyltransferase (COMT), a key enzyme that is hypothesized to be involved in fat oxidation and whose activity may differ between ethnic groups (Westerterp-Plantenga [@CR45]). Alternatively, the increase of inter-individual variation in levels of selected triacyloglycerols can be explained by multiple mechanisms of actions and/or active compounds present in GTE. That may lead to opposing effects of GTE on a network of transcription factors and enzymes and thereby to up- and downregulation of the production of specific metabolites and less controlled ranges of metabolite levels. In this case, metabolic change might be the consequence of a superposition of e.g. changes in dietary fatty acid composition, different mechanisms of TG activation or different effects on the lipid species present in the TGs (Kovacs and Mela [@CR26]; Westerterp-Plantenga [@CR45]).
INDSCAL and BMRs in practice {#Sec20}
----------------------------
To extract BMR-related information by standard data analysis methods may be difficult (i.e. PCA) and often even impossible (PLS-DA): these methods have a different focus. This paper shows, by two examples of metabolomic data sets from plant and human nutrition studies, that the BMR-related components of INDSCAL showed an essential aspect of metabolic change that was complementary to that obtained by standard methods. A PCA model of the plant "induced response study" only showed BMR-related change intermingled with level changes like those in Fig. [1](#Fig1){ref-type="fig"}b. However, with INDSCAL these were directly focused upon. In the human nutritional study, INDSCAL revealed increases in the inter-individual variation of four triacylglycerols upon GTE supplementation, while this (or any other) effect of GTE could not be observed by standard data analysis methods.
In this study, the BMRs were expressed and included in INDSCAL as covariances, but also other dissimilarity measures such as Pearson or Spearman correlation coefficients can be used for a different focus (Jansen et al. [@CR20]). In fact, multidimensional scaling methods like INDSCAL allow matrices **R**~*k*~ to be filled with many dissimilarity measures, underlined by a valid distance metric (Borg and Groenen [@CR4]). The choice of dissimilarity measure depends on the expected nature of the relationships, such that INDSCAL is a highly flexible tool to find BMRs.
Covariance analysis between metabolites, as opposed to correlations, is highly appropriate for studies where responses are expected to be inconsistent between individuals. For example, INDSCAL directly targets the expected variation in the response of different humans to dietary intervention, such as that of GTE. Because not all individuals respond to a dietary supplementation of GTE in the same fashion or degree, covariances rather than levels of these metabolites change when the entire experimental group is observed. The metabolites involved in this effect then also have a different role than in the conventional paradigms in Fig. [1](#Fig1){ref-type="fig"}a, b: triacylglycerols of which the covariances with other metabolites change during dietary intervention could be used a posteriori to select the individuals from the experimental group that have a similar metabolic response. This relates directly to the evolutionary constraints that were already discussed in the introduction: these also rely on responses only present in a subset of the population. The introduction of INDSCAL also makes such patterns available to metabolomics.
The literature concerning visualisation of INDSCAL models is sparse (with exceptions like (Chang and Carroll [@CR11])). The representation of **A**~*r*~ in heat maps is---to our knowledge---new and considerably increases the insight into the metabolic relations described by the BMRs, compared to the conventional representation in Fig. [4](#Fig4){ref-type="fig"}. However, the relations between metabolites represent the biochemical reactions within the studied organisms, therefore the INDSCAL loadings would immensely benefit from an interpretation through biochemical pathways. This would connect the Correlation Networks that until now have observed metabolism as a series of pairwise correlations between metabolites (Steuer et al. [@CR38]) with component analyses that simultaneously connect all metabolites to each other. The synergy between Correlation Networks and INDSCAL will be the topic of a follow-up paper.
The Between Metabolite Relationships, together with INDSCAL, will therefore greatly enhance the amount of biochemical information that can be obtained from 'omics' experiments.
Concluding remarks {#Sec21}
==================
Between Metabolite Relationships (BMRs) may reveal systematic changes in biological systems that remain elusive when only metabolite level changes are taken into account. The Individual Differences Scaling (INDSCAL) method is introduced here as a method to analyse these BMRs with component models, which give a system-wide view on the changes in relationships between all compounds measured in a metabolomics study.
The results of INDSCAL can support and explain already known metabolic changes, such as those in the "induced plant response" study. They can also provide information that lays beyond the reach of standard data analysis methods in use in metabolomics as in the human nutritional intervention study. The BMRs indicated which relations between metabolites are most prone to a variable response by the biological replicates e.g. by jasmonic acid application (subset of glucosinolates in "induced plant response" study) or by the GTE intervention (subset of triacyloglycerols in human nutritional intervention study). Identification of such changes in metabolite relationships will improve the understanding of possible mechanisms of action of tested interventions.
The BMRs, together with INDSCAL, thereby open the door to dedicated analysis of the next generation of questions in systems biology: those that deal with personalized medicine and individual or cohort-specific responses to dietary change.
Electronic supplementary material {#AppESM1}
=================================
{#SecESM1}
Supplementary material 1 (DOC 771 kb)
This project was financed by the Netherlands Metabolomics Centre (NMC) which is a part of the Netherlands Genomics Initiative/Netherlands Organisation for Scientific Research. Authors gratefully acknowledge Jorne Troost (NMC, LACDR/Leiden University) for further experimental work on lipid identification and Adrie Dane (NMC, LACDR/Leiden University) for quality control of human nutritional intervention study data set. The 'induced plant response' study was funded by NWO, the Netherlands Organization for Scientific Research through VIDI grant, no. 864-02-001.
Open Access {#d29e1415}
===========
This article is distributed under the terms of the Creative Commons Attribution Noncommercial License which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
The book that this chapter appeared in is out-of-print and difficult to obtain. However, it can be found online in PDF format: <http://publish.uwo.ca/~harshman/abstract.html>.
Jeroen J. Jansen and Ewa Szymańska contributed equally to the manuscript.
|
{
"pile_set_name": "PubMed Central"
}
|
China introduced a powerful weapon to the trade war on Monday, letting its currency weaken sharply in a move that left financial markets lurching and investors worried about how the worsening hostilities between Beijing and Washington would affect corporate profits and the already slowing pace of global growth.
On Wall Street, stocks experienced their steepest drop of the year, conclusively ending a period of steady trading during which the market notched record after record.
The recent calm was first punctured last week by President Trump’s threat to impose new tariffs on $300 billion of imports from China. But it was Beijing’s decision to allow its currency to cross the psychologically important barrier of 7 per dollar that pushed investors to abandon any lingering hope that a trade truce — worked out in a face-to-face meeting between Mr. Trump and Xi Jinping, China’s leader, a little over a month ago — would hold.
“That has just totally disintegrated,” said Ryan Detrick, senior market strategist at LPL Financial. “Now China is just clearly firing back, and that has people uncomfortable.”
|
{
"pile_set_name": "OpenWebText2"
}
|
I just watched an incredible movie. I’ve been writing an immigration feature the last few days and between the day job and Qdoba, I’ve been really busy. Tonight, as I’ve turned in the story, I’m relaxing with some red wine and my latest Blockbuster arrival. This article is not an opinion column, like I write for the Journal Sentinel, but an actual newsy feature. It’s kind of a big deal because it’s the first non-opinion piece I have ever had published.
Anyway, I occasionally put movies in my Blockbuster online queue that I know nothing about, just because I like one of the actors, or the director. I’m not sure when I added “Dirty Pretty Things,” but I know I didn’t realize it was about the underground lives of illegal immigrants in London.
So, ironically, the film is about my pet topic, the issue I know most about politically, yet set in another land, where, if the things in this movie are based on the truth, the situation for illegal immigrants is far more dangerous and unstable.
The film, starring Amelie‘s Audrey Taotou and British actor Chiwetel Ejiofor is dark and deeply moving, but not so overwhelming that you finish with a sinking sickness in your stomach, which is how I feel when I see certain movies about politics, religion, and the sad state of certain places and peoples of the world. In addition, the characters are colorful and sympathetic, and by the end, you are cheering for both their sorrows and triumphs.
Oh, and I should add, I pulled the words for this title from the character Guo Yi in the movie.
I just completed an interesting exercise in organization and memory. When I relocated my blog to wordpress from blogger (exactly one year ago), all my old posts were brought over and dumped into the “uncategorized” category. I guess I’ve never been quite bored enough to categorize them until today. In order to put them into categories such as “friends,” “daily grind,” or whatever, I had to open all those old posts and at least skim them.
It’s kind of a journey through the most confusing time of my life reading some of those posts. There was a lot of joy there, with new love and marriage, being a home-owner and moving into a new form of independent adulthood, but also a lot of spiritual wrestling, things that I suppose I ponder less and less these days, as I settle into being a strange breed of non-practicing Christian, an almost agnostic who still believes in the teachings of Jesus but doesn’t really believe Christianity as it is taught in most American churches is true. That long phrase, is, unfortunately, the best way I can describe my faith right now. It’s not simple. It doesn’t fit in a box. It’s okay.
I noticed back a year or so I wrote a lot about getting back to writing. Today, with having traded my restaurant career for an utterly unstressful job, I see endless opportunities out there, thanks also to some classes, the community columnist experience, and a recent writer’s festival. I’ve had a revelation in the last few weeks that I should pursue writing about immigration-related issues. I am acquainted with, albeit via the internet, a whole host of people with interesting stories that could be covered.
Last week I queried a few of the Madison papers with a story of someone I met on Immigrate2US.net and was contacted three days later to write the story. I will post the link when it is published. I don’t want to give away all the details of this couple’s story. It will be, I hope, the best thing I have had published thus far in my life. Following that I will be pursuing some larger outlets with a truly tragic story of one of the women on another immigration board, whose husband was murdered in Mexico recently while separated, him waiting out the waiver process for almost a year, while she stayed in the U.S., working and caring for their two children. It’s an amazing opportunity to stress the oft-ignored family unity clauses in current immigration law.
I don’t know where this is all taking me, but I have so many writing-related ideas right now I can hardly entertain them all, and while I’ve always loved to write, I’ve never had nearly the number of practical and feasible opportunities to do it as I do right now.
All this has been made possible by my career change, and I can’t express how glad I am about it, despite still loving the 10-15 hours a week I am currently working at Qdoba. Those hours are my link back to the time my whole life changed, the months after graduation, working at Chin’s with Fermin, the setting of my spiritual crises, the activity, the excitement, and outlet for my leadership skills. After a frustrating stint at another store, I’m back working at my favorite Qdoba, the busy one on Highway 100 and Bluemound Road, the one I loved working at before I was promoted and started the long, unsatisfying role of being a General Manager. It’s good memories there, and strangely, many customers who I no longer recognize seem so pleasantly surprised to see me, even asking where I have been for the past two years.
This weekend, my friends Joe and Rachel stepped way out of the box by hosting a yacht-rock themed double birthday party on St. Patrick’s Day. And let me say, it was great.
I could never pull off a themed party. I dread baby showers, all that pink and yellow and those games, God help me the next time I have to dig through a diaper full of melted chocolate, I hate them. When someone tells me they are going to a bridal shower, I have to control my instinct to smirk (because I don’t have to go) or make a sour face (because I am imagining all those hideous bows and ribbons tied into a paper plate).
Maybe I can’t help it. After emerging from several years of adolescence living with my dad and younger brother, I never really recovered until college, when I discovered, it’s cool to embrace some traditionally female habits. I went through a very brief period of liking the color pink, about the time I started dating Fermin, but those days are long gone.
Today I enjoy gardening and cooking, but I’ve never wanted to dress up for any sort of costume party or organize activities for a group of people. I’m 28, and as I’ve done all my life, I let my hair air dry on my day to work (or wherever), and spend exactly three minutes putting make-up on in the morning. I do, however, thoroughly enjoy buying shoes, and jeans…
My point is, many of the finer points of being a traditionally good woman, like hostess abilities, following traditions and social rules are totally lost on me. This may all be related to my issues with tradition. Like, getting married at the Courthouse in Milwaukee and never regretting it, especially after hearing many new-bride friends talk about their weddings.
In fact, every time a close friend navigates their wedding planning and execution (which has basically been constantly for about eight years now) I take a moment to reassess my feelings about weddings, about whether I feel I missed out. And surprisingly, to myself anyway, I never feel I have.
But back to yacht rock, perhaps the reason I so look forward to Joe and Rachel’s parties is that they are so different. I mean, they are planning a Canada Day party for God’s sake, how hip is that? And while I have no idea how they came up with the idea of theming a party around smooth rock (think Steely Dan) and nautically themed beers, I know it will never be done again, or at least I will never be invited to one again.
Besides that, there is no pretention at these parties. When you come up with an idea so equally fresh and preposterous, it hardly evokes your cousin’s last baby shower. You can come wearing, say, jeans and a t-shirt, or, plaid (think rainbow colors) cotton shorts, a maroon polo, a horrid blue suit jacket topped off with a captain’s hat and white tennies circa 1988. You can drink beer from cans, neon wine coolers, or a martini. And nobody cares.
This is also the beauty of having a healthy number of journalist-types among one’s friends. They are inteligent and well-read, but usually bitter and jaded enough by their mid-20s to be down-to-earth, fun companions. I became bitter and jaded with many of them, so we get along well.
The last few months I’ve been helping a friend out with her web site, which is kind of humorous, because I know next to nothing about web design. She was looking for a simple, cheap way to get a nice-looking web site to help start up her personal chef business, and after talking it over with a few people, she decided to try to use a blog format.
I love wordpress, especially after using blogger, and had just had enough experience with the basics of it to help her along. It turned into more work than expected, but it was a great project to jump-start my desire to learn a little more html and CSS. During this process, I decided to purchase my own CSS upgrade, so I can play around with my own site here and there. Moral of the story, you may be seeing construction for a while. Oh, and please check out our handiwork at your leasure, especially if you are needing a personal chef in Milwaukee.
What I really wanted to share with anyone reading this late Friday afternoon, however, is the beauty of dooce. I discovered dooce a few months ago after checking out the links on Rachel‘s page, and was instantly impressed with her exquisitely crafted wit and sarcasm. I’ve been hooked on her blog ever since.
Yesterday, after having a crappy day at work, when I realized I was not getting nearly the commission check I expected (long, irritating story), I read her new post on hate mail (she gets like 100,000 hits a day or something ridiculous like that). I made the mistake of sipping water as I read and almost spit it all over my keyboard a few times. My co-workers were also stressed out about the commission situation, so I happily introduced them to dooce, so they could laugh out loud at their desks too. So, if you need a laugh, a little pick-me-up, please enjoy.
Disclaimer: dooce is both irreverant and at times vulgar, and I love every word of it!
|
{
"pile_set_name": "Pile-CC"
}
|
Brief Report: Modest but Clinically Meaningful Effects of Early Behavioral Intervention in Twins with Rett Syndrome-A Case Study.
A growing evidence base supports early intensive behavioral intervention (EIBI) for young children with autism spectrum disorder. We have found only one study exploring the outcome of EIBI for children with Rett syndrome, which reported little effect. It suggested that future studies should employ more fine-grained outcome measures. We provided EIBI for twin 3-year-old girls with Rett syndrome for a period of 3 years. We analyzed raw scores and standard scores from a measure of adaptive behavior and a detailed assessment of skills across 25 areas. We detected moderate but clinically meaningful gains in areas such as communication and self-help. Gains are discussed from a quality of life perspective and whether the moderate effects can justify the resources required in EIBI.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
A Digest of Political, Economic, Cultural and Historical News from Poland
"Be Not Afraid!" ... John Paul II
Important issues analyzed in-depth by Poland's foremost experts.
“Russian intelligence services activated all of their media, agent-of-influence, and business assets in Poland” reports ABW, the Polish Internal Security Agency.
Published: May 21, 2015
Maciej Sankowski’s analysis of the ABW (Polish Internal Security Agency) 2014 report, published on Defence24 website, reveals that Russian intelligence has made a wide-scale attempt to consolidate its pro-Russian assets in Poland. Mr. Sankowski says, that unfortunately, the ABW 2014 report has not attracted the media attention it deserves. “There is no doubt that this specific report is the most unambiguous, powerful, and at the same time, the most interesting of all the ABW’s annual reports published thus far,” emphasizes Sankowski.
The report makes references to the events beyond the Polish borders as well; primarily to the situation in Ukraine. In this instance, the report illustrates attempts to give prominence to, and to emphasize, tough times in the shared Polish-Ukrainian history in order to incite conflicts and disagreements in mutual relations between both nations. The authors of the report state that Brussels played a key role in the Russian intelligence operations against Poland, primarily aimed at discrediting the Polish stance on the Russian aggression towards Ukraine. Further more, it draws attention to the statements made by those Polish politicians, and experts, who questioned the entire course of the Polish foreign policy.
The report confirms that this is the first time the Russian Federation intelligence has attempted such a wide-scale consolidation of the pro-Russian assets across Poland.
“Simply speaking, the Russian intelligence has activated all socially and politically varied interest groups. Interestingly enough, the views that openly support Kremlin’s policies have also made numerous appearances in the Polish mainstream media,” says Mr. Sankowski.
He continues to point out, that in addition to overt manipulations of the existing media outlets, a new, and openly pro-Kremlin, news outfit called Sputnik, has recently made its appearance on the Polish media scene. The Sputnik allied itself with the Hobby, a local radio station from the Polish region of Legionowo. The Hobby is contracted to disseminate Russian-made productions in the Polish language.
Sankowski emphasizes that the station co-opted a number of public figures with diverse social and political views, including Artur Zawisza (extreme right-wing politician), Piotr Fogler (a keen supporter of the Polish Civic Platform, PO) or Agnieszka Wołk Łaniewska (a journalist for the NIE weekly).
Mr. Sankowski also emphasizes that Russian Federation foreign intelligence services intensified their lobbying activities on behalf of Russian businesses operating on the Polish market. “Lobbying is yet another tool for the Russian intelligence and GRU (the Russian Main Intelligence Directorate) that is used overtly and covertly,” says Sankowski.
Here, as an example, the author uses the case of the Russian Acron Group, that tried to take over strategically-important Polish nitrogen company, the Azoty Group. Although the case of Acron is the most familiar, it is not the only one that was to test Poland’s integrity. Other similarly extravagant incidents occurred within the nuclear energy and power plants sectors, but their details remain undisclosed.
In order to sabotage any attempts of shale gas extraction in Poland, Russia has undertaken a wide variety of activities (including media manipulation, lobbying and political influence) at the European level. Mr. Sankowski emphasizes that active attempts to effect changes in the legislature, and unusual interest in the activities of the Polish Parliament, have also been noted. In this instance, the Russian interest went far beyond of what is considered an ordinary monitoring, as it enlisted Russian intelligence personnel to carry out these activities.
The case of Leonid Sviridov, a Russian correspondent for the Ria Novosti, is yet another example of Poland’s integrity being tested. Based on the ABW’s findings, Sviridov lost his Polish Ministry of Foreign Affairs accreditation; followed by the annulment of his right to a permanent stay in Poland, and despite the Russian Ambassador’s intervention in his defense. Sviridov’s activities went well beyond journalistic standards.
For example, he engaged in the lobbying activities for Acron, which aimed to take over the above mentioned Polish nitrogen company, Azoty Group. During the course of his “journalistic endeavors”, Sviridov organized trips for journalists, and took active part in establishing pro-Russian groups to influence the Polish media. Sankowski is of opinion, that an attempt at Svirinov’s deportation is deeply meaningful, even just to show that Poland will not tolerate such a behavior. The fact that his deportation is likely to cause Russia to retaliate and have one of the Polish correspondents working in Moscow expelled, is a different matter.
According to the 2014 ABW report, the number of incidents and attacks on the Polish government information infrastructure has notably increased. It notes, that 7,500 out of 12,000 reported cases have been identified as actual break-in attempts.
What the Defence24 website finds interesting, is that ABW spells out that it is not only the number of the attacks that have risen, but also their sophistication. This means that these attacks have become more persistent, last longer, and that they are based on modern, and advanced computer science. The principal targets of these attacks are Polish government institutions and the energy industry.
Source: wpolityce.pl
Translation: JD
Other Articles
The crisis of Polish mining industry
The government's plan for the "healing" of the situation in the Polish mining sparked a wave of indignation in the mining community and sparked discussion in Poland on subsidies for Polish mines.
Disclaimer: The views and opinions expressed herein are those of the author and do not necessarily reflect the views the PolandCurrentEvents.com. All information is provided on an as-is basis, and all data and information provided on this site is for informational purposes only. The Poland Current Events DOT COM makes no representations as to accuracy, completeness, currentness, suitability, or validity of any information on this site and will not be liable for any errors, omissions, or delays in this information or any losses, injuries, or damages arising from its display or use.
|
{
"pile_set_name": "Pile-CC"
}
|
Finansiell tillsyn (undertecknande av akter)
Talmannen
Kära kolleger! Låt mig med några få ord presentera vårt undertecknande av paketet om finansiell tillsyn. Detta kommer att vara gjort på några få minuter. Genom paketet upprättar vi den verksamhet som rör finansiell tillsyn som har antagits i enlighet med det ordinarie lagstiftningsförfarandet.
I dag undertecknar vi en lag om en europeisk systemrisknämnd som kommer att vara ansvarig för översynen av unionens finansiella system och bidra till att den inre marknaden fungerar smidigt.
För det andra upprättar vi även tre andra europeiska tillsynsmyndigheter för att skydda allmänhetens intressen. De kommer att utöva tillsyn över banker, värdepapper och marknader och även över försäkringar och tjänstepensioner.
Slutligen undertecknar vi ett omnibusdirektiv, enligt vilket en hel uppsättning med elva direktiv ändras så att de blir enhetliga med det europeiska systemet för finansiell övervakning och med Lissabonfördraget.
Det har lagts ner mycket arbete på detta och min erfarenhet säger mig att samarbetet mellan EU-institutionerna har fungerat mycket bra. Förfarandet gick mycket snabbt, och det var mycket effektivt. De kommande ordförandeskapen, det spanska och det belgiska, var mycket aktiva, och jag tackar dem för ett gott samarbete. Även kommissionen var mycket aktiv och samarbetet bedrevs nära. Till Europaparlamentets ledamöter, vilka stannar kvar i kammaren när vi går och undertecknar, och till kommissionsledamoten vill jag säga att detta är ett mycket bra avtal. Jag tackar även kommissionen, som oavbrutet var aktiv under de förberedande mötena och under alla diskussioner, för dess engagemang.
Men allt arbete är naturligtvis inte avslutat. Även paketet om ekonomisk styrning som vi debatterar inom kort kommer att vara mycket viktigt. Vi vet mycket väl att det är på gång i vårt lagstiftningsförfarande, och vi hoppas att vi kommer att vara klara så snabbt som möjligt.
Vad kan jag sammanfattningsvis säga? Hela paketet som vi undertecknar i dag kommer att börja gälla i Europeiska unionen från och med den 1 januari 2011, alltså mycket snart. Det är viktigt för oss alla, såväl för marknaderna som för våra medborgare, att förstå att avsikten med paketet är att hjälpa medborgarna. Vi ska nu gå och underteckna lagstiftningspaketet.
(Talmannen undertecknar akterna tillsammans med Olivier Chastel (rådets tjänstgörande ordförande), Michel Barnier (ledamot av kommissionen), José Manuel García-Margallo y Marfil (föredragande), Sylvie Goulard (föredragande), Antolín Sánchez Presedo (föredragande) och Peter Skinner (föredragande).)
|
{
"pile_set_name": "EuroParl"
}
|
My Santa gave me a really awesome doctor who canvas bag that's bigger on the inside! It's really great cause now that I go backpacking I can just put all my stuff in the bag instead ;) and if that's not enough there's another gift on the way still! Will update when I get it!
Now for the sad part. I'm using a stock photo because someone actually stole it from me after I picked it up. I was out drinking some beers with my family and the grinch stole this and some other stuff from my bag. :( I'm doing everything I can to try and get it back, but I want my Santa to know I really appreciate it! And it was really sweet!
|
{
"pile_set_name": "OpenWebText2"
}
|
---
abstract: |
We present a brief summary of observations of the transiting extrasolar planet, HD209458b, designed to detect the secondary eclipse. We employ the method of ‘occultation spectroscopy’, which searches in combined light (star and planet) for the disappearance and reappearance of weak infrared spectral features due to the planet as it passes behind the star and reappears. We have searched for a continuum peak near 2.2 (defined by CO and H$_2$O absorption bands), as predicted by some models of the planetary atmosphere to be $\sim 6 \times 10^{-4}$ of the stellar flux, but no such peak is detected at a level of $\sim 3 \times
10^{-4}$ of the stellar flux. Our results represent the strongest limits on the infrared spectrum of the planet to date and carry significant implications for understanding the planetary atmosphere.
author:
- 'L. Jeremy Richardson *and* Drake Deming'
- Sara Seager
title: 'Strong Limits on the Infrared Spectrum of HD209458b Near 2.2 '
---
Background
==========
Our observations cover two predicted secondary eclipse events, and we obtained 1036 individual spectra of the HD209458 system using the SpeX instrument at the NASA IRTF in September 2001. Our spectra extend from 1.9 to 4.2 with a resolution ($\lambda/\Delta \lambda$) of 1500. A summary of the method of occultation spectrosocpy, as well as the details of the data analysis, can be found in Richardson, Deming, & Seager (2003).
Results and Discussion
======================
The final difference spectrum, shown in Figure 1, represents the average candidate planetary spectrum, as calculated from the ‘in-eclipse’ minus the ‘out-of-eclipse’ spectra from the two nights during which a secondary eclipse was predicted to occur. The average spectrum represents data from 550 individual spectra of HD209458, as well as an equal number of spectra of the comparison star HD210483. The comparison star was used in our analysis to remove variability due to changes in the terrestrial atmsophere and to normalize the data to the stellar flux density. Also shown in Figure 1 is the baseline model for HD204958b calculated by Sudarsky, Burrows, & Hubeny (2003), which exhibits a peak near 2.2 . A least-squares analysis indicates this peak is not present in the candidate planetary spectrum as derived from the data.
We believe this result has significant implications for the structure of the planetary atmosphere. In particular, some models that assume the stellar irradiation is re-radiated entirely on the sub-stellar hemisphere predict this flux peak, which is inconsistent with our observations. Several physical mechanisms can improve agreement with our observations, including the re-distribution of heat by global circulation, a nearly isothermal atmosphere, and/or the presence of a high cloud.
=3.7in
Richardson, L. J., Deming, D., & Seager, S. 2003, , 597, 581 Sudarksy, S., Burrows, A., & Hubeny, I. 2003, , 588, 1121
|
{
"pile_set_name": "ArXiv"
}
|
Q:
HTML canvas change text according to input text
I want to change the text that is on a canvas. The problem that it is just adding and not removing letters as I delete them from the input.
http://jsfiddle.net/pgo8yzrc/
var c = document.getElementById("myCanvas");
var ctx = c.getContext("2d");
window.change = function(val){
ctx.restore();
ctx.font = "20px Georgia";
ctx.fillText(val, 10, 50);
ctx.save();
}
<canvas id="myCanvas"></canvas>
<input type="text" onkeyup="change(this.value)" />
Why adding text working and removing is not working. can you please correct that?
Thanks
A:
Try this:
var c = document.getElementById("myCanvas");
var ctx = c.getContext("2d");
window.change = function(val){
ctx.clearRect(0, 0, c.width, c.height);
ctx.restore();
ctx.font = "20px Georgia";
ctx.fillText(val, 10, 50);
ctx.save();
}
See working example here
Upd.:
If you have background add function:
function fillBackground() {
ctx.fillStyle = "blue";
ctx.fillRect(0, 0, c.width, c.height);
}
Then use it before window.change and after ctx.clearRect
|
{
"pile_set_name": "StackExchange"
}
|
-----BEGIN CERTIFICATE-----
MIIDATCCAemgAwIBAgIBAzANBgkqhkiG9w0BAQsFADAuMRAwDgYDVQQKDAdDb2Nr
cGl0MQ0wCwYDVQQLDAR0ZXN0MQswCQYDVQQDDAJDQTAeFw0yMDA3MTYxMDAwMDRa
Fw0yMDA3MTcxMDAwMDRaMD4xDjAMBgNVBAMMBWFsaWNlMRcwFQYKCZImiZPyLGQB
GRYHQ09DS1BJVDETMBEGCgmSJomT8ixkARkWA0xBTjCCASIwDQYJKoZIhvcNAQEB
BQADggEPADCCAQoCggEBAKCyJitfhk/xbb+Y9vOX5qbNu6ZKggvmDvT7NLv8PZoV
zi8GYtDhCCBEj80tfAbFlf34Vk/TtLFEbuETFpeMKjgX15dTtvUHOYfUQ1pSOIAa
rDPrf57rcbtxkTUHEgVg21RxzglTl17VQjl7JzS3F/pr/JifleGKxgTWDNAfpQJF
tppLkanzSOfNDGTy2cxv82I20SSI5AhAXKz7h3NWnXCBdinFbhtlkAl/j9zlZJou
dCht6qA92ZvbOjl6ta+DlykCg0fMuRiy4X96DRwCdCW8Bht/g1x0AlUXUI5MKH68
xmnb2xeYwFrT5Tf0p20kVIQaBjOD9mmywYNnlfWu/nsCAwEAAaMaMBgwCQYDVR0T
BAIwADALBgNVHQ8EBAMCA6gwDQYJKoZIhvcNAQELBQADggEBAAlw3KdjUyhGJoQ9
E4rMFkZcEpY1T9sNvk1NKqzFgk9IV0uMvefs0r6Q+B790U2JbjcXfRXkfN/0+VEf
k+bx2ReHXkNhRoiP2bNhSPelm9HXdCzEtSegat8o6ze5/Dp74ALLBxsPyZehO2h/
uNL4d3tJ6Rl3rc4yv6Ap0sqSSi9nvjoAAJtJp9XuHTzRlWNeDYU+8Tc/bhJYk1jA
KAmmrFpuMnE/JC3eJ63foM8oiww3dCYK4efq5UXMz844QswZjk9YTGSMal3/V01V
Wy26r7soTOCPBRoPynF4A/JatWBBa/9TbYWO/+bJe6ctophkFC77jC8MJCz9r0JC
3eTDbwI=
-----END CERTIFICATE-----
|
{
"pile_set_name": "Github"
}
|
You made a typo in the title? You were probably drunk. Have an upvote.
15,390 shares
|
{
"pile_set_name": "OpenWebText2"
}
|
Data Breach Led to Multi-Million Dollar ATM Heists
A nationwide ATM heist late last year netted thieves $9 million in cash in one day, according to published reports. The coordinated attack stemmed from a computer intrusion at payment processor RBS WorldPay.
Atlanta-based RBS WorldPay announced on Dec. 23 that hackers had broken into its database and made off with personal and financial data on 1.5 million customers of its payroll cards business. Some companies use payroll cards in lieu of paychecks by depositing employee salaries or hourly wages directly into payroll card accounts, which can then be used as debit cards at ATMs. RBS said that thieves also might also have accessed Social Security numbers of 1.1 million customers.
New York's Fox 5 cites FBI sources as saying that thieves used the stolen payroll cards recently to withdraw $9 million from ATMs from 49 cities, including Atlanta, Chicago, New York, Montreal, Moscow, and Hong Kong.
Steve Lazarus, a spokesman for the FBI's Atlanta field office, said the withdrawals were carried out by a small army of so-called "cashers," or people who work with cyber thieves and fabricated cards to pull money out of compromised accounts.
From the Fox piece:
"Shortly after midnight Eastern Time on November 8, the FBI believes that dozens of the so-called cashers were used in a coordinated attack of ATM machines around the world."
"This was a well-coordinated attack by some pretty computer and network savvy people, even at the lowest levels of cashers taking cloned cards to ATMs," Lazarus said.
Lazarus declined to confirm the $9 million figure, but said the amount stolen was indeed "a very substantial amount" over a short period of time in early November.
"This was a nationwide coordinated effort, and there were certain aspects of it that were international as well," Lazarus said. "People are out there attacking computers every day. But what sets this one apart is the scope, timing and coordination of the attack."
One interesting aspect of this attack is that while the attackers evidently had access to more than a million RBS customer accounts, they were able to haul the loot by repeatedly refueling only 100 payroll cards, Fox News reports.
Sources close to the investigation told Security Fix that the criminals used fake payroll deposits to artificially inflate the amount of money on the cards, money that was then drained at ATMs and subsequently replenished with additional bogus payroll deposits.
News of the complex ATM heist was little surprise to Ori Eisen, founder of 41st Parameter, a company that consults with banks and retailers to help staunch fraud losses. Eisen said he recently heard from three different clients in the banking sector who told him that some $50 million was lost to ATM fraud in New York City alone over the course of one month last year.
"ATM fraud is spiking," Eisen said. "For New York financial institutions alone to have $50 million in ATM fraud in one month...that's incredible. The thieves are getting a lot more money from the ATMs now than they used to."
|
{
"pile_set_name": "OpenWebText2"
}
|
Thirty-five percent of adults in the United States and United Kingdom have chronic lower limb superficial venous disease. [@JR1900086oa-1] Varicose veins are more common in females, with a predilection toward the older age group and may run in families. A body mass index \>30 kg/m ^2^ is a risk factor for chronic venous insufficiency. [@JR1900086oa-2] Symptoms include limb heaviness, ache, and edema. Skin changes such as spider veins, varicose veins, hemosiderin deposition, inflammation, lipodermatosclerosis, and ulceration often follow in untreated cases. [@JR1900086oa-2] [@JR1900086oa-3] [@JR1900086oa-4]
The 2013 National Institute for Health and Care Excellence (NICE) guideline on diagnosis and management of varicose veins (updated March 2018) recommends radiofrequency ablation (RFA) or endovenous laser ablation (EVLA) as first line treatment for truncal reflux. Second-line is ultrasound-guided foam sclerotherapy. Open surgery is indicated only if the other methods are unsuitable. Any incompetent tributaries are preferentially treated in the same session. Compression hosiery should not be used longer than 7 days after intervention, and is first choice only in pregnancy or if the previously mentioned interventions are unsuitable. [@BR1900086oa-5] NICE also issued a specific guideline in 2015 on the use of *n* -butyl-2-cyanoacrylate (NBCA) for varicose veins but did not promote its routine use. [@BR1900086oa-6] Almeida et al reported the first human application of NBCA for incompetent great saphenous veins (GSVs) in 2013. All 38 veins under study were obliterated at 48 hours and 92% at 1 year with minor short-lasting adverse effects. [@JR1900086oa-7]
The aim of this systematic review is to assess the efficacy of NBCA in ablating primary truncal varicose veins and eliminating reflux compared with existing endovascular techniques in the immediate, medium, and long-term settings. Secondary outcomes include complications, patient acceptability, and quality of life.
Methods
=======
Protocol and Search Strategy
----------------------------
This review is registered in PROSPERO database (registration code: CRD42018106323) and followed the PRISMA checklist. [@BR1900086oa-8] [@JR1900086oa-9] One author performed a literature search and data extraction up to October 2018 with no set date range and using established MeSH vocabulary in PubMed, EMBASE, Scopus, Cochrane Library, and ScienceDirect. Search terms were: "varicose vein," "saphenous vein," "glue," " *n* -butyl cyanoacrylate," and " *n* -butyl 2 cyanoacrylate." References and article suggestions by search engines were assessed to identify more relevant studies. Duplicates were removed and further exclusions performed after reviewing abstracts. The chosen manuscripts were then scrutinized while applying inclusion and exclusion criteria.
Inclusion and Exclusion Criteria
--------------------------------
Human randomized controlled trials (RCTs), cohort studies, and case reports in English language involving the use of NBCA to treat primary truncal varicose veins (i.e., GSV, small saphenous vein \[SSV\], and anterior accessory saphenous vein \[AASV\]) were included. If more than one modality was used, the said manuscript was only included if the data for NBCA could be fully extracted. Studies excluding NBCA glue or comparing NBCA with treatments other than RFA, EVLA, or foam sclerotherapy were excluded. [@JR1900086oa-1] [@JR1900086oa-2] [@JR1900086oa-10] [@JR1900086oa-11] [Supplementary Table 1](#SM1900086oa-1){ref-type="supplementary-material"} (online only) summarizes patient characteristics for inclusion/exclusion.
Primary and Secondary Outcomes
------------------------------
Primary outcome was successful obliteration of lumen of target vein, defined as occlusion of the entire treated vein segment with no discrete segments of patency exceeding 5 cm, confirmed on color Duplex ultrasound (DUS) after the procedure. [@JR1900086oa-1] Follow-up DUS assessments at 3 days, 7 days, 1 month, 3 months, 6 months, 1 year, and 2 years were examined.
Influence of vein length, diameter, NBCA device, and postoperative compression stockings on early (3 months) and intermediate term (6 months, 1 year) occlusion rate was taken as secondary outcomes. Vein length was taken as a mean value incorporating GSVs, SSVs, and AASVs with no distinction between the three. Where a particular vein diameter was taken at different levels, the mean of these values was calculated.
Clinical, Etiological, Anatomical, and Pathophysiological classification and Varicose Clinical Severity Score (VCSS) were used to measure severity of varicose veins at baseline and postintervention. Quality of life was primarily investigated using the Aberdeen Varicose Vein Questionnaire (AVVQ). [@JR1900086oa-2] "Thrombophlebitis" and "abnormal skin reactions" in treatment zones were included with the general term "phlebitis." [@JR1900086oa-12] [@JR1900086oa-13] All thrombus extensions into the deep venous systems were classified as deep vein thromboses (DVTs). Complications common to the three ablation modalities were evaluated.
Data Extraction
---------------
Any uncertainties in the literature were discussed with the second author and the authors of the original manuscripts where applicable. Risk of methodological bias was explored using the Cochrane Risk of Bias tool for RCTs. [@BR1900086oa-14] [@JR1900086oa-15] Quality assessment was performed using the Downs and Black quality assessment tool (for RCTs) and the National Heart, Lung and Blood Institute: Quality Assessment Tool for Before-After (Pre--Post) Studies With No Control Group (NHLBI-QAT). [@JR1900086oa-16] [@BR1900086oa-17]
Statistical Analysis
--------------------
Continuous variables were represented by means, standard deviations, and ranges. Categorical variables were shown in actual numbers and percentages. Scatter plots were created using Python version 3.7 (Python Software Foundation, Beaverton, DE). Statistical analysis was done using IBM SPSS Statistics software (IBM Corp. Released 2013. IBM SPSS Statistics for Windows, Version 22.0. Armonk, NY). Spearman\'s correlation and Mann-Whitney U-test were performed on groups of subjects at 3, 6, and 12-month intervals following NBCA treatment. These tests were chosen because continuous variables were not normally distributed. Level of statistical significance was taken as *p* \< 0.05.
Results
=======
Description of Studies
----------------------
The PRISMA flowchart ( [Fig. 1](#FI1900086oa-1){ref-type="fig"} ) depicts the choice of manuscripts at different phases. One case report was identified but not reviewed as it contained heterogeneous data. [@JR1900086oa-18] All were published in peer-reviewed indexed scientific journals. There were 3038 participants (3,220 veins). A subgroup of 128 patients were excluded because of the missing data. [@JR1900086oa-19] [@JR1900086oa-20] [@JR1900086oa-21] Of the 2910 patients who were included, 1981 received NBCA, 445 RFA, and 484 EVLA. Comparison of NBCA with RFA and/or EVLA was performed in three RCTs and two retrospective studies. [@JR1900086oa-10] [@JR1900086oa-12] [@JR1900086oa-19] [@JR1900086oa-21] [@JR1900086oa-22] No studies compared NBCA with sclerotherapy, but this was frequently used an adjunctive treatment. Levels of evidence for therapeutic studies were judged using criteria from the Centre for Evidence-Based Medicine. [@JR1900086oa-23]
{#FI1900086oa-1}
Quality and Risk of Bias Assessment
-----------------------------------
### Randomized Controlled Trials
Risk of bias for RCTs is illustrated in [Table 1](#TB1900086oa-1){ref-type="table"} . Bozkurt and Yilmaz pseudorandomized their patients to alternate EVLA and NBCA. This led to a high risk of selection bias. [@JR1900086oa-10] Randomization was better in the VeClose trial and the study by Eroglu and Yasim. [@JR1900086oa-1] [@JR1900086oa-12] [@JR1900086oa-19] The former also included "roll-in cases" so that investigators could achieve familiarity with the NBCA procedure. DUS assessments were not always performed by blinded personnel. Attrition bias was unclear in two RCTs as drop-outs were not formally analyzed. [@JR1900086oa-13] [@JR1900086oa-20] Effect of adjunctive therapies and postoperative compression stockings was not evaluated. Only one performed power analysis. [@JR1900086oa-19] Primary and secondary end points were clearly reported in all RCTs.
###### Traffic light plot illustrating risk of bias of the included RCTs (using the Cochrane risk of bias tool) and Downs and Black quality assessment scores
--
--
Abbreviation: RCT, randomized controlled trials.
Note: The score for item 27 in the Downs and Black checklist was modified to determine whether power analysis was conducted (yes = 1 point) or not (no = 0 points). So, the maximum score for the checklist was 28 instead of 32. [@JR1900086oa-24]
### Prospective and Retrospective Studies
Prospective studies were of a higher methodological quality ( [Supplementary Fig. 1](#SM1900086oa-1){ref-type="supplementary-material"} and [Supplementary Table 2](#SM1900086oa-1){ref-type="supplementary-material"} \[online only\]). Selection bias toward bilateral varicose veins was observed in one prospective and one retrospective study. [@JR1900086oa-25] [@JR1900086oa-26] Another reported a modification of intervention after commencement of data collection which improved the complication rate in the remaining patients. [@JR1900086oa-27] Blinding of assessors was not possible. The loss to follow-up for NBCA was 23.7% in one manuscript. [@JR1900086oa-28] Another started with 34 patients and had 26% loss at 1 month. [@JR1900086oa-13] One prospective and one retrospective study reported percentage occlusion rate only once at 1 month and 1 year respectively despite mentioning several follow-up intervals in the methodology. [@JR1900086oa-13] [@JR1900086oa-22] Coincidentally, the former did not have sufficient patients at the target 3-month interval to formulate strong conclusions. [@JR1900086oa-13] Another study did not differentiate between the short- (1 week) and mid-term (2 months) outcome results, which instead were displayed as combined absolute values. [@JR1900086oa-21]
Population and Operative Details
--------------------------------
Study characteristics are summarized in [Tables 2](#TB1900086oa-2){ref-type="table"} and [3](#TB1900086oa-3){ref-type="table"} .
###### Characteristics of identified studies
------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
First author Year Country Study design, Evidence level Single/Multicenter Comparator Recruitment period NBCA patients Comparator patients Patients excluded Proposed follow-up (mo) Actual follow-up (mo) Definition of varicose vein and/or vein incompetence
-------------------------------------- ------ ------------------------ ------------------------------ -------------------- ------------ ---------------------------------------- --------------- --------------------- ------------------- ------------------------- ----------------------- ---------------------------------------------------------------------------------------------------------------------------------------------
Bozkurt and Yilmaz [@JR1900086oa-10] 2016 Turkey RCT, 1B Multicenter EVLA December 2013--March 2014 (3 mo) 154 156 EVLA -- 12 12 CEAP C2-C4b with SFJ incompetence and GSV reflux lasting \>0.5 s on DUS.
Morrison et al [@JR1900086oa-12] 2017 United States RCT, 1B Multicenter\ RFA March--September 2013 (6 mo) 108 114 RFA -- 12 12 GSV reflux ≥0.5 s on DUS in the standing position.
VeClose Trial
Eroglu and Yasim [@JR1900086oa-19] 2018 Turkey RCT, 1B -- RFA, EVLA November 2014--June 2015 (7 mo) 168 139 EVLA\ 69 24 24 GSV \>5.5 mm and SSV \>4 mm in diameter 2 cm below the SFJ and SPJ with the patient standing, and reflux \>0.5 s.
149 RFA
Proebstle et al [@JR1900086oa-33] 2015 Europe (multinational) Prospective, 2B Multicenter None December 2011--July 2012 (7 mo) 70 -- -- 12 12 Primary GSV incompetence diagnosed clinically +/− visible varicosities and confirmed by DUS. GSV diameter ≥3 mm and ≤10 mm on standing DUS.
Kolluri et al [@JR1900086oa-34] 2016 United States Prospective, 2B Multicenter None March--September 2013 (6 mo) 20 -- -- 12 12 Moderate to severe varicosities and venous reflux in the GSV \>0.5 s.
Çalık et al [@JR1900086oa-29] 2016 Turkey Prospective, 2B Multicenter None April--September 2014 (5 mo) 181 -- -- 6 7.5 GSV insufficiency with \>0.5 s of reflux.
Tekin et al [@JR1900086oa-30] 2016 Turkey Prospective, 2B Single center None January--July 2014 (6 mo) 62 -- -- 6 8 Symptomatic incompetent GSV with a diameter of \>5.5 mm, with or without visible varicosities.
Chan et al [@JR1900086oa-25] 2017 China Prospective, 2B Single center None September 2014--October 2015 (13 mo) 29 -- -- 12 9 Retrograde SFJ flow ≥0.5 s on DUS with patient standing.
Gibson and Ferris [@JR1900086oa-32] 2017 United States Prospective, 2B Single center\ None October--December 2015 (3 mo) 50 -- -- 1 1 Reflux of \>0.5 s of retrograde flow in a varicose vein in the standing position.
WAVES trial
Almeida et al [@JR1900086oa-28] 2017 Dominican Republic Prospective, 2B Single center None December 2010 (1 mo) 38 -- -- 36 36 Clinical venous reflux disease in the GSV +/− varicosities, and confirmed by DUS.
Eroglu et al [@JR1900086oa-20] 2017 Turkey Prospective, 2B Single center None May--October 2014 (5 mo) 168 -- 12 30 30 GSV diameter \>5.5 mm and a SSV diameter \>4 mm in conjunction with reflux \>0.5 s.
Park [@JR1900086oa-13] 2017 South Korea Prospective, 2B Single center None December 2016--February 2017 (2 mo) 34 -- -- 3 3 Saphenous vein with ≥0.5 s of reflux in the standing position with a diameter of at least 3 mm.
Koramaz et al [@JR1900086oa-22] 2017 Turkey Retrospective, 2C Single center EVLA May 2013--August 2014 (15 mo) 150 189 EVLA -- 12 12 GSV diameter ≥5.5 mm and ≤15 mm with reflux \>0.5 s.
Chan et al [@JR1900086oa-26] 2017 China Retrospective, 2C Single center None September 2014--June 2016 (21 mo) 55 -- -- 12 5 Retrograde flow of \>0.5 s on DUS over the SFJ on standing.
Bademci et al [@JR1900086oa-31] 2018 Turkey Retrospective, 2C Single center None September 2015--September 2016 (12 mo) 50 -- -- 12 12 GSV diameter of 5.5--10 mm with reflux \>0.5 s.
Yavuz et al [@JR1900086oa-27] 2018 Turkey Retrospective, 2C Single center None April--July 2016 (3 mo) 538 -- -- 12 12 GSV diameter at SFJ of ≥5.5 mm and ≤15 mm on standing. GSV reflux ≥0.5 s on DUS.
Yang et al [@JR1900086oa-21] 2019 Canada Retrospective, 2C Single center RFA January 2014--December 2016 (3 y) 106 182 RFA 47 2 2 Not defined.
Lane et al [@JR1900086oa-18] 2013 United Kingdom Case report, 4 Single center None March 2012 1 -- -- 6 6 Not defined.
------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
Abbreviations: AASV, anterior accessory saphenous vein; CEAP, Clinical, Etiological, Anatomical, and Pathophysiological; DUS, duplex ultrasound; EVLA, endovenous laser ablation; GSV, great saphenous vein; NBCA, *n* -butyl-2-cyanoacrylate; RCT, randomized controlled trial; RFA, radiofrequency ablation; s, seconds; SFJ, saphenofemoral junction; SSV, small saphenous vein.
###### Intraoperative characteristics of selected studies
Author Ablation device GSV count SSV count AASV count Delivery catheter position distal to SFJ/SPJ (cm) Volume of glue used mean ± SD (range) (mL) Mean Vein diameter mean ± SD (range) (mm) Treated segment length mean ± SD (range) (cm) Procedure duration mean ± SD (range) (minutes) Concomitant treatment of tributaries (e.g., foam, phlebectomy) Concomitant GSV and SSV NBCA treatment Concomitant treatment of GSV and SSV with other endovascular modality (e.g., foam) Postoperative compression stockings
-------------------------------------- ----------------- ----------- ----------- ---------------------------------------------- --------------------------------------------------- -------------------------------------------- ------------------------------------------- ----------------------------------------------- ------------------------------------------------ ---------------------------------------------------------------- ---------------------------------------- ------------------------------------------------------------------------------------ ---------------------------------------------------------------------------------------------------------------------------------
Bozkurt and Yilmaz [@JR1900086oa-10] VariClose 154 0 0 3 -- 7.2 ± 1.8 29.8 ± 5.4 15 ± 2.5 No No No No
Evlas 156 0 0 1.5 N/A 7.1 ± 1.6 29.7 ± 8.1 33.2 ± 5.7 No No No Yes × 10 d
Morrison et al [@JR1900086oa-12] VenaSeal 108 0 0 5 1.2 (0.4--2.3) 5.6 32.8 (8--61) 24 (11--40) No No No Yes, for 3 d continuously, then 4 more days during waking hours.
ClosureFast 114 0 0 -- N/A 5.85 35.1 (6.5--84.5) 19 (5--46) No No No
Eroglu and Yasim [@JR1900086oa-19] VariClose 159 9 0 3 -- 7.6 ± 1.9 26.4 ± 6.5 15.3 ± 2.6 No Yes No Yes, elastic compression bandage for 2 d, then Class 1 for 1 mo.
ClosureFast 146 3 0 -- N/A 7.8 ± 1.9 27.6 ± 5.3 27.3 ± 7.7 No Yes No
Evlas 123 16 0 -- N/A 8 ± 1.9 27.1 ± 5.8 35.0 ± 5.2 No Yes No
Proebstle et al [@JR1900086oa-33] VenaSeal 70 0 0 5 -- 7.8 ± 2.1 (6.6--14) 37.6 (7--72) 18.6 (8--74) No No Yes No
Kolluri et al [@JR1900086oa-34] VenaSeal 20 0 0 5 1.1 (0.6--2.2) 6.1 31.4 (18--50) 31 (23--46) -- No No --
Çalık et al [@JR1900086oa-29] VariClose 206 9 0 3 0.9 (0.7--2.1) 5.85 31.6 ± 6.1 (23--70) 5.4 ± 2.5 (3--14) Yes Yes Yes Elastic bandages x1 d, no compression stockings.
Tekin et al [@JR1900086oa-30] VariClose 62 0 0 5 1.5 7.5 ± 1.5 (5.5--13) 28 (20--40) 17 (9--37) No No No Elastic bandages x1 d, no compression stockings.
Chan et al [@JR1900086oa-25] VenaSeal 57 0 0 4 -- 7.1 (3.9--11.4) 27 (17--33) 64 (28--99) Yes No No Yes
Gibson and Ferris [@JR1900086oa-32] VenaSeal 48 8 14 5 0.93 ± 0.3 7.7 24 ± 12.8 27 ± 11 (11--55) No Yes No No
Almeida et al [@JR1900086oa-28] VenaSeal 38 0 0 3.5 1.3 (0.63--2.25) -- 33.2 ± 9.1 20 (11--33) -- No -- No
Eroglu et al [@JR1900086oa-20] VariClose 159 9 0 3 2 7.4 ± 2.3 (5.5--14) 26.3 ± 6.5 (9--43) 15.3 ± 2.5 (10--25) -- No No --
Park [@JR1900086oa-13] VenaSeal 47 16 0 5 1.2 ± 0.3 8.0 ± 3.7 (3.1--18) 37 ± 15 (5--67) 50.4 ± 20.3 (10--95) Yes Yes -- Yes, only those who underwent concomitant procedures (3 d for miniphlebectomy ( *n* = 15), 7 d for sclerotherapy ( *n* = 19).
Koramaz et al [@JR1900086oa-22] VariClose 150 0 0 3 -- 6.88 ± 1.8 (5.5--15) 31.97 ± 6.83 7 (4--11) No No No No
Evlas 189 0 0 0.5 [a](#FN1900086oa-7){ref-type="table-fn"} N/A 7.15 ± 1.77 (5.5--14) 31.65 ± 6.25 18 (14--25) No No No Yes, class 2 × 2 wk.
Chan et al [@JR1900086oa-26] VenaSeal 108 0 0 4 -- 6.6 (2.3--11.4) 28 (15--41) 64 (28--116) Yes No No Yes, x 1 mo.
Bademci et al [@JR1900086oa-31] VariClose 50 0 0 3 1.5 (1.3--2) 7 (5.5--9) 29.5 (25--36) 25 (20--36) No No No No
Yavuz et al [@JR1900086oa-27] VenaBlock 538 0 0 4 0.87 ± 0.15 (0.4--1.39) 6.7 ± 1.7 (5.5--14.6) 25.7 ± 4.9 (10--43) 11.7 ± 4.9 (5--33) No No No No
Yang et al [@JR1900086oa-21] VenaSeal 83 17 6 -- 1.8 ± 0.1 -- 43 ± 1 -- -- -- -- No
Venefit 289 30 9 -- N/A -- 41 ± 1 -- -- -- -- --
Abbreviations: N/A, not applicable; SD, standard deviation.
Note: Gray, comparators; --, no information.
Evlas: Evlas Circular fiber EVLA kit (1,470 nm) (Biolas, Ankara, Turkey); Closurefast: Closurefast RFA catheter (VNUS Medical Technologies, San Jose, CA); Venefit: Venefit Targeted endovenous RFA therapy system (Medtronic of Canada Ltd, Vancouver, British Columbia).
Distance to superficial epigastric vein.
### *n* -Butyl-2-Cyanoacrylate
Mean age of the recruited population was 49.3 years and 64.8% were females. Most procedures from Turkey used the VariClose NBCA system (Biolas, FG Group, Ankara, Turkey). [@JR1900086oa-10] [@JR1900086oa-19] [@JR1900086oa-20] [@JR1900086oa-22] [@JR1900086oa-29] [@JR1900086oa-30] [@JR1900086oa-31] One study used VenaBlock adhesive (Invamed, Ankara, Turkey). [@JR1900086oa-27] The rest utilized the VenaSeal system (Medtronic, Dublin, Ireland). [@JR1900086oa-12] [@JR1900086oa-13] [@JR1900086oa-21] [@JR1900086oa-25] [@JR1900086oa-26] [@JR1900086oa-28] [@JR1900086oa-32] [@JR1900086oa-33] [@JR1900086oa-34] All procedures commenced by cannulation of the target vein with an introducer needle under ultrasound guidance at the most distal point of reflux. The position of the delivery catheter tip distal to SFJ or SPJ ranged from 3 to 5 cm. The average volume of NBCA glue used was 1.3 mL (range 0.87--2 mL) to treat veins with a mean length of 30.8 cm (range 24--43 cm) and diameter of 7 mm (range 5.6--8 mm). Procedure technique varied depending on the choice of NBCA device.
For VenaSeal, two initial 0.09-mL glue aliquots were injected 1 cm apart, followed by 3 cm pullbacks between each trigger pull. Pressure with Ultrasound (US) probe was applied to occlude the SFJ/SPJ before dispensing the first two aliquots to prevent glue from entering the deep venous system. The first two injections were followed by 3 minutes of compression. US probe pressure was applied for 30 seconds after subsequent injections.
The VariClose system used a similar technique in terms of initial pressure to occlude the SFJ or SPJ before first injection. The trigger was pressed for 5 seconds while withdrawing the catheter by 10 cm (giving 0.06 mL of glue at 2 cm/s). Pressure over each 10-cm segment of treated vein was applied for 30 seconds. Once the entire vein was treated, a further 30 seconds of pressure over the entire target vein was applied. VenaBlock used a similar method.
Recording of duration of NBCA procedures was not standardized. Two prospective studies calculated duration from the time of insertion of NBCA delivery catheter to the time of withdrawal (mean 19.3 minutes). [@JR1900086oa-28] [@JR1900086oa-33] The period from establishing venous access to applying the final bandages was taken as procedure time in another two prospective studies, with an average of 38.7 minutes. [@JR1900086oa-13] [@JR1900086oa-32] An even broader timing interval extended from skin preparation to final bandaging, including phlebectomies (mean 64 minutes). [@JR1900086oa-25] [@JR1900086oa-26] One operator performed the procedures under intravenous sedation, which further extended length of intervention. [@JR1900086oa-13]
### Radiofrequency Ablation
Three studies compared NBCA with RFA. [@JR1900086oa-12] [@JR1900086oa-19] [@JR1900086oa-21] The mean age of patients was 51 years and 72.8% were females. The devices used were ClosureFast (VNUS Medical Technologies, San Jose, CA) and Venefit (Medtronic of Canada Ltd, Vancouver, British Columbia, Canada). Both are similar and require perivenous tumescent anesthesia. Procedure duration was recorded in two RCTs and results were conflicting. [@JR1900086oa-12] [@JR1900086oa-19] On one side, NBCA took longer than RFA (24 vs. 19 minutes, *p* \< 0.01). [@JR1900086oa-1] The other RCT identified a significant reduction in favor of NBCA (15.3 vs. 27.3 minutes, *p* \< 0.001). [@JR1900086oa-19] Neither documented the actual commencement and completion of recording.
### Endovenous Laser Ablation
EVLA was performed on 246 females (50.8%). Mean age was 44.4 years. Evlas Circular fiber EVLA kit (Biolas, Ankara, Turkey) was used in all three studies. It operates at a wavelength of 1,470 nm and uses tumescent anesthesia. Peak temperature reaches 1200°C (compared with 120°C for RFA). One retrospective analysis mentioned the application of manual pressure over the treated vein during laser fiber withdrawal but its benefit in terms of promoting vein closure was not investigated. [@JR1900086oa-22] Compression stockings were prescribed following all EVLA procedures and all agreed that EVLA took significantly longer than NBCA or RFA ( *p* \< 0.001). [@JR1900086oa-10] [@JR1900086oa-19] [@JR1900086oa-22]
Postoperative Success
---------------------
### Occlusion Rate
[Fig. 2](#FI1900086oa-2){ref-type="fig"} shows a substantial initial success rate after NBCA ablation followed by RFA and EVLA, respectively. Although limited, the 2-year NBCA data are superior. There is negligible difference between RFA and EVLA plots from 6 months onward. Partial and complete recanalization rates were lowest for NBCA throughout the period of follow-up.
{#FI1900086oa-2}
### Complications
There were no pulmonary embolic events. Nine cases of postablation DVT were observed in the NBCA group ( [Fig. 3](#FI1900086oa-3){ref-type="fig"} ). [@JR1900086oa-21] [@JR1900086oa-25] [@JR1900086oa-26] [@JR1900086oa-29] [@JR1900086oa-32] [@JR1900086oa-33] Four DVTs were reported in the RFA group and three following EVLA (endovenous heat-induced thrombi Class 1) without statistical significance. [@JR1900086oa-12] [@JR1900086oa-19] [@JR1900086oa-21] [@JR1900086oa-22] All resolved with or without heparin treatment. Bruising was least in NBCA-treated patients. [@JR1900086oa-1] [@JR1900086oa-25] [@JR1900086oa-26] All RCTs reported a statistically significant lower incidence of ecchymosis in the NBCA group. [@JR1900086oa-1] [@JR1900086oa-10] [@JR1900086oa-19] One explanation is that repeated injections are required for tumescent anesthesia in thermal ablation methods while these are avoided in NBCA. [@JR1900086oa-1] However, one retrospective comparative analysis found that five (2.65%) of EVLA-treated patients developed bruising which did not reach the level of significance compared with NBCA, even though such adverse event was absent in the latter cohort. [@JR1900086oa-22] One prospective and one retrospective study by the same author using NBCA concluded that bruising resulted from stab avulsion sites which was performed in the same sitting. [@JR1900086oa-25] [@JR1900086oa-26] Three studies documented minor point bruising at the access site of NBCA delivery catheter due to residual NBCA being applied close to the entry point. [@JR1900086oa-27] [@JR1900086oa-31] [@JR1900086oa-33] Bleeding and hematoma formation were reported in one patient who underwent NBCA ablation and two post-RFA, the latter being at the site of vein access. [@JR1900086oa-19] [@JR1900086oa-30] Paresthesia was temporary and less frequent in the NBCA group. [@JR1900086oa-10] [@JR1900086oa-12] [@JR1900086oa-21] [@JR1900086oa-22] [@JR1900086oa-25] Seven patients complained of pigmentation at the treatment site after NBCA ablation which improved significantly over 1 year. [@JR1900086oa-10] [@JR1900086oa-13] [@JR1900086oa-31] A higher number was reported after EVLA and were shown to be statistically significant. [@JR1900086oa-22] All were temporary. Phlebitis after NBCA ablation was significantly less than post-RFA or EVLA. [@JR1900086oa-21] [@JR1900086oa-22] One RCT reported the opposite, but failed to reach significance level. [@JR1900086oa-1] Most reactions were transient and self-limiting or resolved with a short course of nonsteroidal anti-inflammatory drugs. [@JR1900086oa-1] [@JR1900086oa-13] [@JR1900086oa-26] [@JR1900086oa-32] [@JR1900086oa-33] Antibiotics were prescribed in two studies. [@JR1900086oa-22] [@JR1900086oa-29] [Supplementary Fig. 2](#SM1900086oa-1){ref-type="supplementary-material"} compares the different NBCA glue products with the proportion of veins having postoperative phlebitis. Although inconsistently and heterogeneously recorded, intraoperative pain experience was least for cyanoacrylate procedures, presumably because of the lack of tumescent anesthesia and heat generation. It was therefore better tolerated. [@JR1900086oa-10] [@JR1900086oa-19] [@JR1900086oa-32] Most subjects returned to work the following day and this was superior to RFA and EVLA. [@JR1900086oa-19] [@JR1900086oa-20] [@JR1900086oa-25] [@JR1900086oa-26] [@JR1900086oa-32] One patient developed generalized urticaria after the first week of treatment indicating delayed NBCA allergy. This settled with oral antihistamines and steroids. [@JR1900086oa-32]
{#FI1900086oa-3}
VCSS and Quality of Life Scores
-------------------------------
All endovenous ablation modalities exhibited a statistically significant decline in VCSS scores over time. [@JR1900086oa-10] [@JR1900086oa-12] [@JR1900086oa-19] [@JR1900086oa-20] [@JR1900086oa-22] [@JR1900086oa-25] [@JR1900086oa-26] [@JR1900086oa-27] [@JR1900086oa-28] [@JR1900086oa-29] [@JR1900086oa-31] [@JR1900086oa-33] [@JR1900086oa-34] Two RCTs reported no difference between NBCA and EVLA during follow-up and another favored NBCA at 2 years ( *p* \< 0.001). [@JR1900086oa-10] [@JR1900086oa-19] [@JR1900086oa-22] Two prospective analyses by Gibson and Park were analyzed separately because they used the revised version of VCSS. [@JR1900086oa-35] Mean baseline scores were 6.5 ± 2.4 (3--14) and 4.3 ± 2.1 (2--13). At 30 days, these improved respectively to 1.8 ± 1.4 (0--6) and 1.2 ± 1.0 (0--5) ( *p* \< 0.001 and 0.024). [@JR1900086oa-13] [@JR1900086oa-32]
The AVVQ was the main reporting modality for quality of life. Its downward decline from baseline was significant, consistent, and similar in all groups. Few manuscripts utilized other quality of life scores including EQ-5D, EQ-5D TTO, CIVIQ, and SF-36. All except SF-36 exhibited a significant improvement from baseline. [@JR1900086oa-1] [@JR1900086oa-12] [@JR1900086oa-25] [@JR1900086oa-26] [@JR1900086oa-29] [@JR1900086oa-32] [@JR1900086oa-33] [@JR1900086oa-34]
Influence of Variables on Occlusion Rate
----------------------------------------
Occlusion rate after cyanoacrylate glue treatment is not influenced by vein length, diameter, dispensing device, or use of postoperative compression stockings ( [Table 4](#TB1900086oa-4){ref-type="table"} ).
###### Analysis of the effect of four variables on occlusion rate of NBCA-treated veins (Spearman\'s correlation, Mann-Whitney U test ^b^ )
*p* -Values
------- ------------- ------- ------- -------
3 mo 0.728 0.538 0.593 0.564
6 mo 0.423 0.413 0.295 0.521
12 mo 0.931 0.160 0.873 0.240
Abbreviation: NBCA, *N* -butyl-2-cyanoacrylate.
Discussion
==========
Monomeric cyanoacrylate compounds polymerize upon contact with anionic components of plasma, a process consisting of three distinct phases: initial rapid polymerization with linear increase in tensile forces lasting approximately 10 seconds (phase 1), stable tensile forces lasting approximately 60 seconds (phase 2) followed by a more rapid rise of tensile forces (phase 3). [@JR1900086oa-36] The process of luminal fibrosis after glue injection takes several weeks before it becomes permanent. [@JR1900086oa-37] Adjunctive treatments (phlebectomy or foam sclerotherapy) risk a type 2 error and the confounding potential of these treatments is a subject of future trials. [@JR1900086oa-10] [@JR1900086oa-12] [@JR1900086oa-13] [@JR1900086oa-19] [@JR1900086oa-20] [@JR1900086oa-25] [@JR1900086oa-26] [@JR1900086oa-27] [@JR1900086oa-29] [@JR1900086oa-33]
There were outliers that skewed the NBCA occlusion data at 6 months and 1 year, leading to a dip in success rate at these intervals. [@JR1900086oa-25] [@JR1900086oa-26] [@JR1900086oa-30] Bissacco et al reviewed 1,000 NBCA cases in seven studies (two prospective, four retrospective) and found 96.8% of veins occluded at 12 months. [@JR1900086oa-38] Two studies reported NBCA occlusion beyond the 2-year interval, and these were 94.1% at 30 months and 94.7% at 36 months, respectively. [@JR1900086oa-20] [@JR1900086oa-28] Time to complete occlusion was shorter for NBCA than any of the endothermal modalities because veins are instantly occluded by approximation of their intima, while thermal ablation is dependent on vein wall destruction and subsequent fibrosis---a biological process which takes longer. [@JR1900086oa-12] The outcomes of RFA versus EVLA have been extensively studied in previous trials. Using the ClosureFast RFA system on 200 limbs (163 GSVs and 41 SSVs), Choi et al reported 94.6% occlusion in GSV and 94.5% in SSV at 13.9 months, which is similar to our data. [@JR1900086oa-39] A prospective double-blind RCT comparing RFA versus EVLA (159 patients---79 RFA, 80 EVLA) by Nordon et al identified a 100% occlusion at 7 days. The 3-month occlusion rate reached 97% for RFA and 96% for EVLA. There was no significant difference between the groups. [@JR1900086oa-40] In the LARA study, Goode et al reported 95 and 74% occlusion rate for RFA at 10 days and 9 months respectively. For EVLA, these were 95 and 78%. The high failures at 9 months were attributed to incorrect setting on the RFA which improved to 98% upon adjustment. No reasons for EVLA failures were given but the short wavelength of the laser used (810 nm) and pullback speed might be implicated. [@JR1900086oa-41]
Recanalization does not necessarily signify return of symptoms as many maintain a good quality of life and anticoagulation does not appear to be a predisposing factor. [@JR1900086oa-12] [@JR1900086oa-25] [@JR1900086oa-27] [@JR1900086oa-29] NBCA is noninferior to RFA in terms of freedom from recanalization. [@JR1900086oa-12] Chan et al found a significant risk in their earlier study with vein diameters ≥8 mm, which was reduced to ≥6.6 mm in a subsequent analysis. [@JR1900086oa-25] [@JR1900086oa-26] This was contradicted in the WAVES study which reported 100% occlusion at 30 days using the same NBCA system. However, the latter allowed operators to inject additional glue in larger veins according to their discretion. [@JR1900086oa-32] Other reported determinants of failure were operator experience, anatomical variation (e.g., aneurysms, junction of large varicosities), [@JR1900086oa-29] development of incompetency in a once competent vein, intraluminal thrombus formation (most relevant for failure after thermal ablation), and missing the vein altogether. [@JR1900086oa-12] [@JR1900086oa-22] [@JR1900086oa-25] [@JR1900086oa-26] [@JR1900086oa-29]
There is no officially reported incidence of DVT for NBCA but it is understood to be very low especially if tip of catheter is positioned 5 cm away from the superficial-to-deep vein junction. RFA carries a risk of 0 to 16% and EVLA 0 to 7.7%. Routine postoperative DUS may pick up asymptomatic thrombi. [@JR1900086oa-39] The benefit of anticoagulation for such DVTs is debatable as most resolve spontaneously. Ultrasound guidelines distinguishing thrombus from glue are also lacking. [@JR1900086oa-26] No details about length of stockings were provided (example: thigh high or below knee). Bruising was least after NBCA, particularly when glue injection was stopped 2 cm proximal to the catheter entry site. [@JR1900086oa-27] A modern laser with longer wavelength (1,470 nm) causes less ecchymosis than one with shorter wavelength (810 nm) because it is less damaging to the vessel wall. [@JR1900086oa-2] [@JR1900086oa-41] Prior to this improvement in laser technology RFA was deemed superior to EVLA with regards to postprocedural bruising. [@JR1900086oa-19] [@JR1900086oa-40] [@JR1900086oa-41] Other factors implicated in ecchymosis include the use of tumescent anesthesia, phlebectomies, anticoagulants, body mass index, and ethnicity. [@JR1900086oa-40] Paresthesia typically occurs in 1 to 2% of cases post-RFA and EVLA, and is rare after NBCA. In the latter it is often mild and self-limiting. [@JR1900086oa-2] A few recent studies and case reports address the issue of hypersensitivity reactions causing phlebitis-like signs and symptoms in veins treated with cyanoacrylate glue. Generally these respond well to antihistamines and/or steroids, and may even resolve spontaneously. In those veins requiring excision, histological examination identified features of a type IV hypersensitivity reaction to the glue (foreign body). [@JR1900086oa-42] [@JR1900086oa-43] [@JR1900086oa-44] This is different from the phlebitis encountered after thermal ablation. Patients should be asked about cyanoacrylate allergy preoperatively to minimize risks. [@JR1900086oa-45]
This systematic review has some limitations. The comprehensive literature search and data extraction were performed by one author. It excluded mechanochemical ablation and the period of follow-up was short. A meta-analysis would have been ideal but as highlighted in a recent article, the scarcity and heterogeneity of RCTs made this difficult. [@JR1900086oa-38] As most patients were not sedated, double blinding was impossible. Outcome assessors were often the same ones recruiting, carrying out the treatments and/or following-up patients. This was taken into consideration in part by modifying the Cochrane risk of bias tool. [@JR1900086oa-15] Some methodologies opted for an induction period to cater for the "learning curve" but others did not. [@JR1900086oa-12] [@JR1900086oa-34] One major inconsistency was in the duration of procedures. There are no set standards as to when time-keeping should start and stop. The lack of reproducibility makes these measurements unreliable.
In terms of patient characteristics, one study included more smokers in the NBCA group and another deviated its protocol to include a patient with higher BMI. [@JR1900086oa-12] [@JR1900086oa-28] No differentiation between unilateral or bilateral treatment of varicose veins was made. [@JR1900086oa-25] [@JR1900086oa-26] "Return to normal activities" needs better definition, as these activities are different in an elderly or morbidly obese patient compared with a healthy fit subject. Reflux is best detected in the standing posture on DUS as recommended by the European Society for Vascular Surgery (2015), but some measured this supine. [@JR1900086oa-2] Lastly, it would be interesting to see a trial addressing NBCA use for varicose veins in anticoagulated patients.
Conclusion
==========
This systematic review shows the potential benefits of cyanoacrylate glue over RFA and EVLA. Due to its immediate action, occlusion is retained even without postoperative elastic bandages or compression stockings. Patients experienced less pain as there was no tumescent anesthesia, multiple injection sites, or heat involved. Phlebitis is often mild, self-limiting, and attributed to localized skin reaction to the glue. It can be managed conservatively. Procedure times are generally short and patients typically resume work on day 1 or 2. Failure rates are less but longer-term data are required to affirm this. Cyanoacrylate ablation carries less risk of paresthesia, ecchymosis, and eliminates burn injuries. The two most readily available NBCA kits can be used on various lengths and diameters of veins (including bilateral cases of appropriate length with a single vial of glue). [@JR1900086oa-25]
Ms Claire Gatt, BSc is the statistician who performed statistical analysis on the data.
Ms Bianca-Maria Dimech, BSc Pharm is the second proofreader of the article.
**Conflict of Interest** None declared by the authors.
Not required as data analysis was performed from previously published data.
Supplementary Material
======================
######
Supplementary Material
######
Supplementary Material
|
{
"pile_set_name": "PubMed Central"
}
|
FILED
NOT FOR PUBLICATION MAY 20 2013
MOLLY C. DWYER, CLERK
UNITED STATES COURT OF APPEALS U .S. C O U R T OF APPE ALS
FOR THE NINTH CIRCUIT
CALVIN MATTHEWS, et al., No. 11-17272
Plaintiffs - Appellants, D.C. No. 2:09-cv-02326-FJM
v.
MEMORANDUM *
NPMG ACQUISITION SUB LLC,
Defendant - Appellee.
Appeal from the United States District Court
for the District of Arizona
Frederick J. Martone, District Judge, Presiding
Submitted May 16, 2013 **
San Francisco, California
Before: CLIFTON and BEA, Circuit Judges, and DUFFY, District Judge.***
*
This disposition is not appropriate for publication and is not precedent
except as provided by 9th Cir. R. 36-3.
**
The panel unanimously concludes this case is suitable for decision
without oral argument. See Fed. R. App. P. 34(a)(2).
***
The Honorable Kevin Thomas Duffy, District Judge for the U.S.
District Court for the Southern District of New York, sitting by designation.
Plaintiffs appeal the district court’s grant of summary judgment in favor of
their former employer, NPMG Acquisition Sub, LLC. We have jurisdiction under
28 U.S.C. § 1291, and we affirm.
Plaintiffs ratified the EEOC’s entry of the consent decree, which waived
plaintiffs’ individual claims under 42 U.S.C. § 1981 against NPMG, and thereby
are bound by its terms. Plaintiffs are bound to the decree if by their words or deeds
they ratified the EEOC’s entry of the decree on their behalf. See All-Way Leasing,
Inc. v. Kelly, 895 P.2d 125, 128 (Ariz. Ct. App. 1994) (“A person not bound by a
contract may ratify the contract and thus become bound by its terms, by affirming
the contract through words or deeds.”); Phx. W. Holding Corp. v. Gleeson, 500
P.2d 320, 326 (Ariz. Ct. App. 1972) (“Ratification is the affirmance by a person of
a prior act which did not bind him but which was done or professedly done on his
account, whereby the act . . . is given effect as if originally authorized by him.”)
(quoting Restatement (Second) of Agency § 82 (1958)) (internal quotation marks
omitted).
A court may “infer an intent to ratify if a non-party to the contract
voluntarily accepts benefits conferred by the contract.” All-Way Leasing, 895 P.2d
at 128. Plaintiffs ratified the consent decree by accepting and spending the
settlement payments NPMG paid them pursuant to the decree, while knowing that
2
the decree stated that they had waived any claims that could have been raised in the
EEOC lawsuit. Plaintiffs’ waiver was “voluntary, deliberate, and informed”
because the consent decree’s terms were unambiguous and there was no coercive
atmosphere leading to the waiver of their rights. See Stroman v. W. Coast Grocery
Co., 884 F.2d 458, 461-62 (9th Cir. 1989). Plaintiffs are bound by the consent
decree, and the grant of summary judgment is affirmed.1
AFFIRMED.
1
Because plaintiffs became parties to the consent decree through ratification,
we do not reach whether non-party preclusion bars plaintiffs’ claims.
3
|
{
"pile_set_name": "FreeLaw"
}
|
ENVS Alum Helps Urban Farmers Grow Healthy Food
January 03, 2012
Clair Cummings ('11) and other volunteers work to produce healthy food within city limits.
LeDroit Park, Washington DC
Since September, alumna Claire Cummings (‘11) has been working with a group called Citizen Effect to raise money for the Common Good City Farm project. Citizen Effect produced a short film about Claire’s efforts to help families improve their lives by farming (right there in Washington, DC!) and eating nutritious food.
|
{
"pile_set_name": "Pile-CC"
}
|
The UK's goods trade gap with the rest of the world widened by £1.9bn to a record high of £125bn in 2015, official figures show.
The Office for National Statistics also warned the latest figures would have a negative impact on its second estimate of fourth-quarter economic growth.
But 2015 also saw a record surplus in the UK's dominant services sector of £90bn.
That meant the UK's total trade gap widened by just £300m last year.
The overall deficit - the difference between the amount the UK imports and what it exports - stood at £34.7bn in 2015, the ONS said.
It will publish its second estimate of fourth-quarter economic growth on 25 February.
Image copyright AP
Analysis: Kamal Ahmed, BBC Economics Editor
Britain is very good at exporting services - financial, tourism, creative and legal - where the UK's trade surplus hit a record £90.3bn.
And is notoriously bad at increasing the exports of goods as the UK struggles to rebalance its economy away from consumer consumption towards manufacturing.
The strength of the pound for most of last year is only exacerbating Britain's difficulty selling things abroad.
This has been George Osborne's headache ever since becoming Chancellor in 2010.
Most worrying, trade with Germany and China - the two significant powerhouses of Europe and Asia - weakened in the final quarter of 2015.
There is also an increasing division between the UK's performance in the European Union, where the country's goods trade deficit is widening, and Britain's trade with the rest of the world, where the situation is rosier.
Between 2014 and 2015 exports of goods to countries outside the EU increased by £3.5bn.
Businesses finally seem to be looking beyond the EU's borders for opportunities for growth.
You can read more from Kamal here.
Today's figures also contained December's trade data, which showed the deficit narrowed by £1.3bn to £2,7bn overall in the month.
The goods deficit fell to £9.9bn from £11.5bn in November, but that was thanks to a fall in imports of £1.7bn in December rather than an increase in exports.
A large part of the fall was however accounted for by depressed oil prices, which meant the cost of oil imports fell in value terms to their lowest level since February 2009.
In the three months to the end of December, the UK's trade deficit stood at £10.4bn, compared with £8.6bn in the three months to the end of September.
The UK also suffered a record traded goods deficit of £23.2bn with the rest of the European Union in the fourth quarter of 2015, as exports to other EU countries fell 0.5% and imports from the EU rose 2.7%
The trade deficit is one of the factors cited by analysts as a drag on UK economic growth, which has been exacerbated by the strengthening pound over the past few years.
'Dangerous cocktail'
A stronger pound makes UK exports more expensive for overseas customers.
The UK's overall trade deficit took its toll on growth in the third quarter of 2015, contributing to disappointing economic growth of 0.4%.
Chancellor George Osborne has warned that the economy is facing a "dangerous cocktail" of risks in 2016, ranging from slowing global economic growth to volatile stock markets and the continuing slump in oil prices.
Samuel Tombs, chief UK economist at Pantheon Macroeconomics, said the latest trade figures pointed to net trade subtracting 0.2 percentage points from quarter-on-quarter GDP growth in the fourth quarter of 2015.
"With global trade flows slowing and UK goods still uncompetitive despite sterling's depreciation since December, we expect a poor trade performance to continue to impede the economic recovery this year, " he said.
Paul Hollingsworth, UK economist at Capital Economics, said he believed concerns about a sharp global slowdown were "somewhat overdone".
But he added: "Nonetheless, any progress in reducing the trade deficit is likely to be extremely slow in the near term, leaving the [UK] recovery reliant on domestic demand."
|
{
"pile_set_name": "OpenWebText2"
}
|
Delays in federal permitting for oil and gas exploration on public land is likely reducing national energy production and depriving the federal government of revenue, according to a federal report released Friday.
The report is the latest addition to a mounting body of evidence undercutting the administration’s claims that it has fostered increased oil and gas production, critics say. Production on lands the federal government controls has plummeted during Barack Obama’s presidency.
The United States Department of Agriculture’s (USDA) inspector general examined 1,881 applications for drilling permits on public land. Fewer than 4 percent of those applications were "recent," or filed in the last 180 days. The rest had experienced prolonged delays.
"By not processing these nominations as expeditiously as possible," the Forest Service, a division of the USDA, "may be causing the federal government to forego revenue or prevent or delay the efforts of the private sector to provide energy to the public."
The report is the second analysis by a federal body this month to support claims by administration critics that its energy policies have restricted domestic oil and gas production.
"On every front, when it comes to oil and gas production, [Obama’s] agencies have been doing less and less and making it harder and harder" to extract fossil fuels from federal land, said Dan Kish, senior vice president for policy at the Institute for Energy Research.
The administration continues to tout increases in total U.S. oil and gas production as evidence that its energy policies are furnishing increased domestic energy resources.
But production decreases on federal land have some members of Congress crying foul.
Obama is "trying to use some kind of Jedi mind trick to say, ‘there is no problem here, move along,’" said Rep. Cory Gardner (R., Colo.).
Would-be oil and gas producers "run into nothing but roadblocks and delays" in the federal permit application process, Gardner said.
Gardner is a member of the House Energy and Commerce Committee, which held a hearing last year on those delays.
Chairman Fred Upton (R., Mich.) said at the hearing that the administration had offered "one excuse after another for preventing energy production entirely or subjecting it to years of unnecessary delays."
The president continues to tout total production numbers while avoiding any mention of the decline in production on federal land.
"We produce more oil than we have in 15 years. We import less oil than we have in 20 years," Obama said at a March 15 speech on energy policy. The White House website cites similar statistics.
Obama used his speech this month to push for a plan to use federal oil and gas revenues to pay for renewable energy projects. However, the report made available Friday suggests that his policies are restricting those revenues by delaying approval of oil and gas projects on federal land.
The report came on the heels of a Congressional Research Service report showing that oil and gas production on federal land is currently below fiscal year 2007 levels.
"All of the increase [in crude oil production] from FY2007 to FY2012 took place on non-federal land," the report stated. Natural gas production on federal land fell by about 23 percent during the same time.
CRS found that from 2006 to 2011 the average processing time for an oil or gas drilling permit application on federal land increased from 218 days to 307 days.
As USDA’s IG noted, those delays can reduce energy production and federal lease revenue.
They can also damage communities that depend on small oil and gas producers to power their local economies, according to Dan Naatz, vice president of federal resources for the Independent Petroleum Association of America.
Delays in federal permit applications can have "a devastating impact on communities" in western states such as Nevada where 83 percent of the land is federally owned, Naatz said.
Gardner said his constituents have complained about their inability to secure oil and gas leases on federal land in Colorado. More than a third of the state’s land is federally owned.
One Colorado oil and gas producer recently told the Energy and Commerce Committee that delays in federal permitting for oil and gas production were forcing the company to reconsider activities on federal land.
"While public lands projects almost always take longer than comparable private and state projects, the delays I’ve seen in the last few years make me question for the first time whether I want to undertake new oil and gas business with the federal government," Reed Williams, president of WillSource Enterprise, a small oil and gas drilling company, told the committee last year.
"That’s a strange thing to say since WillSource now believes the project could produce $3 billion worth of natural gas; generating significant job and economic growth," Williams added.
"The bottom line is: If we could access more of our public and private lands, we would be creating more jobs," Gardner said.
|
{
"pile_set_name": "OpenWebText2"
}
|
Kemp Commission
The Kemp Commission, headed by former United States Secretary of Housing and Urban Development Jack Kemp, was a tax reform commission that recommended the current Income tax in the United States be replaced with a flat tax.
History
In 1995, the commission was set up by Robert Dole and Newt Gingrich to study ways to encourage economic growth. After Dole and Gingrich chose Kemp as chairman, each appointed four additional members to the commission. During January 1996, the Kemp Commission reported on overhauling the tax system.
Proposal
The commission concluded that "a flat rate tax would not only be a fairer system for middle-income Americans but also would abolish income taxes for relatively poor people by providing for a generous personal exemption."
The Kemp Commission laid out 6 "points of policy" in its proposal:
A single tax rate
Large personal and dependent exemptions to remove lower-income people from the tax rolls
Lower tax rates for families
Allowing workers to deduct Social Security and Medicare payroll taxes
Ending taxation of interest, dividends and capital gains
Requiring a two-thirds majority in Congress to raise the tax rate.
Response
William G. Gale wrote in a response for the Brookings Institution that "the report is symptomatic of the whole debate on tax reform: there is widespread agreement on the principles of tax reform, much less agreement on what those principles mean in practice, and perhaps very little on how to trade off one principle against another. But the revenue estimates provided above suggest that all of the stated goals of the commission cannot be achieved simultaneously: choices will have to be made between desirable features of the rate structure, the tax base, and extent and direction of social policy."
Accounting firm, Coopers & Lybrand, concluded "that a flat tax offering exemptions for homeownership, charitable contributions, investments, payroll taxes and other priorities favored by the panel would require a rate of at least 25 percent to keep from adding to the deficit."
See also
Tax reform
References
External links
Kemp Commission: Damn the Deficit, Full Speed Backwards by Citizens for Tax Justice
Category:Tax reform in the United States
|
{
"pile_set_name": "Wikipedia (en)"
}
|
Cory Blair
Cory Blair (born 28 June 1985) is an Australian born American rugby union player. Cory plays centre for his club, Huntington Beach, in California. He was selected to tour with the USA national rugby union team, the USA Eagles XV, for the Autumn 2010 tour of Europe. In 2010 he was named in the United States national rugby league team squad for the 2010 Atlantic Cup
His brother, Cheyse Blair, plays for Castleford Tigers in the Super League.
He currently plays rugby league for the Tweed Heads Seagulls.
References
External links
Player Profile eaglesxv.com
scrfu.org
Category:1985 births
Category:American rugby union players
Category:American rugby league players
Category:Rugby union centres
Category:United States international rugby union players
Category:Rugby union fullbacks
Category:Australian people of American descent
Category:Sportspeople from the Gold Coast, Queensland
Category:Rugby league centres
Category:Tweed Heads Seagulls players
Category:Rugby league fullbacks
Category:Living people
|
{
"pile_set_name": "Wikipedia (en)"
}
|
The 23-year-old star also warned hopefuls that there’s a number of audition rounds, telling Capital Breakfast listeners: ‘You have to go in a couple of times,’ she explained, ‘they contact you, you have to do a full-on interview.’
Metro.co.uk have contacted Jane’s rep for comment.
Love Island is set to return to ITV2 later this year.
Got a showbiz story?
If you've got a story, video or pictures get in touch with the Metro.co.uk Entertainment team by emailing us celebtips@metro.co.uk, calling 020 3615 2145 or by visiting our Submit Stuff page - we'd love to hear from you.
|
{
"pile_set_name": "Pile-CC"
}
|
Q:
Retrieve a specific word from the entire string in android?
I have some data in the html format. I am using Html.fromHtml(String) when setting the data to the textview in android. Also the html data contains 2 to 3 images. I want to get the name of the images from the html data and store them in an array. Based on the number of the images in the array I will set them to the imageview. How can I get the image name from src in image tag?
Which one will be the better option .i.e using regular expression or substring?
Please suggest some solutions and help me with some examples.
My Code:
public View getView(int position, View convertView, ViewGroup parent)
{
---
---
desc = (TextView) view.findViewById(R.id.description);
URLImageParser p = new URLImageParser(desc, this);
Spanned htmlSpan = Html.fromHtml(listItem.getdesc(), p, null);
desc.setText(htmlSpan);
----
----
----
----
}
public class URLDrawable extends BitmapDrawable {
// the drawable that you need to set, you could set the initial drawing
// with the loading image if you need to
protected Drawable drawable;
@Override
public void draw(Canvas canvas) {
// override the draw to facilitate refresh function later
if(drawable != null) {
drawable.draw(canvas);
}
}
}
public class URLImageParser implements ImageGetter {
ListAdapter c;
View container;
/***
* Construct the URLImageParser which will execute AsyncTask and refresh the container
* @param t
* @param listAdapter
*/
public URLImageParser(View t, ListAdapter listAdapter) {
this.c = listAdapter;
this.container = t;
}
public Drawable getDrawable(String source) {
URLDrawable urlDrawable = new URLDrawable();
// get the actual source
ImageGetterAsyncTask asyncTask =
new ImageGetterAsyncTask( urlDrawable);
asyncTask.execute(source);
// return reference to URLDrawable where I will change with actual image from
// the src tag
return urlDrawable;
}
public class ImageGetterAsyncTask extends AsyncTask<String, Void, Drawable> {
URLDrawable urlDrawable;
public ImageGetterAsyncTask(URLDrawable d) {
this.urlDrawable = d;
}
@Override
protected Drawable doInBackground(String... params) {
String source = params[0];
return fetchDrawable(source);
}
@Override
protected void onPostExecute(Drawable result) {
// set the correct bound according to the result from HTTP call
urlDrawable.setBounds(0, 0, 0 + result.getIntrinsicWidth(), 0
+ result.getIntrinsicHeight());
// change the reference of the current drawable to the result
// from the HTTP call
urlDrawable.drawable = result;
// redraw the image by invalidating the container
URLImageParser.this.container.invalidate();
}
/***
* Get the Drawable from URL
* @param urlString
* @return
*/
public Drawable fetchDrawable(String urlString) {
try {
InputStream is = fetch(urlString);
Drawable drawable = Drawable.createFromStream(is, "src");
drawable.setBounds(0, 0, 0 + drawable.getIntrinsicWidth(), 0
+ drawable.getIntrinsicHeight());
return drawable;
} catch (Exception e) {
return null;
}
}
private InputStream fetch(String urlString) throws MalformedURLException, IOException {
DefaultHttpClient httpClient = new DefaultHttpClient();
HttpGet request = new HttpGet(urlString);
HttpResponse response = httpClient.execute(request);
return response.getEntity().getContent();
}
}
}
A:
Html.ImageGetter() will be more helpful, it will find the tag <img>
http://developer.android.com/reference/android/text/Html.ImageGetter.html
|
{
"pile_set_name": "StackExchange"
}
|
__________________________________________________________________________________________________
__________________________________________________________________________________________________
__________________________________________________________________________________________________
|
{
"pile_set_name": "Github"
}
|
Q:
ArrayFormula retrieve list by multiple criterias
Input
Data sheet
TaskId ClientId Canceled
1 1 0
2 1 0
3 1 0
4 2 0
5 2 1
6 2 0
7 3 0
Report sheet
ClientId
1
1
2
3
Desired Output
Arrayformula to get all TaskIds from Data by clients where Canceled = 0
TaskIds
1
2
3
1
2
3
4
6
7
I have join + filter formula to drag down, which gives me all TaskIds for clients:
ClientId TaskIds
1 1,2,3
1 1,2,3
2 4,6
3 7
Then I get my result from this helper_column:
=transpose(split(join(",", helper_colum)))
And I want to make this work without need to drag down.
A:
Try this:
=ARRAYFORMULA(TRANSPOSE(SPLIT(CONCATENATE(""&TRANSPOSE(IF(TRANSPOSE(A11:A14)=B2:B8,IF(C2:C8=0,A2:A8,""),""))),"")))
A11:A14=Report sheet Client ID.
A2:C8=Data sheet values.
Cheers
|
{
"pile_set_name": "StackExchange"
}
|
Full steam ahead on the SS "external regulator"? Mandatory reporting, professional independence, self-regulation and patient harm.
Mandatory reporting by medical practitioners of their colleagues who demonstrate poor clinical performance, are intoxicated while working or have sexual relations with patients, has been recently legislated for in New South Wales, and is likely to become law in Queensland. Somewhat similar legislation was introduced in New Zealand in relation to most health practitioners, but resistance, particularly from the New Zealand Medical Association, resulted in discretionary, as opposed to mandatory, reporting. The National Registration and Accreditation Scheme for the Health Professions in Australia is also canvassing mandatory reporting for 10 major health profession registrants, as part of its processes for dealing with performance, health and conduct matters. Mandatory reporting is an important incursion on the self-regulation functions and privileges of the health professions. The medical profession, in particular, has resisted mandatory reporting provisions, but appears not to discern that its allegiance to a model of traditional rather than transparent self-regulation may be self-defeating.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
1. Technical Field
The present invention relates to an electro-optical device, an electronic apparatus having the same, and a mounting structure in which a member is mounted on a mounting substrate, and more particularly, to a technique of performing diagnosis of an electro-optical device and a mounting structure.
2. Related Art
In general, in electro-optical devices, such as active matrix liquid crystal devices, a driving IC and a flexible substrate are mounted on an electro-optical device substrate holding an electro-optical material, and each pixel is driven by signals output from the driving IC or signals generated based on the signals output from the driving IC (for example, see Japanese Unexamined Patent Application Publication No. 2003-57677)
Further, an electro-optical device substrate or a flexible substrate also has a power supply IC, an EPROM, an IC for driving an LED for a backlight, etc., mounted thereon, in addition to the driving IC. However, when a defect occurs in any one of these ICs, a great deal of labor is required to pinpoint the cause of the defect. Therefore, there has been proposed a technique of providing an IC with a self-diagnostic function (for example, see Japanese Unexamined Patent Application Publication No. 5-315418).
In an electro-optical device disclosed in Japanese Unexamined Patent Application Publication No. 2003-57677, an electro-optical device substrate is composed of a rigid substrate, such as a glass substrate. When a crack occurs in this substrate, various wiring lines are broken, which results in defects in display. However, it is difficult to find such a connection defect even if an IC having the self-diagnostic function is provided, as described in Japanese Unexamined Patent Application Publication No. 5-315418.
Further, in a case in which a plurality of ICs is mounted on an electro-optical device substrate or a flexible substrate, when each of the plurality of ICs has a self-diagnostic function, it is necessary for each of the plurality of ICs to output self-diagnosis results, which causes a circuit structure to become complicated.
|
{
"pile_set_name": "USPTO Backgrounds"
}
|
Analysis of a new technique to stabilize the chronic peritoneal dialysis catheter.
A significant cause of morbidity for peritoneal dialysis patients is catheter dysfunction. In our experience, the most common cause of catheter dysfunction was cephalad migration of the catheter tip out of the true pelvis. A new technique for catheter placement that reduces catheter migration from 35% to 6% (P less than .01 chi 2) is described. Our results demonstrate that peritoneal catheters which dysfunction because of catheter flip generally do so in the first 3 months.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
The Systemd Project Forks the Linux Kernel - dezgeg
http://distrowatch.com/weekly.php?issue=20150330#community
======
hleszek
Checking the calendar: not yet first april...
~~~
computer
Looks like a weekly magazine, so this edition would cover April 1st.
------
sspiff
This is not the real systemD repository. This is just some random guy on the
internet who snagged the GitHub username "systemdaemon".
Have a look here:
[https://github.com/systemdaemon](https://github.com/systemdaemon)
A profile created two weeks ago, with a single repository, 0 stars and 1
commit over its entire lifetime.
This is a transparant hoax, and I don't understand how Distrowatch (and the HN
community) has not seen through it yet...
~~~
616c
Thanks for shedding real data on the issue. I was skeptical myself. I checked
out Poettering's Google+ profile and see no mention of this yet, and I was
kind of surprised.
------
616c
I am kind of disappointed that there is some baity qualities to this article,
specifically referencing how Linus chewed out a systemd developer. He did
that, but I recall it not being directly related to his work on systemd and it
negatively impacting the kernel. Kay Sievers is a well-known problem causer as
Linus is concerned, so this is not news.
Keep in mind if you find the mailing list thread referred to, Greg Hartmann
(gregkh), the release maintainer of the Linux kernel, arguably part of the
inner echelons, is responsible for the kdbus branch eventually getting merged
into the mainline kernel, that is the kernel driver that will internalize dbus
as a main (if not only) IPC of the kernel and reducing the overheard of using
dbus now (reducing 12 operations per dbus call to 3 inside the kdbus driver,
IIRC from Lennart's video). Again, this is the work of Lennart Poettering
pulseaudio fame, and now much more heated systemd fame. So to pretend the
Linux kernel is opposed systemd work is not truthful. Some core devs have
taken it on and are staking themselves on it. If this gregkh tidbit does not
make that obvious I do not know what does.
Can someone who knows more comment on what the substantive changes are thus
far? Is the kdbus work a prime motivator of this? I love systemd hate as much
as the next guy, but I was hoping we would get more facts from the HN crowd.
(EDIT: I know I will get downvoted, but I do use systemd and I am not its
biggest fan; I just used Arch and got used to it; everyone has a right to
choose their tools, and init systems ain't different.)
------
thaumaturgy
Debian forums concludes it's a joke too:
[http://forums.debian.net/viewtopic.php?f=3&t=121167](http://forums.debian.net/viewtopic.php?f=3&t=121167)
_sigh_ Guess my news blackout period is gonna have to start extending from
March 30 to April 2 now.
Lame.
------
joosters
They're planning on getting rid of NetworkManager, so they can't be
_completely_ evil :-)
~~~
digi_owl
Bah, sounds like a cure worse than the disease.
------
raverbashing
Here's a group that can take criticism nicely...
Let's feign surprise.
Of course the kernel is GPL and forking is allowed, but I have yet to see such
an idiotic case of tail wagging the dog.
Maybe the guy that wanted to "prove" he's better at managing the Redis than
Antirez is a strong contest
------
fsniper
April fools or the real intension faces water at last?
~~~
networked
>[...] According to Ivan Gotyaovich, one of the developers working on
systemd[...]
I'd say it's a prank but I don't think it's April 1st anywhere in the world
yet.
~~~
digi_owl
A quick search comes up blank on that name.
~~~
palmer_eldritch
Just a quick note about that name "Ivan Gotyaovich": Got ya! -ovitch.
It sounds much more like a prank than a real name.
~~~
slikts
Yeah, there's no such surname as "Готяович"; it's made up.
------
simgidacav
The fork won't last long I guess...
------
hias
so they finally jumped the shark ;-)
|
{
"pile_set_name": "HackerNews"
}
|
REG WindPower
REG WindPower is a renewable energy company, in the United Kingdom.
REG Windpower is one of the UK’s leading developers and operators of small to medium-sized wind farms, operating nine sites in England and one in Wales, with a combined operational capacity of 41.15 MW.
The ultimate parent company Renewable Energy Generation Limited, registered in Jersey, was put into liquidation in January 2016.
Wind farms owned and operated by REG
Its nine operational wind farms are:
Braich Ddu, Glanrafon, Gwynedd;
Goonhilly Downs, the Lizard, Cornwall;
High Haswell, Easington, County Durham;
High Pow, Wigton, Cumbria;
High Sharpley, County Durham;
Loscar, Harthill, Rotherham;
Ramsey, Cambridgeshire;
Roskrow Barton, Penryn, Cornwall;
St Breock, Cornwall;
Whittlesey, Peterborough.
Company history
REG Windpower was founded as the Cornwall Light and Power Company in 1989, and changed its name to REG Windpower in 2010.
REG Windpower is owned by Renewable Energy Generation Ltd.
REG Ltd is listed on the London Stock Exchange Alternative Investment Market (AIM).
As well developing, building and operating wind farms, the group also generates renewable energy from used cooking oil through its subsidiary company REG Bio-Power.
Financial Results
In March 2011, REG reported pre-tax losses, which the company blamed on unusually low wind levels in the preceding year.
Financial Year 2012 - pre-tax loss of £2,313,731
Financial Year 2013 - pre-tax loss of £4,683,136
Financial Year 2014 - pre-tax loss of £4,838,896
Financial Year 2015 - pre-tax loss of £17,678,599
Proposed new wind farms
In October 2011, REG Windpower launched public consultation on several new wind farms in England.
If completed, these projects will have a combined installed capacity of almost 50 MW.
The projects are:
Bank House Farm, Croft, North East Lincolnshire;
French Farm Extension, Thorney, Peterborough;
Grange Farm, Wiltshire;
M48, South Gloucestershire;
Mendennick, Cornwall;
St Breock Repower, Cornwall;
Steadfold Lane, Ketton, Rutland.
Old River Don, Crowle, Lincolnshire
Knockshinnoch, Rankinston, East Ayrshire
Langthwaite, Millom, Cumbria
Controversies
REG Windpower has attracted criticism over their selection of some of their development sites.
Old River Don wind farm - the site chosen for 6 turbines was the site of two World War II graves. A Lancaster bomber crashed in September 1945 and two Australian airmen were never found. The location of one of the turbines was to be close to where the crash site was believed to be.
Knockshinnoch Wind Farm - East Ayrshire Council Planning Committee granted consent for the site on 30 January 2015 despite an objection from West of Scotland Archaeology Service due to the existence of Carline Knowe, a prehistoric cairn sitting just a few metres from the base of the turbines. The site is located 200 metres from the edge of Dunstonhill surface mine which was abandoned following the collapse of Scottish Coal in April 2013. Many local residents were unhappy with further development in this area while Dunstonhill blighted the landscape. The site also sits just 488 metres from the nearest home despite Scottish Government Guidance recommending a minimum separation distance for this size of turbine (126.5 metres height) being 900 metres. In total 26 separate planning policies and guidance were breached however the Planning Committee overturned the advice of the Planning Department to refuse.
See also
Green electricity in the United Kingdom
Wind power in the United Kingdom
Energy policy of the United Kingdom
Energy use and conservation in the United Kingdom
References
Category:Wind power companies of the United Kingdom
|
{
"pile_set_name": "Wikipedia (en)"
}
|
James Kenney/Associated Press
The Pittsburgh Steelers now have to turn to backup quarterback Mason Rudolph after Ben Roethlisberger suffered an elbow injury in Sunday's 28-26 defeat to the Seattle Seahawks.
According to Fox Sports' Jay Glazer, the Steelers plan to have Roethlisberger undergo an MRI to determine the extent of the injury.
One Steelers player told ESPN's Dianna Russini that Roethlisberger was dealing with elbow inflammation earlier in the week leading up to the game.
Pittsburgh selected Rudolph in the third round of the 2018 draft. The former Oklahoma State star didn't appear in a regular-season game as a rookie, which won't be reassuring news to fantasy owners who are relying on JuJu Smith-Schuster and James Washington.
Steelers offensive guard David DeCastro is optimistic about Rudolph, who finished 12-of-19 for 112 yards, two touchdowns and an interception Sunday.
Smith-Schuster is coming off a Pro Bowl appearance in 2018. He caught 111 passes for 1,426 yards and seven touchdowns. His big year provided the team some level of confidence he could step up to replace Antonio Brown.
Through two games in 2019, Smith-Schuster has 11 receptions for 162 yards.
The switch to Rudolph will likely limit Smith-Schuster's big-play ability somewhat since Pittsburgh may not trust Rudolph just yet to make throws deep downfield.
Still, the former USC star had 166 targets in 2018, which were fourth-most in the NFL. He should get enough looks from Rudolph to remain in your lineup.
Washington will be a little tougher to gauge.
He had 16 receptions for 217 yards and a touchdown as a rookie. Most fans likely remember his drop in a defeat to the Denver Broncos last November.
Brown's departure meant a slightly bigger role for Washington, who has registered four receptions for 74 yards so far.
Washington's fantasy ceiling suffers from the fact that he's clearly behind Smith-Schuster in the wide receiver hierarchy and also competing with Diontae Johnson, Vance McDonald and James Conner for targets.
Take Roethlisberger out of the mix, and Washington should head for the bench—if he isn't there already.
|
{
"pile_set_name": "OpenWebText2"
}
|
Associated reactions after stroke: a randomized controlled trial of the effect of botulinum toxin type A.
To measure the impact of botulinum toxin A on associated reactions in patients following stroke. Randomized placebo-controlled trial. Forty patients with spasticity in their paretic arm (median time since stroke: 2.7 years) were randomized to botulinum toxin A (Dysport; 1000 mouse units (MU) divided between elbow, wrist and finger flexors) or placebo. Associated reactions were measured using hand dynamometry. The effort used was measured using maximum voluntary grip in the unaffected arm. Measurements were recorded at 2 pre-treatment and 3 post-intervention times. Activities that patients felt caused associated reactions and activities that were affected by associated reactions were recorded. Peak associated reactions force was reduced at week 6 with botulinum toxin A compared with placebo (mean group difference 19.0 N; 95% confidence interval (CI): 7.2, 30.9; p < 0.01) and week 2 (p = 0.005), with the effect wearing off by week 12 (p = 0.09). Thirty-one patients noted associated reactions on a regular basis and 24 said that these movements interfered with daily activities. Ten of 12 patients receiving botulinum toxin A and 2 of 12 receiving placebo reported reduction in interference with daily activities (p = 0.02). Botulinum toxin A reduces associated reactions and may be a useful adjunct to other rehabilitation interventions. The impact of associated reactions on daily activities may also be reduced.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
<?php
/**
* Zend Framework
*
* LICENSE
*
* This source file is subject to the new BSD license that is bundled
* with this package in the file LICENSE.txt.
* It is also available through the world-wide-web at this URL:
* http://framework.zend.com/license/new-bsd
* If you did not receive a copy of the license and are unable to
* obtain it through the world-wide-web, please send an email
* to license@zend.com so we can send you a copy immediately.
*
* @category Zend
* @package Zend_Uri
* @copyright Copyright (c) 2005-2011 Zend Technologies USA Inc. (http://www.zend.com)
* @license http://framework.zend.com/license/new-bsd New BSD License
* @version $Id: Http.php 23970 2011-05-03 15:46:57Z ralph $
*/
/**
* @see Zend_Uri
*/
require_once 'Zend/Uri.php';
/**
* @see Zend_Validate_Hostname
*/
require_once 'Zend/Validate/Hostname.php';
/**
* HTTP(S) URI handler
*
* @category Zend
* @package Zend_Uri
* @uses Zend_Uri
* @copyright Copyright (c) 2005-2011 Zend Technologies USA Inc. (http://www.zend.com)
* @license http://framework.zend.com/license/new-bsd New BSD License
*/
class Zend_Uri_Http extends Zend_Uri
{
/**
* Character classes for validation regular expressions
*/
const CHAR_ALNUM = 'A-Za-z0-9';
const CHAR_MARK = '-_.!~*\'()\[\]';
const CHAR_RESERVED = ';\/?:@&=+$,';
const CHAR_SEGMENT = ':@&=+$,;';
const CHAR_UNWISE = '{}|\\\\^`';
/**
* HTTP username
*
* @var string
*/
protected $_username = '';
/**
* HTTP password
*
* @var string
*/
protected $_password = '';
/**
* HTTP host
*
* @var string
*/
protected $_host = '';
/**
* HTTP post
*
* @var string
*/
protected $_port = '';
/**
* HTTP part
*
* @var string
*/
protected $_path = '';
/**
* HTTP query
*
* @var string
*/
protected $_query = '';
/**
* HTTP fragment
*
* @var string
*/
protected $_fragment = '';
/**
* Regular expression grammar rules for validation; values added by constructor
*
* @var array
*/
protected $_regex = array();
/**
* Constructor accepts a string $scheme (e.g., http, https) and a scheme-specific part of the URI
* (e.g., example.com/path/to/resource?query=param#fragment)
*
* @param string $scheme The scheme of the URI
* @param string $schemeSpecific The scheme-specific part of the URI
* @throws Zend_Uri_Exception When the URI is not valid
*/
protected function __construct($scheme, $schemeSpecific = '')
{
// Set the scheme
$this->_scheme = $scheme;
// Set up grammar rules for validation via regular expressions. These
// are to be used with slash-delimited regular expression strings.
// Escaped special characters (eg. '%25' for '%')
$this->_regex['escaped'] = '%[[:xdigit:]]{2}';
// Unreserved characters
$this->_regex['unreserved'] = '[' . self::CHAR_ALNUM . self::CHAR_MARK . ']';
// Segment can use escaped, unreserved or a set of additional chars
$this->_regex['segment'] = '(?:' . $this->_regex['escaped'] . '|[' .
self::CHAR_ALNUM . self::CHAR_MARK . self::CHAR_SEGMENT . '])*';
// Path can be a series of segmets char strings seperated by '/'
$this->_regex['path'] = '(?:\/(?:' . $this->_regex['segment'] . ')?)+';
// URI characters can be escaped, alphanumeric, mark or reserved chars
$this->_regex['uric'] = '(?:' . $this->_regex['escaped'] . '|[' .
self::CHAR_ALNUM . self::CHAR_MARK . self::CHAR_RESERVED .
// If unwise chars are allowed, add them to the URI chars class
(self::$_config['allow_unwise'] ? self::CHAR_UNWISE : '') . '])';
// If no scheme-specific part was supplied, the user intends to create
// a new URI with this object. No further parsing is required.
if (strlen($schemeSpecific) === 0) {
return;
}
// Parse the scheme-specific URI parts into the instance variables.
$this->_parseUri($schemeSpecific);
// Validate the URI
if ($this->valid() === false) {
require_once 'Zend/Uri/Exception.php';
throw new Zend_Uri_Exception('Invalid URI supplied');
}
}
/**
* Creates a Zend_Uri_Http from the given string
*
* @param string $uri String to create URI from, must start with
* 'http://' or 'https://'
* @throws InvalidArgumentException When the given $uri is not a string or
* does not start with http:// or https://
* @throws Zend_Uri_Exception When the given $uri is invalid
* @return Zend_Uri_Http
*/
public static function fromString($uri)
{
if (is_string($uri) === false) {
require_once 'Zend/Uri/Exception.php';
throw new Zend_Uri_Exception('$uri is not a string');
}
$uri = explode(':', $uri, 2);
$scheme = strtolower($uri[0]);
$schemeSpecific = isset($uri[1]) === true ? $uri[1] : '';
if (in_array($scheme, array('http', 'https')) === false) {
require_once 'Zend/Uri/Exception.php';
throw new Zend_Uri_Exception("Invalid scheme: '$scheme'");
}
$schemeHandler = new Zend_Uri_Http($scheme, $schemeSpecific);
return $schemeHandler;
}
/**
* Parse the scheme-specific portion of the URI and place its parts into instance variables.
*
* @param string $schemeSpecific The scheme-specific portion to parse
* @throws Zend_Uri_Exception When scheme-specific decoposition fails
* @throws Zend_Uri_Exception When authority decomposition fails
* @return void
*/
protected function _parseUri($schemeSpecific)
{
// High-level decomposition parser
$pattern = '~^((//)([^/?#]*))([^?#]*)(\?([^#]*))?(#(.*))?$~';
$status = @preg_match($pattern, $schemeSpecific, $matches);
if ($status === false) {
require_once 'Zend/Uri/Exception.php';
throw new Zend_Uri_Exception('Internal error: scheme-specific decomposition failed');
}
// Failed decomposition; no further processing needed
if ($status === false) {
return;
}
// Save URI components that need no further decomposition
$this->_path = isset($matches[4]) === true ? $matches[4] : '';
$this->_query = isset($matches[6]) === true ? $matches[6] : '';
$this->_fragment = isset($matches[8]) === true ? $matches[8] : '';
// Additional decomposition to get username, password, host, and port
$combo = isset($matches[3]) === true ? $matches[3] : '';
$pattern = '~^(([^:@]*)(:([^@]*))?@)?((?(?=[[])[[][^]]+[]]|[^:]+))(:(.*))?$~';
$status = @preg_match($pattern, $combo, $matches);
if ($status === false) {
require_once 'Zend/Uri/Exception.php';
throw new Zend_Uri_Exception('Internal error: authority decomposition failed');
}
// Save remaining URI components
$this->_username = isset($matches[2]) === true ? $matches[2] : '';
$this->_password = isset($matches[4]) === true ? $matches[4] : '';
$this->_host = isset($matches[5]) === true
? preg_replace('~^\[([^]]+)\]$~', '\1', $matches[5]) // Strip wrapper [] from IPv6 literal
: '';
$this->_port = isset($matches[7]) === true ? $matches[7] : '';
}
/**
* Returns a URI based on current values of the instance variables. If any
* part of the URI does not pass validation, then an exception is thrown.
*
* @throws Zend_Uri_Exception When one or more parts of the URI are invalid
* @return string
*/
public function getUri()
{
if ($this->valid() === false) {
require_once 'Zend/Uri/Exception.php';
throw new Zend_Uri_Exception('One or more parts of the URI are invalid');
}
$password = strlen($this->_password) > 0 ? ":$this->_password" : '';
$auth = strlen($this->_username) > 0 ? "$this->_username$password@" : '';
$port = strlen($this->_port) > 0 ? ":$this->_port" : '';
$query = strlen($this->_query) > 0 ? "?$this->_query" : '';
$fragment = strlen($this->_fragment) > 0 ? "#$this->_fragment" : '';
return $this->_scheme
. '://'
. $auth
. $this->_host
. $port
. $this->_path
. $query
. $fragment;
}
/**
* Validate the current URI from the instance variables. Returns true if and only if all
* parts pass validation.
*
* @return boolean
*/
public function valid()
{
// Return true if and only if all parts of the URI have passed validation
return $this->validateUsername()
and $this->validatePassword()
and $this->validateHost()
and $this->validatePort()
and $this->validatePath()
and $this->validateQuery()
and $this->validateFragment();
}
/**
* Returns the username portion of the URL, or FALSE if none.
*
* @return string
*/
public function getUsername()
{
return strlen($this->_username) > 0 ? $this->_username : false;
}
/**
* Returns true if and only if the username passes validation. If no username is passed,
* then the username contained in the instance variable is used.
*
* @param string $username The HTTP username
* @throws Zend_Uri_Exception When username validation fails
* @return boolean
* @link http://www.faqs.org/rfcs/rfc2396.html
*/
public function validateUsername($username = null)
{
if ($username === null) {
$username = $this->_username;
}
// If the username is empty, then it is considered valid
if (strlen($username) === 0) {
return true;
}
// Check the username against the allowed values
$status = @preg_match('/^(?:' . $this->_regex['escaped'] . '|[' .
self::CHAR_ALNUM . self::CHAR_MARK . ';:&=+$,' . '])+$/', $username);
if ($status === false) {
require_once 'Zend/Uri/Exception.php';
throw new Zend_Uri_Exception('Internal error: username validation failed');
}
return $status === 1;
}
/**
* Sets the username for the current URI, and returns the old username
*
* @param string $username The HTTP username
* @throws Zend_Uri_Exception When $username is not a valid HTTP username
* @return string
*/
public function setUsername($username)
{
if ($this->validateUsername($username) === false) {
require_once 'Zend/Uri/Exception.php';
throw new Zend_Uri_Exception("Username \"$username\" is not a valid HTTP username");
}
$oldUsername = $this->_username;
$this->_username = $username;
return $oldUsername;
}
/**
* Returns the password portion of the URL, or FALSE if none.
*
* @return string
*/
public function getPassword()
{
return strlen($this->_password) > 0 ? $this->_password : false;
}
/**
* Returns true if and only if the password passes validation. If no password is passed,
* then the password contained in the instance variable is used.
*
* @param string $password The HTTP password
* @throws Zend_Uri_Exception When password validation fails
* @return boolean
* @link http://www.faqs.org/rfcs/rfc2396.html
*/
public function validatePassword($password = null)
{
if ($password === null) {
$password = $this->_password;
}
// If the password is empty, then it is considered valid
if (strlen($password) === 0) {
return true;
}
// If the password is nonempty, but there is no username, then it is considered invalid
if (strlen($password) > 0 and strlen($this->_username) === 0) {
return false;
}
// Check the password against the allowed values
$status = @preg_match('/^(?:' . $this->_regex['escaped'] . '|[' .
self::CHAR_ALNUM . self::CHAR_MARK . ';:&=+$,' . '])+$/', $password);
if ($status === false) {
require_once 'Zend/Uri/Exception.php';
throw new Zend_Uri_Exception('Internal error: password validation failed.');
}
return $status == 1;
}
/**
* Sets the password for the current URI, and returns the old password
*
* @param string $password The HTTP password
* @throws Zend_Uri_Exception When $password is not a valid HTTP password
* @return string
*/
public function setPassword($password)
{
if ($this->validatePassword($password) === false) {
require_once 'Zend/Uri/Exception.php';
throw new Zend_Uri_Exception("Password \"$password\" is not a valid HTTP password.");
}
$oldPassword = $this->_password;
$this->_password = $password;
return $oldPassword;
}
/**
* Returns the domain or host IP portion of the URL, or FALSE if none.
*
* @return string
*/
public function getHost()
{
return strlen($this->_host) > 0 ? $this->_host : false;
}
/**
* Returns true if and only if the host string passes validation. If no host is passed,
* then the host contained in the instance variable is used.
*
* @param string $host The HTTP host
* @return boolean
* @uses Zend_Filter
*/
public function validateHost($host = null)
{
if ($host === null) {
$host = $this->_host;
}
// If the host is empty, then it is considered invalid
if (strlen($host) === 0) {
return false;
}
// Check the host against the allowed values; delegated to Zend_Filter.
$validate = new Zend_Validate_Hostname(Zend_Validate_Hostname::ALLOW_ALL);
return $validate->isValid($host);
}
/**
* Sets the host for the current URI, and returns the old host
*
* @param string $host The HTTP host
* @throws Zend_Uri_Exception When $host is nota valid HTTP host
* @return string
*/
public function setHost($host)
{
if ($this->validateHost($host) === false) {
require_once 'Zend/Uri/Exception.php';
throw new Zend_Uri_Exception("Host \"$host\" is not a valid HTTP host");
}
$oldHost = $this->_host;
$this->_host = $host;
return $oldHost;
}
/**
* Returns the TCP port, or FALSE if none.
*
* @return string
*/
public function getPort()
{
return strlen($this->_port) > 0 ? $this->_port : false;
}
/**
* Returns true if and only if the TCP port string passes validation. If no port is passed,
* then the port contained in the instance variable is used.
*
* @param string $port The HTTP port
* @return boolean
*/
public function validatePort($port = null)
{
if ($port === null) {
$port = $this->_port;
}
// If the port is empty, then it is considered valid
if (strlen($port) === 0) {
return true;
}
// Check the port against the allowed values
return ctype_digit((string) $port) and 1 <= $port and $port <= 65535;
}
/**
* Sets the port for the current URI, and returns the old port
*
* @param string $port The HTTP port
* @throws Zend_Uri_Exception When $port is not a valid HTTP port
* @return string
*/
public function setPort($port)
{
if ($this->validatePort($port) === false) {
require_once 'Zend/Uri/Exception.php';
throw new Zend_Uri_Exception("Port \"$port\" is not a valid HTTP port.");
}
$oldPort = $this->_port;
$this->_port = $port;
return $oldPort;
}
/**
* Returns the path and filename portion of the URL.
*
* @return string
*/
public function getPath()
{
return strlen($this->_path) > 0 ? $this->_path : '/';
}
/**
* Returns true if and only if the path string passes validation. If no path is passed,
* then the path contained in the instance variable is used.
*
* @param string $path The HTTP path
* @throws Zend_Uri_Exception When path validation fails
* @return boolean
*/
public function validatePath($path = null)
{
if ($path === null) {
$path = $this->_path;
}
// If the path is empty, then it is considered valid
if (strlen($path) === 0) {
return true;
}
// Determine whether the path is well-formed
$pattern = '/^' . $this->_regex['path'] . '$/';
$status = @preg_match($pattern, $path);
if ($status === false) {
require_once 'Zend/Uri/Exception.php';
throw new Zend_Uri_Exception('Internal error: path validation failed');
}
return (boolean) $status;
}
/**
* Sets the path for the current URI, and returns the old path
*
* @param string $path The HTTP path
* @throws Zend_Uri_Exception When $path is not a valid HTTP path
* @return string
*/
public function setPath($path)
{
if ($this->validatePath($path) === false) {
require_once 'Zend/Uri/Exception.php';
throw new Zend_Uri_Exception("Path \"$path\" is not a valid HTTP path");
}
$oldPath = $this->_path;
$this->_path = $path;
return $oldPath;
}
/**
* Returns the query portion of the URL (after ?), or FALSE if none.
*
* @return string
*/
public function getQuery()
{
return strlen($this->_query) > 0 ? $this->_query : false;
}
/**
* Returns the query portion of the URL (after ?) as a
* key-value-array. If the query is empty an empty array
* is returned
*
* @return array
*/
public function getQueryAsArray()
{
$query = $this->getQuery();
$querryArray = array();
if ($query !== false) {
parse_str($query, $querryArray);
}
return $querryArray;
}
/**
* Returns true if and only if the query string passes validation. If no query is passed,
* then the query string contained in the instance variable is used.
*
* @param string $query The query to validate
* @throws Zend_Uri_Exception When query validation fails
* @return boolean
* @link http://www.faqs.org/rfcs/rfc2396.html
*/
public function validateQuery($query = null)
{
if ($query === null) {
$query = $this->_query;
}
// If query is empty, it is considered to be valid
if (strlen($query) === 0) {
return true;
}
// Determine whether the query is well-formed
$pattern = '/^' . $this->_regex['uric'] . '*$/';
$status = @preg_match($pattern, $query);
if ($status === false) {
require_once 'Zend/Uri/Exception.php';
throw new Zend_Uri_Exception('Internal error: query validation failed');
}
return $status == 1;
}
/**
* Add or replace params in the query string for the current URI, and
* return the old query.
*
* @param array $queryParams
* @return string Old query string
*/
public function addReplaceQueryParameters(array $queryParams)
{
$queryParams = array_merge($this->getQueryAsArray(), $queryParams);
return $this->setQuery($queryParams);
}
/**
* Remove params in the query string for the current URI, and
* return the old query.
*
* @param array $queryParamKeys
* @return string Old query string
*/
public function removeQueryParameters(array $queryParamKeys)
{
$queryParams = array_diff_key($this->getQueryAsArray(), array_fill_keys($queryParamKeys, 0));
return $this->setQuery($queryParams);
}
/**
* Set the query string for the current URI, and return the old query
* string This method accepts both strings and arrays.
*
* @param string|array $query The query string or array
* @throws Zend_Uri_Exception When $query is not a valid query string
* @return string Old query string
*/
public function setQuery($query)
{
$oldQuery = $this->_query;
// If query is empty, set an empty string
if (empty($query) === true) {
$this->_query = '';
return $oldQuery;
}
// If query is an array, make a string out of it
if (is_array($query) === true) {
$query = http_build_query($query, '', '&');
} else {
// If it is a string, make sure it is valid. If not parse and encode it
$query = (string) $query;
if ($this->validateQuery($query) === false) {
parse_str($query, $queryArray);
$query = http_build_query($queryArray, '', '&');
}
}
// Make sure the query is valid, and set it
if ($this->validateQuery($query) === false) {
require_once 'Zend/Uri/Exception.php';
throw new Zend_Uri_Exception("'$query' is not a valid query string");
}
$this->_query = $query;
return $oldQuery;
}
/**
* Returns the fragment portion of the URL (after #), or FALSE if none.
*
* @return string|false
*/
public function getFragment()
{
return strlen($this->_fragment) > 0 ? $this->_fragment : false;
}
/**
* Returns true if and only if the fragment passes validation. If no fragment is passed,
* then the fragment contained in the instance variable is used.
*
* @param string $fragment Fragment of an URI
* @throws Zend_Uri_Exception When fragment validation fails
* @return boolean
* @link http://www.faqs.org/rfcs/rfc2396.html
*/
public function validateFragment($fragment = null)
{
if ($fragment === null) {
$fragment = $this->_fragment;
}
// If fragment is empty, it is considered to be valid
if (strlen($fragment) === 0) {
return true;
}
// Determine whether the fragment is well-formed
$pattern = '/^' . $this->_regex['uric'] . '*$/';
$status = @preg_match($pattern, $fragment);
if ($status === false) {
require_once 'Zend/Uri/Exception.php';
throw new Zend_Uri_Exception('Internal error: fragment validation failed');
}
return (boolean) $status;
}
/**
* Sets the fragment for the current URI, and returns the old fragment
*
* @param string $fragment Fragment of the current URI
* @throws Zend_Uri_Exception When $fragment is not a valid HTTP fragment
* @return string
*/
public function setFragment($fragment)
{
if ($this->validateFragment($fragment) === false) {
require_once 'Zend/Uri/Exception.php';
throw new Zend_Uri_Exception("Fragment \"$fragment\" is not a valid HTTP fragment");
}
$oldFragment = $this->_fragment;
$this->_fragment = $fragment;
return $oldFragment;
}
}
|
{
"pile_set_name": "Github"
}
|
// Copyright (c) Microsoft Corporation. All Rights Reserved. See License.txt in the project root for license information.
%{
#nowarn "1182" // the generated code often has unused variable "parseState"
open Internal.Utilities
open Internal.Utilities.Text
open FSharp.Compiler.AbstractIL
open FSharp.Compiler.AbstractIL.Internal
open FSharp.Compiler.AbstractIL.Internal.AsciiConstants
open FSharp.Compiler.AbstractIL.Diagnostics
open FSharp.Compiler.AbstractIL.Extensions.ILX.Types
open FSharp.Compiler.AbstractIL.IL
open FSharp.Compiler.AbstractIL.Internal.Library
let pfailwith s =
stderr.WriteLine ("*** error: "+s);
raise Parsing.RecoverableParseError
type ResolvedAtMethodSpecScope<'T> =
ResolvedAtMethodSpecScope of (ILGenericParameterDefs -> 'T)
let noMethodSpecScope x = ResolvedAtMethodSpecScope (fun _cgparams -> x)
let resolveMethodSpecScope (ResolvedAtMethodSpecScope f) x = f x
let resolveMethodSpecScopeThen (ResolvedAtMethodSpecScope f) g =
ResolvedAtMethodSpecScope (fun x -> resolveMethodSpecScope (g(f x)) x)
let resolveCurrentMethodSpecScope obj =
resolveMethodSpecScope obj mkILEmptyGenericParams
let findSystemRuntimeAssemblyRef() =
match parseILGlobals.primaryAssemblyScopeRef with
| ILScopeRef.Assembly aref -> aref
| _ -> pfailwith "systemRuntimeScopeRef not set to valid assembly reference in parseILGlobals"
let findAssemblyRef nm =
if nm = "mscorlib" then findSystemRuntimeAssemblyRef()
else
pfailwith ("Undefined assembly ref '" + nm + "'")
%}
/*-----------------------------------------------------------------------
* The YACC Grammar
*----------------------------------------------------------------------*/
%token <int64> VAL_INT64 /* 342534523534534 0x34FA434644554 */
%token <int32> VAL_INT32_ELIPSES /* 342534523534534... */
%token <double> VAL_FLOAT64 /* -334234 24E-34 */
%token <Int32Instr> INSTR_I
%token <Int32Int32Instr> INSTR_I32_I32
%token <Int64Instr> INSTR_I8
%token <DoubleInstr> INSTR_R
%token <NoArgInstr> INSTR_NONE
%token <StringInstr> INSTR_STRING
%token <TokenInstr> INSTR_TOK
%token <TypeInstr> INSTR_TYPE
%token <IntTypeInstr> INSTR_INT_TYPE
%token <ValueTypeInstr> INSTR_VALUETYPE
%token <int> VAL_HEXBYTE /* 05 1A FA */
%token <string> VAL_ID /* testing343 */
%token <string> VAL_DOTTEDNAME /* testing343.abd */
%token <string> VAL_QSTRING /* "Hello World\n" */
%token <string> VAL_SQSTRING /* 'Hello World\n' */
%token AMP
%token BANG
%token BOOL
%token BYTEARRAY
%token CHAR
%token CLASS
%token COMMA
%token DCOLON
%token DEFAULT
%token DOT
%token ELIPSES
%token EOF
%token EXPLICIT
%token FIELD
%token FLOAT32
%token FLOAT64
%token GREATER
%token INSTANCE
%token INT
%token INT16
%token INT32
%token INT64
%token INT8
%token LBRACK
%token LESS
%token LPAREN
%token METHOD
%token NATIVE
%token OBJECT
%token PLUS
%token RBRACK
%token RPAREN
%token SLASH
%token STAR
%token STRING
%token UINT
%token UINT16
%token UINT32
%token UINT64
%token UINT8
%token UNMANAGED
%token UNSIGNED
%token VALUE
%token VALUETYPE
%token VARARG
%token VOID
%type <string> name1
%type <ILType ResolvedAtMethodSpecScope> typ
%type <ILInstr array> ilInstrs
%type <ILType> ilType
%start ilInstrs ilType
/**************************************************************************/
%%
/* ENTRYPOINT */
ilType: typ EOF
{ resolveMethodSpecScope $1 [] }
/* ENTRYPOINT */
ilInstrs: instrs2 EOF
{ Array.ofList $1 }
compQstring:
VAL_QSTRING { $1 }
| compQstring PLUS VAL_QSTRING { $1 + $3 }
methodName: name1 { $1 }
instrs2:
| instr instrs2
{ $1 :: $2 }
| { [] }
instr:
INSTR_NONE
{ ($1 ()) }
| INSTR_I int32
{ ($1 $2) }
| INSTR_I32_I32 int32 int32
{ ($1 ($2,$3)) }
| INSTR_I8 int64
{ ($1 $2) }
| INSTR_R float64
{ ($1 (ILConst.R8 $2)) }
| INSTR_R int64
{ ($1 (ILConst.R8 (float $2))) }
| INSTR_TYPE typSpec
{ $1 (resolveCurrentMethodSpecScope $2) }
| INSTR_INT_TYPE int32 typSpec
{ $1 ( $2,resolveCurrentMethodSpecScope $3) }
| INSTR_VALUETYPE typSpec
{ $1 (resolveCurrentMethodSpecScope $2) }
| INSTR_TOK typSpec
{ ($1 (ILToken.ILType (resolveCurrentMethodSpecScope $2))) }
/*-----------------------------------------------
* Type names
*---------------------------------------------*/
name1:
| id
{ $1 }
| VAL_DOTTEDNAME
{ $1 }
| name1 DOT id
{ $1 + "." + $3 }
className:
LBRACK name1 RBRACK slashedName
{ let (enc,nm) = $4
let aref = findAssemblyRef $2
ILScopeRef.Assembly aref, enc, nm }
| slashedName
{ let enc, nm = $1 in (ILScopeRef.Local, enc, nm) }
slashedName:
name1
{ ([],$1) }
| name1 SLASH slashedName
{ let (enc,nm) = $3 in ($1 :: enc, nm) }
typeNameInst:
className opt_actual_tyargs
{ let (a,b,c) = $1
resolveMethodSpecScopeThen $2 (fun inst ->
noMethodSpecScope ( (mkILTySpec ( (mkILNestedTyRef (a,b,c)), inst)))) }
typeName:
className
{ let (a,b,c) = $1
noMethodSpecScope ( (mkILTySpec ( (mkILNestedTyRef (a,b,c)), []))) }
typSpec:
typeName
{ resolveMethodSpecScopeThen $1 (fun tref ->
noMethodSpecScope (mkILBoxedType tref)) }
| typ
{ $1 }
| LPAREN typ RPAREN
{ $2 }
callConv:
INSTANCE callKind
{ Callconv (ILThisConvention.Instance,$2) }
| EXPLICIT callKind
{ Callconv (ILThisConvention.InstanceExplicit,$2) }
| callKind
{ Callconv (ILThisConvention.Static,$1) }
callKind:
/* EMPTY */
{ ILArgConvention.Default }
| DEFAULT
{ ILArgConvention.Default }
| VARARG
{ ILArgConvention.VarArg }
/*-----------------------------------------------
* The full algebra of types, typically producing results
* awaiting further info about how to fix up type
* variable numbers etc.
*---------------------------------------------*/
typ: STRING
{ noMethodSpecScope parseILGlobals.typ_String }
| OBJECT
{ noMethodSpecScope parseILGlobals.typ_Object }
| CLASS typeNameInst
{ resolveMethodSpecScopeThen $2 (fun tspec ->
noMethodSpecScope (mkILBoxedType tspec)) }
| VALUE CLASS typeNameInst
{ resolveMethodSpecScopeThen $3 (fun tspec ->
noMethodSpecScope (ILType.Value tspec)) }
| VALUETYPE typeNameInst
{ resolveMethodSpecScopeThen $2 (fun tspec ->
noMethodSpecScope (ILType.Value tspec)) }
| typ LBRACK RBRACK
{ resolveMethodSpecScopeThen $1 (fun ty -> noMethodSpecScope (mkILArr1DTy ty)) }
| typ LBRACK bounds1 RBRACK
{ resolveMethodSpecScopeThen $1 (fun ty -> noMethodSpecScope (mkILArrTy (ty,ILArrayShape $3))) }
| typ AMP
{ resolveMethodSpecScopeThen $1 (fun ty -> noMethodSpecScope (ILType.Byref ty)) }
| typ STAR
{ resolveMethodSpecScopeThen $1 (fun ty -> noMethodSpecScope (ILType.Ptr ty)) }
| CHAR
{ noMethodSpecScope parseILGlobals.typ_Char }
| VOID
{ noMethodSpecScope ILType.Void }
| BOOL
{ noMethodSpecScope parseILGlobals.typ_Bool }
| INT8
{ noMethodSpecScope parseILGlobals.typ_SByte }
| INT16
{ noMethodSpecScope parseILGlobals.typ_Int16 }
| INT32
{ noMethodSpecScope parseILGlobals.typ_Int32 }
| INT64
{ noMethodSpecScope parseILGlobals.typ_Int64 }
| FLOAT32
{ noMethodSpecScope parseILGlobals.typ_Single }
| FLOAT64
{ noMethodSpecScope parseILGlobals.typ_Double }
| UNSIGNED INT8
{ noMethodSpecScope parseILGlobals.typ_Byte }
| UNSIGNED INT16
{ noMethodSpecScope parseILGlobals.typ_UInt16 }
| UNSIGNED INT32
{ noMethodSpecScope parseILGlobals.typ_UInt32 }
| UNSIGNED INT64
{ noMethodSpecScope parseILGlobals.typ_UInt64 }
| UINT8
{ noMethodSpecScope parseILGlobals.typ_Byte }
| UINT16
{ noMethodSpecScope parseILGlobals.typ_UInt16 }
| UINT32
{ noMethodSpecScope parseILGlobals.typ_UInt32 }
| UINT64
{ noMethodSpecScope parseILGlobals.typ_UInt64 }
| NATIVE INT
{ noMethodSpecScope parseILGlobals.typ_IntPtr }
| NATIVE UNSIGNED INT
{ noMethodSpecScope parseILGlobals.typ_UIntPtr }
| NATIVE UINT
{ noMethodSpecScope parseILGlobals.typ_UIntPtr }
| BANG int32
{ noMethodSpecScope (ILType.TypeVar (uint16 ( $2))) }
bounds1:
bound
{ [$1] }
| bounds1 COMMA bound
{ $1 @ [$3] }
bound:
/*EMPTY*/
{ (None, None) }
| int32
{ (None, Some $1) }
| int32 ELIPSES int32
{ (Some $1, Some ($3 - $1 + 1)) }
| int32 ELIPSES
{ (Some $1, None) }
/* We need to be able to parse all of */
/* ldc.r8 0. */
/* float64(-657435.) */
/* and int32[0...,0...] */
/* The problem is telling an integer-followed-by-ellipses from a floating-point-nubmer-followed-by-dots */
| VAL_INT32_ELIPSES int32
{ (Some $1, Some ($2 - $1 + 1)) }
| VAL_INT32_ELIPSES
{ (Some $1, None) }
id:
VAL_ID
{ $1 }
| VAL_SQSTRING
{ $1 }
int32:
VAL_INT64
{ int32 $1 }
int64:
VAL_INT64
{ $1 }
float64:
VAL_FLOAT64
{ $1 }
| FLOAT64 LPAREN int64 RPAREN
{ System.BitConverter.Int64BitsToDouble $3 }
opt_actual_tyargs:
/* EMPTY */
{ noMethodSpecScope [] }
| actual_tyargs
{ resolveMethodSpecScopeThen $1 (fun res ->
noMethodSpecScope res) }
actual_tyargs:
LESS actualTypSpecs GREATER
{ $2 }
actualTypSpecs:
typSpec
{ resolveMethodSpecScopeThen $1 (fun res ->
noMethodSpecScope [ res]) }
| actualTypSpecs COMMA typSpec
{ resolveMethodSpecScopeThen $1 (fun x ->
resolveMethodSpecScopeThen $3 (fun y ->
noMethodSpecScope (x @ [ y]))) }
|
{
"pile_set_name": "Github"
}
|
Delayed cord clamping in preterm dichorionic twin gestations.
To examine the practice of delayed cord clamping and associated neonatal outcomes in preterm dichorionic twin gestations. This is a retrospective cohort study of women delivering dichorionic-diamniotic twin gestations between 23 and 32 weeks of gestation at a single large academic center between 2013 and 2015. Neonatal outcomes of twins receiving delayed cord clamping were compared to those who did not. Of 58 eligible women delivering dichorionic twins, eight (13.8%) had both neonates receive delayed cord clamping, resulting in 16 neonates who received delayed cord clamping and 100 who did not. Neonates who received delayed cord clamping had no difference in umbilical artery pH, 5 min Apgar score, NICU length of stay, need for pressors, neonatal death, or other adverse outcomes. Delayed cord clamping in dichorionic twin gestations born at 32 weeks or less is feasible and in this small cohort does not appear to be associated with worse neonatal outcomes.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
Michael Davidson (cricketer, born 1992)
Michael Davidson (born 3 September 1992) is a New Zealand cricketer who plays for Canterbury. He made his first-class debut on 13 February 2016 in the 2015–16 Plunket Shield. He made his List A debut on 27 December 2015 in the 2015–16 Ford Trophy.
References
External links
Category:1992 births
Category:Living people
Category:New Zealand cricketers
Category:Canterbury cricketers
Category:Cricketers from Christchurch
|
{
"pile_set_name": "Wikipedia (en)"
}
|
Transcript for Bernie Sanders Vows to Stay in the Race Right Up to the Convention
Now, to the major developments on the democratic side tonight, as well. Hillary Clinton with a decisive win in Nevada, the south Carolina primary just five days away now. Celebrating on that stage with former president bill Clinton. And tonight here, you will hear a shift in her message, her tone. Meantime, Bernie sanders this evening, not backing down. He was asked directly today, does he still have a path to the nomination? And you will hear how he answers. Here's what he's up against. The latest poll in south Carolina showing Clinton with a nearly 30-point lead. ABC's Jonathan Karl on the campaign tonight. Reporter: A newly-energized Hillary Clinton is back on top, Thank you, Nevada! Thank you so much! Reporter: She's confident enough to make this extraordinary admission. I think there's an underlying question that maybe is really in the back of people's minds, and that is, you know, is she in it for us or is she in it for herself? Reporter: And now, a shift in tone. Clinton talking less about herself, less about "I" and more about "We." We hear you. We see you. We're incredibly grateful to you. Because we're in this together. We are all in this together. We all have to do our part. Reporter: Clinton won 76% of the african-american vote in Nevada, support she's counting on in South Carolina, where more than half of democratic voters are african-american. She's launched yet another new ad, featuring one of the most well-recognized voices in America -- actor Morgan Freeman. She says their names. Trayvon martin. Trayvon martin, shot to death. Dontre Hamilton. Unarmed. Andra Sandra bland. Sandra bland did nothing wrong. Reporter: And Bernie sanders is turning to another prominent african-american actor -- Danny glover. Today in Boston, he attacked Clinton as a political opportune is. And the people of the united States need to know the difference between hastily adopted campaign rhetoric, and the real record and the long-held ideas of the candidates. Reporter: When asked trektly if he still has a path to winning the democratic nomination, his answer was emphatic. The short three-letter answer is y-e-s. And Jon Karl with us live tonight, as well. After a near tie in Iowa, and a bruising loss in New Hampshire, what a shift, Jon. It's actually the Clinton team now pointing to the math tonight? Reporter: That's right. We look at delegates. They are virtually tied among the delegates won in those three states, but you add in the so-call superdelegates and Hillary Clinton has a big lead. A lead she expects to add to over this weekend in south Carolina. But David, I've got to say, they are not overly confident. They believe that Bernie sanders will do well on super Tuesday and is likely to win several states and more delegates. All right, the fight continues. Jon Karl tonight, thank you. We're going to turn next to
This transcript has been automatically generated and may not be 100% accurate.
|
{
"pile_set_name": "OpenWebText2"
}
|
(s) = -373*s - 11564. Let g be u(-31). Let r(t) = -27*t - 3. Give r(g).
24
Let h(z) be the third derivative of 0*z + 1/12*z**4 + 0 - 106*z**2 - 5/3*z**3. Calculate h(6).
2
Let n(y) = -3*y + 5. Suppose 0 = -15*p + 13*p + 16. Suppose p = -3*z - 6*r + 4*r, 0 = -4*r - 16. Give n(z).
5
Let u(b) = 131642 - 10*b + 0*b**2 - 131632 + b**2. Determine u(9).
1
Let f(q) = 7*q**2 - 9*q + 5. Let p(s) = 5*s**2 - 7*s + 4. Let j(h) = -4*f(h) + 5*p(h). Let y be 2*(27/(-6) + 3). Let u be -1*1*y/3. Give j(u).
-2
Let r(d) = 142*d**3 - 145*d**3 + d + 18*d**2 - 17*d**2 + 7. What is r(2)?
-11
Let c be (((-1200)/(-135))/20)/(1/(27/(-6))). Let h(v) = -v. Let i(y) = -4*y**2 + 3*y + 2. Let x(m) = -6*h(m) - i(m). Give x(c).
8
Let w(x) = 20*x - 3. Let u = -5435 - -5435. Determine w(u).
-3
Let m = 11801 - 11806. Let k(b) = -4*b**2 - 7*b - 11. Determine k(m).
-76
Suppose 22*v + 142 + 504 = 382. Let t(j) be the third derivative of j**5/60 + j**4/2 + j**3/2 + j**2. Determine t(v).
3
Suppose 22*b = 12*b. Suppose 5*w - 5*r + 4*r = 26, -4*w - 2*r + 32 = b. Let t(k) = -3 + 3*k + 4*k + 14 - 8*k. Calculate t(w).
5
Let y(u) be the second derivative of -u**5/10 - 5*u**4/4 + u**3 - 7*u**2 + 772*u. Give y(-8).
2
Let n(g) = -56*g - 67*g + 115*g + 31*g**2 - 35*g**2 - g**3 - 55. Determine n(-5).
10
Let w(l) be the third derivative of l**5/60 - 5*l**4/8 + 3*l**3/2 + 1241*l**2. Give w(5).
-41
Let n(v) = v**3 - 13*v**2 + 3*v - 22. Let o be n(13). Let k = 32 - o. Suppose 5*g + 0 = -k. Let t(w) = -w - 4. Give t(g).
-1
Let u(c) = 9*c**2 + 102*c - 89. Let v(g) = 5*g**2 + 54*g - 45. Let b(h) = 6*u(h) - 11*v(h). What is b(15)?
6
Let b(p) = 3 + 2 + 1 - p**2 + 1260*p - 646*p - 627*p. Calculate b(-16).
-42
Let v(p) = -3*p. Let t = 43 - 40. Suppose -2*o - b = -9 - 16, o + t*b = 5. Let x = o + -17. What is v(x)?
9
Let f(z) = -1 + 5*z - z - 3*z. Suppose 5*v - 22 = 3*r, -5*v + 14 = -11*r + 10*r. Determine f(v).
1
Let v = -19 + 19. Suppose 0 = 5*r + 11 - 21. Let c(g) = -g**r + 19 - 14 - g - 12. Determine c(v).
-7
Let r be ((-3384)/(-1316))/(2/14). Let g(b) = -b**2 + 21*b - 21. Determine g(r).
33
Let c(b) = -3*b**3 - 6*b**2 + 5*b - 8 + 4*b**3 - b**2. Let d be 1608/10184 - (-222)/38. What is c(d)?
-14
Suppose -s - 8 = 4*d - 102, 0 = 5*s + d - 394. Let f = -79 + s. Let r be -3*(f/(-21) - 40/(-140)). Let v(o) = 3*o - 1. Calculate v(r).
-4
Let j(m) = -38*m - 90. Let f(o) = -4*o + 3. Let s(t) = -2*f(t) + j(t). Determine s(-3).
-6
Let k(m) = 74*m**2 - 21 - 153*m**2 + 80*m**2. Let z be k(4). Let g(y) = -y + 2 + 3 + 7*y - y**3 - 4*y**2. What is g(z)?
0
Suppose 0 = -14*b + 16*b - 40*b + 190. Let m(r) be the first derivative of 1/2*r**2 - 15 - b*r + 1/3*r**3. Calculate m(-4).
7
Let s(h) = -19*h - 10*h + 20*h - h**2 - 10 - 5. Calculate s(-9).
-15
Let b(o) = -14*o - 4. Let x(g) = -7*g - 2. Let n = 20 - 9. Let m(p) = n*x(p) - 6*b(p). Suppose -10 = -3*f + 3*a + 5, 4*a + 12 = 0. What is m(f)?
16
Let q(k) = -k**3 - 5*k**2 + 5*k + 3. Let h be 78/(-819) + 418/(-21). Let x be (48/(-80))/((-2)/h). What is q(x)?
9
Let q(g) = 61*g - 695. Let o(h) = 10*h - 111. Let i(b) = -38*o(b) + 6*q(b). Calculate i(5).
-22
Let s(o) = 35*o - 3. Let p(r) = -2*r**2 - 38*r - 179. Let a be p(-10). Give s(a).
32
Let m(j) = 28*j**3 - 6*j - 2*j + 3*j**2 + 27*j**3 - 10 - 54*j**3. Give m(-4).
6
Let z(t) = t**2 + 42*t + 338. Let h be z(-8). Let c(l) = -4 + 63*l + h*l - 134*l + 5. Calculate c(2).
-9
Suppose 0 = -33*d + 34*d - 2. Let r(u) = -3*u**2 + 1430*u - 1431*u + 6 - 2*u**d + u**3. Determine r(5).
1
Suppose 4*a = -5*w - 67, -2*a - 25*w + 30*w = 11. Let l(y) = 3*y - 27. Calculate l(a).
-66
Let p(s) be the second derivative of 59*s**3/3 - 351*s**2 + 53*s. Calculate p(6).
6
Let m(b) = 19*b**2 + 170*b - 8. Let x be m(-9). Let a be 1 - x/(-4) - (-2261)/(-532). Let k(i) = 1 + i**2 + i - 3 + 0*i**2. Determine k(a).
4
Suppose 0 = 7*a - 26*a + 38. Let z(f) = 3 - f**a - 2 + 4 - 3*f - 11 + 6*f. Give z(4).
-10
Let v(c) = 38*c + 9. Let l(i) = 21*i + 5. Let d(j) = -5*l(j) + 2*v(j). Determine d(-2).
51
Let z(a) = -4*a**2 + 40*a + 3. Suppose -3*b - 48 = -3*p, 0 = -75*p + 73*p - 2*b + 8. What is z(p)?
3
Let w(g) be the first derivative of 0*g**2 + 1/3*g**3 - 54 - 6*g. Give w(0).
-6
Let d(a) be the second derivative of -a**6/360 + a**5/10 - a**4/8 + 7*a**3/6 - a**2/2 + 37*a. Let j(n) be the second derivative of d(n). What is j(9)?
24
Suppose -18 = -3*s + m - 6*m, 5*s - 2*m - 30 = 0. Suppose 16*y + s = 17*y + o, 0 = y - 4*o + 19. Let t(z) = 8*z**2 - z. What is t(y)?
7
Let y(a) be the first derivative of a**4/4 + 10*a**3/3 - a**2/2 - 7*a - 10. Suppose j = -4*m - 45, 0 = 3*j + 15 - 0. Calculate y(m).
3
Let u be 351/54 + 1 + (-12)/8. Let z(h) = h - 1. Determine z(u).
5
Let k(x) = -x + 5. Let m be k(5). Let i(h) = 5 + m - h - 6. Let u(l) = 9*l - 168. Let b be u(19). Determine i(b).
-4
Let f(h) = -h - 22. Let s be (-408)/(-1496) + (-80)/11. Give f(s).
-15
Let j(n) = -5*n**2 - 4*n - 3. Suppose 0 = u - 3*u - 8. Let z(y) = -14*y**2 - 12*y - 8. Let l(v) = u*z(v) + 11*j(v). What is l(-5)?
4
Let c(w) = -25*w - 1. Let p(y) be the third derivative of -3*y**4/4 - 53*y**3/6 - 159*y**2. Let h be p(-3). Determine c(h).
-26
Let f(u) = 3*u - 3. Let z(b) = 39 - 50 + 5*b + 5. Let l(j) = 13*f(j) - 6*z(j). Determine l(2).
15
Suppose c + 5*m - 12 = 0, -44 = 3*c - 3*m - 62. Let h = -4 - -21. Let u(x) = -h*x + 18*x + c + 3. Calculate u(7).
17
Suppose -1093 + 8111 = 22*m. Let j = m + -327. Let a(w) = w - 6. Let z(x) = -6*x + 30. Let v(k) = -11*a(k) - 2*z(k). Determine v(j).
-2
Let b(o) = -180 - 9*o**2 - 159 + 8*o**2 + 317 - 6*o. Calculate b(-3).
-13
Let y(r) = 4*r**2 + 3*r + 4. Let c(g) be the first derivative of g**3 + 3*g**2/2 + 3*g + 96. Let l(n) = 6*c(n) - 5*y(n). Give l(2).
-4
Let k(t) = 2*t**3 - 2*t**2 - 1. Let a be (-16)/(-5) + (-8)/40. Suppose 5*q = -3*r - 12, 2*r - 5*r - q = 12. Let z be 6*r/(-36)*a. Determine k(z).
7
Let w(i) = -i - 7. Let d(j) be the first derivative of -j**3/3 - 2*j**2 + 52. Let o be d(-6). Determine w(o).
5
Let c(w) = w**3 - 9*w**2 + 13*w + 5. Suppose 2*s + 32 = 4*h, 9*h - 2*s + 10 = 11*h. What is c(h)?
-2
Let n(l) = 7*l**3 - 5*l**2 + 87*l + 87. Let z be n(-1). Let k(c) = -15*c - 155. Determine k(z).
25
Let l(j) be the first derivative of j**4/4 - 7*j**3/6 - 255*j**2/2 - 74. Let n(m) be the second derivative of l(m). Calculate n(0).
-7
Let b(o) = 4*o - 82. Suppose -7*h - 5*h = -4*h - 176. Give b(h).
6
Let n(p) = -5*p**2 - 37*p - 11. Let m be n(-7). Let i(d) = -2*d + 2*d + 32 - 34 + d + m*d. Give i(-1).
-6
Let w = 4886 - 4899. Let b(m) = -m**3 - 13*m**2 - m + 8. Determine b(w).
21
Suppose -35 + 409 = -2*t. Let j = t + 192. Let m(o) = o**3 - 5*o**2 - 3*o + 3. What is m(j)?
-12
Suppose 14 = -22*n + 80. Let t(r) = n*r**2 - 4*r + 6 - 24 + 19. Determine t(2).
5
Suppose -2*z - 5 = -5*u, -z - 4*u = -3*z - 2. Suppose 9*w - z = 4*w. Suppose 0 = 4*q + w + 3. Let h(c) = -6*c. What is h(q)?
6
Suppose 23*v = 30 + 85. Let n(o) be the third derivative of -o**7/5040 - o**6/360 - 3*o**5/20 - 2*o**2. Let q(g) be the third derivative of n(g). What is q(v)?
-7
Suppose 0 = -5*k + 5*w - 15, 3*w - 3 = -3*k + 5*k. Let o(f) = -13*f**2 - 5*f + 0*f - 122 + 62 + 61 + 5*f**2 + 7*f**2. Give o(k).
-5
Let p(w) = -5*w**2 + 12*w - 17. Let c(l) = -11*l**2 + 25*l - 34. Let z(j) = 3*c(j) - 7*p(j). What is z(8)?
73
Let j(a) be the first derivative of 3*a**4 + a**3/3 - a + 426. Suppose 5*h + 2*d - 8 = -3, -h = 3*d - 14. Give j(h).
-12
Let n(s) = -s**3 + 2*s**2 + 5*s - 13. Let u be n(-3). Let g(t) = u*t**3 - 14*t + 14*t + 8*t**2 - 7*t**2. Determine g(-1).
-16
Let p(k) = -k**3 - 3*k**2 - 3*k - 2. Suppose 4*m - 27 + 67 = -2*a, -2*a - 39 = 3*m. Let r(c) = 16*c + 285. Let u be r(a). Give p(u).
7
Let h(g) = 23*g**2 - 98*g + 177. Let c(n) = -7*n**2 + 33*n - 60. Let d(b) = 10*c(b) + 3*h(b). What is d(2)?
-1
Let r(a) be the third derivative of -a**5/60 + a**4/4 + 5*a**3/6 + 22*a**2 - 20*a. Give r(-3).
-22
Let m(i) = i**3 + 16*i**2 + 16*i + 30. Let y be m(-14). Let o = -198 + y. Let j(z) = 2*z**2 - z + 2. Calculate j(o).
2
Suppose -17*d + 15*d = -410. Let b(t) = -d*t + 101*t + 7 + 0 + 98*t. Calculate b(5).
-23
Let o(d) = d**3 + 15*d**2 + 25*d + 1. Suppose -21*m - 64 - 266 = -57. Give o(m).
14
Let q(n) = -5*n**2 - n. Let l(r) = 20*r**3 - 10*r**2 + 5*r + 7. Let u(p) = -l(p) + 2*q(p). Calculate u(-1).
20
Let v(b)
|
{
"pile_set_name": "DM Mathematics"
}
|
A wellness message for Cesar Chavez Day
UC Berkeley Chancellor Carol Christ, Executive Vice Chancellor and Provost Paul Alivisatos, Vice Chancellor for Equity and Inclusion Oscar Dubón, and Chief People and Culture Officer Eugene Whitlock sent the following message to faculty and staff on Friday:
Tomorrow is Cesar Chavez Day, a holiday honoring the principles of fairness, social justice, and the struggle for equity in the workplace and all of society. As we continue to adjust to our new reality created by COVID-19, both with respect to work and our personal lives, it is more important than ever to pause and think about the broader values and personal meaning that this day represents. Managers should encourage all employees (unless required to perform emergency services) to take the time to rest, reflect and renew. We offer special recognition to those who continue to maintain our critical campus operations during this crisis and who support the most vulnerable members of our community.
These are uncertain times. As the news and guidance around COVID-19 change and intensify, it is normal to feel overwhelmed and experience stress and anxiety. The current circumstances are particularly difficult for those who do not have necessary resources, or for whom home or the location of shelter is not physically or psychologically safe.
Please know that despite social distance, you are not alone. Campus resources are still available for you, including those listed at the end of this message. We also invite you to compassionately support others, as you are able. Everyone deserves support.
We are so grateful for how Berkeley staff and faculty are finding time to come together with their colleagues in healthy and creative ways during this crisis. We encourage you to read this Berkeley News article about how some of our community members are connecting via virtual happy hours, online art classes, livestreamed yoga sessions, and more. The central campus is looking into other methods of bringing us together while we’re physically apart, and is collecting suggestions for how to make the best of our current situation. We encourage you to view and take part in these efforts.
With best wishes for your well-being on Cesar Chavez Day, and all those to follow.
Wellness Resources
Employees can access free, confidential support from a licensed mental health professional through Be Well at Work – Employee Assistance. Appointments, including phone and video options, can be scheduled:
The PATH to Care Center offers confidential and free support around sexual assault, sexual harassment, interpersonal violence, stalking, and invasion of sexual privacy. Most advocacy is taking place remotely, but accompaniments to medical care, court, and law enforcement are still available. These services are available for all employees and students.
People and Culture Resources
The campus has set up a Job Exchange program to allow supervisors and managers to (1) request additional support from staff and student employees, and (2) identify staff and student employees who are currently underutilized and may be able to support other operations on campus.
We’ve also built a curated list of the most popular People and Culture resources to help with working remotely, including tips and tools related to telecommuting, managing teams, leave agreements and much more.
|
{
"pile_set_name": "Pile-CC"
}
|
1.) The best place for talking about stereotypes.
And the best way to defend ourselves is not to have to. For our message and our lives to be so clear and so well-known, that we never have to try to defend ourselves.
The idea there is that we’re inoculating people against the stereotypes. (When they’re not true, anyway.)
But that has a major exception: People who don’t know us at all. People whose perceptions are formed by what they see on TV or read on the internet. And something about those venues seems to propagate stereotypes. For instance, “Christians being Christ-like” isn’t likely to make the news. (Even Fox News.) What’s more likely to make the news is when a prominent Christian sticks his foot in his mouth. And then there’s the Internet, where what sticks out are the flame wars and loudmouths.
That’s probably the best situation for pointing out the stereotypes, assuming we can do it without whining–when we’re dealing with people who just don’t know conservative Christians. (Inoculation works better to prevent stereotypes, than to cure stereotypes.)
Still, though—as much as possible, I want to fix the stereotypes simply by being clearly Christ-like and Christ-honoring in our words and deeds, pointing to Him and the truth He taught.
2.) “Bad” stereotypes that aren’t really bad.
Sometimes, the “bad” stereotypes are true—but they’re not actually bad! That happens in two ways:
Christ offended a lot of people. If we’re doing everything exactly right, and communicating Him well, then He’s going to offend them through us. Sometimes. (And other times, His goodness & love overwhelms.)
Misunderstood or poorly-done truths. Take evangelism. We’re stereotyped as being into “proselytism”. Which is true. (Depending on your definition of “proselytism”.) But sometimes, the”bad” stereotype comes from evangelism done poorly. Or evangelism misunderstood. (What if people see evangelism as, “Join my religious club” instead of “Know and understand Christ, and the stunning grace of what he has done”? What if they see televangelists inviting people to receive Jesus and send in their money?)
So the answer here is pretty much the same. Speak and live clearly. And make sure that if people are offended, they are being offended by Christ–not by us.
Further Reading
Summer White is the daughter of Dr. James R. White, of Alpha & Omega Ministries. She recently blogged about an experience at her college, dealing with stereotypes. You might check it out–how well do you think she handled it?
Dan Kimball comes from the more conservative wing of the Emerging Church. The title is pretty expressive. I liked this book, though I’m not claiming it’s perfect. (It’s been a while since I read it, so I don’t clearly recall what there might be to criticize.) It’s worth reading, especially if you keep in mind a couple things: (1) The “Jesus” people often like is a watered-down Jesus—a pop Jesus who only ever says nice things, except when he’s cutting down religious conservatives. (2) When Kimball talks about areas where people “like Jesus but not the Church”, he is not saying that the church is necessarily doing something wrong there. He does advocate correcting misunderstandings.
In the previous entry from this series, I mentioned stereotypes—in this case, how conservatives are stereotyped as narrow-minded, as selfish, as hateful, or as smug, Pharisaical, self-righteous judgmental jerks. So… What do we do with that? How should we respond? (Edit: I’ll say up front that sometimes the stereotypes are true. And I should add that this would apply to dealing with any kind of stereotype–including conservative stereotypes about liberals.)
I have a few thoughts—an overarching perspective, and then a list of miscellaneous points.
It’s going to involve a combination of words & actions. Words to point out the stereotyping, words to communicate what we mean & believe, and actions in keeping with what we say. I’m not precisely sure what the balance should be between them, but I suspect it should and lean toward latter two. (“They’re stereotyping us” isn’t an inherently interesting or helpful subject. Talking about Christ, the Gospel, and the Scriptures is—along with acting like Christ.)
And the best way to defend ourselves is not to have to. For our message and our lives to be so clear and so well-known, that we never have to try to defend ourselves. For people to be so familiar with us that they know who we are. For us to be so pervasively, consistently Christ-like, clearly communicating the Gospel, that we cannot be unjustly stereotyped.
And of course, that assumes that the stereotypes are unjust. Which isn’t always the case! (We all live out stereotypes, sometimes.)
Thoughts to ponder:
How often is there truth in the stereotypes? How often are there real negative experiences behind people’s bad perceptions of Christianity and/or conservatives? How compelling will such people find it when we simply insist that we’re not really like that? (Counter-thought: How often are people oversensitive about their past experience? How often do they use it as an excuse to broadbrush?)
Talking about the stereotypes is limited in its usefulness. “They’re stereotyping us” is helpful if done right, but we have to be careful that it doesn’t become complaining or whining. After all…if the stereotypes are true, we’ll spend a lot more time & energy decrying “them dang lib’rals & the lib’ral media” than we’ll spend talking about Christ and bearing fruit in service & love.
It will be hypocritical for us to complain about the stereotypes, if we don’t do a good job of cleaning house, seeking to be above reproach. I don’t know if actions speak louder than words, but they’re sure important for backing them up. (Along those lines, see the previous entry on service.)
We need to be clear that we truly see ourselves as fellow sinners in need of a savior. We need to be clear that the Gospel is not, “Become a church-goer—be better, like us.” That the Gospel is what Christ did for us—the gift of redemption, received by simple, humble, repentant, God-seeking faith.
Paul said in Romans 2, “you have no excuse, O man, every one of you who judges. For in passing judgment on another you condemn yourself, because you, the judge, practice the very same things.“ He’s talking about hypocrisy–doing what you criticize in other people.
Recently I’ve become increasingly aware of how often and how easily we fall into that. With the best of intentions, we can wind up being hypocritical in practically everything. It just slips in under our radar.
Examples
1.) Charity Police
If you read many blogs on the internet, you will find people who speak very uncharitably–they’re constantly unnecessarily harsh in tone and unreasonable in how they interpret others. You will also find people who are obsessed with accusing others of being uncharitable. You can call them charity police. And those guys can be some of the least charitable people around–accusing others of uncharity at the drop of a hat or the slightest hint of language that isn’t excessively polite. Majorly unreasonable & oversensitive.
We should be gracious with each other in addressing their mistakes–including mistakes of style. And we shouldn’t be too quick to assume the worst.
Charity police can be the least charitable people on the internet.
2.) Liberals & stereotyping.
(Note: Everyone does this kind of thing, but there’s an extra element of hypocrisy when self-professed liberal people do it.)
As a general simplification: The Liberal Ideal includes being open-minded & tolerant.
So it’s particularly unfortunate when a self-described liberal broadbrushes conservatives–as narrow-minded, as selfish, as hateful, or as smug, Pharisaical, self-righteous judgmental jerks. When a liberal thinks in stereotypes, seeing us through the filter of their preconceived ideas about us–without engaging & exploring & knowing us.
It’s frustrating being pigeonholed by someone who tells you how open-minded they are.
(I think the Prop 8 Musical is a good example of this. More about that in…Uh, I think it’ll be Pt 5. And I think my next entry will discuss what our response should be to this kind of stereotyping.)
Underlying Problems & Solutions
In a general sense, this happens because we’re messed-up, sinful people. Even in our attempts to be good or identify good, we get twisted around. And the solution will involve prayer, and humility, and being graceful toward each other when we screw up like this. But I want to try to be a little more specific.
Problem #1: A comfortable lack of introspection
We start to rest on our laurels. To be comfortable. We form an image of ourselves, and live in the image, unaware of whether we’re living up to it. We stop examining ourselves for consistency. We begin to live without integrity.
If you haven’t yet, listen to the mp3 of Carson talking about integrity–our struggle when we see that who we are on in the inside isn’t the same as who we try to be on the outside. Here’s the mp3. Go to 1:05:20, and listen for about 4.5 minutes.
So, accept that you’re going to be a hypocrite sometimes. Commit to finding out where it’s happening. Commit to the struggle. Keep examining yourself against the principles you claim to follow. Work out your salvation with fear and trembling, and commit to the humility of Christ.
Problem #2: Keeping score vs. the Gospel
The more we compete & try to keep score—winning arguments, or proving our worth—the more likely we are to form lying images in our minds. The more we think that our salvation depends on keeping the rules & being “good people”, the more likely we are to cling to a positive image of ourselves. And the less likely we are to probe our own life & heart, to find the inconsistencies.
If we live in a place of freedom—knowing that our hope is based on what Christ did—then it becomes easier to admit the problems, to look for more failures, and ask for grace from God to help us change.
And our lives proceed from our hearts. So when we pray for change, we have to pray for a change of heart. It means looking more to the life of Jesus, and falling in love with what we see. The change grows from the longing that God gives us to see his goodness, and taste it in our own lives. The change grows from the belief that it will be worth it to change, even when it’s hard & involves sacrifice. “He who loses his life for my sake will find it.”
And the change will come from God’s strength & goodness, not ours. “For it is God who works in you, both to will and to work for his good pleasure.” (Phil 2:13) I started this series from Romans 1-2; when we get to Romans 7, we find Paul talking about this kind of struggle with inconsistency. And in Romans 8, we find the words of blessed assurance that if we are in Christ, we will be made more like him–that he will be the firstborn of many brothers. He searches our hearts, and knows what is there, which should be scary–but he is bending all of history, everything in our lives, to change us.
“Likewise the Spirit helps us in our weakness. For we do not know what to pray for as we ought, but the Spirit himself intercedes for us with groanings too deep for words. And he who searches hearts knows what is the mind of the Spirit, becausethe Spirit intercedes for the saints according to the will of God. And we know that for those who love God all things work together for good,for those who are called according to his purpose. For those whom he foreknew he also predestined to be conformed to the image of his Son, in order that he might be the firstborn among many brothers. And those whom he predestined he also called, and those whom he called he also justified, and those whom he justified he also glorified.” (Rom. 8:26-30)
In the previous entry, I talked about how the Gospel should be at the center of anything we say about homosexuality–and this includes stressing the point that we are all sinners, and no one has the right to feel self-righteous. It’s interesting that Paul makes precisely that point when he talked about it.
Romans 1
Paul talks about homosexuality in Rom. 1:26-27, and then lists other sins in Rom. 1:28-32–like gossip and disobedience to parents. So, I started pointing that out, when I wanted to show that–biblically–homosexuality is a sin among other sins. To show that everyone–including me–stands condemned in the same way. No one can be self-righteous.
It’s odd. For some reason, I didn’t notice that Paul seems to be making exactly that point. Then recently, it clicked. When he lists “big” sins with “small” sins, he almost seems to bait a trap for the smugly self-righteous–letting the readers feel comfortable for a moment, before cutting them low. (Though… See the P.S. at the end of the entry.)
Lately, I’ve been encountering the combined subjects of homosexuality, hypocrisy, and shallow interaction. I started writing one entry on homosexuality in Romans 1-2, but it ballooned, and became too much for one post. So this will be the first in a small series. (Hopefully, I can keep each post terse! It’s hard for me to be brief.)
The major theme will be “going deeper”. Which is pretty tough to do, consistently.
The Bible & Homosexuality
The biblical passages on homosexuality evoke strong reactions. Many people see them as harsh & mean-spirited. They’re associated with a self-righteous attitude of condemnation–a mindset that looks down on homosexuals as the worst of all sinners. A mindset that ostracizes and rejects. A mindset that doesn’t understand, “Judge not, lest ye be judged.”
Slogans
There are standard evangelical responses. The most common soundbite is, “Love the sinner, and hate the sin.” Unfortunately, it has two major problems.
It’s a slogan–one that’s easy to spit out, regardless of whether there is any love in your life. It’s something Christian kids learn to say, without necessarily learning what it really looks like. So it can sound empty and hollow. Especially if people have been hurt by those who say it without living it.
More importantly: It almost implies a lie. It almost implies that gay people are sinners–unlike us. It does nothing to counteract the bad assumption that gay people go to hell, but straight people are fine. As though gay people are unique, as sinners, instead of everyone being in the same boat. Self-righteous condemnation.
Canned Answers
There are better slogans, maybe. (“We’re all sinners in need of a savior.” “Jesus said, ‘Judge not, lest ye be judged,’ but he also said, ‘Go and sin no more.’”) Pithy statements can be useful. Canned answers can help. But not when the canned answer reflects canned thinking. Not when the deeper truths aren’t deeply grasped, and lived out. Not when the only thing people hear is canned answers.
So we need to make sure that we know the truths behind the slogans, and that we live in accord with them. Our lives should be adorning the gospel.
Responding With the Gospel
When we talk about homosexuality, at the very core we need to be communicating the gospel. We need to be pointing to the universal need for salvation, and to the work of Christ to save us. To the need for repentance, to the need for trust in him, and to the power & sufficiency of trusting him, apart from any of our efforts to live well.
We’re sinners in need of a savior. Christians shouldn’t view ourselves as “righteous”, and scorn homosexuals as lowly sinners–everyone is together a sinner. And “not judging” doesn’t mean that we never say, “That’s wrong.” Rather, it means not condemning–we speak God’s grace to fellow sinners. In love. There’s no place for self-righteousness. When Christians understand Christ, then we respond with humility and grace and love and the free offer of the gospel. We look with love and care, in part because we know that we ourselves have been forgiven much.
When we understand the gospel, we cannot look down on anyone.
Wrap-up
We need to get past slogans. Or we need to put meat on the slogans we profess. It includes communicating the gospel more clearly. That includes rooting out any hint of self-righteousness. It includes avoiding the perception of being noxious, holier-than-thou “Religious Types”, by living out lives of Christ-like, loving, humble service.
Michael Patton over at Parchment and Pen has been doing a series called, “Why I Am Not Charismatic”. He seems to be roughly in the “open but cautious” area. His thoughts–along with the comment sections–have been well worth the reading time, for anyone trying to think through & understand the subject. (It’s still in-progress, BTW.)
If you’ve really got a lot of time, I would also recommend the series that Frank Turk (of the Pyromaniacs) wrote this fall. It began with a discussion of John Piper’s response to the Lakeland Revival, and went on from there. Compared to the P&P series, you’ll find that the tone of the discussion there will be a harder line against charismatics. If you’re charismatic, then you’ll probably end up being annoyed or offended at some of the comments. But there’s definitely some thoughtful material there. (Note: He never finished the last post.)
As a taste, here’s some of what he said in his second post:
I want to start with something I said in the meta a while ago which, I think, people need to keep in mind as we approach the question of how the Holy Spirit works in the church.
My opinion is that a “cautious” continualist and a “cautious” cessationist have way more in common that they have in contention. They agree that prayer is efficacious; they agree that God is the giver of all good things; they agree that the Christian has a privilege to ask God for his needs; they agree that we should rejoice when God supplies those needs.
The problem is when someone claims more than that, or less than that. I would say that those who fall outside of those affirmations put themselves in spiritual danger — a topic about which I am sure I have more I should write down.
As I’ve looked at the gift of tongues, I’ve found out that there’s a lot to work through. More than you might expect. The questions can get really complex. I want to find the straight-forward answers… But I want answers that seem to satisfy everything the Bible says about the gift.
I decided to write down all the questions & issues I can identify–every decision you have to make about the subject. What do you have to work through, when you’re studying it? Some of these have to do with the nature of the gift, and others are practical questions. Some are directly exegetical–about understanding a particular passage–and others are more general.
Note: Some of these questions have simple answers. Some seem like they have simple answers, but don’t. And maybe some seem complex to me, but they really aren’t.
Also Note: I’ve been sitting on this entry for a week or two, tweaking it & improving it. I’m still not entirely happy with it… There are parts that might not be clear enough. But I can’t keep fiddling forever.
Invitation: If you can think of any additional questions, please, leave a comment. I’d like to make this as exhaustive as possible!
I. Summary: The Biggest Questions
Is the gift of tongues still given today?
Can all believers speak in tongues?
Should all believers speak in tongues?
Are tongues always directed to God, i.e. prayer or praise? Or does it include messages to other people?
The gift of tongues seems to involve some kind of unlearned language. But is it a heavenly language–a “private prayer language”, i.e. glossalalia–or is it speaking in an unlearned human language? Or does it include both?
Can you understand your own gift, when you speak it? Always? Ever?
How are interpreted tongues to be practiced in church? 1 Cor. 14:28 says, “if there is no one to interpret, let each of them keep silent in church“. How do you know if there’s someone to interpret?
This spring, when the Lakeland Revival was starting, I thought about writing a post on the general issue of sensationalism, along with “mountaintop experiences” like Christian camps or conferences or events. I didn’t so much want to evaluate Lakeland, as to talk about the proper place of “unusual/sensational” things in the life of the church. I wrote a couple drafts, but never finished one.
Carson did a fantastic job. He didn’t talk about everything there is to say–for instance, he didn’t directly compare the unusual/uncommon work of the Spirit with the regular work of the Spirit in the local church–but I absolutely love what he did say.
It reminds me of a Sam Storms quote that I heard about second-hand, recently. Something like: Biblical balance means pursuing everything the Bible teaches with exactly as much emphasis and enthusiasm as the Bible teaches us to have.
“Rejoice always, pray without ceasing, give thanks in all circumstances; for this is the will of God in Christ Jesus for you. Do not quench the Spirit. Do not despise prophecies, but test everything; hold fast what is good. Abstain from every form of evil.” 1 Thess. 5:16-22
People typically connect “Do not quench the Spirit” with the next verse, “Do not despise prophecies.” But I wonder if it’s also connected with the preceding verse, “Give thanks in all circumstances”. In other words, is grumbling & complaining–the opposite of thankfulness–a way of quenching the Spirit?
There seems to be a pretty consistent connection between thankfulness and the Spirit.
Thanksgiving is part of being filled with the Spirit:
“And do not get drunk with wine, for that is debauchery, but be filled with the Spirit, addressing one another in psalms and hymns and spiritual songs, singing and making melody to the Lord with your heart, giving thanks always and for everything to God the Father in the name of our Lord Jesus Christ, submitting to one another out of reverence for Christ.” Eph. 5:18-21
Thanksgiving is part of walking in Christ:
“Therefore, as you received Christ Jesus the Lord, so walk in him, rooted and built up in him and established in the faith, just as you were taught, abounding in thanksgiving.” Col. 2:6-7
Thanksgiving is part of the word of Christ dwelling richly in us:
“Let the word of Christ dwell in you richly, teaching and admonishing one another in all wisdom, singing psalms and hymns and spiritual songs, with thankfulness in your hearts to God. And whatever you do, in word or deed, do everything in the name of the Lord Jesus, giving thanks to God the Father through him.” Col. 3:16-17
Speaking in tongues can be giving thanks with your spirit:
“Otherwise, if you give thanks with your spirit, how can anyone in the position of an outsidersay “Amen” to your thanksgiving when he does not know what you are saying?” 1 Cor. 14:16
Avoiding grumbling and complaining is part of working out our salvation with fear and trembling, and part of remaining blameless and innocent:
“Therefore, my beloved, as you have always obeyed, so now, not only as in my presence but much more in my absence, work out your own salvation with fear and trembling,for it is God who works in you, both to will and to work for his good pleasure. Do all things without grumbling or questioning,that you may be blameless and innocent, children of God without blemish in the midst of a crooked and twisted generation, among whom you shine as lights in the world” Phil. 2:12-15
So, it seems that being filled with the Spirit produces thanksgiving, and grumbling quenches the Spirit.
“Yet another issue is a deeply ingrained love of sensationalism and triumphalism, and little knowledge of taking up one’s cross daily. I do not mean to suggest that any gift of tongues, say, or any “prophecy” as defined here, or any miraculous healing, should be ruled out because it might be thought “sensational.” To denigrate the “sensational” in so sweeping a way, a fairly common ploy among noncharismatics, would surely be to indict Jesus and Paul. Rather, the problem lies in love for sensationalism, in the unbiblical and unhealthy focus upon it. [...] It magnifies the importance of what is, biblically speaking, relatively incidental, while ignoring the weightier matters: righteousness, holiness, justice, love, truth, mercy. It is constantly in danger of sacrificing integrity as the rush towards the sensational pelts on: stories of healings are blown out of proportion, so that the genuine instances are lost in exaggeration and distortion; evangelism loses out to manipulated outbursts of emotion [...]; the straightforward and impassioned message of the cross, proclaimed by a Whitefield, is displaced by endless promises to solve personal problems; and only the Christians whose problems have evaporated and who enjoys perfect health has entered into the fullness of the riches Jesus promises. In the more extreme cases, the triumphalism is carried so far as to promise wealth as well: give your “seed money” to God (i.e., our organization), and watch God multiply it; you are the child of a king–do you not think your heavenly Father wants you to live in royal splendor? Believers who have meditated long on Matthew 10 or John 15:18-16:4, let alone believers in China, will not be impressed by this argument. [emphasis added]“
|
{
"pile_set_name": "Pile-CC"
}
|
Perth bushfire paints skies 'vivid orange' Published duration 15 January 2018
image copyright Kathy Mathieson image caption Smoke from the bushfire over Perth on Sunday
Skies in Perth, Australia, turned dramatic colours after a bushfire blanketed the city with smoke.
More than 150 firefighters fought the blaze as it burned through 3,000 acres (1,200ha) of bushland near the city on Sunday, authorities said.
The fire prompted clouds of smoke and ash, with many locals posting photos on social media.
Officials said the fire was being treated as suspicious, but nobody was hurt.
image copyright WA DEPARTMENT OF FIRE AND EMERGENCY SERVICES image caption Firefighters battle the blaze in the Perth Hills
Perth woman Geraldine McGregor, 34, said she witnessed "vivid orange skies" in the city's centre.
"When I saw the smoke quickly fill the sky with that colour, I was worried, because I knew it could only mean a massive bushfire somewhere," she told the BBC.
image copyright GERALDINE MCGREGOR image caption The sight prompted many locals to post images online
image copyright GERALDINE MCGREGOR
Others posted photos of the sky darkening across suburbs, and said ash was falling.
Drivers were warned to drive carefully in the conditions. The smoke could even be seen from planes.
Residents were warned that the fire posed a risk to lives and homes, but the threat was later downgraded when wind conditions changed.
Authorities were also fighting a bushfire in New South Wales on Monday.
|
{
"pile_set_name": "OpenWebText2"
}
|
We noticed that you're using an unsupported browser. The TripAdvisor website may not display properly. We support the following browsers:
Windows:Internet Explorer,
Mozilla Firefox,
Google Chrome.
Mac:Safari.
Special offer in Amasra
Just For You shows you hotels that align with your unique travel style and needs - it's not your average one-size-fits-all hotel search. So tell us what you love, and let us do the rest. There are countless ways for you to help TripAdvisor learn more about you:
"Stayed here with group tour. staff friendly and helpful. Breakfast was basic but adequate. rooms were clean and comfortable. The view from our room was great. bathroom was modern however if you are up early it takes a while for the hot water to come."
"My sister and I stayed at Ceylin Amasra in October 2014 and really enjoyed our stay. Mehmet, the owner, and all of his family, were very accommodating--very welcoming and helpful and friendly. We were updated to a suite which was a real treat. We really liked the location of the hotel and the vie
w of the harbor. Amasra doesn't get too many foreign tourists but we felt it was completely worth the trip up to the Black Sea and that the Ceylin was the best choice.
..."More >Less <
"The Ceylin Hotel is more like a B&B than a hotel and the the friendly owner Mehmet is the first to identify his establishment as such. The Ceylin is one of the cleanest and and most modern B&B's we have stayed at in Turkey. Mehmet greeted us upon our arrival and offered to upgrade our room without
any prompting. He also provided us with recommendations for restaurants and took care of making reservations for us.
This is a family run business and we were treated as an extension of that family. While the Ceylin is located outside of the center of Amasra it is a short drive or cab ride to get to where you will find a good selection of restaurants and shops.
If you are looking to spend time in the Black Sea region and are looking for a clean, economical, friendly place to stay don't hesitate in booking this hotel.
..."More >Less <
* TripAdvisor LLC is not a booking agent and does not charge any service fees to users of our site... (more)
We noticed that you're using an unsupported browser. The TripAdvisor website may not display properly. We support the following browsers:
Windows:Internet Explorer,
Mozilla Firefox,
Google Chrome.
Mac:Safari.
TripAdvisor LLC is not responsible for content on external web sites. Taxes, fees not included for deals content.
|
{
"pile_set_name": "Pile-CC"
}
|
Encrypted Alphanumeric Keywords: Your organization’s safe deposit box
How many websites have asked you for your social security number this year? How about forms you have filled out and sent through the mail? Or scam emails?
We all know how important it is that social security numbers stay confidential, yet we must use these numbers so often it is hard to keep track of who has requested them, and for what purpose.
We put our faith in those we do business with every day, and trust they keep our social security numbers and other personally identifiable information (PII) confidential. We hope the organizations handling documents containing this information are doing everything they can to enforce a policy of least privilege – meaning that only those workers who need to see a social security number should have access to it.
Is your organization doing everything that it can to protect customer information? While complying with standards like HIPAA is a great start, it is by no means a signal that customer data is completely safe from the bad guys, and that the good guys can discontinue their efforts to strengthen defenses.
Defense-in-depth
A good security policy is multi-layered (think of an onion). If one layer fails, there are others in place. This is a concept that security professionals refer to as “defense-in-depth.”
One asset that is high on the list of attackers’ objectives is your database. A tactic they employ often is to steal or copy the target’s database, and then “dump” the information on a website that allows for pasting information anonymously.
If someone were to steal your database tomorrow, how confident are you that your customers would be comfortable with the way you store their information? Are you storing passwords using a strong cryptographic hash algorithm?
What about PII? Have you encrypted keywords like social security numbers in the database? You definitely don’t want to wake up one morning and find your customers’ social security numbers on pastebin.com.
Using encrypted alphanumeric keywords
Beyond the threat of someone stealing your database, there is also the concern of who is able to access this information in their day-to-day work. Do your support specialists need to see customer social security numbers? How about your HR generalists and recruiters?
If certain employees will not need access to this data, why make it available to them? Personally identifiable information should remain encrypted until accessed by a party with rights to see it.
At Hyland, we offer the ability for you to encrypt alphanumeric keywords. This robust security measure can provide you, your patients and customers with peace of mind. When you use encrypted alphanumeric keywords utilizing the AES-256 algorithm, they remain encrypted in the database and are not decrypted until a user with appropriate rights and privileges accesses them.
What if your users need access to documents that have been indexed with encrypted keywords, but you don’t want the encrypted keywords to be visible to them? No problem!
Using the security masking feature, the encrypted keyword values will be masked for all users that do not have rights to view restricted security keywords.
The financial consequences to exposure of PII can be devastating. By ensuring that private information is encrypted within your database, in case it becomes the target of cyber-criminals, everyone sleeps better at night. Especially your customers.
Kate Barney is Hyland's marketing portfolio manager for the healthcare industry. Josh Gatka has worked in Hyland’s Quality Assurance department for four years. In 2016, he assumed the role of Hyland’s Security Evangelist. His mission is to train and educate industry professionals on how to protect themselves and their organization from today’s advanced cyberthreats.
|
{
"pile_set_name": "Pile-CC"
}
|
Describing different brain computer interface systems through a unique model: a UML implementation.
All the protocols currently implemented in brain computer interface (BCI) experiments are characterized by different structural and temporal entities. Moreover, due to the lack of a unique descriptive model for BCI systems, there is not a standard way to define the structure and the timing of a BCI experimental session among different research groups and there is also great discordance on the meaning of the most common terms dealing with BCI, such as trial, run and session. The aim of this paper is to provide a unified modeling language (UML) implementation of BCI systems through a unique dynamic model which is able to describe the main protocols defined in the literature (P300, mu-rhythms, SCP, SSVEP, fMRI) and demonstrates to be reasonable and adjustable according to different requirements. This model includes a set of definitions of the typical entities encountered in a BCI, diagrams which explain the structural correlations among them and a detailed description of the timing of a trial. This last represents an innovation with respect to the models already proposed in the literature. The UML documentation and the possibility of adapting this model to the different BCI systems built to date, make it a basis for the implementation of new systems and a mean for the unification and dissemination of resources. The model with all the diagrams and definitions reported in the paper are the core of the body language framework, a free set of routines and tools for the implementation, optimization and delivery of cross-platform BCI systems.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
Q:
Batch processing in array using PHP
I got thousands of data inside the array that was parsed from xml.. My concern is the processing time of my script, Does it affect the processing time of my script since I have a hundred thousand records to be inserted in the database? I there a way that I process the insertion of the data to the database in batch?
A:
This is for SQL files - but you can follow it's model ( if not just use it ) -
It splits the file up into parts that you can specify, say 3000 lines and then inserts them on a timed interval < 1 second to 1 minute or more.
This way a large file is broken into smaller inserts etc.
This will help bypass editing the php server configuration and worrying about memory limits etc. Such as script execution time and the like.
New Users can't insert links so Google Search "sql big dump" or if this works goto:
www [dot] ozerov [dot] de [ slash ] bigdump [ dot ] php
So you could even theoretically modify the above script to accept your array as the data source instead of the SQl file. It would take some modification obviously.
Hope it helps.
-R
|
{
"pile_set_name": "StackExchange"
}
|
Effect of Bacoside A on growth and biofilm formation by Staphylococcus aureus and Pseudomonas aeruginosa.
The goal of this study was to evaluate the antibiofilm and antimicrobial activities of Bacoside A, a formulation of phytochemicals from Bacopa monnieri, against Staphylococcus aureus and Pseudomonas aeruginosa, which are known to form biofilms as one of their virulence traits. The antimicrobial effects of Bacoside A were tested using the minimum inhibitory concentration and minimum bactericidal concentration assays. A cell membrane disruption assay was performed to find its possible target site. MTT assay, crystal violet assay, and microscopic studies were performed to assess the antibiofilm activity. Bacoside A showed antimicrobial activity against both test organisms in their planktonic and biofilm states. At a subminimum inhibitory concentration of 200 μg·mL-1, Bacoside A significantly removed ∼88%-93% of bacterial biofilm developed on microtiter plates. Biochemical and microscopic studies suggested that the eradication of biofilm might be due to the loss of extracellular polymeric substances and to a change in cell membrane integrity of the selected bacterial strains treated with Bacoside A. These results indicate that Bacoside A might be considered as an antimicrobial having the ability to disrupt biofilms. Thus, either alone or in combination with other therapeutics, Bacoside A could be useful to treat biofilm-related infections caused by opportunistic bacterial pathogens.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
1. Field of the Invention
This invention relates to a circuit for detecting the movement of a solenoid armature associated, for example, with a solenoid valve, whereby correct or incorrect operation of the armature, and therefore of the valve, may be monitored, especially from a remote location.
2. Description of the Related Art
Pneumatically operated systems, for example, typically comprise a large number of solenoid valves which function in a predetermined, desired sequence and control the operation of pneumatic devices such as cylinders. Usually, operation of the system is monitored from a remote, central console and it would be desirable to provide, as part of the console, means to indicate that each solenoid armature is operating correctly, or not, as the case may be. It is an object of the present invention to provide such means, and this object is achieved by relying on the observation that, when a solenoid armature moves in response to energisation of the solenoid coil, the inductance of the coil changes which causes the current flowing through the coil to drop momentarily.
|
{
"pile_set_name": "USPTO Backgrounds"
}
|
Enhancement of the complement activating capacity of 17-1A mAb to overcome the effect of membrane-bound complement regulatory proteins on colorectal carcinoma.
Adjuvant immunotherapy with 17-1A mAb directed against colorectal carcinoma is found to be effective in patients. However, 52 % of the patients treated with mAb 17-1A showed recurrence within 7 years. This high recurrence rate might be due to inhibition of complement activation by membrane-bound complement regulatory proteins (mCRP). The effect of these complement regulatory proteins might be reduced by blocking mCRP, or be overcome by activating more complement at the tumor cell membrane. In this study the complement-activating capacity of the 17-1A mAb was enlarged by conjugating it to cobra venom factor (CVF) or C3b. The most important C3 regulatory protein, CD55, was blocked using a bispecific mAb directed against the 17-1A / Ep-CAM antigen and CD55. Up to a 13-fold increase in C3 deposition was observed due to 17-1A-CVF and 17-1A-C3b, as compared to 17-1A. CD55 was shown to partly inhibit complement activation by these conjugates. The effect of the bispecific anti-17-1A / Ep-CAM*anti-CD55 mAb was compared with 17-1A conjugates with CVF or C3, and bispecific mAb were shown to be equally or more efficient in complement activation than the 17-1A-CVF or 17-1A-C3b conjugates. Therefore, 17-1A conjugates and anti-17-1A / EpCAM*anti-CD55 bispecific mAb may be promising immunotherapeutic agents for patients with colorectal cancer.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
Q:
How to compare .net FW version number with number stored in variable
Super new here and to #Powershell. I'm making a script to check whether the .Net Framework version that is installed is greater than or equal to a version number stored in a variable.
The issue I have is when setting up the variable that filters down to the version number.
$installed = (Get-ChildItem 'HKLM:\SOFTWARE\Microsoft\NET Framework Setup\NDP\v4\Full\' | Get-ItemPropertyValue -Name Version | Where { $_.Version -ge $software }) -ne $null
I want to compare the .Net Framework Version found in
HKLM:\SOFTWARE\Microsoft\NET Framework Setup\NDP\v4\Full
to whichever version is installed on a Windows 10 computer to see if it is greater than or equal. I've tried comparing the release number in the registry, but the Version is more relevant for what I'm doing.
I want to write a message to the console and to a text file
$software = '4.7.02053'
$installed = (Get-ChildItem 'HKLM:\SOFTWARE\Microsoft\NET Framework Setup\NDP\v4\Full\' | Get-ItemPropertyValue -Name Version | Where { $_.Version -ge $software }) -ne $null
If(-not $installed) {
"$software is NOT installed."| Out-File -FilePath C:\Pre-Req_Log.txt -append
Write-Host "'$software' is NOT installed.";
pause
} else {
"$software is installed."| Out-File -FilePath C:\Pre-Req_Log.txt -append
Write-Host ".Net FW '$software' is installed."
}
My expected result is to see '4.7.02053' is (or not) Installed in the text file and it be correct. It doesn't matter if it's equal, as long as it's that version or greater I will be happy.
A:
To compare version numbers, don't compare them as strings, cast them to [version] (System.Version) and then compare them:
$refVersion = [version] '4.7.02053'
$installedVersion = [version] (Get-ItemPropertyValue -LiteralPath 'HKLM:\SOFTWARE\Microsoft\NET Framework Setup\NDP\v4\Full' -Name Version)
if ($installedVersion -ge $refVersion) {
# installed
# ...
}
else {
# not installed
# ...
}
If you use these [version] instances inside an expandable string ("..."), you'll get the expected string representation, but note that outputting them as-is to the console or via Out-File / > will show a tabular display with the version-number components shown individually. To force the usual string representation, use enclosing "..." - e.g., "$refVersion", or call .ToString(), e.g., $refVersion.ToString()
|
{
"pile_set_name": "StackExchange"
}
|
// @tag core
// @define Ext.Boot
var Ext = Ext || {};
//<editor-fold desc="Boot">
/**
* @class Ext.Boot
* @singleton
* @private
*/
Ext.Boot = Ext.Boot || (function (emptyFn) {
var doc = document,
_emptyArray = [],
_config = {
/**
* @cfg {Boolean} [disableCaching=true]
* If `true` current timestamp is added to script URL's to prevent caching.
* In debug builds, adding a "cache" or "disableCacheBuster" query parameter
* to the page's URL will set this to `false`.
*/
disableCaching: (/[?&](?:cache|disableCacheBuster)\b/i.test(location.search) ||
!(/http[s]?\:/i.test(location.href)) ||
/(^|[ ;])ext-cache=1/.test(doc.cookie)) ? false :
true,
/**
* @cfg {String} [disableCachingParam="_dc"]
* The query parameter name for the cache buster's timestamp.
*/
disableCachingParam: '_dc',
/**
* @cfg {Boolean} loadDelay
* Millisecond delay between asynchronous script injection (prevents stack
* overflow on some user agents) 'false' disables delay but potentially
* increases stack load.
*/
loadDelay: false,
/**
* @cfg {Boolean} preserveScripts
* `false` to remove asynchronously loaded scripts, `true` to retain script
* element for browser debugger compatibility and improved load performance.
*/
preserveScripts: true,
/**
* @cfg {String} [charset=UTF-8]
* Optional charset to specify encoding of dynamic content.
*/
charset: 'UTF-8'
},
_assetConfig= {},
cssRe = /\.css(?:\?|$)/i,
resolverEl = doc.createElement('a'),
isBrowser = typeof window !== 'undefined',
_environment = {
browser: isBrowser,
node: !isBrowser && (typeof require === 'function'),
phantom: (window && (window._phantom || window.callPhantom)) || /PhantomJS/.test(window.navigator.userAgent)
},
_tags = (Ext.platformTags = {}),
//<debug>
// All calls to _debug are commented out to speed up old browsers a bit;
// yes that makes a difference because the cost of concatenating strings
// and passing them into _debug() adds up pretty quickly.
_debug = function (message) {
//console.log(message);
},
//</debug>
_apply = function (object, config, defaults) {
if (defaults) {
_apply(object, defaults);
}
if (object && config && typeof config === 'object') {
for (var i in config) {
object[i] = config[i];
}
}
return object;
},
_merge = function() {
var lowerCase = false,
obj = Array.prototype.shift.call(arguments),
index, i, len, value;
if (typeof arguments[arguments.length - 1] === 'boolean') {
lowerCase = Array.prototype.pop.call(arguments);
}
len = arguments.length;
for (index = 0; index < len; index++) {
value = arguments[index];
if (typeof value === 'object') {
for (i in value) {
obj[lowerCase ? i.toLowerCase() : i] = value[i];
}
}
}
return obj;
},
_getKeys = (typeof Object.keys == 'function') ?
function(object){
if (!object) {
return [];
}
return Object.keys(object);
} :
function(object) {
var keys = [],
property;
for (property in object) {
if (object.hasOwnProperty(property)) {
keys.push(property);
}
}
return keys;
},
/*
* The Boot loader class manages Request objects that contain one or
* more individual urls that need to be loaded. Requests can be performed
* synchronously or asynchronously, but will always evaluate urls in the
* order specified on the request object.
*/
Boot = {
loading: 0,
loaded: 0,
apply: _apply,
env: _environment,
config: _config,
/**
* @cfg {Object} assetConfig
* A map (url->assetConfig) that contains information about assets loaded by the Microlaoder.
*/
assetConfig: _assetConfig,
// Keyed by absolute URL this object holds "true" if that URL is already loaded
// or an array of callbacks to call once it loads.
scripts: {
/*
Entry objects
'http://foo.com/bar/baz/Thing.js': {
done: true,
el: scriptEl || linkEl,
preserve: true,
requests: [ request1, ... ]
}
*/
},
/**
* contains the current script name being loaded
* (loadSync or sequential load only)
*/
currentFile: null,
suspendedQueue: [],
currentRequest: null,
// when loadSync is called, need to cause subsequent load requests to also be loadSync,
// eg, when Ext.require(...) is called
syncMode: false,
/*
* simple helper method for debugging
*/
//<debug>
debug: _debug,
//</debug>
/**
* enables / disables loading scripts via script / link elements rather
* than using ajax / eval
*/
useElements: true,
listeners: [],
Request: Request,
Entry: Entry,
allowMultipleBrowsers: false,
browserNames: {
ie: 'IE',
firefox: 'Firefox',
safari: 'Safari',
chrome: 'Chrome',
opera: 'Opera',
dolfin: 'Dolfin',
edge: 'Edge',
webosbrowser: 'webOSBrowser',
chromeMobile: 'ChromeMobile',
chromeiOS: 'ChromeiOS',
silk: 'Silk',
other: 'Other'
},
osNames: {
ios: 'iOS',
android: 'Android',
windowsPhone: 'WindowsPhone',
webos: 'webOS',
blackberry: 'BlackBerry',
rimTablet: 'RIMTablet',
mac: 'MacOS',
win: 'Windows',
tizen: 'Tizen',
linux: 'Linux',
bada: 'Bada',
chromeOS: 'ChromeOS',
other: 'Other'
},
browserPrefixes: {
ie: 'MSIE ',
edge: 'Edge/',
firefox: 'Firefox/',
chrome: 'Chrome/',
safari: 'Version/',
opera: 'OPR/',
dolfin: 'Dolfin/',
webosbrowser: 'wOSBrowser/',
chromeMobile: 'CrMo/',
chromeiOS: 'CriOS/',
silk: 'Silk/'
},
// When a UA reports multiple browsers this list is used to prioritize the 'real' browser
// lower index number will win
browserPriority: [
'edge',
'opera',
'dolfin',
'webosbrowser',
'silk',
'chromeiOS',
'chromeMobile',
'ie',
'firefox',
'safari',
'chrome'
],
osPrefixes: {
tizen: '(Tizen )',
ios: 'i(?:Pad|Phone|Pod)(?:.*)CPU(?: iPhone)? OS ',
android: '(Android |HTC_|Silk/)', // Some HTC devices ship with an OSX userAgent by default,
// so we need to add a direct check for HTC_
windowsPhone: 'Windows Phone ',
blackberry: '(?:BlackBerry|BB)(?:.*)Version\/',
rimTablet: 'RIM Tablet OS ',
webos: '(?:webOS|hpwOS)\/',
bada: 'Bada\/',
chromeOS: 'CrOS '
},
fallbackOSPrefixes: {
windows: 'win',
mac: 'mac',
linux: 'linux'
},
devicePrefixes: {
iPhone: 'iPhone',
iPod: 'iPod',
iPad: 'iPad'
},
maxIEVersion: 12,
/**
* The default function that detects various platforms and sets tags
* in the platform map accordingly. Examples are iOS, android, tablet, etc.
* @param tags the set of tags to populate
*/
detectPlatformTags: function () {
var me = this,
ua = navigator.userAgent,
isMobile = /Mobile(\/|\s)/.test(ua),
element = document.createElement('div'),
isEventSupported = function (name, tag) {
if (tag === undefined) {
tag = window;
}
var eventName = 'on' + name.toLowerCase(),
isSupported = (eventName in element);
if (!isSupported) {
if (element.setAttribute && element.removeAttribute) {
element.setAttribute(eventName, '');
isSupported = typeof element[eventName] === 'function';
if (typeof element[eventName] !== 'undefined') {
element[eventName] = undefined;
}
element.removeAttribute(eventName);
}
}
return isSupported;
},
// Browser Detection
getBrowsers = function () {
var browsers = {},
maxIEVersion, prefix,
value, key, index, len, match, version, matched;
// MS Edge browser (and possibly others) can report multiple browsers in the UserAgent
// "Mozilla/5.0 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/42.0.2311.135 Safari/537.36 Edge/12.10240"
// we use this to prioritize the actual browser in this situation
len = me.browserPriority.length;
for (index = 0; index < len; index++) {
key = me.browserPriority[index];
if (!matched) {
value = me.browserPrefixes[key];
match = ua.match(new RegExp('(' + value + ')([\\w\\._]+)'));
version = match && match.length > 1 ? parseInt(match[2]) : 0;
if (version) {
matched = true;
}
} else {
version = 0;
}
browsers[key] = version;
}
//Deal with IE document mode
if (browsers.ie) {
var mode = document.documentMode;
if (mode >= 8) {
browsers.ie = mode;
}
}
// Fancy IE greater than and less then quick tags
version = browsers.ie || false;
maxIEVersion = Math.max(version, me.maxIEVersion);
for (index = 8; index <= maxIEVersion; ++index) {
prefix = 'ie' + index;
browsers[prefix + 'm'] = version ? version <= index : 0;
browsers[prefix] = version ? version === index : 0;
browsers[prefix + 'p'] = version ? version >= index : 0;
}
return browsers;
},
//OS Detection
getOperatingSystems = function () {
var systems = {},
value, key, keys, index, len, match, matched, version, activeCount;
keys = _getKeys(me.osPrefixes);
len = keys.length;
for (index = 0, activeCount = 0; index < len; index++) {
key = keys[index];
value = me.osPrefixes[key];
match = ua.match(new RegExp('(' + value + ')([^\\s;]+)'));
matched = match ? match[1] : null;
// This is here because some HTC android devices show an OSX Snow Leopard userAgent by default.
// And the Kindle Fire doesn't have any indicator of Android as the OS in its User Agent
if (matched && (matched === 'HTC_' || matched === 'Silk/')) {
version = 2.3;
} else {
version = match && match.length > 1 ? parseFloat(match[match.length - 1]) : 0;
}
if (version) {
activeCount++;
}
systems[key] = version;
}
keys = _getKeys(me.fallbackOSPrefixes);
// If no OS could be found we resort to the fallbacks, otherwise we just
// falsify the fallbacks
len = keys.length;
for (index = 0; index < len; index++) {
key = keys[index];
// No OS was detected from osPrefixes
if (activeCount === 0) {
value = me.fallbackOSPrefixes[key];
match = ua.toLowerCase().match(new RegExp(value));
systems[key] = match ? true : 0;
} else {
systems[key] = 0;
}
}
return systems;
},
// Device Detection
getDevices = function () {
var devices = {},
value, key, keys, index, len, match;
keys = _getKeys(me.devicePrefixes);
len = keys.length;
for (index = 0; index < len; index++) {
key = keys[index];
value = me.devicePrefixes[key];
match = ua.match(new RegExp(value));
devices[key] = match ? true : 0;
}
return devices;
},
browsers = getBrowsers(),
systems = getOperatingSystems(),
devices = getDevices(),
platformParams = Boot.loadPlatformsParam();
// We apply platformParams from the query here first to allow for forced user valued
// to be used in calculation of generated tags
_merge(_tags, browsers, systems, devices, platformParams, true);
_tags.phone = !!((_tags.iphone || _tags.ipod) ||
(!_tags.silk && (_tags.android && (_tags.android < 3 || isMobile))) ||
(_tags.blackberry && isMobile) ||
(_tags.windowsphone));
_tags.tablet = !!(!_tags.phone && (
_tags.ipad ||
_tags.android ||
_tags.silk ||
_tags.rimtablet ||
(_tags.ie10 && /; Touch/.test(ua))
));
_tags.touch =
// if the browser has touch events we can be reasonably sure the device has
// a touch screen
isEventSupported('touchend') ||
// browsers that use pointer event have maxTouchPoints > 0 if the
// device supports touch input
// http://www.w3.org/TR/pointerevents/#widl-Navigator-maxTouchPoints
navigator.maxTouchPoints ||
// IE10 uses a vendor-prefixed maxTouchPoints property
navigator.msMaxTouchPoints;
_tags.desktop = !_tags.phone && !_tags.tablet;
_tags.cordova = _tags.phonegap = !!(window.PhoneGap || window.Cordova || window.cordova);
_tags.webview = /(iPhone|iPod|iPad).*AppleWebKit(?!.*Safari)(?!.*FBAN)/i.test(ua);
_tags.androidstock = (_tags.android <= 4.3) && (_tags.safari || _tags.silk);
// Re-apply any query params here to allow for user override of generated tags (desktop, touch, tablet, etc)
_merge(_tags, platformParams, true);
},
/**
* Extracts user supplied platform tags from the "platformTags" query parameter
* of the form:
*
* ?platformTags=name:state,name:state,...
*
* (each tag defaults to true when state is unspecified)
*
* Example:
*
* ?platformTags=isTablet,isPhone:false,isDesktop:0,iOS:1,Safari:true, ...
*
* @returns {Object} the platform tags supplied by the query string
*/
loadPlatformsParam: function () {
// Check if the ?platform parameter is set in the URL
var paramsString = window.location.search.substr(1),
paramsArray = paramsString.split("&"),
params = {}, i,
platforms = {},
tmpArray, tmplen, platform, name, enabled;
for (i = 0; i < paramsArray.length; i++) {
tmpArray = paramsArray[i].split("=");
params[tmpArray[0]] = tmpArray[1];
}
if (params.platformTags) {
tmpArray = params.platformTags.split(",");
for (tmplen = tmpArray.length, i = 0; i < tmplen; i++) {
platform = tmpArray[i].split(":");
name = platform[0];
enabled=true;
if (platform.length > 1) {
enabled = platform[1];
if (enabled === 'false' || enabled === '0') {
enabled = false;
}
}
platforms[name] = enabled;
}
}
return platforms;
},
filterPlatform: function (platform, excludes) {
platform = _emptyArray.concat(platform || _emptyArray);
excludes = _emptyArray.concat(excludes || _emptyArray);
var plen = platform.length,
elen = excludes.length,
include = (!plen && elen), // default true if only excludes specified
i, tag;
for (i = 0; i < plen && !include; i++) {
tag = platform[i];
include = !!_tags[tag];
}
for (i = 0; i < elen && include; i++) {
tag = excludes[i];
include = !_tags[tag];
}
return include;
},
init: function () {
var scriptEls = doc.getElementsByTagName('script'),
script = scriptEls[0],
len = scriptEls.length,
re = /\/ext(\-[a-z\-]+)?\.js$/,
entry, src, state, baseUrl, key, n, origin;
// No check for script definedness because there always should be at least one
Boot.hasReadyState = ("readyState" in script);
Boot.hasAsync = ("async" in script);
Boot.hasDefer = ("defer" in script);
Boot.hasOnLoad = ("onload" in script);
// Feature detecting IE
Boot.isIE8 = Boot.hasReadyState && !Boot.hasAsync && Boot.hasDefer && !Boot.hasOnLoad;
Boot.isIE9 = Boot.hasReadyState && !Boot.hasAsync && Boot.hasDefer && Boot.hasOnLoad;
Boot.isIE10p = Boot.hasReadyState && Boot.hasAsync && Boot.hasDefer && Boot.hasOnLoad;
Boot.isIE10 = (new Function('/*@cc_on return @_jscript_version @*/')()) === 10;
Boot.isIE10m = Boot.isIE10 || Boot.isIE9 || Boot.isIE8;
// IE11 does not support conditional compilation so we detect it by exclusion
Boot.isIE11 = Boot.isIE10p && !Boot.isIE10;
// Since we are loading after other scripts, and we needed to gather them
// anyway, we track them in _scripts so we don't have to ask for them all
// repeatedly.
for (n = 0; n < len; n++) {
src = (script = scriptEls[n]).src;
if (!src) {
continue;
}
state = script.readyState || null;
// If we find a script file called "ext-*.js", then the base path is that file's base path.
if (!baseUrl && re.test(src)) {
baseUrl = src;
}
if (!Boot.scripts[key = Boot.canonicalUrl(src)]) {
//<debug>
// _debug("creating entry " + key + " in Boot.init");
//</debug>
entry = new Entry({
key: key,
url: src,
done: state === null || // non-IE
state === 'loaded' || state === 'complete', // IE only
el: script,
prop: 'src'
});
}
}
if (!baseUrl) {
script = scriptEls[scriptEls.length - 1];
baseUrl = script.src;
}
Boot.baseUrl = baseUrl.substring(0, baseUrl.lastIndexOf('/') + 1);
origin = window.location.origin ||
window.location.protocol +
"//" +
window.location.hostname +
(window.location.port ? ':' + window.location.port: '');
Boot.origin = origin;
Boot.detectPlatformTags();
Ext.filterPlatform = Boot.filterPlatform;
},
/**
* This method returns a canonical URL for the given URL.
*
* For example, the following all produce the same canonical URL (which is the
* last one):
*
* http://foo.com/bar/baz/zoo/derp/../../goo/Thing.js?_dc=12345
* http://foo.com/bar/baz/zoo/derp/../../goo/Thing.js
* http://foo.com/bar/baz/zoo/derp/../jazz/../../goo/Thing.js
* http://foo.com/bar/baz/zoo/../goo/Thing.js
* http://foo.com/bar/baz/goo/Thing.js
*
* @private
*/
canonicalUrl: function (url) {
// *WARNING WARNING WARNING*
// This method yields the most correct result we can get but it is EXPENSIVE!
// In ALL browsers! When called multiple times in a sequence, as if when
// we resolve dependencies for entries, it will cause garbage collection events
// and overall painful slowness. This is why we try to avoid it as much as we can.
//
// @TODO - see if we need this fallback logic
// http://stackoverflow.com/questions/470832/getting-an-absolute-url-from-a-relative-one-ie6-issue
resolverEl.href = url;
var ret = resolverEl.href,
dc = _config.disableCachingParam,
pos = dc ? ret.indexOf(dc + '=') : -1,
c, end;
// If we have a _dc query parameter we need to remove it from the canonical
// URL.
if (pos > 0 && ((c = ret.charAt(pos - 1)) === '?' || c === '&')) {
end = ret.indexOf('&', pos);
end = (end < 0) ? '' : ret.substring(end);
if (end && c === '?') {
++pos; // keep the '?'
end = end.substring(1); // remove the '&'
}
ret = ret.substring(0, pos - 1) + end;
}
return ret;
},
/**
* Get the config value corresponding to the specified name. If no name is given, will return the config object
* @param {String} name The config property name
* @return {Object}
*/
getConfig: function (name) {
return name ? Boot.config[name] : Boot.config;
},
/**
* Set the configuration.
* @param {Object} config The config object to override the default values.
* @return {Ext.Boot} this
*/
setConfig: function (name, value) {
if (typeof name === 'string') {
Boot.config[name] = value;
} else {
for (var s in name) {
Boot.setConfig(s, name[s]);
}
}
return Boot;
},
getHead: function () {
return Boot.docHead ||
(Boot.docHead = doc.head ||
doc.getElementsByTagName('head')[0]);
},
create: function (url, key, cfg) {
var config = cfg || {};
config.url = url;
config.key = key;
return Boot.scripts[key] = new Entry(config);
},
getEntry: function (url, cfg, canonicalPath) {
var key, entry;
// Canonicalizing URLs via anchor element href yields the most correct result
// but is *extremely* resource heavy so we need to avoid it whenever possible
key = canonicalPath ? url : Boot.canonicalUrl(url);
entry = Boot.scripts[key];
if (!entry) {
entry = Boot.create(url, key, cfg);
if (canonicalPath) {
entry.canonicalPath = true;
}
}
return entry;
},
registerContent: function (url, type, content) {
var cfg = {
content: content,
loaded: true,
css: type === 'css'
};
return Boot.getEntry(url, cfg);
},
processRequest: function(request, sync) {
request.loadEntries(sync);
},
load: function (request) {
//<debug>
// _debug("Boot.load called");
//</debug>
var request = new Request(request);
if (request.sync || Boot.syncMode) {
return Boot.loadSync(request);
}
// If there is a request in progress, we must
// queue this new request to be fired when the current request completes.
if (Boot.currentRequest) {
//<debug>
// _debug("current active request, suspending this request");
//</debug>
// trigger assignment of entries now to ensure that overlapping
// entries with currently running requests will synchronize state
// with this pending one as they complete
request.getEntries();
Boot.suspendedQueue.push(request);
} else {
Boot.currentRequest = request;
Boot.processRequest(request, false);
}
return Boot;
},
loadSync: function (request) {
//<debug>
// _debug("Boot.loadSync called");
//</debug>
var request = new Request(request);
Boot.syncMode++;
Boot.processRequest(request, true);
Boot.syncMode--;
return Boot;
},
loadBasePrefix: function(request) {
request = new Request(request);
request.prependBaseUrl = true;
return Boot.load(request);
},
loadSyncBasePrefix: function(request) {
request = new Request(request);
request.prependBaseUrl = true;
return Boot.loadSync(request);
},
requestComplete: function(request) {
var next;
if (Boot.currentRequest === request) {
Boot.currentRequest = null;
while(Boot.suspendedQueue.length > 0) {
next = Boot.suspendedQueue.shift();
if(!next.done) {
//<debug>
// _debug("resuming suspended request");
//</debug>
Boot.load(next);
break;
}
}
}
if (!Boot.currentRequest && Boot.suspendedQueue.length == 0) {
Boot.fireListeners();
}
},
isLoading: function () {
return !Boot.currentRequest && Boot.suspendedQueue.length == 0;
},
fireListeners: function () {
var listener;
while (Boot.isLoading() && (listener = Boot.listeners.shift())) {
listener();
}
},
onBootReady: function (listener) {
if (!Boot.isLoading()) {
listener();
} else {
Boot.listeners.push(listener);
}
},
/**
* this is a helper function used by Ext.Loader to flush out
* 'uses' arrays for classes in some Ext versions
*/
getPathsFromIndexes: function (indexMap, loadOrder) {
// In older versions indexMap was an object instead of a sparse array
if (!('length' in indexMap)) {
var indexArray = [],
index;
for (index in indexMap) {
if (!isNaN(+index)) {
indexArray[+index] = indexMap[index];
}
}
indexMap = indexArray;
}
return Request.prototype.getPathsFromIndexes(indexMap, loadOrder);
},
createLoadOrderMap: function(loadOrder) {
return Request.prototype.createLoadOrderMap(loadOrder);
},
fetch: function(url, complete, scope, async) {
async = (async === undefined) ? !!complete : async;
var xhr = new XMLHttpRequest(),
result, status, content, exception = false,
readyStateChange = function () {
if (xhr && xhr.readyState == 4) {
status = (xhr.status === 1223) ? 204 :
(xhr.status === 0 && ((self.location || {}).protocol === 'file:' ||
(self.location || {}).protocol === 'ionp:')) ? 200 : xhr.status;
content = xhr.responseText;
result = {
content: content,
status: status,
exception: exception
};
if (complete) {
complete.call(scope, result);
}
xhr.onreadystatechange = emptyFn;
xhr = null;
}
};
if (async) {
xhr.onreadystatechange = readyStateChange;
}
try {
//<debug>
// _debug("fetching " + url + " " + (async ? "async" : "sync"));
//</debug>
xhr.open('GET', url, async);
xhr.send(null);
} catch (err) {
exception = err;
readyStateChange();
return result;
}
if (!async) {
readyStateChange();
}
return result;
},
notifyAll: function(entry) {
entry.notifyRequests();
}
};
function Request(cfg) {
//The request class encapsulates a series of Entry objects
//and provides notification around the completion of all Entries
//in this request.
if(cfg.$isRequest) {
return cfg;
}
var cfg = cfg.url ? cfg : {url: cfg},
url = cfg.url,
urls = url.charAt ? [ url ] : url,
charset = cfg.charset || Boot.config.charset;
_apply(this, cfg);
delete this.url;
this.urls = urls;
this.charset = charset;
};
Request.prototype = {
$isRequest: true,
createLoadOrderMap: function (loadOrder) {
var len = loadOrder.length,
loadOrderMap = {},
i, element;
for (i = 0; i < len; i++) {
element = loadOrder[i];
loadOrderMap[element.path] = element;
}
return loadOrderMap;
},
getLoadIndexes: function (item, indexMap, loadOrder, includeUses, skipLoaded) {
var resolved = [],
queue = [item],
itemIndex = item.idx,
queue, entry, dependencies, depIndex, i, len;
if (indexMap[itemIndex]) {
// prevent cycles
return resolved;
}
// Both indexMap and resolved are sparse arrays keyed by indexes.
// This gives us a naturally sorted sequence of indexes later on
// when we need to convert them to paths.
// indexMap is the map of all indexes we have visited at least once
// per the current expandUrls() invocation, and resolved is the map
// of all dependencies for the current item that are not included
// in indexMap.
indexMap[itemIndex] = resolved[itemIndex] = true;
while (item = queue.shift()) {
// Canonicalizing URLs is expensive, we try to avoid it
if (item.canonicalPath) {
entry = Boot.getEntry(item.path, null, true);
}
else {
entry = Boot.getEntry(this.prepareUrl(item.path));
}
if (!(skipLoaded && entry.done)) {
if (includeUses && item.uses && item.uses.length) {
dependencies = item.requires.concat(item.uses);
}
else {
dependencies = item.requires;
}
for (i = 0, len = dependencies.length; i < len; i++) {
depIndex = dependencies[i];
if (!indexMap[depIndex]) {
indexMap[depIndex] = resolved[depIndex] = true;
queue.push(loadOrder[depIndex]);
}
}
}
}
return resolved;
},
getPathsFromIndexes: function (indexes, loadOrder) {
var paths = [],
index, len;
// indexes is a sparse array with values being true for defined indexes
for (index = 0, len = indexes.length; index < len; index++) {
if (indexes[index]) {
paths.push(loadOrder[index].path);
}
}
return paths;
},
expandUrl: function (url, loadOrder, loadOrderMap, indexMap, includeUses, skipLoaded) {
var item, resolved;
if (loadOrder) {
item = loadOrderMap[url];
if (item) {
resolved = this.getLoadIndexes(item, indexMap, loadOrder, includeUses, skipLoaded);
if (resolved.length) {
return this.getPathsFromIndexes(resolved, loadOrder);
}
}
}
return [url];
},
expandUrls: function (urls, includeUses) {
var me = this,
loadOrder = me.loadOrder,
expanded = [],
expandMap = {},
indexMap = [],
loadOrderMap, tmpExpanded, i, len, t, tlen, tUrl;
if (typeof urls === "string") {
urls = [urls];
}
if (loadOrder) {
loadOrderMap = me.loadOrderMap;
if (!loadOrderMap) {
loadOrderMap = me.loadOrderMap = me.createLoadOrderMap(loadOrder);
}
}
for (i = 0, len = urls.length; i < len; i++) {
// We don't want to skip loaded entries (last argument === false).
// There are some overrides that get loaded before their respective classes,
// and when the class dependencies are processed we don't want to skip over
// the overrides' dependencies just because they were loaded first.
tmpExpanded = this.expandUrl(urls[i], loadOrder, loadOrderMap, indexMap, includeUses, false);
for (t = 0, tlen = tmpExpanded.length; t < tlen; t++) {
tUrl = tmpExpanded[t];
if (!expandMap[tUrl]) {
expandMap[tUrl] = true;
expanded.push(tUrl);
}
}
}
if (expanded.length === 0) {
expanded = urls;
}
return expanded;
},
expandLoadOrder: function () {
var me = this,
urls = me.urls,
expanded;
if (!me.expanded) {
expanded = this.expandUrls(urls, true);
me.expanded = true;
} else {
expanded = urls;
}
me.urls = expanded;
// if we added some urls to the request to honor the indicated
// load order, the request needs to be sequential
if (urls.length != expanded.length) {
me.sequential = true;
}
return me;
},
getUrls: function () {
this.expandLoadOrder();
return this.urls;
},
prepareUrl: function(url) {
if(this.prependBaseUrl) {
return Boot.baseUrl + url;
}
return url;
},
getEntries: function () {
var me = this,
entries = me.entries,
loadOrderMap, item, i, entry, urls, url;
if (!entries) {
entries = [];
urls = me.getUrls();
// If we have loadOrder array then the map will be expanded by now
if (me.loadOrder) {
loadOrderMap = me.loadOrderMap;
}
for (i = 0; i < urls.length; i++) {
url = me.prepareUrl(urls[i]);
if (loadOrderMap) {
item = loadOrderMap[url];
}
entry = Boot.getEntry(url, {
buster: me.buster,
charset: me.charset
}, item && item.canonicalPath);
entry.requests.push(me);
entries.push(entry);
}
me.entries = entries;
}
return entries;
},
loadEntries: function(sync) {
var me = this,
entries = me.getEntries(),
len = entries.length,
start = me.loadStart || 0,
continueLoad, entries, entry, i;
if(sync !== undefined) {
me.sync = sync;
}
me.loaded = me.loaded || 0;
me.loading = me.loading || len;
for(i = start; i < len; i++) {
entry = entries[i];
if(!entry.loaded) {
continueLoad = entries[i].load(me.sync);
} else {
continueLoad = true;
}
if(!continueLoad) {
me.loadStart = i;
entry.onDone(function(){
me.loadEntries(sync);
});
break;
}
}
me.processLoadedEntries();
},
processLoadedEntries: function () {
var me = this,
entries = me.getEntries(),
len = entries.length,
start = me.startIndex || 0,
i, entry;
if (!me.done) {
for (i = start; i < len; i++) {
entry = entries[i];
if (!entry.loaded) {
me.startIndex = i;
return;
}
if (!entry.evaluated) {
entry.evaluate();
}
if (entry.error) {
me.error = true;
}
}
me.notify();
}
},
notify: function () {
var me = this;
if (!me.done) {
var error = me.error,
fn = me[error ? 'failure' : 'success'],
delay = ('delay' in me)
? me.delay
: (error ? 1 : Boot.config.chainDelay),
scope = me.scope || me;
me.done = true;
if (fn) {
if (delay === 0 || delay > 0) {
// Free the stack (and defer the next script)
setTimeout(function () {
fn.call(scope, me);
}, delay);
} else {
fn.call(scope, me);
}
}
me.fireListeners();
Boot.requestComplete(me);
}
},
onDone: function(listener) {
var me = this,
listeners = me.listeners || (me.listeners = []);
if(me.done) {
listener(me);
} else {
listeners.push(listener);
}
},
fireListeners: function() {
var listeners = this.listeners,
listener;
if(listeners) {
//<debug>
// _debug("firing request listeners");
//</debug>
while((listener = listeners.shift())) {
listener(this);
}
}
}
};
function Entry(cfg) {
//The Entry class is a token to manage the load and evaluation
//state of a particular url. It is used to notify all Requests
//interested in this url that the content is available.
if(cfg.$isEntry) {
return cfg;
}
//<debug>
// _debug("creating entry for " + cfg.url);
//</debug>
var charset = cfg.charset || Boot.config.charset,
manifest = Ext.manifest,
loader = manifest && manifest.loader,
cache = (cfg.cache !== undefined) ? cfg.cache : (loader && loader.cache),
buster, busterParam;
if (Boot.config.disableCaching) {
if (cache === undefined) {
cache = !Boot.config.disableCaching;
}
if (cache === false) {
buster = +new Date();
} else if (cache !== true) {
buster = cache;
}
if (buster) {
busterParam = (loader && loader.cacheParam) || Boot.config.disableCachingParam;
buster = busterParam + "=" + buster;
}
}
_apply(this, cfg);
this.charset = charset;
this.buster = buster;
this.requests = [];
};
Entry.prototype = {
$isEntry: true,
done: false,
evaluated: false,
loaded: false,
isCrossDomain: function() {
var me = this;
if(me.crossDomain === undefined) {
//<debug>
// _debug("checking " + me.getLoadUrl() + " for prefix " + Boot.origin);
//</debug>
me.crossDomain = (me.getLoadUrl().indexOf(Boot.origin) !== 0);
}
return me.crossDomain;
},
isCss: function () {
var me = this;
if (me.css === undefined) {
if (me.url) {
var assetConfig = Boot.assetConfig[me.url];
me.css = assetConfig ? assetConfig.type === "css" : cssRe.test(me.url);
} else {
me.css = false;
}
}
return this.css;
},
getElement: function (tag) {
var me = this,
el = me.el;
if (!el) {
//<debug>
// _debug("creating element for " + me.url);
//</debug>
if (me.isCss()) {
tag = tag || "link";
el = doc.createElement(tag);
if(tag == "link") {
el.rel = 'stylesheet';
me.prop = 'href';
} else {
me.prop="textContent";
}
el.type = "text/css";
} else {
tag = tag || "script";
el = doc.createElement(tag);
el.type = 'text/javascript';
me.prop = 'src';
if (me.charset) {
el.charset = me.charset;
}
if (Boot.hasAsync) {
el.async = false;
}
}
me.el = el;
}
return el;
},
getLoadUrl: function () {
var me = this,
url;
url = me.canonicalPath ? me.url : Boot.canonicalUrl(me.url);
if (!me.loadUrl) {
me.loadUrl = !!me.buster
? (url + (url.indexOf('?') === -1 ? '?' : '&') + me.buster)
: url;
}
return me.loadUrl;
},
fetch: function (req) {
var url = this.getLoadUrl(),
async = !!req.async,
complete = req.complete;
Boot.fetch(url, complete, this, async);
},
onContentLoaded: function (response) {
var me = this,
status = response.status,
content = response.content,
exception = response.exception,
url = this.getLoadUrl();
me.loaded = true;
if ((exception || status === 0) && !_environment.phantom) {
me.error =
//<debug>
("Failed loading synchronously via XHR: '" + url +
"'. It's likely that the file is either being loaded from a " +
"different domain or from the local file system where cross " +
"origin requests are not allowed for security reasons. Try " +
"asynchronous loading instead.") ||
//</debug>
true;
me.evaluated = true;
}
else if ((status >= 200 && status < 300) || status === 304
|| _environment.phantom
|| (status === 0 && content.length > 0)
) {
me.content = content;
}
else {
me.error =
//<debug>
("Failed loading synchronously via XHR: '" + url +
"'. Please verify that the file exists. XHR status code: " +
status) ||
//</debug>
true;
me.evaluated = true;
}
},
createLoadElement: function(callback) {
var me = this,
el = me.getElement();
me.preserve = true;
el.onerror = function() {
me.error = true;
if (callback) {
callback();
callback = null;
}
};
if (Boot.isIE10m) {
el.onreadystatechange = function() {
if (this.readyState === 'loaded' || this.readyState === 'complete') {
if (callback) {
callback();
callback = this.onreadystatechange = this.onerror = null;
}
}
};
}
else {
el.onload = function() {
callback();
callback = this.onload = this.onerror = null;
};
}
// IE starts loading here
el[me.prop] = me.getLoadUrl();
},
onLoadElementReady: function() {
Boot.getHead().appendChild(this.getElement());
this.evaluated = true;
},
inject: function (content, asset) {
//<debug>
// _debug("injecting content for " + this.url);
//</debug>
var me = this,
head = Boot.getHead(),
url = me.url,
key = me.key,
base, el, ieMode, basePath;
if (me.isCss()) {
me.preserve = true;
basePath = key.substring(0, key.lastIndexOf("/") + 1);
base = doc.createElement('base');
base.href = basePath;
if(head.firstChild) {
head.insertBefore(base, head.firstChild);
} else {
head.appendChild(base);
}
// reset the href attribute to cuase IE to pick up the change
base.href = base.href;
if (url) {
content += "\n/*# sourceURL=" + key + " */";
}
// create element after setting base
el = me.getElement("style");
ieMode = ('styleSheet' in el);
head.appendChild(base);
if(ieMode) {
head.appendChild(el);
el.styleSheet.cssText = content;
} else {
el.textContent = content;
head.appendChild(el);
}
head.removeChild(base);
} else {
// Debugger friendly, file names are still shown even though they're
// eval'ed code. Breakpoints work on both Firebug and Chrome's Web
// Inspector.
if (url) {
content += "\n//# sourceURL=" + key;
}
Ext.globalEval(content);
}
return me;
},
loadCrossDomain: function() {
var me = this,
complete = function(){
me.el.onerror = me.el.onload = emptyFn;
me.el = null;
me.loaded = me.evaluated = me.done = true;
me.notifyRequests();
};
me.createLoadElement(function(){
complete();
});
me.evaluateLoadElement();
// at this point, we need sequential evaluation,
// which means we can't advance the load until
// this entry has fully completed
return false;
},
loadElement: function() {
var me = this,
complete = function(){
me.el.onerror = me.el.onload = emptyFn;
me.el = null;
me.loaded = me.evaluated = me.done = true;
me.notifyRequests();
};
me.createLoadElement(function(){
complete();
});
me.evaluateLoadElement();
return true;
},
loadSync: function() {
var me = this;
me.fetch({
async: false,
complete: function (response) {
me.onContentLoaded(response);
}
});
me.evaluate();
me.notifyRequests();
},
load: function (sync) {
var me = this;
if (!me.loaded) {
if(me.loading) {
// if we're calling back through load and we're loading but haven't
// yet loaded, then we should be in a sequential, cross domain
// load scenario which means we can't continue the load on the
// request until this entry has fully evaluated, which will mean
// loaded = evaluated = done = true in one step. For css files, this
// will happen immediately upon <link> element creation / insertion,
// but <script> elements will set this upon load notification
return false;
}
me.loading = true;
// for async modes, we have some options
if (!sync) {
// if cross domain, just inject the script tag and let the onload
// events drive the progression.
// IE10 also needs sequential loading because of a bug that makes it
// fire readystate event prematurely:
// https://connect.microsoft.com/IE/feedback/details/729164/ie10-dynamic-script-element-fires-loaded-readystate-prematurely
if (Boot.isIE10 || me.isCrossDomain()) {
return me.loadCrossDomain();
}
// for IE, use the readyStateChange allows us to load scripts in parallel
// but serialize the evaluation by appending the script node to the
// document
else if(!me.isCss() && Boot.hasReadyState) {
me.createLoadElement(function () {
me.loaded = true;
me.notifyRequests();
});
}
else if(Boot.useElements &&
// older webkit, phantomjs included, won't fire load for link elements
!(me.isCss() && _environment.phantom)) {
return me.loadElement();
}
// for other browsers, just ajax the content down in parallel, and use
// globalEval to serialize evaluation
else {
me.fetch({
async: !sync,
complete: function (response) {
me.onContentLoaded(response);
me.notifyRequests();
}
});
}
}
// for sync mode in js, global eval FTW. IE won't honor the comment
// paths in the debugger, so eventually we need a sync mode for IE that
// uses the readyStateChange mechanism
else {
me.loadSync();
}
}
// signal that the load process can continue
return true;
},
evaluateContent: function () {
this.inject(this.content);
this.content = null;
},
evaluateLoadElement: function() {
Boot.getHead().appendChild(this.getElement());
},
evaluate: function () {
var me = this;
if(!me.evaluated) {
if(me.evaluating) {
return;
}
me.evaluating = true;
if(me.content !== undefined) {
me.evaluateContent();
} else if(!me.error) {
me.evaluateLoadElement();
}
me.evaluated = me.done = true;
me.cleanup();
}
},
cleanup: function () {
var me = this,
el = me.el,
prop;
if (!el) {
return;
}
if (!me.preserve) {
me.el = null;
el.parentNode.removeChild(el); // Remove, since its useless now
for (prop in el) {
try {
if (prop !== me.prop) {
// If we set the src property to null IE
// will try and request a script at './null'
el[prop] = null;
}
delete el[prop]; // and prepare for GC
} catch (cleanEx) {
//ignore
}
}
}
// Setting to null can cause exceptions if IE ever needs to call these
// again (like onreadystatechange). This emptyFn has nothing locked in
// closure scope so it is about as safe as null for memory leaks.
el.onload = el.onerror = el.onreadystatechange = emptyFn;
},
notifyRequests: function () {
var requests = this.requests,
len = requests.length,
i, request;
for (i = 0; i < len; i++) {
request = requests[i];
request.processLoadedEntries();
}
if(this.done) {
this.fireListeners();
}
},
onDone: function(listener) {
var me = this,
listeners = me.listeners || (me.listeners = []);
if(me.done) {
listener(me);
} else {
listeners.push(listener);
}
},
fireListeners: function() {
var listeners = this.listeners,
listener;
if(listeners && listeners.length > 0) {
//<debug>
// _debug("firing event listeners for url " + this.url);
//</debug>
while((listener = listeners.shift())) {
listener(this);
}
}
}
};
/**
* Turns on or off the "cache buster" applied to dynamically loaded scripts. Normally
* dynamically loaded scripts have an extra query parameter appended to avoid stale
* cached scripts. This method can be used to disable this mechanism, and is primarily
* useful for testing. This is done using a cookie.
* @param {Boolean} disable True to disable the cache buster.
* @param {String} [path="/"] An optional path to scope the cookie.
*/
Ext.disableCacheBuster = function (disable, path) {
var date = new Date();
date.setTime(date.getTime() + (disable ? 10 * 365 : -1) * 24 * 60 * 60 * 1000);
date = date.toGMTString();
doc.cookie = 'ext-cache=1; expires=' + date + '; path=' + (path || '/');
};
//<if nonBrowser>
if (_environment.node) {
Boot.prototype.load = Boot.prototype.loadSync = function (request) {
// @TODO
require(filePath);
onLoad.call(scope);
};
Boot.prototype.init = emptyFn;
}
//</if>
Boot.init();
return Boot;
// NOTE: We run the eval at global scope to protect the body of the function and allow
// compressors to still process it.
}(function () {
}));//(eval("/*@cc_on!@*/!1"));
/**
* This method evaluates the given code free of any local variable. This
* will be at global scope, in others it will be in a function.
* @param {String} code The code to evaluate.
* @private
* @method
* @member Ext
*/
Ext.globalEval = Ext.globalEval || (this.execScript
? function (code) { execScript(code); }
: function ($$code) { eval.call(window, $$code); });
//<feature legacyBrowser>
/*
* Only IE8 & IE/Quirks lack Function.prototype.bind so we polyfill that here.
*/
if (!Function.prototype.bind) {
(function () {
var slice = Array.prototype.slice,
// To reduce overhead on call of the bound fn we have two flavors based on
// whether we have args to prepend or not:
bind = function (me) {
var args = slice.call(arguments, 1),
method = this;
if (args.length) {
return function () {
var t = arguments;
// avoid the slice/concat if the caller does not supply args
return method.apply(me, t.length ? args.concat(slice.call(t)) : args);
};
}
// this is the majority use case - just fn.bind(this) and no args
args = null;
return function () {
return method.apply(me, arguments);
};
};
Function.prototype.bind = bind;
bind.$extjs = true; // to detect this polyfill if one want to improve it
}());
}
//</feature>
//</editor-fold>
Ext.setResourcePath = function (poolName, path) {
var manifest = Ext.manifest || (Ext.manifest = {}),
paths = manifest.resources || (manifest.resources = {});
if (manifest) {
if (typeof poolName !== 'string') {
Ext.apply(paths, poolName);
} else {
paths[poolName] = path;
}
manifest.resources = paths;
}
};
Ext.getResourcePath = function (path, poolName, packageName) {
if (typeof path !== 'string') {
poolName = path.pool;
packageName = path.packageName;
path = path.path;
}
var manifest = Ext.manifest,
paths = manifest && manifest.resources,
poolPath = paths[poolName],
output = [];
if (poolPath == null) {
poolPath = paths.path;
if (poolPath == null) {
poolPath = 'resources';
}
}
if (poolPath) {
output.push(poolPath);
}
if (packageName) {
output.push(packageName);
}
output.push(path);
return output.join('/');
};
|
{
"pile_set_name": "Github"
}
|
Reduced frequency of wheezing respiratory illness in infants with perinatal human immunodeficiency virus-type 1 infection: a model for immunologic and inflammatory mechanisms of airway obstruction?
A multivariate analysis using a logistic regression model evaluated odds ratio (OR) and 95% confidence limits (95% CL) of pediatrician-diagnosed wheezing respiratory illness in 75 infants with perinatal human immunodeficiency virus-type 1 (HIV-1) infection, 205 uninfected infants of HIV-1 infected mothers, and 1780 infants of HIV-1 uninfected mothers. Infants were prospectively followed-up for the first 2 years of life. Covariates were risk factors for wheezing respiratory illness (preterm delivery, low birth weight, maternal smoking, formula feeding, and neonatal respiratory disorders). Maternal use of illicit drugs in pregnancy, antiretroviral treatment in pregnancy, maternal HIV-1-related clinical condition at the time of delivery were also included in the models when infants of HIV-1 infected mothers were taken into account. Although the frequency of risk factors for wheezing respiratory illness was higher in infants of HIV-1 infected than in those of uninfected mothers, HIV-1 infection emerged as a protective factor [OR: 0.001 (95% CL: 0.0001-0.01); p < 0.001]. The frequency of risk factors was similarly high among infants of infected mothers, but OR was lower in HIV-1 infected than in uninfected infants of infected mothers (0.005; 95% CL: 0.0004-0.06; p < 0.001). Finally, OR was higher in uninfected infants of HIV-1 infected mothers (who evidenced a higher frequency of risk factors) than in infants of HIV-1 uninfected mothers (9.97; 95% CL: 4.87-20.40; p < 0.001). Understanding the reason why HIV-1 protects against wheezing respiratory illness could shed light on the immunologic and inflammatory mechanisms of airway obstruction.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
Jenny Badeau Fuck Stick Antics
Jenny is saying us about getting caught draining then humping the manager. All this messy converse turns her and its not lengthy before she has her melons out to gargle and grease up. Then she gets out a fuck stick and fucks her appetizing vag
|
{
"pile_set_name": "Pile-CC"
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.