text stringlengths 12 4.76M | timestamp stringlengths 26 26 | url stringlengths 32 32 |
|---|---|---|
Q:
SQL count and group only returns first row for each group
My table:
+----------+---------------------+
| bonus_id | created |
+----------+---------------------+
| 11 | 2020-04-28 19:50:13 |
| 12 | 2020-04-29 00:00:00 |
| 13 | 2020-04-30 19:55:58 |
| 14 | 2020-04-29 19:56:07 |
| 15 | 2020-04-30 19:56:18 |
| 16 | 2020-04-29 20:16:21 |
+----------+---------------------+
This is what I'm trying to get
2020-04-30 - Count: 2
13
15
2020-04-29 - Count: 3
12
14
16
2020-04-28 - Count: 1
11
This is what I'm getting:
2020-04-30 - Count: 2
13
2020-04-29 - Count: 3
12
2020-04-28 - Count: 1
11
My code:
SELECT DATE(created) as created, COUNT(*) as count, bonus_id FROM test WHERE account_id=? AND user_id=? GROUP BY DATE(created) DESC
I'm getting the correct order with all the outpounts when i use ORDER BY and not GROUP/COUNT, but then I'm not getting the count. Don't understand why I'm only getting the first row for each date.
A:
If you want to add a column with the count to each row, use window functions:
select t.*, count(*) over (partition by date(created)) as day_cnt
from test t;
If you want an aggregated list, then I'll assume you are using MySQL (an old version) or SQLite because these do not generate a syntax error. In that case, you can use group_concat():
select date(created), count(*), group_concat(bonus_id) as bonus_ids
from test
group by date(created);
| 2023-08-10T01:26:18.401715 | https://example.com/article/7938 |
Functional characterization of P2X3 receptors fused with fluorescent proteins.
P2X receptor function in the CNS is poorly understood, and currently available data are partly inconsistent. In the presented study, we investigated P2X3 receptors stably expressed in HEK293 cells. Non-stationary noise analysis of whole cell currents and rapid ATP application through flash photolysis allowed for assessing the single channel conductance (6.6 pS) and the fast activation kinetics of the receptor (20 ms). The characteristics of channel desensitization and pharmacological properties matched previous findings. The properties of wild type receptors were compared with P2X3 constructs carrying a fluorescent tag (ECFP or DsRed2) at the C-terminus. These fluorescently labeled subunits formed functional receptors, with neither the affinity of the ligand binding site nor channel properties (ion selectivity, gating kinetics, single channel conductance) differing from wild type. We conclude that both fusion proteins tested here are suitable for generating transgenic mice, which can be expected to promote understanding of the physiological role of P2X3 receptors in CNS signaling. | 2024-05-01T01:26:18.401715 | https://example.com/article/6506 |
1. Field of Invention
The present invention relates to projectors capable of displaying images.
2. Description of the Related Art
Currently a projector displays images in such a way that light emitted from an illumination optical system is modulated according to image data (image signals) by liquid crystal light valves, for example, and the modulated light is projected onto a screen. The projector for displaying color images is provided with a colored-light-separating optical system for separating light emitted from the illumination optical system into three colored light and a colored-light-combining optical system for combining three modulated light emitted from respective three liquid crystal light valves. A crossed dichroic prism is used as the colored-light-combining system, the crossed dichroic prism being provided with the two types of selection films formed at a substantially X-shaped interface between four rectangular prisms. The projector can include a plurality of optical parts assembled with each other. The plurality of optical parts are generally mounted onto a common base frame.
With the above described projector, it has been difficult to mount the crossed dichroic prism accurately in a predetermined position of the base frame. Accordingly, the present invention provides a technology for accurately mounting a prism such as a crossed dichroic prism used for a projector to a predetermined position of a base frame, thereby solving the above-described problems found with respect to the conventional technology.
In order to solve at least one part of the above-described problem, a first device according to the present invention, which is a projector for displaying color images, can include an illumination optical system, a colored-light-separating optical system for separating light emitted from the illumination optical system into first, second, and third colored light which are three color components, respectively, first, second, and third electro-optical devices which modulate the first, second, and third colored light, respectively, according to image data, and produce first, second, and third modulated light, respectively, and a colored-light-combining optical system for combining the first, second, and third modulated light. The projector can further include a projection optical system for projecting the combined light emitted from the colored-light-combining optical system, and a base frame for mounting a plurality of optical parts which are disposed in a light path extending from the illumination optical system to the projection optical system. Furthermore, at least one of the colored-light-separating optical system and the colored-light-combining optical system can be provided with a prism that includes a selection film formed therein for selecting light having a predetermined range of wavelengths, and the prism is bonded directly to the base frame.
In the first device, since the prism is directly bonded to the base frame, the prism can be mounted accurately to a predetermined position on the base frame in comparison with a case that the prism is bonded to the base frame with screws. The prism may be a colored-light-combining prism which forms the colored-light-combining optical system. The colored-light-combining prism may comprise, for example, four columnar prisms sectioned by a substantially X-shaped interface and the two types of selection films formed at the substantially X-shaped interface.
In the above device, the colored-light-combining prism is preferably bonded to the base frame with an ultraviolet-curing resin. When an ultraviolet-curing resin is used as described above, the colored-light-combining prism and the base frame can easily be bonded to each other in a relatively short time.
A mark is preferably provided in the vicinity of a substantially square region of the base frame to which the colored-light-combining prism having a substantially cubic shape is bonded, the mark indicating a position of mounting the colored-light-combining prism. The mark may be, for example, a hole or a concavity provided in the center of the substantially square region to which the colored-light-combining prism is bonded. With this arrangement, the colored-light-combining prism can easily be mounted in a predetermined position of the base frame.
In the above device, the base frame preferably comprises a metal material at least in the region to which the colored-light-combining prism is bonded. With this arrangement, temperature rise of the colored-light-combining prism can be suppressed.
In the above device, the first, second, and third electro-optical devices may be three liquid crystal panels, and three liquid crystal light valves which include the three liquid crystal panels, respectively, may be bonded to the colored-light-combining prism. In the above device, the liquid crystal light valves are respectively provided with a polarizing plate disposed at a light-emitting face of the liquid crystal panel and a light transmissive substrate with the polarizing plate bonded thereto and having a heat conductivity of not less than approximately 5 W/mxe2x80xa2K, and each light transmissive substrate is preferably bonded to the colored-light-combining prism. The light transmissive substrate may be made of quartz or sapphire.
When such light transmissive substrates are used, temperature rise due to heat generation in the polarizing plates provided at the light-emitting faces of the liquid crystal panels can be suppressed.
In the above device, the liquid crystal light valves may be respectively provided with a polarizing plate disposed at a light-emitting face of the liquid crystal panel and bonded to the colored-light-combining prism, and the four columnar prisms of the colored-light-combining prism may include a light transmissive material having a heat conductivity of not less than approximately 5 W/mxe2x80xa2K. The light transmissive material may be quartz or sapphire.
When the colored-light-combining prism includes such a light transmissive material, temperature rise due to heat generation in the polarizing plates disposed at the light-emitting faces of the liquid crystal panels can be suppressed. Moreover, there is an advantage that the light transmissive substrates to which the polarizing plates are bonded can be omitted.
The above device may further include three lenses disposed in the vicinities of light-incident faces of the three liquid crystal light valves, respectively. The three lenses may be mounted to a holding frame, which differs from the base frame, and be fixed to the base frame. With this arrangement, the three lenses can easily be mounted to the base frame. For example, when the liquid crystal light valves are bonded to the colored-light-combining prism after the colored-light-combining prism is mounted to the base frame, a workspace for the operation can be ensured.
A second device according to the present invention, which is a projector for displaying color images, can include an illumination optical system, a colored-light-separating optical system for separating light emitted from the illumination optical system into first, second, and third colored light which are three color components, respectively, first, second, and third electro-optical devices which modulate the first, second, and third colored light, respectively, according to image data, and produce first, second, and third modulated light, respectively, and a colored-light-combining optical system for combining the first, second, and third modulated light. The projector that displays color images can further include a projection optical system for projecting the combined light emitted from the colored-light-combining optical system, and a base frame for mounting a plurality of optical parts which are disposed in a light path extending from the illumination optical system to the projection optical system. At least one of the colored-light-separating optical system and the colored-light-combining optical system can be provided with a prism which includes a selection film formed therein for selecting light having a predetermined range of wavelengths. Furthermore, a detachable mounting platform for mounting the prism can be fixed to the base frame, and the prism is bonded to the mounting platform fixed to the base frame.
Since the prism is bonded to the mounting platform fixed to the base frame in the second device, the prism can be mounted accurately in a predetermined position of the base frame in the same manner as in the first device.
In the above device, a mark is preferably provided in the vicinity of a substantially square region of the base frame to which the colored-light-combining prism having a substantially cubic shape is bonded, the mark indicating a position of mounting the colored-light-combining prism. The mounting platform is preferably provided with a hole formed therein through which the mark formed on the base frame can be confirmed from the upper side of the mounting platform. With this arrangement, the prism can easily be disposed in a predetermined position of the base frame when the mounting platform is detachable.
A method for fixing a prism, which includes a selection film formed therein for selecting light having a predetermined range of wavelengths and is included in at least one of a colored-light-separating optical system and a colored-light-combining optical system, to a base frame of a projector for displaying color images. The projector can include an illumination optical system, the colored-light separating-optical system for separating light emitted from the illumination optical system into first, second, and third colored light which are three color components, respectively, first, second, and third electro-optical devices which modulate the first, second, and third colored light, respectively, according to image data, and produce first, second, and third modulated light, respectively, the colored-light-combining optical system for combining the first, second, and third modulated light; a projection optical system for projecting the combined light emitted from the colored-light-combining optical system, and the base frame for mounting a plurality of optical parts which are disposed in a light path extending from the illumination optical system to the projection optical system. The method can include the steps of fixing a detachable mounting platform for mounting the prism to the base frame, and bonding the prism to the mounting platform fixed to the base frame.
When the prism is fixed to the base frame in the above-described steps, the prism can easily be disposed in a predetermined position of the base frame when the mounting platform is detachable. | 2024-03-26T01:26:18.401715 | https://example.com/article/7089 |
Q:
Creating bins in presto sql - programmatically
I am new to Presto SQL syntax and and wondering if a function exists that will bin rows into n bins in a certain range.
For example, I have a a table with 1m different integers that range from 1 - 100. What can I do to create 20 bins between 1 and 100 (a bin for 1-5, 6-10, 11-15 ... etc. ) without using 20 separate CASE WHEN statements ? Are there any standard SQL functions that do will perform the binning function?
Any advice would be appreciated!
A:
You can use the standard SQL function width_bucket. For example:
WITH data(value) AS (
SELECT rand(100)+1 FROM UNNEST(sequence(1,10000))
)
SELECT value, width_bucket(value, 1, 101, 20) bucket
FROM data
produces:
value | bucket
-------+--------
100 | 20
98 | 20
38 | 8
42 | 9
67 | 14
74 | 15
6 | 2
...
| 2024-01-28T01:26:18.401715 | https://example.com/article/1983 |
Q:
Is Mrs. Robinson's seduction of Benjamin actually a plan by Mr. & Mrs. Robinson to prevent Benjamin from marrying their daughter?
I am watching The Graduate and am confused why Mrs. Robinson (Anne Bancroft) seduces Benjamin (Dustin Hoffman) for no good reason. Why did Mr. Robinson talk like he wanted his wife to sleep with Benjamin?
Is Mrs. Robinson's seduction of Benjamin actually a plan by the Robinsons so that Benjamin won't marry their daughter?
A:
Mrs. Robinson is the original cougar, so to speak.
She seduces Benjamin simply because she is tired of her marriage and wants a fun sexual encounter. Mr. Robinson was most certainly not aware of this.
From the Wiki:
Mr. Robinson, [once he learns about] his wife's affair with Benjamin,
goes to his apartment in Berkeley and berates him, threatening to have
him prosecuted to the fullest extent of the law, should Benjamin ever
come near Elaine again. In the meantime, Benjamin has tried to tell
Mr. Robinson that his wife has manipulated him into having an affair
with her. But Mr. Robinson is also skeptic and refuses to believe him,
and then he forces Elaine to drop out of school and takes her away to
marry Carl. She leaves Benjamin a note, saying that although she loves
him, her father's anger would prevent the family from ever accepting
him as Elaine's husband.
Mr. Robinson was outraged once he'd learnt of Benjamin's actions, blaming him entirely for it.
Rebecca Neumann in an article on the film gave some explanation as to Mrs. Robinson's actions:
The film places significant emphasis on Mrs. Robinson's past as the
motivation for her actions. As a young woman, an unplanned pregnancy
forced her to give up her dreams, drop-out of college, and marry Mr.
Robinson. Years later, her loveless marriage and empty nest bore and
embitter Mrs. Robinson despite her luxurious life-style.
So no, Mrs. Robinson's seduction of Benjamin was most definitely not a plan to keep he and Benjamin apart. It just ended up looking like that due to Mr. Robinson's reluctance to ever let Benjamin near his family again.
| 2023-12-07T01:26:18.401715 | https://example.com/article/3566 |
<?xml version="1.0"?>
<ZopeData>
<record id="1" aka="AAAAAAAAAAE=">
<pickle>
<global name="Workflow" module="erp5.portal_type"/>
</pickle>
<pickle>
<dictionary>
<item>
<key> <string>_count</string> </key>
<value>
<persistent> <string encoding="base64">AAAAAAAAAAI=</string> </persistent>
</value>
</item>
<item>
<key> <string>_local_properties</string> </key>
<value>
<tuple>
<dictionary>
<item>
<key> <string>id</string> </key>
<value> <string>state_variable_name</string> </value>
</item>
<item>
<key> <string>type</string> </key>
<value> <string>string</string> </value>
</item>
</dictionary>
</tuple>
</value>
</item>
<item>
<key> <string>_mt_index</string> </key>
<value>
<persistent> <string encoding="base64">AAAAAAAAAAM=</string> </persistent>
</value>
</item>
<item>
<key> <string>_tree</string> </key>
<value>
<persistent> <string encoding="base64">AAAAAAAAAAQ=</string> </persistent>
</value>
</item>
<item>
<key> <string>categories</string> </key>
<value>
<tuple>
<string>source/workflow_module/maxma_demo_configuration_workflow/1</string>
</tuple>
</value>
</item>
<item>
<key> <string>configuration_after_script_id</string> </key>
<value> <string>BusinessConfiguration_afterMaxmaDemoConfiguration</string> </value>
</item>
<item>
<key> <string>description</string> </key>
<value> <string>Maxma Demo is a pré-build configuration which the user can experiment the most common modules provided by ERP5.</string> </value>
</item>
<item>
<key> <string>id</string> </key>
<value> <string>maxma_demo_configuration_workflow</string> </value>
</item>
<item>
<key> <string>portal_type</string> </key>
<value> <string>Workflow</string> </value>
</item>
<item>
<key> <string>state_base_category</string> </key>
<value> <string>current_state</string> </value>
</item>
<item>
<key> <string>state_variable_name</string> </key>
<value> <string>current_state</string> </value>
</item>
<item>
<key> <string>title</string> </key>
<value> <string>Maxma Demo Configuration Workflow</string> </value>
</item>
</dictionary>
</pickle>
</record>
<record id="2" aka="AAAAAAAAAAI=">
<pickle>
<global name="Length" module="BTrees.Length"/>
</pickle>
<pickle> <int>0</int> </pickle>
</record>
<record id="3" aka="AAAAAAAAAAM=">
<pickle>
<global name="OOBTree" module="BTrees.OOBTree"/>
</pickle>
<pickle>
<none/>
</pickle>
</record>
<record id="4" aka="AAAAAAAAAAQ=">
<pickle>
<global name="OOBTree" module="BTrees.OOBTree"/>
</pickle>
<pickle>
<none/>
</pickle>
</record>
</ZopeData>
| 2024-04-07T01:26:18.401715 | https://example.com/article/3608 |
Awkward Moment
Really an awkward moment to saw my friend so close but it feels like a high wall that separate us. It’s strange that we met each other but can’t say anything like used to be. I never thought that we can’t share the same atmosphere like before. I could say to the world that we’re friend, and the world can see that we’re friend, but I doubt that we still can share the friendship feeling anymore.
I knew that this awkward moment remind me to change. It’s not the time to always see the backward because I must go forward. It doesn’t matter what’s happened before, the most important is I learned from it and continue my life as well. I should thank you for this friendship and for the memories left behind. You really make it to make me wiser and to make me realize that friendship is so precious. ^^ | 2024-06-21T01:26:18.401715 | https://example.com/article/7793 |
There are 72 points in an inch
Type Size Is Measured From Top Of Ascender To Bottom Of Descender In Points
(Some refer to it as baseline to baseline the same as leading)
Capital Letters Are Usually Approximately 70% Of The Point Size
12pt 18pt 24pt 36ptChip 12 pt
Video monitors:
A a 12 point font uses 16 pixels. Libre office had 4 pixels between lines for 20 pixel leading; the chrome browser had 2 pixels between lines for 18 pixel leading.
A formula for readable line length (or column width) is:
40% of the body copy point size in inches
In CSS a pixel is 1/96 of an inch.
Actual monitors vary See Video Resolution
See also:
Font Size Intervals at CleverChimp.com
Fonts:
A serif font has small projecting features called "serifs" at the end of strokes.
At fonts.com they say,
Serif typefaces have historically been credited with increasing both the readability and reading speed of long passages of text because they help the eye travel across a line.
WritingSpaces.org says,
"Many people feel that sans serif fonts look “cleaner” and more “modern,” while serif fonts look more traditional, more book-like. The conventional wisdom has been that serif fonts are more readable—particularly in print—while sans serif fonts are more legible.
If you have to read large blocks of text, the serifs at the ends of letters makes them easier to identify and easier to read. On the other hand, the simplicity of Sans Serif fonts are thought to make these fonts more legible and easier to read in small sizes or on coarse screens. For these reason, you see lots and lots of sans serif fonts on web pages.
We are not convinced that the serif vs. sans serif argument really matters anymore."
Alex Poole says,
"In 2003 as part of my master’s degree I reviewed over 50 empirical studies in typography and found a definitive answer.
Do serifs contribute to the legibility of typefaces, and by definition, are sans serif typefaces less legible? To date, no one has managed to provide a conclusive answer to this issue.
Legibility is concerned with the very fine details of typeface design, and in an operational context this usually means the ability to recognise individual letters or words. Readability however concerns the optimum arrangement and layout of whole bodies of text:"
Douglas Bonneville says at Smashing Magazine,
"By far the most popular principle for creating typeface combinations is to pair a sans serif header typeface with a serif body typeface."
However, I've seen brochures with the opposite. San-serif headers with Serif text.
fonts.com says,
Serifs can impede the readability of characters at very small sizes."
Web Pages:Michael Martin's article at Smashing Magazine says,
According to our study, sans-serif fonts are still more popular than serif fonts for headlines, although they seem to have dropped in popularity in recent years.
Two thirds of the websites we surveyed used sans-serif fonts for body copy.
The most popular serif typefaces for headlines are Georgia (28%) and Baskerville (4%).
The most popular serif typefaces for body copy are Georgia (32%) and Times New Roman (4%).
The most popular sans-serif typefaces for headlines are Arial (28%), Helvetica (20%) and Verdana (8%).
The most popular sans-serif typefaces for body copy are Arial (28%), Verdana (20%) and Lucida Grande (10%).
Most books and newspapers use serif fonts
Brochures use both although san-serif seems to be more common.
Most web sites use san-serif fonts.
Most plaques use serif fonts.
A scientific study (funded by Microsoft, so take with a grain of salt) touted Verdana's readability, particularly at small sizes. It was one of the first fonts that was designed with readability on the screen particularly in mind, so it has a large x-height (good for seeing the lowercase letters) and is well-hinted. These advantages will become less relevant as pixel density increases, but they're good things to look for in a screen font for now.
Terms:
Typeface - e.g. New Times Roman, Helvetica, Courier, ...
Font - Size (points) and style (Bold, Italic, ...)
Font Family - Same a typeface. The arial family includes "arial bold", "arial italic", ..
Generic Families - A class as in CSS serif, sans-serif, monospace.
Glyph - An elemental symbol as part of a character. A diacritic (e.g. cedilla in ç ) is a glyph.
Leading - The distance from one baseline to the next
Pre computer leading was the distance between the descender and ascender
of the next line.
OpenType Font - Newer - Adobe and Micorosof
TrueType Font - Most common - Apple 1980's for Mac and Win
Pica - 12 points
Legibility is concerned with the very fine details of typeface design,
and in an operational context this usually means the ability to recognise individual letters or words.
Readability however concerns the optimum arrangement and layout of whole bodies of text:"
em - A unit equal to the currently specified point size | 2023-12-20T01:26:18.401715 | https://example.com/article/3038 |
George Lyttelton, 1st Baron Lyttelton
George Lyttelton, 1st Baron Lyttelton, (17 January 1709 – 22 August 1773), known between 1751 and 1756 as Sir George Lyttelton, 5th Baronet, was a British statesman. As an author himself, he was also the supporter of other writers and as a patron of the arts made an important contribution to the development of 18th century landscape design.
Life
Lord Lyttelton was the eldest son of Sir Thomas Lyttelton, 4th Baronet, of Frankley, in the County of Worcester, by his wife Christian, daughter of Sir Richard Temple, 3rd Baronet. Educated at Eton and Christ Church, Oxford, he afterwards went on grand tour, visiting Europe with his tutor. It was during this time that he started publishing his early works in both poetry and prose. Even after he was elected to Parliament in 1735, he continued to publish from time to time. In 1742 he married Lucy, daughter of Hugh Fortescue, and following her death in 1747 he later married Elizabeth, daughter of Field Marshal Sir Robert Rich, 4th Baronet, in 1749. He died in August 1773, aged 64, and was succeeded as baron by his eldest son, Thomas. Though Samuel Johnson’s biographical notice of Lyttelton is characterised by a conspicuous show of dislike, it diverges at the end into a long description of his exemplary death and the plain inscription he asked to have added to his first wife’s monument in St John the Baptist Church, Hagley.
Political career
Lyttelton was Member of Parliament (MP) for Okehampton from 1735 to 1756 and, as one of Cobham's Cubs during the 1730s, opposed the Prime Minister Robert Walpole. He served as secretary to Frederick, Prince of Wales from 1737, and then, after Walpole's fall, as a Commissioner of the Treasury in 1744. That year too he was elected a Fellow of the Royal Society. Lyttelton was made a Privy Councillor in 1754 and in the following year became briefly Chancellor of the Exchequer, but performed poorly in that role. In 1756 he was raised to the peerage as Lord Lyttelton, Baron of Frankley in the County of Worcester, and continued to speak in the House of Lords until the year before he died.
Lyttelton was later described as “an amiable, absent-minded man, of unimpeachable integrity and benevolent character, with strong religious convictions and respectable talents,” but ultimately as “a poor practical politician”. His political opponent Lord Hervey spitefully characterised his performance as a speaker as “a great flow of words that were always uttered in a lulling monotony, and the little meaning they had to boast of was generally borrowed from the commonplace maxims and sentiments of moralists, philosophers, patriots, and poets, crudely imbibed, half digested, ill put together, and confusedly refunded.”
Poetry and patronage
Lord Lyttelton was a friend and supporter of Alexander Pope in the 1730s and of Henry Fielding in the 1750s; the latter dedicated his novel Tom Jones to Lyttelton. He had written his “Epistle to Mr. Pope, from a young gentleman at Rome” while still on European tour, advising him to abandon satire for a patriotic theme more worthy of his greatness. Later on the poem was used to preface editions of Pope's work.
Throughout his life he acted as a friendly patron of poets. James Thomson, for whom Lyttelton eventually arranged a pension, was a frequent visitor to Hagley Hall. Joseph Warton he appointed his domestic chaplain and it was at his suggestion that David Mallet was made undersecretary to the Prince of Wales.
Lyttelton's own poetic reputation was guaranteed continuity by his work being included in the collection of English poets prefaced by Johnson's Lives. Variously annotated and augmented, the collection appeared in succeeding editions into the start of the 19th century. The monody “To the Memory of a Lady lately Deceased”, written on the death of his first wife, had an even longer lasting reputation. Though Thomas Gray found “parts of it too stiff and poetical”, he especially praised the fourth stanza as “truly tender and elegiac”. The poem was alluded to or parodied by others well into the 19th century, particularly the invocation of the “shades of Hagley” in the fifth stanza. Anna Seward, in answer to a correspondent who preferred Lyttelton's ode to the newly fashionable sonnet, ingeniously rearranged the lines of the poem into a series of sonnets, in which the "shades of Hagley" passage headed the second. And William Gladstone acknowledged that his Church Principles was “completed beneath the shades of Hagley” as late as 1840.
Despite his long political career, it was as a poet that Lyttelton was chiefly remembered in the 19th century. But he was author also of many works in prose, chiefly historical and theological. Two, however, are distinguished by their humour. Letters from a Persian in England, to his Friend at Ispahan (1735) ironically comments on the idiosyncrasies of the time from the naïve point of view of an outsider. On attending a wedding ceremony in “one of their Mosques”, for example, the visitor remarks that “Marriage here is esteemed a Religious Ceremony, and that I believe is one Reason among others why so little Regard is paid to it.” Oliver Goldsmith was later to borrow the same approach for his Chinese philosopher in Letters from a Citizen of the World to his Friends in the East (1760). There were, nevertheless, French models for both in the Lettres Persanes of Montesquieu (1721) and the Lettres Chinoises (1735) of Jean-Baptiste de Boyer, Marquis d'Argens, both of which had been translated soon after into English.
Another work with prior French counterparts was Lyttelton's Dialogues of the Dead (1760). Though these had Classical precedents, the more immediate models were François Fénelon’s Dialogues des morts anciens et modernes and Bernard Le Bovier de Fontenelle's Nouveaux Dialogues des morts, which had also appeared in popular English translations as Dialogues of the Dead. The themes treated in Lyttelton's are political, literary and philosophical, although the characters sometimes stray from their expected role. Joseph Addison and Jonathan Swift’s conversation is of politics, while Charles XII of Sweden proposes to Alexander the Great an alliance against Alexander Pope for insulting them both in a satire. Included among these conversations were three that Lyttleton had encouraged the bluestocking leader Elizabeth Montagu to write (Dialogues 26-8).
All of Lyttelton’s writing was collected shortly after his death by his nephew, G. E. Ayscough. In 1791 an edition of his poems appeared in Germany accompanied by J. G. Weigel’s prose translations. During his lifetime Lyttelton’s Observations on the Conversion and Apostleship of St. Paul was translated into French in 1750 by Jean Deschamps (1707-67) and again in 1754 by the Abbé Antoine Guénée (1717-1803); his Dialogues of the Dead was also translated into French in 1760 as Dialogues des morts by Élie de Joncourt (1697-1765) and Jean Deschamps.
Hagley Hall and grounds
Lyttelton spent many years and a fortune developing Hagley Hall and its park, which contained many follies as well as memorials to the poets Milton, Pope, Thomson and the neighbouring landscaper William Shenstone. Also included among the latter was a ‘druid’s temple’ of standing stones commemorating Ossian that Lyttelton had erected outside his grounds on nearby Clent Hill. The hall itself was designed by Sanderson Miller and is the last of the great Neo-Palladian houses to be built in England.
References
Bibliography
Burkes Peerage and Baronetage (1939), s.v. Cobham, Viscount
History of Parliament Online: “LYTTELTON, George (1709-73)”
External links
George Lyttelton at the Eighteenth-Century Poetry Archive (ECPA)
Category:1709 births
Category:1773 deaths
Category:People educated at Eton College
Category:Alumni of Christ Church, Oxford
Category:Barons in the Peerage of Great Britain
Category:Peers of Great Britain created by George II
Category:Lyttelton family
Category:Chancellors of the Exchequer of Great Britain
Category:Members of the Parliament of Great Britain for English constituencies
Category:Tory MPs (pre-1834)
Category:British MPs 1734–1741
Category:British MPs 1741–1747
Category:British MPs 1747–1754
Category:British MPs 1754–1761
Category:Members of the Privy Council of Great Britain
Category:English male poets
Category:Patrons of literature
Category:Fellows of the Royal Society
Category:MPs for rotten boroughs
Category:18th-century philanthropists | 2023-08-02T01:26:18.401715 | https://example.com/article/4143 |
Fluorescent property of glycol chitosan-fluorescein isothiocyanate conjugate for bio-imaging material.
Bio-imaging is an effective method for visualizing the biological responses and pharmacological responses in living organisms. In general, bio-imaging materials stain the cell membrane through electrostatic interaction and hydrogen bonding. However, the current commercial bio-imaging materials have several disadvantages, such as weak intensity, poor resolution, and high price. In this study, a novel bio-imaging material with high fluorescent intensity and water solubility was prepared using glycol chitosan. The chemical reaction between the amino group of glycol chitosan (GC) and the isothiocyanate group of fluorescein isothiocyanate (FITC) was monitored in order to synthesize glycol chitosan-fluorescein isothiocyanate (GC-FITC) conjugate. Then, the applicability of GC-FITC as a bio-imaging candidate was examined by comparing the fluorescence intensity of GC-FITC with that of commercial bio-imaging materials (dextran-FITC and BSA-FITC). | 2024-03-14T01:26:18.401715 | https://example.com/article/9078 |
AC-20 Motor Kit
Sale
Regular price
$2,655.95
Controller
Quantity
The AC 20 motor is 1 1/2" longer derivative of the AC 9/AC 15 motors. This motor produces 65 horsepower out to 5100 RPM and 82 ft./lbs. of torque at 96 volts/650 amps. This motor style is another very popular choice for motorcycles. | 2024-06-20T01:26:18.401715 | https://example.com/article/4785 |
# coding=utf-8
import logging
import random
import string
import sys
import unittest
from time import time, sleep
import apiritif
import os
import re
from selenium import webdriver
from selenium.common.exceptions import NoSuchElementException, TimeoutException
from selenium.webdriver.common.by import By
from selenium.webdriver.common.action_chains import ActionChains
from selenium.webdriver.support.ui import Select
from selenium.webdriver.support import expected_conditions as econd
from selenium.webdriver.support.wait import WebDriverWait
from selenium.webdriver.common.keys import Keys
from bzt.resources.selenium_extras import find_element_by_shadow, get_locator
class TestLocSc(unittest.TestCase):
def setUp(self):
self.vars = {'city_select_name': 'fromPort', 'input_name_id': 'inputName'}
timeout = 3.5
self.driver = None
options = webdriver.ChromeOptions()
options.add_argument('--no-sandbox')
options.add_argument('--disable-dev-shm-usage')
self.driver = webdriver.Chrome(service_log_path='/somewhere/webdriver.log', options=options)
self.driver.implicitly_wait(timeout)
apiritif.put_into_thread_store(timeout=timeout, func_mode=False, driver=self.driver, windows={}, scenario_name='loc_sc')
def _1_Shadow_locators_test(self):
with apiritif.smart_transaction('Shadow locators test'):
self.assertEqual(find_element_by_shadow('c-basic, lightning-accordion-section, .slds-button').get_attribute('innerText').strip(), 'text'.strip())
self.assertEqual(find_element_by_shadow('c-basic, lightning-accordion-section, .slds-button').get_attribute('innerText').strip(), 'text'.strip())
self.assertEqual(find_element_by_shadow('c-basic, lightning-accordion-section, .slds-button').get_attribute('value').strip(), 'value'.strip())
self.assertEqual(find_element_by_shadow('c-basic, lightning-accordion-section, .slds-button').get_attribute('value').strip(), 'value'.strip())
if find_element_by_shadow('c-basic, lightning-accordion-section, .slds-button').get_attribute('contenteditable'):
self.driver.execute_script(("arguments[0].innerHTML = '%s';" % 'new text'), find_element_by_shadow('c-basic, lightning-accordion-section, .slds-button'))
else:
raise NoSuchElementException(("The element (shadow: '%s') is not a contenteditable element" % ('c-basic, lightning-accordion-section, .slds-button',)))
if find_element_by_shadow('c-basic, lightning-accordion-section, .slds-button').get_attribute('contenteditable'):
self.driver.execute_script(("arguments[0].innerHTML = '%s';" % 'new text'), find_element_by_shadow('c-basic, lightning-accordion-section, .slds-button'))
else:
raise NoSuchElementException(("The element (shadow: '%s') is not a contenteditable element" % ('c-basic, lightning-accordion-section, .slds-button',)))
find_element_by_shadow('c-basic, lightning-accordion-section, .slds-button').click()
find_element_by_shadow('c-basic, lightning-accordion-section, .slds-button').click()
ActionChains(self.driver).double_click(find_element_by_shadow('c-basic, lightning-accordion-section, .slds-button')).perform()
ActionChains(self.driver).double_click(find_element_by_shadow('c-basic, lightning-accordion-section, .slds-button')).perform()
ActionChains(self.driver).click_and_hold(find_element_by_shadow('c-basic, lightning-accordion-section, .slds-button')).perform()
ActionChains(self.driver).click_and_hold(find_element_by_shadow('c-basic, lightning-accordion-section, .slds-button')).perform()
ActionChains(self.driver).release(find_element_by_shadow('c-basic, lightning-accordion-section, .slds-button')).perform()
ActionChains(self.driver).release(find_element_by_shadow('c-basic, lightning-accordion-section, .slds-button')).perform()
ActionChains(self.driver).move_to_element_with_offset(find_element_by_shadow('c-basic, lightning-accordion-section, .slds-button'), -10, -10).perform()
ActionChains(self.driver).move_to_element_with_offset(find_element_by_shadow('c-basic, lightning-accordion-section, .slds-button'), -10, -10).perform()
ActionChains(self.driver).move_to_element(find_element_by_shadow('c-basic, lightning-accordion-section, .slds-button')).perform()
ActionChains(self.driver).move_to_element(find_element_by_shadow('c-basic, lightning-accordion-section, .slds-button')).perform()
target = get_locator([{'id': 'id12'}])
ActionChains(self.driver).drag_and_drop(find_element_by_shadow('c-basic, lightning-accordion-section, .slds-button'), self.driver.find_element(
target[0],
target[1])).perform()
source = get_locator([{'id': 'id34'}])
ActionChains(self.driver).drag_and_drop(self.driver.find_element(
source[0],
source[1]), find_element_by_shadow('c-basic, lightning-accordion-section, .slds-button')).perform()
target = get_locator([{'id': 'id12'}])
ActionChains(self.driver).drag_and_drop(find_element_by_shadow('c-basic, lightning-accordion-section, .slds-button'), self.driver.find_element(
target[0],
target[1])).perform()
source = get_locator([{'id': 'id34'}])
ActionChains(self.driver).drag_and_drop(self.driver.find_element(
source[0],
source[1]), find_element_by_shadow('c-basic, lightning-accordion-section, .slds-button')).perform()
Select(find_element_by_shadow('c-basic, lightning-accordion-section, .slds-button')).select_by_visible_text('value')
Select(find_element_by_shadow('c-basic, lightning-accordion-section, .slds-button')).select_by_visible_text('value')
self.vars['my_var'] = find_element_by_shadow('c-basic, lightning-accordion-section, .slds-button').get_attribute('innerText')
self.vars['my_var'] = find_element_by_shadow('c-basic, lightning-accordion-section, .slds-button').get_attribute('innerText')
self.vars['my_var'] = find_element_by_shadow('c-basic, lightning-accordion-section, .slds-button').get_attribute('value')
self.vars['my_var'] = find_element_by_shadow('c-basic, lightning-accordion-section, .slds-button').get_attribute('value')
find_element_by_shadow('c-basic, lightning-accordion-section, .slds-button').clear()
find_element_by_shadow('c-basic, lightning-accordion-section, .slds-button').send_keys('text')
find_element_by_shadow('c-basic, lightning-accordion-section, .slds-button').clear()
find_element_by_shadow('c-basic, lightning-accordion-section, .slds-button').send_keys('text')
find_element_by_shadow('c-basic, lightning-accordion-section, .slds-button').submit()
find_element_by_shadow('c-basic, lightning-accordion-section, .slds-button').submit()
find_element_by_shadow('c-basic, lightning-accordion-section, .slds-button').send_keys(Keys.ENTER)
find_element_by_shadow('c-basic, lightning-accordion-section, .slds-button').send_keys(Keys.ENTER)
def test_locsc(self):
self._1_Shadow_locators_test()
def tearDown(self):
if self.driver:
self.driver.quit()
| 2023-08-18T01:26:18.401715 | https://example.com/article/2382 |
Strawberry Lemon Iced by Cloud Nurdz 100ML is one of the most magical e juices you will ever try! This premium vape juice takes on the flavor of strawberry and lemon candy flavor that is so sour and sweet your mouth will be watering! The menthol finish is ice cold and refreshing! | 2023-09-10T01:26:18.401715 | https://example.com/article/8508 |
Q:
Neural networks: Active input range of activation functions?
I'm playing with the Neural Network toolbox in MATLAB.
I've noted that each activation function (aka, transfer function) has 2 properties:
the output range, which, if I understand, is the codomain of the function, and
the active input range, which I really don't understand
For instance:
tansig (hyperbolic tangent sigmoid) has an output range of [-1,1] and an active input range of [-2,2].
logsig (log-sigmoid) has an output range of [0,1] and an active input range of [-4,4].
purelin (linear) has both an output range and an active input range of [-inf,+inf].
...
I'm really confused...
So, can you tell me:
What is it the active input range of an activation function
How can I compute the active input range for a custom activation function?
Thank you so much for your time.
A:
What seems to be meant by this definition is the range within which there is variation in the activation function (ie. where the activation is not saturated). For instance, for a tanh activation function, outside of $[-2,2]$, the activation function does not vary much, ie. its gradient is almost zero.
To compute this window, you can for instance compute the derivative of the activation function, choose a threshold $\epsilon$ under which you consider the derivative to be "small" (this is somewhat arbitrary, but values less than $10^{-2}$ of the derivative for an activation function taking values around $-1,1$ usually means relative "flatness".)
This matters for several reasons :
Since neural nets are usually trained using backpropagation, examples with activations falling in the saturated range (ie. outside the "active input range") of a neuron have no effect on the parameters of said neuron when computing the gradient (the gradient is essentially zero).
If say your features take extremely high values, and you initialize network weights at high values, a tanh unit for instance may be completely saturated for all examples when beginning training, and thus the network will not train at all. So you must take this saturation range into account when 1) scaling inputs and 2) initializing weights.
Generally, activation functions which do not saturate too much (RELu for instance) result in much faster & efficient training than saturating functions (sigmoid, tanh), precisely for the reasons above : consistently significant gradients and no saturation.
| 2024-07-29T01:26:18.401715 | https://example.com/article/2489 |
Thymus capitatus
Thymus capitatus is a compact, woody perennial native to Mediterranean Europe and Turkey, more commonly known as conehead thyme, Persian-hyssop and Spanish oregano. It is also known under the name Thymbra capitata.
Description
The plant has rising stems and narrow, fleshy, oil-gland-dotted green leaves that reach a length of .
The pink, -long flowers are held in cone-shaped clusters at the ends of their stems in mid to late summer; they are protected by overlapping, -long, red-tinged bracts, edged in tiny hairs.
In Eurasia, a species of leafless parasitic dodder (Cuscuta epithymum) would often attach itself to the conehead thyme (Thymus capitatus), taking on the plant's pungency and from whence it also derived its host's Arabic name, al-ṣaʿitrah.
Thymus capitatus is hardy from USDA Zones 7-10. In Israel, the plant Thymus capitatus has protected status, making it a criminal offence to harvest it.
See also
Satureja thymbra
References
capitatus
Category:Flora of Italy
Category:Flora of Spain
Category:Flora of Turkey
Category:Herbs
Category:Flora of Israel
Category:Flora of Palestine (region) | 2023-08-13T01:26:18.401715 | https://example.com/article/7996 |
Q:
Can this world invent gas cylinders early?
QUESTION
I'd like a nation in the world I'm working on to be able to transport natural gas and hydrogen, for fuel and possibly ballooning. Natural gas pipelines and cylinders were first invented in ancient China, but while impressive, these were rather leaky. I'd like it if the inhabitants of this world could store gas over time, and transport it over distance, rather than relying just on proximity to a reserve.
Can my world invent reliable gas cylinders early? How large and efficient could they potentially make them?
NOTES
In general, the technology hovers between classical and medieval, but there are some important exceptions. They possess most metals and woods, but there are large regions of the world that do not have iron or nickle, and this culture may eventually be included among them. In terms of relevant unusual materials, assume also they have:
Vulcanized rubber, from sulfur.
Bamboo and silk equivalents.
They are familiar with creating relatively complex devices from building automated textile mills and similar technologies. There are good conditions for the exchange of ideas and invention in general. Chemistry, in particular is ahead of the game, so other materials may be available if necessary and plausible. Otherwise I prefer to keep things as outlined.
Finally, this question is related, but distinct.
A:
Vessels capable to withstand pressure, that are simultaneously reliable and cheap are pretty hard to manufacture.
But you do not need pressure to use and transport gases. This is how 19th century limelight looked like:
(A) is a sack made out of skin and filled with hydrogen. Weight (B) provides pressure.
Similar technology was used in 20th century as well. This is car that stores gas in a sack on its roof(other examples):
A:
Make your gas on site via hydrocarbon cracking.
https://en.wikipedia.org/wiki/Cracking_(chemistry)
It requires some spiffy tech to compress gas and keep it compressed. But it takes very little tech to tote an urn of crude oil around. Long chain hydrocarbons (like crude oil) can be "cracked" into smaller molecular weight fractions. This is done industrially using heat, pressure and catalysts. Your primitives have discovered a mineral which serves as a catalyst to enable low temperature cracking of long hydrocarbons. When they set up their balloon, they can set up the cracking pots underneath and let the warm methane and hydrogen float up into the balloon.
For a work of fiction, having urns of black goo and weird chemical reactions might be cooler than Flintstonesque bronze CO2 tanks.
| 2024-03-06T01:26:18.401715 | https://example.com/article/2984 |
Lawmakers Ready to Approve Use of Medical Marijuana
By
The Local
on August 17, 2010
Doctors could write prescriptions for cannabis, and pharmacies would be authorised to sell the plant once the law had been adjusted, a member of the junior coalition party, the pro-business Free Democrats (FDP), said Monday.
Marijuana would also be permitted for use as a pain reliever for the terminally ill in hospices and other care facilities, making it a legal part of their emergency pain-relief stocks.
“With this, the sickest people will always have a pain-relieving substance available,” said Ulrike Flack, the FDP’s health policy spokesperson.
The new law will end a long-running struggle between German officials, doctors and health insurers over use of the proven herbal therapy for treating the pain stemming from diseases such as cancer and multiple sclerosis.
According to the International Association for Cannabinoid Medicines (ACM), only 40 patients in the country are currently allowed a medical marijuana prescription – even though law enforcement generally tolerates small amounts for personal use.
Almost two years ago, the conservative Christian Democrats, the FDP and the centre-left Social Democrats all voted against loosening medical marijuana laws. Opponents had warned of the drug’s alleged potential for addiction and doubted its medical benefits.
” I don’t think there’s any question that pot is better for your body than...
Comments
8 Comments
Don Marijuano on
August 23, 2010 6:18 pm
THE FACTS about the misleading information medical cannabis in germany , a statement by Dr.Franjo Grotenhermen:
“There are media reports that the German government is intending to ease the access to cannabis for medicinal purposes. Most of the reports are misleading. The German government has agreed on allowing for pharmaceutical companies to apply for approvals on cannabis-based medicines in Germany. This is necessary to allow the British company GWPharmaceuticals to apply for an approval of their cannabis extract Sativex in Germany. Sativex is already available in the UK and Spain for the treatment of spasticity in multiple sclerosis sufferers,and the company announced in July that applications for this indication have also been made in Italy, France, Germany and other European countries. Approvals are expected in 2011.
No other changes with regard to the medical use of cannabis are intended by the German government. The German Association for Cannabis as Medicine is calling the media reports initiated by the German Government as “misleading”, since they suggest that cannabis will be available in Germany soon for many patients,while it is only for spasticity in MS after the approval of Sativex for this indication.
Currently two possibilities exist for a treatment with cannabis based medicines in Germany:(1) Prescription of dronabinol or nabilone by physicians. Unfortunately, the health insurances are usually not obligated to pay for such a treatment.(2) Special permission by the government to use cannabis for medicinal purposes. Currently, only about 40 patients are permitted to do so and can buy cannabis in pharmacies imported from the Netherlands.”
Anonymous on
August 18, 2010 10:57 pm
Why do you assume that political words/names in Germany mean the same as they do in the US, or Canada?
NV NEWSWIRE on
August 18, 2010 12:18 pm
This is definitely awesome! It’s a really helpful article and I hope you could also get to visit my site so we can permeate ideas when it comes to legalizing medical marijuanas. Please drop some comments and let us know what you think about our website.
Desinged to promote extremist, irrational views “as far as HIV patients, if you want to suck cock and shove needles up your ass, you need to realize your monkey loving life” “Come on, get over it, legalize or forget about it! ” “Go lick an electric cable to see how you like artificial energy. ” as those of cannabis lovers. Why this person in on the site is obvious.
Anonymous on
August 18, 2010 1:10 am
Its too bad only deformed meat patties of humans are easily allowed weed. as far as HIV patients, if you want to suck cock and shove needles up your ass, you need to realize your monkey loving life is not the only reason medical legalization is necessary, others who need it just need it, if the law & doctors think you need to be half dead and a convulsing pile of jello before they feel confident feeding you herbal drugs, after the 20 different varieties of pills they tried first with ‘suicidal behavior’ as side effects that didn’t work or almost killed you if you miss a few??? Come on, get over it, legalize or forget about it! The longer we wait the more and more children are gonna be born with defects from chemicals over time and then the government will have all the puppets they need to use as lab rats for humans addiction to technology advancement. Go lick an electric cable to see how you like artificial energy. 80% of the population is infested with mercury already. | 2024-03-27T01:26:18.401715 | https://example.com/article/1812 |
Q:
using curl and storing cookie as a variable
i have a curl function that visits a website, logs in to said website, stores the cookie file, then can later read the cookie file to visit a page that would normally require a login.
problem i am faced with is i want to save and retrieve the cookie file using a php variable but cant seem to get it to work.
$username = "myusername";
function getUrl($url, $method='', $vars='') {
$ch = curl_init();
if ($method == 'post') {
curl_setopt($ch, CURLOPT_POST, 1);
curl_setopt($ch, CURLOPT_POSTFIELDS, $vars);
}
curl_setopt($ch, CURLOPT_URL, $url);
curl_setopt($ch, CURLOPT_RETURNTRANSFER, 1);
curl_setopt($ch, CURLOPT_FOLLOWLOCATION, 1);
curl_setopt($ch, CURLOPT_COOKIEJAR, "cookies/$username.txt");
curl_setopt($ch, CURLOPT_COOKIEFILE, "cookies/$username.txt");
$buffer = curl_exec($ch);
curl_close($ch);
return $buffer;
}
i assume the syntax is wrong, and not that curl cant handle a variable as a location?
A:
The problem is the scope of the $username variable. Because it's outside the function, it's not available inside the function. You should either add the username as a parameter of the function or use the global keyword so that it's accessible inside the function.
See http://ca2.php.net/manual/en/language.variables.scope.php for more information.
| 2024-02-27T01:26:18.401715 | https://example.com/article/2221 |
An example of conventional voice browser systems having a voice input/output function is a voice-controllable computer proposed in Japanese Patent Laid-Open No. 10-124293 by which a client performs voice synthesis and voice recognition. Unfortunately, a voice browser system having this configuration has the problem that when a client is implemented by hardware such as a portable terminal having small calculation resources, the processing load on the client is too large compared to the resources.
Accordingly, voice browser systems which synthesize and recognize voices by using hardware different from hardware for implementing a client have been invented. An example is a browser system or a voice proxy server proposed in Japanese Patent Laid-Open No. 11-110186.
In the above conventional voice browser system, however, a browser process for displaying data described in a markup language such as HTML is separated from a process for outputting and inputting voices by voice synthesis and voice recognition. Therefore, between hardware for performing voice synthesis and voice recognition and hardware for implementing a client, communication for exchanging voice output data and voice input data must be performed in addition to communication accomplished by HTTP or the like to exchange data described in HTML or the like.
This requires complicated communication control and control for synchronizing the individual processes and hence makes the construction of a voice browser system difficult. In addition, a fire wall which prohibits communication except for HTTP communication is often formed between a client and a server. Since no other communication is possible in this case, a voice browser system is difficult to construct. | 2024-07-23T01:26:18.401715 | https://example.com/article/6966 |
The cervical cancer screening program from a midwife's perspective.
Midwives in Sweden are responsible for taking Papanicolaou (Pap) smears as part of the cervical cancer screening program. The aim of this study was to investigate midwives knowledge, experience and management of the cervical cancer screening program, and their apprehension of women's knowledge about Pap-smear screening. A postal questionnaire was sent to midwives working in primary health care in 3 different areas in Sweden. A total of 156 (77%) out of 201 midwives completed the questionnaire. Four of 5 midwives considered themselves to have the education they needed to manage the screening program. However, the study indicated that midwives lacked a basic structure when giving information. As many as every third midwife refrained from or had an irrelevant answer to the proposed question, what is meant by a cellular atypia? Almost all midwives saw themselves as the main informant about Pap-smear screening. At the same time, the midwives perceived that women lacked knowledge about cellular atypia, and thought it was the same as cancer. Some 38% of the midwives expressed a wish to terminate the 'assembly line-like' screening system. The remaining midwives were completely satisfied with the organisation. Many midwives lacked time and a structured guidance when discussing screening and cervical atypia. Improvement in the organisation and certified education for Pap-smear screening with access to recent research, could develop a more empowering exchange between the midwives and the women participating in cervical screening. | 2024-06-28T01:26:18.401715 | https://example.com/article/6901 |
All likes are very much appreciated! ^^
Off the top of my head here are some more weird Turkish names: Deniz (sea), Barış (peace), Damla (droplet), Zafer (victory), Yaprak (leaf), Asya (Asia), Can (life), Hayat (living), Duygu (emotion), Güneş (sun), Hazel (hazel), Arzu (desire), Çiçek (flower), Gül (rose), Aziz (saint), Aydın (intellectual)
I can go all day and there are REALLY weird ones like Cansu (life-water?) or Bedirhan (a compliment to a king or a sultan back in the day meaning that they are the best one) but I'll stop there =D
Soccer Manager gameplay, gaming, edited, montage, compilation, let's play, knight and crow, sam and oliver
Soccer Manager 2016 - Play for Free, Compete for Real.
The most diverse FREE 2 PLAY football management simulator in the world. Take on a top flight club and test your management skills against the best or help a struggling, lower division team fight for glory.
Soccer Manager 2016 Features
Reactive 2D LiveMatchEnvironmentMonitor your team's performance during live games. React with different tactics and strategies and watch your team adapt to your decisions in real time
Unique Soccer Manager X-PLATFORM technology
Our cloud-based X-PLATFORM technology allows you to save your game on any device and continue to play on another. No need to set up a different account for different devices, take your team with you anywhere and play anytime.
NEWLeagues & Competitions added
We have added a host of new competitions from South America right through to Europe.
NEW 2016 Updated Squads
2015/16 season squads available in-game. Has there been a change to your squad? Soccer Manager can update changes to squads within days of transfers happening. No need to wait until next season to play with updated players.
PLAY NOW - www.soccermanager.com
UEFA Champions League
The UEFA Champions League, known simply as the Champions League, is an annual continental club football competition organised by the Union of European Football Associations (UEFA) and contested by top-division European clubs. It is one of the most prestigious tournaments in the world and the most prestigious club competition in European football, played by the national league champion (and, for some nations, one or more runners-up) of each UEFA national association. The final of the 2012–13 tournament was the most watched UEFA Champions League final to date, as well as the most watched annual sporting event worldwide in 2013, drawing 360million television viewers.
Introduced in 1992, the competition replaced the European Champion Clubs' Cup, or simply European Cup, which had run since 1955, adding a group stage to the competition and allowing multiple entrants from certain countries. The pre-1992 competition was initially a straight knockout tournament open only to the champion club of each country. During the 1990s, the format was expanded, incorporating a round-robin group stage to include clubs that finished runner-up of some nations' top level league. While most of Europe's national leagues can still only enter their national league champion, Europe's strongest national leagues now provide up to four teams for the competition, and will provide up to five teams from the 2015–16 season onwards. Clubs that finish next-in-line in each nation's top level league, having not qualified for the UEFA Champions League competition, may be eligible for the next level UEFA Europa League competition.
Player of the year award
Several sports leagues honour their best player with an award called Player of the Year. In the United States, this type of award is usually called a Most Valuable Player award. The awards with the "player of the year" phrasing include these.
WEIRDEST NAMES IN THE WORLD! - Soccer Manager 2015
All likes are very much appreciated! ^^
Off the top of my head here are some more weird Turkish names: Deniz (sea), Barış (peace), Damla (droplet), Zafer (victory), Yaprak (leaf), Asya (Asia), Can (life), Hayat (living), Duygu (emotion), Güneş (sun), Hazel (hazel), Arzu (desire), Çiçek (flower), Gül (rose), Aziz (saint), Aydın (intellectual)
I can go all day and there are REALLY weird ones like Cansu (life-water?) or Bedirhan (a compliment to a king or a sultan back in the day meaning that they are the best one) but I'll stop there =D
Soccer Manager gameplay, gaming, edited, montage, compilation, let's play, knight and crow, sam and oliver
SOCCER MANAGER 2016
Soccer Manager 2016 - Play for Free, Compete for Real.
The most diverse FREE 2 PLAY football management simulator in the world. Take on a top flight club and test your management skills against the best or help a struggling, lower division team fight for glory.
Soccer Manager 2016 Features
Reactive 2D LiveMatchEnvironmentMonitor your team's performance during live games. React with different tactics and strategies and watch your team adapt to your decisions in real time
Unique Soccer Manager X-PLATFORM technology
Our cloud-based X-PLATFORM technology allows you to save your game on any device and continue to play on another. No need to set up a different account for different devices, take your team with you anywhere and play anytime.
NEWLeagues & Competitions added
We have added a host of new competitions from South America right through to Europe.
NEW 2016 Updated Squads
2015/16 season squads available in-game. Has there been a change to your squad? Soccer Manager can update changes to squads within days of transfers happening. No need to wait until next season to play with updated players.
PLAY NOW - www.soccermanager.com
WSM TV: Il Processo di WSM - 1^ Puntata
WEIRDEST NAMES IN THE WORLD! - Soccer Manager 2015
All likes are very much appreciated! ^^
Off the top of my head here are some more weird Turkish names: Deniz (sea), Barış (peace), Damla (droplet), Zafer (victory), Yaprak (leaf), Asya (Asia), Can (life), Hayat (living), Duygu (emotion), Güneş (sun), Hazel (hazel), Arzu (desire), Çiçek (flower), Gül (rose), Aziz (saint), Aydın (intellectual)
I can go all day and there are REALLY weird ones like Cansu (life-water?) or Bedirhan (a compliment to a king or a sultan back in the day meaning that they are the best one) but I'll stop there =D
Soccer Manager gameplay, gaming, edited, montage, compilation, let's play, knight and crow, sam and oliver
SOCCER MANAGER 2016
Soccer Manager 2016 - Play for Free, Compete for Real.
The most diverse FREE 2 PLAY football management simulator in the world. Take on a top flight club and test your management skills against the best or help a struggling, lower division team fight for glory.
Soccer Manager 2016 Features
Reactive 2D LiveMatchEnvironmentMonitor your team's performance during live games. React with different tactics and strategies and watch your team adapt to your decisions in real time
Unique Soccer Manager X-PLATFORM technology
Our cloud-based X-PLATFORM technology allows you to save your game on any device and continue to play on another. No need to set up a different account for different devices, take your team with you anywhere and play anytime.
NEWLeagues & Competitions added
We have added...
WEIRDEST NAMES IN THE WORLD! - Soccer Manager 2015
All likes are very much appreciated! ^^
Off the top of my head here are some more weird Turkish names: Deniz (sea), Barış (peace), Damla (droplet), Zafer (vic...
All likes are very much appreciated! ^^
Off the top of my head here are some more weird Turkish names: Deniz (sea), Barış (peace), Damla (droplet), Zafer (victory), Yaprak (leaf), Asya (Asia), Can (life), Hayat (living), Duygu (emotion), Güneş (sun), Hazel (hazel), Arzu (desire), Çiçek (flower), Gül (rose), Aziz (saint), Aydın (intellectual)
I can go all day and there are REALLY weird ones like Cansu (life-water?) or Bedirhan (a compliment to a king or a sultan back in the day meaning that they are the best one) but I'll stop there =D
Soccer Manager gameplay, gaming, edited, montage, compilation, let's play, knight and crow, sam and oliver
All likes are very much appreciated! ^^
Off the top of my head here are some more weird Turkish names: Deniz (sea), Barış (peace), Damla (droplet), Zafer (victory), Yaprak (leaf), Asya (Asia), Can (life), Hayat (living), Duygu (emotion), Güneş (sun), Hazel (hazel), Arzu (desire), Çiçek (flower), Gül (rose), Aziz (saint), Aydın (intellectual)
I can go all day and there are REALLY weird ones like Cansu (life-water?) or Bedirhan (a compliment to a king or a sultan back in the day meaning that they are the best one) but I'll stop there =D
Soccer Manager gameplay, gaming, edited, montage, compilation, let's play, knight and crow, sam and oliver
SOCCER MANAGER 2016
Soccer Manager 2016 - Play for Free, Compete for Real.
The most diverse FREE 2 PLAY football management simulator in the world. Take on a top flight club and t...
Soccer Manager 2016 - Play for Free, Compete for Real.
The most diverse FREE 2 PLAY football management simulator in the world. Take on a top flight club and test your management skills against the best or help a struggling, lower division team fight for glory.
Soccer Manager 2016 Features
Reactive 2D LiveMatchEnvironmentMonitor your team's performance during live games. React with different tactics and strategies and watch your team adapt to your decisions in real time
Unique Soccer Manager X-PLATFORM technology
Our cloud-based X-PLATFORM technology allows you to save your game on any device and continue to play on another. No need to set up a different account for different devices, take your team with you anywhere and play anytime.
NEWLeagues & Competitions added
We have added a host of new competitions from South America right through to Europe.
NEW 2016 Updated Squads
2015/16 season squads available in-game. Has there been a change to your squad? Soccer Manager can update changes to squads within days of transfers happening. No need to wait until next season to play with updated players.
PLAY NOW - www.soccermanager.com
Soccer Manager 2016 - Play for Free, Compete for Real.
The most diverse FREE 2 PLAY football management simulator in the world. Take on a top flight club and test your management skills against the best or help a struggling, lower division team fight for glory.
Soccer Manager 2016 Features
Reactive 2D LiveMatchEnvironmentMonitor your team's performance during live games. React with different tactics and strategies and watch your team adapt to your decisions in real time
Unique Soccer Manager X-PLATFORM technology
Our cloud-based X-PLATFORM technology allows you to save your game on any device and continue to play on another. No need to set up a different account for different devices, take your team with you anywhere and play anytime.
NEWLeagues & Competitions added
We have added a host of new competitions from South America right through to Europe.
NEW 2016 Updated Squads
2015/16 season squads available in-game. Has there been a change to your squad? Soccer Manager can update changes to squads within days of transfers happening. No need to wait until next season to play with updated players.
PLAY NOW - www.soccermanager.com
WEIRDEST NAMES IN THE WORLD! - Soccer Manager 2015
All likes are very much appreciated! ^^
Off the top of my head here are some more weird Turkish names: Deniz (sea), Barış (peace), Damla (droplet), Zafer (victory), Yaprak (leaf), Asya (Asia), Can (life), Hayat (living), Duygu (emotion), Güneş (sun), Hazel (hazel), Arzu (desire), Çiçek (flower), Gül (rose), Aziz (saint), Aydın (intellectual)
I can go all day and there are REALLY weird ones like Cansu (life-water?) or Bedirhan (a compliment to a king or a sultan back in the day meaning that they are the best one) but I'll stop there =D
Soccer Manager gameplay, gaming, edited, montage, compilation, let's play, knight and crow, sam and oliver
12:53
Michel Platini part 1
✯✯✯✯✯
Michel François Platini is a former French football player, manager and current p...
SOCCER MANAGER 2016
Soccer Manager 2016 - Play for Free, Compete for Real.
The most diverse FREE 2 PLAY football management simulator in the world. Take on a top flight club and test your management skills against the best or help a struggling, lower division team fight for glory.
Soccer Manager 2016 Features
Reactive 2D LiveMatchEnvironmentMonitor your team's performance during live games. React with different tactics and strategies and watch your team adapt to your decisions in real time
Unique Soccer Manager X-PLATFORM technology
Our cloud-based X-PLATFORM technology allows you to save your game on any device and continue to play on another. No need to set up a different account for different devices, take your team with you anywhere and play anytime.
NEWLeagues & Competitions added
We have added a host of new competitions from South America right through to Europe.
NEW 2016 Updated Squads
2015/16 season squads available in-game. Has there been a change to your squad? Soccer Manager can update changes to squads within days of transfers happening. No need to wait until next season to play with updated players.
PLAY NOW - www.soccermanager.com | 2024-05-28T01:26:18.401715 | https://example.com/article/2729 |
//
// OP_ROLL.swift
//
// Copyright © 2018 BitcoinKit developers
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
// copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in
// all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
// THE SOFTWARE.
//
import Foundation
// The item n back in the stack is moved to the top.
public struct OpRoll: OpCodeProtocol {
public var value: UInt8 { return 0x7a }
public var name: String { return "OP_ROLL" }
// input : xn ... x2 x1 x0 <n>
// output : ... x2 x1 x0 xn
public func mainProcess(_ context: ScriptExecutionContext) throws {
try context.assertStackHeightGreaterThanOrEqual(2)
let n: Int32 = try context.number(at: -1)
context.stack.removeLast()
guard n >= 0 else {
throw OpCodeExecutionError.error("\(name): n should be greater than or equal to 0.")
}
let index: Int = Int(n + 1)
try context.assertStackHeightGreaterThanOrEqual(index)
let count: Int = context.stack.count
let xn: Data = context.stack.remove(at: count - index)
context.stack.append(xn)
}
}
| 2023-09-08T01:26:18.401715 | https://example.com/article/4914 |
Honestly, I have a lot of other things to get to this week, and within that, a lot of other pieces to write. But I have been so ubiquitously harassed by national-level Democrats that hey, I’ll take some time out this afternoon to respond to their litany of email.
Dear Representative Pelosi—
Perhaps there was a time in my life when receiving an email from the former Speaker of the House would have been at least a little thrilling, but the bloom is off the rose now. I don’t really even think you care about me, what with all of your messages—which are too many, honestly, it’s getting embarrassing—addressed to me as <FRIEND:VALUE!>. It feels half-hearted, Representative Pelosi. I know you are well networked in the legislative scene over on Capitol Hill. I used to see you around town from time to time when I still lived there. Okay; that’s a lie, it was Dennis Kucinich whom I saw, and mostly at the Greek restaurant on Pennsylvania SE that has sadly closed down. What I don’t understand, however, is how with all of your knowledge and connections and wealthy campaign contacts, you haven’t come across anyone who has mentioned even in passing that the Democratic National Committee’s strategy on getting donations for these midterms is abysmally bad. Here are the subject lines of just a few of the HUNDREDS of messages I’ve received these past few months:
painful loss
we. fell. short.
Friend we’re BEGGING
B O E H N E R wins
all hope is lost
The content in the actual email isn’t any better.
A new Koch Brothers front group just ambushed us with $1.8 million worth of attacks in 2 must-win races. We repeat: These are NEW last-minute attacks from the Koch brothers in 2 must-win races.
We’re still coming up short.
Tonight is the final federal fundraising deadline of this election. And let me repeat: we’re still coming up short.We wouldn’t be asking if it wasn’t important. This week, Boehner’s allies are spending $17 million attacking us. We’re getting completely outspent.
Oh I don’t know, I kind of think you’d still be asking, Ms. Pelosi.
Here’s the thing—I’m not really afraid of the GOP anymore. The scare tactics of a GOP-run Senate can’t be much worse than what’s already happened with Democrats in technical control of that chamber. We still all suffered through multiple financial cliffhangers over the debt ceiling and federal spending. Isn’t sequestration still going on, like right now? It’s been nearly a year since the President named an individual for Surgeon General, but nobody has pressured Senator Paul to remove his block, even in the midst of the Ebola hysteria.
On the other side of the aisle, we haven’t seen any immigration reform even though it’s been talked about for six years, and was part of what Barack Obama campaigned on in 2007. I run a syringe exchange program in southeastern Washington, which is about to exchange four syringes for every person living in the city of Walla Walla, but even though ending the ban on federal funding of syringe exchange was part of Mr. Obama’s pledge to public health advocates, it was only removed for one year, and in the Democrat-controlled conversations about the Affordable Care Act, was put back in place as an offer to the GOP. Your own House left undocumented and new immigrants out in the cold on health insurance, and it was your team that allowed the crack in the shield of contraception coverage by saying employers didn’t have to cover it when it had been part of standard coverage for decades, but by all means, let’s pretend the Hobby Lobby decision has nothing to do with that.
You want money from me, I get that. Even $5. And what would my $5 support? The increased deportation of individuals, stepped up by the Obama Administration since George W. Bush left office? The also increased frequency of drone attacks? The vigorous pursuit of whistleblowers? The unilateral attacks on Syria with no congressional approval? Would it support the closing of Gitmo, or more money into CHIP and TANF? Or would it just be a latte I didn’t drink that week, on your behalf?
I have been a card-carrying Democrat for two decades, and yes, I have given nominally before to earlier campaigns. But I think we both know that the midterm election in the sixth year of a White House term always goes against the party holding the executive branch. Between this very robust American political tradition and the fact that my Democratic Party looks less and less like the party I know, I will continue ignoring your shaming, guilt-tripping, sensationalized email messages. You may email me. FLOTUS may email me. The President himself may email me, but these are in name only, a facade as certain as the Democratic position papers are these days.
I will count on a series of vetos by the President once all of Congress is GOP-run, and I will hope with my dearest hope that a true progressive takes the reins of the party for the 2016 election. But for now?
BUY THE UNINTENTIONAL TIME TRAVELER!
Buy Bumbling into Body Hair!
Endorsements
"Everett's work is luminous, brilliant, thoughtful and brave. I am so proud to be on this earth with him. He is who we all fight for, and he is the future of our community."
—Margaret Cho, comedian and author of I Have Chosen to Stay and Fight
"Everett Maroon has written a book that is brave, funny, smart, and true. I admire his courage, his wit, his unflinching eye, and most of all, his persistance and determination to be himself. This book is a gift from a very generous writer. The story of Everett's journey will stay with me for a very long time."
—Lesléa Newman, author of October Mourning: A Song for Matthew Shepard and Heather Has Two Mommies
"Reading Bumbling into Body Hair by Everett Maroon—LOVE IT! Great message for trans folk on being our whole selves—AND it's funny."
—Kate Bornstein, author of My New Gender Workbook and A Queer and Pleasant Danger
Email Subscription
Enter your email address to subscribe to this blog and receive notifications of new posts by email.
Join 4,195 other followers
Top Rated
Archives
Archives
Disclaimer
All of the writing on this blog, unless I have otherwise noted or cited it, is the creation and sole property of Everett Maroon. No writing from Transplantportation.com may be reproduced or used without my express written permission. For permission to reproduce or use my writing, please email me at ev.maroon at gmail dot com. | 2024-03-17T01:26:18.401715 | https://example.com/article/9792 |
The relationship between physical activity and serum lipids and lipoproteins in black children and adolescents.
This study assesses the association between the serum lipid and lipoprotein levels of 62 black children and 37 black adolescents and their reported levels of habitual physical activity, 24-hour dietary intake, and physical measurements. In the children physical activity was not correlated with serum lipid and lipoprotein levels. Indicators of physical activity had a positive correlation (P less than 0.02) with high-density-lipoprotein cholesterol and negative correlations (P less than 0.05) with the total serum cholesterol/high-density-lipoprotein cholesterol and low-density-lipoprotein cholesterol/high-density-lipoprotein cholesterol ratios in the adolescents. Subjects were stratified into "low activity" and "high activity" groups. High-activity subjects had lower (P less than 0.05) total serum cholesterol/high-density-lipoprotein cholesterol and low-density-lipoprotein cholesterol/high-density-lipoprotein cholesterol ratios than less active subjects. Subjects that ran track had lower (P less than 0.02) total serum cholesterol and low-density-lipoprotein cholesterol than non-track participants. The results suggest that increased habitual physical activity may have a favorable effect on serum lipid and lipoprotein levels in black adolescents. | 2024-05-18T01:26:18.401715 | https://example.com/article/2460 |
Q:
Build JSON from 2 aggregated columns in Postgres
using a Postgres-Db as source for json-documents, I need to convert two columns from a table to an JSON-object.
So I have the columns "color_id", "language" and "name" in a table of colors:
color_id | language | name
1 | "de" | "blau"
1 | "en" | "blue"
1 | "fr" | "bleu"
And I'd like to produce a JSON-object like:
{
"de": "blau",
"fr": "bleu",
"en": "blue"
}
I started with
SELECT
array_to_json(array_agg((language::text, name::text))),
color_id
FROM colors
GROUP BY color_id;
which unfortunately produced
array to json | color_id
"[{"f1":"de","f2":"blau"} |
, {"f1":"en","f2":"blue"} | 1
, {"f1":"fr","f2":"bleu"}]" |
I'd think it would be simple - more or less -, but found myself at a dead end of misleading results and syntax errors.
Kind regards, Dominik
A:
Use jsonb_object_agg():
with data(color_id, language, name) as (
values
(1, 'de', 'blau'),
(1, 'en', 'blue'),
(1, 'fr', 'bleu')
)
select color_id, jsonb_object_agg(language, name)
from data
group by 1;
color_id | jsonb_object_agg
----------+--------------------------------------------
1 | {"de": "blau", "en": "blue", "fr": "bleu"}
(1 row)
The function jsonb_object_agg() was introduced in Postgres 9.5.
In Postgres 9.4 use json_object_agg() instead.
In Postgres 9.3 you have to construct the result using string functions:
select
color_id,
format('{%s}', string_agg(format('"%s": "%s"', language, name), ', '))::json
from data
group by 1;
| 2023-08-21T01:26:18.401715 | https://example.com/article/5664 |
9 P.3d 128 (2000)
169 Or. App. 573
In the Matter of the Compensation of Stacy Frierson, Claimant.
LABOR FORCE OF OREGON, Petitioner,
v.
Stacy FRIERSON, Respondent.
(98-03225; CA A105758)
Court of Appeals of Oregon.
Argued and Submitted December 10, 1999.
Decided August 30, 2000.
Jerald P. Keene argued the cause and filed the brief for petitioner.
Gordon S. Gannicott, Portland, argued the cause for respondent. With him on the brief was Hollander, Lebenbaum & Gannicott.
Before EDMONDS, Presiding Judge, and ARMSTRONG and KISTLER, Judges.
KISTLER, J.
Employer petitions for review of a Workers' Compensation Board order awarding *129 claimant permanent partial disability. It argues that the Board incorrectly used findings of impairment that did not meet American Medical Association (AMA) validity criteria in calculating the award. We reverse and remand.
Claimant suffered a compensable lumbar strain while lifting heavy metal tubes. When his claim was closed with no award of permanent partial disability, he requested reconsideration by a medical arbiter. See ORS 656.268(7)(a). The medical arbiter, Dr. Bald, performed a series of range-of-motion measurements to determine the extent of claimant's disability. Bald recorded his measurements on a standardized form, which lists five categories of different movements. In each category, the form asks "[a]re measurements within +/10 [percent] or five [degrees] (whichever is greater)" and provides a box for the arbiter to check "yes" or "no."[1]
On two of the five categories, Bald checked "no." On three of the five categories, he checked "yes," and he left one subcategorythe "straight leg raising validity check"blank. As part of his report, Bald also answered specific questions. The fifth question stated: "If any findings are considered invalid, provide rationale and detailed reasoning in accordance with Bulletin 239 and the AMA Guides[.]" Bald responded: "Today's findings are fraught with significant inconsistencies. However, I do feel that they are a reasonable description of the claimant's current level of function." Based on Bald's report, the Department of Consumer and Business Services issued an order on reconsideration that awarded claimant nine percent unscheduled permanent partial disability.
Employer requested a hearing before the administrative law judge (ALJ). Relying on OAR XXX-XXX-XXXX(28), employer argued that Bald's findings were invalid because they did not satisfy the AMA criteria. The ALJ disagreed, reasoning:
"The employer/insurer's main argument is that Dr. Bald's range of motion findings are invalid pursuant to OAR 436-03[5]-0007(2[8]) and therefore should not be rated. The employer/insurer's argument is set forth in detail at page 4 of its closing argument. Claimant contends on the other hand that Dr. Bald's findings are valid and responds in detail to the employer/insurer's argument at page 3 of his closing argument. After careful consideration of both arguments I must agree with claimant. It is clear that Dr. Bald was aware of significant inconsistencies regarding claimant's range of motion findings as he specifically states at Exhibit 19-3 and 19-4. But Dr. Bald performed three separate measurements for lumbar extension (1.2 percent impairment) and five separate measurements for lumbar flexion (4.0 percent impairment). After performing all of these measurements and after a comprehensive examination of claimant and preparation of a thorough medical arbiter evaluation report, Dr. Bald concluded that his range of motion findings are a reasonable description of claimant's current level of function (permanent impairment). The range of motion findings are therefore valid and support claimant's scheduled PPD award."
The Board adopted the ALJ's opinion and affirmed.
On review, employer argues that the Board incorrectly applied OAR XXX-XXX-XXXX(28). That rule provides:
"Validity shall be established for findings of impairment according to the criterion noted in the AMA Guides to the Evaluation of Permanent Impairment, 3rd Ed., Rev., 1990, unless the validity criterion for a particular finding is not addressed in this reference, is not pertinent to these rules, or is determined by physician opinion to be medically inappropriate for a particular *130 worker. Upon examination, findings of impairment which are determined to be ratable pursuant to these rules shall be rated unless the physician determines the findings are invalid and provides a written opinion, based on sound medical principles, explaining why the findings are invalid. When findings are determined to be invalid, the findings shall receive a value of zero. If the validity criterion are [sic ] not met but the physician determines the findings are valid, the physician must provide a written rationale, based on sound medical principles, explaining why the findings are valid."
We held that, under a former version of this rule, findings of impairment that do not meet AMA validity criteria may not be used to rate a claimant's impairment. Roseburg Forest Products v. Clemons, 169 Or.App. 231, 240, 9 P.3d 123 (2000) (interpreting former OAR XXX-XXX-XXXX(27) (1996), renumbered as OAR XXX-XXX-XXXX(28)(1998).[2]
Under the amended rule, the Board potentially had to resolve two issues in this case. The first issue is whether Bald's findings of impairment satisfy the AMA criteria. If they do not, the second is whether the explanation that Bald gave met the standard stated in OAR XXX-XXX-XXXX(28); that is, the question becomes whether Bald's statement"I do feel that [the findings] are a reasonable description of the claimant's current level of function"constitutes a "written rationale, based on sound medical principles, explaining why the findings are valid."
The ALJ's opinion, which the Board adopted, does not address either issue specifically. Indeed, as we observed in Roseburg, the Board had previously held that the former version of OAR XXX-XXX-XXXX(28) required it to use findings of impairment that did not comply with the AMA criteria unless the physician had issued a written opinion explaining why those findings were invalid. 169 Or.App. at 237. The Board's opinion in this case does not preclude the possibility that it ruled, as it previously had and as claimant had expressly urged it to do,[3] that Bald's findings should be used to rate claimant's impairment unless Bald had issued a written opinion explaining why his findings were invalid.
Before we can address employer's arguments that the Board failed to apply the rule properly, we must be able to ascertain the basis of the Board's ruling. In other words, for an order to be adequate for judicial review, we must be able to discern what the Board found as fact and why its findings led to its conclusions. SAIF v. Brown, 159 Or.App. 440, 445-46, 978 P.2d 407 (1999); Armstrong v. Asten-Hill Co., 90 Or.App. 200, 205, 752 P.2d 312 (1988). Because we cannot do so, we reverse and remand for further proceedings consistent with this decision.
Reversed and remanded.
NOTES
[1] An interpretative bulletin issued by the Workers' Compensation Division describes the relevant validity criterion for those measurements:
"The AMA's Guides state that `Reproducibility of abnormal motion is currently the only known criterion for validating optimum effort. The examiner must take at least three consecutive measurements of mobility which must fall within plus or minus ten percent or five degrees (whichever is greater) of each other to be considered consistent.'"
Workers' Compensation Division Bulletin No. 242, at 2 (Feb. 1, 1995).
[2] The Workers' Compensation Division amended the rule in 1997 to add the final sentence quoted above. That amendment is consistent with our reading of the former version of the rule. It also eliminates an incongruity in the former version of the rule. The rule, as amended, permits a physician to explain why findings that do not comply with the AMA guidelines should nonetheless be used, as well as explaining why findings that do comply with the guidelines should nonetheless not be used. See Roseburg, 169 Or.App. at 239 n. 7 (noting incongruity).
[3] Claimant advanced that position in this case, first to the ALJ and then to the Board, as a reason why it should use Bald's impairment findings. Claimant made that argument on page three of its closing argument to the ALJ; in his opinion, the ALJ noted that page of claimant's closing argument and agreed with claimant.
| 2024-07-06T01:26:18.401715 | https://example.com/article/3036 |
Philly McMahon
Philip "Philly" McMahon (born 5 September 1987) is a Gaelic footballer for Dublin and Ballymun Kickhams.
Career
Club
McMahon is a member of the Ballymun Kickhams Senior Football team. in 2013, Ballymun reached the 2012–13 All-Ireland Senior Club Football Championship final. McMahon scored a goal as Ballymun were defeated by St. Brigid's of County Roscommon by a single point, on a scoreline of 2-11 to 2-10.
Inter-county
McMahon won the 2008 O'Byrne Cup with Dublin, defeating Longford in the final. He made his Championship debut that year as a sub against Louth. He played Interprovincial Championship Football for Leinster and won 2 Dublin Under 21 Football Championships with Ballymun. He was named on the 2010 GPA Gaelic Team of the Year. He replaced James McCarthy as a sub in the second half of the 2011 All-Ireland Senior Football Championship Final, a game which Dublin won by 1-12 to 1-11 against Kerry.
On 22 September 2013, McMahon made his first start of the Championship in the All Ireland Final. He was a key performer in Dublin's defeat of Mayo on a scoreline of 2-12 to 1-14.
McMahon helped Dublin to win the 2015 All Ireland final. Throughout the season he became a strong attacking threat despite being named at left corner back. He scored 1-02 in the replayed semi final against Mayo, notably holding Aidan O'Shea to a single point in over both games. McMahon was a key performer in the final where Dublin defeated reigning champions Kerry 0-12 to 0-09, with McMahon scoring a point in the 1st half while keeping marker Colm Cooper scoreless. McMahon received his first All Star award while was also named on the shortlist for GAA Footballer of the Year, ultimately won by teammate Jack McCaffrey.
McMahon was again a key performer in 2016 as Dublin again defeated Mayo by a single point after a replay on a scoreline of 1-15 to 1-14 to retain the Sam Maguire Cup. McMahon received his second All Star for his performances.
In 2017 Dublin were narrowly defeated in the National League final by Kerry by a single point. They then went on to win a record 7 Leinster titles in a row. On 17 September, McMahon was heavily involved as Dublin claim a historic 3 in a row All Ireland titles with another narrow 1-17 to 1-16 victory against Mayo. Having been outplayed in the first half, the Dubs turned the game around to win a thrilling game courtesy of a 75th minute Dean Rock free.
International rules
McMahon made his debut in the 2015 International Rules Series. Ireland edged out the single game series against a strong Australia side on a scoreline of 56-52.
Personal life
In November 2012, McMahon was the Strength and Conditioning Coach at Shamrock Rovers.
McMahon is a business owner and operates multiple gyms. He also launched a health food company.
In 2017, McMahon released an autobiography entitled "The Choice", with a strong emphasis on the story of his older brother John who died in 2012 as a result of drug addiction. It was named Eir Sports' book of the year.
He married his long-term girlfriend Sarah Lacey in December 2019.
Charity
He has set up a charity entitled the half time talk in order to educate, train and empower young, unemployed adults in communities nationwide.
In 2017 after winning his fifth All-Ireland Senior Championship, McMahon released his autobiography called The Choice, which was co-written by sports journalist Niall Kelly. The book won the 2017 Eir Sports Book of the Year award in December 2017. The book also won the Sports Book of the Year award at the 2017 Irish Book Awards.
References
Category:1987 births
Category:Living people
Category:Ballymun Kickhams Gaelic footballers
Category:DCU Gaelic footballers
Category:Dublin inter-county Gaelic footballers
Category:Gaelic football backs
Category:Strength and conditioning coaches
Category:Winners of seven All-Ireland medals (Gaelic football) | 2023-10-10T01:26:18.401715 | https://example.com/article/1102 |
/*******************************************************************************/
/* Copyright (C) 2012 Jonathan Moore Liles */
/* */
/* This program is free software; you can redistribute it and/or modify it */
/* under the terms of the GNU General Public License as published by the */
/* Free Software Foundation; either version 2 of the License, or (at your */
/* option) any later version. */
/* */
/* This program is distributed in the hope that it will be useful, but WITHOUT */
/* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or */
/* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for */
/* more details. */
/* */
/* You should have received a copy of the GNU General Public License along */
/* with This program; see the file COPYING. If not,write to the Free Software */
/* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */
/*******************************************************************************/
#include "OSC/Endpoint.H"
#include <FL/Fl.H>
#include <FL/Fl_Window.H>
#include <FL/Fl_Double_Window.H>
#include <FL/Fl_Widget.H>
#include <FL/Fl.H>
#include <FL/Fl_File_Chooser.H>
#include <FL/Fl_Box.H>
#include <FL/Fl_Pack.H>
#include <FL/Fl_File_Chooser.H>
#include <FL/Fl_Progress.H>
#include "debug.h"
#include <FL/Fl_Browser.H>
#include <FL/Fl_Select_Browser.H>
#include <FL/Fl_Tree.H>
#include <FL/Fl_Hold_Browser.H>
#include <FL/Fl_Tile.H>
#include <FL/Fl_Shared_Image.H>
#include <FL/Fl_Box.H>
#include <FL/Fl_Text_Display.H>
#include "FL/Fl_Packscroller.H"
#include "FL/Fl_Scalepack.H"
#include <unistd.h>
#include <errno.h>
#include <time.h>
#include <getopt.h>
#define APP_NAME "Non-Session-Manager"
#define APP_TITLE "Non Session Manager"
// static lo_address nsm_addr = NULL;
static time_t last_ping_response;
static OSC::Endpoint *osc;
struct Daemon
{
const char *url;
lo_address addr;
bool is_child;
Daemon ( )
{
url = NULL;
addr = NULL;
is_child = false;
}
};
static std::list<Daemon*> daemon_list; /* list of all connected daemons */
#define foreach_daemon( _it ) for ( std::list<Daemon*>::iterator _it = daemon_list.begin(); _it != daemon_list.end(); ++ _it )
static
Fl_Image *
get_program_icon ( const char *name )
{
const char *tries[] =
{
"/usr/local/share/icons/hicolor/32x32/apps/%s.png",
"/usr/local/share/pixmaps/%s.png",
"/usr/local/share/pixmaps/%s.xpm",
"/usr/share/icons/hicolor/32x32/apps/%s.png",
"/usr/share/pixmaps/%s.png",
"/usr/share/pixmaps/%s.xpm",
};
for ( unsigned int i = 0; i < 6; i++ )
{
char *icon_p;
asprintf( &icon_p, tries[i], name );
Fl_Image *img = Fl_Shared_Image::get( icon_p );
free( icon_p );
if ( img )
return img;
}
return NULL;
}
class NSM_Client : public Fl_Group
{
char *_client_id;
char *_client_label;
char *_client_name;
Fl_Box *client_name;
Fl_Box *icon_box;
Fl_Progress *_progress;
Fl_Light_Button *_dirty;
Fl_Light_Button *_gui;
Fl_Button *_remove_button;
Fl_Button *_restart_button;
Fl_Button *_kill_button;
void
set_label ( void )
{
char *l;
if ( _client_label )
asprintf( &l, "%s (%s)", _client_name, _client_label );
else
l = strdup( _client_name );
if ( ! icon_box->image() )
{
Fl_Image *img = get_program_icon( _client_name );
if ( img )
{
icon_box->image( img );
}
}
client_name->copy_label( l );
free(l);
redraw();
}
public:
void
name ( const char *v )
{
if ( _client_name )
free( _client_name );
_client_name = strdup( v );
set_label();
}
void
client_label ( const char *s )
{
if ( _client_label )
free( _client_label );
_client_label = strdup( s );
set_label();
}
void
client_id ( const char *v )
{
if ( _client_id )
free( _client_id );
_client_id = strdup( v );
}
void
progress ( float f )
{
_progress->value( f );
_progress->redraw();
}
void
dirty ( bool b )
{
_dirty->value( b );
_dirty->redraw();
}
void
gui_visible ( bool b )
{
_gui->value( b );
_gui->redraw();
}
void
has_optional_gui ( void )
{
_gui->show();
_gui->redraw();
}
void
stopped ( bool b )
{
if ( b )
{
_remove_button->show();
_restart_button->show();
_kill_button->hide();
_gui->deactivate();
_dirty->deactivate();
color( fl_color_average( FL_BLACK, FL_RED, 0.50 ) );
redraw();
}
else
{
_gui->activate();
_dirty->activate();
_kill_button->show();
_restart_button->hide();
_remove_button->hide();
}
/* _restart_button->redraw(); */
/* _remove_button->redraw(); */
}
void
pending_command ( const char *command )
{
_progress->copy_label( command );
stopped( 0 );
if ( ! strcmp( command, "ready" ) )
{
color( fl_color_average( FL_BLACK, FL_GREEN, 0.50 ) );
_progress->value( 0.0f );
}
else if ( ! strcmp( command, "quit" ) ||
! strcmp( command, "kill" ) ||
! strcmp( command, "error" ) )
{
color( fl_color_average( FL_BLACK, FL_RED, 0.50 ) );
}
else if ( ! strcmp( command, "stopped" ) )
{
stopped( 1 );
}
else
{
color( fl_color_average( FL_BLACK, FL_YELLOW, 0.50 ) );
}
redraw();
}
static void
cb_button ( Fl_Widget *o, void * v )
{
((NSM_Client*)v)->cb_button( o );
}
void
cb_button ( Fl_Widget *o )
{
if ( o == _dirty )
{
MESSAGE( "Sending save.");
foreach_daemon ( d )
{
osc->send( (*d)->addr, "/nsm/gui/client/save", _client_id );
}
}
else if ( o == _gui )
{
MESSAGE( "Sending hide/show GUI.");
foreach_daemon ( d )
{
if ( !_gui->value() )
osc->send( (*d)->addr, "/nsm/gui/client/show_optional_gui", _client_id );
else
osc->send( (*d)->addr, "/nsm/gui/client/hide_optional_gui", _client_id );
}
}
else if ( o == _remove_button )
{
MESSAGE( "Sending remove.");
foreach_daemon ( d )
{
osc->send( (*d)->addr, "/nsm/gui/client/remove", _client_id );
}
}
else if ( o == _restart_button )
{
MESSAGE( "Sending resume" );
foreach_daemon ( d )
{
osc->send( (*d)->addr, "/nsm/gui/client/resume", _client_id );
}
}
else if ( o == _kill_button )
{
MESSAGE( "Sending stop" );
foreach_daemon ( d )
{
osc->send( (*d)->addr, "/nsm/gui/client/stop", _client_id );
}
}
}
const char *
client_id ( void )
{ return _client_id; }
NSM_Client ( int X, int Y, int W, int H, const char *L ) :
Fl_Group( X, Y, W, H, L )
{
_client_id = NULL;
_client_name = NULL;
_client_label = NULL;
align( FL_ALIGN_LEFT | FL_ALIGN_INSIDE );
color( fl_darker( FL_RED ) );
box( FL_UP_FRAME );
int yy = Y + H * 0.25;
int hh = H * 0.50;
int xx = X + W - ( 75 + Fl::box_dw( box() ) );
int ss = 2;
/* /\* dummy group *\/ */
/* { Fl_Group *o = new Fl_Group( X, Y, W, H ); */
/* o->end(); */
/* resizable( o ); */
/* } */
{ Fl_Pack *o = new Fl_Pack( X + 15, Y, 300 - 5, H );
o->type( FL_HORIZONTAL );
o->spacing( 10 );
{ icon_box = new Fl_Box( 0, 0, 32, 32 );
}
{ Fl_Box *o = client_name = new Fl_Box( 0, 0, 300, 48 );
/* o->color( FL_BLUE ); */
o->align( FL_ALIGN_INSIDE | FL_ALIGN_LEFT );
o->labeltype( FL_NORMAL_LABEL );
}
o->end();
}
{ Fl_Box *o = new Fl_Box( X + 300, Y, 100, h() );
Fl_Group::current()->resizable(o);
}
{ Fl_Progress *o = _progress = new Fl_Progress( xx, Y + H * 0.25, 75, H * 0.50, NULL );
o->box( FL_FLAT_BOX );
o->color( FL_BLACK );
o->copy_label( "launch" );
o->labelsize( 12 );
o->minimum( 0.0f );
o->maximum( 1.0f );
}
{ Fl_Group *o = new Fl_Group( X + W - 400, Y, 400, H );
xx -= 50 + ss;
{ Fl_Light_Button *o = _dirty = new Fl_Light_Button( xx, yy, 50, hh, "SAVE" );
o->align( FL_ALIGN_LEFT | FL_ALIGN_INSIDE );
o->labelsize( 9 );
o->box( FL_UP_BOX );
o->type(0);
o->color();
o->selection_color( FL_YELLOW );
o->value( 0 );
o->callback( cb_button, this );
}
xx -= 40 + ss;
{ Fl_Light_Button *o = _gui = new Fl_Light_Button( xx, yy, 40, hh, "GUI" );
o->align( FL_ALIGN_LEFT | FL_ALIGN_INSIDE );
o->labelsize( 9 );
o->box( FL_UP_BOX );
o->type(0);
o->color();
o->selection_color( FL_YELLOW );
o->value( 0 );
o->hide();
o->callback( cb_button, this );
}
xx -= 25 + ss;
{ Fl_Button *o = _kill_button = new Fl_Button( xx, yy, 25, hh, "@square" );
o->labelsize( 9 );
o->box( FL_UP_BOX );
o->type(0);
// o->color( FL_RED );
o->value( 0 );
o->tooltip( "Stop" );
o->callback( cb_button, this );
}
xx -= 25 + ss;
{ Fl_Button *o = _restart_button = new Fl_Button( xx, yy, 25, hh );
o->box( FL_UP_BOX );
o->type(0);
// o->color( FL_GREEN );
o->value( 0 );
o->label( "@>" );
o->tooltip( "Resume" );
o->hide();
o->callback( cb_button, this );
}
xx -= 25 + ss;
{ Fl_Button *o = _remove_button = new Fl_Button( xx, yy, 25, hh );
o->box( FL_UP_BOX );
o->type(0);
// o->color( FL_RED );
o->value( 0 );
o->label( "X" );
o->tooltip( "Remove" );
o->hide();
o->callback( cb_button, this );
}
o->end();
}
end();
}
~NSM_Client ( )
{
if ( _client_id )
{
free( _client_id );
_client_id = NULL;
}
if ( _client_name )
{
free( _client_name );
_client_name = NULL;
}
if ( _client_label )
{
free( _client_label );
_client_label = NULL;
}
if ( label() )
{
free( (char*)label() );
label( NULL );
}
}
};
static
void
fl_awake_alert( void *v )
{
if ( v )
{
fl_alert( "%s", (char*)v );
free( v );
}
}
void
browser_callback ( Fl_Widget *w, void * )
{
w->window()->hide();
}
class NSM_Controller : public Fl_Group
{
Fl_Text_Display *status_display;
public:
Fl_Pack *clients_pack;
Fl_Pack *buttons_pack;
Fl_Button *close_button;
Fl_Button *abort_button;
Fl_Button *save_button;
Fl_Button *open_button;
Fl_Button *new_button;
Fl_Button *add_button;
Fl_Button *duplicate_button;
Fl_Button *quit_button;
Fl_Button *refresh_button;
Fl_Box *session_name_box;
Fl_Tree *session_browser;
int status_lines;
static void cb_handle ( Fl_Widget *w, void *v )
{
((NSM_Controller*)v)->cb_handle( w );
}
void log_status ( const char *s )
{
time_t now;
now = time( NULL );
struct tm * tm = localtime( &now );
char *ts;
asprintf( &ts, "%02i:%02i:%02i ", tm->tm_hour, tm->tm_min, tm->tm_sec );
status_display->buffer()->append( ts );
free( ts );
status_display->buffer()->append( s );
status_display->scroll( ++status_lines, 0 );
status_display->buffer()->append( "\n" );
}
void
cb_handle ( Fl_Widget *w )
{
if ( w == abort_button )
{
if ( 0 == fl_choice( "Are you sure you want to abort this session? Unsaved changes will be lost.", "Abort", "Cancel", NULL ) )
{
MESSAGE( "Sending abort." );
foreach_daemon ( d )
{
osc->send( (*d)->addr, "/nsm/server/abort" );
}
}
}
if ( w == close_button )
{
MESSAGE( "Sending close." );
foreach_daemon ( d )
{
osc->send( (*d)->addr, "/nsm/server/close" );
}
}
else if ( w == save_button )
{
MESSAGE( "Sending save." );
foreach_daemon ( d )
{
osc->send( (*d)->addr, "/nsm/server/save" );
}
}
else if ( w == open_button )
{
const char *name = fl_input( "Open Session", NULL );
if ( ! name )
return;
Fl_Tree_Item *item = session_browser->find_item( name );
if ( item )
session_browser->select_only( item, 1 );
}
else if ( w == duplicate_button )
{
const char *name = fl_input( "New Session", NULL );
if ( ! name )
return;
MESSAGE( "Sending duplicate for: %s", name );
foreach_daemon ( d )
{
osc->send( (*d)->addr, "/nsm/server/duplicate", name );
}
}
else if ( w == quit_button )
{
window()->do_callback( window(), this );
}
else if ( w == refresh_button )
{
session_browser->clear();
session_browser->redraw();
MESSAGE( "Refreshing session list." );
foreach_daemon ( d )
{
osc->send( (*d)->addr, "/nsm/server/list" );
}
}
else if ( w == session_browser )
{
if ( session_browser->callback_reason() != FL_TREE_REASON_SELECTED )
return;
Fl_Tree_Item *item = session_browser->callback_item();
// session_browser->deselect( item, 0 );
if ( item->children() )
return;
char name[1024];
session_browser->item_pathname( name, sizeof(name), item );
foreach_daemon ( d )
{
osc->send( (*d)->addr, "/nsm/server/open", name );
}
}
else if ( w == new_button )
{
const char *name = fl_input( "New Session", NULL );
if ( !name )
return;
MESSAGE( "Sending new for: %s", name );
foreach_daemon ( d )
{
osc->send( (*d)->addr, "/nsm/server/new", name );
}
}
else if ( w == add_button )
{
Fl_Select_Browser *browser;
if ( daemon_list.size() > 1 )
{
Fl_Window* win = new Fl_Window( window()->x(), window()->y(), 300, 400, "Choose Server" );
{
{
Fl_Box *o = new Fl_Box( 0,0, 300, 100 );
o->label( "Connected to multiple NSM servers, please select which one to add a client to." );
o->align( FL_ALIGN_CENTER | FL_ALIGN_INSIDE | FL_ALIGN_WRAP );
}
{
Fl_Select_Browser *o = browser = new Fl_Select_Browser( 0, 100, 300, 300 );
o->box( FL_ROUNDED_BOX );
o->color( FL_BLACK );
o->callback( browser_callback, win );
foreach_daemon( d )
{
o->add( (*d)->url );
}
}
}
win->end();
win->show();
while ( win->visible() )
{
Fl::wait();
}
if ( ! browser->value() )
return;
const char *n = fl_input( "Enter executable name" );
if ( !n )
return;
char *name = strdup( n );
if ( index( name, ' ' ) )
{
free( name );
name = strdup( "nsm-proxy" );
}
lo_address nsm_addr = lo_address_new_from_url( browser->text( browser->value() ) );
osc->send( nsm_addr, "/nsm/server/add", name );
free( name );
delete win;
}
else
{
const char *n = fl_input( "Enter executable name" );
if ( !n )
return;
char *name = strdup( n );
if ( index( name, ' ' ) )
{
free( name );
name = strdup( "nsm-proxy" );
}
MESSAGE( "Sending add for: %s", name );
/* FIXME: user should get to choose which system to do the add on */
foreach_daemon ( d )
{
osc->send( (*d)->addr, "/nsm/server/add", name );
}
free( name );
}
}
}
NSM_Client *
client_by_id ( const char *id )
{
for ( int i = clients_pack->children(); i--; )
{
NSM_Client *c = (NSM_Client*)clients_pack->child( i );
if ( ! strcmp( c->client_id(), id ) )
{
return c;
}
}
return NULL;
}
const char *session_name ( void ) const
{
return session_name_box->label();
}
void
session_name ( const char *name )
{
session_name_box->copy_label( name );
if ( strlen( name ) )
{
save_button->activate();
add_button->activate();
duplicate_button->activate();
abort_button->activate();
close_button->activate();
}
else
{
save_button->deactivate();
add_button->deactivate();
duplicate_button->deactivate();
abort_button->deactivate();
close_button->deactivate();
}
redraw();
}
void
client_stopped ( const char *client_id )
{
NSM_Client *c = client_by_id( client_id );
if ( c )
{
c->stopped( 1 );
}
}
void
client_quit ( const char *client_id )
{
NSM_Client *c = client_by_id( client_id );
if ( c )
{
clients_pack->remove( c );
delete c;
}
if ( clients_pack->children() == 0 )
{
((Fl_Packscroller*)clients_pack->parent())->yposition( 0 );
}
parent()->redraw();
}
void
client_new ( const char *client_id, const char *client_name )
{
NSM_Client *c;
c = client_by_id( client_id );
if ( c )
{
c->name( client_name );
return;
}
c = new NSM_Client( 0, 0, w(), 40, NULL );
c->name( client_name );
c->client_id( client_id );
c->stopped( 0 );
clients_pack->add( c );
redraw();
}
void client_pending_command ( NSM_Client *c, const char *command )
{
if ( c )
{
if ( ! strcmp( command, "removed" ) )
{
clients_pack->remove( c );
delete c;
parent()->redraw();
}
else
c->pending_command( command );
}
}
void add_session_to_list ( const char *name )
{
session_browser->add( name );
session_browser->redraw();
}
NSM_Controller ( int X, int Y, int W, int H, const char *L ) :
Fl_Group( X, Y, W, H, L )
{
status_lines = 0;
align( FL_ALIGN_RIGHT | FL_ALIGN_CENTER | FL_ALIGN_INSIDE );
{ Fl_Pack *o = buttons_pack = new Fl_Pack( X, Y, W, 30 );
o->type( Fl_Pack::HORIZONTAL );
o->box( FL_NO_BOX );
{ Fl_Button *o = quit_button = new Fl_Button( 0, 0, 80, 50, "&Quit" );
o->shortcut( FL_CTRL | 'q' );
o->box( FL_UP_BOX );
o->callback( cb_handle, (void*)this );
}
{ Fl_Button *o = refresh_button = new Fl_Button( 0, 0, 80, 50, "&Refresh" );
o->shortcut( FL_CTRL | 'r' );
o->box( FL_UP_BOX );
o->callback( cb_handle, (void*)this );
}
{ Fl_Button *o = open_button = new Fl_Button( 0, 0, 80, 50, "&Open" );
o->shortcut( FL_CTRL | 'o' );
o->box( FL_UP_BOX );
o->callback( cb_handle, (void*)this );
}
{ Fl_Button *o = close_button = new Fl_Button( 0, 0, 80, 50, "Close" );
o->shortcut( FL_CTRL | 'q' );
o->box( FL_UP_BOX );
o->callback( cb_handle, (void*)this );
}
{ Fl_Button *o = abort_button = new Fl_Button( 0, 0, 80, 50, "Abort" );
o->box( FL_UP_BOX );
o->color( fl_color_average( FL_RED, fl_rgb_color(10,10,10), 0.5f ) );
o->callback( cb_handle, (void*)this );
}
{ Fl_Button *o = save_button = new Fl_Button( 0, 0, 80, 50, "&Save" );
o->shortcut( FL_CTRL | 's' );
o->box( FL_UP_BOX );
o->callback( cb_handle, (void*)this );
}
{ Fl_Button *o = new_button = new Fl_Button( 0, 0, 80, 50, "&New" );
o->shortcut( FL_CTRL | 'n' );
o->box( FL_UP_BOX );
o->callback( cb_handle, (void*)this );
}
{ Fl_Button *o = duplicate_button = new Fl_Button( 0, 0, 100, 50, "Duplicate" );
o->box( FL_UP_BOX );
o->callback( cb_handle, (void*)this );
}
o->end();
}
int SH = 14;
{ Fl_Tile *o = new Fl_Tile( X, Y + 30, W, H - 30 );
{ Fl_Scalepack *o = new Fl_Scalepack( X, Y + 30, 300, H - ( 30 + SH ) );
o->type( FL_VERTICAL );
o->spacing( 2 );
{ new Fl_Box( 0,0,100, 24, "Sessions" );
}
{
Fl_Tree *o = session_browser = new Fl_Tree( X, Y + 50, W / 3, H - ( 50 + SH ) );
o->callback( cb_handle, (void *)this );
o->color( FL_DARK1 );
o->item_labelbgcolor( o->color() );
o->item_labelfgcolor( FL_FOREGROUND_COLOR );
o->sortorder( FL_TREE_SORT_ASCENDING );
o->showroot( 0 );
o->selection_color( fl_darker( FL_GREEN ) );
o->selectbox( FL_UP_FRAME );
o->box( FL_FLAT_BOX );
/* o->label( "Sessions" ); */
o->end();
Fl_Group::current()->resizable( o );
} // Fl_Tree
o->end();
}
Fl_Scalepack *scalepack;
{ Fl_Scalepack *o = scalepack = new Fl_Scalepack( X + 300, Y + 30, W - 300, H - ( 30 + SH ) );
o->type( FL_VERTICAL );
o->spacing( 2 );
{ session_name_box = new Fl_Box( 0, 0, 100, 25, "" );
}
{ Fl_Button *o = add_button = new Fl_Button( 0, 0, 100, 25, "&Add Client to Session" );
o->shortcut( FL_CTRL | 'a' );
o->box( FL_UP_BOX );
o->align( FL_ALIGN_CLIP );
o->callback( cb_handle, (void*)this );
}
{
Fl_Packscroller *o = new Fl_Packscroller( 0, 0, 100, H - ( 30 + SH ) );
o->align( FL_ALIGN_TOP );
o->labeltype( FL_SHADOW_LABEL );
{
Fl_Pack *o = clients_pack = new Fl_Pack( 0, 0, 100, 100 );
o->align( FL_ALIGN_TOP );
o->spacing( 4 );
o->type( Fl_Pack::VERTICAL );
o->end();
}
o->end();
Fl_Group::current()->resizable( o );
} // Fl_Packscroller
o->end();
/* Fl_Group::current()->resizable( o ); */
} // Fl_Scalepack
{ Fl_Box *o = new Fl_Box( X + 300, Y + 30, 100, H - ( 30 + SH ));
Fl_Group::current()->resizable(o);
}
{ Fl_Text_Display *o = status_display = new Fl_Text_Display( X, Y + H - SH, W, SH );
o->color( FL_DARK1 );
o->textcolor( FL_FOREGROUND_COLOR );
o->box( FL_UP_BOX );
o->textfont( FL_COURIER );
o->textsize( 10 );
Fl_Text_Buffer *b = new Fl_Text_Buffer();
o->buffer(b);
}
o->end();
resizable( o );
} // Fl_tile
end();
deactivate();
}
int min_h ( void )
{
return 500;
}
void
ping ( void )
{
if ( daemon_list.size() )
{
foreach_daemon( d )
{
osc->send( (*d)->addr, "/osc/ping" );
}
}
if ( last_ping_response )
{
if ( time(NULL) - last_ping_response > 10 )
{
if ( active() )
{
deactivate();
log_status( "Server is not responding..." );
}
}
else
{
if ( !active() )
{
log_status( "Server is back." );
activate();
}
}
}
}
int init_osc ( void )
{
osc = new OSC::Endpoint();
if ( int r = osc->init( LO_UDP ) )
return r;
osc->owner = this;
osc->add_method( "/error", "sis", osc_handler, osc, "msg" );
osc->add_method( "/reply", "ss", osc_handler, osc, "msg" );
osc->add_method( "/reply", "s", osc_handler, osc, "" );
osc->add_method( "/nsm/server/broadcast", NULL, osc_broadcast_handler, osc, "msg" );
osc->add_method( "/nsm/gui/server_announce", "s", osc_handler, osc, "msg" );
osc->add_method( "/nsm/gui/server/message", "s", osc_handler, osc, "msg" );
osc->add_method( "/nsm/gui/gui_announce", "s", osc_handler, osc, "msg" );
osc->add_method( "/nsm/gui/session/session", "s", osc_handler, osc, "path,display_name" );
osc->add_method( "/nsm/gui/session/name", "ss", osc_handler, osc, "path,display_name" );
osc->add_method( "/nsm/gui/client/new", "ss", osc_handler, osc, "path,display_name" );
osc->add_method( "/nsm/gui/client/status", "ss", osc_handler, osc, "path,display_name" );
osc->add_method( "/nsm/gui/client/switch", "ss", osc_handler, osc, "path,display_name" );
osc->add_method( "/nsm/gui/client/progress", "sf", osc_handler, osc, "path,display_name" );
osc->add_method( "/nsm/gui/client/dirty", "si", osc_handler, osc, "path,display_name" );
osc->add_method( "/nsm/gui/client/has_optional_gui", "s", osc_handler, osc, "path,display_name" );
osc->add_method( "/nsm/gui/client/gui_visible", "si", osc_handler, osc, "path,display_name" );
osc->add_method( "/nsm/gui/client/label", "ss", osc_handler, osc, "path,display_name" );
osc->start();
return 0;
}
void announce ( const char *nsm_url )
{
/* Daemon *d = new Daemon; */
/* d->url = nsm_url; */
lo_address nsm_addr = lo_address_new_from_url( nsm_url );
// d->is_child = true;
/* daemon_list.push_back( d ); */
osc->send( nsm_addr, "/nsm/gui/gui_announce" );
}
private:
static int osc_broadcast_handler ( const char *path, const char *, lo_arg **, int argc, lo_message msg, void * )
{
if ( ! argc )
/* need at least one argument... */
return 0;
DMESSAGE( "Relaying broadcast" );
foreach_daemon( d )
{
char *u1 = lo_address_get_url( (*d)->addr );
char *u2 = lo_address_get_url( lo_message_get_source( msg ) );
if ( strcmp( u1, u2 ) )
{
osc->send( (*d)->addr, path, msg );
}
free( u1 );
free( u2 );
}
return 0;
}
static int osc_handler ( const char *path, const char *types, lo_arg **argv, int argc, lo_message msg, void *user_data )
{
// OSC_DMSG();
NSM_Controller *controller = (NSM_Controller*)((OSC::Endpoint*)user_data)->owner;
Fl::lock();
if ( !strcmp( path, "/nsm/gui/server/message" ) && !strcmp( types, "s" ) )
{
controller->log_status( &argv[0]->s );
}
else if ( !strcmp( path, "/nsm/gui/session/session" ) &&
! strcmp( types, "s" ) )
{
controller->add_session_to_list( &argv[0]->s );
}
else if ( !strcmp( path, "/nsm/gui/gui_announce" ) )
{
/* pre-existing server is replying to our announce message */
controller->activate();
lo_address nsm_addr = lo_message_get_source( msg );
osc->send( nsm_addr, "/nsm/server/list" );
}
else if ( !strcmp( path, "/nsm/gui/server_announce" ) )
{
/* must be a server we launched */
controller->activate();
Daemon *d = new Daemon;
d->url = lo_address_get_url( lo_message_get_source( msg ) );
d->addr = lo_address_new_from_url( d->url );
d->is_child = true;
daemon_list.push_back( d );
osc->send( d->addr, "/nsm/server/list" );
}
else if ( !strcmp( path, "/nsm/gui/session/name" ) &&
!strcmp( types, "ss" ))
{
controller->session_name( &argv[0]->s );
if ( !strcmp( &argv[0]->s, "" ) )
{
controller->session_browser->deselect_all();
}
else
{
Fl_Tree_Item *o = controller->session_browser->find_item( &argv[1]->s );
if ( o )
{
controller->session_browser->select_only( o, 0 );
controller->session_browser->show_item( o, 0 );
}
}
}
else if (!strcmp( path, "/error" ) &&
!strcmp( types, "sis" ) )
{
int err = argv[1]->i;
if ( err != 0 )
{
char *s;
asprintf( &s, "Command %s failed with:\n\n%s", &argv[0]->s, &argv[2]->s );
Fl::awake(fl_awake_alert, s);
}
}
else if (!strcmp( path, "/reply" ) && argc && 's' == *types )
{
if ( !strcmp( &argv[0]->s, "/nsm/server/list" ) )
{
controller->add_session_to_list( &argv[1]->s );
}
else if ( !strcmp( &argv[0]->s, "/osc/ping" ) )
{
last_ping_response = time( NULL );
}
else if ( ! strcmp( types, "ss" ) )
{
MESSAGE( "%s says %s", &argv[0]->s, &argv[1]->s);
controller->log_status( &argv[1]->s );
}
}
if ( !strncmp( path, "/nsm/gui/client/", strlen( "/nsm/gui/client/" ) ) )
{
if ( !strcmp( path, "/nsm/gui/client/new" ) &&
!strcmp( types, "ss" ) )
{
controller->client_new( &argv[0]->s, &argv[1]->s );
}
else
{
NSM_Client *c = controller->client_by_id( &argv[0]->s );
if ( c )
{
if ( !strcmp( path, "/nsm/gui/client/status" ) &&
!strcmp( types, "ss" ))
{
controller->client_pending_command( c, &argv[1]->s );
}
else if ( !strcmp( path, "/nsm/gui/client/progress" ) &&
!strcmp( types, "sf" ))
{
c->progress( argv[1]->f );
}
else if ( !strcmp( path, "/nsm/gui/client/dirty" ) &&
!strcmp( types, "si" ))
{
c->dirty( argv[1]->i );
}
else if ( !strcmp( path, "/nsm/gui/client/gui_visible" ) &&
!strcmp( types, "si" ))
{
c->gui_visible( argv[1]->i );
}
else if ( !strcmp( path, "/nsm/gui/client/label" ) &&
!strcmp( types, "ss" ))
{
c->client_label( &argv[1]->s );
}
else if ( !strcmp( path, "/nsm/gui/client/has_optional_gui" ) &&
!strcmp( types, "s" ))
{
c->has_optional_gui();
}
else if ( !strcmp( path, "/nsm/gui/client/switch" ) &&
!strcmp( types, "ss" ))
{
c->client_id( &argv[1]->s );
}
}
else
MESSAGE( "Got message %s from unknown client", path );
}
}
Fl::unlock();
Fl::awake();
return 0;
}
};
static NSM_Controller *controller;
void
ping ( void * )
{
controller->ping();
Fl::repeat_timeout( 1.0, ping, NULL );
}
void
cb_main ( Fl_Widget *, void * )
{
if ( Fl::event_key() != FL_Escape )
{
int children = 0;
foreach_daemon ( d )
{
if ( (*d)->is_child )
++children;
}
if ( children )
{
if ( strlen( controller->session_name() ) )
{
fl_message( "%s", "You have to close the session before you can quit." );
return;
}
}
while ( Fl::first_window() ) Fl::first_window()->hide();
}
}
int
main (int argc, char **argv )
{
fl_register_images();
Fl::lock();
Fl_Double_Window *main_window;
{
Fl_Double_Window *o = main_window = new Fl_Double_Window( 800, 600, APP_TITLE );
{
main_window->xclass( APP_NAME );
Fl_Widget *o = controller = new NSM_Controller( 0, 0, main_window->w(), main_window->h(), NULL );
controller->session_name( "" );
Fl_Group::current()->resizable(o);
}
o->end();
o->size_range( main_window->w(), controller->min_h(), 0, 0 );
o->callback( (Fl_Callback*)cb_main, main_window );
o->show( 0, NULL );
}
static struct option long_options[] =
{
{ "nsm-url", required_argument, 0, 'n' },
{ "help", no_argument, 0, 'h' },
{ 0, 0, 0, 0 }
};
int option_index = 0;
int c = 0;
while ( ( c = getopt_long_only( argc, argv, "", long_options, &option_index ) ) != -1 )
{
switch ( c )
{
case 'n':
{
DMESSAGE( "Adding %s to daemon list", optarg );
Daemon *d = new Daemon;
d->url = optarg;
d->addr = lo_address_new_from_url( optarg );
daemon_list.push_back( d );
break;
}
case 'h':
printf( "Usage: %s [--nsm-url...] [-- server options ]\n\n", argv[0] );
exit(0);
break;
}
}
const char *nsm_url = getenv( "NSM_URL" );
if ( nsm_url )
{
MESSAGE( "Found NSM URL of \"%s\" in environment, attempting to connect.", nsm_url );
Daemon *d = new Daemon;
d->url = nsm_url;
d->addr = lo_address_new_from_url( nsm_url );
daemon_list.push_back( d );
}
if ( controller->init_osc() )
FATAL( "Could not create OSC server" );
if ( daemon_list.size() )
{
foreach_daemon ( d )
{
controller->announce( (*d)->url );
}
}
else
{
/* start a new daemon... */
MESSAGE( "Starting daemon..." );
char *url = osc->url();
if ( ! fork() )
{
/* pass non-option arguments on to daemon */
char *args[4 + argc - optind];
int i = 0;
args[i++] = strdup("nsmd");
args[i++] = strdup("--gui-url");
args[i++] = url;
for ( ; optind < argc; i++, optind++ )
{
DMESSAGE( "Passing argument: %s", argv[optind] );
args[i] = argv[optind];
}
args[i] = 0;
if ( -1 == execvp( "nsmd", args ) )
{
FATAL( "Error starting process: %s", strerror( errno ) );
}
}
free(url);
}
Fl::add_timeout( 1.0, ping, NULL );
Fl::run();
foreach_daemon ( d )
{
if ( (*d)->is_child )
{
MESSAGE( "Telling server to quit" );
osc->send( (*d)->addr, "/nsm/server/quit" );
}
}
return 0;
}
| 2024-05-18T01:26:18.401715 | https://example.com/article/4676 |
Crystal Meanings | Are they Dependable?
Do you in finding that your standard crystal meanings and standard go-to correspondences are loyal?
For instance, has your go-to rose quartz or amethyst been as dependable nowadays? I’m no longer essentially asking in the event that they’re “weaker,” however are they no longer operating for you in the best way that you simply’ve come to depend on?
I’m asking as a result of in all of the years I’ve been operating with and researching crystals, that is the primary time I’ve spotted the sort of large shift and plenty of others (scholars, graduates and such a lot of in our Crystal Circle of relatives) have introduced this to my consideration too.
In a contemporary ballot I did; 82% mentioned that is the case for them. Whoa! That’s so much.
Crystals are hundreds of thousands of years previous, some are even billions of years previous. That’s only a drop within the bucket, within the grand scheme of a crystal’s existence cycle. Proper? So, most likely this shift in calories many people are experiencing is simply a part of a herbal cycle. It is also a metamorphosis in sure crystals’ vibrational frequencies. I’ll get into the “why” of that during just a little right here.
Crystal Meanings – Influenced By means of Lively Shifts?
Citrine (The Baked Selection)
I’ve spotted in recent times that the baked number of Citrine turns out to have lowered with recognize to its energy. Now, the baked number of citrine is probably the most broadly to be had. It has extra of that orange tint to it. You’d be hard-pressed to seek out a big geode that’s real-deal citrine.
Me? I wish to keep away from man-made and man-altered up to conceivable, Babe.
Congo and Brazil citrine, now right here’s a unique animal! Each totally herbal and I like ’em. With those sorts ts of citrine, I’ve if truth be told discovered their energy to be amp’ed up. Brazil citrine is a superb crystal to select up, more cost effective than Congo citrine, on the other hand, tougher to spot it from the faux stuff for some.
Rose Quartz
Now, this is an engaging one. I don’t individually in finding this to be true for myself, however a lot of our Crystal Circle of relatives Individuals are announcing that Rose Quartz is now not serving to with issues of the guts. Which, as you understand, is one thing it’s broadly believed to affect. Once more, no longer my non-public revel in with this crystal on the mo’ however it’s obviously going down to others. So, famous!
Veracruz Amethyst
Veracruz Amethyst is historically a go-to for calming the thoughts; a very good stone to paintings with when searching for help with meditation. Then again, this doesn’t appear to be the case anymore. Is that this true for you? This is probably not true for everyone around the board, simply one thing that I’ve spotted.
Selenite
The way in which I take advantage of Selenite has modified as smartly. I’ve discovered that nowadays, I experience meditating with selenite. Which may be very bizarre as a result of I used to make use of Veracruz amethyst to try this.
Reason why is: selenite’s standard mega-impact upper frequency calories has appeared to have diminished its amplitude and calmed down fairly a little bit. I think like this can be a highest instance of the way a crystal isn’t essentially weaker however as a substitute operating extraordinarily smartly in every other capability.
Moldavite
Moldavite is a crystal that’s historically thought to be to be super-high calories. Then again, in recent times, I and plenty of others have discovered it to be missing on this high quality. Which I’m positive you could possibly agree is fairly abnormal for moldavite.
Different Crystals Experiencing a Imaginable Power Shift
K2 Granite – aka K2 “jasper” has a grey and white modeled background with the gorgeous blue azurite spots in it. Oddly sufficient it kind of feels to have began to darken, which might point out that there’s an intense calories alternate going down with it.
Herkimer Diamond – but every other person who appears to be all of sudden missing with regard to its calories; lackluster, dampened
Smokey Quartz – a crystal that was once recognized for a gentler de-toxing calories. Lately numerous individuals are relating to it as their go-to crystal for full of life calories and excessive focal point; a brand new widespread fav too, while previously it was once no longer as widespread.
Cosmic Shifts
There’ve been some mega-energy shifts impacting no longer simply Earth however our whole Sun Device. I’m positive you’ve heard a lot of folks carry up the subject of local weather trade. Then again, local weather trade isn’t particular to Earth, ya know. It’s going down on quite a few different planets as smartly. The calories converting our Sun Device is clearly impacting (evolving) the energetics of our planet, Mama Earth. Because of this that Earth’s crystal beds are being impacted as smartly.
What might be inflicting most of these adjustments?
Smartly, scientists have lately came upon that gamma-ray ranges achieving our planet, have greater significantly. Those bursts of cosmic rays come from large supernovae, quasars, all varieties of cosmic resources we’re surrounded through in house.
three Causes Why our Publicity to Cosmic Rays is at the Upward push
We’re within the Trendy Grand Sun Minimal
That means our Solar is in a state relative minimum task (few sunspots, prominences, flares, and many others). When our Solar is in a state of excessive task it creates an excessively robust protecting magnetic box.
Then, the Milky Means, as an entire, is spinning across the black hollow on the heart of the galaxy. Our Solar, too, travels in a spiral trail throughout the Milky Means, bringing all the planets that orbit it alongside for the journey. I LOVE how this video is helping us visualize our Sun Device’s vortex-voyage throughout the Milky Means galaxy:
SUPER-COOL! Proper?
As we vortex throughout the galaxy we’re now getting into a brand new zone, what we check with because the “Native Bubble”; a brand new house of the Milky Means the place it’s a form of void; there’s much less cosmic fuel and dirt on this “bubble” that will generally act as an extra protecting defend from the ones out of doors cosmic rays.
Graphic of The Native Bubble through NASA; changed from unique model through Consumer:Geni – http://science.nasa.gov/headlines/y2003/06jan_bubble.htm (at the beginning uploaded to en.wikipedia right here), Public Area, https://commons.wikimedia.org/w/index.php?curid=3280837
Hyperlinks to the Evidence
Informed ya I’d carry the receipts! 😉
Cosmic Power Transferring and The way it Impacts Us + Crystals
Can cosmic rays influence DNA? Sure. And it’s came about a couple of occasions previously.
However, those rays can influence extra than simply DNA; they are able to spark volcanoes, earthquakes, and different tectonic task.
Right here’s the vital bit that without delay affects the crystals: scientists imagine the explanation cosmic rays influence tectonic task is that cosmic ray debris skinny out the silica-rich magma layer.
Because the temperature will increase, the calories additionally will increase. That means the silica-rich magma layer turns into thinner. So, there’s been a metamorphosis within the calories provide at an atomic and molecular stage!
So, principally, the shift we’re all feeling, the crystals are feeling as smartly.
The phrase “silica” refers to silicon dioxide (SiO2), which is what quartz is made from. (Amethyst is simply silicon dioxide with the extra inclusion of iron.) Additionally, I will have to point out that silicates are minerals that experience silica in it. That means it’s no longer simply silicon dioxide; it might be any mineral that has silica in it like black tourmaline. Silicates make up a lot of our crystals and scientists are giving us the knowledge that the cosmic rays are without delay impacting, scaling down the silica-rich magma and the silicates… all pointing to the opportunity of the silicates being the crystals maximum suffering from all of this.
Mild = Knowledge
I think those cosmic rays (gentle angles or “Angels” of Mild) lift inside of their light-encoded frequencies, data; equivalent to new methods and transformative overtones presenting themselves as DNA upgrades and crystal atomic reworking. That means, some crystals will likely be downloading superb intel!
Cosmic rays UPGRADE and alter all subject, together with crystals AND our DNA.
Additionally, let me deal with the ultimate a part of that observation relating to DNA: I’m positive some folks could be a little bit involved through the considered a metamorphosis in our DNA. I don’t really feel that is essentially harmful to our DNA… or our crystals.
Top-frequency cosmic rays are totally other from different man-made sorts of high-frequency radiation that may harm our DNA.
What I’m sayin’ is there’s a BIG DIFFERENCE between man-created and Supply-created high-frequency rays. So, you received’t in finding maximum scientists backing up that observation however this comes from a deep interior realizing:
Cosmic rays are Supply-created, and due to this fact flawless, arranged data.
If Our Crystals Exchange…
The overall level I need to depart you with is that this…
If our crystals are converting we would possibly wish to re-learn find out how to engage with them transferring ahead; spend a while getting to grasp them far and wide once more. (And I very a lot look ahead to that have.)
That’s in reality all it comes all the way down to, and that’s precisely why I don’t educate my scholars to memorize crystal meanings or correspondences in my Qualified Crystal Healer Route.
I’d love to grasp, have you ever spotted that one of the most crystals you’re employed with have had an lively shift, appear other, extra robust or just now not give you the results you want? Let me know within the feedback down under! The extra enter we get from every different, the extra we will be able to jointly be taught and develop.
Crystal Blessings,
P.S. For those who’re fascinated with enrolling in my Qualified Crystal Healer Route, you’ll be able to in finding out extra + get on my Wait Checklist right here. There are some thrilling issues are going down RIGHT NOW that you most likely don’t need to fail to spot! | 2023-12-17T01:26:18.401715 | https://example.com/article/6467 |
In the normal operation of a diesel engine atmospheric air is first compressed in the combustion chamber of the engine to a pressure of about 500 PSI. Compression of the air raises its temperature to about 1,000.degree. F. Diesel fuiel is then injected to the compressed hot air through a fuel injection nozzle. The fuel is atomized in the combustion chamber where it rises to its auto ignition temperature, resulting in the spontaneous ignition, burning, and expansion of the gases in the chamber. The expansion of the combustion products drives the cylinder downwardly thereby providing the power stroke of the engine.
In order for a diesel engine to operate efficiently, i.e., with minimum fuel consumption at maximum power, it typically is operated under air to fuel ratios which produce exhaust gases that contain large amounts of oxygen and usually only minimal amounts of unburned hydrocarbons. Unfortunately, operating a diesel engine for maximum power and efficiency also results in conditions that raise the peak operating temperatures and therefore NO.sub.x emissions. One method for lowering the NO.sub.x emissions is, of course, to bring the exhaust gas into contact with a catalyst capable of reducing the NO.sub.x species in the gas stream. However, for catalysts known to be effective in the diesel exhaust environment, catalytic de-NO.sub.x is usually more effective when reducing species are present in the exhaust gas. In order to generate these species in the engine one normally has to operate at conditions of low peak temperature which are conditions that are directly opposed to what is desired from the standpoint of overall efficient engine operation.
One method for providing reducing species at the catalyst is secondary injection, wherein a hydrocarbon is injected into a diesel engine's cylinder at a fixed crank angle ner the end of the expansion stroke. One problem associated with this method is that the quantity of various reductant molecules required for complete reduction of the NO.sub.x species depends upon engine operating parameters such as engine speed, engine load, and inlet gas (air and exhaust gas recirculation, "EGR") pressure when a compressor is present, and secondary injection at a fixed crank angle makes no provision for adjusting the quantity of injected hydrocarbon in response to changes in engine operating parameters. A second problem associated with secondary injection at a fixed crank angle is that the most effective reductants, i.e. olefins and oxygenates, are not the engine's primary fuel source. A secondary source of these compounds must be provided for the engine for injection of these compounds into the exhaust stream. Still another problem associated with secondary injection at a fixed crank angle is the introduction of high boiling point aromatic molecules into the exhaust. This places an extra burden on the exhaust treatment system because such molecules will contribute to PNA emissions unless they are oxidized to CO.sub.2 and H.sub.2 O.
Accordingly, it is an object of the present invention to provide an approach to operating a diesel engine so as to produce effective NO.sub.x reducing species in a diesel engine's combustion chamber in quantities sufficient for catalytically converting the NO.sub.x present in the engine's exhaust gas. It is further an object of the invention to convert NO.sub.x in the exhaust gas in a way that avoids the constraints normally imposed if these species are to be formed as by-products of normal combustion.
Stated differently, it is an object of the present invention to operate a diesel engine efficiently while generating sufficient organic cracked products, i.e. reducing species, in the combustion chamber for the catalytic reduction of NO.sub.x in the exhaust gas. | 2023-10-26T01:26:18.401715 | https://example.com/article/1776 |
Randomized assessment of delayed intensification and two methods for parenteral methotrexate delivery in childhood B-ALL: Children's Oncology Group Studies P9904 and P9905.
The delayed intensification (DI) enhanced outcome for patients with acute lymphoblastic leukemia (ALL) treated on BFM 76/79 and CCG 105 after a prednisone-based induction. Childrens Oncology Group protocols P9904/9905 evaluated DI via a post-induction randomization for eligible National Cancer Institute (NCI) standard (SR) and high-risk (HR) patients. A second randomization compared intravenous methotrexate (IV MTX) as a 24- (1 g/m2) vs. 4-h (2 g/m2) infusion. NCI SR patients received a dexamethasone-based three-drug and NCI HR/CNS 3 SR patients a prednisone-based four-drug induction. End induction MRD (minimal residual disease) was obtained but did not impact treatment. DI improved the 10-year continuous complete remission (CCR) rate; 75.5 ± 2.5% vs. 81.8 ± 2.2% p = 0.002, whereas MTX administration did not; 4-h 80.8 ± 1.9%; 24-h 81.4 ± 1.9% (p = 0.7780). Overall survival (OS) at 10 years did not differ with DI: 91.4 ± 1.6% vs. 90.9 ± 1.7% (p = 0.25) without but was higher with the 24-h MTX infusion; 4-h 91.1 ± 1.4%; 24-h 93.9 ± 1.2% (p = 0.0209). MRD predicted outcome; 10-year CCR 87.7 ± 2.2 and 82.1 ± 2.5% when MRD was <0.01% with/without DI (p = 0.007) and 54.3 ± 8% and 44 ± 8% for patients with MRD ≥ 0.01% with/without DI (p = 0.11). DI improved CCR for patients with B-ALL with and without end induction MRD. | 2024-04-02T01:26:18.401715 | https://example.com/article/9532 |
# -*- coding: utf-8 -*-
"""
emmett.validators.inside
------------------------
Validators that check presence/absence of given value in a set.
:copyright: 2014 Giovanni Barillari
Based on the web2py's validators (http://www.web2py.com)
:copyright: (c) by Massimo Di Pierro <mdipierro@cs.depaul.edu>
:license: LGPLv3 (http://www.gnu.org/licenses/lgpl.html)
"""
# TODO: check unicode conversions
from .._shortcuts import to_unicode
from ..ctx import current
from ..utils import cachedprop
from .basic import Validator
from .helpers import options_sorter, translate
class inRange(Validator):
def __init__(self, minimum=None, maximum=None, include=(True, False), message=None):
super().__init__(message=message)
self.minimum = minimum
self.maximum = maximum
self.inc = include
def _gt(self, val1, val2, eq=False):
if eq:
return val1 >= val2
return val1 > val2
def _lt(self, val1, val2, eq=False):
if eq:
return val1 <= val2
return val1 < val2
def __call__(self, value):
minimum = self.minimum() if callable(self.minimum) else self.minimum
maximum = self.maximum() if callable(self.maximum) else self.maximum
if (
(minimum is None or self._gt(value, minimum, self.inc[0])) and
(maximum is None or self._lt(value, maximum, self.inc[1]))
):
return value, None
return value, translate(
self._range_error(self.message, minimum, maximum)
)
def _range_error(self, message, minimum, maximum):
if message is None:
message = "Enter a value"
if minimum is not None and maximum is not None:
message += " between {min} and {max}"
elif minimum is not None:
message += " greater than or equal to {min}"
elif maximum is not None:
message += " less than or equal to {max}"
if isinstance(maximum, int):
maximum -= 1
return translate(message).format(min=minimum, max=maximum)
class inSet(Validator):
def __init__(
self,
theset,
labels=None,
multiple=False,
zero=None,
sort=False,
message=None
):
super().__init__(message=message)
self.multiple = multiple
if (
theset and
isinstance(theset, (tuple, list)) and
isinstance(theset[0], (tuple, list)) and
len(theset[0]) == 2
):
self.theset = [str(item) for item, label in theset]
self.labels = [str(label) for item, label in theset]
else:
self.theset = [str(item) for item in theset]
self.labels = labels
self.zero = zero
self.sort = sort
def options(self, zero=True):
if not self.labels:
items = [(k, k) for (i, k) in enumerate(self.theset)]
else:
items = [(k, self.labels[i]) for (i, k) in enumerate(self.theset)]
if self.sort:
items.sort(options_sorter)
if zero and self.zero is not None and not self.multiple:
items.insert(0, ('', self.zero))
return items
def __call__(self, value):
if self.multiple:
if not value:
values = []
elif isinstance(value, (tuple, list)):
values = value
else:
values = [value]
else:
values = [value]
failures = [
x for x in values
if (to_unicode(x) or '') not in self.theset]
if failures and self.theset:
if self.multiple and (value is None or value == ''):
return ([], None)
return value, translate(self.message)
if self.multiple:
if (
isinstance(self.multiple, (tuple, list)) and
not self.multiple[0] <= len(values) < self.multiple[1]
):
return values, translate(self.message)
return values, None
return value, None
class DBValidator(Validator):
def __init__(self, db, tablename, fieldname='id', dbset=None, message=None):
super().__init__(message=message)
self.db = db
self.tablename = tablename
self.fieldname = fieldname
self._dbset = dbset
def __call__(self, value):
raise NotImplementedError
@cachedprop
def table(self):
return self.db[self.tablename]
@cachedprop
def dbset(self):
if self._dbset:
return self._dbset(self.db)
return self.db(self.table)
@cachedprop
def field(self):
return self.table[self.fieldname]
class inDB(DBValidator):
def __init__(
self,
db,
tablename,
fieldname='id',
dbset=None,
label_field=None,
multiple=False,
orderby=None,
message=None
):
super().__init__(
db,
tablename,
fieldname=fieldname,
dbset=dbset,
message=message
)
self.label_field = label_field
self.multiple = multiple
self.orderby = orderby
@cachedprop
def sorting(self):
if callable(self.orderby):
return self.orderby(self.table)
return None
def _get_rows(self):
return self.dbset.select(orderby=self.sorting)
def options(self, zero=True):
records = self._get_rows()
if self.label_field:
items = [(r.id, str(r[self.label_field])) for r in records]
elif self.db[self.tablename]._format:
items = [(r.id, self.db[self.tablename]._format % r) for r in records]
else:
items = [(r.id, r.id) for r in records]
#if self.sort:
# items.sort(options_sorter)
#if zero and self.zero is not None and not self.multiple:
# items.insert(0, ('', self.zero))
return items
def __call__(self, value):
if self.multiple:
values = value if isinstance(value, list) else [value]
records = self.dbset.where(
self.field.belongs(values)
).select(self.field, distinct=True).column(self.field)
if set(values).issubset(set(records)):
return values, None
else:
if self.dbset.where(self.field == value).count():
return value, None
return value, translate(self.message)
class notInDB(DBValidator):
def __call__(self, value):
row = self.dbset.where(
self.field == value
).select(limitby=(0, 1)).first()
if row:
record_id = getattr(current, '_dbvalidation_record_id_', None)
if row.id != record_id:
return value, translate(self.message)
return value, None
| 2024-01-14T01:26:18.401715 | https://example.com/article/5112 |
In vivo absorption of phenytoin from rat small intestine and its inhibition by phlorizin.
In vivo absorption of phenytoin from the small intestine was studied by an in vivo closed segment technique. Phenytoin in concentrations of 1000, 2000, and 4000 mumol/l was administered in dissolved form. Polythylene glycol 4000 was used as a non-absorbable marker. The concentrations of phenytoin in the intestinal lumen, in the mucosa, and in cardiac blood were measured both by spectrophotometry and by gas chromatography. Phenytoin was absorbed very rapidly, and the proportion absorbed increased with increasing dose. Thus, during the first 10 min. about 85 per cent of the largest dose but only 25 per cent of the smallest dose had been absorbed. The phenytoin concentration in mucosa and serum increased in an analogous way; maximum values were observed within the first ten minutes. The concentrations in mucosa and serum were dose dependent during the first ten minutes. 0.01 mmol/l and 1 mmol/l phlorizin significantly reduced the transfer of phenytoin (4000 and 2000 mumol/l) from the gut lumen to the mucosa. No inhibition was observed when the initial phenytoin dose was 1000 mumol/l. The results suggest that an active transport mechanism, sensitive to phlorizin, is involved in the intestinal absorption of phenytoin in the rat. | 2024-01-06T01:26:18.401715 | https://example.com/article/2330 |
Q:
How to convert CQ dialog into json-format in java servlet
I have the following CQ dialog example:
<?xml version="1.0" encoding="UTF-8"?>
<jcr:root
jcr:primaryType="cq:Dialog"
height="{Long}550"
title="my Dialog"
xtype="dialog">
<items
jcr:primaryType="cq:Widget"
xtype="tabpanel">
<items jcr:primaryType="cq:WidgetCollection">
<info
jcr:primaryType="cq:Panel"
id="infoTab"
title="-Info">
<items jcr:primaryType="cq:WidgetCollection">
<info
jcr:primaryType="cq:Widget"
id="info"
title="Info"
xtype="dialogfieldset">
<items jcr:primaryType="cq:WidgetCollection">
<service
jcr:primaryType="cq:Widget"
fieldLabel="Info"
name="./bp_info"
type="select"
xtype="selection"/>
</items>
</info>
</items>
</info>
</items>
</items>
</jcr:root>
In my java Servlet class I can access this dialog as follows:
private void createJsonObj(Node rootNode){
Node infoNode = rootNode.getNode("dialog");
}
infoNode contains all elements and their properties as far as well.
My question is: How can I store the elements of this dialog in a json format, so that I can easily recover this dialog in some javascript from the created jsonObject?
A:
You need not store the elements in a json format in your servlet to access it in javascript, the path of the dialog is sufficient.
One way through which you can get the dialog object is by using the getDialog() method of CQ.WCM class (as shown below). This would return a CQ.Dialog object which can be manipulated based on your requirements.
var dlg = CQ.WCM.getDialog(dialogPath);
You can also make an AJAX GET request to the dialog path with the selector ".inifinity.json" to get the dialog in the json format. For example:
var url = CQ.HTTP.externalize(dialogPath + ".infinity.json");
var dlg = CQ.HTTP.eval(url);
For reference, you can check the docs
| 2023-09-02T01:26:18.401715 | https://example.com/article/7603 |
Emma Watson is going to be happy she wasn't available to star in La La Land due to preparations for Beauty and the Beast - the Disney live-action remake’s global success has placed her firmly on track to become Hollywood’s highest-earning star of 2017.
The former Hermione Granger actor, who topped the poll in 2010 thanks to her role in the Harry Potter franchise, is set to overtake Jennifer Lawrence who has remained in pole position since 2015.
It was recently reported that Watson accepted a $2 million (£1.6m) fee to play Disney princess Belle - a meagre amount when considering her male counterpart would most likely receive an inflated sum. The actor did, however, agree to take a cut of the production’s global earnings.
Forbes highest paid actresses 2016 Show all 10 1 /10 Forbes highest paid actresses 2016 Forbes highest paid actresses 2016 Jennifer Lawrence: $46,000,000 Getty Images Forbes highest paid actresses 2016 Melissa McCarthy $33,000,000 Getty Images Forbes highest paid actresses 2016 Scarlett Johansson $25,000,000 AFP/Getty Forbes highest paid actresses 2016 Jennifer Aniston $21,000,000 Getty Forbes highest paid actresses 2016 Fan Bingbing $17,000,000 Getty images Forbes highest paid actresses 2016 Charlize Theron $16,500,000 Forbes highest paid actresses 2016 Amy Adams $13,500,000 Getty Images Forbes highest paid actresses 2016 Julia Roberts $12,000,000 Forbes highest paid actresses 2016 Mila Kunis $11,000,000 Getty Forbes highest paid actresses 2016 Deepika Padukone $10,000,000 Getty Images
While it was expected that Beauty and the Beast would be a box office success, it seems even Disney wasn’t anticipating quite how big it would be; it has broken five records and earned well over $350 million (£280.2m) worldwide. Much of the film's publicity has been centred around the inclusion of Disney's first openly gay character.
Watson has been vocal about feminism in the wake of criticism following a 'topless' Vanity Fair shoot. | 2024-01-10T01:26:18.401715 | https://example.com/article/5655 |
Want to Install a New Garbage Disposal Unit? Here’s How!
The thought of installing your new garbage disposal unit can be terrifying. After all, isn’t it too technical for you to perform?
What if I do it wrong? What if I broke my device while installing it?!
These are all valid questions. Installing a new garbage disposal unit may prove to be a challenge especially if you don’t have any related experience about dealing with equipments and home repair tools.
But it is possible for you to install your disposal unit by yourself. However, you may want to call an electrician and a plumber for support.
Turn off any electrical circuit that may hamper your installation. Lock the panel box if you have to.
Start by removing the strainer from the bowl. This is where you’ll attach the disposer.
Remove the strainer body. After doing this, you should be able to see a hole at the bottom of the sink bowl.
Roll a plumber’s putty and encircle it around the base of the disposer flange.
Place the disposer flange in the sink hole, pressing it deep.
Get the gasket and install it in the upper and lower mounting rings of the flange.
Snap the retaining ring in place.
Locate the 3 screws in the lower mounting ring and tighten them until the flange is firmly seated in place.
Part of your disposal unit’s package is an instructional material on how to attach it. Attach the disposer to the flange following your manufacturer’s directions.
Get the washer or gasket included in the package and use it to attach the discharge tube to the discharge opening in the side of the unit.
If a dishwasher is supposed to be attached to the unit, knock out its plug first using a screwdriver then clamp the dishwasher discharge tub.
Install the drain lines.
It is ideal to have a separate circuit installed for your disposer but if this seemed impractical and you have a dishwasher, then you can just tie it to the dishwasher circuit.
One of the biggest challenges at this point is to ensure that you have a safe electrical wiring and that the main circuit where you attached your disposer is not overloaded.
Before you test your newly installed disposal unit, have an electrician double check your wiring to be sure.
Should there be any problems with the connection, it’s best to address it while you are not yet using the unit.
Also have an inspector check your overall work. This will ensure that you missed nothing important during the installation process.
After an electrician and inspector give you their go signal then your device is ready to go.
The most important thing you have to consider when deciding to personally install the unit is whether you’re willing to do it yourself or not. If you don’t trust that you can perform every step properly, then better call professional assistance. | 2024-06-05T01:26:18.401715 | https://example.com/article/1843 |
Influence of relative humidity on cyclohexene SOA formation from OH photooxidation.
Secondary organic aerosol (SOA) is a complex mixture consisting of a variety of oxidation products. In this study, the role of relative humidity (RH) on SOA formation with different [H2O2]0/[cyclohexene]0 was investigated in a smog chamber. It was found that the cyclohexene SOA yield increases with increasing initial OH concentration at both high and low RH conditions. The increased rate of SOA formation was lower at wet conditions than that at dry conditions. For [H2O2]0/[cyclohexene]0 = 0.4 and 0.8, the SOA yield increased from 1.5% to 8% at dry condition to 7% and 12% at wet condition, respectively. In contrast, at high RH the SOA yield fell from 54% to 52% for [H2O2]0/[cyclohexene]0 = 1.3. The SOA mass loss was higher at high RH at the same OH exposure. The chemical composition of SOA was characterized using hybrid quadrupole-orbitrap mass spectrometer equipped with electrospray ionization (ESI-Q-Orbitrap-HRMS). Oligomers, which were responsible for the increase of the SOA yield, were detected in the SOA formed at high RH conditions. The esterification reaction between dicarboxylic acids and HOC6H10-O-O-C6H10OH was the pathway of oligomers formation. All the oligomers have cyclic molecular structures. For [H2O2]0/[cyclohexene]0 = 1.3, the relative intensity of both low and high molecular weight substances reduced more at wet conditions. This indicates that at sufficient OH level, the inhibition of oligomers formation and the further reaction of SOA with OH result in a slightly lower SOA yield at wet condition. | 2024-03-16T01:26:18.401715 | https://example.com/article/8719 |
Donald Trump’s trade war leaves the secretary of state for international trade and his post-Brexit trade policy in a sorry state | 2023-12-27T01:26:18.401715 | https://example.com/article/9755 |
#include "script_component.hpp"
/*
* Author: ACRE2 Team
* Initializes vehicle adds the ACE interact options on vehicles
*
* Arguments:
* 0: Vehicle <OBJECT>
*
* Return Value:
* None
*
* Example:
* [vehicle] call acre_sys_rack_fnc_initActionVehicle
*
* Public: No
*/
params ["_vehicle"];
private _type = typeOf _vehicle;
// do nothing if the class is already initialized
if (_type in GVAR(initializedVehicleClasses)) exitWith {};
// set class as initialized
GVAR(initializedVehicleClasses) pushBack _type;
if (!hasInterface) exitWith {};
if (!isClass (configFile >> "CfgPatches" >> "ace_interaction")) exitWith {}; // No ACE exit
private _condition = {true};
private _statement = {}; // With no statement the action will only show if it has children
private _text = localize LSTRING(Racks);
private _icon = "\idi\acre\addons\ace_interact\data\icons\rack3.paa";
private _children = {_this call FUNC(rackListChildrenActions);};
// Passenger action
private _action = [QGVAR(racks), _text, _icon, _statement, _condition, _children, [], {[0,0,0]},2,[false, true, false, false, false]] call ace_interact_menu_fnc_createAction;
[_type, 1, ["ACE_SelfActions"], _action] call ace_interact_menu_fnc_addActionToClass;
// External action
private _action = [QGVAR(racks), _text, _icon, _statement, _condition, _children, [], {[0,0,0]},2,[false, true, false, false, false]] call ace_interact_menu_fnc_createAction;
[_type, 0, ["ACE_MainActions"], _action] call ace_interact_menu_fnc_addActionToClass;
| 2023-08-03T01:26:18.401715 | https://example.com/article/1987 |
Search
Citing Henry Blodget's article in "Business Insider" this bilingual informational leaflet states why one should join the 99% and join the Occupy Wall Street actions. High corporate profits, extreme income disparity and low social mobility are some [...]
Occupy CUNY circulated this informational leaflet for a “Student Week of Actions” (November 14-21, 2011) in defense of education, and in solidarity with Occupy Wall Street. The schedule of Graduate Center Events included a student strike, a [...]
This mock New York Times announcement between Chancellor Goldstein and Kroll Security Group announces a protest in the form of a satirical wedding procession and ceremony, which was to be held on May 1st, 2012.
In addition, the announcement [...]
This version of the Ray Charles classic was written by members of the Graduate Center General Assembly and Adjunct Project on the occasion of CUNY Chancellor Matthew Goldstein's June 2013 retirement.
The song references ongoing scandals over which [...]
CUNY Faculty Statement of Support, written primarily by Graduate Center faculty, for the November 17, 2011, Student Strike, in solidarity with Occupy Wall Street.
Several of the CUNY faculty who spearheaded this statement, and a few visiting [...]
This 5-page brochure includes a brief overview of SLAM's history up to the 1999-2000 school year, SLAM!'s 10-point program, and details on three campaigns SLAM! was organizing that year: the High School Organizing Committee, which worked with high [...]
This Village Voice article covers the coalition effort that pulled off four simultaneous civil disobedience actions on April 25, 1995, stopping traffic at major bridges and tunnels to fight city budget cuts. Puerto Rican, black and Asian groups [...]
This pamphlet features workshops, teach-ins and events planned for the 1st annual Free University of New York City on May 1, 2012, in Madison Square Park, Manhattan, NY. In addition to talks by David Harvey, David Graeber, Francis Fox Piven, Chris [...]
This is a photocopied Village Voice article that was used to promote a citywide demonstration on April 25, 1995 that united groups fighting for education, jobs, housing, health care and AIDS care. They also called for an end to police brutality and [...]
A two-color sticker with an image of Pataki with "devil" horns. The sticker explains that the estimated projected tax savings for a family earning $50,000/year would be $20, while programs for students, the elderly and the poor would be cut. [...]
Original flier used to publicize and invite CUNY and high school students to the March 23, 1995 rally at City Hall and the unpermitted march on Wall Street planned for after the rally. Included here is a separate document that was distributed among [...]
This flier was created by SLAM!'s High School Organizing Committee in 1999 to attempt to recruit high school students to organize to save open admissions at CUNY. Members of the committee passed out these fliers in the morning before school outside [...]
This issue of Spheric, a Hunter College newspaper produced by activists from the CUNY Coalition, covers the massive March 23, 1995 protest at City Hall that led to the reduction of Governor Pataki's budget cuts and tuition hike that year. [...]
This booklet, published in 1997, tells the story of the first 25 years of LaGuardia Community College, from its conception as "Community College Number Nine" in 1968 through its 1971 opening and beyond. The author describes the social and economic [...]
A student activist newspaper produced by CUNY Coalition Against the Cuts - an organization that consisted of concerned students and faculty. The demands included no tuition hikes, no budget cuts and a restoration of funding for remedial programs [...]
This leaflet, distributed by the Community Coalition to Save Hostos, announces a march to the headquarters of the Emergency Financial Control Board (EFCB) in May of 1975. The EFCB was the body put in place to manage the budget crisis plaguing New [...]
De Hostos Echo is the Hostos Community College bilingual student newspaper. This November/December 1975 issue features stories on mass demonstrations to save the school from closure in order to deal with budget cuts. Stories also include tips for [...]
In December 1975 Congressman Charles Rangel wrote this letter to the Chairman of the Board of [Higher] Education, Alfred Giardino, to convey his opposition to the closure of Hostos Community College. As the United States Congressman representing a [...]
This document describes the mission of the Citywide Community Coalition (CCC), a collaboration dedicated to fighting the massive budget cuts inflicted on New Yorkers as a result of the 1975 fiscal crisis. Listing 28 groups ranging from The [...]
In 1976, the Executive Council of the Professional Staff Congress (PSC) produced this resolution to convey their opposition to the proposal to close multiple community college campuses in New York City’s effort to save money. They also resolved [...]
The chairman of the Social Sciences department at Hostos Community College penned this letter to Governor Hugh Carey asking him to prevent the closure of Hostos and the merger with Bronx Community College. Professor Peter Roman argues that the [...] | 2024-06-04T01:26:18.401715 | https://example.com/article/6634 |
Article sorting systems are generally well known in the art and have become specialized to sort or separate specific types of articles. For example, U.S. Pat. Nos. 3,884,370 and 4,106,636 disclose systems for sorting letters and other types of flat articles. In U.S. Pat. No. 4,249,661, a system is disclosed for circulating objects around workstations so that such objects are available for carrying out different operations thereon. U.S. Pat. No. 4,766,547 discloses a system which is adapted for utilizing handling vehicles traveling along a conveyor network. The vehicles are self-propelled and controlled as to speed and other parameters by a computer system. The sorting system disclosed in U.S. Pat. No. 4,239,435 is especially adapted for sorting clean laundry which is mixed as to customers, types of laundry, delivery routes, etc.
Many sorting systems are inflexible, in that changes in the mode of sorting, or other parameters, are not easily modified. Other sorting systems are highly mechanical in nature, are complicated and are prone to damage and wear. Other systems are simply inefficient, in that they require complicated routing and sorting paths and equipment to accomplish a final arrangement of the articles. For example, in U.S. Pat. No. 4,239,435 identified above, the system labels locations on a looped conveyor and relates specific articles to sort to a location. If the loop has a capacity of 1000 garments the following problems can occur: 1) there is inefficient use of space because the garment density is very low, 2) the system cannot handle more than 1,000 garments in a lot and cannot be easily altered, 3) if an operator hanging garments misses one slot, the entire sort is thrown off and must be redone, 4) it takes nearly as long to sort 100 garments as 1000 garments, 5) and as the system capacity is expanded sorting time does not increase in a linear fashion making it very difficult to handle garment sort lots of, for example, 15,000 pieces.
Also, articles such as garments, are very difficult to identify and to achieve identification throughout the system so that effective sorting can be accomplished. This can be appreciated as the identity of a garment cannot simply be stamped on an outer visible surface thereof, but is often fixed at a location such as an inside cuff or collar, which is normally not readily visible. Also, when garments are hung on a conventional slick rail or screw conveyor, entanglement of either the garments or the garment hangers is a problem which frustrates the automatic identification and transport thereof.
From the foregoing, it can be seen that a need exists for an article sorting system which is highly flexible in that any sorting criteria can be carried out, and little space is required of such system. Another need exists for a sorting system especially well adapted for sorting garments and efficiently transporting the garments through the various paths of the sorting system. Another need exists for a flexible sorting system in which a wide variety of sorting paths can be utilized in a tradeoff between space and sorting time, while yet maintaining the same efficient sorting scheme. | 2024-05-26T01:26:18.401715 | https://example.com/article/9791 |
Roll Call: How Candidates Duck Reporting Campaign Funds By Simone Pathé | November 9, 2017 “But Democrats have argued that Fagg, who’s running in a crowded GOP primary to take on Democratic Sen. Jon Tester, was acting like a candidate well before October. A liberal group has filed a complaint against him with the Federal Election […]
McClatchy: Hawley signals a Senate run and Democrats quickly cry foul By Lindsay Wise and Ben Wieder | August 3, 2017 “The same day that Missouri Attorney General Josh Hawley signaled he wants to run against Sen. Claire McCaskill, a group run by one of the Democrats’ best-known political warriors went to the Federal Election […] | 2024-06-30T01:26:18.401715 | https://example.com/article/2594 |
Q:
Stomach damage/sickness long after pregnancy?
My wife had quite a tough time during pregnancy. She had morning sickness all the way through, vomiting regularly, although not enough to put her in hospital or require treatment. She also had severe heartburn. As the baby was breach with the cord around her neck, she had an elective caesarian.
They both seem to be in good health now, except that my wife is especially prone to stomach bugs/food poisoning.
The first time this happened was 6-8 months after birth. My wife came down with a norovirus-like bug, lasting a day or two, recovered, then came down with something similar 2 weeks later, and again a week after that. My daughter was fine and I was only sick for one day. The local hospital did an abdominal ultrasound, but found nothing unusual.
Now, a year later she's had another bout and still feels a bit nauseous ten days later. I'm fine, despite being in close proximity and eating the same things.
Obviously we're not looking for medical advice, but I'm wondering whether she might have been made more susceptible to this kind of thing as a result of pregnancy or the caesarian operation? Has anyone heard of that?
A:
I've had a similar experience, but been told I was crazy for connecting the pregnancy to my post-pregnancy stomach problems (8.5 months of sever nausea to the point I did need help getting re-hydrated, ceasarian heartburn etc during pregnancy and then easily made naseausous after). So, even though I've never heard of it - I too, have experienced it.
Seven years later I've figured a few things out that help:
Stay hydrated!! Hangovers and their symptoms are actually caused largely by the dehydration alcohol causes. Considering this, since I am so suceptable to nausea, I figure it best to stay overly-hydrated so I can do everything possible to avoid the nausea. It really does seem to help too.
Whatever the cause - I have found that keeping light quick snacks around helps. My stomach is less likely to become upset, or for heartburn or reflux to set in if I eat 4-6 times per day rather than the usual three. Of course, these have to be much smaller meals.
I also don't drink (even water) with my meals, but drink water in small sips throughout the day and I drink other liquids (like cofee, milk, juices, teas and alcohol) only after I've had a light snack that included something like crackers or toast.
I tend to avoid really cold beverages.
If I get overly tired, I am more prone to stomach bugs/nausea than if I am well rested.
Of course eating healthier food choices and getting regular exercise also makes a difference.
A:
I always had an "iron stomach," until I became a mother. In the first two years of my daughter's life I was sick 5 times with norovirus or something similar, once I had to go to the ER for IV fluids and twice I got sick, recovered and then relapsed. Besidss that, I was frequently sick with URI's. This is what I learned from my MD and my Naturopath:
During pregnancy, hormonal changes occur that impact the mother's immune system, possibly making her more succeptible to viral or bacterial infections. Postpartum, both breast feeding, which suppresses estrogen production, and lack of sleep can weaken mom's immune response. Stress is yet another risk factor for weakened immune response.
Nutritional deficiencies will also negatively effect disease resistance. Vitamin D deficiency, especially prevalent in the northern hemisphere during fall and winter can lower immune response, as can anemia. Bouts of food poisoning or gastroenteritis can damage cells lining the intestine and deplete healthy intestinal flora, making it more difficult to digest food and absorb nutrients; exacerbating and perpetuating the problem. Antibiotics also kill off intestinal flora.
What really helped me the most was taking high-quality probiotics and a course of vitamin d at a very high dose prescribed by my doctor. Those two things, plus learning some easy stress reduction techniques made a world of difference in my health and energy. Adequate rest and exercise are beneficial too.
I hope your wife is feeling better soon.
| 2023-09-24T01:26:18.401715 | https://example.com/article/4975 |
Q:
vertical bar for absolute value and conditional expectation
Now I use "mid" for all vertical bars, but I wonder what's the proper ways.
The first scenario is vertical bar for absolute value. Now I just right $x\leq \mid x \mid$. but is this correct?
The second scenario is in conditional expectation. Now I write E[x \mid y], but sometimes if the "x" part is complex, it might be quite "tall", I wonder if there's a way to have a "automatically adjusted" vertical bar. Is there?
A:
As others have remarked, vertical bars can be obtained with different commands and one should use the correct one in each case:
\mid when it's a relation symbol, for instance in set notation or for “divides”;
\lvert or \rvert when it's a (left or right) delimiter; note that this requires amsmath that's recommended anyway when a document needs math.
Just typing | can work, but there are some subtleties, so it's better to use the above commands. Similarly, for the double bar is
\parallel when it's a relation symbol;
\lVert or \rVert when it's a delimiter.
You can exploit mathtools for your symbol for expectation, but with some more tricks in order to make the bar doing the right thing.
\documentclass{article}
\usepackage{mathtools}
\newcommand{\expect}{\operatorname{E}\expectarg}
\DeclarePairedDelimiterX{\expectarg}[1]{[}{]}{%
\ifnum\currentgrouptype=16 \else\begingroup\fi
\activatebar#1
\ifnum\currentgrouptype=16 \else\endgroup\fi
}
\newcommand{\innermid}{\nonscript\;\delimsize\vert\nonscript\;}
\newcommand{\activatebar}{%
\begingroup\lccode`\~=`\|
\lowercase{\endgroup\let~}\innermid
\mathcode`|=\string"8000
}
\begin{document}
$\expect{X|Y}$
$\expect[\big]{X|Y}$
$\expect*{\dfrac{1}{2}X|Y}$
\end{document}
In the same style as macros declared with \DeclaredPairedDelimiter, you can give \expect an optional argument that can be one among \big, \Big, \bigg or \Bigg for manually sizing the delimiters or use \expect* in order to get automatic sizing (use it sparingly).
Here you can use | for conditional expectation, because the macros take care of its relation nature.
A:
You should definitely not use \mid to denote all vertical bars. In fact, I'd say that using \mid everywhere is as bad as (or maybe even worse than) typing | or \vert to denote each and every vertical bar.
The macro \mid has a specific use to denote conditioning information. E.g.,
$\{\, x \mid x>5 \,\}$
denotes the set of all numbers x that are greater than 5. Observe the amount of whitespace around the vertical bar. (This example is, by the way, courtesy of the TeXbook, p. 174.)
To denote the absolute value of some number z, you could type |z|. However, typing \lvert z \rvert is marginally better, as in
a \lvert b \rvert c
Observe that there's now no extra whitespace on either side of the bars.
Summing up: the vertical heights of the bars produced by \mid on the one hand and \lvert and \rvert on the other are identical. It's in the amounts of horizontal whitespace that's inserted around them that they differ.
If you find yourself needing to type a lot of these macros, and especially if you need to have their sizes adapt to their associated material, it's highly advisable to create separate macros called, say, \abs{...} and \set{...}{...}. For much more on set-related notation that uses curly braces and middle vertical bars see, e.g., the posting Why don't the curly braces and the mid bar become bigger?
A:
Based on the examples in the mathtools documentation, here are some easy-to-use macros for absolute values and set builders. In addition to mathtools, they also use etoolbox and xparse.
For sets, only one argument is necessary: the syntax is \set{x ; P(x)}, producing {x|P(x)}, where the braces and the vertical bar are adjusted to the size of the contents, automatically with the \Set command (a more natural and easy to remember notation for \set* from mathtools, in my opinion), manually with the \set command. Another difference with the mathtools version is that size of the manual version defaults to \big, as I find the non adjusted version most of the time looks too small. If you prefer the original version, it suffices to comment the (very classical) patch.
Of course, as the semi-colon is used as a separator between the elements and the properties that defines them, any other ; should be written {;}. This is unlikely to happen very often.
The macro also works for sets defined as lists (no defining property).
Here is an illustration:
\documentclass[10pt]{report}
\usepackage[utf8]{inputenc}
\usepackage{lmodern}
\usepackage{mathtools,nccmath}%
\usepackage{ etoolbox, xparse}
\DeclarePairedDelimiterX{\abs}[1]\lvert\rvert{\ifblank{#1}{\,\cdot\,}{#1}}
\let\oldabs\abs
\def\abs{\futurelet\testchar\MaybeOptArgAbs}
\def\MaybeOptArgAbs{\ifx[\testchar\let\next\OptArgAbs
\else \let\next\NoOptArgAbs\fi \next}
\def\OptArgAbs[#1]#2{\oldabs[#1]{#2}}
\def\NoOptArgAbs#1{\ifblank{#1}{\oldabs{}}{\oldabs[\big]{#1}}}
\def\Abs{\oldabs*}
\DeclarePairedDelimiterX{\set}[1]\{\}{\setargs{#1}}
\NewDocumentCommand{\setargs}{>{\SplitArgument{1}{;}}m}
{\setargsaux#1}
\NewDocumentCommand{\setargsaux}{mm}
{\IfNoValueTF{#2}{#1}{\nonscript\,#1\nonscript\;\delimsize\vert\nonscript\:\allowbreak #2\nonscript\,}}
%%% Syntaxe : \set{x ; P(x)})
\let\oldset\set
\def\set{\futurelet\testchar\MaybeOptArgSet}
\def\MaybeOptArgSet{\ifx[\testchar \let\next\OptArgSet
\else \let\next\NoOptArgSet \fi \next}
\def\OptArgSet[#1]#2{\oldset[#1]{#2}}
\def\NoOptArgSet#1{\OptArgSet[\big]{#1}}
\def\Set{\oldset*}%
\begin{document}
Let $ \abs{} $ denote the \emph{absolute value} function. We have
\[\Abs{\frac{x}{y}} =\frac{\abs{x}}{\abs{y}} \]%
\[ \abs[]{z}\quad \abs{z}\quad \abs[\Big]{z}\quad \abs[\bigg]{z}\quad \abs[\Bigg]{z} \]%
Let $ \mathbf{ U} = \set{z \in \mathbf C ; \abs[]{z} = 1}$ and $ \mathbf U_3 = \Set{1,\dfrac{-1 + i\sqrt{3}}{2},\dfrac{-1-i\sqrt{3}}{2}} = \set{1,\frac{1}{2}(-1 + i\sqrt{3}),\frac{1}{2}(-1-i\sqrt{3})} = \set[]{1,\mfrac{1}{2}(-1 + i\sqrt{3}),\mfrac{1}{2}(-1-i\sqrt{3})}$.
\end{document}
| 2024-06-10T01:26:18.401715 | https://example.com/article/3184 |
The US and England have got to stick together. Owen Humphreys / PA Archive/Press Association Images Wells Fargo, the world's biggest bank by capitalisation, has given a huge vote of confidence in London's future as a financial hub even after the expected British exit from the European Union, signing on for a new £300 million ($396 million) headquarters in the UK capital.
The Financial Times reports that the US lender is buying an 11-storey building being developed near London Bridge called 33 Central.
Wells Fargo will move into its new London offices in 2018. The move will bring its 850 London workers, now spread across four buildings, into one location. Wells Fargo has 269,000 employees globally and a market cap of $242.4 billion (£183.3 billion). Most of its business is done in the US, but its London offices help American clients looking to do business here.
The office-block sale is one of the biggest property deals since the UK's shock June 23 vote to leave the EU. Since then there have been concerns about both Britain's property market and London's status as a financial hub.
On the property front, multiple commercial property investment funds, which own at least £15 billion worth of UK buildings, were forced to freeze withdrawals after being overwhelmed by people trying to pull money out of UK property.
The design for the new 33 Central building that Wells Fargo will move into. HB Reavis But the collapse in the pound to a 31-year-low against the dollar is making British assets more attractive to some buyers. The US property fund Madison International Realty says it is planning to spend as much as £1 billion buying bargain London buildings.
As for finance, multiple banks have warned that they may have to relocate thousands of jobs away from Britain if the UK fails to negotiate passporting rights that allow them to operate across the EU from London. JPMorgan, Goldman Sachs, and UBS have all floated the idea, despite pleas from the Treasury to play down the risk to jobs and a joint letter from the government and investment banks pledging the help London "retain its position as the leading international financial center."
Marian Herman, the CFO of HB Reavis Group, the developer that sold the building to Wells Fargo, said in an emailed statement: "Many have doubted what will happen to the real estate market after the Brexit vote. We see the successful signing of this deal as strong endorsement of the quality of our real estate solutions, as well as the resilience of the HB Reavis business even under seemingly challenging market conditions." | 2024-06-21T01:26:18.401715 | https://example.com/article/9242 |
Screensharing for Linux - katzebach
http://www.same.io/i/821981
======
ajaxguy
Request invite didn't go thru- Chrome 31. Not sure if its because of my
firewall settings.
| 2024-04-13T01:26:18.401715 | https://example.com/article/9060 |
219 S.E.2d 315 (1975)
John W. MOORE
v.
JOHNSON SERVICE COMPANY, a corporation.
No. 13201.
Supreme Court of Appeals of West Virginia.
May 27, 1975.
*317 W. E. Mohler, Charleston, for appellant.
Albert F. Good, Bibby & Good, Charleston, for appellee.
*316 HADEN, Chief Justice:
This is an appeal and supersedeas by Johnson Service Company, a Wisconsin corporation, awarded by this Court to a final order of the Circuit Court of Kanawha County granting declaratory relief, a money judgment of $880.76 and statutory costs to John W. Moore, a landlord, under a certain lease agreement in which the Company was the tenant. In this Court, Moore cross-assigned error to the ruling of the trial court denying him reasonable attorney fees allowable under certain conditions contained in the lease agreement between the parties.
Moore and the Company entered into a lease dated April 7, 1967. Subsequently, the parties executed two addenda and a "rider" dated May 12, 1967 in modification of the original agreement, all covering the demise of certain commercial premises to be constructed by Moore, containing 4,052 square feet of floor space and 1,551 square feet of parking space, located in South Charleston, West Virginia. The term of the lease was for ten years, commencing November 15, 1967. The lessee Company prepared the lease instruments.
*318 The controversy which engendered this litigation arose due to the increase in real estate taxes resulting from the increase in assessed value of the demised property coincident with the completion of improvements on the property done to make it suitable for the Company's commercial purposes.
Pursuant to the lease, Moore was to be responsible for the pre-existing real estate tax base, but according to a tax escalation clause contained in the rider agreement, the Company would be responsible for the payment of increased taxes, ascertainable as follows:
". . . Lessee agrees to pay the Lessor any increase in amount of real property taxes over the full first year's assessment which may be paid by the Lessor for the subsequent years of the lease term."
Real property taxes on the demised property for the year 1968 amounted to $123.20 and for the following calendar year of 1969 amounted to $1,003.96.
Moore tendered a statement to the Company in an amount of $880.76 for the excess of the 1969 real estate taxes over the 1968 taxes. The Company refused to pay the excess figure and contended that the foregoing tax escalation clause as it referred to the "full first year's assessment" meant the calendar year 1969 and that the Company's liability for excess taxes, if any, should be computed upon a comparison of the 1970 real estate taxes with the 1969 real estate taxes.
When it became apparent that the parties were unable to agree on the meaning of the clause in relation to the real estate taxes levied, Moore instituted a civil action against the Company seeking a declaration of the parties' rights under the tax escalation clause in the lease agreement, seeking a money judgment for "the excess 1969 real estate taxes" and also seeking a recovery for reasonable attorney fees as provided under the terms of the lease, as follows:
"6. Parties Mutually Covenant
"3. In the event that either party hereto shall be successful in enforcing against the other any remedy, legal or equitable, for a breach of any of the provisions of this lease, there shall be included in the judgment or decree the reasonable expense and attorneys' fees of the successful party."
Upon these facts, the trial court made certain findings of facts and conclusions of law, and ruled in favor of Moore that the Company was (1) liable to Moore for that part of the real estate taxes paid by Moore, or to be payable by Moore, exceeding the sum of $123.20 for the years 1969 through and including the calendar year 1976 and on a 5/6 pro rata basis for that part of the real estate taxes payable by Moore for the calendar year 1977 exceeding the sum of $123.20; (2) granted the plaintiff's request for a monetary judgment in the sum of $880.76 for the excess 1969 calendar year property taxes over those paid in the calendar year 1968; and (3) statutory costs of the civil action. The trial court also ruled in favor of the Company and held that Moore was not entitled to reasonable attorney fees as provided for in the lease because such were not items of recovery permitted under the law of this jurisdiction.
Two legal issues are presented for resolution: First, whether the trial court was correct in its interpretation of the lease and its determination that the "full first year's assessment" referred to the first calendar year after the commencement of the lease term. Secondly, whether public policy permits recovery of reasonable attorney fees upon contingencies provided for by consenting parties to a written lease agreement.
The first issue encompasses three assignments of error: first, that the trial court erred in finding that the phrase "full first year's assessment" had no established legal meaning and was "patently ambiguous"; second, that the trial court erred in attempting to construe the questioned phrase in light of the words employed in the context *319 of the whole instrument; and third, that the trial court erred in holding that the questioned phrase was intended to refer to the next ensuing tax year, rather than "meaning what it clearly said."
Individually, the words comprising the phrase "full first year's assessment" convey reasonably definitive thoughts. In their combined form, however, the same words create considerable confusion. The modifiers"full first year's"are words of common usage which, separately or collectively, require little or no explanation to discern their intended meaning. Similarly, the word "assessment", when used in the parlance of property taxation, ordinarily imparts a well-defined meaning. See, 84 C.J.S. Taxation § 391 (1954). The composite phrase here presented does not explain itself without resort to construction.
Although variously defined, "assessment", in its technical sense, generally refers to "The listing and valuation of property for the purpose of proportioning a tax upon it, either according to value alone or in proportion to benefit received." Black's Law Dictionary, 4th Ed. (1951) at 150. As recognized in Breckenridge v. County School Board, 146 Va. 1, 135 S.E. 693 (1926):
"An assessment consists in listing the property and putting a value thereon to which the rate fixed by the levy is to be applied." Id. at 695.
Accord, Sussex County v. Jarratt, 129 Va. 672, 106 S.E. 384 (1921); Hilliard on Taxation (1875) at 291.
In George S. Hazelwood Company v. Pitsenbarger, Assessor, 149 W.Va. 485, 141 S.E.2d 314 (1965), decided after the 1961 amendment of W.Va.Code 1931, 11-3-1 changed the assessment date for non-utility property, it was held:
". . . [Property] may acquire a tax situs and be assessed on any day fixed by the Legislature; and the tax is determined thereby, even though the property is removed from the state before the tax is due or even before it has actually been assessed." Part syllabus point 2., id.
"All property in West Virginia is assessed annually on the first day of July against the owner of the property at that time, but the personal property must be located in the state each year at the time it is assessed." Syllabus point 5., id.
Thus, in this State, all non-utility property is "assessed" as of one particular day, the first day of July, even though the actual mechanics of the assessment procedure are likely to occur subsequent to that date.
The statute itself, W.Va.Code 1931, 11-3-1, as amended, furnishes further illustration of the technical significance of the term "assessment." It provides that all property shall be assessed annually at its true and actual value "as of" the first day of July. It does not require, as counsel for appellant contends, that property be assessed "on" that day.
The resulting distinction is apparent and material; the "assessment" date, in the technical sense, constitutes a fixed reference to a particular day upon which ownership and value are to be ascertained for future levy, and not to either the actual mechanics of the assessment procedure or to the initiatory day for the corresponding tax obligation. The technical distinction thus reveals the inherent ambiguity within the phrase, "full first year's assessment" as it relates to the law. The modifiers"full first year's"connote a span of time which seemingly suggests the levy or tax period which follows the assessment date, whereas "assessment" refers to the particular day fixed by the Legislature upon which ownership and value shall be ascertained for the subsequent application of the levy. Hence, the purported certainty of the word "assessment", as a term of art, is materially obscured by its modifiers when compared with the statutory scheme of assessment and levy.
Even in statutory parlance, the term "assessment" does not connote a single concept. *320 As is said in 84 C.J.S. Taxation § 391 (1954):
"The word `assess' has a broad or narrow meaning, according to the sense or connection in which it is used. The narrow meaning usually is limited to the listing and valuing of property for taxation; in its broadest sense, the term includes the entire process of listing, valuing, levying, and extending the tax on the rolls. So, the term is used at times to include all the steps involved in imposing a tax on property." Id. at 750.
See also, Black's Law Dictionary, 4th Ed., "Assessment" (1951). In this context, we observe that in the State of Wisconsin, where this agreement apparently was prepared, the word "assessment" has been a source of some consternation. In Prentice v. Ashland County, imp., 56 Wis. 345, 347, 14 N.W. 297, 298 (1882), the court said:
"Without going into any discussion as to the etymology of the language employed [in Sec. 3, ch. 309, Laws of 1880], or whether the error or defect must go, not only to the validity of the assessment, but also to the groundwork of the tax, we are clearly of the opinion that the word `assessment,' as here used, goes to the whole statutory method of imposing taxes upon property." (Emphasis supplied).
Finally, at the opposite end of the spectrum, extreme examples of adulteration of the term "assessment" are to be found in private agreements of individuals which have employed the term indiscriminately. The variety of concepts ascribed to the term is aptly illustrated by many of the cases collated in Annot., 48 A.L.R.3d 287 (1973), "Landlord and Tenant: Construction of Provisions of Lease Providing for Escalation of Rental in Event of Tax Increases." Although none of the decisions cited therein is in point, the variety of usage employed illustrates the practical flexibility of the term. See, e. g., Auerbach v. Mr. & Mrs. Foster's Place, Inc., 128 Misc. 875, 220 N.Y.S. 281 (1927); Heymann v. Nuss, 97 Pa.Super. 114 (1929); Bernstein v. Bernstein, 205 App.Div. 741, 200 N.Y.S. 1 (1923).
The foregoing, we believe, clearly supports the trial court's view that the phrase in question required construction because it was patently ambiguous. The appellant's first assignment of error is without merit.
Neither are we troubled by the trial court's endeavor to ascertain the intended meaning of the ambiguous phrase from a perusal of the whole agreement. The language of a lease agreement, as any other contract, must be considered as an integrated whole, giving effect, if possible, to all parts of the instrument. See, Wood Coal Company, Inc. v. Little Beaver Mining Corp., 145 W.Va. 653, 116 S.E.2d 394 (1960); Clayton v. Nicely, 116 W.Va. 460, 182 S.E. 569 (1935); Watson v. Buckhannon River Coal Co., 95 W.Va. 164, 120 S.E. 390 (1923). The second assignment of error is likewise without merit.
Having thus confirmed the trial court's judgment that the lease provision in question required construction and, as well, that such construction was properly made in view of the entire agreement, we look to the propriety of that court's substantive decision. At this juncture, we note that it is not the purpose of this review to preempt the nisi prius function of the trial court by our independent construction of the agreement; it is, rather, to sustain such construction in the absence of some showing that the construction was erroneous. See, 5 C.J.S. Appeal & Error § 1566 (1958); Williams v. Ray, 107 Fla. 327, 144 So. 679 (1932); Helie v. Wickersham, 103 Fla. 254, 137 So. 226 (1931).
In the consideration of this lease agreement, as with any other contract, the overriding endeavor must be to ascertain and give effect, if possible, to the mutual intent of the parties. See, Curtis v. Meadows, 84 W.Va. 94, 99 S.E. 286 (1919); Wetterwald v. Woodall, 83 W.Va. 647, 98 S.E. 890 (1919); Garrett v. Patton, 81 W.Va. 771, 95 S.E. 437 (1918); Taylor v. Buffalo Colleries *321 Co., 72 W.Va. 353, 79 S.E. 27 (1913); South Penn Oil Co. v. Knox, 68 W.Va. 362, 69 S.E. 1020 (1910); John v. Elkins, 63 W.Va. 158, 59 S.E. 961 (1907). This cardinal principle, of course, elicits no dispute in this case, but the parties seemingly part on whether the lessor or lessee should be favored by the law in the resolution of doubtful provisions of a lease. This question arises upon the fact that the lessee Company was the author of the lease in issue.
Traditionally or, at least, historically, it has been widely recognized that the lessor normally assumed the responsibility of preparing the lease agreement. A rule of construction developed upon this recognition, that ambiguity in a lease was to be resolved in favor of the lessee and against the lessor. In Lawson v. West Virginia Newspaper Publishing Co., 126 W.Va. 470, 29 S.E.2d 3 (1944), it was said:
"This position is further justified by the well-recognized requirement that, ordinarily, in construing a lease, doubtful questions should be resolved in favor of the lessee. Hacquard v. Sweetwine, 92 W.Va. 681, 115 S.E. 797." (Emphasis supplied). Id. at 475, 29 S.E.2d at 5.
In Carbon Fuel Company v. Gregory, 131 W.Va. 494, 48 S.E.2d 338 (1948), this Court quoted with approval the following statement from Oakwood Smokeless Coal Corporation v. Meadows, 184 Va. 168, 34 S.E.2d 392 (1945):
"`Where doubt exists as to the meaning of lease restrictions as to the use of property, such provisions are to be resolved in favor of lessee and against lessor.'" 131 W.Va. at 499, 48 S.E.2d at 341, Carbon Fuel Company v. Gregory, supra.
Fortunately, in applying the foregoing rule, Judge Fox also exposed its underlying rationale:
"Under settled law, the lease should be construed most strongly against the lessor, who, it is assumed, prepared the same, and who had it in its power to incorporate therein restrictions on the use of the leased premises and failed to do so." (Emphasis supplied). Id. at 498, 48 S.E.2d at 341.
Thus, closer scrutiny of the "ordinary" rule of construction of leases reveals the application of the more fundamental principle that doubtful provisions of a written instrument should be construed most strongly against the party preparing it. See, Henson v. Lamb, 120 W.Va. 552, 199 S.E. 459 (1938); Charlton v. Chevrolet Motor Co., 115 W.Va. 25, 174 S.E. 570 (1934); Peerless Carbon Black Co. v. Gillespie, 87 W.Va. 441, 105 S.E. 517 (1920). Accordingly, where, as here, ambiguity arises upon the written language chosen by the lessee in drafting the lease agreement, the "ordinary" rule of construction stated in Hacquard, supra, and Lawson, supra, yields to the root principle that doubt is to be resolved most strongly against the party who prepared the instrumentin this case, the lessee.
We believe it is also important to note further the rule of general application that, in the construction of contracts, words or clauses are not to be treated as meaningless or discarded if any reasonable meaning consistent with the other parts of the contract can be given them. As was said in Wood Coal Company, Inc. v. Little Beaver Mining Corp., 145 W.Va. 653, 116 S.E.2d 394 (1960):
"`A contract must be considered as a whole, effect being given, if possible, to all parts of the instrument.' Syllabus, Clayton v. Nicely, 116 W.Va. 460, 182 S.E. 569." Syllabus, id.
This rule, it seems, gives special credence to the trial court's decision which construed the term "assessment" so as to give it meaning compatible with its modifiers within the subject phrase and, as well, within the whole agreement. If, as noted, the word "assessment" had been given its narrow technical signification under the West Virginia statutory scheme, it would have referred to the particular day on *322 which liability for taxes was fixed and property value was determined (George F. Hazelwood Company v. Pitsenbarger, Assessor, supra.) and would have rendered the modifiers"full first year's"totally incompatible. In order to give the phrase understandable meaning and, at the same time, give effect to every word within the phrase compatible with the entire agreement, the word "assessment" was properly construed as having been intended in its more expansive sense, as synonymous with taxation in general. See, Black's Law Dictionary, supra. Upon all of the foregoing, we believe, the trial court was justified in construing "full first year's assessment" to mean full first year's tax obligation, thus establishing a base year, before the property was revalued to reflect the lease improvements, for future allocation of tax liability between lessor and lessee.
For the foregoing reasons, the circuit court's ruling on this issue cannot be said to have been clearly wrong in its factual findings nor to have been erroneous in its legal conclusions. The court's judgment, therefore, is affirmed on the first issue.
The remaining issue of this case was raised by appellee's cross-assignment of error to the ruling of the trial court denying recovery of reasonable expense and attorneys' fees. In the lease contract, the parties mutually agreed the successful party in an action to enforce the lease or to recover for a breach of the lease should recover from the unsuccessful party, in addition to other appropriate relief, "the reasonable expense and attorneys' fees" as a part of the judgment.
The trial court refused to enforce this provision of the lease contract in favor of Moore, the prevailing party below. In ruling on this point, the court held:
". . . I do not believe that a party may, in this State, recover attorney's fees in such a case as this, notwithstanding the agreement. The rationale of the rule stated in Raleigh County Bank v. Poteet, 74 W.Va. 511, [82 S.E. 332 (1914)] is, in my opinion, applicable in the instant case."
The Poteet decision invalidated a provision in a negotiable instrument requiring the maker to pay attorney fees in the event that court action was necessary for collection of the proceeds of the note. As respects negotiable instruments, that holding has been followed in the subsequent cases of First National Bank of Mannington v. Bank of Mannington, 76 W.Va. 356, 85 S.E. 541 (1915); First National Bank of Pineville v. Sanders, 77 W.Va. 716, 88 S.E. 187 (1916); and Campen Bros. v. Stewart, 106 W.Va. 247, 145 S.E. 381 (1928) and recognized in the recent case of Gavenda Bros., Inc. v. Elkins Limestone Co., Inc., 145 W.Va. 732, 116 S.E.2d 910 (1960).
In the Poteet case, the Court grounded its decision on several bases: (1) lack of consideration, (2) usury, (3) oppression, (4) statutory preemption, and (5) the encouragement of litigation. While the concepts of lack of consideration and usury were, and are, defenses to be considered as respects negotiability of notes and money lending under both the Negotiable Instruments Law and the successor Uniform Commercial Code, such considerations are not relevant in determining the enforceability of covenants in a mutually-agreed-to and freely-bargained-for lease. The legal concept of "oppression" as it was discussed in the Poteet case, also has no relevancy to determinations involving the enforceability of mutual covenants in a commercial lease agreement.
Further, we do not believe the fifth consideration relied upon by the Poteet Court to be pertinent to the enforceability of a mutual covenant contained in a commercial lease agreement. Of course, the law never encourages litigation, but when a man suffers injury to his person or his property, the courts of this State are open for the purpose of peaceful redress of grievances. See W.Va.Const, Art. Ill, § 17. In the context of complex business dealings resulting in the execution of lease agreements, it is to be anticipated, despite the *323 best efforts of the parties, that occasional disputes may require resolution by the courts. When these disputes are submitted for judicial determinations, in our view, it is far better that courts and judges receive the benefit of the expressed intentions of the parties ascertainable from the plain provisions of the contract. It would seem that public and juridical policy is served when the parties agree to liquidated damages for reasonable expenses and attorneys' fees in the event of court action required to resolve disputes between parties to a commercial lease agreement.
The most troublesome aspect of the Poteet decision was its direct holding that the Legislature, with the adoption of the predecessor of W.Va.Code, 59-2-14, as amended, provided for the award of statutory attorney fees in the amount of $10.00 per case litigation and by such prescription dealt "fully and comprehensively with the subject and presumptively made what was deemed an adequate provision . . . ." Id. at 514 of the West Virginia Report at 334 of 82 S.E. By this holding, the majority, speaking through Judge Poffenbarger, ruled that West Virginia courts could not enforce a contractual stipulation or agreement for attorney fees as a part of the judgment for damages or costs, in excess of that allowed by statute. The validity of that holding in the context of usury, vis-a-vis the collection of proceeds of promissory notes and commercial paper pursuant to the Negotiable Instruments Law or its successor codification, the Uniform Commercial Code, is not questioned in this appeal.
On the other hand, we cannot believe that it was the intention of the Legislature, in authorizing recovery of a statutory attorney fee, to prohibit the aid of the courts in the enforcement of fair and reasonable contract provisions arrived at by mutual and intelligent bargaining between parties who are adequately informed, and thus well protected, in their legal rights. In fact, there is authority to the contrary in this jurisdiction. An early case, Castle v. Castle, 69 W.Va. 400, 71 S.E. 385 (1911), explicitly recognizes that private persons, by contract, may make special provisions between themselves with regard to court costs and that equity courts would enforce such provisions:
"Generally speaking, the control over costs in equity suits is a matter largely within the discretion of the chancellor. Section 10, c. 138, Code 1906; Nutter v. Brown, 58 W.Va. 237, 52 S.E. 88, 1 L.R. A.(N.S.) 1083. But in the present case the costs had been made the subject of an agreement between the parties, which took it out of the court's discretion. Both of the compromise agreements expressly stipulated that each of the parties should pay his own costs in the first suit. The decree holds that these contracts are binding; and we do not see how the court could have then disregarded the stipulation as to costs, which appears to be as binding as any other portions of the agreements." Id. at 402-403, 71 S.E. at 387.
We observe, also, that many other jurisdictions in this Country expressly approve recovery for stipulated attorney fees and expenses of litigation, either in predetermined sums or as established by judgment order, on the basis of reasonableness. See, Annot., 77 A.L.R.2d 735 (1961) and cases cited therein. See also, 17 Am.Jur.2d Contracts § 164 (1964).
We are compelled to recognize the thrust of appellee's contention that public policy, perceived and declared in the early part of this century or in the latter part of the nineteenth century, has the functional value of a cigar store indian in the context of today's sophisticated business bargaining. Rightly or wrongly, the expense of legal services to contemporary litigants is of a magnitude beyond the remotest speculation of the eminent jurists of another time. Contracting parties negotiate and conclude their agreements with full realization of the substantial expense, legal and otherwise, which may be attendant upon controversies *324 as may occur between them. As here, such realization may well be reflected in the covenants of the contract. If one of the provisions of a commercial lease agreement provides for the allocation of reasonable attorneys' fees concomitant with the judicial resolution of a contract dispute, why should a court of law interpose its judgment and prohibit agreement of the parties on this subject? What public policy requires a judicial fiat that competent parties to a commercial lease agreement shall be forbidden to anticipate and solve the problem of litigation expenses in a manner which they, themselves, deem proper? None.
A mutual covenant contained in a commercial lease agreement, providing for the recovery of reasonable attorneys' fees and expense of litigation, available to either party who successfully recovers for breach of the lease contract or enforces its provisions, is valid and enforceable in the courts of this State.
The contrary ruling of the trial court is reversed and this case must be remanded for a judicial determination of reasonable attorneys' fees and reasonable expenses of litigation, if any, recoverable by the appellee Moore.
For the foregoing reasons the decision of the Circuit Court of Kanawha County is affirmed in part, reversed in part, and the case is remanded with directions for disposition in accordance with the principles expressed in this opinion.
Affirmed in part; reversed in part; and remanded with directions.
| 2023-11-28T01:26:18.401715 | https://example.com/article/4105 |
Q:
Hierarchial deletion of tables in SQL Server 2008
I have a table ParentTable in which I have parentId as primary key.
Now I have three child tables ChildTable1, ChildTable2 and ChildTable3.
in ChildTable1, primary key is ch1Id and foreign key is fkparentId (pk from ParentTable)
in ChildTable2, primary key is ch2Id and foreign keys are fkparentId and fkch1Id (primary key from ChildTable1)
in ChildTable3, primary key is ch3Id and foreign keys are fkparentId, fkch1Id and fkch2Id (primary key from ChildTable2).
And this goes on..
I want to write a query to delete these tables hierarchially in the following manner.
First delete ChildTable3 > then delete ChildTable2 > then delete ChildTable1 and finally delete ParentTable.
I have a vague idea of doing this like
delete from ChildTable3
where fkch2Id = ch2.ch2Id
and fkch1Id = ch1.ch1Id
and fkparentId = p.parentId
then proceeding to ChildTable2 for deletion and so on. Hope I made it clear.
A:
You can do same thing without any query by setting cascade on delete on foreign key definitin.
if you don't set foreign key definiton on db you can delete records on fkparentId like this.
declare @parentId int = 3
delete from ChildTable3 where fkparentId = @parentId;
delete from ChildTable2 where fkparentId = @parentId;
delete from ChildTable1 where fkparentId = @parentId;
delete from ParentTable where parentId = @parentId;
| 2024-01-03T01:26:18.401715 | https://example.com/article/1214 |
Long-term prognosis and factors associated with damage accrual in Japanese patients with systemic lupus erythematosus.
Using a single-center cohort of Japanese patients with SLE, we attempted to clarify the long-term outcome and factors associated with damage accrual using the Systemic Lupus International Collaborating Clinics/American College of Rheumatology Damage Index (SDI). We examined a cohort of 557 patients who had been referred to Niigata University Hospital and diagnosed as having SLE between 1961 and 2013. The patients' data at the latest visit were collected from their clinical records, and causes of death were defined on the basis of those data. Survival from the time of diagnosis was calculated by the Kaplan-Meier method. The SDI was calculated and analyzed using Spearman's correlation coefficient and stepwise multiple regression analysis to reveal the factors associated with any organ damage. Data from 458 of the patients were successfully obtained. The overall 5-year survival rate was 92.2%, and patients diagnosed after 2000 had a significantly high 5-year survival rate of 96.4%. Stepwise multiple regression analysis selected serum creatinine levels (B = 0.6051, p < 0.0001), age (standardized beta = 0.2762, p < 0.001), hypertension (standardized beta = 0.2267, p < 0.001), and antiphospholipid antibody syndrome (standardized beta = 0.1533, p = 0.005) as positive independent variables, whereas administration of bisphosphonate (standardized beta = - 0.1295, p = 0.016) was selected as a negative independent variable. These results suggest that Japanese patients with SLE have a favorable long-term prognosis, and also indicate that disease control as well as management of chronic complications such as hypertension and osteoporosis has possible effects for prevention of organ damage. | 2024-01-05T01:26:18.401715 | https://example.com/article/8069 |
@model List<KeyValuePair<int, string>>
<div class="form-group">
<label class="form-label col-sm-2">字典类型</label>
<div class="col-sm-10">
<select class="form-control" v-model="DictType" size="1">
<option value="">请选择</option>
@{
if (Model.Any())
{
foreach (var item in Model)
{
<option value="@item.Key">@item.Value</option>
}
}
}
</select>
</div>
</div> | 2024-05-17T01:26:18.401715 | https://example.com/article/7809 |
StreetWise
StreetWise is a street magazine sold by people without homes or those at-risk for homelessness in Chicago. Topics covered depend on what is happening in Chicago at the time. In 2003, it had the largest readership of any street publication in the United States of America. Today, it remains among the largest street newspapers in the nation.
StreetWise contains art, poetry, and articles by vendors; as well as stories of local, but nothing about homelessness.
History
In 1991 a group of Chicago business people joined the Chicago Coalition for the Homeless to address the growing problem of street homelessness. In 1992, Judd Lofchie created StreetWise. About 200 vendors sell approximately 20,000 magazines weekly. The vendors buy the magazine for 90 cents each and sell for $2, keeping the profit.
StreetWise was headquartered at 1331 S. Michigan Ave until 2005. It relocated to its 1201 W. Lake St. headquarters until 2011 when it moved to its current headquarters at 4554 N. Broadway in Chicago.
Over time, the magazine has fallen victim to a slow economy. Foundation support had made up nearly half of StreetWise's $500,000 budget but is down 60 percent as of 2012. Ad revenues also are in decline and street sales have dropped 20 percent.
After publishers and board members announced on April 15, 2009 that declining revenues and foundation support might force a closure with 45 days, donations began pouring in. Before the end of the day, an influx of almost $41,000 helped the ailing publication halfway to its goal. Within a week, over $190,000 in donations were made, far exceeding the needed $75,000 to keep afloat.
During a February 2009 meeting, StreetWise's board of directors decided to fire Executive Director Michael Speer and began to discuss potential replacements. Bruce Crane was promoted to turn the company around. Crane reduced operation costs and increased ad sales. The organization went from $200,000 in debt to posting a net income of $1,168 last year under Crane.
Jim LoBianco, the former Commissioner for the Office of Homeless Services in Chicago, succeeded Bruce Crane as the magazine’s executive director on January 1, 2011.
In 2008, the format changed from the original tabloid-style newspaper to a magazine publication and that's where the trouble began. This change was intended to increase readership and advertisement revenue, but instead it was heavy to carry and vendors couldn't afford to or desired to make multiple trips to the office to get magazines to sell.
In 2012, StreetWise began collaborating with The Night Ministry. The objective is to increase the assistance StreetWise provides to Chicago's most vulnerable individuals. StreetWise also launched the Neighbor Carts program. StreetWise vendors will sell fresh produce on Chicago streets as a part of this program. That effort was very short lived.
See also
International Network of Street Papers
North American Street Newspaper Association
References
External links
streetwise.org
Category:Newspapers published in Chicago
Category:Street newspapers
Category:Publications established in 1991
Category:1991 establishments in Illinois | 2024-01-10T01:26:18.401715 | https://example.com/article/8613 |
The mission of Peace Lutheran Church is to welcome all people into the fellowship of God's love by proclaiming the forgiveness of sins through Jesus Christ and to nurture our members with God's Holy Word and Sacraments.
T Confessional T Liturgical T Sacramental T
Peace Evangelical Lutheran Church is a Confessional Lutheran congregation, and a member of The Lutheran Church - Missouri Synod, belonging to the Michigan District. We subscribe unconditionally to the Book of Concord of 1580 (see Our Beliefs). We practice what we believe, and we believe what we practice. While other churches seek to be relevant and entertaining, we seek to be faithful to Holy Scripture and our Lutheran Confessions. Our focus in both worship and study is on Jesus Christ, the Lamb of God who takes away the sin of the world. We observe the Historic Liturgy handed down to us in the one, holy, catholic, and apostolic church. You won't find the latest "Christian" fads and gimmicks in our church. You won't be entertained by "praise bands" or called upon to follow the bouncing ball on big screens. What you will find is reverence and awe as we gather in the very presence of our Lord in His Holy House to receive His divine gifts of forgivness, life, and salvation through His Holy Word and Sacraments. If you are looking for authentic and historic Christianity, substantive and reverent Christian worship, and a holy encounter with our Holy Lord, you will find it at Peace.
T Christ-centered T Cross-focused T
Join us for Divine Service every Sunday at 9:30 a.m.(Holy Communion celebrated and received every Sunday)A time of Fellowship with snacks and coffee follows Divine ServiceAdult Bible Study every Sunday at 11:00 a.m.Sunday School for children of all ages every Sunday at 11:00 a.m. (Sept. - May)
Wednesday Evening Study and Service(We observe and celebrate the Feasts/Festivals of the Church's Sanctoral Calendar with Divine Service on Wednesdays)Bible Study at 6:00 p.m., Service at 7:00 p.m.During Advent and Lent, Bible Study is at 5:00 p.m., Potluck or Soup dinner at 6:00 p.m., Service at 7:00 p.m.
"Together in the Word" Bible Study"Together in the Word" Bible Study every Thursday at 10:00 a.m. | 2024-01-01T01:26:18.401715 | https://example.com/article/6980 |
From LA to Leeds with love. Joe Jeans use the latest technologies to create jeans that have a flawless fit with a distinctive rock and roll look. These Charlie skinny fit jeans with a high rise have a classic five pocket design with zip fly and rivets to the front pockets. Brand details include engraving to the rivets and top button as well as small leather tab to the top of the rear right pocket and a larger tab to the waistband.
Fit- skinny
Wash – black
Fabric – 56% rayon, 25% cotton, 18% polyester and 1% spandex
Rise – 10½
Inseam –31
Ankle opening –10
Measurements in inches are taken from a size 26. Sizes will vary depending on your chosen size. | 2023-10-03T01:26:18.401715 | https://example.com/article/7641 |
VALIENTE ROCKS ON TO RETAIN TITLE IN THE COLORADO OPEN, PRESENTED BY J-5 EQUESTRIAN, AMIDST POLOFEST EVENT
| 08/27/18
Valiente claimed its second consecutive title in the Colorado Open Polo Championship, presented by J5 Equestrian, defeating newcomer Scone Polo 9-7 on August 25.The tournament took place at Valiente Polo Farm outside Denver. The final was held at Denver Polo Club in Sedalia in conjunction with PoloFest Denver 2018, an all-day music festival with top artists that drew a crowd of several thousand who danced and watched polo.
Scone was awarded the first-leg of the Triple Crown of Polo. The second leg is this weekend at Aspen Valley Polo Club, the final is Sunday September 2nd; the third leg for 2018 will be played in Wellington on November 14, Audi vs. Brasil. The 2019 Triple Crown of Polo will be played in Wellington this coming Winter.
The tournament offered prize money with a unique reward system for teams, players and horses. Of the $120,000 total, $40,000 was donated to the Equine Partnership Program, a local nonprofit organization that uses horses in psychotherapy sessions for the underprivileged. The remaining prize money was distributed over the course of the tournament. After each game the winning team received $6,000, with the Most Valuable Player and Best Playing Pony each getting $1,000. The prize money went up for the final, with $22,000 to the winning team and the MVP and BPP each receiving $3,000.
Opening the tournament August 11 with a narrow victory over Hawaii, Valiente found their stride in the remainder of the tournament with a revamped line-up including father and son Adolfo and Poroto Cambiaso, who was named MVP. Combining for 5.0 goals per game, the Cambiasos were joined by Santi Torres, who had a strong tournament finishing with eight goals, and Bob Jornayvaz, who was active as a receiver downfield.
Valiente was strong defensively, conceding just four goals in each of their remaining group games against Colorado and Scone to book their spot in the finals. In their final match-up against Scone, Valiente raced out to an early lead after two Cambiaso goals and didn’t look back as they never trailed in the game. With Adolfo Cambiaso managing the back, Poroto and Santi continued to impress as they were active around goal consistently throughout the tournament, helping Valiente shoot 52% from the field, which was best among the four teams and a crucial component to Valiente’s success.
Finalist Scone produced a strong showing, with its only losses coming to Valiente. Displaying a balanced offensive attack that saw three of their four players finish with at least 8 goals, Scone got off to a strong start thanks to the work of Guillermo Terrera who was MVP of the opening weekend. Agustin Nero was a strong complement to Terrera at the back as the two worked seamlessly together to create scoring chances for Scone.
The strength of Scone was shown in their ability to make adjustments as they outscored their opponent in the second half of every game. Whether it was the transition of Terrera from the front of the game to the back or using Augusto Romero more downfield, Scone consistently finished effectively, including a comeback against Colorado.
In one of the most exciting games of the tournament, a dominant sixth chukker from Hawaii saw them erase a three-goal deficit to outscore Colorado 5-0 and steal a 12-10 victory. Trailing throughout the entire game, three goals from Diego Cavanagh, including an impressive run that saw him weave through all four players onthe Colorado defense, gave Hawaii their lone win during group play. Both teams were unable to record a win in their other group games, setting up a rematch in the Subsidiary final with Hawaii once again coming out on top. Tommy Collingwood had a strong showing throughout the tournament in the back position, allowing 9-goaler Cavanagh to attack downfield.
While Colorado remained winless, they held leads in the second half in two of their three group games and were unable to hold on for the victories. Juan Martin Obregon and Pablo Spinacci displayed an effective transition that created numerous chances for Colorado, but it was missed opportunities late in games that kept them from challenging for the tournament victory. | 2024-02-03T01:26:18.401715 | https://example.com/article/3763 |
Q:
I get errors when viewing forms in the designer - how can i avoid this?
Some of my forms show errors when i load them in the designer. This is because in their constructors they use system settings loaded from a configuration file. When the form is loaded in the designer it uses some random path and unsurprisingly the config file isn't there.
eg.
The configuration file C:\Documents and Settings\Rory\Local Settings\Application Data\Microsoft\VisualStudio\8.0\ProjectAssemblies\it3dtcgg01\PrioryShared.dll.config could not be found.
Is there some way I can deal with this so that the form displays correctly in the designer?
eg:
if (!inDesignerMode)
{
loadSettingsFromConfigFile();
}
UPDATE:
ok, I'm still getting this error. The composition is like this
MyForm.cs
MyCustomControl.cs
In MyCustomControl's constructor I've put
if (!this.DesignMode)
{
// Get settings from config file <- this is where the error occurs
}
but it's on that line that I still get the error in the designer. What gives?
UPDATE: Worth noting this link that describes how to debug design-time controls.
UPDATE: Control.DesignMode isn't set to true when called within the constructor (MSDN) of the object! So that sort of code should go in the onLoad. Alternatively you can use an approach like this
A:
How about simply putting that logic into OnLoad instead, and check DesignMode?
protected override void OnLoad(System.EventArgs e)
{
base.OnLoad(e);
if (!this.DesignMode)
{
/* do stuff */
}
}
| 2023-08-08T01:26:18.401715 | https://example.com/article/3176 |
*maglev-runtime
irNode
"ruby_selector_suffix dependent"
^ GsComSendNode new
rcvr: node irNode;
rubySelector: #'to_a#0__'
| 2024-07-09T01:26:18.401715 | https://example.com/article/8223 |
Advertisement
Food News
Umami Burger's Success With The Vegan Impossible Burger Is Fueling Their Expansion
Umami Burger seems to have found incredible success in their partnership with Impossible Foods. So much so, in fact, that CEO Daniel Del Olmo sees the plant-based patty not just as a single menu option, but as the base for a vast lineup of Impossible Burgers that stack up with Umami's regular offerings.
Umami's newest innovations, Del Olmo told Foodbeast, are just the beginning of that vision. They just unveiled a brand new Vegan Truffle Burger (with a savory vegan truffle cheese), a Vegan Barbecue Burger, and a classic Impossible Burger as new flavors on their menu. While they will be on the menu for three months' time, Del Olmo hopes to have more Impossible Burger creations ready by then to join them.
Advertisement
This marks the beginning of a new phase for Umami and Impossible Foods, who have collaborated on classic burgers and a trio of sliders (inspired by Jaden Smith) in the past. The launch of these three burgers, though, coincides with the appeal they have had so far to the public as well as Del Olmo's creative vision for the future of this partnership.
For Del Olmo and Umami, the Impossible Burger has become a huge success. After just selling 50 a day at the initial launch, the plant-based burger now accounts for a fifth of the company's entire sales, according to Del Olmo. Umami Burger general manager Gary Kinsinger also claimed that many of the new customers that show up weekly are there specifically for this buzzworthy vegan burger. This rapid growth in both sales and target audience has happened in the span of less than a year, so it's easy to see the Impossible Burger taking over even more of Umami's sales.
The success of the Impossible Burger should also play into Umami's expansion plans. Following an acquisition by SBE, the sit-down burger chain has been looking to go global with their brand. They plan to open 8-10 new locations per year in places like Japan, the Middle East, the UK, and Europe. While it's resulted in the closure of a few domestic locations, overall, plans are accelerating, and the company has their new vegan patty to thank for that.
Advertisement
Kinsinger told Foodbeast that in every market they've put the burger in so far, the Impossible has done "very well," as evidenced by the patty becoming a fifth of the chain's revenue. Thus, as the chain's aspirations and size continues to build, so should their innovation and spread of the Impossible Burger.
It's a win-win for both companies in this regard. Umami is definitely getting a boost in sales, awareness, and customer base by utilizing a well-known and quality brand for their vegan and vegetarian options. On the other hand, Impossible Foods could see their product make its way out of the USA for the first time, a major step forward for the plant-based meat movement. | 2023-12-27T01:26:18.401715 | https://example.com/article/5136 |
On the same day that Toronto Police executed search and seizures on medical marijuana dispensaries across the city in headline-grabbing raids, the jury in the coroner’s inquest into the police shooting of Jermaine Carby found that Carby’s death was essentially racially-motivated homicide. The five-member jury released 14 recommendations and made it clear that Carby’s death was a homicide that was influenced by “unconscious racial bias.”
Carby, 33, was a passenger in a black Volkswagen Jetta on September 24, 2014 when it was pulled over by Peel police for a traffic stop in Brampton. Constable Ryan Reid shot him multiple times, including in the back. The SIU cleared the police officers involved after they claimed Carby had a knife, but another officer who tampered with evidence cast doubt on the very existence of a knife in the first place. However, it is no surprise that the SIU found no wrongdoing for the officers involved, as it has a 98 per cent clearance rate for accused officers, and serves mainly to protect officers from punishment.
The coroner’s inquest has broken two years of secrecy and revealed key details about the case, including the identity of Carby’s killer. The three-week inquest brought back recommendations calling on the Peel Police to develop effective methods of de-escelation and to choose the lowest level of force required, to “develop a method to objectively measure and test the effectiveness of officer training for unconscious bias, mental health issues, de-escalation and use of force,” and to work with diverse communities to be better “exercise sensitivity and discretion concerning interactions with the public.”
The inquest jury’s verdict of homicide is not the same as in a criminal trial. The inquest jury rules that someone is responsible for Carby’s death, but they are not allowed to say who is responsible.
Black Lives Matter
It’s a partial victory that the inquest confirmed the racially-motivated nature of Carby’s murder and released the name of his killer. This was one of the demands of Black Lives Matter-Toronto and Justice for Jermaine Carby campaign and it’s only because of continual mobilizing and pressure that this inquest happened in the first place. As Sandy Hudson from Black Lives Matter-Toronto explained, “it does provide the family answers about what happened to their loved one and an opportunity to seek some form of justice through a civil suit against the officers involved and the police force, should they choose to pursue one. In a system where the Crown consistently refuses to investigate the brutality experienced by black people at the hands of police through a court of law, this opportunity is important.”
But inquests are double-edged: when there are growing demands for justice they can serve to provide the illusion of justice without structural change. As Hudson explains, “Governments and police agencies know what it sounds like to the public when a verdict of homicide is announced: it appears as though there has been some sort of judgment or justice administered. It placates unrest using a system woefully inadequate to actually do or offer what the public is looking for. It’s a way to avoid accountability that could be administered through a criminal court. We should reject the distraction and mirage of justice we’ve constantly been handed over the years once an inquest is complete. We need far more than the minimal amounts of accountability an inquest is able to provide. Recommendations from a coroner’s inquest are not an endgame. They are points that should be organized around. Ending political involvement at this point because some sort of justice seems to be had has done nothing to help us in countless inquest cases in the past. The time for empty recommendations is over. If we’re going to show policy-makers that black lives matter, we cannot do this through an inquest process that is essentially toothless.”
Follow Black Lives Matter-Toronto and Justice for Jermaine Carby | 2024-05-13T01:26:18.401715 | https://example.com/article/1568 |
Besides Family Fun Twin Cities, I spend my 9 to 5 at a day job pursuing my weird passion for calendars and organizing things as a legal secretary. When I get home I spend my time with my four kids, 10, 6, 4 and 1. My amazing husband is both a full-time musician and full-time stay-at-home dad. Together we run a small radio empire — SiaNet Radio — playing, promoting and enjoying the wide variety of local music and art in the Twin Cities. I juggle all this while writing about exploring the Twin Cities with kids. I couldn’t be happier.
I always leave Open Window Theatre thinking, “I need to do this more often.” Going to Open Window combines the fun of going out with the relaxed atmosphere of watching television. I think the only thing that would make the experience better is if they replaced their current seating with love seats and easy chairs. (Maybe they will do that. They are expanding next season). You can learn a little more about Open Window and their Mission from Gianna, here.
Saturday’s date night to see The Potting Shed was the usual reminder that I want to do this more often. One thing that made it a great date night is that, not only did it not require preparation, I actually enjoyed myself more going in cold. I’ve never taken a theater appreciation course and I’m not a theology major, and that’s okay. I just enjoyed the story and I actually was on the edge of my seat for portions of the show — just like they claimed. It was really no more effort than watching a movie. That isn’t always true in live theatre.
I did go in knowing that I love Graham Greene as a writer and that Graham Greene and Open Window always have a faith connection. I don’t want to give too much away, but if you like mysteries and drama, you’ll enjoy a night out to see the Potting Shed.
While children over 4 are always welcome at Open Window, this play is recommended for 13+. There’s nothing objectionable; it just won’t interest most children.
About the author
Joy Peters
Joy Peters - co-creator and writer for FamilyFunTwinCities.com.
Besides Family Fun Twin Cities, I spend my 9 to 5 at a day job pursuing my weird passion for calendars and organizing things as a legal secretary. When I get home I spend my time with my four kids, 10, 6, 4 and 1. My amazing husband is both a full-time musician and full-time stay-at-home dad. Together we run a small radio empire — SiaNet Radio — playing, promoting and enjoying the wide variety of local music and art in the Twin Cities. I juggle all this while writing about exploring the Twin Cities with kids. I couldn’t be happier. | 2024-07-16T01:26:18.401715 | https://example.com/article/9031 |
887 F.2d 1082Unpublished Disposition
NOTICE: Fourth Circuit I.O.P. 36.6 states that citation of unpublished dispositions is disfavored except for establishing res judicata, estoppel, or the law of the case and requires service of copies of cited unpublished dispositions of the Fourth Circuit.UNITED STATES of America, Plaintiff-Appellee,v.Cindy Leigh SARNO, Defendant-Appellant.
No. 88-5626.
United States Court of Appeals, Fourth Circuit.
Submitted: July 21, 1989.Decided: Oct. 2, 1989.
Anne R. Littlejohn, on brief, for appellant.
Robert H. Edmunds, Jr., United States Attorney, and Paul A. Weinman, Assistant United States Attorney, on brief, for appellee.
Before MURNAGHAN, WILKINSON and WILKINS, Circuit Judges.
PER CURIAM:
1
Cindy Leigh Sarno appeals the sentence imposed after she entered a guilty plea to interstate transportation of falsely made and forged securities. 18 U.S.C.A. Sec. 2314 (West Supp.1989). Because the offense was committed after November 1, 1987,1 the sentence was governed by the Sentencing Reform Act of 1984, 18 U.S.C.A. Sec. 3551, et seq. (West 1985 & Supp.1989), and the sentencing guidelines promulgated by the United States Sentencing Commission. We affirm.
I.
2
During 1986 and 1987, Cindy Sarno and her husband Mark operated a retail and mail-order furniture business in Greensboro, North Carolina. Mark acted as president of the corporation and Cindy served as its secretary. The corporation obtained several bank loans during this time by submitting false information and tax returns. Also during this period, over 200 mail-order customers paid for merchandise that was never shipped. The Sarnos left Greensboro and moved to Surfside City, South Carolina where Mark began depositing insufficient funds checks drawn on a North Carolina bank. After an arrest warrant was issued for the Sarnos, they fled to Florida. While in Florida they engaged in a check kiting scheme in which Mark or Cindy wrote false or forged checks payable to Mark and deposited them in a Florida bank. The Sarnos were arrested while negotiating similar checks. A checkbook containing checks already filled out was found in the Sarno's home after their arrest.
3
Both Sarnos were indicted for bank fraud, 18 U.S.C.A. Sec. 1344 (West Supp.1989), and Mark was charged in a separate indictment with sixty counts of wire fraud, 18 U.S.C.A. Sec. 1343 (West 1984). Cindy entered into an agreement by which she pled guilty to an information that charged her with interstate transportation of forged checks ("check kiting"). In return the bank fraud indictment against Cindy was dismissed. The offense to which Cindy pled guilty has a base offense level of 6. Guideline Sec. 2F1.1(a). The district court adopted the presentence report which recommended an increase of 6 levels because the amount of loss was between $100,001 and $200,000, Guideline Sec. 2F1.1(b)(1)(G), an increase of 2 levels for more than minimal planning, Guideline Sec. 2F1.1(b)(2), and a decrease of 2 levels for acceptance of responsibility, Guideline Sec. 3E11.1(a). Cindy's resulting offense level of 12 and criminal history category of II provided a sentencing range of 12-18 months, and the court sentenced her to 18 months.
4
Cindy challenges the amount of loss used to determine the specific offense characteristic under Guideline Sec. 2F1.1(b)(1) on three grounds. First, she argues that the court should not have included the losses identified in the dismissed indictment for bank fraud. Second, she contends that the court erred by including the amount of unnegotiated checks found in a checkbook at her home. Finally, she challenges the inclusion of losses resulting from wire fraud for which her husband was indicted.
II.
5
Cindy's challenge to the inclusion of losses alleged in the dismissed indictment for bank fraud is without merit. Paragraph 6 of the Commentary to Guideline Sec. 2F1.1 states that "[t]he cumulative loss produced by a common scheme or course of conduct should be used in determining the offense level, regardless of the number of counts of conviction." Additionally, the Commentary to Guideline Sec. 1B1.3 states that "[c]onduct that is not formally charged or is not an element of the offense of conviction may enter into the determination of the applicable guideline sentencing range." As long as the court found that the bank fraud was a part of a common scheme or course of conduct, Cindy need not have been convicted of the bank fraud for the court to consider the bank fraud losses under Guideline Sec. 2F1.1(b)(1). Cindy participated in the bank fraud by signing the loan documents as a corporate officer with knowledge that the documents contained false information. When an arrest warrant was issued for the Sarnos, she participated in the check kiting scheme to finance the Sarnos' flight to avoid arrest. Clearly the bank fraud and the check kiting were a part of a common course of conduct. Accordingly, the district court correctly included the losses incurred as a result of the bank fraud.
6
We need not address her other two contentions. Whether the amount of unnegotiated checks and the amount of loss caused by the customer fraud are included in the calculation or not, the total loss would remain within the amounts calling for a 6-level increase and thus the sentencing range of 12-18 months would be unaffected.
III.
7
We dispense with oral argument because the facts and legal contentions are adequately presented in the materials before the court and argument would not aid the decisional process.
8
AFFIRMED.
1
The offense to which Cindy pled guilty occurred after November 1, 1987. Although Cindy's entire course of conduct began in 1986, the presentence report that the court adopted included only losses from offenses committed after November 1, 1987 in determining Sarno's sentence. The government notes that the entire amount of losses could have been included because the conduct constituted a continuing offense. The government failed to object to this omission in the district court andconsequently we will not address this issue on appeal
| 2024-02-09T01:26:18.401715 | https://example.com/article/3160 |
Sen. Bernie Sanders Bernie SandersMcConnell accuses Democrats of sowing division by 'downplaying progress' on election security The Hill's Campaign Report: Arizona shifts towards Biden | Biden prepares for drive-in town hall | New Biden ad targets Latino voters Why Democrats must confront extreme left wing incitement to violence MORE (I-Vt.) has gained some breathing room in the New Hampshire Democratic presidential primary just after former South Bend, Ind., Mayor Pete Buttigieg Pete ButtigiegBogeymen of the far left deserve a place in any Biden administration Overnight Defense: Woodward book causes new firestorm | Book says Trump lashed out at generals, told Woodward about secret weapons system | US withdrawing thousands of troops from Iraq A socially and environmentally just way to fight climate change MORE pulled into a near-tie with the Vermont senator last week, according to a WBZ–Boston Globe–Suffolk University tracking poll released Monday.
The poll shows Sanders with an 8-point lead in the Granite State, receiving the backing of 27 percent of respondents. Buttigieg was second in the poll with 19 percent of the vote and Sen. Amy Klobuchar Amy KlobucharEPA delivers win for ethanol industry angered by waivers to refiners It's time for newspapers to stop endorsing presidential candidates Biden marks anniversary of the Violence Against Women Act, knocks Trump and McConnell MORE (D-Minn.) surged to third place with 14 percent.
Former Vice President Joe Biden Joe BidenCast of 'Parks and Rec' reunite for virtual town hall to address Wisconsin voters Biden says Trump should step down over coronavirus response Biden tells CNN town hall that he has benefited from white privilege MORE and Sen. Elizabeth Warren Elizabeth WarrenWarren, Schumer introduce plan for next president to cancel ,000 in student debt The Hill's 12:30 Report - Presented by Facebook - Don't expect a government check anytime soon No new taxes for the ultra rich — fix bad tax policy instead MORE (D-Mass.) gained 11.8 percent and 11.6 percent of the vote, respectively, to fall within the margin of error for third.
ADVERTISEMENT
Buttigieg’s performance in the Iowa caucuses may have led to a bump last week that has faded following Friday’s Democratic debate, David Paleologos, director of the Suffolk University Political Research Center, told CBS Boston.
“This is the first time all of the survey is post-debate,” Paleologos said. “Whether Klobuchar’s spike is temporary remains to be seen. Sanders’s improvement comes in two areas: the West/North region — the four counties that know him best — and people torn between him and Warren. If Klobuchar were to finish third or fourth, she’s going to knock someone into that fifth spot, a real dire place to be for Biden or Warren.”
Sanders has led the field in most polls ahead of the first-in-the-nation primary Tuesday, while most polling also has Buttigieg solidifying his position in second place after being awarded the most delegates in the Iowa caucuses.
The tracking poll surveyed a two-day rolling sample of 500 New Hampshire likely Democratic primary voters and has a margin of error of plus or minus 4.4 percentage points. | 2024-06-23T01:26:18.401715 | https://example.com/article/3002 |
A mesmerising hill station in Idukki district, Munnar was the favored summer resort of the erstwhile British rulers in the colonial days.
Munnar is not just Kerala’s most sought-after hill resort, it is also the centre of the state’s tea growing district, aptly known as the High Range. In Tamil, moon aar literally means ‘three rivers’, a reference to the streams around whose confluence the town grew. The Nallthanni and Kundale streams flow into the Muthirapuzha River here. Tea is Munnar’s claim to fame. More than 12,000 hectares of lush, manicured tea fields form an irresistible canvas against which honeymooners pose. Stately eucalyptus plantations, which fuel the many tea factories in the vicinity, sway gently in the wind, their fragrance wafting over Munnar. And shola trees hug the mist-shrouded hillsides, sheltering many endangered species of wildlife. For the more adventurous, there’s the challenge of climbing the 8,841 ft Anaimudi, the highest peak in India south of the Himalaya, which towers majestically over the town.
Munnar is situated at the confluence of three mountain streams - Mudrapuzha, Nallathanni and Kundala. The hill station in God's own country is known for its serenity and remarkable beauty. Set amidst thriving green tea plantations, exotic wildlife and clear trout streams, Munnar is a delight for adventure seekers. Hill View Park, Sita Devi Lake and Mattupetti Dam are some the major tourist attractions.
Munnar is in a valley hemmed in by hills. Many of its attractions are to be found on its outskirts, within a radius of 30 km from the town. All these places are part of the Munnar experience, and are linked to it by local bus, taxis and autos along a network of excellent roads. Contact DTPC for information and bookings, trekking, sightseeing, tickets for boating at Mattupetty Dam and cycles on hire.
There are numerous things to see and experience in Munnar, provided you have the right information. With a host of exciting things to do in Munnar, travelers can thoroughly enjoy the experience of exploring this destination. If you are travelling for the first time, the Munnar travel guide may help resolve most of your queries about Munnar. In fact, it is like a veritable information packed handbook on Munnar tourism. All you need is a list of options on topics such as where to stay, what to eat, weather in Munnar and places to visit in Munnar and you can be guaranteed an awesome trip to Munnar. | 2024-06-30T01:26:18.401715 | https://example.com/article/9237 |
let s:save_cpo = &cpoptions
set cpoptions&vim
let s:V = vital#iced#new()
let s:Promise = s:V.import('Async.Promise')
let s:default_timeout_ms = 3000
let g:iced#promise#timeout_ms = get(g:, 'iced#promise#timeout_ms', s:default_timeout_ms)
function! iced#promise#new(fn) abort
let Fn = (type(a:fn) == v:t_func) ? a:fn : function(a:fn)
return s:Promise.new(Fn)
endfunction
function! iced#promise#call(fn, args) abort
let Fn = (type(a:fn) == v:t_func) ? a:fn : function(a:fn)
let arg_type = type(a:args)
if arg_type == v:t_list
return s:Promise.new({resolve -> call(Fn, copy(a:args) + [resolve])})
elseif arg_type == v:t_func
return s:Promise.new({resolve -> call(Fn, a:args(resolve))})
endif
throw iced#message#get('invalid_format', a:args)
endfunction
function! iced#promise#wait(x, ...) abort
let timeout = get(a:, 1, g:iced#promise#timeout_ms)
let p = (type(a:x) == v:t_list) ? s:Promise.all(a:x) : a:x
return s:Promise.wait(p, {
\ 'timeout': timeout,
\ 'interval': 1,
\ })
endfunction
function! iced#promise#sync(fn, args, ...) abort
let timeout = get(a:, 1, g:iced#promise#timeout_ms)
let [result, error] = iced#promise#wait(iced#promise#call(a:fn, a:args), timeout)
if error isnot# v:null
throw string(error)
endif
return result
endfunction
function! iced#promise#resolve(x) abort
return s:Promise.resolve(a:x)
endfunction
function! iced#promise#reject(x) abort
return s:Promise.reject(a:x)
endfunction
function! iced#promise#is_promise(x) abort
return s:Promise.is_promise(a:x)
endfunction
" For debugging
function! iced#promise#sleep(ms, ret) abort
return s:Promise.new({resolve -> timer_start(a:ms, {-> resolve(a:ret)})})
endfunction
let &cpoptions = s:save_cpo
unlet s:save_cpo
| 2024-05-13T01:26:18.401715 | https://example.com/article/9720 |
Paula, 37, married Bronson in prison in November, 2017, but six months later their marriage is in trouble
Britain's most notorious prisoner is having marriage troubles just months after his prison nuptials, it has been revealed.
Charles Bronson married his soap star wife Paula in November 2017, but the newlyweds are having some teething issues.
Paula, 37, has admitted their relationship has been rocked by Bronson's bad behaviour and bizarre demands.
The actress, formerly known as Paula Williamson, has reportedly been ordered by Bronson to stay slim by doing 400 sit ups a day as he tells her 'don't get fat'.
Adding to his wife's misery, Bronson, 65, may have scuppered his chances of getting parole after 40 years behind bars – after he stripped off, covered himself in butter and challenged guards to a fight.
A source close to the pair last night told The Mirror: 'Paula loves him dearly but this year has been a string of disasters for them as a couple.
'She was upset when she learnt he had been moved to a prison hundreds of miles away because he went for the deputy governor. They were hoping for a successful parole hearing and he'd start to move towards release but by losing his head he's put their future in jeopardy.'
Charles Bronson, 65, and his bride, 37, have endured a rocky start to their relationship over strange demands from Charles, it is claimed
Paula married Bronson in HMP Wakefield in West Yorkshire in November 2017. After a row over his wedding pictures he was moved to Frankland prison in County Durham, hundreds of miles away from his wife.
In another blow to the Bronson marriage, Paula has reportedly learned her new husband is still in contact with Lorraine Etherington – his ex.
Bronson is reportedly writing to her – upsetting his third wife.
Paula told The Mirror: 'I love Charlie but I can't deny that things have become very difficult.'
The couple were married in front of an audience of four, and came down the aisle to the Death March after Bronson switched the music.
Paula's wedding ring bears the date of the big day as well as Bronson's old jail number, 1314.
The prisoner wore a trilby and Union Jack shoes and socks with moustache pictures on them.
Months after the ceremony, the inmate's supporters are complaining about his treatment in prison.
After staff shortages at HMP Frankland - dubbed Monster Mansion as it houses some of the UK's most dangerous prisoners – the prisoner had to meet visitors in a 'secure room'.
Separated by a bullet proof window he could not be handed two apple pies, his favourite food, some bananas and a milkshake.
Pal Rod Harrison, who was best man at Salvador's wedding to Paula Williamson in November last year, said during a visit last week he took in the treats in for Salvador.
He said, however, he was not allowed to hand them over to the prisoner - who has been in jail since 1974 - after prison chiefs said there were 'staffing issues'.
Writing last week, Mr Harrison - known as Rod the Mod to pals - said that 'due to staffing issues', Salvador was not even allowed his 'legal visits' from lawyers in the normal visiting room.
Charles Bronson, who changed his name to Charles Salvador while behind bars was jailed in 1974 but has been unable to get parole because of his violent behaviour
He added: 'His other visits are closed behind glass, not as a punishment, but because they say they have not got enough officers to oversee the visit.
'After purchasing food on my last visit for us both, when I got on the visit I was told there was no staff to take Charlie's canteen to him.
'So we sat there for over a hour and a half with Charlie looking at his canteen through the glass - he was not even allowed a drink.'
In a poem written on the day of the visit from Mr Harrison - on April 19 this year - Salvador wrote how he was left 'dribbling' looking at two apple pies Mr Harrison had brought in for him.
Salvador wrote: 'Two apple pies and bananas looking at me - with a bottle of (milk)shake behind bullet proof glass*just looking - eat me, drink me, here I am.
'Cruel and nasty, just looking at me, I'm dribbling. Hungry.
'What a joke, what a farce, life's so unfare (sic) - a plate full of goodies, a dream like vision, bloody looking at me - I'm going to bed, goodnight.'
Bronson, who is now called Charles Salvador after changing his name by deed poll in tribute to artist Salvador Dali, is serving a life sentence for robbery and kidnap in Wakefield prison.
Bronson was jailed for armed robbery in 1974 but has seen time added on to his sentence for multiple violent outbursts inside.
Paula appeared as a stripper in Emmerdale and on Coronation Street in 2008, 2011 and 2012 as an unnamed Nurse at Weatherfield General. | 2023-10-17T01:26:18.401715 | https://example.com/article/6977 |
Q:
Binary Search Tree can't compare node to null
I'm trying to do method that removes node from Binary search tree and I know my programming logic is right but I can't compare my focus node to the node's parents left child. It has to be sometimes null and I should be able to compare it to object right?
Here is my code:
public void deleteNode(Node node) {
if (node.getParent().left().root == node) {
node.getParent().setLeft(null);
} else {
node.getParent().setRight(null);
}
}
So the line that is causing problems is:
node.getParent().left().root == node
Because it gives Nullpointerexception. But I know that it should be null, that is the point of the code. I wouldn't want to use try catch with NullPointerException either because it is bad.
A:
Ok let's analyze your code since you're not reading the comments:
public void deleteNode(Node node) {
if (node.getParent().left().root == node) {//this is where you get NullPointerException
node.getParent().setLeft(null);
} else {
node.getParent().setRight(null);
}
}
Why are you getting a NullPointerException on the line if (node.getParent().left().root == node) ?
You get it because: node.getParent() is equal to null OR node.getParent().left() is equal to null. You cannot call a method on null.
Suppose node.getParent() is null in that case you are calling null.left().
Does it makes sense?
Change your code in order to avoid a NullPointerException:
if (node.getParent() != null) {
if (node.getParent().left() != null && node.getParent().left().root == node)
node.getParent().setLeft(null);
else
node.getParent().setRight(null);
}
Note: @user3790046 I didn't change your logic. I don't know whether it makes sense or not, I just added the relative checks to avoid the NullPointerException.
| 2024-02-25T01:26:18.401715 | https://example.com/article/7795 |
(OTTAWA) March 29, 2017 - Delegates from the Green Party of Canada join more than 2,000 attendees from over 90 countries for the Global Greens Congress that runs March 30 to April 2 in Liverpool, U.K.
Party attendees include:
Elizabeth May, Leader of the Green Party of Canada (MP, Saanich-Gulf Islands), Co-Chair of the Global Greens Parliamentarians Association
Ken Melamed, President
Jean Rousseau, Vice-President – French
Cherie Wong, Co-Chair, Young Greens Council
Ian Soutar, Young Greens Council
Ms. May will present at plenary on international trade, and at additional sessions on climate change and electoral reform. As Co-Chair of the Global Greens Parliamentarian Association, Ms. May will convene a meeting of attending Green parliamentarians. More than 400 Green parliamentarians in approximately 25 national-level parliaments around the world are members of this association.
Held every five to seven years, the Global Greens Congress is the primary decision-making body of the Global Greens. Global Greens are are united by the core principles of the Global Greens Charter of Ecological Wisdom; Social Justice; Participatory Democracy; Nonviolence; Sustainability; and Respect for Diversity.
- 30 -
For additional information or to arrange an interview, contact:
Dan Palmer
Press Secretary | Attaché de presse
dan.palmer@greenparty.ca
m: (613) 614-4916 | 2024-05-01T01:26:18.401715 | https://example.com/article/6473 |
Q:
Javascript not populating fields on click
I have the following form which I want to populate with values for input and textarea
<form id="message-form" method="post">
<input type="hidden" name="user_id" id="user_id">
<textarea id="message" cols="40" rows="3"></textarea>
<button class="button">Send</button>
</form>
I made the following function which doesn't seem to work as I expect. I initiate the function using initMessageForm(1,'Name'):
function initMessageForm(user_id, name){
console.log('Clicked on Send Message Button');
var form = document.getElementById('message-form');
form.getElementById('user_id').value = user_id;
form.getElementById('message').placeholder = 'Your Message to ' + name;
}
The final output should be:
<form id="message-form" method="post">
<input type="hidden" name="user_id" id="user_id" value="1">
<textarea id="message" cols="40" rows="3" placeholder="Your Message to Name"></textarea>
<button class="button">Send</button>
</form>
A:
form.getElementById is not a valid function. You should use document.getElementById instead:
function initMessageForm(user_id, name) {
var form = document.getElementById('message-form');
document.getElementById('user_id').value = user_id;
document.getElementById('message').placeholder = 'Your Message to ' + name;
}
initMessageForm('1', 'Name');
<form id="message-form" method="post">
<input type="hidden" name="user_id" id="user_id">
<textarea id="message" cols="40" rows="3"></textarea>
<button class="button">Send</button>
</form>
| 2024-07-08T01:26:18.401715 | https://example.com/article/9938 |
EXO‘s Chanyeol sat down for an interview on June 5 with News 1 to talk about what’s been going on in his life recently, both individually and as a member of the hugely popular group.
When talking about EXO’s recent comeback with their track “Love Me Right,” he says, “It’s really great because we’re smiling while we’re performing. It’s fun.”
He’s also asked about the guys’ recent stunt in which Chanyeol, Kai, Baekhyun, and Chen all dressed up in football gear and pretended to be playing football outside of the KBS building when they were heading in to film “Music Bank.”
“We were disappointed that we only got to wear the football uniforms when we were filming the music video. We couldn’t dance in them, so we wondered what would be the best way to show them off. We came up with the plan because we thought it would be fun to show them off somewhere like that.”
Chanyeol recently appeared on “Superman Returns” with his fellow member Baekhyun when they went to Lee Hwi Jae‘s place to meet his adorable twin boys Seo Eon and Seo Joon. Seo Eon is known for being shy around strangers, but he warmed up to Chanyeol almost right away. He even held out his arms to Chanyeol soon after they met, wordlessly asking Chanyeol to pick him up.
“I love the twins so much that I pestered our manager about how I wanted to go on ‘Superman Returns,'” Chanyeol says. “Our manager is friends with Lee Hwi Jae’s manager, so that’s how we were able to go on the show.”
“I haven’t missed watching a single episode of ‘Superman Returns’ since the twins were really young,” he adds. “It wasn’t included in the show, but when I went grocery shopping with Seo Joon, I asked him ‘Seo Joon, do you like me?’ and he said yes. I almost cried. When I asked him again at home, he didn’t do it that time.”
Chanyeol also talks about his friendship with comedian Park Myung Soo. On his radio show, Park Myung Soo recently listed the idol singers that he treasures the most, and Chanyeol was fourth on the list. “I just talked to him earlier,” says Chanyeol. “I met him when I was on ‘Infinity Challenge,’ but we didn’t have a chance to meet properly after that.”
He laughs as he adds, “I’m not sure why he is so kind to me, but I’m grateful.”
Lastly, Chanyeol is asked about his recently collaboration with MFBTY at “2015 Dream Concert.” As Chanyeol is a rapper himself, the interviewer says that it must have very meaningful for him to have the chance to perform with Tiger JK. “He’s someone I’ve liked since I was young,” says Chanyeol. “It was an honor to perform with him, and we became friends.”
“It was my first collaboration,” he adds, “but I’ve always wanted to do that type of thing. It’d be great if I can do more of it in the future.”
Source (1) | 2023-11-09T01:26:18.401715 | https://example.com/article/4055 |
Quantitative detection of the molecular changes associated with early cataractogenesis in the living human lens using quasielastic light scattering.
We have used quasielastic light scattering to detect and quantitatively characterize the molecular changes associated with the early stages of cataractogenesis in the living human lens. The autocorrelation function of the fluctuations in the light scattered by the lens shows the presence of two major species responsible for the scattering. The first, fast diffusing species (f), has a diffusivity of approximately 3 x 10(-7) cm2/sec and corresponds to the alpha crystallin proteins. The second, slow diffusing species (s), has a diffusivity of approximately 10(-9) cm2/sec and corresponds to the diffusivity of a large aggregate. The intensity of light If and Is scattered into the collection optics by each of these species was also measured. We studied a group of 49 individuals ranging in age from 21 years to 82 years. In this group 40 presented with preoperative cataract development. In this patient population we found that regardless of age, or position in the lens that a plot of Itot = If+Is versus Is could be well fitted by a straight line with a slope less than unity and a positive intercept Ifo. It has been possible to explain this finding using a two state model for the molecular changes associated with early cataractogenesis. In this model the proteins in the slow diffusing species are aggregates each containing a definite number of rapidly diffusing proteins. The early development of cataract is represented by the redistribution of protein between the unaggregated form (f) and the aggregated form (s). The prediction for the relationship between Itot and Is based on this two state model is in very good agreement with our experimental data. Indeed the measured position of the point (Itot, Is) along this line provides a sensitive, and quantitative measure of the degree of cataract development at any selected location in the lens. | 2024-03-01T01:26:18.401715 | https://example.com/article/5834 |
**Core tip:** In this study, we sought to identify biomarkers that could help predict the risk of postoperative pancreatic fistula (POPF) after pancreaticoduodenectomy. Diagnosis of POPF was based on the International Study Group of Pancreatic Fistula criteria. Association between POPF and various clinical and biochemical parameters was assessed. Amylase level in the abdominal drainage fluid on postoperative day 1 and serum amylase level on postoperative day 4 showed a significant association with POPF and represent novel biomarkers associated with POPF development.
INTRODUCTION
============
Pancreaticoduodenectomy (PD) is a common operative approach for treatment of various malignant diseases of the distal biliary duct, the head of pancreas, and the peri-ampullar region. It is also widely acknowledged as one of the most challenging surgical procedures. PD is associated with substantial perioperative mortality (2%-5% even in high-volume centers) and morbidity (30%-50%)\[[@B1],[@B2]\]. Postoperative pancreatic fistula (POPF) is one of the most important complications of PD; reported incidence rates range from 2% to 25%\[[@B3]\]. POPF often leads to further complications, such as hemorrhage and abdominal abscess, and is associated with increased length of hospital stay\[[@B3],[@B4]\]. POPF and other PD-associated complications have necessitated the development of new surgical modalities, like a combination of pancreaticojejunostomy with duct-mucosa pancreaticojejunostomy; however, the incidence of POPF following PD continues to be a concern\[[@B5]\].
Various pre-operative and intra-operative factors, such as preoperative jaundice and diameter of the pancreatic duct, are associated with POPF; however, these factors are not reliable predictors of POPF\[[@B6],[@B7]\]. Biochemical markers in serum and drainage fluid may reflect the disease progression, and it is of translational significance to investigate their correlation with clinical characteristics and their potential value as predictors of POPF. In this study, we sought to identify potential predictors of POPF development, which may help optimize the treatment of these patients in clinical practice.
MATERIALS AND METHODS
=====================
Study design
------------
We prospectively recruited 83 patients to this study. All patients underwent PD at the Department of Hepatobiliary and Pancreatic Surgery at the First Bethune Hospital of Jilin University between June 2011 and April 2015. Preoperative, intraoperative and postoperative data were collected for each patient. Preoperative variables of interest included age, sex, history of diabetes, jaundice, plasma protein levels and pre-operative intervention for jaundice (if any). Intraoperative variables included pancreatic consistency, diameter of pancreatic duct, and the technique used for pancreatic anastomosis. Postoperative data included the results of pathological examination, pancreatic and gastric drainage volume, and complications after operation, such as POPF, hemorrhage, acute pancreatitis, delayed gastric emptying (DGE), and biliary fistula (Table [1](#T1){ref-type="table"}).
######
Definitions of postoperative complications after pancreaticoduodenectomy
**Complication** **Definition**
------------------ -------------------------------------------------------------------------------------------------------------------------
POPF Drainage fluid amylase activity on or after postoperative day 3 is at least three times the upper limit in normal serum
Ascites Ultrasound evidence of ascites depth \> 5 cm
Hemorrhage Requires postoperative transfusion of ≥ 2 U isogenic red blood cells
Biliary fistula Abdominal drainage produces bilious fluid at 50 mL/d after surgery
DGE Indwelling stomach tube for \> 10 d
POPF: Postoperative pancreatic fistula; DGE: Delayed gastric emptying.
Severity of POPF was classified as grade A, B or C, as defined by the International Study Group of Pancreatic Fistula\[[@B8]\]. Association between surgical outcomes and results of routine serological and biochemical investigations was assessed. The study protocol complied with the principles of the Declaration of Helsinki, and was approved by the Institutional Ethics Committee at the First Hospital of Jilin University. All patients had provided informed consent prior to their enrolment.
Details of clinical management
------------------------------
Forty-three patients received PD with a pancreatic drainage tube (size: 6, 7 or 8) anastomosed to the pancreatic parenchyma during the pancreaticojejunostomy; the tube was then drawn out through the distal bowel. In the remaining 40 patients, the standard Child's procedure was performed with placement of external pancreatic drainage tube (size: 6, 7 or 8), which was fixed to the pancreatic parenchyma and left in the bowel. All patients were treated with cefoperazone and sulbactam (3.0 g/Q12 h) for the first 4 postoperative days (PODs) to prevent infection. Postoperatively, prophylactic intravenous octreotide was administered at a dose of 0.6 mg/24 h for 3 d to reduce the amount of pancreatic secretion.
Statistical analysis
--------------------
Statistical analyses were conducted using SPSS software (version 19.0; SPSS Inc., IBM, Armonk, NY, United States). Univariate and multivariate analyses were performed to identify factors significantly related to POPF. Receiver operating characteristic (ROC) curve analysis was performed to assess the sensitivity, specificity, positive predictive value (PPV), and negative predictive value (NPV) of the identified variables. A *P* value of less than 0.05 was considered indicative of statistical significance.
RESULTS
=======
Incidence of POPF
-----------------
Out of 83 patients, 28 (33.7%) eventually developed POPF. The severity of POPF was classified as grade A in 8 (28%) patients, grade B in 16 (58%) and grade C in 4 (14%) (Table [2](#T2){ref-type="table"}).
######
Summary of postoperative complications
**Complication** **Cases, *n* = 30** **Incidence, %**
---------------------------------- --------------------- ------------------
POPF 28 33.7
Type A 8 28
Type B 16 58
Type C 4 14
Ascites 4 10
Hemorrhage 7 17.5
Biliary leakage 1 2.5
DGE 1 2.5
Postoperative acute pancreatitis 1 2.5
POPF: Postoperative pancreatic fistula; DGE: Delayed gastric emptying.
High amylase level predicts POPF development
--------------------------------------------
We first categorized the patients as POPF and non-POPF groups, and then compared the levels of different parameters between the two groups (Table [3](#T3){ref-type="table"}). On univariate analysis, amylase level in the abdominal drainage fluid on POD1 and serum amylase level on PODs 1 and 4 were correlated with POPF development (*P* \< 0.05) (Table [4](#T4){ref-type="table"}).
######
General risk factors for pancreatic leakage
**Variable** **POPF (*n* = 14)** **Non-POPF (*n* = 26)** ***t*/*z*/*χ*^2^** ***P* value**
--------------------------------------------- -------------------------- ------------------------- -------------------- ---------------------------------------
Age in yr 54.18 ± 6.945 54.04 ± 10.447 0.065 0.948
Sex
Male 20 (71.4) 32 (58.2) 1.391 0.337[1](#T3FN1){ref-type="table-fn"}
Female 8 (28.6) 23 (41.8)
Blood loss in mL 300 (200, 575) 200 (200, 600) -1.266 0.205
Pancreatic duct diameter in mm
\> 3 11 (39.3) 33 (60.0) 3.196 0.104[1](#T3FN1){ref-type="table-fn"}
\< 3 17 (60.7) 22 (40.0)
Preoperative low plasma protein
Yes 7 (25.0) 12 (21.8) 0.106 0.786[1](#T3FN1){ref-type="table-fn"}
No 21 (75.0) 43 (78.2)
Preoperative relief of jaundice
Yes 4 (14.3) 4 (7.3) 1.048 0.433[1](#T3FN1){ref-type="table-fn"}
No 24(85.7) 51 (92.7)
Preoperative jaundice
Yes 18 (64.3) 34 (61.8) 0.048 1.000
No 10 (35.7) 21 (38.2)
Surgical type
External drainage of PD 12 (42.9) 27 (49.1) 0.289 0.647[1](#T3FN1){ref-type="table-fn"}
Internal drainage of PD 16 (57.1) 28 (50.9)
Diabetes
Yes 2 (7.1) 0 (0.0) 4.026 0.111[1](#T3FN1){ref-type="table-fn"}
No 26 (92.9) 55 (100.0)
Duration of surgery in min 267.5 (240.0, 327.5) 280.0 (235.0, 335.0) -0.082 0.935
Hospitalization period in days 15.00 (13.00, 18.00) 21.50 (18.00, 27.75) -4.385 \< 0.001
Drainage fluid amylase level on POD1 in U/L 6017.5 (2494.5, 11752.5) 890.0 (350.0, 1500.0) -5.110 \< 0.001
Serum amylase level in U/L
POD1 379.5 (157.5, 627.5) 124.0 (80.0, 165.0) -4.091 \< 0.001
POD4 30.0 (30.0, 50.0) 61.5 (45.5, 150.0) -4.435 \< 0.001
Serum albumin
POD1 29.5 (25.3, 34.3) 30.7 (26.6, 33.0) -0.125 0.900
POD3 30.1 (25.7, 34.6) 30.4 (27.1, 33.2) -0.111 0.912
POD5 30.8 (27.8, 34.4) 31.4 (28.4, 36.9) -0.718 0.473
Choline
POD1 4957 (4022, 4957) 5242 (4048, 6715) -0.876 0.381
POD3 3481 (2626, 4518) 4056 (3345, 5020) -1.425 0.154
POD5 3268 (2696, 4537) 4024 (3248, 5069) -1.580 0.114
WBC count
POD1 14.73 (10.84, 18.75) 15.49 (12.42, 18.41) -0.751 0.452
POD3 14.90 (11.74, 18.64) 13.54 (10.34, 16.58) -1.112 0.266
POD5 11.99 (9.65, 15.56) 11.24 (9.17, 14.79) -0.510 0.610
Pathology examination result 2.445 0.485
Cholangiocarcinoma 12 (42.9) 29 (52.7)
Pancreatic carcinoma 3 (10.7) 8 (14.5)
Ampullary carcinoma 3 (10.7) 7 (12.7)
Other 10 (35.7) 11 (20.0)
Data are presented as *n* (%).
Fisher's exact test. POPF: Postoperative pancreatic fistula; PD: Pancreaticoduodenectomy; WBC: White blood cell; POD: Postoperative day.
######
Results of univariate analysis showing risk factors for postoperative pancreatic fistula
**Factor** ***β*** **SE** ***Waldχ*^2^** **OR (95%CI)** ***P* value**
------------------------------------------------------------------------------------------- --------- ----------- ---------------- ----------------------- ---------------
Age in yr 0.023 0.037 0.397 1.024 (0.952-1.101) 0.529
Sex, female/male -0.586 0.500 1.375 0.557 (0.209-1.482) 0.241
Blood loss in mL 0.000 0.001 0.257 1.000 (0.999-1.001) 0.612
Pancreatic duct diameter, -0.841 0.475 3.135 0.431 (0.170-1.094) 0.077
\> 3 mm/\< 3 mm
Preoperative low plasma protein, yes/no 0.178 0.545 0.106 1.194 (0.410-3.476) 0.744
Preoperative relief of jaundice, yes/no 0.754 0.749 1.012 2.125 (0.489-9.227) 0.314
Preoperative jaundice, yes/no 0.106 0.482 0.048 1.112 (0.432-2.861) 0.826
Internal or External drainage of PD 0.251 0.468 0.289 1.286 (0.514-3.214) 0.591
Diabetes, yes/no 21.952 28420.722 0.000 3.417E9 (0.000) 0.999
Pathology examination result, ampullary carcinoma/pancreatic carcinoma/cholangiocarcinoma 0.241 0.182 1.757 1.273 (0.891-1.819) 0.185
Duration of surgery in min 0.000 0.003 0.008 1.000 (0.995-1.005) 0.928
Drainage fluid amylase level, POD1 \> 5000 U/L 0.000 0.000 10.293 1.000 (1.000\--1.000) 0.001
Serum amylase level
POD1 \> 140 U/L 0.004 0.001 9.982 1.004 (1.001-1.006) 0.002
POD4 \> 140 U/L 0.013 0.005 7.752 1.013 (1.004-1.022) 0.005
Serum albumin
POD1 0.000 0.045 0.000 1.000 (0.916, 1.092) 0.994
POD3 -0.006 0.044 0.020 0.994 (0.911, 1.084) 0.887
POD5 -0.023 0.044 0.277 0.977 (0.897, 1.064) 0.599
Choline
POD1 -0.016 0.041 0.149 0.984 (0.908, 1.067) 0.700
POD3 0.033 0.046 0.521 1.034 (0.945, 1.131) 0.470
POD5 0.007 0.053 0.016 1.007 (0.908, 1.117) 0.898
WBC count
POD1 0.000 0.000 1.153 1.000 (1.000, 1.000) 0.283
POD3 0.000 0.000 1.298 1.000 (0.999, 1.000) 0.255
POD5 0.000 0.000 2.026 1.000 (0.999, 1.000) 0.155
POPF: Postoperative pancreatic fistula; PD: Pancreaticoduodenectomy; WBC: White blood cell; POD: Postoperative day.
Multivariate logistic regression analysis confirmed that amylase level in abdominal drainage fluid on POD1 and serum amylase level on POD4 were independent predictors of POPF (Table [5](#T5){ref-type="table"}). On ROC curve analysis, a cut-off amylase level of 2365.5 U/L in the abdominal drainage fluid on POD1 as predictor of POPF was associated with 78.6% sensitivity, 80% specificity, 66.7% PPV and 88% NPV \[area under the curve (AUC): 0.844; *P* = 0.009\] (Figure [1](#F1){ref-type="fig"}). Similarly, a cut-off serum amylase level of 44.2 U/L on POD4 was associated with a 78.6% sensitivity and 70.9% specificity (AUC: 0.784; *P* = 0.05; Figure [2](#F2){ref-type="fig"}). The specificity of these associations was further highlighted by the observation that neither white blood cell (WBC) counts nor choline and albumin levels correlated with POPF development.
{#F1}
{#F2}
######
Results of multivariate logistic regression analysis showing risk factors for postoperative pancreatic fistula
**Predictor** ***β*** **SE** ***Waldχ*^2^** **OR (95%CI)** ***P* value**
-------------------------------------- --------- -------- ---------------- ----------------------- ---------------
Amylase level, POD1 \> 5000 U/L 0.000 0.000 6.728 1.000 (1.000\--1.000) 0.009
Serum amylase, level POD1 \> 140 U/L 0.001 0.002 0.243 1.001 (0.998-1.004) 0.622
Serum amylase level, POD4 \> 140 U/L 0.009 0.004 3.826 1.009 (1.000-1.017) 0.050
POPF: Postoperative pancreatic fistula; POD: Postoperative day.
DISCUSSION
==========
The Whipple procedure for PD for the treatment of benign and malignant tumors in the head of pancreas and the peri-ampullar region is one of the most technically challenging surgical procedures, with long duration of surgery and a high rate of associated complications\[[@B9],[@B10]\]. The reported rates of postoperative complications following PD range from 30%-70%, and postoperative mortality rates have remained approximately 5% even in high-volume centers\[[@B11]\]. POPF accounts for 2%-25% of all complications of PD\[[@B12]\]. The advent of novel surgical modalities for pancreaticojejunostomy, such as the duct-mucosa pancreaticojejunostomy or pancreatic duct stent implantation, has not resulted in major improvement. Therefore, early detection of POPF development and adequate timely intervention is important to improve surgical outcomes in these patients\[[@B13]-[@B17]\]. There is a paucity of tools to identify patients who are at risk of development of POPF. Here, we report our prospective study to identify potential predictors of POPF. The results suggest that monitoring of amylase levels in drainage fluid and serum as biomarkers is quite promising.
Various factors have been linked to POPF in previous studies. These include pancreatic consistency, pancreatic duct diameter, and the results of assessment by the pathologist\[[@B18]-[@B22]\]; however, their predictive value has been shown to be relatively poor and not intuitive. In the present study, we observed an obvious correlation between amylase levels in the ascitic fluid on POD1 and the serum amylase level on POD4 with the occurrence of POPF. Cloyd et al\[[@B20]\] reported that serum amylase level on POD1 (\> 140 U/L) predicts POPF with 81.5% sensitivity, 55.5% specificity, 29.3% PPV, and 93% NPV\[[@B23]\]. Likewise, some researchers demonstrated that drainage fluid amylase level on POD1 (\> 350 U/L) can predict POPF with a 79% specificity, 100% sensitivity, 41% PPV, and 100% NPV. Furthermore, Popiela et al\[[@B24]\] showed that the drainage fluid amylase level (\> 5000 U/L) on POD1 is a reliable predictor of POPF. Kawai et al\[[@B25]\] also found that the ratio of total amylase in drainage fluid could predict POPF. Our results are consistent with these previous publications, which indicate that amylase level in ascitic fluid on POD1 and blood amylase on POD4 could be used to identify patients who are most likely to suffer from this complication after PD.
Of note, we did not observe a significant association of albumin and WBC counts with POPF. Kawai et al\[[@B25]\] reported that serum albumin levels (\< 3.0 g/d) and serum WBC count (\> 9800 mm^3^) on POD4 predicted grades B and C POPF with a 69% sensitivity, a 96% specificity, an 88% PPV, and an 85% NPV. Relles et al\[[@B26]\] found that serum albumin (\< 2.5 mg/L) and blood urea nitrogen (\> 10 mg/dL) on POD1 were important predictors of perioperative morbidity following PD\[[@B27]\]. However, in our study, the level of serum albumin through POD1, POD3 and POD5 did not correlate with the development of POPF. Considering that acute stress can affect serum albumin level and WBC counts\[[@B28]\], these may not be appropriate measures to gauge the risk of POPF. A prospective trial showed that postoperative albumin levels were not associated with risk during abdominal operation\[[@B29]\]. Welsch et al\[[@B29]\] also reported poor specificity of serum WBC as a predictor of POPF. Our results are consistent with these reports. In addition, no significant association of POPF with cholinesterase level was observed on POD1, POD3 and POD5, which suggests that POPF may not have an obvious relationship with the postoperative change in hepatic reserve.
In our study, a cut-off amylase level of 2365.5 U/L in ascitic fluid on POD1 predicted POPF with 78.6% sensitivity, 80% specificity, 66.7% PPV, and 88% NPV. We hypothesize that in patients with POPF, the higher level of amylase in drainage fluid on POD1 derives from the failed pancreaticojejunal anastomosis, which leads to POPF.
Serum amylase has been used for diagnosis of acute pancreatitis for \> 70 years; however, increased serum amylase levels are also observed in other diseases of salivary glands, oviduct epithelium and proximal duodenum, which limits its specificity for the diagnosis of pancreatitis. Intuitively, this should be less of a concern with respect to drainage fluid or generally following PD\[[@B30]\]. Indeed, in our study, serum amylase on POD4 showed a significant correlation with POPF, although serum amylase on POD1 did not effectively predict POPF. We found that serum amylase on POD4 of 44.2 U/L was an effective maker; however, this value is within the normal range of serum amylase, and thus serum amylase level on POD4 higher than 100 U/L is probably more appropriate. Serum amylase on POD4 with a discriminatory threshold of 100 U/L can predict POPF with 42.9% sensitivity, 55% specificity, 75% PPV, and 76.1% NPV. In the early postoperative stage, ischemic injury to pancreatic tissues caused by surgical damage to blood vessels, intraoperative and postoperative hypovolemia, and surgical stress leads to elevation of serum amylase\[[@B31]\]. However, no statistically significant correlation was observed between serum amylase level on POD1 and pancreatic leakage, and no correlation was found between serum amylase and POPF in theory, whereas absorption of exudates from pancreatic anastomosis cannot explain such a phenomenon. On the other hand, we believe that elevation in serum amylase level on POD4 reflects the preliminary establishment of a collateral pancreatic anastomosis, and that correction of hypovolumia may reflect the condition of pancreatic juice derived from accessory pancreatic duct or residual pancreatic section instead of the obstructed main pancreatic duct. Moreover, the erosion effect of amylopsin and trypsin on blood vessel can also increase the absorption speed and the amount of amylopsin into the blood, which reflects the increased serum amylase. Thus, blood amylase level on POD4 is of certain predictive value for the occurrence of POPF.
In our study, we found that amylase activity in drainage fluid on POD1 and serum amylase activity on POD4 could accurately predict POPF, whereas serum albumin and prealbumin did not show a significant predictive value. Measurement of amylase level in drainage fluid on POD1 and the serum amylase level on POD4 is a relatively easy and economical method. Our results support the use of amylase to predict POPF.
This may allow for timely interventions, such as increased duration of antibiotic and octreotide therapies, that may help prevent POPF and allow for timely risk-communication to the patient. It is also another procedure in the processing carried out in our medical center.
COMMENTS
========
Background
----------
Identification of patients who are at high risk of postoperative pancreatic fistula (POPF) in the immediate postoperative period after is a key imperative to improve surgical outcomes of pancreaticoduodenectomy (PD). Biochemical markers in serum and drainage fluid may reflect disease progression, and it is of translational significance to investigate their correlation with clinical characteristics and their potential use to predict the risk of POPF. In this study, we sought to identify potential predictors of POPF development, which may help optimize the treatment of such patients in clinical practice.
Research frontiers
------------------
Although anastomosis techniques used for PD significantly improves, the incidence of PD-associated POPF remains relatively high. POPF is a major threat to patients who undergo PD. Thus, early and accurate prediction of POPF is essential to achieve optimal surgical outcomes.
Innovations and breakthroughs
-----------------------------
Previous studies have found several biochemical factors, such as serum amylase level on postoperative day (POD)1, drainage fluid amylase level on POD1, and a combination of serum albumin and leukocyte count as predictors of POPF. However, some of these markers have low positive predictive value. We demonstrate that amylase level in drainage fluid on POD1 and serum amylase level on POD4 are better predictors of POPF than those proposed earlier.
Applications
------------
Measurement of amylase level in serum and drainage fluid is relatively straightforward and inexpensive. These two investigations can help identify patients who are at an increased risk of POPF. This may allow for timely interventions, such as increased duration of antibiotic and octreotide therapies, that may help prevent POPF. It is also another procedure in the processing carried out in our medical center.
Terminology
-----------
Although several biochemical factors have been shown to predict POPF in previous studies, we found that just amylase levels in drainage fluid on POD1 and serum amylase level on POD4 could accurately predict POPF, whereas serum albumin and prealbumin were found to have negligible predictive value.
Peer-review
-----------
In this manuscript, the authors correlate the postoperative clinical factors with POPF rate, including prospectively 83 patients with PD, and analyzed the potential correlation between biomarkers and postoperative complications such a pancreatic fistula.
Manuscript source: Unsolicited manuscript
Specialty type: Gastroenterology and hepatology
Country of origin: China
Peer-review report classification
Grade A (Excellent): 0
Grade B (Very good): B
Grade C (Good): C
Grade D (Fair): 0
Grade E (Poor): 0
Institutional review board statement: The study was reviewed and approved by the Bethune First Hospital of Jilin University Institutional Review Board.
Conflict-of-interest statement: We declare that we do not have any commercial or associative interest that represents a conflict of interest in connection with the work submitted.
Data sharing statement: There is no additional data available.
Peer-review started: February 10, 2017
First decision: March 7, 2017
Article in press: May 5, 2017
P- Reviewer: Espinel J, Negoi I S- Editor: Ma YJ L- Editor: Filipodia E- Editor: Zhang FF
[^1]: Author contributions: Jin S and Wang SY designed the clinical research; Wang SY performed the data analysis; Jin S wrote the paper; Wang GY and Shi XJ performed most of the operations in this research; The other authors performed the other operations.
Correspondence to: Guang-Yi Wang, PhD, Department of Hepatobiliary and Pancreatic Surgery, Bethune First Hospital of Jilin University, 71 Xinmin Avenue, Changchun 130021, Jilin Province, China. <guangyi@jlu.edu.cn>
Telephone: +86-18611172714 Fax: +86-0431-88782356
| 2024-06-09T01:26:18.401715 | https://example.com/article/8069 |
Availability
Peace dove crucifix, small cross made in white ceramics. Its processing is entirely hand made from the initial moulding of the paste the cross goes through a first firing. Afterwards the cross is coloured each colour separately and then fired a second time at a temperature of over 1000°C, which makes the object unchangeable.
The dove symbol has different meanings: peace, hope and Holy Spirit.
The cross is provided with a metal triangle on the back to hang it on the wall and comes in an elegant black matt box with velvet on the inside. | 2023-10-24T01:26:18.401715 | https://example.com/article/1289 |
mikey287 wrote:Great find, FLPF. Thanks for that! I was unaware of the specifics of that mechanism.
Does it get into specifics about how/when a one-year deal is posted vs. a two-year deal in the new CBA?
From what I see, one-year versus two-year is decided by the "opposition," so if it is Player elected arbitration, the Team sets the length, and if Club elected arbitration, the player sets the length.
Article 12.9, paragraph (c), page 62
(c) Election of Term
The party against whom a salary arbitration election was filed (ie, the Club in Player-elected salary arbitration and the Player in Club-elected salary arbitration) shall elect in its brief whether the salary arbitration award shall be for a one or two-year SPC.
My copy and paste isn't working so I had to manually type that. Also notes that failure to disclose term automatically goes to 1 year SPC, if the player is 1 year away by age or experience from Group 3 Free Agency then only 1 year SPC can be awarded, and if player is eligible in 1 year for Group 5 Free Agency and a two-year SPC is elected the player can elect to void the 2nd year at the end of the first year of the SPC if year one salary is less than the Average League Salary for that year.
That said, I believe Group V free agency died a de facto death in 2005 with the new CBA. IIRC what that is correctly, I don't believe it's possible under the terms set forth in either of the past two CBAs. Perhaps I'm confusing it with another Group...confusion strikes again. I'll look into when I get home...thanks again for this, very informative...
That said, I believe Group V free agency died a de facto death in 2005 with the new CBA. IIRC what that is correctly, I don't believe it's possible under the terms set forth in either of the past two CBAs. Perhaps I'm confusing it with another Group...confusion strikes again. I'll look into when I get home...thanks again for this, very informative...
Your welcome, and you are probably right about Group 5. In essence, to qualify as Group 5, you need to play 10 seasons (doesn't matter if AHL/ECHL or NHL, juniors doesn't count) with a SPC value under the Average League Salary on your last year of the contract. Being that the Group 3 Free Agency age is 27, I don't think there would be any players that will qualify for this anymore.
shmenguin wrote:So now Neal wasn't a good fit on the PP. Eventually, he's going to be a small Asian man whose name wasn't even Neal.
well, do you think the pp is going to be significantly less successful with ehrhoff at the point, hornqvist down low, and malkin as the shooter on the half boards? with those weapons, i think neal's contributions become somewhat less special. plus, with a legit net front presence on the pp, we can get kunitz off our top unit, and maybe not have half a dozen goals disallowed for whatever reason
We still don't have a QB. The closest we had was malkin playing the point. So I don't think ehroff and Martin playing patty cake on the blue line will improve our pp. Sub letang in - same result. It will be worse than last year - if only because of how good last year's was. Largely because of one Neal, James. But to a more simple point - a swap of hornqvist and Neal definitely makes it worse. And to an even simpler point (the one which I was originally addressing), Neal was a fantastic PP player. And it's more pretend time to claim otherwise.
You're assuming the Penguins are going to retain the same power-play set-up that had last season as you make your assessment of how it's supposedly going to work. No one knows what the set-up is going to be. Knowing what we know about Johnston, it won't be Bylsma's overload set-up, which functioned off of a "rover" in the slot who's primary focus was to draw attention to himself to open up passing lanes in the middle of the ice.
That's the function James Neal served for this last year. Any player can fit into that mold, if the Penguins were to run the same system, they have guys on the current roster who could excel at it, namely Chris Kunitz. In fact, I'd argue that a set-up featuring Hornqvist in front of the net, which I would expect to see, would be a vast improvement in a very key area. So the argument that it makes an unknown power-play somehow worse isn't something that I can agree with.
Also, Christian Ehrhoff is a pretty good power-play QB, among other things. I don't agree with that assessment at all.
I'm not assuming anything about the tactical setup. We had the top PP % in the league last year and we got rid of the guy who scored PP goals at the highest rate, and we're either not even using the guy we got in return or we're replacing our PP goal leader with him. We can also add in the element of Sid and Geno having no clue how to play together as forwards if necessary.
It's not that I think the PP will be bad. It's that it won't be as good as last year. The opposite opinion would be startling.
Just like Whitney when he was looking like the next premier offensive d-man in the league.Just like Goligoski when he was looking like he was about to reach his potentialJust like when Hossa chose the RedwingsJust like when Malone chased money despite his chemistry with Malkin
GSdrums87 wrote:What an assumption to make after knowing literally nothing of who will and how will the new power play be executed. Maybe they're 100% next season thanks to Hornqvist, how could you ever know?
GSdrums87 wrote:What an assumption to make after knowing literally nothing of who will and how will the new power play be executed. Maybe they're 100% next season thanks to Hornqvist, how could you ever know?
Patric Hornqvist, Pittsburgh PenguinsThe highest-impact fantasy move in the last year, let alone the last week. Hornqvist just went from being a steady 50-point player to a possible 70-point player or more. In my rankings this month he shot up 96 spots thanks to his trade, as he will be earmarked for the Evgeni Malkin line.
James Neal, Nashville PredatorsFrom Malkin’s linemate to Colin Wilson’s. That’s quite the drop. Just as Hornqvist shot up 96 spots in my fantasy rankings, Neal dropped 40. He’ll help Wilson and whoever else is on the line (Craig Smith?). But his own point total will drop. Think 60 or 65 points now.
Patric Hornqvist, Pittsburgh PenguinsThe highest-impact fantasy move in the last year, let alone the last week. Hornqvist just went from being a steady 50-point player to a possible 70-point player or more. In my rankings this month he shot up 96 spots thanks to his trade, as he will be earmarked for the Evgeni Malkin line.
James Neal, Nashville PredatorsFrom Malkin’s linemate to Colin Wilson’s. That’s quite the drop. Just as Hornqvist shot up 96 spots in my fantasy rankings, Neal dropped 40. He’ll help Wilson and whoever else is on the line (Craig Smith?). But his own point total will drop. Think 60 or 65 points now.
That's exactly what I was thinking as well.
if these estimates are correct, the him-hawing is justified. doesn't really matter what neal does with nashville. this projects hornqvist as doing worse than neal did here.
Patric Hornqvist, Pittsburgh PenguinsThe highest-impact fantasy move in the last year, let alone the last week. Hornqvist just went from being a steady 50-point player to a possible 70-point player or more. In my rankings this month he shot up 96 spots thanks to his trade, as he will be earmarked for the Evgeni Malkin line.
James Neal, Nashville PredatorsFrom Malkin’s linemate to Colin Wilson’s. That’s quite the drop. Just as Hornqvist shot up 96 spots in my fantasy rankings, Neal dropped 40. He’ll help Wilson and whoever else is on the line (Craig Smith?). But his own point total will drop. Think 60 or 65 points now.
That's exactly what I was thinking as well.
if these estimates are correct, the him-hawing is justified. doesn't really matter what neal does with nashville. this projects hornqvist as doing worse than neal did here.
Do you watch a lot of hockey, or just play NHL14? In NHL14 point totals matter the most. In real life there are MANY other things that need to be considered. | 2024-04-02T01:26:18.401715 | https://example.com/article/2501 |
I understood that there are standards that I am unable to fit. Expectations I was and still am unable to meet. That my percentage of failures and wins is slowly but surely becoming frustrating not only for me but also for those that want things to change to the better within the Roma communities. I also understand that my articles and political stands can hurt the interests of some or most Roma groups due to many reasons.
Therefore, I am giving up being a Roma rights activist. I feel that I tried as hard as I could while I was involved in it. Obviously, I was not as successful as I wanted to be. I will not be part of any Roma organization and I do not intend to take part in anything dealing specifically with Roma. I will have no professional contacts with the Roma political or civil society but I will stay in touch with a few friends. I will continue to volunteer in the ghetto in Bucharest and will remain very involved in the political issues that I am passionate about – those related to children rights, populism and corruption.
I am not planning to talk or write more about the reasons for my decision or about what I will do next. I think most of you reading this already know about the challenges ahead for the Roma movement, and I know there are enough strong, smart and courageous activists ready to tackle these. I very much enjoyed working with some of them.
I know this might risks to seem as a call for attention. Far from it, I feel I received far more attention than I deserved. At the same time I do not want to have to repeat the last two paragraphs that have been my standard reply to people that wanted to find out what happened.
I apologize to all of you that I will not reply or be in touch in the future. | 2024-06-01T01:26:18.401715 | https://example.com/article/4209 |
/*
* Copyright (c) 2003, 2020, Oracle and/or its affiliates. All rights reserved.
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* This code is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License version 2 only, as
* published by the Free Software Foundation. Oracle designates this
* particular file as subject to the "Classpath" exception as provided
* by Oracle in the LICENSE file that accompanied this code.
*
* This code is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* You should have received a copy of the GNU General Public License version
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
* or visit www.oracle.com if you need additional information or have any
* questions.
*/
#include <stdlib.h>
#include <string.h>
#include "sun_java2d_opengl_GLXGraphicsConfig.h"
#include "jni.h"
#include "jlong.h"
#include "GLXGraphicsConfig.h"
#include "GLXSurfaceData.h"
#include "awt_GraphicsEnv.h"
#include "awt_util.h"
#ifndef HEADLESS
extern Bool usingXinerama;
/**
* This is a globally shared context used when creating textures. When any
* new contexts are created, they specify this context as the "share list"
* context, which means any texture objects created when this shared context
* is current will be available to any other context.
*/
static GLXContext sharedContext = 0;
/**
* Attempts to initialize GLX and the core OpenGL library. For this method
* to return JNI_TRUE, the following must be true:
* - libGL must be loaded successfully (via dlopen)
* - all function symbols from libGL must be available and loaded properly
* - the GLX extension must be available through X11
* - client GLX version must be >= 1.3
* If any of these requirements are not met, this method will return
* JNI_FALSE, indicating there is no hope of using GLX/OpenGL for any
* GraphicsConfig in the environment.
*/
static jboolean
GLXGC_InitGLX()
{
int errorbase, eventbase;
const char *version;
J2dRlsTraceLn(J2D_TRACE_INFO, "GLXGC_InitGLX");
if (!OGLFuncs_OpenLibrary()) {
return JNI_FALSE;
}
if (!OGLFuncs_InitPlatformFuncs() ||
!OGLFuncs_InitBaseFuncs() ||
!OGLFuncs_InitExtFuncs())
{
OGLFuncs_CloseLibrary();
return JNI_FALSE;
}
if (!j2d_glXQueryExtension(awt_display, &errorbase, &eventbase)) {
J2dRlsTraceLn(J2D_TRACE_ERROR,
"GLXGC_InitGLX: GLX extension is not present");
OGLFuncs_CloseLibrary();
return JNI_FALSE;
}
version = j2d_glXGetClientString(awt_display, GLX_VERSION);
if (version == NULL) {
J2dRlsTraceLn(J2D_TRACE_ERROR,
"GLXGC_InitGLX: could not query GLX version");
OGLFuncs_CloseLibrary();
return JNI_FALSE;
}
// we now only verify that the client GLX version is >= 1.3 (if the
// server does not support GLX 1.3, then we will find that out later
// when we attempt to create a GLXFBConfig)
J2dRlsTraceLn1(J2D_TRACE_INFO,
"GLXGC_InitGLX: client GLX version=%s", version);
if (!((version[0] == '1' && version[2] >= '3') || (version[0] > '1'))) {
J2dRlsTraceLn(J2D_TRACE_ERROR,
"GLXGC_InitGLX: invalid GLX version; 1.3 is required");
OGLFuncs_CloseLibrary();
return JNI_FALSE;
}
return JNI_TRUE;
}
/**
* Returns JNI_TRUE if GLX is available for the current display. Note that
* this method will attempt to initialize GLX (and all the necessary function
* symbols) if it has not been already. The AWT_LOCK must be acquired before
* calling this method.
*/
jboolean
GLXGC_IsGLXAvailable()
{
static jboolean glxAvailable = JNI_FALSE;
static jboolean firstTime = JNI_TRUE;
J2dTraceLn(J2D_TRACE_INFO, "GLXGC_IsGLXAvailable");
if (firstTime) {
glxAvailable = GLXGC_InitGLX();
firstTime = JNI_FALSE;
}
return glxAvailable;
}
/**
* Disposes all memory and resources allocated for the given OGLContext.
*/
static void
GLXGC_DestroyOGLContext(OGLContext *oglc)
{
GLXCtxInfo *ctxinfo;
J2dTraceLn(J2D_TRACE_INFO, "GLXGC_DestroyOGLContext");
if (oglc == NULL) {
J2dRlsTraceLn(J2D_TRACE_ERROR,
"GLXGC_DestroyOGLContext: context is null");
return;
}
// at this point, this context will be current to its scratch surface
// so the following GL/GLX operations should be safe...
OGLContext_DestroyContextResources(oglc);
ctxinfo = (GLXCtxInfo *)oglc->ctxInfo;
if (ctxinfo != NULL) {
// release the current context before we continue
j2d_glXMakeContextCurrent(awt_display, None, None, NULL);
if (ctxinfo->context != 0) {
j2d_glXDestroyContext(awt_display, ctxinfo->context);
}
if (ctxinfo->scratchSurface != 0) {
j2d_glXDestroyPbuffer(awt_display, ctxinfo->scratchSurface);
}
free(ctxinfo);
}
free(oglc);
}
/**
* Disposes all memory and resources associated with the given
* GLXGraphicsConfigInfo (including its native OGLContext data).
*/
void
OGLGC_DestroyOGLGraphicsConfig(jlong pConfigInfo)
{
GLXGraphicsConfigInfo *glxinfo =
(GLXGraphicsConfigInfo *)jlong_to_ptr(pConfigInfo);
J2dTraceLn(J2D_TRACE_INFO, "OGLGC_DestroyOGLGraphicsConfig");
if (glxinfo == NULL) {
J2dRlsTraceLn(J2D_TRACE_ERROR,
"OGLGC_DestroyOGLGraphicsConfig: info is null");
return;
}
if (glxinfo->context != NULL) {
GLXGC_DestroyOGLContext(glxinfo->context);
}
free(glxinfo);
}
/**
* Attempts to create a new GLXFBConfig for the requested screen and visual.
* If visualid is 0, this method will iterate through all GLXFBConfigs (if
* any) that match the requested attributes and will attempt to find an
* fbconfig with a minimal combined depth+stencil buffer. Note that we
* currently only need depth capabilities (for shape clipping purposes), but
* glXChooseFBConfig() will often return a list of fbconfigs with the largest
* depth buffer (and stencil) sizes at the top of the list. Therefore, we
* scan through the whole list to find the most VRAM-efficient fbconfig.
* If visualid is non-zero, the GLXFBConfig associated with the given visual
* is chosen (assuming it meets the requested attributes). If there are no
* valid GLXFBConfigs available, this method returns 0.
*/
static GLXFBConfig
GLXGC_InitFBConfig(JNIEnv *env, jint screennum, VisualID visualid)
{
GLXFBConfig *fbconfigs;
GLXFBConfig chosenConfig = 0;
int nconfs, i;
int attrlist[] = {GLX_DRAWABLE_TYPE, GLX_WINDOW_BIT | GLX_PBUFFER_BIT,
GLX_RENDER_TYPE, GLX_RGBA_BIT,
GLX_CONFIG_CAVEAT, GLX_NONE, // avoid "slow" configs
GLX_DEPTH_SIZE, 16, // anything >= 16 will work for us
0};
// this is the initial minimum value for the combined depth+stencil size
// (we initialize it to some absurdly high value; realistic values will
// be much less than this number)
int minDepthPlusStencil = 512;
J2dRlsTraceLn2(J2D_TRACE_INFO, "GLXGC_InitFBConfig: scn=%d vis=0x%x",
screennum, visualid);
// find all fbconfigs for this screen with the provided attributes
fbconfigs = j2d_glXChooseFBConfig(awt_display, screennum,
attrlist, &nconfs);
if ((fbconfigs == NULL) || (nconfs <= 0)) {
J2dRlsTraceLn(J2D_TRACE_ERROR,
"GLXGC_InitFBConfig: could not find any valid fbconfigs");
return 0;
}
J2dRlsTraceLn(J2D_TRACE_VERBOSE, " candidate fbconfigs:");
// iterate through the list of fbconfigs, looking for the one that matches
// the requested VisualID and supports RGBA rendering as well as the
// creation of windows and pbuffers
for (i = 0; i < nconfs; i++) {
XVisualInfo *xvi;
VisualID fbvisualid;
GLXFBConfig fbc = fbconfigs[i];
// get VisualID from GLXFBConfig
xvi = j2d_glXGetVisualFromFBConfig(awt_display, fbc);
if (xvi == NULL) {
continue;
}
fbvisualid = xvi->visualid;
XFree(xvi);
if (visualid == 0 || visualid == fbvisualid) {
int dtype, rtype, depth, stencil, db, alpha, gamma;
// get GLX-specific attributes from GLXFBConfig
j2d_glXGetFBConfigAttrib(awt_display, fbc,
GLX_DRAWABLE_TYPE, &dtype);
j2d_glXGetFBConfigAttrib(awt_display, fbc,
GLX_RENDER_TYPE, &rtype);
j2d_glXGetFBConfigAttrib(awt_display, fbc,
GLX_DEPTH_SIZE, &depth);
j2d_glXGetFBConfigAttrib(awt_display, fbc,
GLX_STENCIL_SIZE, &stencil);
// these attributes don't affect our decision, but they are
// interesting for trace logs, so we will query them anyway
j2d_glXGetFBConfigAttrib(awt_display, fbc,
GLX_DOUBLEBUFFER, &db);
j2d_glXGetFBConfigAttrib(awt_display, fbc,
GLX_ALPHA_SIZE, &alpha);
J2dRlsTrace5(J2D_TRACE_VERBOSE,
"[V] id=0x%x db=%d alpha=%d depth=%d stencil=%d valid=",
fbvisualid, db, alpha, depth, stencil);
if ((dtype & GLX_WINDOW_BIT) &&
(dtype & GLX_PBUFFER_BIT) &&
(rtype & GLX_RGBA_BIT) &&
(depth >= 16))
{
if (visualid == 0) {
// when visualid == 0, we loop through all configs
// looking for an fbconfig that has the smallest combined
// depth+stencil size (this keeps VRAM usage to a minimum)
if ((depth + stencil) < minDepthPlusStencil) {
J2dRlsTrace(J2D_TRACE_VERBOSE, "true\n");
minDepthPlusStencil = depth + stencil;
chosenConfig = fbc;
} else {
J2dRlsTrace(J2D_TRACE_VERBOSE,
"false (large depth)\n");
}
continue;
} else {
// in this case, visualid == fbvisualid, which means
// we've found a valid fbconfig corresponding to the
// requested VisualID, so break out of the loop
J2dRlsTrace(J2D_TRACE_VERBOSE, "true\n");
chosenConfig = fbc;
break;
}
} else {
J2dRlsTrace(J2D_TRACE_VERBOSE, "false (bad match)\n");
}
}
}
// free the list of fbconfigs
XFree(fbconfigs);
if (chosenConfig == 0) {
J2dRlsTraceLn(J2D_TRACE_ERROR,
"GLXGC_InitFBConfig: could not find an appropriate fbconfig");
return 0;
}
return chosenConfig;
}
/**
* Returns the X11 VisualID that corresponds to the best GLXFBConfig for the
* given screen. If no valid visual could be found, this method returns zero.
* Note that this method will attempt to initialize GLX (and all the
* necessary function symbols) if it has not been already. The AWT_LOCK
* must be acquired before calling this method.
*/
VisualID
GLXGC_FindBestVisual(JNIEnv *env, jint screen)
{
GLXFBConfig fbc;
XVisualInfo *xvi;
VisualID visualid;
J2dRlsTraceLn1(J2D_TRACE_INFO, "GLXGC_FindBestVisual: scn=%d", screen);
if (!GLXGC_IsGLXAvailable()) {
J2dRlsTraceLn(J2D_TRACE_ERROR,
"GLXGC_FindBestVisual: could not initialize GLX");
return 0;
}
fbc = GLXGC_InitFBConfig(env, screen, 0);
if (fbc == 0) {
J2dRlsTraceLn(J2D_TRACE_ERROR,
"GLXGC_FindBestVisual: could not find best visual");
return 0;
}
xvi = j2d_glXGetVisualFromFBConfig(awt_display, fbc);
if (xvi == NULL) {
J2dRlsTraceLn(J2D_TRACE_ERROR,
"GLXGC_FindBestVisual: could not get visual for fbconfig");
return 0;
}
visualid = xvi->visualid;
XFree(xvi);
J2dRlsTraceLn2(J2D_TRACE_INFO,
"GLXGC_FindBestVisual: chose 0x%x as the best visual for screen %d",
visualid, screen);
return visualid;
}
/**
* Creates a scratch pbuffer, which can be used to make a context current
* for extension queries, etc.
*/
static GLXPbuffer
GLXGC_InitScratchPbuffer(GLXFBConfig fbconfig)
{
int pbattrlist[] = {GLX_PBUFFER_WIDTH, 4,
GLX_PBUFFER_HEIGHT, 4,
GLX_PRESERVED_CONTENTS, GL_FALSE,
0};
J2dTraceLn(J2D_TRACE_INFO, "GLXGC_InitScratchPbuffer");
return j2d_glXCreatePbuffer(awt_display, fbconfig, pbattrlist);
}
/**
* Initializes a new OGLContext, which includes the native GLXContext handle
* and some other important information such as the associated GLXFBConfig.
*/
static OGLContext *
GLXGC_InitOGLContext(GLXFBConfig fbconfig, GLXContext context,
GLXPbuffer scratch, jint caps)
{
OGLContext *oglc;
GLXCtxInfo *ctxinfo;
J2dTraceLn(J2D_TRACE_INFO, "GLXGC_InitOGLContext");
oglc = (OGLContext *)malloc(sizeof(OGLContext));
if (oglc == NULL) {
J2dRlsTraceLn(J2D_TRACE_ERROR,
"GLXGC_InitOGLContext: could not allocate memory for oglc");
return NULL;
}
memset(oglc, 0, sizeof(OGLContext));
ctxinfo = (GLXCtxInfo *)malloc(sizeof(GLXCtxInfo));
if (ctxinfo == NULL) {
J2dRlsTraceLn(J2D_TRACE_ERROR,
"GLXGC_InitOGLContext: could not allocate memory for ctxinfo");
free(oglc);
return NULL;
}
ctxinfo->fbconfig = fbconfig;
ctxinfo->context = context;
ctxinfo->scratchSurface = scratch;
oglc->ctxInfo = ctxinfo;
oglc->caps = caps;
return oglc;
}
#endif /* !HEADLESS */
/**
* Determines whether the GLX pipeline can be used for a given GraphicsConfig
* provided its screen number and visual ID. If the minimum requirements are
* met, the native GLXGraphicsConfigInfo structure is initialized for this
* GraphicsConfig with the necessary information (GLXFBConfig, etc.)
* and a pointer to this structure is returned as a jlong. If
* initialization fails at any point, zero is returned, indicating that GLX
* cannot be used for this GraphicsConfig (we should fallback on the existing
* X11 pipeline).
*/
JNIEXPORT jlong JNICALL
Java_sun_java2d_opengl_GLXGraphicsConfig_getGLXConfigInfo(JNIEnv *env,
jclass glxgc,
jint screennum,
jint visnum)
{
#ifndef HEADLESS
OGLContext *oglc;
GLXFBConfig fbconfig;
GLXContext context;
GLXPbuffer scratch;
GLXGraphicsConfigInfo *glxinfo;
jint caps = CAPS_EMPTY;
int db;
const unsigned char *versionstr;
J2dRlsTraceLn(J2D_TRACE_INFO, "GLXGraphicsConfig_getGLXConfigInfo");
if (usingXinerama) {
// when Xinerama is enabled, the screen ID needs to be 0
screennum = 0;
}
fbconfig = GLXGC_InitFBConfig(env, screennum, (VisualID)visnum);
if (fbconfig == 0) {
J2dRlsTraceLn(J2D_TRACE_ERROR,
"GLXGraphicsConfig_getGLXConfigInfo: could not create fbconfig");
return 0L;
}
if (sharedContext == 0) {
// create the one shared context
sharedContext = j2d_glXCreateNewContext(awt_display, fbconfig,
GLX_RGBA_TYPE, 0, GL_TRUE);
if (sharedContext == 0) {
J2dRlsTraceLn(J2D_TRACE_ERROR,
"GLXGraphicsConfig_getGLXConfigInfo: could not create shared context");
return 0L;
}
}
// create the GLXContext for this GLXGraphicsConfig
context = j2d_glXCreateNewContext(awt_display, fbconfig,
GLX_RGBA_TYPE, sharedContext,
GL_TRUE);
if (context == 0) {
J2dRlsTraceLn(J2D_TRACE_ERROR,
"GLXGraphicsConfig_getGLXConfigInfo: could not create GLX context");
return 0L;
}
// this is pretty sketchy, but it seems to be the easiest way to create
// some form of GLXDrawable using only the display and a GLXFBConfig
// (in order to make the context current for checking the version,
// extensions, etc)...
scratch = GLXGC_InitScratchPbuffer(fbconfig);
if (scratch == 0) {
J2dRlsTraceLn(J2D_TRACE_ERROR,
"GLXGraphicsConfig_getGLXConfigInfo: could not create scratch pbuffer");
j2d_glXDestroyContext(awt_display, context);
return 0L;
}
// the context must be made current before we can query the
// version and extension strings
j2d_glXMakeContextCurrent(awt_display, scratch, scratch, context);
versionstr = j2d_glGetString(GL_VERSION);
OGLContext_GetExtensionInfo(env, &caps);
// destroy the temporary resources
j2d_glXMakeContextCurrent(awt_display, None, None, NULL);
J2dRlsTraceLn1(J2D_TRACE_INFO,
"GLXGraphicsConfig_getGLXConfigInfo: OpenGL version=%s",
(versionstr == NULL) ? "null" : (char *)versionstr);
if (!OGLContext_IsVersionSupported(versionstr)) {
J2dRlsTraceLn(J2D_TRACE_ERROR,
"GLXGraphicsConfig_getGLXConfigInfo: OpenGL 1.2 is required");
j2d_glXDestroyPbuffer(awt_display, scratch);
j2d_glXDestroyContext(awt_display, context);
return 0L;
}
// get config-specific capabilities
j2d_glXGetFBConfigAttrib(awt_display, fbconfig, GLX_DOUBLEBUFFER, &db);
if (db) {
caps |= CAPS_DOUBLEBUFFERED;
}
// initialize the OGLContext, which wraps the GLXFBConfig and GLXContext
oglc = GLXGC_InitOGLContext(fbconfig, context, scratch, caps);
if (oglc == NULL) {
J2dRlsTraceLn(J2D_TRACE_ERROR,
"GLXGraphicsConfig_getGLXConfigInfo: could not create oglc");
j2d_glXDestroyPbuffer(awt_display, scratch);
j2d_glXDestroyContext(awt_display, context);
return 0L;
}
J2dTraceLn(J2D_TRACE_VERBOSE,
"GLXGraphicsConfig_getGLXConfigInfo: finished checking dependencies");
// create the GLXGraphicsConfigInfo record for this config
glxinfo = (GLXGraphicsConfigInfo *)malloc(sizeof(GLXGraphicsConfigInfo));
if (glxinfo == NULL) {
J2dRlsTraceLn(J2D_TRACE_ERROR,
"GLXGraphicsConfig_getGLXConfigInfo: could not allocate memory for glxinfo");
GLXGC_DestroyOGLContext(oglc);
return 0L;
}
glxinfo->screen = screennum;
glxinfo->visual = visnum;
glxinfo->context = oglc;
glxinfo->fbconfig = fbconfig;
return ptr_to_jlong(glxinfo);
#else
return 0L;
#endif /* !HEADLESS */
}
JNIEXPORT void JNICALL
Java_sun_java2d_opengl_GLXGraphicsConfig_initConfig(JNIEnv *env,
jobject glxgc,
jlong aData,
jlong configInfo)
{
#ifndef HEADLESS
GLXGraphicsConfigInfo *glxinfo;
AwtGraphicsConfigDataPtr configData =
(AwtGraphicsConfigDataPtr)jlong_to_ptr(aData);
J2dTraceLn(J2D_TRACE_INFO, "GLXGraphicsConfig_initConfig");
if (configData == NULL) {
JNU_ThrowNullPointerException(env, "Native GraphicsConfig missing");
return;
}
glxinfo = (GLXGraphicsConfigInfo *)jlong_to_ptr(configInfo);
if (glxinfo == NULL) {
JNU_ThrowNullPointerException(env,
"GLXGraphicsConfigInfo data missing");
return;
}
configData->glxInfo = glxinfo;
#endif /* !HEADLESS */
}
JNIEXPORT jint JNICALL
Java_sun_java2d_opengl_GLXGraphicsConfig_getOGLCapabilities(JNIEnv *env,
jclass glxgc,
jlong configInfo)
{
#ifndef HEADLESS
GLXGraphicsConfigInfo *glxinfo =
(GLXGraphicsConfigInfo *)jlong_to_ptr(configInfo);
J2dTraceLn(J2D_TRACE_INFO, "GLXGraphicsConfig_getOGLCapabilities");
if (glxinfo == NULL || glxinfo->context == NULL) {
return CAPS_EMPTY;
}
return glxinfo->context->caps;
#else
return CAPS_EMPTY;
#endif /* !HEADLESS */
}
| 2024-07-03T01:26:18.401715 | https://example.com/article/3927 |
# plugin/plugin_base.py
# Copyright (C) 2005-2019 the SQLAlchemy authors and contributors
# <see AUTHORS file>
#
# This module is part of SQLAlchemy and is released under
# the MIT License: http://www.opensource.org/licenses/mit-license.php
"""Testing extensions.
this module is designed to work as a testing-framework-agnostic library,
created so that multiple test frameworks can be supported at once
(mostly so that we can migrate to new ones). The current target
is py.test.
"""
from __future__ import absolute_import
import re
import sys
py3k = sys.version_info >= (3, 0)
if py3k:
import configparser
else:
import ConfigParser as configparser
# late imports
fixtures = None
engines = None
exclusions = None
warnings = None
profiling = None
assertions = None
requirements = None
config = None
testing = None
util = None
file_config = None
logging = None
include_tags = set()
exclude_tags = set()
options = None
def setup_options(make_option):
make_option(
"--log-info",
action="callback",
type="string",
callback=_log,
help="turn on info logging for <LOG> (multiple OK)",
)
make_option(
"--log-debug",
action="callback",
type="string",
callback=_log,
help="turn on debug logging for <LOG> (multiple OK)",
)
make_option(
"--db",
action="append",
type="string",
dest="db",
help="Use prefab database uri. Multiple OK, "
"first one is run by default.",
)
make_option(
"--dbs",
action="callback",
zeroarg_callback=_list_dbs,
help="List available prefab dbs",
)
make_option(
"--dburi",
action="append",
type="string",
dest="dburi",
help="Database uri. Multiple OK, " "first one is run by default.",
)
make_option(
"--dropfirst",
action="store_true",
dest="dropfirst",
help="Drop all tables in the target database first",
)
make_option(
"--backend-only",
action="store_true",
dest="backend_only",
help="Run only tests marked with __backend__",
)
make_option(
"--nomemory",
action="store_true",
dest="nomemory",
help="Don't run memory profiling tests",
)
make_option(
"--postgresql-templatedb",
type="string",
help="name of template database to use for PostgreSQL "
"CREATE DATABASE (defaults to current database)",
)
make_option(
"--low-connections",
action="store_true",
dest="low_connections",
help="Use a low number of distinct connections - "
"i.e. for Oracle TNS",
)
make_option(
"--write-idents",
type="string",
dest="write_idents",
help="write out generated follower idents to <file>, "
"when -n<num> is used",
)
make_option(
"--reversetop",
action="store_true",
dest="reversetop",
default=False,
help="Use a random-ordering set implementation in the ORM "
"(helps reveal dependency issues)",
)
make_option(
"--requirements",
action="callback",
type="string",
callback=_requirements_opt,
help="requirements class for testing, overrides setup.cfg",
)
make_option(
"--with-cdecimal",
action="store_true",
dest="cdecimal",
default=False,
help="Monkeypatch the cdecimal library into Python 'decimal' "
"for all tests",
)
make_option(
"--include-tag",
action="callback",
callback=_include_tag,
type="string",
help="Include tests with tag <tag>",
)
make_option(
"--exclude-tag",
action="callback",
callback=_exclude_tag,
type="string",
help="Exclude tests with tag <tag>",
)
make_option(
"--write-profiles",
action="store_true",
dest="write_profiles",
default=False,
help="Write/update failing profiling data.",
)
make_option(
"--force-write-profiles",
action="store_true",
dest="force_write_profiles",
default=False,
help="Unconditionally write/update profiling data.",
)
def configure_follower(follower_ident):
"""Configure required state for a follower.
This invokes in the parent process and typically includes
database creation.
"""
from sqlalchemy.testing import provision
provision.FOLLOWER_IDENT = follower_ident
def memoize_important_follower_config(dict_):
"""Store important configuration we will need to send to a follower.
This invokes in the parent process after normal config is set up.
This is necessary as py.test seems to not be using forking, so we
start with nothing in memory, *but* it isn't running our argparse
callables, so we have to just copy all of that over.
"""
dict_["memoized_config"] = {
"include_tags": include_tags,
"exclude_tags": exclude_tags,
}
def restore_important_follower_config(dict_):
"""Restore important configuration needed by a follower.
This invokes in the follower process.
"""
global include_tags, exclude_tags
include_tags.update(dict_["memoized_config"]["include_tags"])
exclude_tags.update(dict_["memoized_config"]["exclude_tags"])
def read_config():
global file_config
file_config = configparser.ConfigParser()
file_config.read(["setup.cfg", "test.cfg"])
def pre_begin(opt):
"""things to set up early, before coverage might be setup."""
global options
options = opt
for fn in pre_configure:
fn(options, file_config)
def set_coverage_flag(value):
options.has_coverage = value
_skip_test_exception = None
def set_skip_test(exc):
global _skip_test_exception
_skip_test_exception = exc
def post_begin():
"""things to set up later, once we know coverage is running."""
# Lazy setup of other options (post coverage)
for fn in post_configure:
fn(options, file_config)
# late imports, has to happen after config.
global util, fixtures, engines, exclusions, assertions
global warnings, profiling, config, testing
from sqlalchemy import testing # noqa
from sqlalchemy.testing import fixtures, engines, exclusions # noqa
from sqlalchemy.testing import assertions, warnings, profiling # noqa
from sqlalchemy.testing import config # noqa
from sqlalchemy import util # noqa
warnings.setup_filters()
def _log(opt_str, value, parser):
global logging
if not logging:
import logging
logging.basicConfig()
if opt_str.endswith("-info"):
logging.getLogger(value).setLevel(logging.INFO)
elif opt_str.endswith("-debug"):
logging.getLogger(value).setLevel(logging.DEBUG)
def _list_dbs(*args):
print("Available --db options (use --dburi to override)")
for macro in sorted(file_config.options("db")):
print("%20s\t%s" % (macro, file_config.get("db", macro)))
sys.exit(0)
def _requirements_opt(opt_str, value, parser):
_setup_requirements(value)
def _exclude_tag(opt_str, value, parser):
exclude_tags.add(value.replace("-", "_"))
def _include_tag(opt_str, value, parser):
include_tags.add(value.replace("-", "_"))
pre_configure = []
post_configure = []
def pre(fn):
pre_configure.append(fn)
return fn
def post(fn):
post_configure.append(fn)
return fn
@pre
def _setup_options(opt, file_config):
global options
options = opt
@pre
def _set_nomemory(opt, file_config):
if opt.nomemory:
exclude_tags.add("memory_intensive")
@pre
def _monkeypatch_cdecimal(options, file_config):
if options.cdecimal:
import cdecimal
sys.modules["decimal"] = cdecimal
@post
def _init_skiptest(options, file_config):
from sqlalchemy.testing import config
config._skip_test_exception = _skip_test_exception
@post
def _engine_uri(options, file_config):
from sqlalchemy.testing import config
from sqlalchemy import testing
from sqlalchemy.testing import provision
if options.dburi:
db_urls = list(options.dburi)
else:
db_urls = []
if options.db:
for db_token in options.db:
for db in re.split(r"[,\s]+", db_token):
if db not in file_config.options("db"):
raise RuntimeError(
"Unknown URI specifier '%s'. "
"Specify --dbs for known uris." % db
)
else:
db_urls.append(file_config.get("db", db))
if not db_urls:
db_urls.append(file_config.get("db", "default"))
config._current = None
for db_url in db_urls:
if options.write_idents and provision.FOLLOWER_IDENT: # != 'master':
with open(options.write_idents, "a") as file_:
file_.write(provision.FOLLOWER_IDENT + " " + db_url + "\n")
cfg = provision.setup_config(
db_url, options, file_config, provision.FOLLOWER_IDENT
)
if not config._current:
cfg.set_as_current(cfg, testing)
@post
def _requirements(options, file_config):
requirement_cls = file_config.get("sqla_testing", "requirement_cls")
_setup_requirements(requirement_cls)
def _setup_requirements(argument):
from sqlalchemy.testing import config
from sqlalchemy import testing
if config.requirements is not None:
return
modname, clsname = argument.split(":")
# importlib.import_module() only introduced in 2.7, a little
# late
mod = __import__(modname)
for component in modname.split(".")[1:]:
mod = getattr(mod, component)
req_cls = getattr(mod, clsname)
config.requirements = testing.requires = req_cls()
@post
def _prep_testing_database(options, file_config):
from sqlalchemy.testing import config, util
from sqlalchemy.testing.exclusions import against
from sqlalchemy import schema, inspect
if options.dropfirst:
for cfg in config.Config.all_configs():
e = cfg.db
inspector = inspect(e)
try:
view_names = inspector.get_view_names()
except NotImplementedError:
pass
else:
for vname in view_names:
e.execute(
schema._DropView(
schema.Table(vname, schema.MetaData())
)
)
if config.requirements.schemas.enabled_for_config(cfg):
try:
view_names = inspector.get_view_names(schema="test_schema")
except NotImplementedError:
pass
else:
for vname in view_names:
e.execute(
schema._DropView(
schema.Table(
vname,
schema.MetaData(),
schema="test_schema",
)
)
)
util.drop_all_tables(e, inspector)
if config.requirements.schemas.enabled_for_config(cfg):
util.drop_all_tables(e, inspector, schema=cfg.test_schema)
if against(cfg, "postgresql"):
from sqlalchemy.dialects import postgresql
for enum in inspector.get_enums("*"):
e.execute(
postgresql.DropEnumType(
postgresql.ENUM(
name=enum["name"], schema=enum["schema"]
)
)
)
@post
def _reverse_topological(options, file_config):
if options.reversetop:
from sqlalchemy.orm.util import randomize_unitofwork
randomize_unitofwork()
@post
def _post_setup_options(opt, file_config):
from sqlalchemy.testing import config
config.options = options
config.file_config = file_config
@post
def _setup_profiling(options, file_config):
from sqlalchemy.testing import profiling
profiling._profile_stats = profiling.ProfileStatsFile(
file_config.get("sqla_testing", "profile_file")
)
def want_class(cls):
if not issubclass(cls, fixtures.TestBase):
return False
elif cls.__name__.startswith("_"):
return False
elif config.options.backend_only and not getattr(
cls, "__backend__", False
):
return False
else:
return True
def want_method(cls, fn):
if not fn.__name__.startswith("test_"):
return False
elif fn.__module__ is None:
return False
elif include_tags:
return (
hasattr(cls, "__tags__")
and exclusions.tags(cls.__tags__).include_test(
include_tags, exclude_tags
)
) or (
hasattr(fn, "_sa_exclusion_extend")
and fn._sa_exclusion_extend.include_test(
include_tags, exclude_tags
)
)
elif exclude_tags and hasattr(cls, "__tags__"):
return exclusions.tags(cls.__tags__).include_test(
include_tags, exclude_tags
)
elif exclude_tags and hasattr(fn, "_sa_exclusion_extend"):
return fn._sa_exclusion_extend.include_test(include_tags, exclude_tags)
else:
return True
def generate_sub_tests(cls, module):
if getattr(cls, "__backend__", False):
for cfg in _possible_configs_for_cls(cls):
orig_name = cls.__name__
# we can have special chars in these names except for the
# pytest junit plugin, which is tripped up by the brackets
# and periods, so sanitize
alpha_name = re.sub(r"[_\[\]\.]+", "_", cfg.name)
alpha_name = re.sub(r"_+$", "", alpha_name)
name = "%s_%s" % (cls.__name__, alpha_name)
subcls = type(
name,
(cls,),
{"_sa_orig_cls_name": orig_name, "__only_on_config__": cfg},
)
setattr(module, name, subcls)
yield subcls
else:
yield cls
def start_test_class(cls):
_do_skips(cls)
_setup_engine(cls)
def stop_test_class(cls):
# from sqlalchemy import inspect
# assert not inspect(testing.db).get_table_names()
engines.testing_reaper._stop_test_ctx()
try:
if not options.low_connections:
assertions.global_cleanup_assertions()
finally:
_restore_engine()
def _restore_engine():
config._current.reset(testing)
def final_process_cleanup():
engines.testing_reaper._stop_test_ctx_aggressive()
assertions.global_cleanup_assertions()
_restore_engine()
def _setup_engine(cls):
if getattr(cls, "__engine_options__", None):
eng = engines.testing_engine(options=cls.__engine_options__)
config._current.push_engine(eng, testing)
def before_test(test, test_module_name, test_class, test_name):
# format looks like:
# "test.aaa_profiling.test_compiler.CompileTest.test_update_whereclause"
name = getattr(test_class, "_sa_orig_cls_name", test_class.__name__)
id_ = "%s.%s.%s" % (test_module_name, name, test_name)
profiling._current_test = id_
def after_test(test):
engines.testing_reaper._after_test_ctx()
def _possible_configs_for_cls(cls, reasons=None):
all_configs = set(config.Config.all_configs())
if cls.__unsupported_on__:
spec = exclusions.db_spec(*cls.__unsupported_on__)
for config_obj in list(all_configs):
if spec(config_obj):
all_configs.remove(config_obj)
if getattr(cls, "__only_on__", None):
spec = exclusions.db_spec(*util.to_list(cls.__only_on__))
for config_obj in list(all_configs):
if not spec(config_obj):
all_configs.remove(config_obj)
if getattr(cls, "__only_on_config__", None):
all_configs.intersection_update([cls.__only_on_config__])
if hasattr(cls, "__requires__"):
requirements = config.requirements
for config_obj in list(all_configs):
for requirement in cls.__requires__:
check = getattr(requirements, requirement)
skip_reasons = check.matching_config_reasons(config_obj)
if skip_reasons:
all_configs.remove(config_obj)
if reasons is not None:
reasons.extend(skip_reasons)
break
if hasattr(cls, "__prefer_requires__"):
non_preferred = set()
requirements = config.requirements
for config_obj in list(all_configs):
for requirement in cls.__prefer_requires__:
check = getattr(requirements, requirement)
if not check.enabled_for_config(config_obj):
non_preferred.add(config_obj)
if all_configs.difference(non_preferred):
all_configs.difference_update(non_preferred)
return all_configs
def _do_skips(cls):
reasons = []
all_configs = _possible_configs_for_cls(cls, reasons)
if getattr(cls, "__skip_if__", False):
for c in getattr(cls, "__skip_if__"):
if c():
config.skip_test(
"'%s' skipped by %s" % (cls.__name__, c.__name__)
)
if not all_configs:
msg = "'%s' unsupported on any DB implementation %s%s" % (
cls.__name__,
", ".join(
"'%s(%s)+%s'"
% (
config_obj.db.name,
".".join(
str(dig)
for dig in exclusions._server_version(config_obj.db)
),
config_obj.db.driver,
)
for config_obj in config.Config.all_configs()
),
", ".join(reasons),
)
config.skip_test(msg)
elif hasattr(cls, "__prefer_backends__"):
non_preferred = set()
spec = exclusions.db_spec(*util.to_list(cls.__prefer_backends__))
for config_obj in all_configs:
if not spec(config_obj):
non_preferred.add(config_obj)
if all_configs.difference(non_preferred):
all_configs.difference_update(non_preferred)
if config._current not in all_configs:
_setup_config(all_configs.pop(), cls)
def _setup_config(config_obj, ctx):
config._current.push(config_obj, testing)
| 2023-08-10T01:26:18.401715 | https://example.com/article/2217 |
Q:
Gaussian integers modulo p not congruent to $3 \pmod{4}$
I read in this paper (see page 1 paragraph 3) that Gaussian integers arithmetic $\pmod{p}$, where $p\in\mathbb{Z}^+$ is a prime, requires that $p \equiv 3 \pmod{4}$.
I have some doubts here that I hope one can clarify:
1- Why is this necessary?
2- What about primes $\equiv 1 \pmod{4}$? don't they support Gaussian integers arithmetic (I tired some examples and it works fine for +,-,*)?
3- Which operations are not supported specifically (division, remainder, or what)?
4- Is there any trick that can be used to support Gaussian integers arithmetic using these primes $\equiv 1 \pmod{4}$?
A:
As I understand, $p$ is a prime number, and you are working in a field $F$ with $p^2$ elements. This field contains the field $\mathbb{F}_p = \mathbb{Z}/p\mathbb{Z}$ with $p$ elements as a subfield.
Assuming $p$ is congruent to $3$ modulo $4$, it is possible to write the elements of $F$ in a similar way to Gaussian integers: namely, there some is element of $F$, let's call it $i$, with the property that $i^2 = -1$. Such an element $i$ will not be in $\mathbb{F}_p$. Then
$$F = \{ a+ bi : a, b \in \mathbb{F}_p \}$$
You can't do this if $p \equiv 1 \pmod{4}$, because in this case, the square roots of $-1$ already lie in $\mathbb{F}_p$. For example, if $p = 5$, then $-1$ is equal to $2^2$. Therefore, the set
$$\{ a + bi : a, b \in \mathbb{F}_p\}$$
just gets you $\mathbb{F}_p$, not all of $F$.
| 2024-03-16T01:26:18.401715 | https://example.com/article/8581 |
10/13/10 Buenos Aires, Argentina – “This country is in a boom,” said the editor of a financial magazine in Buenos Aires. “Everything is going up. Everything is selling. And inflation is roaring at 25% per annum.”
To hear him tell it, Argentina is everything America wishes to be. Its people shop. Its restaurants are full. Its economy is growing at more than 8% a year.
Why?
“Inflation. Everyone wants to get rid of cash. You hold onto it and it’s worth less and less. So you buy an apartment.”
Amazingly less than 10% of property transactions in Argentina include mortgages. People pay with cash. Still, prices are not as low as you would expect. The lot next to our office is on the market for $250,000.
“It should be about $100,000,” said a friend who keeps an eye on real estate. “But everything is high.”
The cab ride from the airport was 70 pesos when we came 4 years ago. This time it was 128 pesos. Two glasses of wine at a local bar were 40 pesos. They would have been half that a few years ago.
“There’s a boom going on,” continued the financial editor. “But it can’t go on forever. You can’t have 25% inflation and have a healthy economy. People don’t make wise investments. They just try to avoid getting ripped off by inflation. They don’t make long-term investments. They just try to park their money where it won’t disappear. That’s why real estate is so expensive. People will save their money and buy an apartment whether they need it or not. They figure it will still be there in five or ten years. The peso won’t be. At least not today’s peso.”
Nor will the dollar.
Regards,Bill Bonner
for The Daily Reckoning
Hi, I’m afraid there’s some misinformation in that article. Restaurants packed and the economy growing 10%?Restaurants are as full as in any metropolis, specially tourists, and once you go to the suburbs you don’t SEE much restaurants to begin with. Heck no, the economy isn’t growing 10%, I’d be surprised its growing at all.
We don’t have inflation because everyone wants to get rid of their money, we have inflation because our money isn’t worth anything and inflation is rampant, we don’t even have good data on how bad inflation is because our socialist government thinks ignoring problems makes them go away.
Its not about people making investments, wise or not, its about people having to pay crazy prices for basic necessities such as food, power and taxes, that’s the real problem, not the increase in wine of cab fees.
Argentines use cash because we no longer trust banks and specially distrust this authoritarian government, and we spend that much money because that’s how bad basic necessity goods and services prices are.
It is true that people parked their money on real estate… 4 years ago.
These days? The market isn’t good. Its not easy to sell or even rent places any more, even in the downtown capital district a condo or office may go 6 months before renting. A couple years ago it would have been rented in one or two months.
One thing is true though: This situation can’t go on for long, sooner or later it will blow up. Its not realistic to spend more money to live in Buenos Aires than in most USA cities. Wages are going up, but they don’t even come close to keep up with the inflation, so that’s why we have more and more poor and more crime each passing year.
As a central bank prints more and more currency it eventually finds its way into the economy, debasing the value of the existing fiat currency and prices follow in suit.
Long before we had the cutesy term "inflation" there was more realistic terms called, "Monetary debasement" and "Depreciation".
On the contrary, when your money gained in value due to productivity and efficiency increases in the economy and business your money actually became worth more. That was called "appreciation". Outside a Howard Katz article, you won't see that too often.
Somewhere I read a good distinction between inflation and hyperinflation. Inflation is printing excess fiat currency relative to available assets which drives prices higher and hyperinflation is complete loss of faith in the fiat currency where no one will trade an asset for any amount of fiat currency so it collapses. There is a book in our local library with pictures of all the failed fiat currencies throughout the world. It's unbelievable how thick that book is. Anyone want a $100 trillion Zimbabwe note for that sandwich?
Sometimes it is a demographic one, or it could be a productivity issue.
Example, if oil gets to be rare it price will go up (supply and demand), as will items that require oil in their creation/manufacture (food/plastics, etc). The supply of money did not necessarily change.
Historically it was also relatively common with the metal currencies that inflation would tend to follow rises in population. More people meant less food per person and a tighter supply. In this case it was demand driven inflation.
Of course inflation with a fiat currency is often a monetary issue. But you could have the case of inflation being driven by a reduction in Argentinian productivity due to all the chaos.
About Me
Camping Survival
Fish Antibiotics
Subscribe To
My email:
ferfal308@hot (remove) mail.com
Guys, unless specifically told not to, I'll post the reply here in the blog so everyone can read it.I'll just leave the first name, and remove the last name, email or any other specific information for privacy reasons.Thanks
Leatherman Charge Ti
Fenix Lights
I love this light. Runs on a single AAA and is capable of big boy lumen output (80 lumens) in a keychain package. Also has low and mid mode for longer runtime.
Fenix PD20
Single CR123 cell. 6 modes including 180 lumen turbo mode.
General Mode: 9 lumens (35hrs) -> 47 lumens (6.5hrs) -> 94 lumens (2.6hrs) -> SOS
Turbo Mode: 180 lumens (1hrs) -> Strobe
15 days of survival use (2 continuous hours per day on the lowest setting)
Thanks for the Positive Reviews!
Energency gadget... on steroids.
Asus Eee 1005HA
Basic Door/Window Alarm
Emergency gadget
Both tool and weapon, just the right size
Straight edge makes it easier to sharpen, + tougher tip
Gorilla Tape
By all accounts and reviews I’ve read so far, it truly is “The toughest Tape on the Planet”
Transportation
I talked about these some time ago in an article, remember someone asked where to get one.
"Alternative Transportation"
Just found one reasonably priced and with excellent reviews in Amazon.
Best Folder
Emergency blankets. I Have several of these around.
Katadyn water filter
for the kits
and food ...
Got to have water: Klean Kanteen Stainless Steel
Moleskine, the ultimate little black cover notebook :)
Fenix L0D-CE. Perfect keychain light. 80 Lumens in a single AAA
Nice combo. The Soldier is an excellent product.
Sabre Red OC spray
Made in USA
This is the brand I use and always have one in my bag and car. ( same brand used by NYPD)
My wife keeps one in her purse too.
Sabre Red Tear Gas
Sabre Red for ladies
You guys have the coolest stuff up there.:)
Jack Bauer’s bag.:) I’d like to get one of these and try it out.
Fox OC Spray
Don’t have this one but it’s the hottest OC spray out there.
Someone once called it “bottled lava”
Pick your poison people, but do carry OC
1) Even if you carry a gun
2) SPECIALLY if you don’t carry a gun
Firesteel
Classic, and one of the few things I’d call a “must have” I own two of these. | 2024-02-26T01:26:18.401715 | https://example.com/article/4749 |
The present invention pertains generally to the field of computer-aided design of integrated circuits. More particularly, the present invention relates to techniques and methods for static timing analysis of integrated circuit devices in the presence of crosstalk.
Faster clock frequency, smaller device geometry, larger chip size and the demand of low power consumption have made timing and signal integrity related issues increasingly critical in VLSI (Very Large Scale Integrated) circuits. As manufacturing processes and design technology make progress to create faster and larger integrated circuits, these problems become worse. Thus, a good and effective methodology is needed to help designers address these issues.
With finer feature sizes and higher signal speeds, interconnect has become the ultimate determinant of system performance. It has become necessary to consider the effects of the interconnect on transient signal propagation. One solution for this problem is to use a circuit simulator such as SPICE to accurately identify systems timing violations and the critical nets associated with them. Although SPICE is the de facto solution of the chip timing verification, it may be too slow for large scale chip simulations. Another obstacle in using SPICE is the necessity of test vectors which could be very hard to find and ultimately some of the paths might not be verifiable through these test vectors. Because of these problems, static timing analysis has been proposed as an alternative to solve the device timing verification problem. In static timing analysis, the worst case timing of all possible paths between different inputs and outputs are carefully checked and verified versus preset criteria.
Static timing analysis is a path-centric methodology. This means that only accurate details for the path under investigation is attainable and the information available for adjacent paths are minimal. As long as the neighboring paths do not have a significant effect on the path under investigation different methods can be used to estimate the effects of the device interconnects. Static timing analysis can generally be categorized into cell level and transistor level techniques. Transistor level static timing analysis is used for timing evaluation of custom circuit designs. Once the circuit has been characterized, the obtained timing information can be passed to upper design level (cell level). The timing information from transistor level verification can be used in the cell level design to check the whole timing budget of the circuit. In special cases, a combination of transistor and cell level timing verification might be necessary.
Generally, the delay through an interconnect net serves as a rough estimate of its effect on the circuit performance. When the interconnect can be modeled as a resistance/capacitance (RC) tree network, its delay can be estimated by a form of the Elmore delay. The Elmore delay is an estimate of the delay for linear monotonic circuit step responses. Because the Elmore delay may only be a rough approximation of the actual delay, it may be necessary to augment it with bounds on the transient response. Unfortunately, the efforts entailed to provide these bounds often outweigh their benefits. Even when the bounds are considered, the results obtained can be indefinite. Another technique attempts to force a two pole approximation on RC tree structures in order to estimate the interconnect delay.
Yet another technique is to obtain RC delay using asymptotic waveform evalutaion (AWE) methods by which a transistor is modeled as an overly simplistic linear resistor or a T-model or a xcfx80-RC network. The RC delay obtained using AWE methods may therefore be insufficiently accurate for some applications. More accurate models based on inverter analysis techniques have also been proposed. An example of such a model is an independent current source model of a nonlinear driver where the effects of distributed interconnect loads are modeled with summation of exponential functions. That model separates the output response into four different regions. Because that model uses a linearly increasing current source to model the output current, the results obtained from this method may deviate from real results significantly. That model also fails to take into account the CMOS transient leakage (short-circuit) current, so it cannot be used for system power calculations.
Another model tries to correct those problems by using a five region linear-quadratic-exponential piece-wise linear model for the driver. An eight region model has also been proposed for describing different cell outputs. Those models, however, also suffer from several limitations. The derivations for these models are based on quadratic transistor equations, such as SPICE level one and two transistor models and pure capacitive loading. Then these models are generalized to other type of loading, such as RC interconnects. The generalization degrades the accuracy of these techniques, especially, if more than a single driver is present on the net to be analyzed. These models can produce good results for primitive MOS structures, but when the cell contains series connected transistors, again the accuracy achieved by these modeling techniques would not be adequate.
Further, the above methods have limited applicability due to restriction on circuit topology. With the increasing speed of MOS circuits, the effects of coupling capacitances significantly affects the delay estimate, rendering the RC tree model inadequate. Interconnect models often have meshes of resistance which are not handled by the RC tree method. Finally, the RC tree model can not handle non-equilibrium initial conditions which are required to accommodate pre-charge and charge sharing effects.
Along with the increasing importance of interconnects in transient analysis, nonlinear active devices in a system contribute to the system behavior significantly. The modeling methods discussed above have a over-simplistic implementation of non-linear devices. They do not model the effects of distributed loading accurately enough for transistor level deep sub-micron timing analysis.
The definition of delay is further complicated in the presence of crosstalk. Normally, delay is measured as the time difference between the input and output voltages passing a certain threshold voltage (e.g., delay threshold voltage). In most cases, the threshold voltage is set to 50 percent of rail to rail voltage. Slew is typically defined as the time difference for a voltage signal to pass two preset voltage levels (e.g. 10%-90% or 20%-80% of rail to rail voltage). These definitions are straight forward as long as the signal has a smooth rail to rail transition.
In presence of cross coupling from neighboring nets, the task of defining the delay and slew of a circuit becomes more complex. In some cases, the amount of coupled noise from neighboring nets could be so big that it may cause the gate to switch at an incorrect time. The incorrect switching may lead to a functional failure for the circuit. Further, glitches created in this fashion cause extra power consumption in the circuit. Another mechanism by which crosstalk can affect a circuit is delay variations on a signal line. In some cases, crosstalk may change the timing of a path. This leads to timing violations in subsequent circuits connected to the cross-coupled circuit. All of these problems are quite complex and very difficult to address.
Accordingly, what is needed is a computer-aided electronics design automation (EDA) tool that is capable of quickly and accurately simulating the timing characteristics of very large transistor and cell-level netlists in deep sub-micron devices. What is also needed is a novel timing verification methodology and tool for performing static timing analysis of deep sub-micron devices in the presence of crosstalk.
Accordingly, the present invention provides a method and analysis tool for determining crosstalk effects in transistor and cell level timing. The present invention provides an efficient platform for fast and accurate static timing verification of large scale transistor-level and/or cell level netlists, with coupled interconnects and high switching speeds. The present invention also provides a novel approach to solving the coupled noise problem in static timing verification.
In furtherance of one embodiment of the present invention, a circuit netlist is accessed and the channel connected regions are determined. In addition, primary (victim) net and aggressor nets of a cross-coupled interconnect stage of the netlist are identified. Thereafter, static timing analysis steps are performed to determine the aggressor nets"" switching windows. Significantly, according to one embodiment of the invention, worst case aggressor switching times are determined. After the determination of the worst case aggressor switching times, the interconnect stage is resimulated using the worst case aggressor switching times to determine the stage delay and the slew of the primary net. The aggressor switching windows are also updated. Furthermore, according to one embodiment, the output waveform of the primary net is recorded and utilized as the input of subsequent stage(s).
According to one embodiment of the present invention, worst case aggressor switching times are determined using a bump envelope super-positioning technique. Particularly, in one embodiment, the output response of the primary net is first determined. Bump-like voltage fluctuations on the output of the primary net caused by the switching of the input of the aggressor nets are also determined. Then, a bump envelope is created for each aggressor by stretching the bump-like waveform for the duration of the aggressor timing window. Thereafter, the main output response and all bump envelopes are added together to generate a composite waveform. The delay threshold voltage crossing point of the composite waveform is then determined. The delay threshold voltage crossing point corresponds to the delay of the composite waveform. The delay threshold crossing point also matches to the peak of each bump-like waveform that causes the maximum/minimum delay of the stage. The time needed for a bump waveform to reach the maximum/minimum voltage point is then subtracted from the composite waveform delay value to generate the worst case aggressor switching time for the corresponding aggressor.
In one embodiment of the present invention, the timing of the interconnect stage is resimulated with the worst case aggressor nets switching times to account for circuit non-linearity and to generate the worst case stage delay, output slew and output waveform of the stage. The output waveform is also propagated for use as inputs in simulating of subsequent stages.
Embodiments of the present invention include the above and further include a computer-readable medium having contained therein computer-readable codes for causing a computer-implemented electronic design automation (EDA) system to perform static timing analysis in the presence of crosstalk on an integrated circuit design represented as a netlist. Significantly, the static analysis process includes a bump envelope method for determining the worst case aggressor switching time. Particularly, the bump envelope method includes the steps of: (a) generating a primary waveform for a primary net of an cross-coupled circuit of the integrated circuit design; (b) generating a bump-envelope waveform for each aggressor net of the cross-coupled circuit; (c) generating an accumulative bump-envelope waveform by super-positioning all the bump-envelope waveforms (d) super-positioning the primary waveform over the accumulative bump-envelope waveform to generate a composite waveform; (e) determining a threshold voltage crossing point of the composite waveform; and (f) determining worst case aggressor switching times based on the threshold voltage crossing point. | 2024-05-20T01:26:18.401715 | https://example.com/article/1351 |
We've been tracking the career of Mathieu Turi since we debuted his first short post-apocalyptic film Sons of Chaos nearly ten years ago.
Synopsis:A worldwide epidemic has killed most of the planet’s population. The few survivors struggle to find food and shelter. But they are not alone…On her way back from a scavenging mission, Juliette (Brittany Ashworth) has a terrible accident.
Stuck in her car, with a broken leg, in the middle of an unforgiving desert, she must survive the perils of the post-apocalypse, while a strange creature prowls around…
Check out our interview with Mathieu Turi as well as the film's trailer below: | 2023-10-18T01:26:18.401715 | https://example.com/article/9331 |
package tsm1
import (
"fmt"
"io"
"io/ioutil"
"math"
"os"
"path/filepath"
"sort"
"strconv"
"strings"
"sync"
"sync/atomic"
"time"
"github.com/influxdata/influxdb/models"
"github.com/uber-go/zap"
)
// TSMFile represents an on-disk TSM file.
type TSMFile interface {
// Path returns the underlying file path for the TSMFile. If the file
// has not be written or loaded from disk, the zero value is returned.
Path() string
// Read returns all the values in the block where time t resides.
Read(key string, t int64) ([]Value, error)
// ReadAt returns all the values in the block identified by entry.
ReadAt(entry *IndexEntry, values []Value) ([]Value, error)
ReadFloatBlockAt(entry *IndexEntry, values *[]FloatValue) ([]FloatValue, error)
ReadIntegerBlockAt(entry *IndexEntry, values *[]IntegerValue) ([]IntegerValue, error)
ReadStringBlockAt(entry *IndexEntry, values *[]StringValue) ([]StringValue, error)
ReadBooleanBlockAt(entry *IndexEntry, values *[]BooleanValue) ([]BooleanValue, error)
// Entries returns the index entries for all blocks for the given key.
Entries(key string) []IndexEntry
ReadEntries(key string, entries *[]IndexEntry)
// Returns true if the TSMFile may contain a value with the specified
// key and time.
ContainsValue(key string, t int64) bool
// Contains returns true if the file contains any values for the given
// key.
Contains(key string) bool
// TimeRange returns the min and max time across all keys in the file.
TimeRange() (int64, int64)
// TombstoneRange returns ranges of time that are deleted for the given key.
TombstoneRange(key string) []TimeRange
// KeyRange returns the min and max keys in the file.
KeyRange() (string, string)
// KeyCount returns the number of distinct keys in the file.
KeyCount() int
// KeyAt returns the key located at index position idx.
KeyAt(idx int) ([]byte, byte)
// Type returns the block type of the values stored for the key. Returns one of
// BlockFloat64, BlockInt64, BlockBoolean, BlockString. If key does not exist,
// an error is returned.
Type(key string) (byte, error)
// Delete removes the keys from the set of keys available in this file.
Delete(keys []string) error
// DeleteRange removes the values for keys between timestamps min and max.
DeleteRange(keys []string, min, max int64) error
// HasTombstones returns true if file contains values that have been deleted.
HasTombstones() bool
// TombstoneFiles returns the tombstone filestats if there are any tombstones
// written for this file.
TombstoneFiles() []FileStat
// Close closes the underlying file resources.
Close() error
// Size returns the size of the file on disk in bytes.
Size() uint32
// Rename renames the existing TSM file to a new name and replaces the mmap backing slice using the new
// file name. Index and Reader state are not re-initialized.
Rename(path string) error
// Remove deletes the file from the filesystem.
Remove() error
// InUse returns true if the file is currently in use by queries.
InUse() bool
// Ref records that this file is actively in use.
Ref()
// Unref records that this file is no longer in use.
Unref()
// Stats returns summary information about the TSM file.
Stats() FileStat
// BlockIterator returns an iterator pointing to the first block in the file and
// allows sequential iteration to each and every block.
BlockIterator() *BlockIterator
// Removes mmap references held by another object.
deref(dereferencer)
}
type dereferencer interface {
Dereference([]byte)
}
// Statistics gathered by the FileStore.
const (
statFileStoreBytes = "diskBytes"
statFileStoreCount = "numFiles"
)
// FileStore is an abstraction around multiple TSM files.
type FileStore struct {
mu sync.RWMutex
lastModified time.Time
// Most recently known file stats. If nil then stats will need to be
// recalculated
lastFileStats []FileStat
currentGeneration int
dir string
files []TSMFile
logger zap.Logger // Logger to be used for important messages
traceLogger zap.Logger // Logger to be used when trace-logging is on.
logOutput io.Writer // Writer to be logger and traceLogger if active.
traceLogging bool
stats *FileStoreStatistics
purger *purger
currentTempDirID int
dereferencer dereferencer
}
// FileStat holds information about a TSM file on disk.
type FileStat struct {
Path string
HasTombstone bool
Size uint32
LastModified int64
MinTime, MaxTime int64
MinKey, MaxKey string
}
// OverlapsTimeRange returns true if the time range of the file intersect min and max.
func (f FileStat) OverlapsTimeRange(min, max int64) bool {
return f.MinTime <= max && f.MaxTime >= min
}
// OverlapsKeyRange returns true if the min and max keys of the file overlap the arguments min and max.
func (f FileStat) OverlapsKeyRange(min, max string) bool {
return min != "" && max != "" && f.MinKey <= max && f.MaxKey >= min
}
// ContainsKey returns true if the min and max keys of the file overlap the arguments min and max.
func (f FileStat) ContainsKey(key string) bool {
return f.MinKey >= key || key <= f.MaxKey
}
// NewFileStore returns a new instance of FileStore based on the given directory.
func NewFileStore(dir string) *FileStore {
logger := zap.New(zap.NullEncoder())
fs := &FileStore{
dir: dir,
lastModified: time.Time{},
logger: logger,
traceLogger: logger,
stats: &FileStoreStatistics{},
purger: &purger{
files: map[string]TSMFile{},
logger: logger,
},
}
fs.purger.fileStore = fs
return fs
}
// enableTraceLogging must be called before the FileStore is opened.
func (f *FileStore) enableTraceLogging(enabled bool) {
f.traceLogging = enabled
if enabled {
f.traceLogger = f.logger
}
}
// WithLogger sets the logger on the file store.
func (f *FileStore) WithLogger(log zap.Logger) {
f.logger = log.With(zap.String("service", "filestore"))
f.purger.logger = f.logger
if f.traceLogging {
f.traceLogger = f.logger
}
}
// FileStoreStatistics keeps statistics about the file store.
type FileStoreStatistics struct {
DiskBytes int64
FileCount int64
}
// Statistics returns statistics for periodic monitoring.
func (f *FileStore) Statistics(tags map[string]string) []models.Statistic {
return []models.Statistic{{
Name: "tsm1_filestore",
Tags: tags,
Values: map[string]interface{}{
statFileStoreBytes: atomic.LoadInt64(&f.stats.DiskBytes),
statFileStoreCount: atomic.LoadInt64(&f.stats.FileCount),
},
}}
}
// Count returns the number of TSM files currently loaded.
func (f *FileStore) Count() int {
f.mu.RLock()
defer f.mu.RUnlock()
return len(f.files)
}
// Files returns the slice of TSM files currently loaded.
func (f *FileStore) Files() []TSMFile {
f.mu.RLock()
defer f.mu.RUnlock()
return f.files
}
// CurrentGeneration returns the current generation of the TSM files.
func (f *FileStore) CurrentGeneration() int {
f.mu.RLock()
defer f.mu.RUnlock()
return f.currentGeneration
}
// NextGeneration increments the max file ID and returns the new value.
func (f *FileStore) NextGeneration() int {
f.mu.Lock()
defer f.mu.Unlock()
f.currentGeneration++
return f.currentGeneration
}
// Add adds the given files to the file store's list of files.
func (f *FileStore) Add(files ...TSMFile) {
f.mu.Lock()
defer f.mu.Unlock()
for _, file := range files {
atomic.AddInt64(&f.stats.DiskBytes, int64(file.Size()))
}
f.lastFileStats = nil
f.files = append(f.files, files...)
sort.Sort(tsmReaders(f.files))
atomic.StoreInt64(&f.stats.FileCount, int64(len(f.files)))
}
// Remove removes the files with matching paths from the set of active files. It does
// not remove the paths from disk.
func (f *FileStore) Remove(paths ...string) {
f.mu.Lock()
defer f.mu.Unlock()
var active []TSMFile
for _, file := range f.files {
keep := true
for _, remove := range paths {
if remove == file.Path() {
keep = false
break
}
}
if keep {
active = append(active, file)
} else {
// Removing the file, remove the file size from the total file store bytes
atomic.AddInt64(&f.stats.DiskBytes, -int64(file.Size()))
}
}
f.lastFileStats = nil
f.files = active
sort.Sort(tsmReaders(f.files))
atomic.StoreInt64(&f.stats.FileCount, int64(len(f.files)))
}
// WalkKeys calls fn for every key in every TSM file known to the FileStore. If the key
// exists in multiple files, it will be invoked for each file.
func (f *FileStore) WalkKeys(fn func(key []byte, typ byte) error) error {
f.mu.RLock()
defer f.mu.RUnlock()
for _, f := range f.files {
for i := 0; i < f.KeyCount(); i++ {
key, typ := f.KeyAt(i)
if err := fn(key, typ); err != nil {
return err
}
}
}
return nil
}
// Keys returns all keys and types for all files in the file store.
func (f *FileStore) Keys() map[string]byte {
f.mu.RLock()
defer f.mu.RUnlock()
uniqueKeys := map[string]byte{}
for _, f := range f.files {
for i := 0; i < f.KeyCount(); i++ {
key, typ := f.KeyAt(i)
uniqueKeys[string(key)] = typ
}
}
return uniqueKeys
}
// Type returns the type of values store at the block for key.
func (f *FileStore) Type(key string) (byte, error) {
f.mu.RLock()
defer f.mu.RUnlock()
for _, f := range f.files {
if f.Contains(key) {
return f.Type(key)
}
}
return 0, fmt.Errorf("unknown type for %v", key)
}
// Delete removes the keys from the set of keys available in this file.
func (f *FileStore) Delete(keys []string) error {
return f.DeleteRange(keys, math.MinInt64, math.MaxInt64)
}
// DeleteRange removes the values for keys between timestamps min and max.
func (f *FileStore) DeleteRange(keys []string, min, max int64) error {
f.mu.Lock()
f.lastModified = time.Now().UTC()
f.mu.Unlock()
return f.walkFiles(func(tsm TSMFile) error {
return tsm.DeleteRange(keys, min, max)
})
}
// Open loads all the TSM files in the configured directory.
func (f *FileStore) Open() error {
f.mu.Lock()
defer f.mu.Unlock()
// Not loading files from disk so nothing to do
if f.dir == "" {
return nil
}
// find the current max ID for temp directories
tmpfiles, err := ioutil.ReadDir(f.dir)
if err != nil {
return err
}
for _, fi := range tmpfiles {
if fi.IsDir() && strings.HasSuffix(fi.Name(), ".tmp") {
ss := strings.Split(filepath.Base(fi.Name()), ".")
if len(ss) == 2 {
if i, err := strconv.Atoi(ss[0]); err != nil {
if i > f.currentTempDirID {
f.currentTempDirID = i
}
}
}
}
}
files, err := filepath.Glob(filepath.Join(f.dir, fmt.Sprintf("*.%s", TSMFileExtension)))
if err != nil {
return err
}
// struct to hold the result of opening each reader in a goroutine
type res struct {
r *TSMReader
err error
}
readerC := make(chan *res)
for i, fn := range files {
// Keep track of the latest ID
generation, _, err := ParseTSMFileName(fn)
if err != nil {
return err
}
if generation >= f.currentGeneration {
f.currentGeneration = generation + 1
}
file, err := os.OpenFile(fn, os.O_RDONLY, 0666)
if err != nil {
return fmt.Errorf("error opening file %s: %v", fn, err)
}
// Accumulate file store size stat
fi, err := file.Stat()
if err == nil {
atomic.AddInt64(&f.stats.DiskBytes, fi.Size())
if fi.ModTime().UTC().After(f.lastModified) {
f.lastModified = fi.ModTime().UTC()
}
}
go func(idx int, file *os.File) {
start := time.Now()
df, err := NewTSMReader(file)
f.logger.Info(fmt.Sprintf("%s (#%d) opened in %v", file.Name(), idx, time.Since(start)))
if err != nil {
readerC <- &res{r: df, err: fmt.Errorf("error opening memory map for file %s: %v", file.Name(), err)}
return
}
readerC <- &res{r: df}
}(i, file)
}
for range files {
res := <-readerC
if res.err != nil {
return res.err
}
f.files = append(f.files, res.r)
}
close(readerC)
sort.Sort(tsmReaders(f.files))
atomic.StoreInt64(&f.stats.FileCount, int64(len(f.files)))
return nil
}
// Close closes the file store.
func (f *FileStore) Close() error {
f.mu.Lock()
defer f.mu.Unlock()
for _, file := range f.files {
if f.dereferencer != nil {
file.deref(f.dereferencer)
}
file.Close()
}
f.lastFileStats = nil
f.files = nil
atomic.StoreInt64(&f.stats.FileCount, 0)
return nil
}
// Read returns the slice of values for the given key and the given timestamp,
// if any file matches those constraints.
func (f *FileStore) Read(key string, t int64) ([]Value, error) {
f.mu.RLock()
defer f.mu.RUnlock()
for _, f := range f.files {
// Can this file possibly contain this key and timestamp?
if !f.Contains(key) {
continue
}
// May have the key and time we are looking for so try to find
v, err := f.Read(key, t)
if err != nil {
return nil, err
}
if len(v) > 0 {
return v, nil
}
}
return nil, nil
}
// KeyCursor returns a KeyCursor for key and t across the files in the FileStore.
func (f *FileStore) KeyCursor(key string, t int64, ascending bool) *KeyCursor {
f.mu.RLock()
defer f.mu.RUnlock()
return newKeyCursor(f, key, t, ascending)
}
// Stats returns the stats of the underlying files, preferring the cached version if it is still valid.
func (f *FileStore) Stats() []FileStat {
f.mu.RLock()
if len(f.lastFileStats) > 0 {
defer f.mu.RUnlock()
return f.lastFileStats
}
f.mu.RUnlock()
// The file stats cache is invalid due to changes to files. Need to
// recalculate.
f.mu.Lock()
// If lastFileStats's capacity is far away from the number of entries
// we need to add, then we'll reallocate.
if cap(f.lastFileStats) < len(f.files)/2 {
f.lastFileStats = make([]FileStat, 0, len(f.files))
}
for _, fd := range f.files {
f.lastFileStats = append(f.lastFileStats, fd.Stats())
}
defer f.mu.Unlock()
return f.lastFileStats
}
// Replace replaces oldFiles with newFiles.
func (f *FileStore) Replace(oldFiles, newFiles []string) error {
if len(oldFiles) == 0 && len(newFiles) == 0 {
return nil
}
f.mu.Lock()
defer f.mu.Unlock()
maxTime := f.lastModified
// Copy the current set of active files while we rename
// and load the new files. We copy the pointers here to minimize
// the time that locks are held as well as to ensure that the replacement
// is atomic.©
updated := make([]TSMFile, len(f.files))
copy(updated, f.files)
// Rename all the new files to make them live on restart
for _, file := range newFiles {
var newName = file
if strings.HasSuffix(file, ".tmp") {
// The new TSM files have a tmp extension. First rename them.
newName = file[:len(file)-4]
if err := os.Rename(file, newName); err != nil {
return err
}
}
fd, err := os.Open(newName)
if err != nil {
return err
}
// Keep track of the new mod time
if stat, err := fd.Stat(); err == nil {
if stat.ModTime().UTC().After(maxTime) {
maxTime = stat.ModTime().UTC()
}
}
tsm, err := NewTSMReader(fd)
if err != nil {
return err
}
updated = append(updated, tsm)
}
// We need to prune our set of active files now
var active, inuse []TSMFile
for _, file := range updated {
keep := true
for _, remove := range oldFiles {
if remove == file.Path() {
keep = false
// If queries are running against this file, then we need to move it out of the
// way and let them complete. We'll then delete the original file to avoid
// blocking callers upstream. If the process crashes, the temp file is
// cleaned up at startup automatically.
if file.InUse() {
// Copy all the tombstones related to this TSM file
var deletes []string
for _, t := range file.TombstoneFiles() {
deletes = append(deletes, t.Path)
}
deletes = append(deletes, file.Path())
// Rename the TSM file used by this reader
tempPath := file.Path() + ".tmp"
if err := file.Rename(tempPath); err != nil {
return err
}
// Remove the old file and tombstones. We can't use the normal TSMReader.Remove()
// because it now refers to our temp file which we can't remove.
for _, f := range deletes {
if err := os.RemoveAll(f); err != nil {
return err
}
}
inuse = append(inuse, file)
continue
}
// Remove any mmap references held by the index.
if f.dereferencer != nil {
file.deref(f.dereferencer)
}
if err := file.Close(); err != nil {
return err
}
if err := file.Remove(); err != nil {
return err
}
break
}
}
if keep {
active = append(active, file)
}
}
if err := syncDir(f.dir); err != nil {
return err
}
// Tell the purger about our in-use files we need to remove
f.purger.add(inuse)
// If times didn't change (which can happen since file mod times are second level),
// then add a ns to the time to ensure that lastModified changes since files on disk
// actually did change
if maxTime.Equal(f.lastModified) {
maxTime = maxTime.UTC().Add(1)
}
f.lastModified = maxTime.UTC()
f.lastFileStats = nil
f.files = active
sort.Sort(tsmReaders(f.files))
atomic.StoreInt64(&f.stats.FileCount, int64(len(f.files)))
// Recalculate the disk size stat
var totalSize int64
for _, file := range f.files {
totalSize += int64(file.Size())
}
atomic.StoreInt64(&f.stats.DiskBytes, totalSize)
return nil
}
// LastModified returns the last time the file store was updated with new
// TSM files or a delete.
func (f *FileStore) LastModified() time.Time {
f.mu.RLock()
defer f.mu.RUnlock()
return f.lastModified
}
// BlockCount returns number of values stored in the block at location idx
// in the file at path. If path does not match any file in the store, 0 is
// returned. If idx is out of range for the number of blocks in the file,
// 0 is returned.
func (f *FileStore) BlockCount(path string, idx int) int {
f.mu.RLock()
defer f.mu.RUnlock()
if idx < 0 {
return 0
}
for _, fd := range f.files {
if fd.Path() == path {
iter := fd.BlockIterator()
for i := 0; i < idx; i++ {
if !iter.Next() {
return 0
}
}
_, _, _, _, block, _ := iter.Read()
return BlockCount(block)
}
}
return 0
}
// walkFiles calls fn for each file in filestore in parallel.
func (f *FileStore) walkFiles(fn func(f TSMFile) error) error {
// Copy the current TSM files to prevent a slow walker from
// blocking other operations.
f.mu.RLock()
files := make([]TSMFile, len(f.files))
copy(files, f.files)
f.mu.RUnlock()
// struct to hold the result of opening each reader in a goroutine
errC := make(chan error, len(files))
for _, f := range files {
go func(tsm TSMFile) {
if err := fn(tsm); err != nil {
errC <- fmt.Errorf("file %s: %s", tsm.Path(), err)
return
}
errC <- nil
}(f)
}
for i := 0; i < cap(errC); i++ {
res := <-errC
if res != nil {
return res
}
}
return nil
}
// locations returns the files and index blocks for a key and time. ascending indicates
// whether the key will be scan in ascending time order or descenging time order.
// This function assumes the read-lock has been taken.
func (f *FileStore) locations(key string, t int64, ascending bool) []*location {
filesSnapshot := make([]TSMFile, len(f.files))
for i := range f.files {
filesSnapshot[i] = f.files[i]
}
var entries []IndexEntry
locations := make([]*location, 0, len(filesSnapshot))
for _, fd := range filesSnapshot {
minTime, maxTime := fd.TimeRange()
tombstones := fd.TombstoneRange(key)
// If we ascending and the max time of the file is before where we want to start
// skip it.
if ascending && maxTime < t {
continue
// If we are descending and the min time of the file is after where we want to start,
// then skip it.
} else if !ascending && minTime > t {
continue
}
// This file could potential contain points we are looking for so find the blocks for
// the given key.
fd.ReadEntries(key, &entries)
for _, ie := range entries {
// Skip any blocks only contain values that are tombstoned.
var skip bool
for _, t := range tombstones {
if t.Min <= ie.MinTime && t.Max >= ie.MaxTime {
skip = true
break
}
}
if skip {
continue
}
// If we ascending and the max time of a block is before where we are looking, skip
// it since the data is out of our range
if ascending && ie.MaxTime < t {
continue
// If we descending and the min time of a block is after where we are looking, skip
// it since the data is out of our range
} else if !ascending && ie.MinTime > t {
continue
}
location := &location{
r: fd,
entry: ie,
}
if ascending {
// For an ascending cursor, mark everything before the seek time as read
// so we can filter it out at query time
location.readMin = math.MinInt64
location.readMax = t - 1
} else {
// For an ascending cursort, mark everything after the seek time as read
// so we can filter it out at query time
location.readMin = t + 1
location.readMax = math.MaxInt64
}
// Otherwise, add this file and block location
locations = append(locations, location)
}
}
return locations
}
// CreateSnapshot creates hardlinks for all tsm and tombstone files
// in the path provided.
func (f *FileStore) CreateSnapshot() (string, error) {
f.traceLogger.Info(fmt.Sprintf("Creating snapshot in %s", f.dir))
files := f.Files()
f.mu.Lock()
f.currentTempDirID += 1
f.mu.Unlock()
f.mu.RLock()
defer f.mu.RUnlock()
// get a tmp directory name
tmpPath := fmt.Sprintf("%s/%d.tmp", f.dir, f.currentTempDirID)
err := os.Mkdir(tmpPath, 0777)
if err != nil {
return "", err
}
for _, tsmf := range files {
newpath := filepath.Join(tmpPath, filepath.Base(tsmf.Path()))
if err := os.Link(tsmf.Path(), newpath); err != nil {
return "", fmt.Errorf("error creating tsm hard link: %q", err)
}
// Check for tombstones and link those as well
for _, tf := range tsmf.TombstoneFiles() {
newpath := filepath.Join(tmpPath, filepath.Base(tf.Path))
if err := os.Link(tf.Path, newpath); err != nil {
return "", fmt.Errorf("error creating tombstone hard link: %q", err)
}
}
}
return tmpPath, nil
}
// ParseTSMFileName parses the generation and sequence from a TSM file name.
func ParseTSMFileName(name string) (int, int, error) {
base := filepath.Base(name)
idx := strings.Index(base, ".")
if idx == -1 {
return 0, 0, fmt.Errorf("file %s is named incorrectly", name)
}
id := base[:idx]
idx = strings.Index(id, "-")
if idx == -1 {
return 0, 0, fmt.Errorf("file %s is named incorrectly", name)
}
generation, err := strconv.ParseUint(id[:idx], 10, 32)
if err != nil {
return 0, 0, fmt.Errorf("file %s is named incorrectly", name)
}
sequence, err := strconv.ParseUint(id[idx+1:], 10, 32)
if err != nil {
return 0, 0, fmt.Errorf("file %s is named incorrectly", name)
}
return int(generation), int(sequence), nil
}
// KeyCursor allows iteration through keys in a set of files within a FileStore.
type KeyCursor struct {
key string
fs *FileStore
// seeks is all the file locations that we need to return during iteration.
seeks []*location
// current is the set of blocks possibly containing the next set of points.
// Normally this is just one entry, but there may be multiple if points have
// been overwritten.
current []*location
buf []Value
// pos is the index within seeks. Based on ascending, it will increment or
// decrement through the size of seeks slice.
pos int
ascending bool
// duplicates is a hint that there are overlapping blocks for this key in
// multiple files (e.g. points have been overwritten but not fully compacted)
// If this is true, we need to scan the duplicate blocks and dedup the points
// as query time until they are compacted.
duplicates bool
// The distinct set of TSM files references by the cursor
refs map[string]TSMFile
}
type location struct {
r TSMFile
entry IndexEntry
readMin, readMax int64
}
func (l *location) read() bool {
return l.readMin <= l.entry.MinTime && l.readMax >= l.entry.MaxTime
}
func (l *location) markRead(min, max int64) {
if min < l.readMin {
l.readMin = min
}
if max > l.readMax {
l.readMax = max
}
}
type descLocations []*location
// Sort methods
func (a descLocations) Len() int { return len(a) }
func (a descLocations) Swap(i, j int) { a[i], a[j] = a[j], a[i] }
func (a descLocations) Less(i, j int) bool {
if a[i].entry.OverlapsTimeRange(a[j].entry.MinTime, a[j].entry.MaxTime) {
return a[i].r.Path() < a[j].r.Path()
}
return a[i].entry.MaxTime < a[j].entry.MaxTime
}
type ascLocations []*location
// Sort methods
func (a ascLocations) Len() int { return len(a) }
func (a ascLocations) Swap(i, j int) { a[i], a[j] = a[j], a[i] }
func (a ascLocations) Less(i, j int) bool {
if a[i].entry.OverlapsTimeRange(a[j].entry.MinTime, a[j].entry.MaxTime) {
return a[i].r.Path() < a[j].r.Path()
}
return a[i].entry.MinTime < a[j].entry.MinTime
}
// newKeyCursor returns a new instance of KeyCursor.
// This function assumes the read-lock has been taken.
func newKeyCursor(fs *FileStore, key string, t int64, ascending bool) *KeyCursor {
c := &KeyCursor{
key: key,
fs: fs,
seeks: fs.locations(key, t, ascending),
ascending: ascending,
}
c.refs = make(map[string]TSMFile, len(c.seeks))
c.duplicates = c.hasOverlappingBlocks()
if ascending {
sort.Sort(ascLocations(c.seeks))
} else {
sort.Sort(descLocations(c.seeks))
}
// Determine the distinct set of TSM files in use and mark then as in-use
for _, f := range c.seeks {
if _, ok := c.refs[f.r.Path()]; !ok {
f.r.Ref()
c.refs[f.r.Path()] = f.r
}
}
c.seek(t)
return c
}
// Close removes all references on the cursor.
func (c *KeyCursor) Close() {
// Remove all of our in-use references since we're done
for _, f := range c.refs {
f.Unref()
}
c.buf = nil
c.seeks = nil
c.fs = nil
c.current = nil
}
// hasOverlappingBlocks returns true if blocks have overlapping time ranges.
// This result is computed once and stored as the "duplicates" field.
func (c *KeyCursor) hasOverlappingBlocks() bool {
if len(c.seeks) == 0 {
return false
}
for i := 1; i < len(c.seeks); i++ {
prev := c.seeks[i-1]
cur := c.seeks[i]
if prev.entry.MaxTime >= cur.entry.MinTime {
return true
}
}
return false
}
// seek positions the cursor at the given time.
func (c *KeyCursor) seek(t int64) {
if len(c.seeks) == 0 {
return
}
c.current = nil
if c.ascending {
c.seekAscending(t)
} else {
c.seekDescending(t)
}
}
func (c *KeyCursor) seekAscending(t int64) {
for i, e := range c.seeks {
if t < e.entry.MinTime || e.entry.Contains(t) {
// Record the position of the first block matching our seek time
if len(c.current) == 0 {
c.pos = i
}
c.current = append(c.current, e)
// Exit if we don't have duplicates.
// Otherwise, keep looking for additional blocks containing this point.
if !c.duplicates {
return
}
}
}
}
func (c *KeyCursor) seekDescending(t int64) {
for i := len(c.seeks) - 1; i >= 0; i-- {
e := c.seeks[i]
if t > e.entry.MaxTime || e.entry.Contains(t) {
// Record the position of the first block matching our seek time
if len(c.current) == 0 {
c.pos = i
}
c.current = append(c.current, e)
// Exit if we don't have duplicates.
// Otherwise, keep looking for additional blocks containing this point.
if !c.duplicates {
return
}
}
}
}
// Next moves the cursor to the next position.
// Data should be read by the ReadBlock functions.
func (c *KeyCursor) Next() {
if len(c.current) == 0 {
return
}
// Do we still have unread values in the current block
if !c.current[0].read() {
return
}
c.current = c.current[:0]
if c.ascending {
c.nextAscending()
} else {
c.nextDescending()
}
}
func (c *KeyCursor) nextAscending() {
for {
c.pos++
if c.pos >= len(c.seeks) {
return
} else if !c.seeks[c.pos].read() {
break
}
}
// Append the first matching block
if len(c.current) == 0 {
c.current = append(c.current, nil)
} else {
c.current = c.current[:1]
}
c.current[0] = c.seeks[c.pos]
// We're done if there are no overlapping blocks.
if !c.duplicates {
return
}
// If we have ovelapping blocks, append all their values so we can dedup
for i := c.pos + 1; i < len(c.seeks); i++ {
if c.seeks[i].read() {
continue
}
c.current = append(c.current, c.seeks[i])
}
}
func (c *KeyCursor) nextDescending() {
for {
c.pos--
if c.pos < 0 {
return
} else if !c.seeks[c.pos].read() {
break
}
}
// Append the first matching block
if len(c.current) == 0 {
c.current = make([]*location, 1)
} else {
c.current = c.current[:1]
}
c.current[0] = c.seeks[c.pos]
// We're done if there are no overlapping blocks.
if !c.duplicates {
return
}
// If we have ovelapping blocks, append all their values so we can dedup
for i := c.pos; i >= 0; i-- {
if c.seeks[i].read() {
continue
}
c.current = append(c.current, c.seeks[i])
}
}
func (c *KeyCursor) filterFloatValues(tombstones []TimeRange, values FloatValues) FloatValues {
for _, t := range tombstones {
values = values.Exclude(t.Min, t.Max)
}
return values
}
func (c *KeyCursor) filterIntegerValues(tombstones []TimeRange, values IntegerValues) IntegerValues {
for _, t := range tombstones {
values = values.Exclude(t.Min, t.Max)
}
return values
}
func (c *KeyCursor) filterStringValues(tombstones []TimeRange, values StringValues) StringValues {
for _, t := range tombstones {
values = values.Exclude(t.Min, t.Max)
}
return values
}
func (c *KeyCursor) filterBooleanValues(tombstones []TimeRange, values BooleanValues) BooleanValues {
for _, t := range tombstones {
values = values.Exclude(t.Min, t.Max)
}
return values
}
type purger struct {
mu sync.RWMutex
fileStore *FileStore
files map[string]TSMFile
running bool
logger zap.Logger
}
func (p *purger) add(files []TSMFile) {
p.mu.Lock()
for _, f := range files {
p.files[f.Path()] = f
}
p.mu.Unlock()
p.purge()
}
func (p *purger) purge() {
p.mu.Lock()
if p.running {
p.mu.Unlock()
return
}
p.running = true
p.mu.Unlock()
go func() {
for {
p.mu.Lock()
for k, v := range p.files {
if !v.InUse() {
// Remove any mmap references held by the index.
if p.fileStore.dereferencer != nil {
v.deref(p.fileStore.dereferencer)
}
if err := v.Close(); err != nil {
p.logger.Info(fmt.Sprintf("purge: close file: %v", err))
continue
}
if err := v.Remove(); err != nil {
p.logger.Info(fmt.Sprintf("purge: remove file: %v", err))
continue
}
delete(p.files, k)
}
}
if len(p.files) == 0 {
p.running = false
p.mu.Unlock()
return
}
p.mu.Unlock()
time.Sleep(time.Second)
}
}()
}
type tsmReaders []TSMFile
func (a tsmReaders) Len() int { return len(a) }
func (a tsmReaders) Less(i, j int) bool { return a[i].Path() < a[j].Path() }
func (a tsmReaders) Swap(i, j int) { a[i], a[j] = a[j], a[i] }
| 2023-10-29T01:26:18.401715 | https://example.com/article/3580 |
How long do countries have until their populations disappear?
AS The Economistreports this week, many women in the richer parts of Asia have gone on “marriage strike”, preferring the single life to the marital yoke. That is one reason why their fertility rates have fallen. And they are not alone. In 83 countries and territories around the world, according to the United Nations, women will not have enough daughters to replace themselves, unless fertility rates rise. In Hong Kong, for example, a cohort of 1,000 women would be expected to give birth to just 547 daughters, at today's fertility rates. (That gives Hong Kong a “net reproduction rate” of just 0.547, in the language of demographers.) If nothing changed, those 547 daughters would be succeeded by just 299 daughters of their own, and so on. At that rate, according to some back-of-the-envelope calculations by The Economist, it would take about 25 generations for Hong Kong's female population to shrink from 3.75m to just one. Given that Hong Kong's average age of childbearing is 31.4 years, it could expect to give birth to its last woman in the year 2798. (That is some time after its neighbour, Macau, which has a higher reproduction rate, but a much smaller population.) By the same unflinching logic, Japan, Germany, Russia, Italy and Spain will not see out the next millennium. Even China, which has a recorded history stretching back at least 3,700 years, has only about 1,500 years left—if present trends continued unbroken. | 2023-09-25T01:26:18.401715 | https://example.com/article/3349 |
The villagers of Puma Changthang township draw lots to get their new houses. [Photo provided to chinadaily.com.cn]
By last week 133 villagers from 29 households in Tibet's Puma Changthang township had all finished moving into their new houses, meaning all the township's residents were living in free houses provided by the government.
Sharing a 25-km border with Bhutan where the average altitude tops 5,300 meters above sea level, the Puma Changthang township is in Nakarze county of Southwest China's Tibet autonomous region, and it is renowned as the "world's highest township".
Resettlement in new housing provided by the government is part of the government's efforts to ensure its entire population lives comfortably in border areas.
Prospering the border townships by boosting the economy, social stability, and helping people become rich is part of Nakarze county's key measures in its livelihood project.
According to the county government, the county's border construction project involves two townships and 17 villages, and the project cost more than 643 million yuan ($91 million).
Project construction includes villagers' houses, village committee offices, a village clinic, water supply, and roads.
This phase of the township's construction project benefited 282 households with a population of 1,023. Other residents have started moving into new houses in 2017. | 2023-10-01T01:26:18.401715 | https://example.com/article/7598 |
A method for the molecular imprinting of hemoglobin on silica surfaces using silanes.
A new molecular imprinting technique using covalently immobilized hemoglobin (Hb) is described for creating Hb-specific recognition cavities on silica. Two kinds of organic silane (3-aminopropyltrimethoxysilane: APTMS, and trimethoxypropylsilane: TMPS) were polymerized on a surface of porous silica after the Hb template was covalently immobilized by forming imine bonds, and their influence was analyzed. The results showed that not only the silane amount but also the relative proportions play an important role in protein imprinting. Pore size distribution on Hb imprinted silica was determined by nitrogen adsorption/desorption after removing the template Hb. The Hb-imprinted silica using covalently immobilized Hb (MIPi) as a template proved superior to silica using free Hb (MIPf) regarding displacement of template Hb, and selective re-adsorption as compared with other non-template proteins. The results suggested the capacity for selective adsorption of MIPi to be not only based on the isoelectric point (pI) and protein molecular weight, but also the characteristics of protein recognition cavities imprinted on base silica. | 2024-01-12T01:26:18.401715 | https://example.com/article/8619 |
Curious more than anything, Magdalena Boulet took a spot at the edge of the Placer High School track in the Sierra Nevada foothills to watch the end of the Western States Endurance Run, the prestigious 100–mile event that gave rise to the ultrarunning movement. In 2013, she was deep into a career that made her one of the top distance runners in the J U.S.—second at the 2008 Olympic Marathon Trials, owner of a 2:26:22 personal best, and a two–time world cross country medalist. As she found new success at longer distances like 50K, she thought Western States might be in her future but wasn't convinced until she watched runners melt in triumph and relief as they crossed the finish line. "It gave me goosebumps." Boulet says, "You could sense this was a huge accomplishment. It was so much bigger than them. I thought, 'I want to experience that joy.'"
Boulet's opportunity is coming on June 27, when she's scheduled to compete in her first Western States. In doing so, she sends another signal that there is a change in the running world, a shift in perception, goals, and even limits.
For a while—since, say, the fifth century B.C., when an exhausted Pheidippides met his fate—the marathon was viewed as the ultimate endurance test. But that was before extreme runners like Ann Trason, Scott Jurek, Dean Karnazes, and El Caballo Blanco redefined boundaries. Now that social media has reinforced the notion that everyday runners—friends, relatives, drinking buddies, soccer moms—can cover unimaginable distances, 26.2 miles no longer constitutes the edge of the endurance horizon.
One hundred miles. The distance no longer terrorizes. Dare we say it's even a checkmark on bucket lists, somewhere alongside visiting the Great Wall of China and going on an African safari? Could 100 miles be the new marathon?
"So many have proven they can finish a marathon," says Greg McMillan, of McMillan Running coaching services. "Now, they want the next challenge. It's a natural evolution."
Statistics indicate McMillan is right: 100–mile finishes in the United States have increased from 1,378 to 7,029 since 2003. In 2014, the number grew by 17 percent.
Sure, 100–milers won't threaten the marathon anytime soon; last year, the New York City Marathon had 50,530 finishers. But it shows a comparable stage of the race's development: During the early running–boom year of 1976, an estimated 25,000 people finished U.S. marathons. Last year, 34,180 Americans finished ultras. Worldwide, the number was 208,181.
"There are a number of us for whom a marathon is relatively ordinary," says Ron Little, vice president of the Coastside Running Club in Half Moon Bay, California. "It's a distance we cover in training runs."
No Oprah Effect
While the popularity of the distance might be on the rise, Western States likely won't be hosting celebrity entrants anytime soon, like so many marathons do.
"Ultras have grown immensely, but I don't know if they're comparable [to marathons]," says Hal Koerner, Western States and Hardrock champ and author of Hal Koerner's Field Guide to Ultrarunning. "I mean, 26.2 miles is something most people can comprehend. P. Diddy, Oprah, and Pam Anderson have done one. There still aren't a lot of people you meet that have run 100 miles.
"The mileage holds a lot of respect with the everyday runner. But most still think you're crazy for running that far," he says.
Brett Gotcher, a 2:10:36 marathoner and aspiring 2016 Olympian, hears more chatter among runners about attempting distances longer than 26.2 miles, but he isn't contemplating it himself. "It's definitely crossed my mind. One or two times I've gotten that invincible feeling where I feel I can run forever," he says. "You wonder how far you could go. Could I be good at that? But then I say, 'No way' It's a totally different sport. It requires a different mentality."
Preparing On All Terrains
Sage Canaday, who is attempting to qualify for his third Olympic trials marathon, has developed into one of America's premier mountain/ultra/trail runners. Five months after running the Los Angeles Marathon, he plans to tackle 100 miles for the first time on Aug. 28 at the prestigious Ultra–Trail du Mont–Blanc (UTMB) in Chamonix, France. The course traverses three countries, 400 summits, and has 35,000 feet of climbing.
Canaday, 29, is unafraid of breaking from the established road–running world to explore the possibility of greater opportunities beyond, in largely uncharted territory.
RELATED: 10 Ways to Prepare for 100 Miles
"It's the same sport of distance running, whether you're running a mile or 100 miles," Canaday says. "It's a similar struggle."
Canaday's transition to trails and ultra–running was more of a progression than a goal. Training professionally for the roads didn't suit him as much as the mountains did, and Canaday went on to win national mountain and trail championships. He set an American record in the Mt. Washington Road Race and captured consecutive Tarawera 100K titles in New Zealand.
The UTMB course is daunting enough because of the climbs, the aggressive pacing of the Europeans, and the unpredictable weather. But, even to Canaday, 100 miles—more than 40 miles longer than he has ever attempted at once—is disconcerting.
"It would be hard enough on a straight track. Add all the other variables, and it can be a complete disaster. I worry that I will have a complete breakdown and won't be able to finish," Canaday says.
Canaday has prepared with 10,000–15,000 feet of climbing a week around his home in Boulder, Colorado. On a single run, he can gain 5,000–6,000 feet over 20 miles.
Anna Frost, a top ultrarunner who grew up on a hilltop in the New Zealand countryside, found motivation to move up to 100 miles because of her desire to compete at the Hardrock 100. Set at an average of 11,000 feet, Hardrock boasts 67,984 feet of elevation change in Colorado's San Juan range.
"The distance never intrigued me as much until now," says Frost, 33, who set a course record during her first 100–miler, the Bear 100 in Logan, Utah, and earned passage to the July 15 Hardrock race.
Frost finds her inspiration in the mountains and views the growth of the sport as positive, as long as it does not exploit the environment or stray from its origins as something of a spiritual quest.
"I feel the values of people doing 100–milers are true and heartfelt, and I believe this will continue, even when it grows," she says. "It's wonderful to see so many people enjoy the beauty of trail running. But there is a risk of the sport growing into something that doesn't keep in line with the true trail–running values and the spirit of being in the mountains."
Pushing Through
Most ultra vets will say that the biggest difference between the marathon and 100 miles is the suffering. The tone grows darker as the distance grows longer.
"In a shorter race, there are high points and low points, but they're pretty short–lived," says Emily Harrison, the reigning U.S. and world 50K road champ who twice raced at Western States, though she wasn't able to finish in 2014. "You learn how to push through it. But in a longer race, learning how to suffer is very different, especially for people used to being able to run fast and push hard the whole time."
For a distance so difficult, why are more people able to complete it? Like any goal, it mostly comes down to desire.
"If you really want to do it, you can do it," says Ian Torrence, a McMillan Running coach who has run 187 ultras. "Normal people who have children and 40–hour–a–week jobs, they do it. You see people running crazy 200–mile weeks lining up next to people running 30–mile weeks. Even if you know their entire training history, it's really impossible to say who's going to finish and who's not."
Some major races have qualifying standards, but most trust that entrants are properly prepared. Even so, safeguards are often in place, with smaller loops and frequent aid stations and checkpoints.
"I don't know how well–trained any runner is who runs my races," says Joe Prusaitis, director of the Rocky Raccoon 100 in Huntsville, Texas. "I can't tell from looking at anyone if they can do it or not. Mental strength cannot be underestimated, and physical strength can be overestimated. The miles will sort it all out."
The Experience
In late January, Andreana Haley and Tim Hackett stood on the starting lines of their first 100–mile races—Haley at the Rocky Raccoon and Hackett at the Coldwater Rumble in Goodyear, Arizona.
Haley, 42, is a clinical scientist from Austin, Texas, studying the relationships between exercise and the aging of the brain. She was drawn to running by her desire to become a guinea pig of sorts, and to trail ultras by "Running on the Sun," a documentary on Death Valley's 1999 Badwater 135.
Hackett, a self–described "desk jockey," smoked for 20 years and was 40 pounds overweight when, he says, a backpacking trip with his son's Scout troop "just about killed me."
Humbled, Hackett stopped smoking, started running, and powered through a half marathon and marathon before discovering the trails ringing the Valley of the Sun.
"While all this was going on, I was laid off, got another job, and got divorced," says Hackett, 48, of Mesa, Arizona. "The goal for me has never been to win races. It's about feeling better and not dropping dead of a heart attack in five or 10 years."
Hackett began the Coldwater conservatively. Thirty hours was his goal, but the five–loop course at Estrella Mountain Regional Park was more difficult than he anticipated, with miles of deep sand in canyon washes.
The third loop took him an excruciating 7.5 hours to finish, as blisters sliced into his feet and nausea overwhelmed him. Walking replaced running. Hackett's savior: Cup Noodles. The sodium allowed his body to rebalance, and Hackett was able to gather his energy for the final push.
"There were times of feeling really good and feeling really bad," he says. "I knew you just have to ride through it."
For Haley, anxiety prevented her from sleeping the night before. And at 60 miles, she too felt nauseous and refused to eat.
Friends demanded she choke down food, and finally they gave her an ultimatum: "No food, no running."
After 20 minutes, she felt well enough to eat and began to run. She sensed that if she could get through the night, everything would be fine. With 10 miles to go, the sun rose brightly, and Haley felt rejuvenated.
Hackett's pace quickened over the final 5 miles and he felt a "sense of elation" as he crossed the line in 29:30:20. He was 17th in a race that only 34 of 72 entrants finished.
Haley was thankful to avoid visions of pink elephants and other hallucinations, and passed runners swaying, puking, limping, and passing out, on her way to a time of 28:21:21.
"I jumped into this stuff before I had a sense of what I was doing," she says. "In some sense, you don't know what you're capable of."
But isn't that the point in this new age of running? You're willing to find out.
This content is created and maintained by a third party, and imported onto this page to help users provide their email addresses. You may be able to find more information about this and similar content at piano.io | 2024-02-05T01:26:18.401715 | https://example.com/article/1918 |
Julian Szekely
Julian Szekely (November 23, 1934 – December 7, 1995) was a Hungarian-American chemical engineer and materials scientist. He was a professor of materials science and engineering at the Massachusetts Institute of Technology.
Born in Budapest, Hungary, Szekely received both his BSc (1959) and PhD (1961) in chemical engineering from Imperial College London. He moved to the United States in 1966, becoming a US citizen in 1972.
References
Category:1934 births
Category:1995 deaths
Category:Engineering academics
Category:Chemical engineers
Category:Massachusetts Institute of Technology faculty
Category:University at Buffalo faculty
Category:Academics of Imperial College London
Category:Alumni of Imperial College London
Category:Hungarian emigrants to the United States
Category:People from Budapest
Category:20th-century American engineers | 2024-06-01T01:26:18.401715 | https://example.com/article/2381 |
The top 20 HTML5 games - olind
http://www.netmagazine.com/features/top-20-html5-games
======
EtienneK
Cut the rope needs to be there: <http://www.cuttherope.ie>
------
krmmalik
I see alot of HTML5 games, some really very good ones on many lists, but what
i still dont see is many multi-player versions of the same games, or just
multiplayer games ,period.
I know that with the advent of architectures like Node.js this is a very real
possibility so i'm very surprised i havent seen more in this space. I would
have thought this is a market that's getting ready to explode(?)
~~~
BHSPitMonkey
I've worked on a few prototypes for games built with Node.js and HTML5, but
one hurdle I kept running into is how to prevent cheating/exploitation. Turns
out, with JavaScript, it's a (mostly) insurmountable problem, since any
client-side communication/action is inherently script-able.
~~~
krmmalik
Hmm. Interesting. I had never considered that possibility before. Is this a
problem with the single player HTML5 games as well? I presume this is a
possibility wherever javascript is part of the game logic?
------
Serentiynow
More games can be found on this google page:
<http://www.chromeexperiments.com/tag/games/>
------
justncase80
This is my favorite: <http://dominion.isotropic.org/>
------
TCS
Good collection
| 2024-03-31T01:26:18.401715 | https://example.com/article/6943 |
Social Media Icons
Friday, April 26, 2013
Five for Friday....
It's Friday, Friday! Yesterday was the NEW Friday for me, but I was only in my classroom two days this week because my little Punkin was sick and was generous and shared with the rest of us! Yikes! Link up with Doodle Bugs for the all the lastest! I love Five for Friday, from posting to reading what is going on and gaining perspective, to reading about other people's struggles, to venting my frustrations, to finding the good things to dwell on from my class.
My Five this week feels a lot like a rehash to me. I guess I am stuck on the same thoughts over and over and over. So bear with me faithful few, I have always heard you talk about what is going on and if something is wrong you talk about it until it doesn't hurt (so much) any more.
1. My Punky got sick Wednesday morning and I went up to the school early and wrote sub plans and came home and put my head in the sand and tried not to imagine what was happening in my class without me. Anyone else feel this way? That NO ONE can take care of your kiddos like you can, and that a sub will certainly ruin your class even if for only one day? But it turned into two days.... I felt... sluggish the first morning and as the day wore on I felt less like myself and less like myself. By evening I had such a horrible headache I considered crying but I didn't dare because it would hurt worse. And then I look over at my daughter on the couch and she is shivering and saying how cold she was and she's flushed and I touch her and she was burning up! Yikes! So I called my blessed principal and she found me a sub for the next day too.
Finally able to rest...
2. The transition from centers to more independent writing activities is starting to smooth out. I got to look at and assess some of the students work, they are figuring out how to work quietly, and they are staying on task! Yay!!!
We are focusing on finishing old projects. The above project was discovered stashed in a students' desk.... since some time before the middle of March. I have been stressing to students that they need to finish their work and not let it pile up. This is one of the things we will discuss in our writer's conference this week.
Here is this delightful rubric again. I got it from a free download and I posted about it last week,
get more information here.
3. The new pet! Whoo! We got a hamster for our classroom. My children are thrilled. I have said over and over and over and over (and over?) that we will never have a rodent in our house. But guess where classroom pets go over the summer. That's right... I am the proud (?) owner of a hamster. Here are a couple photos. Most of the photos I took didn't turn out because this little guy is "not snuggly and cuddly" (translation: not friendly and doesn't like to be held or touched), so she runs when you touch her or try to even watch her too much. I have plenty of blurry photos of my little hamster running as fast as she can on her little wheel. Yes, I am a little bit excited about this little rodent.
I'm sorry, snuggly or not, she's cute! :)
4. Boo-hoo.... pity party in progress. You can join it right here. Leaps of faith seldom work out the way I have them planned. And I have noticed that God seldom ever asks me for input in regard to my life. Boo hoo. I would love, love, love to work in my own town. But my own town won't even look at my resume or call my references! So I am sad for myself and licking my wounds even though I know that my God has a job out there for me. Here's the whole pity list: I am now applying for jobs as far as an hour commute away, I can't get my hometown to look at me professionally, I will be leaving a teaching team I love and students I adore and so far I cannot figure out how I'm going to pay my bills. So I am counting on the prayers of my family and friends to help me remember that my God will supply all my needs and I am so grateful that friends and family support me in every way possible.
5. Gratitude reigns (rains?). I am SO grateful that I will be living in MY HOME again in two months! TWO MONTHS! Whooo.....
This is the house we are renting in our current town.
Our Home that God put in our lives and I miss terribly.... see you soon lovely home!
P.S. Only 16 days of school with students and 17 days for teachers, then a mass exit-us (haha... exodus, get it?) for me, clearing out my classroom so they can a) move my class across the street, and b) so the new Kinder teacher can get it organized how she wants it.
I, too, found your blog through the Five for Friday linky, and now am a follower! The pic of your daughter and dog is cute. My chihuahua also loves to snuggle when we are sick. I'd love to have you visit my blog, Kindergartendoodles.blogspot.comLinda | 2024-04-11T01:26:18.401715 | https://example.com/article/8565 |
Repair and Warranty
Be careful who you're buying from!Purchasing from un-authorized vendors may result in refusal of warranty services or support from a genuine dealer.
Return Policy
Returns will be accepted only for products determined to be faulty at time of manufacture. Returned merchandise can be exchanged for identical replacements or a refund of the purchase price if returned in the original and unopened packaging. Merchandise cannot be returned if it has been damaged as a result of improper use or accident. Returned merchandise may be subject to a 20% restocking fee. Please contact us via our Contacts page for an RMA number prior to shipping your product(s) to us. Products sent to our office without an RMA number will be sent back to the shipper with shipping charges to be collected.
Please read the following shipping instructions carefully. Product that arrives damaged in shipment, without an RMA number or without appropriate warranty information, will be, returned to the sender non-repaired. Products, damaged through neglect due to improper packaging or in shipment, will have the warranty voided and will be processed and returned to you non-repaired. Note: An example of improper packaging would be sending a product back in an envelope.
All products require stable and sufficient packing material, needed to protect the product from ESD (Electro Static Discharge) influences and possible damage during transport. Required Packaging Steps:A. Place item in ESD (Electro Static Discharge) Bag (For electronics only.)B. Wrap with 2 inches of bubble wrap or non-movable foam cushioningC. Place in sturdy cardboard box. Do not use chipboard, as it is not strong enough to withstand the rigors of transit. Please make sure the corrugated carton is free from defects and is structurally sound. Note: Returning an item in an envelope, will void the warranty.D. Please write the Return Material Authorization number on outside packaging, on three sides in bold print.E. When shipping multiple items, each item must be, packed as above, items must not directly touch each other and cannot move inside the packaging. All products must be, packed in individual anti-static bags and in a sturdy cardboard box. Please utilize original packaging when available. DO NOT USE peanuts or packing material that can shift or settle during transit. Warning: Returning an item in an envelope, will void the warranty.
Send your product to the address located on our Contacts page. Retain a record of your RMA number and all tracking/shipping numbers for your records. This will allow BRADATECH to better serve you with possible inquiries.
Your Return Material Authorization number must be visible on 3 sides of the box. Any package sent in without an RMA number will be returned to you non-repaired. If you have multiple RMA numbers, send them in separate boxes (If you are sending multiple Return Material Authorization in a single Over Pack container, each Return Material Authorization number within the over pack carton, must be, individually, boxed with the specific Return Material Authorization number associated with that device, written on three sides of the box in bold print. Failing to follow these specific Over Pack instructions may possibly void the warranty and result in the product being returned to you "as is".)
Use a traceable carrier. Use a traceable carrier for transport or a signed for service (i.e., Airborne, Fed Ex, UPS, XpressPost, etc.) with the post office (Canadian customers only) as they provide you with a tracking number and proof of delivery. The cost of sending an item to our service center for warranty service, is paid by the customer. BRADATECH pays for the return shipment. BRADATECH will refuse any collect payment shipment. If upon arrival your products are out of warranty the shipment will be returned to you at YOUR COST. | 2023-08-28T01:26:18.401715 | https://example.com/article/7887 |
885 S.W.2d 42 (1994)
Melton D. HANCOCK and Hancock II Committee, Respondents,
v.
SECRETARY OF STATE and Committee on Legislative Research, Appellants.
No. WD 50120.
Missouri Court of Appeals, Western District.
October 21, 1994.
Case Retransferred October 27, 1994.
Opinion Readopted October 31, 1994.
*43 Jeremiah W. (Jay) Nixon, Atty. Gen., Robert L. Presson, Asst. Atty. Gen., Jefferson City, for appellants.
Simon B. Buckner, Buckner & Buckner, Jefferson City, for respondents.
Before ULRICH, P.J., and KENNEDY and HANNA, JJ.
Court of Appeals Opinion Readopted October 31, 1994.
PER CURIAM:
The Missouri Secretary of State and the Committee for Legislative Research (the Committee) appeal from the judgment finding the fiscal note summary prepared by the Committee to be insufficient and unfair and substituting the court's draft of the fiscal note summary to appear on the ballots of the general election as Proposition 7, November 8, 1994. The principal issue presented is whether the trial court erred in declaring the fiscal note summary prepared by the Committee as Proposition 7, commonly referred to as "Hancock II," insufficient and unfair. § 116.190, RSMo Supp.1993.[1]
The parties stipulated to the facts presented to the Circuit Court. Pursuant to section 116.332, RSMo 1986, language for a proposed initiative constitutional amendment (Hancock II) was submitted to the Secretary of State for sufficiency as to form. The Secretary of State certified the sufficiency of the petition and a petition title on January 14, 1994. The *44 petition was circulated to collect the requisite number of signatures to place the initiative on the ballot. The signed petition pages were submitted to the Secretary of State for verification. The Secretary of State, pursuant to section 116.130, RSMo Supp.1993, submitted the petition pages to the county clerks for verification. The county clerks certified the valid signatures and referred the numbers to the Secretary of State. Pursuant to section 116.200, RSMo 1986, the Secretary of State certified that enough signatures had been obtained to place the Hancock II initiative on the November 8, 1994, general election ballot.
On September 1, 1994, the proposal was referred to the Oversight Division of the Committee for preparation of the requisite fiscal note and to the Committee to prepare the fiscal note summary. Pursuant to section 116.170, RSMo Supp.1993, on September 7, 1994, the Oversight Division of the Committee provided a fiscal note and the Committee provided a fiscal note summary to the Secretary of State. The fiscal note summary stated: "This proposal would require state and local spending cuts ranging from $1 billion to $5 billion annually. Cuts would affect prisons, schools, colleges, programs for the elderly, job training, highways, public health, and other services." The fiscal note prepared by the Oversight Division acknowledged that the exact amount of revenues that would be added to the calculation of Total State Revenue under the terms of the proposal were uncertain; the estimates ranged from $1,440,000,000 to approximately $5,400,000,000.
The respondents filed their petition in the Circuit Court of Cole County on September 14, 1994, challenging the sufficiency and fairness of the fiscal note and the fiscal note summary pursuant to section 116.190, RSMo Supp.1993. Section 116.190, RSMo 1993, provides in part that
3. The petition shall state the reason or reasons why the ... fiscal note and fiscal note summary are insufficient or unfair and shall request a different official ballot title or fiscal note and fiscal note summary.
4. ... In making the legal notice to election authorities under section 116.240, the Secretary of State shall certify the language which the court certifies to him.
The Circuit Court entered its order on October 11, 1994, holding:
1. Although the fiscal note considers only one of the possible scenarios that could follow from the adoption of the Hancock II proposal, its prefatory language sufficiently and fairly reflects the uncertainties associated with the costs and savings that would accompany passage of the initiative proposal.
2. The fiscal note summary, which would appear on the ballot, is insufficient and unfair in that it (a) fails to reflect the uncertainty of costs or savings that may accrue from passage of Hancock II, (b) makes predictions about program cuts that are unwarranted by the text of the proposal, the text of the fiscal note or the evidence before the court.
The circuit court then drafted and certified a new fiscal note summary to the Secretary of State, reading as follows: "Savings or costs to government cannot be determined. Special taxes approved by voters in the past are likely to trigger refunds to income tax payers [sic] at the expense of other state programs and other taxpayers."
Appellants filed their notice of appeal on October 11, 1994. The parties filed briefs pursuant to the expedited briefing schedule directed by this court, and argument was heard on October 18, 1994.
THE COMMITTEE ON LEGISLATIVE RESEARCH AND THE DIRECTOR OF THE OVERSIGHT DIVISION
A brief review of the statute establishing the Committee on Legislative Research and the Director of the Oversight Division is helpful. The Committee is a permanent joint committee of the General Assembly comprised of the chairman of the Senate Appropriations Committee, nine other senators, the chairman of the House Budget Committee, and nine members of the House of Representatives. § 23.010, RSMo 1986. "No major party shall be represented by more than six members from the house nor more than six from the senate on the Committee." *45 § 23.010, RSMo 1986. Chairmanship of the Committee rotates every two years, and alternates between a member of the house and a senator. § 23.070, RSMo 1986. An Oversight Division is established by the Committee "to prepare fiscal notes and to conduct management audits and program audits of state agencies," and a subcommittee comprised of not less than six members of the Committee, "one-half of the members appointed by the Chairman from the house he represents and one-half of the members appointed by the Vice-Chairman from the house which he represents" supervises the Oversight Division. § 23.150.1, RSMo 1986. The Committee appoints a Director of the Oversight Division and other personnel. § 23.150.2, RSMo 1986. The Director must be "qualified by training and experience" to conduct audits. § 23.150.2, RSMo 1986. Employees of the division "shall be professional persons possessing a wide knowledge and demonstrated expertise in governmental programming and financial planning, in conducting program review evaluations and analytic studies, and of federal, state, and local government budgetary processes, laws and regulations of the State of Missouri." § 23.150.2, RSMo 1986. Finally, to accomplish its significant tasks, the Committee is granted subpoena power and authority to compel testimony under oath. § 23.180, RSMo 1986.
APPELLANTS' MOTION TO DISMISS IN THE TRIAL COURT
The Secretary of State and the Committee alleged that Mr. Hancock's petition failed to name the appropriate defendant and, therefore, pursuant to section 116.190, RSMo Supp.1993, failed to state a claim for which relief can be granted. Appellants' motion to dismiss Respondents' petition was denied by the trial court. Appellants claim the trial court erred.
As originally filed, Respondents' petition named the Secretary of State and Jeanne A. Jarrett, the Director of the Oversight Division of the Committee rather than the Committee itself. Subsequently, Mr. Hancock amended his petition by leave of court.
Section 116.190.2, RSMo 1993, provides, in pertinent part:
When the fiscal note and fiscal note summary are in dispute, the petition shall name the committee on legislative research as a party defendant and service may be had on the director of the oversight division for the committee on legislative research.
Rule 55.33 permits the relation back of amendments to pleadings and is to be liberally applied. Southwestern Bell v. Com'n on Human Rights, 863 S.W.2d 682, 685 (Mo. App.1993). "Leave to amend a petition contemplates an amendment which will cure the defects of the petition without changing the essential basis of the cause of action originally attempted to be plead [sic]." Laux v. Motor Carriers Council of St. Louis, Inc., 499 S.W.2d 805, 807 (Mo.1973), superseded by statute as stated in Koenke v. Eldenburg, 753 S.W.2d 931 (Mo. banc 1988). Rule 55.33(c) states that
[a]n amendment changing the party against whom a claim is asserted relates back if the foregoing provision is satisfied and within the period provided by law for commencing the action against the party and serving notice of the action, the party to be brought in by amendment: (1) has received such notice of the institution of the action as will not prejudice the party in maintaining the party's defense on the merits and (2) knew or should have known that, but for a mistake concerning the identity of the proper party, the action would have been brought against the party.
Pursuant to section 116.190.2, RSMo Supp.1993, serving the Director of the Oversight Division is the appropriate way to give the Committee notice of the suit challenging the sufficiency of the fiscal note summary. Mr. Hancock served the Director of the Oversight Division within the time for instituting the lawsuit. § 116.190.1, RSMo Supp. 1993. Even though the Director was the proper defendant in a challenge to a fiscal note summary prior to the 1993 amendment to the statute, the Director knew or should have known as a public official that after the *46 amendment the Director is the agent for the Committee. Consequently, the Committee's statutory agent had actual notice of the institution of the lawsuit within the time allowed; the Director knew or should have known that the Committee was the proper defendant; and, as a result, the Committee was not prejudiced in its defense when the trial court allowed the amendment changing the party against whom the claim was asserted to relate back to the date of the original pleading.
This point is denied.
SUFFICIENCY AND FAIRNESS OF THE FISCAL NOTE SUMMARY
Appellants claim that the trial court erred in holding that the fiscal note summary prepared by the Committee, the language to appear on the November 8, 1994, ballot as Proposition 7, was insufficient and unfair, § 116.190.3, RSMo Supp.1993.[2] Appellants contend that the fiscal note summary was a sufficient and fair description of the fiscal note and that the fiscal note was a sufficient and fair statement of the financial impact Hancock II could reasonably have upon state government.
The facts in the case were presented by stipulation. The standard of review is the standard the Missouri Supreme Court established for appellate review in suits tried without a jury. Murphy v. Carron, 536 S.W.2d 30, 32 (Mo. banc 1976). In lower court cases tried without a jury, the appellate court must sustain the decree or judgment of the trial court "unless there is no substantial evidence to support it, unless it is against the weight of the evidence, unless it erroneously declares the law, or unless it erroneously applies the law." Id. at 32. The appellate court "may weigh the evidence before the circuit court when the record engenders a firm belief that the judgment is wrong." State ex rel. Rice v. Bishop, 858 S.W.2d 732, 737 (Mo.App.1993).
The stipulated evidence presented to the trial court regarding Hancock II's reasonably anticipated fiscal impact is reviewed to determine whether the trial court's decision that the fiscal note summary was insufficient and unfair was against the weight of the evidence. The original Hancock amendment (Hancock I), Article X, §§ 16-24 of the Missouri Constitution, imposes a limit on the amount of taxes which may be levied by the General Assembly without voter approval. According to Hancock I, the General Assembly can impose a new state tax without voter approval only if the proceeds of the new tax and existing revenue measures combined do not exceed the "revenue limit" defined by the mathematical formula articulated in Article X, § 18(a).
Hancock II, if adopted by referendum, would change the language of a number of key provisions in Hancock I. Section 18(a) of Hancock I provides that, for each fiscal year, "the general assembly shall not impose taxes of any kind which, together with all other revenues of the State, federal funds excluded, exceed the revenue limit established in this section." (emphasis added) Section 18(b) of Hancock I provides that "[f]or any fiscal year in the event that total state revenues[3] exceed the revenue limit established in this section by one percent or more," the excess revenues will be refunded to the taxpayers. (emphasis added)
In Hancock II, the language of 18(a) and 18(b) is modified. Section 18(a) is revised to state:
the general assembly shall not establish or impose a tax, license or fee of any kind which, together with all Total State Revenue and all other revenue (including but not limited to revenue generated by any voter approved state-wide law and any *47 revenue generated by a tax, license or fee levied by the state on any private or quasi-private entity), exceeds the revenue limit established in this section.
(emphasis added) Section 18(b) is revised in Hancock II to provide that "[f]or any fiscal year in the event that the revenue limit established in sub-section (a) of this section is exceeded by one percent or more," (emphasis added) the excess revenues will be refunded to the taxpayers.
The effect of these modifications is to broaden the categories of revenue which, under Hancock II, would be included in calculating the revenue limit imposed upon the state. Additionally, Hancock II includes section 25, an entirely new section, which provides in part that "[i]n the event of a conflict or inconsistency between the provisions of section 16 through 25, of this Article and any other provisions of this constitution, then the provisions of sections 16 through 25, shall control."
Pursuant to section 116.170, RSMo Supp. 1993, the Oversight Division of the Committee prepared a fiscal note to forecast the fiscal impact of Hancock II, and the Committee prepared the fiscal note summary. In evaluating the financial consequences of Hancock II, the Committee considered five categories of revenue which were excluded from the computation of the revenue limit in Hancock I but which are arguably included in the computation of the revenue limit by Hancock II.
The first category of such revenue considered by the Committee consists of two voter-approved taxes which became effective after the adoption of Hancock I. These two taxesProposition A (highway taxes) and Proposition C (sales taxes)were excluded from the "revenue limit" in Hancock I by virtue of being voter approved. See, Goode v. Bond, 652 S.W.2d 98 (Mo. banc 1983). However, as both the Committee and Mr. Hancock have stipulated, the revenues of Proposition A and Proposition C would not be excluded from the revenue limit in Hancock II because of Hancock II's revision of section 18(a), quoted above.
The second category of such revenue considered by the Committee consists of five more voter-approved tax propositions which became law after the adoption of Hancock I. However, unlike tax propositions A and C described in the previous paragraph, these five tax measures became part of the Missouri Constitution. These constitutional tax propositions include: taxes for state parks and soil conservation, Article IV, §§ 47(a)-47(c); lottery revenues, Article III, § 39(b); riverboat gaming revenues, Article III, § 39(d); bingo revenues, Article III, § 39(a); and local motor fuel taxes, Article IV, § 30(a).
These five constitutional taxes are excluded from the revenue limit by Hancock I because in the corresponding sections of the Missouri Constitution (Article IV, §§ 47(a)-47(c); Article III, § 39(b); Article III, § 39(d); Article III, § 39(a); and Article IV, § 30(a)), the language specifically excludes the resulting revenues from "total state revenues." However, in Hancock II, the revenues included in calculating the revenue limit are no longer limited to "total state revenues." Furthermore, section 25(a) of Hancock II provides that, in the event of a conflict between the provisions of Hancock II and any other provisions of the Missouri Constitution, the provisions of Hancock II control. Thus, attempted exclusion of these five taxes within other titles of the constitution may be meaningless if proposed section 25(a) is valid and controlling.
The third category of revenue considered by the Committee consists of federal reimbursement allowances paid by hospitals and nursing homes. The term "revenue" is defined as income that a state "collects and receives into the treasury for public use." Buechner v. Bond, 650 S.W.2d 611, 613 (Mo. banc 1983). The vast majority of the federal reimbursement allowances paid by hospitals and nursing homes are never deposited into the state treasury since such payments are made to qualify for federal matching funds. Consequently, the federal reimbursement allowances do not constitute "revenue." The federal reimbursement allowances have not been included in "total state revenue" by Hancock I. In their Joint Stipulation of Facts filed with the trial court, the parties *48 agree that federal reimbursement allowances would be included as total state revenue by Hancock II.
The fourth category of such revenue considered by the committee consists of local use taxes which, like the federal reimbursement allowances, are never deposited into the state treasury. Like the federal reimbursement allowances, the local use taxes do not constitute "revenue," Buechner v. Bond, 650 S.W.2d at 613, and have not been included in "total state revenue" by Hancock I. In their Joint Stipulation of Facts filed with the trial court, the parties acknowledge that Hancock II would include the local use taxes in determining total state revenue.
The fifth category of revenue considered by the Committee consists of funds received from the federal government. Such funds have not been included in "total state revenue" by Hancock I, since section 17(1) explicitly excludes federal funds from inclusion as part of "total state revenue" and section 18(a) explicitly excludes federal funds from the revenues to be included in calculating the revenue limit imposed upon state government.
Hancock II, like Hancock I, also explicitly excludes federal funds from the definition of "total state revenue" in its section 17(1); however, Hancock II's version of section 18(a) omits the language excluding federal funds from revenues included in computation of the revenue limit. Under Hancock II, "total state revenues," defined in section 17(1), are not the only revenues included in calculating the revenue limit. Therefore, arguably, Hancock II's version of section 18(a) suggests that federal funds would be added to the computation of the revenue limit.
In its fiscal note, the Committee included a chart which outlined two alternative predictions of the fiscal impact of Hancock II in fiscal year 1996. In the first column (Interpretation 1), the Committee assumed that federal funds would not be included in calculating the revenue limit under Hancock II. In the second column (Interpretation 2), the Committee assumed that federal funds would be included in such a calculation. The Committee's chart is reproduced below, and the amounts listed therein (expressed in millions of dollars) are the same as the amounts agreed upon by the parties in their Joint Stipulation of Facts filed with the trial court:
Interpretaion1 Interpretation2
Total State Revenue Limit
Plus One Percent 6,126.7 6,126.7
Projected Total State Revenues 5,945.9 5,945.9
Current Unused Revenue
Limit 180.8 180.8
Revenue Additions
Prop C Sales Tax 553.7 553.7
Prop A Highway Taxes 142.7 142.7
Parks and Soil Sales Taxes 55.6 55.6
Lottery Sales 310.0 310.0
Less Prizes (148.8) 0.0
Riverboat Gaming Total
(Fees and Taxes) 19.5 70.0
Bingo Revenues 9.0 9.0
Local Motor Fuel Tax Distributions 106.3 106.3
Local Use Tax 55.0 55.0
Hospital Reimbursement
Allowance 320.0 320.0
Nursing Home Reimbursement
Allowance 20.0 20.0
Federal Funds 0.0 3,750.0
Total Revenue Additions 1,443.0 5,392.3
Total State Revenue +
Revenue Additions 7,388.9 11,338.2
One Percent Cushion 60.7 60.7
Spending Cut Required 1,322.9 5,272.2
The text of the fiscal note provides the following explanation of the two alternative predictions outlined in the Committee's chart:
In the case of the lower figure, the General Assembly would have to reduce state revenues for FY 1996 by approximately $1,320,000,000 in order to avoid paying $1,320,000,000 worth of refunds in FY 1998 (at the earliest) or reducing sales taxes by a similar amount. In the case of the higher figure, the legislature would have to cut revenues by $5,270,000,000 for FY 1996 or pay that amount in refunds in FY 1998 (at the earliest) or reduce the sales tax by that amount.
*49 The words "insufficient" and "unfair" require definition. Statutory interpretation requires that the common meaning be applied to words. Buechner v. Bond, 650 S.W.2d 611 (Mo. banc 1983). Insufficient means "inadequate; especially lacking adequate power, capacity, or competence." Merriam Webster's Collegiate Dictionary 607 (10th ed. 1993). The word "unfair" means to be "marked by injustice, partiality, or deception." Merriam Webster's Collegiate Dictionary 1290 (10th ed. 1993). Thus, the words insufficient and unfair as used in section 116.190.3, RSMo Supp.1993, and applied to the fiscal note mean to inadequately and with bias, prejudice, deception and/or favoritism state the fiscal consequences of the proposed proposition. As applied to the fiscal note summary, insufficient and unfair means to inadequately and with bias, prejudice, or favoritism synopsize in thirty-five words or less, section 116.170.3, RSMo Supp.1993, the fiscal note.
The trial court found the fiscal note not to be insufficient and unfair. However, the trial court found the fiscal note summary to be insufficient and unfair. Contrary to the trial court's finding, the weight of the evidence established that the Committee's fiscal note summary was not insufficient and unfair. The first sentence of the Committee's summary stated that Hancock II "would require state and local spending cuts ranging from $1 billion to $5 billion annually." The trial court held, in its decision, that this sentence failed "to reflect the uncertainty of costs or savings that may accrue from passage of Hancock II." The Committee is a unique legislative institution possessed of an institutional knowledge and history, experience, and expertise regarding the fiscal impact of proposed law. The evidence before the trial court indicated the virtual certainty of a significant fiscal impact upon state revenues. The only real uncertainty concerned the amount of this impact; and the $1 billion to $5 billion range contained in the fiscal note summary was a sufficient and fair summation of the fiscal note itself, as well as a sufficient and fair forecast of Hancock II's estimated cost to state government.
The second sentence of the Committee's fiscal note summary stated that spending cuts required by Hancock II would affect "prisons, schools, colleges, programs for the elderly, job training, highways, public health and other services." The trial court held that this sentence made "predictions about program cuts that are unwarranted by the text of the proposal, the text of the fiscal note or the evidence before the Court."
However, this conclusion, too, was against the weight of the evidence. The sentence indicates broad areas of services which may reasonably be affected. The Committee listed these areas because these were the areas affected by budget reductions in 1992. Because experience provides guidance in forecasting future budget cuts, this evidence provided ample evidence for finding that the language of the second sentence was not an insufficient and unfair fiscal note summary.
The fiscal note summary is limited to thirty-five words. It cannot detail explanation of the fiscal impact of the proposed referendum, and this summary does not purport to do so. Whether the summary presented is the best language for describing the referendum's effect is not the test. The burden is on the opponents of the language to show that the language was insufficient and unfair, and the burden was not met.
The fiscal note summary prepared by the Committee was not proven insufficient and unfair, and it and the fiscal note are ordered certified to the Secretary of State pursuant to section 116.190, RSMo Supp.1993. The judgment of the trial court is reversed.
NOTES
[1] Whether the Circuit Court of Cole County has authority to substitute its language for that of the Committee where the Committee's fiscal note summary is insufficient and unfair is not addressed in this opinion.
[2] "The petition shall state the reason or reasons why the official ballot title is insufficient or unfair or why the fiscal note and fiscal note summary are insufficient or unfair and shall request a different ballot title or fiscal note and fiscal note summary." § 116.190.3, RSMo Supp.1993.
[3] Section 17(1) defines "total state revenues" as "all general and special revenues, license and fees, excluding federal funds, as defined in the budget message of the governor for fiscal year 1980-81. Total state revenues shall exclude the amount of any credits based on actual tax liabilities or the imputed tax components of rental payments, but shall include the amount of any credits not related to actual tax liabilities."
| 2023-11-26T01:26:18.401715 | https://example.com/article/6535 |
GCC fertilizer capacity to rise by close to 50% in next five years
11:02 AM MDT | October 8, 2013 | Natasha Alperowicz
Fertilizer capacity in the Gulf Cooperation Council (GCC) states, which include Bahrain, Kuwait, Oman, Qatar, Saudi Arabia and the United Arab Emirates, will rise by 47% in the next five years, to reach 46.4 million m.t./year by 2018. GCC countries are currently investing $10 billion to raise fertilizer capacity, according to the Gulf Petrochemicals and Chemicals Association (GPCA). The association estimates fertilizer capacity in the GCC states last year at 31.4 million m.t. Demand for gas is soaring across the GCC, where gas is widely used to generate... | 2024-03-26T01:26:18.401715 | https://example.com/article/9665 |
Q:
when to use a Meteor Method vs normal function?
I've got, I think, a relatively simple question. I'm wondering in Meteor, especially when I'm defining server-side functions that I want the client to be able to call, when do I use a method vs a normal function? Why can't I just use a global function in my Meteor server code instead of defining a Meteor Method?
thanks!
A:
Functions defined only the server are only accessible to server code (even if defined globally). So for example, if you had a function defined in server/util.js it would not be available to the client.
You could, however, define a function that was global to both the server and the client by placing it outside of the server and client directories, e.g. in lib.
Generally, you would choose to create a method over a function when you want a side effect which should only be produced on the server. Examples:
you need to sign a URL and keep the key only on the server
you need to perform a database operation that can only be done on the server (due to limitations of minimongo)
Important note - method calls from the client are asynchronous (you need to provide a callback function to know the result of the method), so that may also factor into your decision.
| 2024-01-28T01:26:18.401715 | https://example.com/article/1803 |
The golf course arborist is non- existent in today's course personnel. There are very few courses which can afford such a specialist. We had a person who started a great program of course plantings. When she requested a raise beyond what we could afford, the duties were taken over by the course greens superintendent and one of the staff was assigned to course beautification. Our plantings are second to none within our state.______________________________golf courses sydney | 2024-04-01T01:26:18.401715 | https://example.com/article/6110 |
This archived news story is available only for your personal, non-commercial use. Information in the story may be outdated or superseded by additional information. Reading or replaying the story in its archived form does not constitute a republication of the story.
SALT LAKE CITY -- A man who called police and then barricaded himself in his home had to be subdued with a Taser before he was taken into custody Monday.
About 10:30 a.m., a 41-year-old man called 911 and then immediately hung up. When emergency dispatchers called back, the man sounded out of breath, according to police, Dispatchers sent officers to the scene to find out what was happening.
When police arrived in the area of 800 South and West Temple, they found the man had a skewer and was inside a residence. Detectives said he was not cooperating with the officers.
"He was acting so bizarre, we were concerned for his safety," said Salt Lake Police Sgt. Shawn Josephson.
The man ended up barricading himself inside the house with a table, chairs and other furniture, which officers were able to easily push out of the way. There were indications that the man wanted police to shoot him, according to officers.
Instead, officers used a Taser to subdue the man and take him into custody, Josephson said.
The man was taken to the Salt Lake County Jail and booked for investigation of aggravated assault.
An officer was taken to a local hospital to be checked out after injuring an ankle while trying to arrest the man.
E-mail: preavy@desnews.com
---
×
Photos | 2023-11-21T01:26:18.401715 | https://example.com/article/7067 |
Minecraft: Pi Edition now available, gives you something to play on your Raspberry Pi
This site may earn affiliate commissions from the links on this page. Terms of use.
You may already have Minecraft on your computer, your Xbox 360, and your smartphone, but now you can get a version that was specifically ported to run well on the Raspberry Pi. If you’re one of those people that really want a Raspberry Pi but have no idea what to do with one once you get it, making it a dedicated $35 Minecraft machine is now a viable option.
The biggest benefit of having the secretly resource-intensive Minecraft run on the relatively resource-light Raspberry Pi is that in the port, Mojang added support for a handful of programming languages. So, rather than simply building impressive creations in the blocky world, people can use the combination of a very cheap computer and a game they enjoy to teach themselves how to program.
How to setup Minecraft on your Raspberry Pi
It takes a slight bit of preparation to run Minecraft on the Pi, which starts out with using the “wheezy” version of Raspbian (download here).
The game requires XWindows running, so Mojang suggests that you have XWindows set to start automatically upon boot by typing in “startx” without the quotation marks.
Download the compressed file over here, then launch the terminal by clicking on the LXTerminal window, then enter the following commands into the terminal: | 2023-12-12T01:26:18.401715 | https://example.com/article/2635 |
Every morning I tell myself, Today has to be productive — and then something happens that prevents me from writing… Something always happens. Each morning I already know I will be able to waste the whole day. There is always something to do: go to the bank, the post office, pay some bills … always some bureaucratic tangle I have to deal with.
But what’s most interesting is how much the role of the newspaper in Calvino’s life — a medium intended to inform but in this case used to distract — resembles how we tend to use the internet today, down to its addictive nature and our many failed resolutions to wean ourselves off of it:
While I am out I also do errands such as the daily shopping: buying bread, meat, or fruit. First thing, I buy newspapers. Once one has bought them, one starts reading as soon as one is back home — or at least looking at the headlines to persuade oneself that there is nothing worth reading. Every day I tell myself that reading newspapers is a waste of time, but then … I cannot do without them. They are like a drug. In short, only in the afternoon do I sit at my desk, which is always submerged in letters that have been awaiting answers for I do not even know how long, and that is another obstacle to be overcome.
What’s most poignant, of course, isn’t the mere parallel but also the fact that, today, newspapers struggle for their survival precisely because of the internet, which has proven to be an even more unforgiving “drug” for our collective attention. Calvino considers how this has impacted his daily routine:
In theory I would like to work every day. But in the morning I invent every possible excuse not to work: I have to go out, make some purchases, buy the newspaper. As a rule, I manage to waste the morning, so I end up sitting down to write in the afternoon. I’m a daytime writer, but since I waste the morning I’ve become an afternoon writer. I could write at night, but when I do, I don’t sleep. So I try to avoid that.
donating = loving
Bringing you (ad-free) Brain Pickings takes hundreds of hours each month. If you find any joy and stimulation here, please consider becoming a Supporting Member with a recurring monthly donation of your choosing, between a cup of tea and a good dinner.
www.brainpickings.org
Share Article
Filed Under
View Full Site
Brain Pickings participates in the Amazon Services LLC Associates Program, an affiliate advertising program designed to provide a means for sites to earn commissions by linking to Amazon. In more human terms, this means that whenever you buy a book on Amazon from a link on here, I get a small percentage of its price. That helps supportBrain Pickings by offsetting a fraction of what it takes to maintain the site, and is very much appreciated | 2024-04-19T01:26:18.401715 | https://example.com/article/9401 |
Saturday night feast of big, big beasts
A few words I didn't expect to be typing this decade: Saturday night on ITV1 is great! Obviously if your tastes err towards a quick Ring Cycle before lights out, or a searingly miserablist documentary about the fact that they no longer make searingly miserablist documentaries quite like they used to, then Saturday-night terrestrial telly is unlikely to float your Viking longship, but last night on BBC4 there was three hours of Tchaikovsky from Moscow, to which you were very welcome.
The linchpin of ITV's Saturday is Primeval, which aims to get the whole family round the box (in fact this only ever happens on The Royle Family). In true British-TV, budget-stretching style, this first series is only a six-parter, but in an ideal world it will run for 16 weeks with a 20-minute break before returning for another four months, and then just go on for ever, like Casualty
Unlike Casualty, however, Primeval made me smile all the way through, though admittedly for a woman who is slightly outside of the dinosaur-loving demographic a lot of that smiling came as a result of the presence of delicious Douglas Henshall.
Space-time continuum slippage is all the televisual rage, but Primeval takes us further back than 1973, and farther away than New Zealand, thanks to a shimmering portal in the Forest of Dean which provides an escape route for the 'saurs, back home to the past and what looks like Lanzarote, via Lostville.
There are big, bitey, roary Scarysaurii and ickle, squeaky, flying Cutosaurii, and a lovely shiny cast of attractive young scientist-types ready to try and track them down, including Hannah Spearritt - one of the female former members of S Club 7 who isn't Jo O'Meara ('I'm a lizard girl!') - and Professor Cutter (Henshall), an evolutionary scientist busy looking for Helen, his wife, who disappeared eight years previously thanks to an Eeeekosourus lurking in Asda's car park.
If I were the Prof and I finally caught up with the missus in Lanzarote, I'd want to ask her what she thought she was doing sneaking around furtively near Asda, in the dark, on her own, when it's not even open ... but perhaps he's not journalistically inclined.
Anyway, Primeval is terrifically good fun, nostalgic and modern at the same time, and exactly what ITV needs to give itself a confidence boost. I love it to pieces. Look out, Dr Who
But with a fluffy, cosy, whiskers-on-kittens review there's obviously a hidden agenda, and in this case I'm just softening you up for the tough stuff - for a searingly miserablist documentary they don't make them like any more. Except they do, obviously, because there it was, last Monday night on Channel 4 (there's a bit of a documentary renaissance under way at C4 of late. And about time).
Jane Treays' Aged 12, And Looking After The Family was one of those almost unbearable films that you none the less know you must watch, and then afterwards you can't quite work out whether you're glad you did, or whether the sheer misery, selfishness, stupidity, hubris and grimy reality it portrayed was actually a bit more than you wanted to take on board, thanks very much.
Depending on how emotionally robust I'm feeling, I seem to write this same review in a slightly different context every few months. It's always a film about children, always made by documentary-makers at the top of their game, and it always makes me feel sad and helpless in the face of so much chaos. Like most people I don't have the Geldof gene, aka the one which means you feel sad and helpless ... and then you get up and do something to change it.
Paul and Amanda are blind and disabled, live on benefits and have six kids. Why have so many kids? wondered Treays of Amanda, pregnant with number seven: 'I enjoy having a big family so much. The reason I like having them is so that they can help us when we get older.'
Selfish cow! I also took issue with Treays's voiceover observation that 'there's no doubt Paul and Amanda love their kids'. Well yes there is a wee bit of a doubt, actually.
The second-oldest girl, Jenny, nine, had already attempted to suffocate herself with a plastic bag, while the eldest, Louise, 12, had the blankest eyes I have seen belonging to someone who isn't actually living in a doorway and whose best friend is a can of Tennant's.
Or maybe the blankness was just tiredness - entirely understandable given that she has to feed, change nappies and dress four younger kids before school, every day. And then again in the afternoon.
The three youngest boys, Matthew, three, Richard, two, and Nigel, eight months, apparently live semi-feral lives while Paul and Amanda sit around, smoking, waiting for the girls to get back from school. No nappies are changed during the day. All offers of outside assistance from social services are rebuffed, bar a couple of hours cleaning a week, which wouldn't be long enough to tackle the washing up, if there were any, but there isn't: the family live on takeaways to save the bother.
'How do you feel when the alarm goes off?' Treays asked Jenny. 'Tired,' she replied without missing a beat. Everybody seemed tired. The baby was filmed asleep face-down on the floor, sprawled like a puppy (thank god there wasn't a puppy) on the poo-coloured carpet in his filthy Babygro, stepped over by the rest of the family. Afterwards I felt tired too, and barely heartened by the news that the family have been moved to a bigger house, social services are keeping an eye on them and Paul and Amanda have been told to smoke outside. I was, I confess, relieved that Amanda lost baby number seven, but the hospital suggested they 'keep trying', so they were.
'They're great parents,' said Jenny in their defence, 'the best I've ever had.'
Channel 4's A Child's Life strand is, in fact, telling us more about parents than it is about kids. The child dancers in Strictly Baby Ballroom (a slightly less spooky Little Miss Sunshine) were sweet-ish and normal-ish, but the parents were predictably super-pushy.
And just as the various subjects of Child Genius were interesting, in a freak-show sort of way, there's really only so much time you want to spend watching a kid solving quadratic equations, talking 'philosophy', playing chess, or just being rather nauseatingly precocious. Eleven-year-old novelist Michael (two of whose seven languages are Mandarin and Old Norse) was filmed cooking his family 'pigeon marinaded in medieval spices and Madeira'. A concoction which, judging by the expression on his sister's face, clearly tasted about as good as it sounded: 'Gorgeously rare!' exclaimed Mum - an Oxford don, but perhaps not much of a cook.
Most of the parents were simply struggling, and occasionally failing, to do the best by their extraordinary kids, whose needs are every bit as special as the more traditional variety. It's what any of us (who are not Paul and Amanda) would want to try to do, but by god it looks tough.
You felt especially for the Minghella family, whose son, Dante, was the most obviously difficult to live with. They weren't particularly delighted on learning he had an IQ of 170, 'What we're interested in is how we can have a happy life with Dante', his mother admitted, with enviable candour.
In stark contrast were the very odd Mr and Mrs Grafton-Clarke, who have taken a sort of Big Brother approach to the raising of their four gifted children, living in a remote house somewhere in East Angular (it's a Big Brother joke) with CCTV, and big signs in the window to that effect, not to mention an insular attitude straight out of Jane Austen, or the Appalachians.
'We feel a huge obligation to mankind,' said Mum, eyes lit with a cultish gleam. 'Desiree for many years has been a very spiritual person.' Uncharitably I thought that assuming the outlook of a 'very spiritual person' is probably a good idea if you're bullied not only for the cardinal sin of cleverness, but also for having unusual (OK, bonkers) parents. No Primeval on a Saturday night for the Grafton-Clarkes, I'd hazard - it's probably plainsong round an open fire, followed by a little light cartography.
The child geniuses are a 10-year project for Channel 4, and it should be revealing. I just hope that at some point they are given a camcorder and encouraged to ask Mum and Dad a few searching questions, too. Whatever the outcome, I blame the parents.
In praise of Patsy
I'm loving the fact that Patsy Kensit, late of Emmerdale and recently installed as the peachiest nurse at Holby City hospital (she looks so great in the uniform that her character, Faye, must spend evenings in front of a Singer, taking them in), is shaping up to become a soap queen.
Technically, and pedantically, Holby isn't a soap but a 'continuing drama series', which is a pretty apt description of Patsy, and probably the reason they've given her character three ex-husbands too, though none are known to be rock gods.
During a career overshadowed by a not-very-private life, it's easy to forget she's done Hollywood (Lethal Weapon 2), pukka costume dramas (Great Expectations, Silas Marner) and had four top 10 hits. But primetime on the Beeb really suits her, and I'd love to see her behind the bar at the Queen Vic, masterminding its revamp as a suitably stylish gastropub. She's still, absurdly, only 38. | 2023-11-04T01:26:18.401715 | https://example.com/article/9833 |
Bionanocomposite systems based on montmorillonite and biopolymers for the controlled release of olanzapine.
Olanzapine (OLZ) is a drug that is used in the treatment of schizophrenia and other psychoses, and it belongs to the thienobenzodiazepine class. The OLZ molecule has low solubility decreasing bioavailability, but has high permeability in membrane biological being classified as a Class II drug substance according to the Biopharmaceutics Classification System. It was reported many side effects of administering OLZ orally. So, in order to increase the bioavailability of drug and possibly reducing some of side effects, this paper proposes a new material able to controllably release the drug in the body. To control the dissolution rate, this work proposes a system that incorporates the drug into montmorillonite (MMT) dispersed in a mixture of alginate (ALG) and xanthan gum (XG) biopolymers. The proposed hybrids and bionanocomposites were characterized by several physicochemical techniques, including XRD, IR-ATR, TG DTA, SEM-EDS and HPLC. The characterization data confirmed the intercalation of the OLZ into the MMT by the ion exchange process, as well as the interaction of the MMT-OLZ with the biopolymers. The release test, conducted under various pH conditions, showed that the proposed system exhibited a more controlled drug release than commercial tablets, indicating that the ALG-XG/MMT-OLZ bionanocomposite can act as a controlled release system for OLZ. | 2023-12-13T01:26:18.401715 | https://example.com/article/1036 |
Graphene spintronics: the role of ferromagnetic electrodes.
We report a first principles study of spin transport under finite bias through a graphene-ferromagnet (FM) interface, where FM = Co(111), Ni(111). The use of Co and Ni electrodes achieves spin efficiencies reaching 80% and 60%, respectively. This large spin filtering results from the materials specific interaction between graphene and the FM which destroys the linear dispersion relation of the graphene bands and leads to an opening of spin-dependent energy gaps of ≈0.4-0.5 eV at the K points. The minority spin band gap resides higher in energy than the majority spin band gap located near E(F), a feature that results in large minority spin dominated currents. | 2024-07-07T01:26:18.401715 | https://example.com/article/6092 |
A ready-to-use, versatile, multiplex-able three-dimensional scaffold-based immunoassay chip for high throughput hepatotoxicity evaluation.
Hydrogel as three-dimensional (3D) substrate has been employed in miniaturized high throughput protein detection platforms to increase the number of effective antibodies and signal augmentation. However, the high water content of the hydrogel can dilute samples and create barrier to mass transfer, limiting hydrogel height to several microns in most platforms. Moreover, these platforms cannot achieve widespread use in common laboratories as they usually rely heavily on expensive robotic liquid handlers and custom-built components. Here we developed a ready-to-use, easy to store and handle, versatile and multiplex-able 3D scaffold-based immunoassay chip (3D immunoChip) possible for high throughput protein quantification using bench-top equipment in common laboratories. Sample dilution, mass transfer, signal scattering and storage problems can be avoided by using dry scaffolds that regain transparency upon rehydration. When combined with hydrophilic-hydrophobic patterned reagent loading slides, manual high throughput handling of samples can be achieved. As these micro-scaffolds are patterned without barriers in between, simultaneous and effortless washing of all the reaction zones is possible in a Petri dish. Such features aid the 3D immunoChip in saving up to 100 times reagent and about 6 times labour. The 3D immunoChip is able to detect albumin (ALB), as a model analyte, from 5 ng mL(-1) to 1000 ng mL(-1), making it comparable to the commercialized ELISA kit based on a 96-well plate (0.22-400 ng mL(-1)). This thus enables the 3D immunoChip to directly detect ALB secreted by HepaRG cells cultured in a 3D cell culture array chip for high throughput drug hepatotoxicity evaluation, which could potentially accelerate drug screening. | 2024-04-06T01:26:18.401715 | https://example.com/article/4587 |
So it’s now less than 30 days until my wedding. And we’re probably not going to meet the minimum required person count. Granted, this doesn’t mean that it won’t be happening. It just means that 1) I have to pay for the meals anyway. 2) Quite a few people backed out. 3) This is going to be smaller than I wanted.
I try to keep telling myself to not take it personally... but you know how that goes. I guess this is what I get for losing touch with some people and keeping a small friend group. And marrying someone who was only in the area for a year and doesn’t have any long-term friends here. And doing it across the country from where his family is because I couldn’t figure out how to get to my own wedding on-time if I held it in another state.
I’m just frustrated and .... sad? It’s also amusing that some of the people most excited about going to the wedding are the guys I have known for 2 months and spent every day in class with. You know how you feel like you’re going to throw a party, get really excited about it and no one will show up? That’s a fear that most people have, I’d assume. But this has literally happened to me before, when I was somewhere around 11-13. Threw a birthday party at a skating rink, only 1 person showed up. I feel like this is turning out to be the same thing. I know that I will love all the people there, but I also know the room is going to feel empty with just like 35-40 people in it. I expected 50-60. | 2024-02-05T01:26:18.401715 | https://example.com/article/1513 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.