added
stringdate 2024-06-03 18:26:11
2024-06-04 03:14:13
| created
stringdate 2013-04-29 18:49:42
2014-01-03 01:38:26
| id
stringlengths 32
32
| metadata
dict | source
stringclasses 2
values | text
stringlengths 237
356k
| version
stringclasses 1
value |
|---|---|---|---|---|---|---|
2024-06-03T21:29:49.458Z
|
2013-05-18T08:37:41.000Z
|
265vnbz6wp4g7tibet77vpgkjhdcqmvu
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40095",
"uncompressed_offset": 72299887,
"url": "elinux.org/index.php?action=info&title=Category%3AStandardized_APIs",
"warc_date": "2013-11-22T19:24:16.000Z",
"warc_filename": "<urn:uuid:a5f9d007-fadd-4fa1-b0bb-dd2811a4fe26>",
"warc_url": "http://elinux.org/index.php?title=Category:Standardized_APIs&action=info"
}
|
cccc_CC-MAIN-2013-20
|
Information for "Category:Standardized APIs"
Jump to: navigation, search
Basic information
Display titleCategory:Standardized APIs
Default sort keyStandardized APIs
Page length (in bytes)23
Page ID13057
Page content languageEnglish (en)
Search engine statusIndexable
Number of views668
Redirects to this page0
Category information
Number of pages3
Number of subcategories0
Number of files0
Page protection
EditAllow all users
MoveAllow all users
Edit history
Page creatorCschalle (Talk | contribs)
Date of page creation21:55, 27 October 2011
Latest editorCschalle (Talk | contribs)
Date of latest edit21:55, 27 October 2011
Total number of edits1
Total number of distinct authors1
Recent number of edits (within past 91 days)0
Recent number of distinct authors0
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T08:20:02.000Z
|
df24ppeep6ru2zlietvpvpwycbgt6dgu
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40115",
"uncompressed_offset": 98316218,
"url": "genomebiology.com/2002/3/12/research/0088/abstract",
"warc_date": "2013-11-22T19:24:16.000Z",
"warc_filename": "<urn:uuid:a5f9d007-fadd-4fa1-b0bb-dd2811a4fe26>",
"warc_url": "http://genomebiology.com/2002/3/12/research/0088/abstract"
}
|
cccc_CC-MAIN-2013-20
|
Research
Systematic determination of patterns of gene expression during Drosophila embryogenesis
Pavel Tomancak1, Amy Beaton1, Richard Weiszmann2, Elaine Kwan1, ShengQiang Shu2, Suzanna E Lewis2, Stephen Richards2,3, Michael Ashburner4, Volker Hartenstein5, Susan E Celniker2,3 and Gerald M Rubin1,2*
Author Affiliations
1 Howard Hughes Medical Institute, Department of Molecular and Cell Biology, University of California at Berkeley, 539 Life Sciences Addition, Berkeley, CA 94720-3200, USA
2 Berkeley Drosophila Genome Project, Lawrence Berkeley National Laboratory, Berkeley, CA 94720, USA
3 Genome Sciences Department, Lawrence Berkeley National Laboratory, Berkeley, CA 94720, USA
4 Department of Genetics, University of Cambridge, Cambridge CB2 3EH, UK
5 Department of Molecular Cell and Developmental Biology, University of California Los Angeles, Los Angeles, CA 90095, USA
For all author emails, please log on.
Genome Biology 2002, 3:research0088-0088.14 doi:10.1186/gb-2002-3-12-research0088
This article is part of a series of refereed research articles from Berkeley Drosophila Genome Project, FlyBase and colleagues, describing Release 3 of the Drosophila genome, which are freely available at http://genomebiology.com/drosophila/.
Published: 23 December 2002
Abstract
Background
Cell-fate specification and tissue differentiation during development are largely achieved by the regulation of gene transcription.
Results
As a first step to creating a comprehensive atlas of gene-expression patterns during Drosophila embryogenesis, we examined 2,179 genes by in situ hybridization to fixed Drosophila embryos. Of the genes assayed, 63.7% displayed dynamic expression patterns that were documented with 25,690 digital photomicrographs of individual embryos. The photomicrographs were annotated using controlled vocabularies for anatomical structures that are organized into a developmental hierarchy. We also generated a detailed time course of gene expression during embryogenesis using microarrays to provide an independent corroboration of the in situ hybridization results. All image, annotation and microarray data are stored in publicly available database. We found that the RNA transcripts of about 1% of genes show clear subcellular localization. Nearly all the annotated expression patterns are distinct. We present an approach for organizing the data by hierarchical clustering of annotation terms that allows us to group tissues that express similar sets of genes as well as genes displaying similar expression patterns.
Conclusions
Analyzing gene-expression patterns by in situ hybridization to whole-mount embryos provides an extremely rich dataset that can be used to identify genes involved in developmental processes that have been missed by traditional genetic analysis. Systematic analysis of rigorously annotated patterns of gene expression will complement and extend the types of analyses carried out using expression microarrays.
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T08:33:38.000Z
|
iclvqj6qmeec2uq5yec37zk6v2axkrzt
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40129",
"uncompressed_offset": 117181395,
"url": "ipkitten.blogspot.co.uk/2004/09/cfi-allows-substitution.html",
"warc_date": "2013-11-22T19:24:16.000Z",
"warc_filename": "<urn:uuid:a5f9d007-fadd-4fa1-b0bb-dd2811a4fe26>",
"warc_url": "http://ipkitten.blogspot.co.uk/2004/09/cfi-allows-substitution.html"
}
|
cccc_CC-MAIN-2013-20
|
For the half-year to 30 June 2013, the IPKat's regular team is supplemented by contributions from guest bloggers Stefano Barazza, Matthias Lamping and Jeff John Roberts.
Two of our regular Kats are currently on blogging sabbaticals. They are Birgit Clark and Catherine Lee.
Tuesday, 7 September 2004
CFI ALLOWS SUBSTITUTION
Here’s a summer Court of First Instance (CFI) order for all you procedure-junkies out there. Kerry applied to register a CTM in 1997. Gerolsteiner opposed the application in 1998 but its opposition was rejected by the OHIM Opoosition Division in 2002 and subsequently by the Board of Appeal in January 2003. In February 2003 Gerolsteiner appealed to the CFI. However, in December 2003, Gerolsteiner informed the CFI that it had transferred the trade mark on which the opposition was based to Sinziger Mineralbrunnen and that Sinziger Mineralbrunnen wished to be substituted for Gerolsteiner in the dispute before the CFI. OHIM, Kerry and Gerolsteiner were consulted. None of them had objections to the substitution taking place.
The CFI authorised the substitution of Sinziger for Gerolsteiner:
*Where an intellectual property right which is the subject of a dispute is transferred, the new owner, claiming through the original owner which is party to the dispute, may be authorised by the CFI to have itself substituted for the original owner. However, this substitution can only take place where the original owner of the IP right has no objection and the CFI, after hearing the other parties to the dispute, considers that the substitution is appropriate.
*Since there is no provision in the Statute of the Court of Justice or the Rules of Procedure of the Court of First Instance expressly governing the substitution of one party for another, the provisions of Arts.115 and 116 of the CTM Regulation apply by analogy. This means in particular that the party new owner of the IP right must accept the dispute in the state that it is in at the time of the substitution.
*Here the original owner of the IP right, Gerolsteiner Brunnen, declared its agreement with the substitution and neither OHIM nor the intervener (Kerry, the applicant for the CTM that Gerolsteiner was opposing) had raised any objections. Therefore the substitution was authorised.
The IPKat says that this way of doing things makes sense. If all the parties to the dispute agree, then it seems that no one loses out by the CFI allowing the substation.
More half-time substitutions here, here and here
Subscribe to the IPKat's posts by email here
Just pop your email address into the box and click 'Subscribe':
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T08:24:05.000Z
|
isj7llgl6jquuywzq2i324ial5xzedg2
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40130",
"uncompressed_offset": 118465396,
"url": "issuepedia.org/Poe",
"warc_date": "2013-11-22T19:24:16.000Z",
"warc_filename": "<urn:uuid:a5f9d007-fadd-4fa1-b0bb-dd2811a4fe26>",
"warc_url": "http://issuepedia.org/Poe's_Law"
}
|
cccc_CC-MAIN-2013-20
|
Poe's Law
From Issuepedia
Jump to: navigation, search
[edit] Overview
Poe's Law is an adage which states, in its original form:
Without a winking smiley or other blatant display of humor, it is impossible to create a parody of Fundamentalism that SOMEONE won't mistake for the real thing.
More generally, it refers to any speech which is sufficiently dogmatic -- or sufficiently extreme in its extrapolation of an ideology -- as to be indistinguishable from parody. (Such parody would then be a form of reductio ad absurdum.)
This is a growing seedling article. You can help Issuepedia by watering it.
[edit] Links
[edit] Reference
• Wikipedia
• as of 2009-06-29, article had been deleted multiple times
• as of 2009-10-10, redirects to a page which lists Edgar Allen Poe's law "That there is a maximum desirable length for poems".
• as of 2011-01-15, an article on this topic was in place
• RationalWiki
Personal tools
bookmarking
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T08:24:20.000Z
|
hgk6ykg6lk2djugk3lhg2z4jfg2ygm65
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40134",
"uncompressed_offset": 122005255,
"url": "joi.ito.com/weblog/2003/02/20/oped-in-south-c.html",
"warc_date": "2013-11-22T19:24:16.000Z",
"warc_filename": "<urn:uuid:a5f9d007-fadd-4fa1-b0bb-dd2811a4fe26>",
"warc_url": "http://joi.ito.com/weblog/2003/02/20/oped-in-south-c.html"
}
|
cccc_CC-MAIN-2013-20
|
An op-ed that I drafted with the help of everyone here and here (with a final re-draft by Pamela from WEF) just ran. They cut my "special thanks" section...
in SCMP
The Internet, and the "blogs" (Web log services) in particular, provide opportunities for the passive Japanese public to wake up before the catastrophe. The Internet is also a way to enable the youth of Japan, currently silenced by the older generation and destined to get stuck with supporting them, to speak up and organise themselves before it is too late. This is critical both for themselves and for Japan as a whole.
You need to register to read the article online... Thank for all of your help with this everyone!
1 TrackBacks
Listed below are links to blogs that reference this entry: Op-ed in South China Morning Post just ran.
TrackBack URL for this entry: http://joi.ito.com/MT-4.35-en/mt-tb.cgi/524
About this Archive
This page is an archive of recent entries in the Blogging about Blogging category.
BitTorrent is the previous category.
Books is the next category.
Find recent content on the main index.
Monthly Archives
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T09:02:29.000Z
|
xuxk244vmlvrjoqe6x7gwg73rsbbig2r
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40164",
"uncompressed_offset": 168223895,
"url": "openwetware.org/index.php?diff=prev&oldid=657856&title=Lidstrom%3AMeasuring_13C_Incorporation_Into_Protein_-_CO2_Project",
"warc_date": "2013-11-22T19:24:16.000Z",
"warc_filename": "<urn:uuid:a5f9d007-fadd-4fa1-b0bb-dd2811a4fe26>",
"warc_url": "http://openwetware.org/index.php?title=Lidstrom:Measuring_13C_Incorporation_Into_Protein_-_CO2_Project&diff=prev&oldid=657856"
}
|
cccc_CC-MAIN-2013-20
|
Lidstrom:Measuring 13C Incorporation Into Protein - CO2 Project
From OpenWetWare
(Difference between revisions)
Jump to: navigation, search
(Mass Spec)
m (Cell Prep)
Line 5: Line 5:
== Cell Prep ==
== Cell Prep ==
-
* Grow 1.5 mL of OD<sub>550</sub> 0.8 - 1.5 (approximately 0.3 - 0.8 mg) of cell culture
+
# Grow 1.5 mL of OD<sub>550</sub> 0.8 - 1.5 (approximately 0.3 - 0.8 mg) of cell culture
-
* Swirl 30-40 seconds in ethanol dry ice bath or liquid N<sub>2</sub> (don't freeze sample with liquid N<sub>2</sub>)
+
# Swirl 30-40 seconds in ethanol dry ice bath or liquid N<sub>2</sub> (don't freeze sample with liquid N<sub>2</sub>)
-
* Centrifuge 5 min at 13,500 g, 4<sup>o</sup>C
+
# Centrifuge 5 min at 13,500 g, 4<sup>o</sup>C
-
* Discard supernatant
+
# Discard supernatant
-
* Wash pellet with 0.9% 1 mL of sodium chloride at 4<sup>o</sup>C, pellet for 5 min at 13,500 g, 4<sup>o</sup>C
+
# Wash pellet with 0.9% 1 mL of sodium chloride at 4<sup>o</sup>C, pellet for 5 min at 13,500 g, 4<sup>o</sup>C
-
* Repeat last step
+
# Repeat last step
-
''Optional:''
+
# ''Optional:'' store pellet at -40 to -80<sup>o</sup>C
-
*store pellet at -40 to -80<sup>o</sup>C
+
== Hydrolysis of Amino Acids ==
== Hydrolysis of Amino Acids ==
Revision as of 15:52, 20 November 2012
Back to Protocols
Contents
Mass Spec Reservation
Cell Prep
1. Grow 1.5 mL of OD550 0.8 - 1.5 (approximately 0.3 - 0.8 mg) of cell culture
2. Swirl 30-40 seconds in ethanol dry ice bath or liquid N2 (don't freeze sample with liquid N2)
3. Centrifuge 5 min at 13,500 g, 4oC
4. Discard supernatant
5. Wash pellet with 0.9% 1 mL of sodium chloride at 4oC, pellet for 5 min at 13,500 g, 4oC
6. Repeat last step
7. Optional: store pellet at -40 to -80oC
Hydrolysis of Amino Acids
• Turn on the heating block and equilibrate it to 105 - 110oC
• Note: equilibrate the temperature with the hood at the level you intend to leave it at overnight. If you equilibrate it with the hood open, then close it, the temperature will rise due to reduced convection. Since we don't want to exceed 110oC, this can be bad.
All steps in this section should be done in the fume hood across from the GC:
• Suspend cell pellets in 1 mL of 6N HCl
• Transfer resuspended cells into 2 mL GC-MS autosampler vials
• Seal tubes with screw caps to prevent evaporation of HCl
• Bake the well-sealed 2 mL tubes for 12-24 hours in a heating block set to 105 - 110 (not hotter)oC
• Hotter temps will may destroy some amino acids
• ?? what criteria should we apply when deciding how long?
• Yanfen says that when she uses 1 mL of culture and 1 mL of HCl, she does 24 hours.
• Note: you can pause at this point by storing the samples at -20oC. Yanfen says there should be no problem storing them this way for 1-2 days. Janet wonders if longer is fine, too.
• Dry the hydrolysate at 95oC with constant air flow (or N2) gas flow in the fume hood until the sample is completely dry.
• Use the "nitrogen tree": Turn heat on high. Set pressure regulator on tank to 2-4 psi. Flow gauge should read 8 L/min for two samples. Clean capillary tips with ethanol, unscrew white plastic, move metal shaft down (may need to wipe with ethanol to allow this), insert capillary tip into glass sample vial (close to liquid but not touching), screw plastic threading back to lock the metal shaft in place. Leave heating block on. Move sample vial up hourly as liquid evaporates.
• Bake the dried samples at 105oC for another 10 minutes to ensure no moisture is left.
• Note: you can pause at this point by storing the samples at -20oC. Use new septum for cap if you do.
Derivitization of Amino Acids w/ TBDMS
• Add 100 uL nanopure water to reconstitute the dried sample (if using 1 mL of OD600 = 0.6 culture)
• Add the volume of water to the vial with the dried sample, pipet to mix, transfer entire volume to a eppendorf tube and vortex.
• This is enough for technical replicates.
• Centrifuge at 13,500 g for another 1 - 2 minutes to remove ash
• Use a filter centrifuge tube if sampling a large fraction of this volume
• If using a very small volume (~ 10 uL) you can pellet without a filter and sample from the top of the supernatant. Centrifuge longer (10 min) if using this approach.
• Transfer aliquot into clean GC-MS vial with insert
• Yanfen uses 10 uL; we should use 20 uL
• Add 10 uL of internal standard to 20 uL of sample
• Internal standard is 13C 14N serine: has mass shift m + 4. Yanfen makes a mix that we used: 45 ul of the mixture includes 10 ul of 13CN15 serine. So, 45 ul per sample. I am thinking you should add 45 ul no matter how much your sample signal will be, since we would like have decent internal standards signal.
• We can prepare 40 uL + samples to use if the signal from 20 uL is too low
• Repeat drying step with nitrogen tree as done above or speed-vac
• If using speed-vac: 35oC for 1-2 hours until dry. Hold vials in 15 mL tubes.
• 2012/11/14: Yanfen recommended speed vac
• May need to switch rotor.
• Program 9. Check after 1 hr. Appox. Every 30 min after. Put vials in empty 15 ml centrifuge tubes. Balance rotor. Close lid. Press start. Stay with it to make sure it's actually going. Pump will be really noisy at first then will quiet.
• Check speed vac every 20 min to make sure it's still running.
• Optional freeze @ -20oC to pause
• Turn on heater closest to the RNA room door. Maximum temperature.
• Prepare pyridine:
• Add one layer of molecular sieve to scintillation vial
• Add 1 mL pyridine per sample: found in Hackett lab cabinet under fume hood next to FPLC fridge.
• Let sit for 5 min. No agitation.
For each sample:
• Add 20 uL of molecular-sieve treated pyridine to the dried sample using a syringe (would dissolve pipette tip)
• The solvent may turn slightly brown
• Add another 20 uL of Trifluoromethanesulfonic acid tert-butyldimethylsilyl ester (TBDMS) and seal well
• use the same blue screw-cap but replace the septum
• Rinse syringe in leftover pyridine
Repeat for all samples
• Incubate for 1 hour in the heater closest to the RNA room door. Use the maximum temperature setting. Turn heater off after use.
Mass Spec
• Machine we use: Agilent 5975 GCMS
• Injection to injection time is 1 hour.
• Before you run your samples, run ___ then a blank. (Blank must have an empty GCMS vial.)
• Sample are ionized (positively charged) as they pass through an electron cloud. Charged particles have different spectral peaks as they are unstable and degrade. This is useful for identifying the compound.
Operation Information
• Carrier gas = He
• splitless injection (higher sensitivity than split-mode injection)
• needle is washed in hexane
• more is available in room next door. Discard what is left in the HPlC waste jar, then refill bottle. Crack lid on squeeze tube so liquid doesn't get pushed out.
• quadrupole is ceramic (??)
Instructions for Use
1. Check method (name = (?) ORGACD-TBDMS)
1. ALS:
2. valves: don't set anything
3. Inlets: septum purge flow: wash out that volume
4. Columns: flow is constant at 1 mL/min. Since temperature increases and He becomes more viscous at higher temps, the pressure ramps up, too. It is held high at the end to bake off anything that stuck.
5. Aux heater: don't want matter to condense before entering mass spec
6. Events: Counts # of injections. Helps you decide when to replace septum.
7. Solvent delay: most of the sample is solvent. Let it run through.
8. Gain Factor: Set to 1.00
9. 1. 4 scans/seciond --> enough data to draw a smooth curve
10. Time windo: how big the white window in the back looks
11. Zones: shows temps in mass spec. Don't want condensation
12. HiVac gauge: broke over weekend.
13. Turbo Speed = 100 is desired.
2. Create file for sample run: will include the vial position and other useful info. (??)
1. You can have it call your method from here. This will reduce the probability that other people will edit your method.
2. Set path to method and where you want to store data
Helfpul Info
• Each sample gets it's own folder. There is a text file in each of these folders that tells the method used.
• About our method:
• solvent washing: wash in A & B. Both are hexane. There are also options to wash the needle with your sample or pump liquid in and out of the needle (this is a contamination risk.)
• Air shows up in mass spec.
• Can look for the air peaks to make sure it isn't leaking. M/Z is between 20 & 40.
• The machine can be calibrated with ___ that is held inside the machine. We can run these tests if we want, but Martin does somewhat regularly.
Supplies
EMD Molecular Sieve Type 3A 8-12 (MX1583D-1)
Pyridine Sigma ACS Reagent (360570-500mL)
Agilent Screw Caps with Red PTFE/white silicone Septa 100 pk (5182-723)
Agilent Extra Septa Red PTFE/white silicone 500 pk (5182-730)
Agilent Vial Glass Small Volume Inserts (5183-2085)
Agilent Glass Vial 2 mL with write on spot (5182-0715)
Personal tools
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T08:22:09.000Z
|
22dmnvzswfllfn5feln4zkdlyvzxqjnl
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40165",
"uncompressed_offset": 168255387,
"url": "openwetware.org/wiki/User:Iker_Valle_Aramburu",
"warc_date": "2013-11-22T19:24:16.000Z",
"warc_filename": "<urn:uuid:a5f9d007-fadd-4fa1-b0bb-dd2811a4fe26>",
"warc_url": "http://openwetware.org/wiki/User:Iker_Valle_Aramburu"
}
|
cccc_CC-MAIN-2013-20
|
User:Iker Valle Aramburu
From OpenWetWare
Jump to: navigation, search
I am a new member of OpenWetWare!
Contents
Contact Info
Iker Valle Aramburu (an artistic interpretation)
I work in the Your Lab at XYZ University. I learned about OpenWetWare from searching in the web.
Education
• Year, PhD, Institute
• Year, MS, Institute
• Year, BS, Institute
Research interests
1. Interest 1
2. Interest 2
3. Interest 3
Publications
1. Goldbeter A and Koshland DE Jr. . pmid:6947258. PubMed HubMed [Paper1]
2. JACOB F and MONOD J. . pmid:13718526. PubMed HubMed [Paper2]
leave a comment about a paper here
3. Mark Ptashne. A genetic switch. Cold Spring Harbor, N.Y.: Cold Spring Harbor Laboratory Press, 2004. isbn:0879697164. [Book1]
All Medline abstracts: PubMed HubMed
Useful links
Personal tools
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T08:54:48.000Z
|
6iaex3ollhvxz5idcjv546e5cnkvl3oo
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40175",
"uncompressed_offset": 182624711,
"url": "quotationsbook.com/quote/18056/",
"warc_date": "2013-11-22T19:24:16.000Z",
"warc_filename": "<urn:uuid:a5f9d007-fadd-4fa1-b0bb-dd2811a4fe26>",
"warc_url": "http://quotationsbook.com/quote/18056/"
}
|
cccc_CC-MAIN-2013-20
|
Quotation added by staff
Why not add this quote to your bookmarks?
Strength and growth come only through continuous effort and struggle... Hill, Napoleon
This quote is about growth · Search on Google Books to find all references and sources for this quotation.
A bit about Hill, Napoleon ...
Napoleon Hill (October 26, 1883 November 8, 1970) was an American author who was one the earliest producers of the modern genre of personal-success literature. His most famous work, Think and Grow Rich, is one of the best-selling books of all time.
These people bookmarked this quote:
More on the author
This quote around the web
Loading...
Search Quotations Book
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T08:39:03.000Z
|
gxbqq5byukdfz2mcunarau62amt52tqh
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40176",
"uncompressed_offset": 182636331,
"url": "quotationsbook.com/quote/gift/26353/",
"warc_date": "2013-11-22T19:24:16.000Z",
"warc_filename": "<urn:uuid:a5f9d007-fadd-4fa1-b0bb-dd2811a4fe26>",
"warc_url": "http://quotationsbook.com/quote/gift/26353/"
}
|
cccc_CC-MAIN-2013-20
|
It's easy! Just pick the product you like and click-through to buy it from trusted partners of Quotations Book. We hope you like these personalized gifts as much as we do.
Make and then buy your OWN fantastic personalized gift from this quote
When he to whom a person speaks does not understand, and he who speaks does not understand himself, that is metaphysics. Voltaire
Make a fabulous personalised bracelet or other form of jewellery with this quote
Click the banner below to pick the kind of jewellery you'd like ...
Choose something popular ...
Make a custom wrapped canvas ...
Make custom holiday cards ...
Make custom t-shirts ...
Make custom holiday gifts for boys ...
Make custom holiday gifts for girls ...
Make custom holiday gifts for men ...
A selection of more great products and gifts!
212 - The Extra Degree
The one extra degree makes the difference. This simple analogy reflects the ultimate definition of excellence. Because it's the one extra degree of effort, in business and life, that can separate the good from the great. This powerful book by S.L. Parker and Mac Anderson gives great examples, great quotes and great stories to illustrate the 212° concept. A warning - once you read it, it will be hard to forget. Your company will have a target for everything you do ... 212°
Click here to buy this »
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T08:25:13.000Z
|
5mzjmyhrl75frwmudtdp6ylxlj2soyjd
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40177",
"uncompressed_offset": 182641847,
"url": "quotationsbook.com/quote/gift/39278/",
"warc_date": "2013-11-22T19:24:16.000Z",
"warc_filename": "<urn:uuid:a5f9d007-fadd-4fa1-b0bb-dd2811a4fe26>",
"warc_url": "http://quotationsbook.com/quote/gift/39278/"
}
|
cccc_CC-MAIN-2013-20
|
It's easy! Just pick the product you like and click-through to buy it from trusted partners of Quotations Book. We hope you like these personalized gifts as much as we do.
Make and then buy your OWN fantastic personalized gift from this quote
Time will take your money, but money won't buy time. Taylor, James
Make a fabulous personalised bracelet or other form of jewellery with this quote
Click the banner below to pick the kind of jewellery you'd like ...
Choose something popular ...
Make a custom wrapped canvas ...
Make custom holiday cards ...
Make custom t-shirts ...
Make custom holiday gifts for boys ...
Make custom holiday gifts for girls ...
Make custom holiday gifts for men ...
A selection of more great products and gifts!
212 - The Extra Degree
The one extra degree makes the difference. This simple analogy reflects the ultimate definition of excellence. Because it's the one extra degree of effort, in business and life, that can separate the good from the great. This powerful book by S.L. Parker and Mac Anderson gives great examples, great quotes and great stories to illustrate the 212° concept. A warning - once you read it, it will be hard to forget. Your company will have a target for everything you do ... 212°
Click here to buy this »
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T07:30:37.000Z
|
jzb25dgx5725rcgg7kbbcacrwqcd5bhy
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40178",
"uncompressed_offset": 182647339,
"url": "quotationsbook.com/quote/gift/46612/",
"warc_date": "2013-11-22T19:24:16.000Z",
"warc_filename": "<urn:uuid:a5f9d007-fadd-4fa1-b0bb-dd2811a4fe26>",
"warc_url": "http://quotationsbook.com/quote/gift/46612/"
}
|
cccc_CC-MAIN-2013-20
|
It's easy! Just pick the product you like and click-through to buy it from trusted partners of Quotations Book. We hope you like these personalized gifts as much as we do.
Make and then buy your OWN fantastic personalized gift from this quote
you can't control other people's actions/feelings, but you can control your own, so get over it.. Unknown
Make a fabulous personalised bracelet or other form of jewellery with this quote
Click the banner below to pick the kind of jewellery you'd like ...
Choose something popular ...
Make a custom wrapped canvas ...
Make custom holiday cards ...
Make custom t-shirts ...
Make custom holiday gifts for boys ...
Make custom holiday gifts for girls ...
Make custom holiday gifts for men ...
A selection of more great products and gifts!
212 - The Extra Degree
The one extra degree makes the difference. This simple analogy reflects the ultimate definition of excellence. Because it's the one extra degree of effort, in business and life, that can separate the good from the great. This powerful book by S.L. Parker and Mac Anderson gives great examples, great quotes and great stories to illustrate the 212° concept. A warning - once you read it, it will be hard to forget. Your company will have a target for everything you do ... 212°
Click here to buy this »
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T08:18:57.000Z
|
7pxw2ywsgtm5clbqq4sj5i2gctianilb
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40196",
"uncompressed_offset": 219434772,
"url": "strategywiki.org/wiki/Golden_Axe/Characters",
"warc_date": "2013-11-22T19:24:16.000Z",
"warc_filename": "<urn:uuid:a5f9d007-fadd-4fa1-b0bb-dd2811a4fe26>",
"warc_url": "http://strategywiki.org/wiki/Golden_Axe/Characters"
}
|
cccc_CC-MAIN-2013-20
|
Golden Axe/Characters
From StrategyWiki, the video game walkthrough and strategy guide wiki
Jump to: navigation, search
Wasted Magic Pots
Extra magic pots in the same level do not increase damage! This means that Tyris Flare's level 3 magic costs two pots more than Ax Battler's despite dealing the same amount of damage; her magic only becomes more powerful than other characters' magic at higher levels.[1]
10
Omni Character
Play as every character. You will eventually earn this during normal play, but you can also get it almost instantly: start the game with one of the characters, start over with one of the other two, then start over with the last. You'll be given the easiest ten points of your gaming career.
All characters deal roughly the same base damage, the difference between them is the strength of their magic and the speed and effectiveness of their attacks.
[edit] Tyris Flare
Tyris Flare has the most powerful magic but the weakest attack, making her a somewhat difficult character. Her dash attack is flying kick which almost never misses. Her special attack is a spin attack that hits enemies directly behind.
level pots damage[1]
1 1-4 4 HP (¼ bar)
2 5 8 HP (½ bar)
3 6 16 HP (1 bar)
4 7 24 HP (1½ bars)
5 8 32 HP (2 bars)
6 9 40 HP (2½ bars)
[edit] Ax Battler
Ax Battler is a middle-of-the-road character; both his attack and magic are fairly even, making him a good character choice for new players. His dash attack is a shoulder barge, which is slow and may well miss. His special attack is a powerful spin attack that hits enemies directly behind.
level pots damage[1]
1 1-2 4 HP (¼ bar)
2 3-4 8 HP (½ bar)
3 5 16 HP (1 bar)
4 6 24 HP (1½ bars)
[edit] Gilius Thunderhead
Gilius Thunderhead sacrifices magic strength for combat prowess. He is the strongest fighter, and the favoured character of many experienced players. His dash attack is a headbutt, which is fairly decent. His special attack is a backwards roll that hits enemies far behind him. He is largely invulnerable when rolling. For some reason Gilius deals double damage against other characters when playing The Duel in two-player mode.
level pots damage[1]
1 1 4 HP (¼ bar)
2 2-3 8 HP (½ bar)
3 4 16 HP (1 bar)
[edit] References
1. 1.0 1.1 1.2 1.3 Health/damage values discovered by lserh [1]
Social networking
Personal tools
Namespaces
Variants
Views
Actions
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T08:22:59.000Z
|
4wdmqa2abokq34mqjzmozeuy4i4klhlq
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40238",
"uncompressed_offset": 262676258,
"url": "www.abs.gov.au/AUSSTATS/abs%40.nsf/DetailsPage/5220.01998-99",
"warc_date": "2013-11-22T19:24:16.000Z",
"warc_filename": "<urn:uuid:a5f9d007-fadd-4fa1-b0bb-dd2811a4fe26>",
"warc_url": "http://www.abs.gov.au/AUSSTATS/abs@.nsf/DetailsPage/5220.01998-99?OpenDocument"
}
|
cccc_CC-MAIN-2013-20
|
Australian Bureau of Statistics
Celebrating the International Year of Statistics 2013
ABS Home > Statistics > By Release Date
5220.0 - Australian National Accounts: State Accounts, 1998-99
Previous ISSUE Released at 11:30 AM (CANBERRA TIME) 02/12/1999
Page tools: RSS Search this Product
Help for : Adobe PDF.
Publications
5220.0 - Australian National Accounts: State Accounts
© Commonwealth of Australia 2013
Unless otherwise noted, content on this website is licensed under a Creative Commons Attribution 2.5 Australia Licence together with any terms, conditions and exclusions as set out in the website Copyright notice. For permission to do anything beyond the scope of this licence and copyright terms contact us.
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T07:46:34.000Z
|
mjwzqdmg2f6aq3fuqzetmbehwn6kgzgv
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40239",
"uncompressed_offset": 262690782,
"url": "www.abs.gov.au/AUSSTATS/abs%40.nsf/ViewContent?Action=Expand&Num=3.16.2&view=ProductsbyTopic",
"warc_date": "2013-11-22T19:24:16.000Z",
"warc_filename": "<urn:uuid:a5f9d007-fadd-4fa1-b0bb-dd2811a4fe26>",
"warc_url": "http://www.abs.gov.au/AUSSTATS/abs@.nsf/ViewContent?readform&view=ProductsbyTopic&Action=Expand&Num=3.16.2"
}
|
cccc_CC-MAIN-2013-20
|
Australian Bureau of Statistics
Celebrating the International Year of Statistics 2013
ABS Home > Statistics > By Topic > Tourism
Statistics by Topic
Attractions Events Conventions
Australia at a Glance, 2008 (cat no. 1309.0)
Australian Capital Territory in Focus, 2007 (cat no. 1307.8)
Directory of Tourism Statistics, 2000 (cat no. 1130.0)
Framework for Australian Tourism Statistics, 2003 (cat no. 9502.0.55.001)
Pocket Year Book, Australia, 2000 (cat no. 1302.0)
Publications and Products Released in January 2002, Jan 2002 (cat no. 1102.0)
Queensland Year Book (Hard cover), 2001 (cat no. 1301.3)
Regional Indicators, South Australia, 1998 (cat no. 1314.4)
Regional Statistics, Australian Capital Territory, 1999 (Reissue) (cat no. 1313.8)
South Australian Year Book, 1999 (cat no. 1301.4)
Statistics Victoria, Jun 2011 (cat no. 1100.2)
Tourism Marketing Expenditure, Australia, 2005-06 (cat no. 8691.0)
Tourism Newsletter, July 2009 (cat no. 8602.0)
Travel Agency Services, Australia, 2003-04 (cat no. 8653.0)
Year Book Australia on CD-ROM, 2006 (cat no. 1301.0.30.001)
© Commonwealth of Australia 2013
Unless otherwise noted, content on this website is licensed under a Creative Commons Attribution 2.5 Australia Licence together with any terms, conditions and exclusions as set out in the website Copyright notice. For permission to do anything beyond the scope of this licence and copyright terms contact us.
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T08:34:01.000Z
|
mx7lk5eoen64uvlia63mdmyrgd43w2un
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40247",
"uncompressed_offset": 301300829,
"url": "www.biomedcentral.com/1471-2458/11/S3/S13/comments",
"warc_date": "2013-11-22T19:24:16.000Z",
"warc_filename": "<urn:uuid:a5f9d007-fadd-4fa1-b0bb-dd2811a4fe26>",
"warc_url": "http://www.biomedcentral.com/1471-2458/11/S3/S13/comments"
}
|
cccc_CC-MAIN-2013-20
|
This article is part of the supplement: Technical inputs, enhancements and applications of the Lives Saved Tool (LiST)
Review
Effect of case management on neonatal mortality due to sepsis and pneumonia
Anita K M Zaidi*, Hammad A Ganatra, Sana Syed, Simon Cousens, Anne CC Lee, Robert Black, Zulfiqar A Bhutta and Joy E Lawn
BMC Public Health 2011, 11(Suppl 3):S13 doi:10.1186/1471-2458-11-S3-S13
No comments have yet been made on this article.
Post a comment
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T09:02:00.000Z
|
7pvb3ajriagepl3rowq77hcbyymhhwbu
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40248",
"uncompressed_offset": 301325147,
"url": "www.biomedcentral.com/1741-7015/9/108?fmt_view=classic",
"warc_date": "2013-11-22T19:24:16.000Z",
"warc_filename": "<urn:uuid:a5f9d007-fadd-4fa1-b0bb-dd2811a4fe26>",
"warc_url": "http://www.biomedcentral.com/1741-7015/9/108?fmt_view=classic"
}
|
cccc_CC-MAIN-2013-20
|
Commentary
Barriers and progress in the treatment of low back pain
Nadine E Foster
Author Affiliations
Arthritis Research UK Primary Care Centre, Keele University, Keele, Staffordshire, ST5 5BG, UK
BMC Medicine 2011, 9:108 doi:10.1186/1741-7015-9-108
The electronic version of this article is the complete one and can be found online at: http://www.biomedcentral.com/1741-7015/9/108
Received:9 August 2011
Accepted:27 September 2011
Published:27 September 2011
© 2011 Foster; licensee BioMed Central Ltd.
This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Abstract
Low back pain is a common and costly condition and for most people is likely to be a recurrent problem throughout their lifetime. The management of patients with low back pain has been positively influenced by the rise in high quality clinical trials and systematic reviews in recent decades, and this body of evidence, synthesized in many clinical practice guidelines, has improved our knowledge about which treatments for low back pain are useful and which are not. For the largest group of patients, those with non-specific low back pain for whom a clear diagnosis cannot be given, the reality is that the treatments we have to offer tend to produce small effects, often only in the short term and none appear to effectively change long-term prognosis. This commentary summarizes the array of treatments currently available, notes the results of recent trials and guidelines and considers alternative approaches that may prove more valuable in achieving better patient outcomes in the future.
Introduction
Nearly everyone gets low back pain (LBP) at least once in their lifetime making the effective treatment of this common complaint of widespread interest. It is the most common reason for middle-aged people to visit their family doctor [1] with approximately 6% to 9% of adults consulting for this condition each year [1,2]. Although many LBP patients stop consulting within three months, 60% to 80% of people still report pain or disability a year later, and up to 40% of those who have taken time off work will have future episodes of work absence [3,4]. Hence, previous ideas of acute (less than four weeks), sub-acute (four weeks to 12 weeks) and chronic LBP (more than 12 weeks) are gradually being superseded by the view of LBP as a chronic, recurrent condition with an untidy pattern of symptomatic episodes, remissions and recurrences [3]. Dunn and colleagues [5] proposed four trajectories for LBP patients representing different paths over time; persistent mild, recovering, severe chronic and fluctuating, paths that have been since confirmed in other samples [6]. The societal cost of LBP-related work absence is considerable. Patients with LBP account for more than $90 billion annually in health care expenses in the US [7] and $9.17 billion in total costs in Australia [8]. In the UK, costs are in the region of 1% to 2% of gross national product [9] with National Health Service (NHS) costs alone of £251 million annually [10].
Recent years have seen an exponential increase in research focused on LBP and early criticisms about poor quality studies have largely been addressed by recent trials using rigorous methodology [11-14]. Many practice guidelines [15-17] are now available to help practitioners choose treatments that are safe and effective. A sobering reflection however is that no treatment has large, significant and consistent benefits for patients with non-specific LBP. Despite decades of research and improved quality of clinical trials, the reality is that the treatments we have to offer patients tend to produce small effects, often only in the short term and none appear to change effectively the longer-term prognostic paths or trajectories for patients.
In this commentary I will discuss the variety of current treatment options and recent guideline recommendations, then consider the trends in results of recent high quality trials and the potential explanations for them before suggesting key alternative approaches of potentially more value in achieving better patient outcomes in the future.
Discussion
Current treatment options and guideline recommendations
There is an almost endless list of treatment options currently available to patients with LBP, each supported by different theories, potential mechanisms, underpinning rationales and research evidence. Some are accompanied by extravagant claims of complete pain relief, often advertised via the internet [18]. Most of these claims and unusual treatment approaches have not proven to be effective when subjected to rigorous and independent evaluation [19]. Treatments include oral medications, topical medications, exercise, manual therapy, traction, acupuncture, transcutaneous electrical nerve stimulation (TENS), spinal cord stimulators, mattresses, orthotics, back supports, biofeedback, spinal injections and surgery. In other words, LBP patients may be offered treatments from the full range of conservative, pharmacological, non-pharmacological, traditional and complementary healthcare interventions as well as invasive interventions.
Given this almost limitless array of options, it is not uncommon for patients with similar LBP signs and symptoms to receive different interventions from healthcare professionals. Key reasons for such variation in practice [20,21] are firstly, the close commitment of different intervention providers to their respective favorite treatments and secondly, the clinical uncertainty associated with LBP, in terms of diagnosis, prognosis and treatment selection. Evidence for the first reason is provided by studies that show the association between the attitudes and beliefs of practitioners and their clinical behaviors for patients with LBP [21]. As for the second reason, we know that the serious pathologies such as cancer, infection and inflammatory disease account for less than one percent of LBP cases, nerve root problems (associated with radiculopathy or spinal stenosis) are thought to explain no more than 10% to 15% of cases, whereas most LBP (an estimated 85%) is suggested to be 'non-specific', resulting in three diagnostic groups. Given that the term 'non-specific LBP' most likely refers to many LBP problems with different etiologies, ensuring 'the right patient gets the right treatment at the right time' is a particular challenge. While imaging seems a logical way to resolve this dilemma, the use of early magnetic resonance imaging (MRI) scans does not alter patients' outcomes and are actually associated with persistent perceptions of poor health [22].
More than 2,500 controlled trials of treatments for back and neck pain listed in the Cochrane database, 32 Cochrane systematic reviews of randomized trials, 13 recent national clinical guidelines and two international guidelines from Europe have led to general agreement about best practice for non-specific LBP around the world [23]. This starts with the provision of information about the expected course of the problem and self-care options that patients should try, early and gradual return to normal activities including work, discouragement of bed rest as a treatment, avoidance of routine imaging, use of first line medications (starting with time-contingent acetaminophen and progressing to non-steroidal anti-inflammatory drugs if needed), and the assessment of psychosocial risk factors for chronicity (although the detail of how best to do this varies considerably between available guidelines). The use of passive treatments such as electrotherapy and therapeutic ultrasound is generally discouraged. As LBP persists, best practice recommendations include non-pharmacological therapies with proven benefits; supervised exercise, manual therapy, acupuncture, cognitive behavioral therapy with intensive multidisciplinary treatments reserved for those who do not benefit from these approaches [16,17,23]. The content of recent guidelines, irrespective of country, is broadly similar regarding the diagnostic classification (the diagnostic triage outlined above) and the use of diagnostic and therapeutic interventions with some discrepancy around the use of spinal manipulation and some stronger medications [23].
Why aren't treatments more effective?
There are likely several key explanations, explored in detail elsewhere [19,24]. Firstly, many of our current treatments are predicated on a healthcare practitioner's specific diagnosis, based on for example imaging findings or the results of subjective and objective examination, yet these approaches to diagnosis correlate poorly with the patient's symptoms [19], their onward path or trajectory, or their treatment responsiveness. Secondly, patient heterogeneity in clinical trials means that the average treatment effect masks a wide range of individual responses to any specific treatment, including for example, patients who benefit a great deal along with those who benefit little or not at all [24]. Thus a compelling argument for our lack of progress in achieving better treatment results is that we have failed to focus on identifying and addressing the factors that really do influence patients' outcomes [19]. In other words, we have largely failed to match patients with the most appropriate treatment for their individual profile. Identification of clinically relevant subgroups of non-specific LBP patients may be related to causal mechanisms, different prognoses or treatment responsiveness. For example, although psychosocial factors associated with poor prognosis (or yellow flags) have been shown to be important in the development of chronicity and future disability [25,26] and most guidelines recommend the assessment of these factors, there have been few easy-to-use tools to help clinicians identify these factors in busy clinical practice and limited guidance about appropriate treatment for patients in whom these factors are identified. Although healthcare professionals often feel they can intuitively identify the patients with LBP who have a poor prognosis, actually these patients are often difficult to spot and professionals make inconsistent risk estimations about LBP patients when using intuition alone [27]. More individual and accurate estimates of the prognosis of patients are needed so that we might better target the treatments we offer to those who need them [23]. Several clinical tools exist to aid healthcare professionals in identifying patients either at risk of chronicity or to improve targeting of treatment, summarized in Hill et al. [28]. One of the most widely used is the 24-item Örebro Musculoskeletal Pain Screening Questionnaire which is still rather long for use in busy clinical practice. A recently validated tool to identify risk subgroups of LBP patients is the shorter nine item STarT Back Tool [29] which has been shown to have similar properties to the Örebro instrument but is easier for patients to complete and professionals to score [28].
A second compelling explanation for the generally poor outcomes seen in usual practice such as primary care settings [25] is the limited way in which best evidence recommendations have been translated into everyday clinical practice for patients with LBP. For example, we know that early access to advice and information about self-management and some specific treatments such as exercise, manual therapy, acupuncture and cognitive-behavioral interventions are effective, yet most patients in primary care actually receive symptomatic care through advice related to the current episode and medication alone, neither of which has a clear focus on secondary prevention. Another example is return to work advice, where just under a third of healthcare practitioners continue to recommend staying off work to patients for whom guideline recommendations suggest the opposite [21]. Reasons why adherence to guideline recommendations for work might be less than ideal are unclear, but may be, in part, due to the complex nature of the clinical consultation, in which healthcare professionals such as general practitioners (GPs) want to tailor their decisions according to a patient's individual expectations and demands and thus place higher relative importance on maintaining a good long term relationship with their patient rather than adhering to guideline recommendations. Confronting patients about sickness certification may therefore be seen as a potential threat to the practitioner-patient relationship by some GPs while for others, they may feel they are not best placed to judge whether a LBP patient can return to work safely.
Potentially more effective approaches and future directions
There are at least two avenues that may provide better progress on the road to improving the outcomes of this patient group. One requires a clearer focus on the factors that influence LBP outcome so we can use that information to test different approaches to subgrouping or screening LBP patients for targeted treatment. This is one of the research recommendations in the recent National Institute of Health and Clinical Excellence guidelines for LBP in the UK [17]. There are promising developments in this field [27-33], with one such example involving a change in the focus of treatment from symptomatic relief only to secondary prevention and reducing the risk of future recurrences and chronicity [29,34]. Patients with poorer physical function and those with psychological obstacles to recovery such as psychological distress, negative feelings about their back pain and increased fear of activity, are more disabled by their pain and are more likely to have a poor outcome [17]. A potentially more effective system would be one in which there is early identification of patients at risk of chronicity and subsequently efforts to prevent such chronicity [35]. Addressing these factors in primary care at an early stage before they become entrenched and more difficult to treat could lead to better long term outcomes. Prognostic assessment tools, in primary care, identifying subgroups of patients at risk of persistent LBP, and who may benefit from interventions that target key physical and/or psychological obstacles to recovery have been developed and validated. One example of this is the STarT Back tool [29]. Specifically designed for primary care settings, the STarT Back tool is a subgrouping instrument that classifies patients into three categories for targeted treatment, based on the presence of modifiable risk factors for poor outcome. A randomized controlled trial (the STarT Back trial) is testing whether subgrouping for targeted treatment is better than best current care (provided by physiotherapists) of non-targeted treatment [34]. This potentially more effective treatment strategy is an example of a move towards stratified healthcare and away from the one-size-fits-all approach, improving the odds of getting the right patient to the right treatment at the right time.
Perhaps a less exciting but no less challenging approach to improving outcomes for patients with LBP is to invest much more effort in translating best practice recommendations from high quality research into everyday clinical practice. Such approaches are likely to need to include not only patients as targets for the intervention but also the healthcare practitioners and organizational processes involved in their care. Several studies have attempted to change healthcare practitioner behavior for LBP patients [36-44] and overall highlight the considerable challenges and generally small effects of implementation efforts to date. Targeting the general public through mass media campaigns about LBP has shown promise [45-47] and the benefit of this type of approach is the way in which the intervention also targets healthcare practitioners. Finding better incentives for practitioners to adopt best practice and working out how public policy can help are both likely to be useful. The cost burden of LBP to society means that research that more carefully develops and tests ways to better support the translation of best practice into everyday clinical practice is a clear priority.
Conclusions
Despite the plethora of treatments for LBP patients, and the production of multiple guidelines for practice, getting the right patient to the right treatment at the right time is still a considerable challenge. Findings from epidemiological studies and recent high quality trials underline the need to consider seriously the following two avenues of progress. Firstly, a move away from a one-size-fits-all approach to LBP and towards greater subgrouping for targeted treatment in LBP, and secondly, more considerable effort to support the translation of best practice and provision of treatments with clear evidence of effectiveness into clinical reality for patients.
Competing interests
The author declares that they have no competing interests.
Authors' contributions
NF wrote the manuscript.
References
1. Dunn KM, Croft PR: Classification of low back pain in primary care: using "bothersomeness" to identify the most severe cases.
Spine 2005, 30:1887-1892. PubMed Abstract | Publisher Full Text
2. Jordan KP, Kadam UT, Hayward R, Porcheret M, Young C, Croft P: Annual consultation prevalence of regional musculoskeletal problems in primary care: an observational study.
BMC Musculoskelet Disord 2010, 11:144. PubMed Abstract | BioMed Central Full Text | PubMed Central Full Text
3. Croft PR, Macfarlane GJ, Papageorgiou AC, Thomas E, Silman AJ: The outcome of low back pain in general practice: a prospective study.
BMJ 1998, 316:1356-1359. PubMed Abstract | Publisher Full Text | PubMed Central Full Text
4. Hestbaek L, Leboeuf YC, Manniche C: Low back pain: what is the long-term course? A review of studies of general patient populations.
Eur Spine J 2003, 12:149-165. PubMed Abstract | Publisher Full Text
5. Dunn KM, Jordan K, Croft PR: Characterising the course of low back pain: a latent class analysis.
Am J Epidemiol 2006, 163:754-761. PubMed Abstract | Publisher Full Text
6. Tamcan O, Mannion AF, Eisenring C, Horisberger B, Elfering A, Müller U: The course of chronic and recurrent low back pain in the general population.
Pain 2010, 150:451-457. PubMed Abstract | Publisher Full Text
7. Luo X, Pietrobon R, Sun SX, Liu GG, Hey L: Estimates and patterns of direct health care expenditures among individuals with back pain in the United States.
Spine 2004, 29:79-86. PubMed Abstract | Publisher Full Text
8. Walker BF, Muller R, Grant WD: Low back pain in Australian adults: the economic burden.
Asia Pac J Public Health 2003, 15(2):79-87. PubMed Abstract | Publisher Full Text
9. Norlund AI, Waddell G: Cost of back pain in some OECD countries. In Neck and back pain: the scientific evidence of causes, diagnosis and treatment. 1st edition. Edited by Nachemson AL, Jonsson E. Philadelphia: Lippincott, Williams & Wilkins; 2000:421-425.
10. Maniadakis N, Gray A: The economic burden of back pain in the UK.
Pain 2000, 84:95-103. PubMed Abstract | Publisher Full Text
11. UKBEAM team: United Kingdom back pain exercise and manipulation (UK BEAM) randomised trial: Effectiveness of physical treatments for back pain in primary care.
BMJ 2004, 329:1377-1385. PubMed Abstract | Publisher Full Text | PubMed Central Full Text
12. Hay EM, Mullis R, Lewis M, Vohora K, Main CJ, Watson P, Dziedzic KS, Sim J, Minns Lowe C, Croft PR: Comparison of physical treatments versus a brief pain-management programme for back pain in primary care: a randomised clinical trial in physiotherapy practice.
Lancet 2005, 365:2024-2030. PubMed Abstract | Publisher Full Text
13. Lamb SE, Hansen Z, Lall R, Castelnuovo E, Withers EJ, Nichols V, Potter R, Underwood MR, Back Skills Training Trial investigators: Group cognitive behavioural treatment for low-back pain in primary care: a randomised controlled trial and cost-effectiveness analysis.
Lancet 2010, 375:916-923. PubMed Abstract | Publisher Full Text
14. Brox JI, Nygaard ØP, Holm I, Keller A, Ingebrigtsen T, Reikerås O: Four-year follow-up of surgical versus non-surgical therapy for chronic low back pain.
Ann Rheumat Dis 2010, 69:1643-1648. PubMed Abstract | Publisher Full Text | PubMed Central Full Text
15. Airaksinen O, Brox JI, Cedraschi C, Hildebrandt J, Klaber-Moffett J, Kovacs F, Mannion AF, Reis S, Staal JB, Ursin H, Zanoli G: COST B13 European guidelines for the management of chronic non-specific low back pain.
Eur Spine J 2006, 15:S192-S300. PubMed Abstract | Publisher Full Text
16. Chou R, Qaseem A, Snow V, Casey D, Cross JT, Shekelle P, Owens DK: Diagnosis and treatment of low back pain: a joint clinical practice guideline from the American College of Physicians and the American Pain Society.
Ann Intern Med 2007, 147:478-491. PubMed Abstract | Publisher Full Text
17. Savigny P, Kuntze S, Watson P, Underwood M, Ritchie G, Cotterell M, Hill D, Browne N, Buchanan E, Coffey P, Dixon P, Drummond C, Flanagan M, Griffiths M, Halliday-Bell J, Hettinga D, Vogel S, Walsh D: Low Back Pain: Early management of persistent non-specific low back pain. National Collaborating Centre for Primary Care and Royal College of General Practitioners, London; 2009.
18. Butler L, Foster NE: Back pain online: a cross-sectional survey of the quality of web-based information on low back pain.
Spine 2003, 28:395-401. PubMed Abstract | Publisher Full Text
19. Pransky G, Buchbinder R, Hayden J: Contemporary low back pain research - and implications for practice.
Best Pract Res Clin Rheumatol 2010, 24:291-298. PubMed Abstract | Publisher Full Text
20. Foster NE, Thompson K, Baxter GD, Allen JM: Management of non-specific low back pain by physiotherapists in Britain and Ireland: a descriptive questionnaire of current clinical practice.
Spine 1999, 24:1332-1342. PubMed Abstract | Publisher Full Text
21. Bishop A, Foster NE, Thomas E, Hay EM: How does the self-reported clinical management of patients with low back pain relate to the attitudes and beliefs of health practitioners? A survey of UK general practitioners and physiotherapists.
Pain 2008, 135:187-195. PubMed Abstract | Publisher Full Text | PubMed Central Full Text
22. Ash LM, Modic MT, Obuchowski NA, Ross JS, Brant-Zawadzki MN, Grooff PN: Effects of diagnostic information, per se, on patient outcomes in acute radiculopathy and low back pain.
AJNR Am J Neuroradiol 2008, 29:1098-1103. PubMed Abstract | Publisher Full Text
23. Koes BW, van Tulder M, Lin CWC, Macedo LG, McAuley J, Maher C: An updated overview of clinical guidelines for the management of non-specific low back pain in primary care.
Eur Spine J 2010, 19:2075-2094. PubMed Abstract | Publisher Full Text | PubMed Central Full Text
24. Foster NE, Dziedzic KS, van der Windt DA, Fritz JM, Hay EM: Research priorities for non-pharmacological therapies for common musculoskeletal problems: nationally and internationally agreed recommendations.
BMC Musculoskelet Disord 2009, 10:3. PubMed Abstract | BioMed Central Full Text | PubMed Central Full Text
25. Foster NE, Bishop A, Thomas E, Main C, Horne R, Weinman J, Hay E: Illness perceptions of low back pain patients in primary care: what are they, do they change and are they associated with outcome?
Pain 2008, 136:177-187. PubMed Abstract | Publisher Full Text
26. Grotle M, Foster NE, Dunn KM, Croft P: Are prognostic indicators for poor outcome different for acute and chronic low back pain consulters in primary care?
Pain 2010, 151:790-797. PubMed Abstract | Publisher Full Text
27. Hill JC, Vohora K, Dunn KM, Main CJ, Hay EM: Comparing the STarT back screening tool's subgroup allocation of individual patients with that of independent clinical experts.
Clin J Pain 2010, 26:783-787. PubMed Abstract | Publisher Full Text
28. Hill JC, Dunn KM, Main CJ, Hay EM: Subgrouping low back pain: a comparison of the STarT Back Tool with the Orebro Musculoskeletal Pain Screening Questionnaire.
Eur J Pain 2010, 14:83-89. PubMed Abstract | Publisher Full Text | PubMed Central Full Text
29. Hill JC, Dunn KM, Lewis M, Mullis R, Main CJ, Foster NE, Hay EM: A primary care back pain screening tool: identifying patient subgroups for initial treatment.
Arthritis Rheum 2008, 59:632-641. PubMed Abstract | Publisher Full Text
30. Brennan GP, Fritz JM, Hunter SJ, Thackeray A, Delitto A, Erhard RE: Identifying subgroups of patients with acute/subacute "nonspecific" low back pain: results of a randomized clinical trial.
Spine 2006, 31:623-631. PubMed Abstract | Publisher Full Text
31. Childs JD, Fritz JM, Flynn TW, Irrgang JJ, Johnson KK, Majkowski GR, Delitto A: A clinical prediction rule to identify patients with low back pain most likely to benefit from spinal manipulation: a validation study.
Ann Intern Med 2004, 141:920-928. PubMed Abstract | Publisher Full Text
32. Heymans MW, Anema JR, van Buuren S, Knol DL, van Mechelen W, de Vet HC: Return to work in a cohort of low back pain patients: development and validation of a clinical prediction rule.
J Occup Rehabil 2009, 19:155-165. PubMed Abstract | Publisher Full Text
33. Dionne CE, Bourbonnais R, Frémont P, Rossignol M, Stock SR, Larocque I: A clinical return-to-work rule for patients with back pain.
CMAJ 2005, 172:1559-1567. PubMed Abstract | Publisher Full Text | PubMed Central Full Text
34. Hay EM, Dunn KM, Hill JC, Lewis M, Mason EE, Konstantinou K, Sowden G, Somerville S, Vohora K, Whitehurst D, Main CJ: A randomised clinical trial of subgrouping and targeted treatment for low back pain compared with best current care. The STarT Back Trial Study Protocol.
BMC Musculoskelet Dis 2008, 9:58. BioMed Central Full Text
35. Koes BW, van Tulder MW, Thomas S: Diagnosis and treatment of low back pain.
BMJ 2006, 332:1430-1434. PubMed Abstract | Publisher Full Text | PubMed Central Full Text
36. Bishop PB, Wing PC: Knowledge transfer in family physicians managing patients with acute low back pain: a prospective randomised control trial.
Spine J 2006, 6:282-288. PubMed Abstract | Publisher Full Text
37. Ammendolia C, Hogg-Johnson S, Pennick V, Glazier R, Bombardier C: Implementing evidence-based guidelines for radiography in acute low back pain: a pilot study in a chiropractic community.
J Manip Physiol Ther 2004, 27:170-179. Publisher Full Text
38. Dey P, Simpson CW, Collins SI, Hodgson G, Dowrick CF, Simison AJ, Rose MJ: Implementation of RCGP guidelines for acute low back pain: a cluster randomised controlled trial.
BJGP 2004, 54:33-37.
39. Enges AJ, Wensing M, van Tulder MW, Timmermanns A, Oostendorp RA, Koes BW, Grol R: Implementation of the Dutch low back pain guideline for general practitioners: a cluster randomised controlled trial.
Spine 2005, 30:559-600. PubMed Abstract | Publisher Full Text
40. Schectman JM, Schroth WS, Verme D, Voss JD: Randomised controlled trial of education and feedback for implementation of guidelines for acute low back pain.
J Gen Intern Med 2003, 18:773-780. PubMed Abstract | Publisher Full Text | PubMed Central Full Text
41. Becker A, Leonhardt C, Kochen MM, Keller S, Wegscheider K, Baum E, Donner-Banzhoff N, Pfingsten M, Hildebrandt J, Basler HD, Chenot JF: Effects of two guideline implementation strategies on patient outcomes in primary care: a cluster randomized controlled trial.
Spine 2008, 33:473-480. PubMed Abstract | Publisher Full Text
42. Bekkering GE, van Tulder MW, Hendriks EJM, Koopmanschap MA, Knol DL, Bouter LM, Oostendorp RAB: Implementation of clinical guidelines on physical therapy for patients with low back pain: randomized trial comparing patient outcomes after a standard and active implementation strategy.
Phys Ther 2005, 85:544-555. PubMed Abstract | Publisher Full Text
43. Evans D, Breen A, Pincus T, Sim J, Underwood M, Vogel S, Foster NE: The effectiveness of a posted information package on the beliefs and behaviour of musculoskeletal practitioners: the UK Chiropractors, Osteopaths and Musculoskeletal Physiotherapists Low back pain ManagemENT (COMPLeMENT) randomised trial.
Spine 2010, 35:858-866. PubMed Abstract | Publisher Full Text
44. Foster NE, Mullis R, Young J, Doyle C, Lewis M, Whitehurst D, Hay EM, IMPaCT Back Study team: IMPaCTBack study protocol. Implementation of subgrouping for targeted treatment systems for low back pain patients in primary care: a prospective population-based sequential comparison.
BMC Musculoskelet Disord 2010, 11:186. PubMed Abstract | BioMed Central Full Text | PubMed Central Full Text
45. Buchbinder R, Jolley D, Wyatt M: Population based intervention to change back pain beliefs and disability: three part evaluation.
BMJ 2001, 322:1516-1520. PubMed Abstract | Publisher Full Text | PubMed Central Full Text
46. Buchbinder R, Jolley D, Wyatt M: Volvo Award Winner in Clinical Studies: Effects of a media campaign on back pain beliefs and its potential influence on management of low back pain in general practice.
Spine 2001, 26:2535-2542. PubMed Abstract | Publisher Full Text
47. Buchinder R, Jolley D: Population-based intervention to change back pain beliefs: a three-year follow up study.
BMJ 2004, 328:321. PubMed Abstract | Publisher Full Text | PubMed Central Full Text
Pre-publication history
The pre-publication history for this paper can be accessed here:
http://www.biomedcentral.com/1741-7015/9/108/prepub
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T07:39:27.000Z
|
g2zjz5dvvs2aufjhis3l4ngsbkdmcrbv
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40258",
"uncompressed_offset": 346052079,
"url": "www.crummy.com/2002/12/13/0",
"warc_date": "2013-11-22T19:24:16.000Z",
"warc_filename": "<urn:uuid:a5f9d007-fadd-4fa1-b0bb-dd2811a4fe26>",
"warc_url": "http://www.crummy.com/2002/12/13/0"
}
|
cccc_CC-MAIN-2013-20
|
< XUL Healing
Next >
: Sam Gon III presents the highly detailed A Guide To The Orders Of Trilobites, complete with "Trilobite of the Month" centerfold and the "terror of the Burgess mudflats". (found via A Voyage to Arcturus) In other trilobite news, don't forget the trilobite cookies!
Filed under:
[Main] [Edit]
Unless otherwise noted, all content licensed by Leonard Richardson
under a Creative Commons License.
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T08:49:14.000Z
|
fxjumu7d36qoseym3f6fh4pgu5tqncug
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40259",
"uncompressed_offset": 346055039,
"url": "www.crummy.com/2004/12/22/0",
"warc_date": "2013-11-22T19:24:16.000Z",
"warc_filename": "<urn:uuid:a5f9d007-fadd-4fa1-b0bb-dd2811a4fe26>",
"warc_url": "http://www.crummy.com/2004/12/22/0"
}
|
cccc_CC-MAIN-2013-20
|
< Previous
Next >
(3) Demolition Derby: Someone smashed the casing of the left-hand mirror on my car. Hopefully I can get it fixed tomorrow, because otherwise Christmas is ruined. So aggravating!
Comments:
Posted by Rachel at Thu Dec 23 2004 00:10
I win: my car didn't start this morning. Christmas AND new year's are ruined!
Posted by Nick Moffitt at Thu Dec 23 2004 01:55
Don't have a car, never learned to drive, and Christmas couldn't be better.
Ahhhhhhhhhhh...
Posted by Susie at Thu Dec 23 2004 11:02
What about me? I had to drive to work in the snow on un-cleared roads!
[Main] [Edit]
Unless otherwise noted, all content licensed by Leonard Richardson
under a Creative Commons License.
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T08:49:26.000Z
|
o6wf6u2kvv7dnunwv4vnvqqsyima5ssv
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40267",
"uncompressed_offset": 385577097,
"url": "www.familysearch.org/learn/wiki/en/Italy,_Treviso,_Treviso_Civil_Registration_%28FamilySearch_Historical_Records%29/Known_Issues",
"warc_date": "2013-11-22T19:24:16.000Z",
"warc_filename": "<urn:uuid:a5f9d007-fadd-4fa1-b0bb-dd2811a4fe26>",
"warc_url": "http://www.familysearch.org/learn/wiki/en/Italy,_Treviso,_Treviso_Civil_Registration_(FamilySearch_Historical_Records)/Known_Issues"
}
|
cccc_CC-MAIN-2013-20
|
Italy, Treviso, Treviso Civil Registration (FamilySearch Historical Records)/Known IssuesEdit This Page
From FamilySearch Wiki
Known Issues
Question #1: When I try to search this collection and view the images I get a message that the images are not available. How may I view the images?
Answer #1: FamilySearch has limited rights, granted by the record custodians, to publish images from the Italy, Treviso, Civil Registration (State Archive), 1806-1815 collection for viewing online. Images for this collection are only available for viewing to members of the sponsoring organization (The Church of Jesus Christ of Latter-day Saints), and at FamilySearch Centers. It is important to check with your FamilySearch Center before your visit, to verify that the center is equipped with the capability to view these restricted images on www.familysearch.org.
If you have an LDS account and are not able to view images after signing in, it may be due to a registration problem, not an image access problem. Please call 1-866-406-1830 in the United States, or contact Patron Services at support@familysearch.org. Please include a brief description of the problem and steps taken thus far to resolve the issue.
Question #2: Even when I am signed in, I cannot always view images, but get a message that the images are not available. Is there a way to view these records?
Answer #2: Italian Data Privacy rules prohibit viewing the following records: All birth images must be 100 years or older; all marriage images must be 70 years or older, and all death images must be 70 years or older.
If any record on a digital folder contains images that fall within these cut-off dates, they may not be viewed. For example, if birth records that fall within the last 100 years are on the film, the entire digital folder is restricted.
The Historical Records collections will be updated each year to show new unrestricted records. FamilySearch respects and strives to adhere to all privacy laws respective to preserving and providing access to genealogical records in its collection.
Question #3: When I go to print or save an image, the buttons are gray and it will not let me either print or save. Is there a way I can print and/or download from this collection?
Answer #3: There is a no-print/no-save restriction with these collections at the request of the record custodians.
If you encounter additional problems with this collection, feel free to report them at support@familysearch.org. Please include the following information:
• If browsing this collection: please include the full path you followed to where the problem occurred. The browse path is located above the Image viewer window.
For example: Italy, Treviso, Civil Registration (State Archive), 1806-1815 > Albaredo > Matrimoni 1806 > Image 3 of 7.
• If you are reporting a technical issue: please include your operating system and browser version, such as Windows XP and Internet Explorer.
Your assistance will help ensure that future revisions will be considered.
Return to the Italy, Treviso, Treviso Civil Registration (FamilySearch Historical Records Learn More page.
Return to the Italy, Treviso, Civil Registration (State Archive), 1806-1815 collection at FamilySearch.org.
Need additional research help? Contact our research help specialists.
Need wiki, indexing, or website help? Contact our product teams.
Did you find this article helpful?
You're invited to explain your rating on the discussion page (you must be signed in).
• This page was last modified on 15 February 2013, at 02:21.
• This page has been accessed 405 times.
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T09:03:01.000Z
|
4c35mculw5hrkweck7ud5qdmugquu7np
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40268",
"uncompressed_offset": 385589803,
"url": "www.familysearch.org/learn/wiki/en/Navajo_Indians",
"warc_date": "2013-11-22T19:24:16.000Z",
"warc_filename": "<urn:uuid:a5f9d007-fadd-4fa1-b0bb-dd2811a4fe26>",
"warc_url": "http://www.familysearch.org/learn/wiki/en/Navajo_Indians"
}
|
cccc_CC-MAIN-2013-20
|
Navajo IndiansEdit This Page
From FamilySearch Wiki
To get started in American Indian Research
Various Spellings: Navajo, Navaho
The Navajo Tribe is primarily associated with the states of Arizona, Utah, Colorado, and New Mexico.
Population: 1868: 10,000 1990: 220,000
Contents
Tribal Headquarters
Navajo Nation
P.O. Box 9000
Window Rock, AZ 86515
Phone: 928.871.6352
Fax: 928.871.4025
History
See the information on Navajo Nation, Arizona (Tribe)
Agencies
Reservations
Navajo Nation, Arizona (Reservation)
Superintendencies
See Navajo Nation, Arizona (Reservation)
Additional References to the History of the Tribe
Frederick Webb Hodge, in his Handbook of American Indians North of Mexico, gave a more complete history of the Navajo tribe, with estimations of the population of the tribe at various time periods.
See Navajo Nation, Arizona (Tribe)
Records
U.S. Census
The earliest census taken under the auspices of the Office of Indian Affairs was enumerated in 1885. Many of the census records thus recorded have been microfilmed and are available at the National Archives, all of the Regional Archives of the National Archives and Records Administration (NARA), and at the Family History Library in Salt Lake City. This set of Indian Census Rolls also are available online at Ancestry.com, which is a subscription web site. In order to locate the correct roll, one must know the residence of the family being sought. The following census rolls were recorded for the indicated agencies within the Navajo Nation. The names are as recorded in the microfilm copy created by the National Archives on their Microcopy M595 (692 rolls).
• Eastern Navajo -- 1929-1935
• Eastern Navajo Reservation -- 1937
• Hopi and Navajo Indians -- 1930-1936
• Leupp Agency -- 1915-1917, 1920-1925, 1927, 1929-1935
• Leupp Reservation -- 1937
• Navajo -- 1915, 1936, 1938-1939
• Navajo: (Moqui Pueblo or Hopi, and Navajo) -- 1885
• Northern Navajo -- 1930-1935
• Northern Navajo Reservation -- 1937
• Pueblo Bonito (Navajo Indians) -- 1909-1912, 1914-1924, 1926
• Pueblo Day Schools (Pueblo and Navajo) -- 1912-1919
• San Juan (Navajo) -- 1916
• Southern Navajo -- 1929-1935
• Southern Navajo Reservation -- 1937
• Western Navajo -- 1905, 1915-1920, 1922-1927, 1929
• Western Navajo: (Hopi Indians and Navajo and Paiute Indians for 1929) -- 1937
It is important to know the above names because that is the way they are listed in the Indian Census Rolls collection.
Enrollment
Tribal enrollment for the Navajo Nation is handled through:
Navajo Office of Vital Records P.O. Box 9000 Window Rock, AZ 86515 Telephone: 928-871-6386 or 928-729-4020
Everyone enrolled as a member of the Navajo Nation since 1925 has been assigned a tribal census number. Those records are also maintained by this office.
School
Historically, Navajo children have attended local public schools, day schools, boarding schools and mission schools. Each of these have their own sets of records, some of which have found their way into archives and historical societies. The Office of Indian Affairs (now Bureau of Indian Affairs) was charged with providing educational opportunities for Navajo pupils and identifying them through school census records and other means. Some of the schools attended by Navajo pupils include:
This is a very incomplete list of such schools. It does illustrate different types of schools available to Navajo children.
Treaties
• 1849 September 9,
• 1868 June 1, removal, reservation
Important Web Sites
Wikipedia has more about this subject: Navajo people
References
Bibliography
• Guide to Federal Records in the National Archives; Record Group 75, Records of the Bureau of Indian Affairs.
• Hodge, Frederick Webb. Handbook of American Indians North of Mexico. Washington, DC: Smithsonian Institution, 1906 Available online.
• Klein, Barry T., ed. Reference Encyclopedia of the American Indian. Nyack, New York: Todd Publications, 2009. 10th ed. WorldCat 317923332; FHL book 970.1 R259e.
• Malinowski, Sharon and Sheets, Anna, eds. The Gale Encyclopedia of Native American Tribes. Detroit: Gale Publishing, 1998. 4 volumes. Includes: Lists of Federally Recognized Tribes for U.S., Alaska, and Canada – pp. 513-529 Alphabetical Listing of Tribes, with reference to volume and page in this series Map of “Historic Locations of U.S. Native Groups” Map of “Historic Locations of Canadian Native Groups” Map of “Historic Locations of Mexican, Hawaiian and Caribbean Native Groups” Maps of “State and Federally Recognized U.S. Indian Reservations. WorldCat 37475188; FHL book 970.1 G131g.
Vol. 1 -- Northeast, Southeast, Caribbean
Vol. 2 -- Great Basin, Southwest, Middle America
Vol. 3 -- Arctic, Subarctic, Great Plains, Plateau
Vol. 4 -- California, Pacific Northwest, Pacific Islands
• Sturtevant, William C. Handbook of North American Indians. 20 vols., some not yet published. Washington, DC: Smithsonian Institution, 1978– .
Volume 1 -- Not yet published
Volume 2 -- Indians in Contemporary Society (pub. 2008) -- WorldCat 234303751
Volume 3 -- Environment, Origins, and Population (pub. 2006) -- WorldCat 255572371
Volume 4 -- History of Indian-White Relations (pub. 1988) -- WorldCat 19331914; FHL book 970.1 H191h v.4.
Volume 5 -- Arctic (pub. 1984) -- WorldCat 299653808; FHL book 970.1 H191h v.5.
Volume 6 -- Subarctic (pub. 1981) -- WorldCat 247493742; FHL book 970.1 H191h v.6.
Volume 7 -- Northwest Coast (pub. 1990) -- WorldCat 247493311
Volume 8 -- California (pub. 1978) -- WorldCat 13240086; FHL book 970.1 H191h v.8.
Volume 9 -- Southwest (pub. 1979) -- WorldCat 26140053; FHL book 970.1 H191h v.9.
Volume 10 -- Southwest (pub. 1983) -- WorldCat 301504096; FHL book 970.1 H191h v.10.
Volume 11 -- Great Basin (pub. 1986) -- WorldCat 256516416; FHL book 970.1 H191h v.11.
Volume 12 -- Plateau (pub. 1998) -- WorldCat 39401371; FHL book 970.1 H191h v.12.
Volume 13 -- Plains, 2 vols. (pub. 2001) -- WorldCat 48209643
Volume 14 -- Southeast (pub. 2004) -- WorldCat 254277176
Volume 15 -- Northwest (pub. 1978) -- WorldCat 356517503; FHL book 970.1 H191h v.15.
Volume 16 -- Not yet published
Volume 17 -- Languages (pub. 1996) -- WorldCat 43957746
Volume 18 -- Not yet published
Volume 19 -- Not yet published
Volume 20 -- Not yet published
Need additional research help? Contact our research help specialists.
Need wiki, indexing, or website help? Contact our product teams.
Did you find this article helpful?
You're invited to explain your rating on the discussion page (you must be signed in).
• This page was last modified on 19 May 2012, at 16:46.
• This page has been accessed 5,717 times.
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T08:49:17.000Z
|
a7g5yd3yb6ir6vnsc5nvwm7i3u5drzmf
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40269",
"uncompressed_offset": 385616275,
"url": "www.familysearch.org/learn/wiki/en/index.php?hidelinks=1&title=Special%3AWhatLinksHere%2FItaly_Civil_Registration-_Vital_Records",
"warc_date": "2013-11-22T19:24:16.000Z",
"warc_filename": "<urn:uuid:a5f9d007-fadd-4fa1-b0bb-dd2811a4fe26>",
"warc_url": "http://www.familysearch.org/learn/wiki/en/index.php?title=Special:WhatLinksHere/Italy_Civil_Registration-_Vital_Records&hidelinks=1"
}
|
cccc_CC-MAIN-2013-20
|
Pages that link to "Italy Civil Registration- Vital Records"
From FamilySearch Wiki
What links here
Filters Hide transclusions | Show links | Hide redirects
No pages link to Italy Civil Registration- Vital Records.
New to the Research Wiki?
In the FamilySearch Research Wiki, you can learn how to do genealogical research or share your knowledge with others.
Learn More
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T08:20:56.000Z
|
dyfvzu3wc2vqapq3pawv53ape4gx776u
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40274",
"uncompressed_offset": 415353461,
"url": "www.go4expert.com/forums/project-management-help-t20005/",
"warc_date": "2013-11-22T19:24:16.000Z",
"warc_filename": "<urn:uuid:a5f9d007-fadd-4fa1-b0bb-dd2811a4fe26>",
"warc_url": "http://www.go4expert.com/forums/project-management-help-t20005/"
}
|
cccc_CC-MAIN-2013-20
|
Project Management Help
Newbie Member
6Nov2009,10:52 #1
Hi,
Does anyone know of any project management web applications for small businesses that also do billing and CRM, and allow for an unlimited amount of projects and contacts? Oh and the applications have to be affordable too.
Thanks!
Newbie Member
27Nov2009,12:41 #2
so does anyone know of any affordable all in one solutions that do project management, crm, and billing?
Contributor
3Dec2009,16:07 #3
Try freshbooks.com. It has all the required features for small businesses. They have a free service as well, if you have just one or two clients..
Newbie Member
14Dec2009,13:45 #4
Its my understanding that freshbooks only does billing. can anyone suggest any affordable web apps that do project managment, billing, and crm?
Newbie Member
23Dec2009,02:40 #5
does anyone have any suggestions for a web app that does CRM, project management, and billing?
Go4Expert Member
31May2010,23:12 #6
You can also checkout "zoho". They provide free CRM, then you must pay to add on "commercial features" like project management, case management, etc...
- Ben
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T07:46:38.000Z
|
2mgcpukatcx5wvqjyrmefu2fliucoxf6
|
{
"content_type": "application/xhtml+xml",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40280",
"uncompressed_offset": 432082721,
"url": "www.hindawi.com/isrn/nanomaterials/2012/971854/ref/",
"warc_date": "2013-11-22T19:24:16.000Z",
"warc_filename": "<urn:uuid:a5f9d007-fadd-4fa1-b0bb-dd2811a4fe26>",
"warc_url": "http://www.hindawi.com/isrn/nanomaterials/2012/971854/ref/"
}
|
cccc_CC-MAIN-2013-20
|
About this Journal Submit a Manuscript Table of Contents
ISRN Nanomaterials
Volume 2012 (2012), Article ID 971854, 5 pages
doi:10.5402/2012/971854
Research Article
Study of J-E Curve with Hysteresis of Carbon Nanotubes Field Emitters
Department of Physics, Jamia Millia Islamia, New Delhi 110025, India
Received 7 June 2012; Accepted 15 July 2012
Academic Editors: J. Escrig, G. Jin, and A. Kajbafvala
Copyright © 2012 Shama Parveen et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Linked References
1. A. V. Eletskii, “Carbon nanotube-based electron field emitters,” Physics-Uspekhi, vol. 53, no. 9, pp. 863–892, 2010. View at Publisher · View at Google Scholar · View at Scopus
2. R. P. Raffaelle, B. J. Landi, J. D. Harris, S. G. Bailey, and A. F. Hepp, “Carbon nanotubes for power applications,” Materials Science and Engineering B, vol. 116, no. 3, pp. 233–243, 2005. View at Publisher · View at Google Scholar · View at Scopus
3. M. J. Fransen, T. L. van Rooy, and P. Kruit, “Field emission energy distributions from individual multiwalled carbon nanotubes,” Applied Surface Science, vol. 146, no. 1, pp. 312–327, 1999. View at Publisher · View at Google Scholar · View at Scopus
4. Y. Cheng and O. Zhou, “Electron field emission from carbon nanotubes,” Comptes Rendus Physique, vol. 4, no. 9, pp. 1021–1033, 2003. View at Publisher · View at Google Scholar · View at Scopus
5. J. M. Bonard, M. Croci, C. Klinke, R. Kurt, O. Noury, and N. Weiss, “Carbon nanotube films as electron field emitters,” Carbon, vol. 40, no. 10, pp. 1715–1728, 2002. View at Publisher · View at Google Scholar · View at Scopus
6. J. M. Bonard, F. Maier, T. Stöckli et al., “Field emission properties of multiwalled carbon nanotubes,” Ultramicroscopy, vol. 73, no. 1–4, pp. 7–15, 1998. View at Publisher · View at Google Scholar · View at Scopus
7. J. F. AuBuchon, C. Daraio, L. H. Chen, A. I. Gapin, and S. Jin, “Iron suicide root formation in carbon nanotubes grown by microwave PECVD,” Journal of Physical Chemistry B, vol. 109, no. 51, pp. 24215–24219, 2005. View at Publisher · View at Google Scholar · View at Scopus
8. S. Khan, K. N. Tripathi, M. Aggarwal, K. Tripathi, M. Husain, and Z. H. Khan, “Field emission properties of Fe70Pt30 catalysed multiwalled carbon nanotubes,” Journal of Experimental Nanoscience, vol. 2, no. 3, pp. 215–228, 2007. View at Publisher · View at Google Scholar · View at Scopus
9. J. Ali, A. Kumar, S. Husain, and M. Husain, “Effect of catalyst-deposition methods on the alignment of carbon nanotubes grown by low pressure chemical vapor deposition,” Nanoscience and Nanotechnology Letters, vol. 3, no. 2, pp. 175–178, 2011. View at Publisher · View at Google Scholar · View at Scopus
10. J. M. Rosolen, C. H. Patrick Poá, S. Tronto, M. S. Marchesin, and S. R. P. Silva, “Electron field emission of carbon nanotubes on carbon felt,” Chemical Physics Letters, vol. 424, no. 1–3, pp. 151–155, 2006. View at Publisher · View at Google Scholar · View at Scopus
11. S. Khan, Z. H. Khane, K. N. Tripathi, and M. Husain, “Synthesis of carbon nanotubes using Ni95Ti5 nanocrystalline film as a catalyst,” Journal of Nanoscience and Nanotechnology, vol. 7, no. 6, pp. 1855–1859, 2007. View at Publisher · View at Google Scholar · View at Scopus
12. S. Parveen, S. Husain, A. Kumar, J. Ali, and M. Husain, “Estimation of effective emitting area of carbon nanotubes based field emitters,” Nanoscience and Nanotechnology Letters, vol. 3, pp. 794–797, 2011.
13. J. Ali, A. Kumar, S. Husain, M. Kumari, Harsh, and M. Husain, “Characterization and field emission studies of uniformly distributed multi-walled carbon nanotubes (MWCNTS) film grown by low-pressure chemical vapour deposition (LPCVD),” Current Nanoscience, vol. 7, no. 3, pp. 333–336, 2011. View at Publisher · View at Google Scholar · View at Scopus
14. Y. H. Yang, C. Y. Wang, U. S. Chen, W. J. Hsieh, Y. S. Chang, and H. C. Shih, “Large-area single wall carbon nanotubes: synthesis, characterization, and electron field emission,” Journal of Physical Chemistry C, vol. 111, no. 4, pp. 1601–1604, 2007. View at Publisher · View at Google Scholar · View at Scopus
15. C. Li, G. Fang, X. Yang, N. Liu, Y. Liu, and X. Zhao, “Effect of adsorbates on field emission from flame-synthesized carbon nanotubes,” Journal of Physics D, vol. 41, no. 19, Article ID 195401, 2008. View at Publisher · View at Google Scholar · View at Scopus
16. K. A. Dean and B. R. Chalamala, “The environmental stability of field emission from single-walled carbon nanotubes,” Applied Physics Letters, vol. 75, no. 19, pp. 3017–3019, 1999. View at Scopus
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T08:50:29.000Z
|
rnssun5r6cquyrqecfany4ha55qpnmme
|
{
"content_type": "application/xhtml+xml",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40281",
"uncompressed_offset": 432090234,
"url": "www.hindawi.com/journals/aaa/2012/231349/cta/",
"warc_date": "2013-11-22T19:24:16.000Z",
"warc_filename": "<urn:uuid:a5f9d007-fadd-4fa1-b0bb-dd2811a4fe26>",
"warc_url": "http://www.hindawi.com/journals/aaa/2012/231349/cta/"
}
|
cccc_CC-MAIN-2013-20
|
About this Journal Submit a Manuscript Table of Contents
Abstract and Applied Analysis
Volume 2012 (2012), Article ID 231349, 15 pages
doi:10.1155/2012/231349
Research Article
Finite-Time Robust Stabilization for Stochastic Neural Networks
1Department of Mathematics and Applied Mathematics, Lianyungang Teacher's College, Lianyungang 222006, China
2School of Computer Science and Technology, Jiangsu Normal University, Xuzhou 221116, China
3School of Economics, Jiangsu Normal University, Xuzhou 221116, China
4College of Science, Nanjing University of Posts and Telecommunications, Nanjing 210046, China
Received 6 September 2012; Accepted 26 September 2012
Academic Editor: Ju H. Park
Copyright © 2012 Weixiong Jin et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
How to Cite this Article
Weixiong Jin, Xiaoyang Liu, Xiangjun Zhao, Nan Jiang, and Zhengxin Wang, “Finite-Time Robust Stabilization for Stochastic Neural Networks,” Abstract and Applied Analysis, vol. 2012, Article ID 231349, 15 pages, 2012. doi:10.1155/2012/231349
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T08:39:43.000Z
|
2izv6bkudvygu5roeiauwsi5p5zaz5cg
|
{
"content_type": "application/xhtml+xml",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40282",
"uncompressed_offset": 432095846,
"url": "www.hindawi.com/journals/ijdsn/2013/865154/",
"warc_date": "2013-11-22T19:24:16.000Z",
"warc_filename": "<urn:uuid:a5f9d007-fadd-4fa1-b0bb-dd2811a4fe26>",
"warc_url": "http://www.hindawi.com/journals/ijdsn/2013/865154/"
}
|
cccc_CC-MAIN-2013-20
|
About this Journal Submit a Manuscript Table of Contents
International Journal of Distributed Sensor Networks
Volume 2013 (2013), Article ID 865154, 14 pages
http://dx.doi.org/10.1155/2013/865154
Research Article
A Multipopulation Firefly Algorithm for Correlated Data Routing in Underwater Wireless Sensor Networks
1College of Information Engineering, Shanghai Maritime University, 1550 Haigang Avenue, Shanghai 201306, China
2Shanghai Key Laboratory of Intelligent Information Processing, 220 Handan Road, Shanghai 200433, China
Received 30 August 2012; Revised 3 December 2012; Accepted 31 January 2013
Academic Editor: Shabbir Merchant
Copyright © 2013 Ming Xu and Guangzhong Liu. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Abstract
Low data delivery efficiency and high energy consumption are the inherent problems in Underwater Wireless Sensor Networks (UWSNs) characterized by the acoustic channels. Existing energy-efficient routing algorithms have been shown to reduce energy consumption of UWSNs to some extent, but still neglect the correlation existing in the local data of sensor nodes. In this paper, we present a Multi-population Firefly Algorithm (MFA) for correlated data routing in UWSNs. We design three kinds of fireflies and their coordination rules in order to improve the adaptability of building, selecting, and optimization of routing path considering the data correlation and their sampling rate in various sensor nodes. Different groups of fireflies conduct their optimization in the evolution in order to improve the convergence speed and solution precision of the algorithm. Moreover, after the data packets are merged during the process of routing path finding, MFA can also eliminate redundant information before they are sent to the sink node, which in turn saves energy and bandwidth. Simulation results have shown that MFA achieves better performance than existing protocols in metrics of packet delivery ratio, energy consumption, and network throughput.
1. Introduction
Underwater Wireless Sensor Networks (UWSNs) have a lot of potential application areas such as oceanographic data collection, disaster prevention, pollution monitoring, offshore exploration, and military surveillance [13]. UWSN is a new area of wireless sensor network in underwater environments which has challenges to be overcome such as long propagation delay, severely limited bandwidth, and time-varying multipath propagation [46]. All the above distinct features of UWSNs give birth to new challenging areas for every level of the network protocol suite. UWSNs consist of a variable number of sensors and vehicles that are deployed to perform collaborative monitoring tasks over a given area. To achieve this objective, sensors and vehicles self-organize in an autonomous network in order to adapt to the characteristics of the underwater environment. Many problems arise with UWSNs that need to be solved in order to enable underwater monitoring in the new environment. Among them, providing efficient routing is very challenging due to the unique characteristics of UWSNs [7, 8]. UWSNs must rely on underwater acoustic communications because high-frequency radio signals used in traditional ground-based sensor networks can be rapidly absorbed by water. Compared with terrestrial wireless sensor networks, the channel of UWSNs has the following characteristics: (1) high bit error ratio caused by noise, multi-path loss and Doppler propagation; (2) high energy consumption; (3) limited bandwidth; (4) long and unstable delivery delay [9, 10]. Therefore, many research results in land-based sensor networks as well as traditional ad hoc networks cannot be applied to UWSNs directly, which requires new routing protocol to be designed for the new features of the UWSNs in order to ensure that the performance of UWSNs can meet the actual underwater environmental needs.
Low data delivery efficiency and high energy consumption are the inherent problems in UWSNs characterized by the acoustic channels. Acoustic channel imposes higher energy consumption as well as lower bandwidth than radio signal. Therefore, improving packet delivery ratio and energy efficiency for UWSNs becomes even more critical than in traditional sensor networks.
According to their architectures, the routing protocols of UWSNs can be divided into three categories: location-based routing, flat routing, and hierarchical routing [11]. Location-based routing has good scalability, but it requires a positioning system or positioning algorithm to help the nodes to calculate the location information. Flat routing protocols have better robustness, but the excessive overhead for maintaining routing information restricts their application to small-scale underwater acoustic circumstances. Hierarchical routing also has good scalability, but the cluster maintenance overhead and the failure of key nodes will affect the routing efficiency. Consequently, these routing protocols cannot fully meet performance requirements described above.
Firefly algorithm is the development of simulated evolutionary computation in the recent years [12]. It is simple, but appropriate to parallel processing with strong robustness, which extends its application to a number of fields such as solving economic dispatch and cryptography problems [1315]. As the characteristic of firefly intelligence is similar to that of UWSN’s self-organized property, this paper presents a Multi-population Firefly Algorithm (MFA) for correlated data routing in UWSNs. In MFA, three kinds of fireflies coordinate to improve the adaptability of building, selecting, and optimization of routing path considering the data correlation and their sampling rate in various sensor nodes. As a result, MFA minimizes the total data transmission volume and optimizes the routing path concurrently. Furthermore, in order to increase the energy efficiency in resource constraint underwater environment, MFA balances the energy consumption during the process of routing in case some sensor nodes exhaust their energy too early.
The remainder of the paper is organized as follows. Section 2 gives a brief overview of related work. Section 3 presents the network model, while Section 4 introduces the technical details of our routing protocol. Performance evaluation is described in Section 5. Finally, we conclude the paper in Section 6.
2. Related Work
Tan et al. [16] proposed a new protocol based on hop-by-hop hybrid; implicit/explicit acknowledgment scheme is proposed for a multihop UWSN. In the protocol, data packets forwarded by downstream nodes can work as implicit ACKs for previous transmitted data packets, (where ACK is an abbreviation that refers to the Acknowledgement to the receipt of data packet). Pompili et al. [17] introduced two distributed routing algorithms for delay-insensitive and delay-sensitive applications, respectively, with the objective of minimizing the energy consumption taking the varying condition of the underwater channel and the different application requirements into account. Vector-Based Forwarding (VBF) [18] is a geographic approach, which allows the nodes to weigh the benefit to forward packets and reduce energy consumption by discarding low benefit packets. Therefore, over a multi-hop path, only the nodes that are located within a pipe of given width between the source and the destination are considered for relaying. However, in the areas of low density of nodes VBF may not find the path close to the routing vector. Similarly, Jornet et al. [19] proposed Focused-Beam Routing (FBR) protocol that is suitable for networks containing both static and mobile nodes. The objective of FBR is to determine which nodes are candidates for relaying. Candidate nodes are those that lie within a cone of angle ± emanating from the transmitter towards the final destination. An RTS/CTS handshake is set up to isolate closer nodes within this cone. If a node determines that it is within the transmitter’s cone, it will respond to the RTS. Those nodes that are outside the cone will not respond. A theoretical argument supporting geographic routing has been discussed in [20] based on simple propagation and energy consumption models for underwater networks. In view of this, several position-based routing algorithms are proposed and compared; results show that selecting relays closer than a given maximum distance before seeking farther ones achieves in fact optimal energy consumption.
Depth-Based Routing (DBR) [21] can handle network dynamics efficiently without the assistance of a localization service. DBR forwards data packets greedily towards the water surface (i.e., the plane of data sinks). In DBR, a data packet has a field that records the depth information of its recent forwarder and is updated at every hop. But DBR has only greedy forwarding mode, which alone is not able to achieve high delivery ratios in sparse areas. A similar idea can be found in [22], a hydraulic pressure-based anycast routing protocol that exploits the measured pressure levels to route data to surface buoys where relays are chosen based on a weighted average of advancement towards the sources and probability of packet delivery, and an efficient underwater dead end recovery method is added to handle the absence of a relay node at lower depth than the current packet holder. Yang and Ssu [23] designed an energy-efficient routing protocol called EUROP, where they tried to reduce large amount of energy consumption by reducing broadcast hello messages. The sensor nodes use RREQ and RREP packets to communicate with each other, and the next hop can be determined by the rule of from deep to shallow and so on. In EUROP, installing the depth sensor and electronic module is not a simple decision because cost per node will increase and the additional devices will burden the critical node energy, hence decreasing the life of the sensor node.
In order to remove the constraints imposed by special hardware (e.g., every node should be equipped with depth or pressure sensor, which not only increases the cost of the network but also becomes a burden for extra energy consumption), Ayaz and Abdullah [24] proposed a Hop-by Hop-Dynamic Addressing Based (H2-DAB) routing protocol to provide scalable and time efficient routing for UWSN. The H2-DAB routing protocol does not require any dimensional location information or any extra specialized hardware compared with many other routing protocols in the same area. Dynamic addresses are used for sensor nodes in order to solve the problem of water currents, so that sensor nodes will get new addresses according to their new positions at different depth intervals. However, the problem of multi-hop routing still exists as it is based on multi-hop architecture, where nodes near the sinks drain more energy because they are used more frequently. Domingo [25] presented a distributed energy-aware routing protocol called DUCS (Distributed Underwater Clustering Scheme) where the whole network is divided into clusters using a distributed algorithm. Sensor nodes are organized into local clusters where one node is selected as a cluster head for each. After receiving the data packets from all the cluster members, cluster head performs signal processing function like aggregation on the received data and transmits them towards the sink using multi-hop routing through other cluster heads. DUCS achieves a relatively high packet delivery ratio and reduces the network overhead. But frequent division of sectors can be a burden on the network as the setup phase is repeated many times. Moreover, during the network operation phase, a cluster head can only transmit its collected data towards another cluster head, which restricts its flexibility and availability. For example, when water currents move two cluster head nodes away, they cannot communicate directly even if a few noncluster head nodes are available between them.
Packet redundancy and multiple paths can be exploited in order to increase the reliability of UWSNs. Ayaz et al. [26] provided a two-hop acknowledgment reliability model in order to insure the reliable data deliveries to the surface sinks, where two copies of the same data packet are maintained in the network without extra burden on the available resources. A relay node that has data packets to forward will not reply the acknowledgment until it cannot find the next hop towards the destination. But if a node is unable to find the next hop due to any failure, or even if it is lost, then packets in the buffer are not considered lost. All the nodes that send the data packets towards this node will wait for a certain amount of time before trying again for the next hop. Xu et al. [27] proposed a Multiple-path Forward Error Correction (M-FEC) approach that integrated multiple-path communications and Hamming Coding to eliminate retransmission and enhance reliability in underwater sensor networks. Moreover, a Markov model and a dynamical decision and feedback scheme were developed to decrease the number of the paths in order to save energy and ensure the desirable packet error rate. However, M-FEC may cause much long delay because of additional process of encoding and decoding the data packets, and it does not tackle the issues of node and link failures.
3. Network Model
The routing algorithm to be presented in this paper is built on a Peer-to-peer- (P2P-) based UWSN platform that consists of acoustic sensor nodes, relay nodes, sink nodes, and P2P nodes as shown in Figure 1.
Figure 1: The architecture of a P2P-based UWSN platform.
Acoustic sensor nodes are deployed in the monitoring region, which are responsible for data collection, processing, and communications. Each acoustic sensor node has two data communication interfaces. One is acoustic communication interface, through which the acoustic transducer can communicate with acoustic sensor nodes and others; the other interface can be used to connect relay nodes through CAN (Controller Area Network) bus or UART (Universal Asynchronous Receiver/Transmitter). When acoustic sensors are transmitting data, they deliver nodes’ states and data to relay nodes at the same time. The adoption of relay nodes makes the underwater nodes free from the bondage of cables, facilitating the deployment and control of underwater acoustic sensors and improving the structural integrity and robustness of UWSN. It can also expand the scope of monitoring. Relay nodes send information to sink nodes through wireless communication. At last, sink nodes communicate with P2P nodes through the serial ports and collect data to P2P nodes from various acoustic sensor nodes. After data stream arrives at P2P nodes, it will be put into the appropriate queue scheduler, where it can be processed by multithread operation processor. After that, the results will be sent to the router, which will decide the direction of the data: passing to archive or processing for output. Load balance strategies are used for preventing the platform from overloading. If the system performance is rather low, it notifies the load balancer, which will take measures to reduce the load on the system until it reaches the normal. The arriving data stream is dynamic. So even if the average load of a node is not high, a node is still likely encountering a temporary peak loads in the busy period, which extends its waiting time for data processing. Therefore, in order to minimize the data processing time, appropriate load balancing strategy is needed to avoid overloading.
We consider that UWSNs are composed of a large number of nodes uniformly scattered in monitoring fields and represented by . The sensor nodes are assumed static, or they have low mobility with respect to signal propagation speed. Every sensor node has the same transmission range and each sensor node is able to communicate with other sensor nodes within its range. We also assume that each node is assigned with a triplet of coordinates (, , ), where each coordinate represents the hop distance of the node from one anchor. We assume that the set of sensor nodes is represented as a set with . All sensor nodes have the same communication range of , which is represented as a sphere volume of radius in UWSNs. Moreover, we assume all sensor nodes know their own locations through a certain localization service [28]. Such assumption is justified in underwater systems where fixed bottom-mounted nodes have location information upon deployment. In fact, the underwater localization is a nontrivial task for which relatively very few options are available. For example, employing Global Positioning System (GPS) does not work well because Radio Frequency (RF) waves are heavily attenuated in underwater environment. Many researchers have proposed a variety of localization schemes and techniques to address this issue specially [29, 30]. It is not always feasible to deploy anchor nodes at the sea floor for deep water environment. In this case, mobile beacon nodes such as Autonomous Underwater Vehicles (AUVs), which are equipped with internal navigation systems, are exploited as reference nodes to assist in corresponding distributed localization algorithms. This paper takes advantage of these research results as existing preconditions.
Definition 1. The function defines the distance between two nodes and in a 3D Euclidean space as
Two nodes and are neighbors and connected by a link if and the link between and is denoted by . We construct the network topology with Relative Neighborhood Graph (RNG) [31], then two nodes become neighbor nodes if and only if for any arbitrary node , . For a three-dimensional Euler space embedded, if the arcuate area formed by the intersection of two spheres centered at and (with radius ) is empty, then and are adjacent nodes. RNG algorithm is simple and is easily built in a distributed way. There is no crossing edges in an RNG because at least one edge in any pair of crossing edges must be removed according to their definitions, and the time complexity is . While constructing from a Delaunay Triangulation Graph structure, its complexity of lower bound is [32]. In addition, a computational method with the complexity of for the RNG in a three dimensional space is given in [33]. As underwater sensors float with currents, their movements are constrained in different horizontal planes and they are likely to maintain a steady position relative to each other. The construction of RNG does not require that the exact positions of nodes and their neighbors are known. For each node, only the corresponding mutual distances to its neighbors are required. Therefore, RNG is expected to be more suitable in modeling UWSN, which achieves more accurate results and behaves more consistently than other models.
Considering two sensor nodes at minimum hop distance , there exist two values and such that the Euclidean distance between the two nodes is bounded, that is, . The quality of the bounds depends on the network density . In particular for each it holds that where is the transmission range of the sensors nodes.
Sensing devices generally have widely different theoretical and physical characteristics. Thus, numerous models of varying complexity can be constructed based on application needs and device features. However, for most kinds of sensors, the sensing ability diminishes as distance increases.
Definition 2. Given a source sensor node and a destination sensor node , then the sensor model is defined as with and , where is the signal amplitude, is the sensor technology dependent parameter and is a predefined parameter, for handling the situation when the source node and the destination node locate at the same position.
4. Routing Protocol
4.1. Data Correlation and Energy Consumption Model
Data aggregation is important in energy constraint UWSNs where spatial and temporal correlations as well as redundant data can be detected to reduce the number of packets exchanged in the network. In this paper, spatial correlation means that multiple sensor nodes in a nearby region record the same or similar data about a single event; whereas temporal correlation means that the change pattern of the data in current sensor node is equal or similar to the data observed at previous times, and the degree of correlation between consecutive observations may vary according to the temporal variation characteristics of the phenomenon.
Given two sensor node sets and , where . When packets in all sensor nodes of the set can be correctly received by the sensor nodes in the set , it means the data can be aggregated from the set to the set .
Definition 3. Given a data sequence about the value of the field being measured with the sampling time , then the -step self-correlation of this data sequence is defined as
Definition 4. Given two data sequences and about the value of the field being measured with the sampling time then the -step cross-correlation of these two data sequences is defined as
Given a sensor node and its homogenous neighbor node set , then the correlation combination of the data sequence generated by and the data sequences generated by its homogenous neighbor node are called homogenous data correlation (). Similarly, given a sensor node and its heterogenous neighbor node set , then the correlation combination of the data sequence generated by and the data sequences generated by its heterogenous neighbor node set () are called heterogenous data correlation ().
The correlated data packets can be merged in order to decrease communication traffic, which in turn cuts down the overall energy consumption of the network. Suppose is the data packet created at the sensor node , and is the data packet created at ’s neighbor . Let and denote the size of these two packets. When they meet together, they are merged into a new packet and its size is calculated as where denotes the correlation coefficient between the data packet and the data packet .
Let denote the set of neighbors of node , then the neighbors that are closer to the sink node are called downstream nodes of , which is represented as . Similarly, the set of upstream nodes of is denoted by . During the routing process, a sensor node usually forwards the data packets created in the upstream nodes or local nodes to the downstream nodes. Suppose denotes the ratio of packets sent from the upstream nodes of to the node and denotes the ratio of packets sent from the node to the node ; then we get where the node is the upstream node compared with the node .
Let and denote the transmission rate of the node and the node ; then where denotes the data generating rate of node , and denotes the average correlation coefficient between the packets at the node and the packets at the node . Therefore, denotes the transmission rate that is forwarded from the upstream nodes of to the node , and denotes the transmission rate that is directly generated by the set of upstream nodes of .
Acoustic signal has different transmission modes in shallow water (where the depth of the water is less than 100 meters) and deep water (where the depth of the water is more than 100 meters). In shallow water, the transmission of the acoustic signal is limited to a cylindrical area from the bottom to the surface. The energy consumption for transmission in the shallow water is calculated as where denotes the Euler distance between the sender and the receiver, and is the absorption coefficient.
In deep water, the transmission of the acoustic signal is mainly with spherical diffusion. The energy consumption is caused by spherical diffusion and water absorption, which can be calculated as
4.2. Routing Algorithm
Routing in UWSNs has its own particularity. Firstly, computation, storage, and communication capabilities of the sensor nodes are relatively weak, and therefore cannot be achieved on a complex routing algorithm. Secondly, UWSNs have data-centric architectures, which are different from those choosing the path according to nodes addresses in the traditional networks. Firefly algorithm uses the points of the search space to simulate firefly individuals in nature and transfers the process of search and optimization into the process of firefly individuals attraction and move. It simulates solving problems in the objective function metrics into the pros and cons of the individual location. It continues to change the decision-making domain size based on the number of neighbor nodes with a strong global search ability and convergence.
Firefly algorithm has two essential factors: fluorescence intensity and attractiveness. Fluorescence intensity reflects the pros and cons of the firefly location and determines its direction of movement, while the degree of attractiveness determines the distance that a firefly has moved. Fluorescence intensity and attractiveness are constantly updated in order to achieve the objective of optimization. From the mathematical point of the view, the optimization mechanism of the firefly is described as follows.
Definition 5. Fluorescence intensity of a firefly is defined as where is the original fluorescence intensity at the location of , and is the fluorescence absorption coefficient.
As firefly attractiveness is proportional to the fluorescence intensity seen by adjacent fireflies, we can now define the attractiveness of a firefly as follows.
Definition 6. Attractiveness of a firefly is defined as where is the distance between each two fireflies and is their attractiveness at , that is, when two fireflies are found at the same point of search space.
The distance between any two fireflies and at and can be expressed as Cartesian distance . The firefly ’s displacement that is attracted to another more attractive firefly is determined by which is randomized with the vector of random variable being drawn from a Gaussian distribution and step factor . The movements of underwater sensors are driven not only by the float of water, but also by other uncertain factors such as tides, animal interference, and ships. Therefore, it is not easy to build a precise kinematic model to characterize the underlying mobility patterns of the underwater sensors. For simplicity, we assume that the sink nodes are stationary and other sensor nodes follow the random-walk mobility pattern in simulations. The firefly’s displacement is used to capture the network mobility properties.
In order to realize the multi-population firefly-based routing protocol, we define three kinds of fireflies: searching firefly, listening firefly, and updating firefly.
Definition 7. Searching firefly (): each sensor node can create one or more searching fireflies, which can move among the nodes in the network and store the collected sensor nodes’ information into its mobile data stack () in order to share with other searching fireflies.
The task of is to find a routing path from the source node to the sink. When a source node creates an , it also gives a TTL value to this and the value decreases by 1 after this moves from one node to another. When the TTL value equals 0 or this moves to a sink node, then the lifetime of this is terminated. As TTL value can affect the performance of packet delivery ratio, energy consumption, and network throughput of different routing protocols in UWSNs, we have conducted a couple of simulations to reveal their quantitative relationships. The default TTL value is empirically set to 6 according to the size of region and the number of sensor nodes in simulation. Therefore, the choice of TTL value is not related to the type of data and its temporal/spatial correlation.
Definition 8. Listening firefly (): each sensor node in wakeup state owns a listening firefly, which is responsible for listening the information of mobile data stack in searching firefly and changing its routing path.
The searching firefly decides its moving direction according to the fluorescence intensity of the listening fireflies in its neighbor nodes. Suppose node has a searching firefly and, ’s neighbor node has a listening firefly . The probability that moves to the node is where is the neighbor set of node .
When the searching firefly moves to the node in the routing path, the listening firefly at the node loses part of fluorescence and the wastage can be calculated as where represents the fluorescence depletion rate. The listening firefly at the node loses its fluorescence only when other searching fireflies move to the node if is a source node. In these cases, the node is considered as a relay node that belongs to other routing paths.
When two searching fireflies created by the same source node meet at the same node, then the searching firefly with smaller TTL value stops moving and transfers its mobile data stack to the listening firefly at this node. The searching firefly with bigger TTL value continues to search until it reaches a sink node or runs out its lifetime.
Definition 9. Updating firefly (): Each sink node can create an updating firefly after a searching firefly’s arriving, which is in charge of updating the fluorescence intensity of the nodes along the routing path for further selection and optimization of the routing path.
When the searching firefly reaches a sink node, an updating firefly is created to update the fluorescence intensity of the nodes along the routing path. The initial fluorescence intensity of the updating firefly is where is the fluorescence intensity of the searching firefly at the sink node. represents the fluorescence update rate. When an updating firefly moves to a node in the routing path, it will transfer a few fluorescence to the listening firefly at that node and the quantity is where is a random node in the routing path .
Algorithm 1 describes our Multi-population Firefly Algorithm for correlated data routing in detail.
Algorithm 1: Multi-population Firefly Algorithm (MFA).
In order to prevent flooding, all packets at the relay nodes should have limited lifetime, which are controlled by TTL (Time-To-Live) information. At first, the routing path mes.path is set to empty after initialization and the node retrieves the message mes as described from line 1 to line 2. If mes hits at the node , then will create an updating firefly according to (16). After that, travels along the routing path and updates listening firefly’s fluorescence intensity for each node it visited according to (17). Otherwise, mes.path will be added to the mobile data stack of the current routing node. And then, the routing path mes.path is returned, which indicates a successful routing process is finished as described from line 3 to line 12. If the node is not the sink node, then will retrieve a data packet and create a searching firefly in order to find a routing path. And then, is added to the routing path mes.path. In the next procedure, moves to the neighbor node according to (14) and calculates the displacement value according to (13). At the same time, the listening firefly ’s fluorescence intensity at the node should be updated according to (15) as described from line 13 to line 21. Moreover, the data correlation of packet is checked with the data in the neighbor nodes. If their correlation relationship is within the predefined correlation threshold interval, then the two packets are merged into a new packet. For the sake of saving energy, the corresponding node will decrease its sampling rate as calculated according to line 29, where denotes the extent of sampling rate variation. Otherwise, if their correlation relationship is beyond the predefined correlation threshold interval, then the two packets will execute union operation. And then, the corresponding node will increase its sampling rate as calculated according to line 32 in order to improve data processing speed. After that, the data packet is sent to the node and the TTL value is decreased by 1 for the next iteration process as described from line 34 to line 39. If the TTL value equals 0, then the routing path mes.path is also returned as described from line 40 to line 44.
When traditional firefly algorithm runs at its late stage, individual firefly may hover near the peak or even oscillate. In addition, when the search space is too larger or distributes with uneven density, some fireflies’ neighbor set becomes empty set, which results in slow convergence and easily falls into local optimum. In our multi-population firefly-based routing algorithm, after defining three kinds of firefly groups, different groups of fireflies access the information not only from their own group, but also from other fireflies groups to conduct their own optimization in the evolution. In this way, three groups of fireflies coevolve in order to improve the convergence speed and solution precision of the algorithm.
Collision occurs when two or more nodes send data at the same time over the same transmission channel. Medium Access Control (MAC) protocols have been developed to assist each node to decide when and how to access the channel, which allows the sensor nodes to transmit data packets on the basis of a predefined schedule that will not cause the packet collision. If underlying MAC protocols are not available or out of service, MFA can adopt a round-robin scheduling method in order to avoid collision. The whole process is divided into two phases: round determination phase and timeslot allocation phase. During the routing process, each node calculates its round number based on the hops in current routing path and each round is scheduled sequentially. As a result, a downstream node usually gets bigger round number than an upstream node does. After that, each node will assign timeslots in pairs with its neighbors for packet transmission. The length of each round is determined by the number of timeslots that are necessary to avoid conflicts. Due to nonuniform deployment, some nodes may experience high traffic loads and cause more collisions than other nodes. Therefore, the number of timeslots varies from one round to another and is proportional to the fluorescence intensity of the listening fireflies in the neighbors. In this way, the initial setting of timeslot values may not be suitable for every node in the network. It achieves better collision avoidance as MFA approaches optimization in the evolution.
MFA requires location awareness of neighbors, but no topology information needs to be exchanged among neighboring nodes. It is a localized and distributed routing algorithm.
4.3. Theoretical Analysis
Suppose all sensor nodes are evenly deployed in a monitoring region with size . The transmission range of each sensor node is . The average node degree is . We use to denote the routing pipe radius in VBF and () to denote the average path length in MFA. The comparison of the complexity of different routing protocols is listed in Table 1.
Table 1: The complexity of different routing protocols.
In the best case, MFA achieves the best routing performance among three routing protocols. This happens when searching flies find a shortest path from the source node to the sink. In the worst case, DUCS needs more routing hops than others because cluster head nodes may not always reachable and have to be selected again from normal nodes. MFA consumes the most memory space because each searching fly needs to store the collected sensor nodes’ information into its mobile data stack along the routing path. But memory consumption is not a burden in MFA as the length of the routing path is restricted by the TTL value and the average node degree in UWSN is usually not high.
5. Performance Evaluation
5.1. Simulation Settings
We use Aqua-Sim [34] as simulation framework to evaluate our approach. The data packets are also generated by the simulator. Aqua-Sim is an -2-based underwater sensor network simulator developed by underwater sensor network lab at University of Connecticut. Aqua-Sim can simulate the attenuation and propagation of acoustic signals. It can also simulate packet collision in underwater sensor networks.
Simulation parameters and their default values are listed in Table 2. We assume that the sink nodes are stationary and the sensor nodes follow the random-walk mobility pattern. Each sensor node randomly selects a direction and moves to the new position with a random speed between the minimal speed and maximal speed, which are 1 m/s and 5 m/s, respectively.
Table 2: Simulation parameters and their default values.
We use the following metrics to evaluate the performance of routing protocols: (1)Packet delivery ratio is defined as the ratio of the number of distinct packets received successfully at the sinks to the total number of packets generated at the source node; although a packet may reach the sinks several times, these redundant packets are considered as only one distinct packet. (2)Energy consumption takes into account the total energy consumed in packet delivery, including transmitting, receiving, and idling energy consumption of all nodes in the network. (3)Network throughput equals the total data bits received at the sinks divided by the simulation time.
We compared the performance of Multi-population Firefly Algorithm (MFA) with that of Vector-Based Forwarding (VBF) protocol and Distributed Underwater Clustering Scheme (DUCS). As MFA and DUCS exploit data aggregation to eliminate redundancy in order to enhance their routing performance, we conducted a couple of simulations to reveal their quantitative relationships and the correlation coefficients are set from 0.0 to 1.0 with a fixed interval of 0.1. In order to evaluate other metrics, the correlation coefficients are set to a medium value that equals to 0.5 in MFA and DUCS.
5.2. Simulation Results
In the first set of simulations, we compared the packet delivery ratio with the number of nodes in different routing protocols. The TTL value for each protocol is set to 6. As shown in Figure 2, the packet delivery ratio of three routing protocols is proportional to the number of nodes. MFA performs better than other routing protocols in the same circumstances. When the number of nodes does not exceed 400, the packet delivery ratio of DUCS is higher than that of VBF, but the result reverses as the number of nodes is more than 400 because DUCS needs more operations for the maintenance of clusters. Specifically, MFA improves 17.3% of the packet delivery ratio than that of DUCS and 19.6% of the packet delivery ratio than that of VBF on average.
Figure 2: Packet delivery ratio versus number of nodes.
Figure 3 illustrates the comparison of the packet delivery ratio with the TTL value in different routing protocols. The number of nodes is set to 400 for each protocol. The packet delivery ratio of three routing protocols is proportional to the TTL value. MFA achieves higher packet delivery ratio than that of DUCS and VBF when their TTL values are the same. When the TTL value does not exceed 5, the packet delivery ratio of VBF is higher than that of DUCS, but the result reverses as the TTL value reaches 6 and above because with the increase of the TTL value, VBF takes more cost in order to find the path close to the routing vector. Overall, MFA improves 11.8% of the packet delivery ratio than that of DUCS and 13.6% of the packet delivery ratio than that of VBF on average.
Figure 3: Packet delivery ratio versus TTL value.
Figure 4 shows the comparison of the packet delivery ratio with the correlation coefficient in different routing protocols. The TTL value is set to 6 and the number of nodes is set to 400 for each protocol. MFA performs better than other routing protocols in the same circumstances. The packet delivery ratio of MFA and DUCS is proportional to the correlation coefficient, while the packet delivery ratio of VBF is fixed to 57% as VBF does not exploit data aggregation during the routing process. When the correlation coefficient does not exceed 0.3, the packet delivery ratio of DUCS is lower than that of VBF. When the correlation coefficient is not less than 0.4, the packet delivery ratio of DUCS is higher than that of VBF, which means the using of data aggregation technique is effective for improving the performance of DUCS. On average, MFA improves 14.1% of the packet delivery ratio than that of DUCS and 14.8% of the packet delivery ratio than that of VBF.
Figure 4: Packet delivery ratio versus correlation coefficient.
In the second set of simulations, we compared the energy consumption with the number of nodes in different routing protocols. As shown in Figure 5, the energy consumption of three routing protocols is proportional to the number of nodes. MFA performs better than other routing protocols in the same circumstances. Moreover, the curve of MFA has more gentle slope compared with that of DUCS and VBF. Specifically, when the number of nodes increases from 100 to 600, the energy consumption growth rate of MFA is 37.5%, while the energy consumption growth rates of DUCS and VBF obtain 52.5% and 58.2%, respectively. Overall, MFA decreases 25.7% of the energy consumption than that of DUCS and 38.8% of the energy consumption than that of VBF on average.
Figure 5: Energy consumption versus number of nodes.
Figure 6 illustrates the comparison of the energy consumption with the TTL value in different routing protocols. The number of nodes is set to 400 for each protocol. The energy consumption of three routing protocols is proportional to the TTL value. MFA consumes less energy than that of DUCS and VBF when their TTL values are the same. Moreover, the curve slope of MFA is gentler than that of DUCS and VBF. For example, when the TTL value is 3, MFA consumes 84.6% of the energy more than that of DUCS and 77.9% of the energy more than that of VBF; when the TTL value reaches 10, MFA consumes 67.2% of the energy more than that of DUCS and 53.1% of the energy more than that of VBF. On average, MFA decreases 28.1% of the energy consumption less than that of DUCS and 34.4% of the energy consumption less than that of VBF.
Figure 6: Energy consumption versus TTL value.
Figure 7 shows the comparison of the energy consumption with the correlation coefficient in different routing protocols. The TTL value is set to 6 and the number of nodes is set to 400 for each protocol. MFA performs better than DUCS and VBF in the same circumstances. The energy consumption of MFA and DUCS is inversely proportional to the correlation coefficient, while the energy consumption of VBF is fixed to 1.49 × 104 mJ as VBF does not exploit data aggregation during the routing process. With the aid of data aggregation, DUCS eliminates redundant information before they are sent to the sink nodes, which makes it save 18.9% of the energy compared with that of VBF. With the increase of correlation coefficient, the curve of MFA indicates sharper decline than that of DUCS, which means MFA is more effective than DUCS in cutting down the energy consumption. Overall, MFA decreases 25.4% of the energy consumption less than that of DUCS and 39.5% of the energy consumption less than that of VBF on average.
Figure 7: Energy consumption versus correlation coefficient.
In the third set of simulations, we compared the network throughput with the average data rate in different routing protocols. The TTL value is set to 6 and the number of nodes is set to 400 for each protocol. As shown in Figure 8, the network throughput of three routing protocols is proportional to the average data rate. The front parts of the curves indicate rapid increases in network throughput while the rear parts of the curves show very slow growth rates after average data rate is above some value. The reason is that each node is responsible for sending its own traffic towards the sink nodes as well as forwarding all traffic from its upstream nodes towards the sink nodes. But both upstream nodes and downstream nodes have the same packet generating rates, and downstream nodes cannot receive packets from several of its upstream nodes simultaneously. MFA performs better than other routing protocols in the same circumstances. When the average data rate does not exceed 800 bits/s, the network throughput of VBF is higher than that of DUCS, but the result reverses as the average data rate is above 1 k bits/s, which means that DUCS can obtain more benefit than VBF when the average data rate is relatively high. On average, MFA improves 13.5% of the network throughput more than that of DUCS and 15.2% of the network throughput more than that of VBF.
Figure 8: Network throughput versus average data rate.
Figure 9 illustrates the comparison of the network throughput with the number of nodes in different routing protocols. The TTL value is set to 6 for each protocol. The network throughput of three routing protocols is proportional to the number of nodes. MFA achieves higher network throughput than that of DUCS and VBF when the number of nodes are the same. When the number of nodes is below 400, the network throughput of DUCS is higher than that of VBF, but the result reverses as the number of nodes reaches 500 and above because in the high density network, VBF contains more candidate sensor nodes that are close to the routing vector for the packet delivery. Overall, MFA improves 21.6% of the network throughput more than that of DUCS and 25.6% of the network throughput more than that of VBF on average.
Figure 9: Network throughput versus number of nodes.
Figure 10 depicts the comparison of the network throughput with the TTL value in different routing protocols. The number of nodes is set to 400 for each protocol. The network throughput of three routing protocols is proportional to the TTL value. MFA achieves higher network throughput than that of DUCS and VBF when their TTL values are the same. When the TTL value does not exceed 5, the packet delivery ratio of VBF is higher than that of DUCS, but the result reverses as the TTL value reaches 6 and above, which means the network throughput of VBF is restrained as the TTL value becomes relatively high. Specifically, MFA improves 16.7% of the network throughput than that of DUCS and 16.3% of the network throughput than that of VBF on average.
Figure 10: Network throughput versus TTL value.
5.3. Discussion
Compared to algorithms such as VBF and DUCS, the firefly inspired algorithm MFA represents a radically different approach. In VBF, only the sensor nodes located in a predefined routing pipe are eligible for packet forwarding, and those which are not close to the routing pipe do not forward the packets no matter whether they are suitable for building a shorter routing path or not. Therefore, the packet delivery ratio in VBF mainly depends on the node density and it cannot benefit from the deployment of multiple sink nodes if they are not close to each other. DUCS organizes the sensor nodes into clusters and one sensor node is selected as a single cluster head for each cluster. Each cluster head is responsible for processing data aggregation received from cluster member nodes and relaying packets to other cluster heads until a sink node is reached, which restricts its flexibility and availability when adjacent cluster heads cannot communicate directly for uncertain reasons. In MFA, three kinds of fireflies cooperate to find an optimized routing path. The searching firefly is in charge of finding a reachable path from the source node to the sink node with a predefined TTL value. The listening firefly is used to guide the movement of the searching firefly according to its fluorescence intensity. If a data packet cannot arrive at a sink node within TTL hops, the lost fluorescence would not be replenished. Otherwise, the sink node generates an updating firefly and transfers some fluorescence to the listening firefly at each node along the routing path. As a result, the successful routing path is strengthened while the unsuccessful routing path becomes more unattractive, which brings a higher packet delivery ratio in MFA compared with VBF and DUCS regardless of node density. The inherent adaptive nature of such algorithm is one of the main attractions of biologically inspired approaches.
MFA also consumes less energy compared with VBF and DUCS. The reason is that MFA merges the data packets according to their correlation coefficient before they are sent to the sink node, which in turn eliminates redundant information and saves nodes’ residual energy. VBF does not exploit data aggregation during the process of routing. DUCS adopts aggregation techniques for extracting nonredundant data in clusterheads, but in order to avoid fast draining the batteries of specific sensor nodes, frequent division of clusters is needed, which can be a burden on the network as the setup phase is repeated many times. Therefore, MFA is more effective than DUCS in cutting down the energy consumption.
MFA achieves higher network throughput than that of DUCS and VBF. The reason lies in two aspects. First, the higher packet delivery ratio in MFA ensures more effective data packets arrive at the sink nodes, while unsuccessful data packet delivery does not contribute to the network throughput. Second, with the convergence of the algorithm, many overlapping edges in different routing paths emerge in MFA. Thus, some searching fireflies may have higher probability of choosing shorter paths to the sink nodes.
6. Conclusion
In order to improve the routing efficiency of UWSNs, this paper proposed a Multi-population Firefly Algorithm (MFA) for correlated data routing. We have designed three kinds of fireflies and their coordination rules in order to improve the adaptability of building, selecting, and optimization of routing path considering the data correlation and their sampling rate in various sensor nodes. Different groups of fireflies access to information not only from their own groups, but also from other firefly groups to conduct their optimization in the evolution. Moreover, in consideration of spatial and temporal correlations, MFA merges the correlated data packets during the process of routing, which in turn eliminates redundant information before they are sent to the sink nodes for saving energy and bandwidth. We have demonstrated through simulations that MFA achieves better performance than existing protocols in metrics of packet delivery ratio, energy consumption, and network throughput.
Acknowledgments
This work was sponsored by the National Natural Science Foundation of China (61202370), the Shanghai Pujiang Program from Science and Technology Commission of Shanghai Municipality (11PJ1404300), the Open Program of Shanghai Key Laboratory of Intelligent Information Processing (IIPL-2011-008), and the Science and Technology Program of Shanghai Maritime University (20110049).
References
1. R. B. Manjula and S. M. Sunilkumar, “Issues in underwater acoustic sensor networks,” International Journal of Computer and Electrical Engineering, vol. 3, no. 1, pp. 1793–8163, 2011.
2. J. H. Cui, J. Kong, M. Gerla, and S. Zhou, “The challenges of building scalable mobile underwater wireless sensor networks for aquatic applications,” IEEE Network, vol. 20, no. 3, pp. 12–18, 2006. View at Publisher · View at Google Scholar · View at Scopus
3. Z. H. Jiang, “Underwater acoustic networks-issues and solutions,” International Journal of Intelligent Control and Systems, vol. 13, no. 3, pp. 152–161, 2008.
4. S. Basagni, C. Petrioli, R. Petroccia, and M. Stojanovic, “Optimized packet size selection in underwater wireless sensor network communications,” IEEE Journal of Oceanic Engineering, vol. 37, no. 3, pp. 321–337, 2012.
5. J. M. Jornet, M. Stojanovic, and M. Zorzi, “On joint frequency and power allocation in a cross-layer protocol for underwater acoustic networks,” IEEE Journal of Oceanic Engineering, vol. 35, no. 4, pp. 936–947, 2010. View at Publisher · View at Google Scholar · View at Scopus
6. C. Detweiler, M. Doniec, I. Vasilescu, and D. Rus, “Autonomous depth adjustment for underwater sensor networks: design and applications,” IEEE/ASME Transactions on Mechatronics, vol. 17, no. 1, pp. 16–24, 2012.
7. I. F. Akyildiz, D. Pompili, and T. Melodia, “Underwater acoustic sensor networks: research challenges,” Ad Hoc Networks, vol. 3, no. 3, pp. 257–279, 2005. View at Publisher · View at Google Scholar · View at Scopus
8. M. Ayaz, I. Baig, A. Abdullah, and I. Faye, “A survey on routing techniques in underwater wireless sensor networks,” Journal of Network and Computer Applications, vol. 34, no. 6, pp. 1908–1927, 2011.
9. A. Y. Teymorian, W. Cheng, L. Ma, X. Cheng, X. Lu, and Z. Lu, “3D underwater sensor network localization,” IEEE Transactions on Mobile Computing, vol. 8, no. 12, pp. 1610–1621, 2009. View at Publisher · View at Google Scholar · View at Scopus
10. G. Isbitiren and O. B. Akan, “Three-dimensional underwater target tracking with acoustic sensor networks,” IEEE Transactions on Vehicular Technology, vol. 60, no. 8, pp. 3897–3906, 2011.
11. I. F. Akyildiz, D. Pompili, and T. Melodia, “State-of-the-art in protocol research for underwater acoustic sensor networks,” in Proceedings of the 1st ACM International Workshop on Underwater Networks, pp. 7–16, Los Angeles, Calif, USA, September 2006. View at Publisher · View at Google Scholar · View at Scopus
12. X. S. Yang, “Firefly algorithms for multimodal optimization,” Lecture Notes in Computer Science, vol. 5792, pp. 169–178, 2009. View at Publisher · View at Google Scholar · View at Scopus
13. X. S. Yang, S. S. Hosseini, and A. H. Gandomi, “Firefly algorithm for solving non-convex economic dispatch problems with valve loading effect,” Applied Soft Computing, vol. 12, no. 3, pp. 1180–1186, 2012.
14. M. H. Sulaiman, M. W. Mustafa, Z. N. Zakaria, O. Aliman, and S. R. Rahim, “Firefly algorithm technique for solving economic dispatch problem,” in Proceedings of the IEEE International Power Engineering and Optimization Conference, pp. 90–95, Melaka, Malaysia, 2012.
15. J. Luthra and S. K. Pal, “A hybrid firefly algorithm using genetic operators for the cryptanalysis of a monoalphabetic substitution cipher,” in Proceedings of the World Congress on Information and Communication Technologies, pp. 202–206, New Delhi, India, 2011.
16. H. P. Tan, W. K. G. Seah, and L. Doyle, “A multi-hop ARQ protocol for underwater acoustic networks,” in Proceedings of the IEEE Oceanic Engineering Society and The Marine Technology Society (OCEANS '07), pp. 1–6, Aberdeen, Scotland, June 2007. View at Scopus
17. D. Pompili, T. Melodia, and I. F. Akyildiz, “Routing algorithms for delay-insensitive and delay-sensitive applications in underwater sensor networks,” in Proceedings of the 12th Annual International Conference on Mobile Computing and Networking (MOBICOM '06), pp. 298–309, Los Angeles, Calif, USA, September 2006. View at Scopus
18. P. Xie, J. H. Cui, and L. Lao, “VBF: Vector-based forwarding protocol for underwater sensor networks,” Lecture Notes in Computer Science, vol. 3976, pp. 1216–1221, 2006. View at Publisher · View at Google Scholar · View at Scopus
19. J. M. Jornet, M. Stojanovic, and M. Zorzi, “Focused beam routing protocol for underwater acoustic networks,” in Proceedings of the 3rd ACM International Workshop on Underwater Networks (WUWNet'08), pp. 75–82, San Francisco, Calif, USA, September 2008. View at Scopus
20. M. Zorzi, P. Casari, N. Baldo, and A. F. Harris, “Energy-efficient routing schemes for underwater acoustic networks,” IEEE Journal on Selected Areas in Communications, vol. 26, no. 9, pp. 1754–1766, 2008. View at Publisher · View at Google Scholar · View at Scopus
21. H. Yan, Z. Shi, and J. H. Cui, “DBR: depth-based routing for underwater sensor networks,” in Proceedings of the 7th International IFIP-TC6 Networking Conference on Ad Hoc and Sensor Networks, Wireless Networks, Next Generation Internet, pp. 72–86, Singapore, 2008.
22. U. Lee, P. Wang, Y. Noh, F. M. L. Vieira, M. Gerla, and J. H. Cui, “Pressure routing for underwater sensor networks,” in Proceedings of the IEEE International Conference on Computer Communications, pp. 1–9, San Diego, CA, USA, 2010.
23. C. H. Yang and K. F. Ssu, “An energy-efficient routing protocol in underwater sensor networks,” in Proceedings of the 3rd International Conference on Sensing Technology (ICST '08), pp. 114–118, Tainan, Taiwan, December 2008. View at Publisher · View at Google Scholar · View at Scopus
24. M. Ayaz and A. Abdullah, “Hop-by-hop dynamic addressing based (H2-DAB) routing protocol for underwater wireless sensor networks,” in Proceedings of the International Conference on Information and Multimedia Technology (ICIMT '09), pp. 436–441, Jeju Island, Republic of Korea, December 2009. View at Publisher · View at Google Scholar · View at Scopus
25. M. C. Domingo, “A distributed energy-aware routing protocol for underwater wireless sensor networks,” Wireless Personal Communications, vol. 57, no. 4, pp. 607–627, 2011. View at Publisher · View at Google Scholar · View at Scopus
26. M. Ayaz, A. Abdullah, and I. Faye, “Hop-by-hop reliable data deliveries for underwater wireless sensor networks,” in Proceedings of the 5th International Conference on Broadband Wireless Computing, Communication and Applications (BWCCA '10), pp. 363–368, November 2010. View at Publisher · View at Google Scholar · View at Scopus
27. J. Xu, K. Li, and G. Min, “Reliable and energy-efficient multipath communications in underwater sensor networks,” IEEE Transactions on Parallel and Distributed Systems, vol. 23, no. 7, pp. 1326–1335, 2012.
28. Z. Zhou, Z. Peng, J. H. Cui, Z. Shi, and A. Bagtzoglou, “Scalable localization with mobility prediction for underwater sensor networks,” IEEE Transactions on Mobile Computing, vol. 10, no. 3, pp. 335–348, 2011. View at Publisher · View at Google Scholar · View at Scopus
29. W. Cheng, A. Y. Teymorian, L. Ma, X. Cheng, X. Lu, and Z. Lu, “Underwater localization in sparse 3D acoustic sensor networks,” in Proceedings of the 27th IEEE Communications Society Conference on Computer Communications (INFOCOM '08), pp. 798–806, Phoenix, Ariz, USA, April 2008. View at Publisher · View at Google Scholar · View at Scopus
30. H. P. Tan, Z. A. Eu, and W. K. G. Seah, “An enhanced underwater positioning system to support deepwater installations,” in Proceedings of the Marine Technology for Our Future: Global and Local Challenges (OCEANS '09), Biloxi, Miss, USA, October 2009. View at Scopus
31. G. T. Toussaint, “The relative neighbourhood graph of a finite planar set,” Pattern Recognition, vol. 12, no. 4, pp. 261–268, 1980. View at Scopus
32. P. Bose, L. Devroye, W. Evans, and D. Kirkpatrick, “On the spanning ratio of gabriel graphs and β-skeletons,” SIAM Journal on Discrete Mathematics, vol. 20, no. 2, pp. 412–427, 2006. View at Publisher · View at Google Scholar · View at Scopus
33. K. J. Supowit, “Relative neighborhood graph, with an application to minimum spanning trees,” Journal of Association for Computing Machinery, vol. 30, no. 3, pp. 428–448, 1983. View at Publisher · View at Google Scholar · View at Scopus
34. P. Xie, Z. Zhou, Z. Peng et al., “Aqua-sim: an NS-2 based simulator for underwater sensor networks,” in Proceedings of the Marine Technology for Our Future: Global and Local Challenges (OCEANS '09), pp. 1–7, Biloxi, Miss, USA, October 2009. View at Scopus
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T08:50:52.000Z
|
itt7lb2pccu73asgoffnpi2jyfr4xohb
|
{
"content_type": "application/xhtml+xml",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40283",
"uncompressed_offset": 432151335,
"url": "www.hindawi.com/journals/mpe/2012/836597/ref/",
"warc_date": "2013-11-22T19:24:16.000Z",
"warc_filename": "<urn:uuid:a5f9d007-fadd-4fa1-b0bb-dd2811a4fe26>",
"warc_url": "http://www.hindawi.com/journals/mpe/2012/836597/ref/"
}
|
cccc_CC-MAIN-2013-20
|
About this Journal Submit a Manuscript Table of Contents
Mathematical Problems in Engineering
Volume 2012 (2012), Article ID 836597, 27 pages
doi:10.1155/2012/836597
Research Article
Improved Quantum-Inspired Evolutionary Algorithm for Engineering Design Optimization
1Department of Computer Science, National Pingtung University of Education, 4-18 Min-Sheng Road, Pingtung 900, Taiwan
2Institute of System Information and Control, National Kaohsiung First University of Science and Technology, 1 University Road, Yenchao, Kaohsiung 824, Taiwan
3Department of Electrical Engineering, National Kaohsiung University of Applied Sciences, 415 Chien-Kung Road, Kaohsiung 807, Taiwan
4Department of Healthcare Administration and Medical Informatics, Kaohsiung Medical University, 100 Shi-Chuan 1st Road, Kaohsiung 807, Taiwan
Received 31 August 2012; Revised 26 October 2012; Accepted 31 October 2012
Academic Editor: Jung-Fa Tsai
Copyright © 2012 Jinn-Tsong Tsai et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Linked References
1. P. Hajela and C. J. Shih, “Optimal design of laminated composites using a modified mixed integer and discrete programming algorithm,” Computers and Structures, vol. 32, no. 1, pp. 213–221, 1989. View at Scopus
2. E. Sandgren, “Nonlinear integer and discrete programming in mechnical design optimization,” ASME Journal of Mechanical Design, vol. 112, no. 2, pp. 223–229, 1990. View at Scopus
3. J. S. Arora, M. W. Huang, and C. C. Hsieh, “Methods for optimization of nonlinear problems with discrete variables: a review,” Structural Optimization, vol. 8, no. 2-3, pp. 69–85, 1994. View at Publisher · View at Google Scholar · View at Scopus
4. M. Bremicker, P. Y. Papalambros, and H. T. Loh, “Solution of mixed-discrete structural optimization problems with a new sequential linearization algorithm,” Computers and Structures, vol. 37, no. 4, pp. 451–461, 1990. View at Scopus
5. H. T. Loh and P. Y. Papalambros, “Sequential linearization approach for solving mixed-discrete nonlinear design optimization problems,” ASME Journal of Mechanical Design, vol. 113, no. 3, pp. 325–334, 1991. View at Scopus
6. D. K. Shin, Z. Gurdal, and O. H. Grin, “A penalty approach for nonlinear optimization with discrete design variables,” Engineering Optimization, vol. 16, pp. 29–42, 1990.
7. J. F. Fu, R. G. Fenton, and W. L. Cleghorn, “A mixed integer-discrete continuous programming method and its application to engineering design optimization,” Engineering Optimization, vol. 17, pp. 263–280, 1991.
8. J. Cai and G. Thieraut, “Discrete optimization of structures using an improved penalty function method,” Engineering Optimization, vol. 17, pp. 293–306, 1993.
9. O. Jonsson and T. Larsson, “Lagrangean relaxation and sub-gradient optimization applied to optimal design with discrete sizing,” Engineering Optimization, vol. 16, pp. 221–233, 1990.
10. S. S. Lin, C. Zhang, and H. P. Wang, “On mixed-discrete nonlinear optimization problems: a comparative study,” Engineering Optimization, vol. 23, pp. 287–300, 1995.
11. S. J. Wu and P. T. Chow, “Applications of genetic algorithms to discrete optimization problems,” Journal of the Chinese Society of Mechanical Engineers, vol. 16, no. 6, pp. 587–598, 1995. View at Scopus
12. S. S. Rao and Y. Xiong, “A hybrid genetic algorithm for mixed-discrete design optimization,” Journal of Mechanical Design, vol. 127, no. 6, pp. 1100–1112, 2005. View at Publisher · View at Google Scholar · View at Scopus
13. W. Tang and Q. Yuan, “Improved genetic algorithm for shape optimization of truss structures,” Chinese Journal of Theoretical and Applied Mechanics, vol. 38, no. 6, pp. 843–849, 2006. View at Scopus
14. R. L. Haupt, “Antenna design with a mixed integer genetic algorithm,” IEEE Transactions on Antennas and Propagation, vol. 55, no. 3, pp. 577–582, 2007. View at Publisher · View at Google Scholar · View at Scopus
15. K. Deep, K. P. Singh, M. L. Kansal, and C. Mohan, “A real coded genetic algorithm for solving integer and mixed integer optimization problems,” Applied Mathematics and Computation, vol. 212, no. 2, pp. 505–518, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
16. K. M. Lee, J. T. Tsai, T. K. Liu, and J. H. Chou, “Improved genetic algorithm for mixed-discrete-continuous design optimization problems,” Engineering Optimization, vol. 42, no. 10, pp. 927–941, 2010. View at Publisher · View at Google Scholar · View at Scopus
17. W. H. Ho and C. S. Chang, “Genetic-algorithm-based artificial neural network modeling for platelet transfusion requirements on acute myeloblastic leukemia patients,” Expert Systems with Applications, vol. 38, no. 5, pp. 6319–6323, 2011. View at Publisher · View at Google Scholar · View at Scopus
18. W. H. Ho, J. X. Chen, I. N. Lee, and H. C. Su, “An ANFIS-based model for predicting adequacy of vancomycin regimen using improved genetic algorithm,” Expert Systems with Applications, vol. 38, no. 10, pp. 13050–13056, 2011. View at Publisher · View at Google Scholar · View at Scopus
19. C. Zhang and H. P. Wang, “Mixed-discrete nonlinear optimization with simulated annealing,” Engineering Optimization, vol. 21, pp. 277–291, 1993.
20. W.-H. Ho, J.-H. Chou, and C.-Y. Guo, “Parameter identification of chaotic systems using improved differential evolution algorithm,” Nonlinear Dynamics, vol. 61, no. 1-2, pp. 29–41, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
21. W.-H. Ho and A. L.-F. Chan, “Hybrid Taguchi-differential evolution algorithm for parameter estimation of differential equation models with application to HIV dynamics,” Mathematical Problems in Engineering, vol. 2011, Article ID 514756, 14 pages, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
22. Y. J. Cao, L. Jiang, and Q. H. Wu, “An evolutionary programming approach to mixed-variable optimization problems,” Applied Mathematical Modelling, vol. 24, no. 12, pp. 931–942, 2000. View at Publisher · View at Google Scholar · View at Scopus
23. P. W. Shor, “Algorithms for quantum computation: discrete logarithms and factoring,” in Proceedings of the 35th Annual Symposium on Foundations of Computer Science, pp. 124–134, Santa Fe, NM, USA, 1994.
24. L. K. Grover, “Fast quantum mechanical algorithm for database search,” in Proceedings of the 28th Annual ACM Symposium on the Theory of Computing, pp. 212–219, New York, NY, USA, May 1996. View at Scopus
25. L. K. Grover, “Quantum mechanics helps in searching for a needle in a haystack,” Physical Review Letters, vol. 79, no. 2, pp. 325–328, 1997. View at Scopus
26. K. H. Han, K. H. Park, C. H. Lee, and J. H. Kim, “Parallel quantum-inspired genetic algorithm for combinatorial optimization problem,” in Proceedings of IEEE Conference on Evolutionary Computation, pp. 1422–1429, Seoul, Korea, May 2001. View at Scopus
27. K. H. Han and J. H. Kim, “Genetic quantum algorithm and its application to combinatorial optimization problem,” in Proceedings of the Congress on Evolutionary Computation, pp. 1354–1360, San Diego, Calif, USA, July 2000. View at Scopus
28. K. H. Han and J. H. Kim, “Quantum-inspired evolutionary algorithm for a class of combinatorial optimization,” IEEE Transactions on Evolutionary Computation, vol. 6, no. 6, pp. 580–593, 2002. View at Publisher · View at Google Scholar · View at Scopus
29. K. H. Han and J. H. Kim, “Quantum-inspired evolutionary algorithms with a new termination criterion, Hε gate, and two-phase scheme,” IEEE Transactions on Evolutionary Computation, vol. 8, no. 2, pp. 156–169, 2004. View at Publisher · View at Google Scholar · View at Scopus
30. A. Malossini, E. Blanzieri, and T. Calarco, “Quantum genetic optimization,” IEEE Transactions on Evolutionary Computation, vol. 12, no. 2, pp. 231–241, 2008. View at Publisher · View at Google Scholar · View at Scopus
31. I. Grigorenko and M. E. Garcia, “Calculation of the partition function using quantum genetic algorithms,” Physica A, vol. 291, pp. 463–470, 2001.
32. J. A. Yang, B. Li, and Z. Zhuang, “Multi-universe parallel quantum genetic algorithm and its application to blind source separation,” in Proceedings of the International Conference on Neural Networks and Signal Processing (ICNNSP '03), pp. 393–398, Nanjing, China, December 2003. View at Publisher · View at Google Scholar · View at Scopus
33. G. Zhang, W. Jin, and L. Hu, “A novel parallel quantum genetic algorithm,” in Proceedings of the 4th International Conference on Parallel and Distributed Computing, Applications and Technologies, pp. 693–697, Chengdu, China, August 2003. View at Publisher · View at Google Scholar · View at Scopus
34. C. Hui, Z. Jiashu, and Z. Chao, “Chaos updating rotated gates quantum-inspired genetic algorithm,” in Proceedings of the International Conference on Communications, Circuits and Systems, pp. 1108–1112, Chengdu, China, June 2004. View at Scopus
35. L. Wang, F. Tang, and H. Wu, “Hybrid genetic algorithm based on quantum computing for numerical optimization and parameter estimation,” Applied Mathematics and Computation, vol. 171, no. 2, pp. 1141–1156, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
36. Q. Yang and S. Ding, “Methodology and case study of hybrid quantum-inspired evolutionary algorithm for numerical optimization,” in Proceedings of the 3rd International Conference on Natural Computation (ICNC '07), pp. 608–612, Haikou, China, August 2007. View at Publisher · View at Google Scholar · View at Scopus
37. N. Li, P. Du, and H. Zhao, “Independent component analysis based on improved quantum genetic algorithm: application in hyperspectral images,” in Proceedings of IEEE International Geoscience and Remote Sensing Symposium (IGARSS '05), pp. 4323–4326, Seoul, Korea, July 2005. View at Publisher · View at Google Scholar · View at Scopus
38. L. Abdesslem, M. Soham, and B. Mohamed, “Multiple sequence alignment by quantum genetic algorithm,” in Proceedings of the 20th International Parallel and Distributed Processing Symposium, pp. 8–15, Rhodes Island, Greece, 2006.
39. Z. Dong, Y. Huang, and P. Han, “Thermal process identification with radial basis function network based on quantum genetic algorithm,” Proceedings of the Chinese Society of Electrical Engineering, vol. 28, no. 17, pp. 99–104, 2008. View at Scopus
40. J. Gao and J. Wang, “A hybrid quantum-inspired immune algorithm for multiobjective optimization,” Applied Mathematics and Computation, vol. 217, no. 9, pp. 4754–4770, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
41. M. S. Phadke, Quality Engineering Using Robust Design, Prentice-Hall, Upper Saddle River, NJ, USA, 1989.
42. D. C. Montgomery, Design and Analysis of Experiments, John Wiley & Sons, New York, NY, USA, 1991.
43. S. H. Park, Robust Design and Analysis for Quality Engineering, Chapman and Hall, London, UK, 1996.
44. D. E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, Boston, Mass, USA, 1989.
45. M. Gen and R. Cheng, Genetic Algorithms and Engineering Design, John Wiley and Sons, New York, NY, USA, 1997.
46. J. T. Tsai, T. K. Liu, and J. H. Chou, “Hybrid Taguchi-genetic algorithm for global numerical optimization,” IEEE Transactions on Evolutionary Computation, vol. 8, no. 4, pp. 365–377, 2004. View at Publisher · View at Google Scholar · View at Scopus
47. J. T. Tsai, J. H. Chou, and T. K. Liu, “Tuning the structure and parameters of a neural network by using hybrid Taguchi-genetic algorithm,” IEEE Transactions on Neural Networks, vol. 17, no. 1, pp. 69–80, 2006. View at Publisher · View at Google Scholar · View at Scopus
48. W. Hock and K. Schittkowski, Test Examples for Nonlinear Programming Codes, vol. 187 of Lecture Notes in Economics and Mathematical Systems, Springer, Berlin, Germany, 1981. View at Publisher · View at Google Scholar
49. C. A. Floudas and P. M. Pardalos, Recent Advances in Global Optimization, Princeton University Press, Princeton, NJ, USA, 1992.
50. Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs, Springer, Berlin, Germany, 1994.
51. J. J. Grefenstette, “Optimization of control parameters for genetic algorithms,” IEEE Transactions on Systems, Man and Cybernetics, vol. 16, no. 1, pp. 122–128, 1986. View at Scopus
52. L. Davis, “Adapting operator probabilities in genetic algorithms,” in Proceedings of the International Conference on Genetic Algorithms (ICGA '89), pp. 61–69, San Mateo, Calif, USA, 1989.
53. J. H. Chou, W. H. Liao, and J. J. Li, “Application of Taguchi-genetic method to design optimal grey-fuzzy controller of a constant turning force system,” in Proceedings of the 15th CSME Annual Conference, pp. 31–38, Taiwan, 1998.
54. S. García, A. Fernández, J. Luengo, and F. Herrera, “A study of statistical techniques and performance measures for genetics-based machine learning: accuracy and interpretability,” Soft Computing, vol. 13, no. 10, pp. 959–977, 2009. View at Publisher · View at Google Scholar · View at Scopus
55. S. García, D. Molina, M. Lozano, and F. Herrera, “A study on the use of non-parametric tests for analyzing the evolutionary algorithms' behaviour: a case study on the CEC'2005 Special Session on Real Parameter Optimization,” Journal of Heuristics, vol. 15, no. 6, pp. 617–644, 2009. View at Publisher · View at Google Scholar · View at Scopus
56. F. Wilcoxon, “Individual comparisons by ranking method,” Biometrics, vol. 1, pp. 80–83, 1945.
57. A. Field, Discovering Statistics Using SPSS, SAGE Publications, London, UK, 2006.
58. J. Kennedy, R. C. Eberhart, and Y. Shi, Swarm Intelligence, Morgan Kaufmann, San Francisco, Calif, USA, 2001.
59. L. N. de Castro and J. Timmis, Artificial Immune Systems: A New Computational Intelligence Approach, Springer, London, UK, 2002.
60. C. J. Shih and T. K. Lai, “Mixed-discrete fuzzy programming for nonlinear engineering optimization,” Engineering Optimization, vol. 23, pp. 187–199, 1995.
61. K. M. Ragsdell and D. T. Phillips, “Optimal design of a class of welded structure using geometric programming,” ASME Journal of Engineering for Industry-Transactions, vol. 98, no. 3, pp. 1021–1025, 1976. View at Scopus
62. ANSYS, APDL Programmer’s Guide: ANSYS Release 10.0, ANSYS, Canonsburg, Pa, USA, 2005.
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T08:26:05.000Z
|
aimfkmensttj7362craonnydhqwlglcg
|
{
"content_type": "application/xhtml+xml",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40284",
"uncompressed_offset": 432163350,
"url": "www.hindawi.com/journals/mpe/2012/937196/abs/",
"warc_date": "2013-11-22T19:24:16.000Z",
"warc_filename": "<urn:uuid:a5f9d007-fadd-4fa1-b0bb-dd2811a4fe26>",
"warc_url": "http://www.hindawi.com/journals/mpe/2012/937196/abs/"
}
|
cccc_CC-MAIN-2013-20
|
About this Journal Submit a Manuscript Table of Contents
Mathematical Problems in Engineering
Volume 2012 (2012), Article ID 937196, 17 pages
doi:10.1155/2012/937196
Research Article
A Fault Prognosis Strategy Based on Time-Delayed Digraph Model and Principal Component Analysis
1College of Automation Engineering, Nanjing University of Aeronautics and Astronautics, Nanjing 210016, China
2School of Computer Science and Engineering, Southeast University, Nanjing 210096, China
3Department of Control Science and Engineering, Zhejiang University, Hangzhou 310027, China
Received 30 August 2012; Accepted 15 November 2012
Academic Editor: Huaguang Zhang
Copyright © 2012 Ningyun Lu et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Abstract
Because of the interlinking of process equipments in process industry, event information may propagate through the plant and affect a lot of downstream process variables. Specifying the causality and estimating the time delays among process variables are critically important for data-driven fault prognosis. They are not only helpful to find the root cause when a plant-wide disturbance occurs, but to reveal the evolution of an abnormal event propagating through the plant. This paper concerns with the information flow directionality and time-delay estimation problems in process industry and presents an information synchronization technique to assist fault prognosis. Time-delayed mutual information (TDMI) is used for both causality analysis and time-delay estimation. To represent causality structure of high-dimensional process variables, a time-delayed signed digraph (TD-SDG) model is developed. Then, a general fault prognosis strategy is developed based on the TD-SDG model and principle component analysis (PCA). The proposed method is applied to an air separation unit and has achieved satisfying results in predicting the frequently occurred “nitrogen-block” fault.
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T08:42:30.000Z
|
52c37oupfgeoteq6gkxk4jnfssu2u5dq
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40285",
"uncompressed_offset": 452619322,
"url": "www.isfdb.org/cgi-bin/diffselect.cgi",
"warc_date": "2013-11-22T19:24:16.000Z",
"warc_filename": "<urn:uuid:a5f9d007-fadd-4fa1-b0bb-dd2811a4fe26>",
"warc_url": "http://www.isfdb.org/cgi-bin/diffselect.cgi?342341"
}
|
cccc_CC-MAIN-2013-20
|
Bibliography: Looking Out
You are not logged in. If you create a free account and sign in, you will be able to customize what is displayed.
Title: Looking Out
Author: Ramsey Campbell
Year: 1986
Type: SHORTFICTION
Select 2 publications to diff:
Copyright (c) 1995-2011 Al von Ruff.
ISFDB Engine - Version 4.00 (04/24/06)
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T09:02:15.000Z
|
viq2fynmqmi55ptdqjwwfg57xy3pnyia
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40286",
"uncompressed_offset": 452626477,
"url": "www.isfdb.org/cgi-bin/pl.cgi",
"warc_date": "2013-11-22T19:24:16.000Z",
"warc_filename": "<urn:uuid:a5f9d007-fadd-4fa1-b0bb-dd2811a4fe26>",
"warc_url": "http://www.isfdb.org/cgi-bin/pl.cgi?57604"
}
|
cccc_CC-MAIN-2013-20
|
Publication Listing
You are not logged in. If you create a free account and sign in, you will be able to customize what is displayed.
Cover art supplied by Visco
Contents (view Concise Listing)
Verification Status
Reference Status
Primary Verified by Swfritter on 2008-10-29 11:44:28
Clute/Nicholls Marked N/A by Alvonruff on 2006-12-09 07:06:01
Clute/Grant Marked N/A by Alvonruff on 2006-12-09 07:06:01
Contento1 (anth/coll) Marked N/A by Alvonruff on 2006-12-09 07:06:01
Locus1 Marked N/A by Alvonruff on 2006-12-09 07:06:01
Reginald1 Marked N/A by Alvonruff on 2006-12-09 07:06:01
Reginald3 Marked N/A by Alvonruff on 2006-12-09 07:06:01
Tuck Verified by Bluesman on 2012-11-02 23:00:04
Miller/Contento Verified by Alvonruff on 2006-12-09 07:06:01
Bleiler1 (Gernsback) Marked N/A by Alvonruff on 2006-12-09 07:06:01
Currey Not Verified
Primary (Transient) Not Verified
Bleiler78 Not Verified
OCLC/Worldcat Not Verified
Primary2 Verified by Hauck on 2011-09-26 11:55:18
Primary3 Verified by Teddybear on 2012-03-23 15:18:45
Primary4 Not Verified
Primary5 Not Verified
Copyright (c) 1995-2011 Al von Ruff.
ISFDB Engine - Version 4.00 (04/24/06)
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T08:19:22.000Z
|
z2r44g63wd3hz27m5gikeeuqcs37jnkv
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40308",
"uncompressed_offset": 537584922,
"url": "www.ohloh.net/p/topia/contributors/2085281784184131",
"warc_date": "2013-11-22T19:24:16.000Z",
"warc_filename": "<urn:uuid:a5f9d007-fadd-4fa1-b0bb-dd2811a4fe26>",
"warc_url": "http://www.ohloh.net/p/topia/contributors/2085281784184131"
}
|
cccc_CC-MAIN-2013-20
|
High Activity
Contributors : glandais
Analyzed 4 days ago based on code collected 4 days ago.
Activity on ToPIA by glandais
All-time Commits: 3
12-Month Commits: 0
30-Day Commits: 0
Overall Kudo Rank:
First Commit: 21-Dec-2007
Last Commit: 21-Dec-2007
Names in SCM: glandais
Commit history:
Recent Kudos...
... for ToPIA given by:
There are no kudos for this contributor at this time.
Do you know this contributor?
Ohloh computes statistics about contributors by analyzing their commits on all FOSS projects. We would like to be able to attribute this work to the right person, so if you know the contributor, please help out:
Are you this developer?
Add this position to your profile!
Know this developer?
Send him or her an invite to join Ohloh.
Project Commits
Approximately one year of commit activity shown
Project Languages
Language Aggregate Coding Time Total Commits Total Lines Changed Comment Ratio
Java 1m 3 24 -
XML 1m 1 2 -
All Languages 1m 3 26 -
Copyright © 2013 Black Duck Software, Inc. and its contributors, Some Rights Reserved. Unless otherwise marked, this work is licensed under a Creative Commons Attribution 3.0 Unported License . Ohloh ® and the Ohloh logo are trademarks of Black Duck Software, Inc. in the United States and/or other jurisdictions. All other trademarks are the property of their respective holders.
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T08:20:31.000Z
|
yra5xxlqjqh36kconbnzra4hctyqtnye
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40313",
"uncompressed_offset": 544708909,
"url": "www.panarmenian.net/eng/news/143373/",
"warc_date": "2013-11-22T19:24:16.000Z",
"warc_filename": "<urn:uuid:a5f9d007-fadd-4fa1-b0bb-dd2811a4fe26>",
"warc_url": "http://www.panarmenian.net/eng/news/143373/"
}
|
cccc_CC-MAIN-2013-20
|
“Taken” helmer to direct Sean Penn’s “Prone Gunman” action thriller
PanARMENIAN.Net - French action director Pierre Morel is in negotiations to direct Sean Penn in Prone Gunman, the action thriller being produced by Silver Pictures’ Joel Silver and Andrew Rona, The Hollywood Reporter said.
Based on a Jean-Patrick Manchette novel and a script by Peter Travis, the story centers on an international operative named Martin Terrier (Penn) who is betrayed by the organization he works for and must go on the run in a relentless game of cat-and-mouse across Europe.
The movie is serving as Penn’s entre into the action franchise game, so it’s fitting that he would work with Morel, who launched the reinvention of actor Liam Neeson as an action star with Taken. The 2008 movie featured Neeson as a father who would do anything to rescue his daughter and launched a sequel released in 2012.
Silver and Studio Canal, which is fully financing the picture, are looking at a spring 2013 production start in several locales across Europe.
(It is still unclear if Gunman will go through Silver's new distribution deal at Universal or end up in another studio's pipeline.)
Silver Pictures just wrapped production on Non-Stop, a thriller starring Neeson and Julianne Moore.
Partner news
Top stories
The jewels were to be loaned to celebrities who have arrived on the French Riviera town for its famous annual film festival.
The list of the finalists also includes Hungary, Azerbaijan, Georgia, Romania, Norway, Iceland, Finland and others.
Set in the gritty blue-collar neighborhood of God’s Pocket, story follows a man stuck with a debt he can't pay.
"Catching Fire" follows Katniss and fellow Hunger Games victor Peeta as they embark on a "Victor's Tour" throughout 12 districts of Panem.
Partner news
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T08:42:09.000Z
|
xlodddndrfff2dfxqr4ampfd7c4h7ii4
|
{
"content_type": "application/xhtml+xml",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40364",
"uncompressed_offset": 45720159,
"url": "cnx.org/content/m18138/1.2/content_info",
"warc_date": "2013-11-22T19:22:56.000Z",
"warc_filename": "<urn:uuid:13f63844-c522-473f-8d3f-47f93bc4d98e>",
"warc_url": "http://cnx.org/content/m18138/1.2/content_info"
}
|
cccc_CC-MAIN-2013-20
|
Connexions
Sections
You are here: Home » Content » Conclusion
About: Conclusion
Module by: Ivan Selesnick, C. Sidney Burrus. E-mail the authors
View the content: Conclusion
Metadata
Name: Conclusion
ID: m18138
Language: English (en)
Subject: Mathematics and Statistics
License: Creative Commons Attribution License CC-BY 2.0
Authors: Ivan Selesnick (selesi@poly.edu), C. Sidney Burrus (csb@rice.edu)
Copyright Holders: Ivan Selesnick (selesi@poly.edu), C. Sidney Burrus (csb@rice.edu)
Maintainers: Ivan Selesnick (selesi@poly.edu), C. Sidney Burrus (csb@rice.edu), Daniel Williamson (dcwill@cnx.org)
Latest version: 1.2 (history)
First publication date: Oct 7, 2008 2:26 pm -0500
Last revision to module: Sep 15, 2009 10:04 pm -0500
Downloads
PDF: m18138_1.2.pdf PDF file, for viewing content offline and printing. Learn more.
XML: m18138_1.2.cnxml XML that defines the structure and contents of the module, minus any included media files. Can be reimported in the editing interface. Learn more.
Version History
Version: 1.2 Sep 15, 2009 10:04 pm -0500 by Daniel Williamson
Changes:
added google analytics tracking code
Version: 1.1 Oct 29, 2008 9:05 pm -0500 by C. Sidney Burrus
Changes:
First published
How to Reuse and Attribute This Content
If you derive a copy of this content using a Connexions account and publish your version, proper attribution of the original work will be automatically done for you.
If you reuse this work elsewhere, in order to comply with the attribution requirements of the license (CC-BY 2.0), you must include
• the authors' names: Ivan Selesnick, C. Burrus
• the title of the work: Conclusion
• the Connexions URL where the work can be found: http://cnx.org/content/m18138/1.2/
See the citation section below for examples you can copy.
How to Cite and Attribute This Content
The following citation styles comply with the attribution requirements for the license (CC-BY 2.0) of this work:
American Chemical Society (ACS) Style Guide:
Selesnick, I.; Burrus, C. Conclusion, Connexions Web site. http://cnx.org/content/m18138/1.2/, Sep 15, 2009.
American Medical Assocation (AMA) Manual of Style:
Selesnick I, Burrus C. Conclusion [Connexions Web site]. September 15, 2009. Available at: http://cnx.org/content/m18138/1.2/.
American Psychological Assocation (APA) Publication Manual:
Selesnick, I., & Burrus, C. (2009, September 15). Conclusion. Retrieved from the Connexions Web site: http://cnx.org/content/m18138/1.2/
Chicago Manual of Style (Bibliography):
Selesnick, Ivan, and C. Burrus. "Conclusion." Connexions. September 15, 2009. http://cnx.org/content/m18138/1.2/.
Chicago Manual of Style (Note):
Ivan Selesnick and C. Burrus, "Conclusion," Connexions, September 15, 2009, http://cnx.org/content/m18138/1.2/.
Chicago Manual of Style (Reference, in Author-Date style):
Selesnick, I., & Burrus, C. 2009. Conclusion. Connexions, September 15, 2009. http://cnx.org/content/m18138/1.2/.
Modern Languages Association (MLA) Style Manual:
Selesnick, Ivan, and C. Burrus. Conclusion. Connexions. 15 Sep. 2009 <http://cnx.org/content/m18138/1.2/>.
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T08:26:23.000Z
|
erw6ttayz6evl3yrsr5trhn7nvx72qij
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40380",
"uncompressed_offset": 65519946,
"url": "dungeons.wikia.com/wiki/SRD:Bulette",
"warc_date": "2013-11-22T19:22:56.000Z",
"warc_filename": "<urn:uuid:13f63844-c522-473f-8d3f-47f93bc4d98e>",
"warc_url": "http://dungeons.wikia.com/wiki/SRD:Bulette"
}
|
cccc_CC-MAIN-2013-20
|
Wikia
SRD:Bulette
Talk0
9,503pages on
this wiki
BULETTEEdit
Size/Type: Huge Magical Beast
Hit Dice: 9d10+45 (94 hp)
Initiative: +2
Speed: 40 ft. (8 squares), burrow 10 ft.
Armor Class: 22 (–2 size, +2 Dex, +12 natural), touch 10, flat-footed 20
Base Attack/Grapple: +9/+25
Attack: Bite +16 melee (2d8+8)
Full Attack: Bite +16 melee (2d8+8) and 2 claws +10 melee (2d6+4)
Space/Reach: 15 ft./10 ft.
Special Attacks: Leap
Special Qualities: Darkvision 60 ft., low-light vision, scent, tremorsense 60 ft.
Saves: Fort +11, Ref +8, Will +6
Abilities: Str 27, Dex 15, Con 20, Int 2, Wis 13, Cha 6
Skills: Jump +18, Listen +9, Spot +3
Feats: Alertness, Iron Will, Track, Weapon Focus (bite)
Environment: Temperate hills
Organization: Solitary or pair
Challenge Rating: 7
Treasure: None
Alignment: Always neutral
Advancement: 10–16 HD (Huge); 17–27 HD (Gargantuan)
Level Adjustment:
Also known as the landshark, the bulette is a terrifying predator that lives only to eat.
COMBATEdit
A bulette attacks anything it regards as edible, choosing the easiest or closest prey first. The only creatures it refuses to eat are elves (and it dislikes the taste of dwarves). When burrowing underground, a landshark relies on its tremorsense ability to detect prey.
When it senses something edible (that is, senses movement), it breaks to the surface, crest first, and begins its attack.
Leap (Ex): A bulette can jump into the air during combat. This allows it to make four claw attacks instead of two, each with a +15 attack bonus, but it cannot bite.
Back to Main PageSystem Reference DocumentCreatures
Advertisement | Your ad here
Photos
Add a Photo
1,231photos on this wiki
See all photos >
Recent Wiki Activity
See more >
Around Wikia's network
Random Wiki
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T09:00:33.000Z
|
b5hpzcnvfchpvpknkyyw6wbxqlp7qe7t
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40395",
"uncompressed_offset": 89260464,
"url": "free.naplesplus.us/articles/view.php/54285/love-is-in-the-air-at-livewire",
"warc_date": "2013-11-22T19:22:56.000Z",
"warc_filename": "<urn:uuid:13f63844-c522-473f-8d3f-47f93bc4d98e>",
"warc_url": "http://free.naplesplus.us/articles/view.php/54285/love-is-in-the-air-at-livewire"
}
|
cccc_CC-MAIN-2013-20
|
Skip to main content Help Control Panel
Lost? Search this Naples Florida website...|Add our search|Login A+ A- 54.234.42.16
Naples Calendars «
Love is in the Air at Livewire
Share
Love is in the Air at Livewire
Livewire -- on Feb. 11 2010
Valentine's Day is Sunday! Cupid is shooting his arrows.
Valentine's Day is Sunday! Cupid is shooting his arrows. Retail and grocery stores are selling Valentine chocolates, candies, cards, and jewlery. The love month, February is here. Love is in the air... Speaking of love, have you ever wondered just how wide, long, high, and deep love really is? Is love just another emotion or feeling we get every so often? Just what is love anyways? Find out at Livewire as the series Valentine continues this Sunday.
At Livewire the atmosphere is electric, the music is edgy, the people are real, and the message is relevant. Doors open every Sunday at 9:30am with free donuts and coffee served up and the experience kicks off at 10:12. Livewire is located at Lake Park Elementary School just one block South of the Coastland Mall on Goodlette Rd.
Livewire real. different. relevant. http://www.wiredalive.com info@wiredalive.com 239.438.8494
Rate this! 1-5 stars
Loading
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T09:00:06.000Z
|
vfr6ldweeevdbwkyyrezu7gj7nfnvqya
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40416",
"uncompressed_offset": 116439910,
"url": "journals.tdl.org/icce/index.php/icce/article/view/2837",
"warc_date": "2013-11-22T19:22:56.000Z",
"warc_filename": "<urn:uuid:13f63844-c522-473f-8d3f-47f93bc4d98e>",
"warc_url": "http://journals.tdl.org/icce/index.php/icce/article/view/2837"
}
|
cccc_CC-MAIN-2013-20
|
A PROBABILISTIC APPROACH TO DETERMINE WAVE FORCES ON OCEAN PILE STRUCTURES
G.I. Schueller, H.C. Shah
Abstract
Multiple linear regression analysis is applied to predict horizontal velocities and acceleration of water particles subjected to waves. Furthermore it was used to predict the coefficient of drag for circular piles. The mean value functions of the parameters are calculated and the assumption of their lognormal distribution reasonably well verified. The method used here is free from theoretical assumptions about wave mechanisms and, hence, explains the behavior of experimental results. Using Monte Carlo simulation these regression relations were then utilized to generate the distribution functions of wave forces. Using the Morison force equation, in this simulation, the distribution function for the drag and the inertial components of the force are determined separately. A linear superposition of those time varying processes was performed to obtain the distribution of the total maximum force. Finally a probabilistic wave height-wave force relationship was developed for the purpose of creating a force distribution function given a random sea state.
Keywords
pile; force on pile; probability
Full Text: PDF
This work is licensed under a Creative Commons Attribution 3.0 License.
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T07:31:46.000Z
|
dxdnuqkduu73fltj75iqexv4563c6lfa
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40459",
"uncompressed_offset": 175182729,
"url": "quotationsbook.com/quote/1068/",
"warc_date": "2013-11-22T19:22:56.000Z",
"warc_filename": "<urn:uuid:13f63844-c522-473f-8d3f-47f93bc4d98e>",
"warc_url": "http://quotationsbook.com/quote/1068/"
}
|
cccc_CC-MAIN-2013-20
|
Quotation added by staff
Why not add this quote to your bookmarks?
The ultimate measure of a man is not where he stands in moments of comfort and convenience, but where he stands at times of challenge and controversy. King Jr. Martin Luther
This quote is about adversity · Search on Google Books to find all references and sources for this quotation.
A bit about King Jr. Martin Luther ...
Martin Luther King, Jr., (January 15, 1929 - April 4, 1968) was one of the main leaders of the American civil rights movement, a political activist, a Baptist minister, and was one of America's greatest orators. In 1964, King became the youngest man to be awarded the Nobel Peace Prize (for his work as a peacemaker, promoting nonviolence and equal treatment for different races). On April 4, 1968, King was assassinated in Memphis, Tennessee.
These people bookmarked this quote:
More on the author
This quote around the web
Loading...
Search Quotations Book
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T08:54:26.000Z
|
raw7s3zk53kfqfsq3pzeqvthv7hrcibf
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40460",
"uncompressed_offset": 175190111,
"url": "quotationsbook.com/quote/26599/",
"warc_date": "2013-11-22T19:22:56.000Z",
"warc_filename": "<urn:uuid:13f63844-c522-473f-8d3f-47f93bc4d98e>",
"warc_url": "http://quotationsbook.com/quote/26599/"
}
|
cccc_CC-MAIN-2013-20
|
Quotation added by staff
Why not add this quote to your bookmarks?
It is difficulties that give birth to miracles. Sharpe, Dr.
This quote is about miracles · Search on Google Books to find all references and sources for this quotation.
A bit about Sharpe, Dr. ...
We don't have a biography.
These people bookmarked this quote:
More on the author
This quote around the web
Loading...
Search Quotations Book
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T08:26:21.000Z
|
nxmnaexbrxp4le47iago64hcr72aoccz
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40461",
"uncompressed_offset": 175196175,
"url": "quotationsbook.com/quote/gift/14799/",
"warc_date": "2013-11-22T19:22:56.000Z",
"warc_filename": "<urn:uuid:13f63844-c522-473f-8d3f-47f93bc4d98e>",
"warc_url": "http://quotationsbook.com/quote/gift/14799/"
}
|
cccc_CC-MAIN-2013-20
|
It's easy! Just pick the product you like and click-through to buy it from trusted partners of Quotations Book. We hope you like these personalized gifts as much as we do.
Make and then buy your OWN fantastic personalized gift from this quote
A woman is the only thing I am afraid of that I know will not hurt me. Lincoln, Abraham
Make a fabulous personalised bracelet or other form of jewellery with this quote
Click the banner below to pick the kind of jewellery you'd like ...
Choose something popular ...
Make a custom wrapped canvas ...
Make custom holiday cards ...
Make custom t-shirts ...
Make custom holiday gifts for boys ...
Make custom holiday gifts for girls ...
Make custom holiday gifts for men ...
A selection of more great products and gifts!
212 - The Extra Degree
The one extra degree makes the difference. This simple analogy reflects the ultimate definition of excellence. Because it's the one extra degree of effort, in business and life, that can separate the good from the great. This powerful book by S.L. Parker and Mac Anderson gives great examples, great quotes and great stories to illustrate the 212° concept. A warning - once you read it, it will be hard to forget. Your company will have a target for everything you do ... 212°
Click here to buy this »
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T08:51:50.000Z
|
mpq54kensdakbmk6gh5fwmqehexs7v2j
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40462",
"uncompressed_offset": 175201669,
"url": "quotationsbook.com/quote/gift/224/",
"warc_date": "2013-11-22T19:22:56.000Z",
"warc_filename": "<urn:uuid:13f63844-c522-473f-8d3f-47f93bc4d98e>",
"warc_url": "http://quotationsbook.com/quote/gift/224/"
}
|
cccc_CC-MAIN-2013-20
|
It's easy! Just pick the product you like and click-through to buy it from trusted partners of Quotations Book. We hope you like these personalized gifts as much as we do.
Make and then buy your OWN fantastic personalized gift from this quote
One of the secrets of getting more done is to make a TO DO List every day, keep it visible, and use it as a guide to action as you go through the day. Lakein, Alan
Make a fabulous personalised bracelet or other form of jewellery with this quote
Click the banner below to pick the kind of jewellery you'd like ...
Choose something popular ...
Make a custom wrapped canvas ...
Make custom holiday cards ...
Make custom t-shirts ...
Make custom holiday gifts for boys ...
Make custom holiday gifts for girls ...
Make custom holiday gifts for men ...
A selection of more great products and gifts!
212 - The Extra Degree
The one extra degree makes the difference. This simple analogy reflects the ultimate definition of excellence. Because it's the one extra degree of effort, in business and life, that can separate the good from the great. This powerful book by S.L. Parker and Mac Anderson gives great examples, great quotes and great stories to illustrate the 212° concept. A warning - once you read it, it will be hard to forget. Your company will have a target for everything you do ... 212°
Click here to buy this »
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T08:59:41.000Z
|
qn3kouxwfwgsf3zcv6nz46v7noxqjwgf
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40464",
"uncompressed_offset": 177423821,
"url": "redsarmy.com/2010/07/20/rondo-talks-at-team-usa-camp/",
"warc_date": "2013-11-22T19:22:56.000Z",
"warc_filename": "<urn:uuid:13f63844-c522-473f-8d3f-47f93bc4d98e>",
"warc_url": "http://redsarmy.com/2010/07/20/rondo-talks-at-team-usa-camp/"
}
|
cccc_CC-MAIN-2013-20
|
Rondo talks at Team USA camp
RedsArmyAdmin July 20, 2010 Uncategorized 9 Comments
After a lot back-and-forth, the Rajon Rondo/USA Basketball "saga" ended with him just showing up like everyone else did today in Las Vegas.
I was there today to talk to him a little about the experience.
And.. like I said.. we're in Vegas… so there's got be some kind of screwed up thing that happens.
After the jump, a drunk Rajon Rondo fan that I bumped into at Caesar's Palace professes her insane love for Rajon.
I promised I'd pass the message along… so… here it is Rajon.
Drunk Rondo Chick
Like this Article? Share it!
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T07:46:39.000Z
|
5f5mlaztlchvqs5qyy33c6qy466xqglv
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40526",
"uncompressed_offset": 236762121,
"url": "wikitravel.org/wiki/en/index.php?hidetrans=1&title=Special%3AWhatLinksHere%2FTalk%3AHebrew_phrasebook",
"warc_date": "2013-11-22T19:22:56.000Z",
"warc_filename": "<urn:uuid:13f63844-c522-473f-8d3f-47f93bc4d98e>",
"warc_url": "http://wikitravel.org/wiki/en/index.php?title=Special:WhatLinksHere/Talk:Hebrew_phrasebook&hidetrans=1"
}
|
cccc_CC-MAIN-2013-20
|
Help Wikitravel grow by contributing to an article! Learn how.
Pages that link to "Talk:Hebrew phrasebook"
Jump to: navigation, search
What links here
Filters Show transclusions | Hide links | Hide redirects
No pages link to Talk:Hebrew phrasebook.
Personal tools
Namespaces
Variants
Views
Actions
Navigation
feeds
Toolbox
In other languages
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T08:52:52.000Z
|
rgxiknf3feq3p7b24btipij4mnp3tvfu
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40534",
"uncompressed_offset": 245055952,
"url": "www.abs.gov.au/AUSSTATS/abs%40.nsf/7d12b0f6763c78caca257061001cc588/e8c9f7c76debd19dca2573b4001183c0!OpenDocument",
"warc_date": "2013-11-22T19:22:56.000Z",
"warc_filename": "<urn:uuid:13f63844-c522-473f-8d3f-47f93bc4d98e>",
"warc_url": "http://www.abs.gov.au/AUSSTATS/abs@.nsf/7d12b0f6763c78caca257061001cc588/e8c9f7c76debd19dca2573b4001183c0!OpenDocument"
}
|
cccc_CC-MAIN-2013-20
|
Australian Bureau of Statistics
Celebrating the International Year of Statistics 2013
ABS Home > Statistics > By Catalogue Number
1368.1 - New South Wales Regional Statistics, 2007
Latest ISSUE Released at 11:30 AM (CANBERRA TIME) 18/12/2007
Page tools: Print Page Print All RSS Search this Product
AUSTRALIAN BUREAU OF STATISTICS, BUILDING APPROVALS
INTRODUCTION
1 The Building Approvals Collection (BAPS) presents monthly details of building work approved.
2 Data from this collection provides timely estimates of future building activity and is an important leading economic indicator. It also provides the sampling framework for the quarterly Building Activity Survey, which is a major contributor to the quarterly National Accounts estimates.
3 BAPS collects data relating to residential and non-residential building work (above certain value limits) that has been approved within the reference month.
4 In this product data are presented on the number of dwelling units that will be created as a result of the approval and the value of the building jobs approved.
SCOPE
5 The scope of the survey comprises:
• construction of new buildings;
• alterations and additions to existing buildings;
• approved non-structural renovation and refurbishment work; and
• approved installation of integral building fixtures.
6 From July 1990, the statistics include:
• all approved new residential building valued at $10,000 or more;
• approved alterations and additions to residential building valued at $10,000 or more; and
• all approved non-residential building jobs valued at $50,000 or more.
7 Excluded from the statistics is construction activity not defined as building (e.g. roads, bridges, railways, earthworks, landscaping, etc).
REFERENCE PERIOD
8 The data presented relates to the financial year 2006–07.
KEY DATA ITEMS
9 The following key data items relate to data used in this product.
10 Alterations and additions: Building activity carried out on existing buildings. Includes adding to or diminishing floor area, altering the structural design of a building and affixing rigid components which are integral to the functioning of the building.
11 Building: A building is a rigid, fixed and permanent structure which has a roof. Its intended purpose is primarily to house people, plant, machinery, vehicles, goods or livestock. An integral feature of a building's design is the provision for regular access by persons in order to satisfy its intended use.
12 Commercial: Buildings primarily occupied with or engaged in commercial trade or work intended for commercial trade, including buildings used primarily in wholesale and retail trades, office and transport activities.
13 Conversions: Building activity which converts to a non-residential building to a residential building, e.g. conversion of a warehouse to residential apartments. Conversion is considered to be a special type of alteration, and these jobs have been separately identified as such from the July 1996 reference month, though they have only appeared separately in the Building Approvals publication from the January 1998 issue. Prior to that issue, conversions were published as part of the 'Conversions, etc' category or included elsewhere within a table.
14 Dwelling unit: A dwelling unit is a self-contained suite of rooms, including cooking and bathing facilities and intended for long-term residential use. Regardless of whether they are self-contained or not, units within buildings offering institutional care (e.g. hospitals) or temporary accommodation (e.g. motels, hostels and holiday apartments) are not defined as dwelling units. Such units are included in the appropriate category of non-residential building approvals. Dwelling units can be created in one of four ways: through new work to create a residential building; through alteration/addition work to an existing residential building; through either new or alteration/addition work on non-residential building, or through conversion of a non-residential building to a residential building.
15 Houses: A house is a detached building primarily intended for long term residential purposes. It consists of one dwelling unit. For instance, detached 'granny flats' and detached dwelling units (e.g. caretaker's residences) associated with a non-residential building are defined as houses. Also includes 'cottages', 'bungalows' and rectories.
16 Industrial buildings: Buildings used for warehousing and the production and assembly activities of industrial establishments, including factories and plants.
17 New buildings: Building activity which will result in the creation of a building which previously did not exist.
18 Non-residential building: A non-residential building is primarily intended for purposes other than long term residential purposes. Note that, on occasions, one or more dwelling units may be created through non-residential building activity. However, the value of these dwelling units cannot be separated out from that of the non-residential building which they are part of. Therefore the value associated with these remain in the appropriate non-residential category.
19 Other non-residential building: In this product, an other non-residential building is a building whose function is categorised as education, religion, aged care (including nursing homes), health facilities, entertainment and recreation, short-term accommodation or non-residential buildings not elsewhere classified.
20 Other residential building: An other residential building is a building other than a house primarily intended for long-term residential purposes. An other residential building contains more than one dwelling unit. Other residential buildings are coded to the following categories: semidetached, row or terrace house or townhouse with one storey; semidetached, row or terrace house or townhouse with two or more storeys; flat, unit or apartment in a building of one or two storeys; flat, unit or apartment in a building of three storeys; flat, unit or apartment in a building of four or more storeys; flat, unit or apartment attached to a house; other/number of storeys unknown.
21 Ownership: Building ownership is classified as either public or private sector and is based on the sector of the intended owner of the completed building at the time of approval. Residential buildings constructed by private sector builders under government housing authority schemes are classified as public sector when the authority has contracted, or intends to contract, to purchase the building on or before completion.
22 Residential building: A residential building is a building consisting of one ore more dwelling units. Residential buildings can be either houses or other residential buildings.
GEOGRAPHY
23 Building approval statistics are coded according to the Australian Standard Geographical Classification (ASGC), 2006 edition (cat. No. 1216.0). In this product data are presented for Local Government Areas.
24 From 1 July 2002, approvals in the External Territories of Australia are included in these statistics.
COLLECTION METHODOLOGY
25 Statistics of building work approved are compiled from:
• permits issued from local government authorities and other principal certifying authorities;
• contracts let or day labour work authorised by Commonwealth, State, semi-government and local government authorities; and
• major building approvals in areas not subject to normal administrative approval (e.g. building on remote mine sites).
ACCURACY
26 Statistics on the value of building work approved are derived by aggregating the estimated 'value of building work when completed' as reported on building approval documents provided to local councils or other building approval authorities. Conceptually these value data should exclude the value of land and landscaping but include site preparation costs. These estimates are usually a reliable indicator of the completed value of 'houses'. However, for 'other residential buildings' and 'non-residential buildings', they can differ significantly from the completed value of the building as final costs and contracts have not been established before council approval is sought and gained.
27 The Australian Bureau of Statistics (ABS) generally accepts values provided by approving bodies. Every effort is made to ensure data are provided on a consistent basis, however, there may be instances where value reported does not reflect the building completion value. For example, the reported value for most project homes is the contract price, which may include the cost of site preparation and landscaping. In other cases where a builder is contracted to construct a dwelling based on the owner's plans, the value may only be the builder's costs. Some councils do not use the value on approval documents, instead deriving a value based on floor area and type of structure.
28 From July 2000, value data includes the Goods and Services Tax (GST) for residential and non-residential building approvals. The ABS has consulted with councils and other approving authorities to ensure that approval values are reported inclusive of GST. Where is was identified by a council or other approving authority that approvals submitted from its jurisdiction were on a GST-exclusive basis, the ABS made adjustments to the data to ensure that values were consistent with other data collected and were inclusive of GST.
29 When figures have been rounded, discrepancies may occur between sums of the component items and totals.
PUBLISHED DATA
30 The main summary publication from this survey is Building Approvals, Australia (cat. No. 8731.0).
ABS DATA AVAILABLE ON REQUEST
31 As well as the statistics included in this and related publications, the ABS may have other relevant data available on request. For further information, please contact the National Information and Referral Service on 1300 135 070.
© Commonwealth of Australia 2013
Unless otherwise noted, content on this website is licensed under a Creative Commons Attribution 2.5 Australia Licence together with any terms, conditions and exclusions as set out in the website Copyright notice. For permission to do anything beyond the scope of this licence and copyright terms contact us.
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T09:03:31.000Z
|
icbyt7jth4leakmxkmnqwnjwyecglzd3
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40535",
"uncompressed_offset": 245081333,
"url": "www.abs.gov.au/AUSSTATS/abs%40.nsf/ProductsbyReleaseDate/E8C9EB2BA91826F7CA257AB7001B098A",
"warc_date": "2013-11-22T19:22:56.000Z",
"warc_filename": "<urn:uuid:13f63844-c522-473f-8d3f-47f93bc4d98e>",
"warc_url": "http://www.abs.gov.au/AUSSTATS/abs@.nsf/ProductsbyReleaseDate/E8C9EB2BA91826F7CA257AB7001B098A?OpenDocument"
}
|
cccc_CC-MAIN-2013-20
|
Australian Bureau of Statistics
Celebrating the International Year of Statistics 2013
ABS Home > Statistics > By Release Date
5409.0 - Oversea Trade and Customs and Excise Revenue, 1943-44
Previous ISSUE Released at 11:30 AM (CANBERRA TIME) 04/12/1944 Ceased
Page tools: Print Page Print All RSS Search this Product
• About this Release
Contains Customs and Excise Revenue, for the period, together with comparative figures for previous years, compiled from documents obtained under the Customs Act and supplied to the Commonwealth Bureau of Census and Statistics by the Department of Trade and Customs.
This publication has been converted from older electronic formats and does not necessarily have the same appearance and functionality as later releases.
© Commonwealth of Australia 2013
Unless otherwise noted, content on this website is licensed under a Creative Commons Attribution 2.5 Australia Licence together with any terms, conditions and exclusions as set out in the website Copyright notice. For permission to do anything beyond the scope of this licence and copyright terms contact us.
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T08:21:09.000Z
|
rc7sbvxaza5vqsnmrulrvxo4hwgp6b2n
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40536",
"uncompressed_offset": 245088253,
"url": "www.abs.gov.au/AUSSTATS/abs%40.nsf/ProductsbyReleaseDate/FDC8109DF997661ECA25732A002127E0",
"warc_date": "2013-11-22T19:22:56.000Z",
"warc_filename": "<urn:uuid:13f63844-c522-473f-8d3f-47f93bc4d98e>",
"warc_url": "http://www.abs.gov.au/AUSSTATS/abs@.nsf/ProductsbyReleaseDate/FDC8109DF997661ECA25732A002127E0?OpenDocument"
}
|
cccc_CC-MAIN-2013-20
|
Australian Bureau of Statistics
Celebrating the International Year of Statistics 2013
ABS Home > Statistics > By Release Date
6540.0 - Household Expenditure Survey and Survey of Income and Housing - Confidentialised Unit Record Files, 2003-04
Previous ISSUE Released at 11:30 AM (CANBERRA TIME) 09/06/2006 First Issue
Page tools: Print Page Print All RSS Search this Product
• About this Release
The main findings from the Household Expenditure Survey were released in catalogue number 6530.0 and main findings from the Survey of Income and Housing were released in catalogue number 6523.0
A file containing unit record data from the Household Expenditure Survey and the Survey of Income and Housing. It is confidentialised and as such contains no names and addresses and the detail for some items of data has been reduced. Four individual microdata files are available; the basic files for HES and SIH are distributed on CD-ROM or can be accessed via the Remote Access Data Laboratory; the expanded files for HES and SIH are only able to be accessed via the Remote Access Data Laboratory. Subject to the limitation of sample size and the data classifications used, it is possible to manipulate the data, produce tabulations and undertake statistical analyses to individual specifications.
© Commonwealth of Australia 2013
Unless otherwise noted, content on this website is licensed under a Creative Commons Attribution 2.5 Australia Licence together with any terms, conditions and exclusions as set out in the website Copyright notice. For permission to do anything beyond the scope of this licence and copyright terms contact us.
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T07:49:27.000Z
|
gnnjcmn4gpgw3pl4uy2sc64tr2prxkf6
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40547",
"uncompressed_offset": 360434912,
"url": "www.eea.europa.eu/data-and-maps/figures/flood-plains-of-the-river",
"warc_date": "2013-11-22T19:22:56.000Z",
"warc_filename": "<urn:uuid:13f63844-c522-473f-8d3f-47f93bc4d98e>",
"warc_url": "http://www.eea.europa.eu/data-and-maps/figures/flood-plains-of-the-river"
}
|
cccc_CC-MAIN-2013-20
|
Personal tools
Sign up now!
Get notifications on new reports and products. Currently we have 55551 subscribers. Frequency: 3-4 emails / month.
Follow us
Twitter
Facebook
YouTube channel
RSS Feeds
Notifications archive
Write to us
For the public:
For media and journalists:
Contact EEA staff
Contact the web team
FAQ
Call us
Reception:
Phone: (+45) 33 36 71 00
Fax: (+45) 33 36 71 99
next
previous
items
Skip to content. | Skip to navigation
Sound and independent information
on the environment
You are here: Home / Data and maps / Maps and graphs / Flood plains of the river Elbe in the municipality of Dresden, Germany, during different flooding events
Flood plains of the river Elbe in the municipality of Dresden, Germany, during different flooding events
Created : Nov 22, 2010 Published : Dec 01, 2010 Last modified : Nov 29, 2012 11:38 AM
Topics: ,
The figure shows the flooded area in Dresden during different flood events
Download
Documents
Metadata
Related content
Data references
Used in publications
European Environment Agency (EEA)
Kongens Nytorv 6
1050 Copenhagen K
Denmark
Phone: +45 3336 7100
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T08:39:54.000Z
|
52od7yq7xmkmm5id6zdl7m67ooarscfg
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40548",
"uncompressed_offset": 364769815,
"url": "www.envirolink.org/resource.html?catid=4&itemid=200406080031510.482634",
"warc_date": "2013-11-22T19:22:56.000Z",
"warc_filename": "<urn:uuid:13f63844-c522-473f-8d3f-47f93bc4d98e>",
"warc_url": "http://www.envirolink.org/resource.html?itemid=200406080031510.482634&catid=4"
}
|
cccc_CC-MAIN-2013-20
|
advanced search
Category: Government Resources
Pennsylvania Material Trader
The Pennsylvania Material Trader is a free service offered by the Pennsylvania Small Business Development Centers to help promote the exchange of reusable materials with little or no market value. Through the Trader, companies with surplus or by-product materials connect with other businesses or individuals who can reuse these materials productively.
Ratings/Review of this resource:
E-Mail: questions@materialtrader.org
Website: http://www.materialtrader.org
Detailed Information:
Businesses or other organizations with surplus or waste materials, or the need for materials, can post on-line listings for available materials or wanted materials. Other businesses or organizations can search the listings to see if there are any materials they want or can use. When you post a listing, you include your contact information. Listers have the option of offering available materials for free or for a small fee.
Resources that may be related:
Home | Site Map | About EnviroLink | Advanced Search | Suggest a Resource
All content on this website is governed by a Creative Commons license.
This site powered by WebDNA
Community Information Systems provided by Rhiza Labs
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T09:03:46.000Z
|
pjk5zacsm67banlkhtw47vry4pn6jfvk
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40550",
"uncompressed_offset": 372989967,
"url": "www.familysearch.org/learn/wiki/en/Easton,_Maryland",
"warc_date": "2013-11-22T19:22:56.000Z",
"warc_filename": "<urn:uuid:13f63844-c522-473f-8d3f-47f93bc4d98e>",
"warc_url": "http://www.familysearch.org/learn/wiki/en/Easton,_Maryland"
}
|
cccc_CC-MAIN-2013-20
|
Easton, MarylandEdit This Page
From FamilySearch Wiki
United States > Maryland > Talbot County > Easton
Contents
Histories and Tidbits
Neighboring Communities
Family History Resources
Cemeteries
Community Web Sites
Historical and Genealogical Societies
Historical Newspapers
Histories, Biographies, And Genealogies
Libraries
Family History Web Sites
References
Need additional research help? Contact our research help specialists.
Need wiki, indexing, or website help? Contact our product teams.
Did you find this article helpful?
You're invited to explain your rating on the discussion page (you must be signed in).
• This page was last modified on 26 August 2010, at 15:14.
• This page has been accessed 304 times.
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T09:03:07.000Z
|
eacyi6syupd74kvwfn3whn5ya2i5mzxv
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40551",
"uncompressed_offset": 373001808,
"url": "www.familysearch.org/learn/wiki/en/FamilySearch_Wiki:Contributors_Meeting_21_June_2011",
"warc_date": "2013-11-22T19:22:56.000Z",
"warc_filename": "<urn:uuid:13f63844-c522-473f-8d3f-47f93bc4d98e>",
"warc_url": "http://www.familysearch.org/learn/wiki/en/FamilySearch_Wiki:Contributors_Meeting_21_June_2011"
}
|
cccc_CC-MAIN-2013-20
|
FamilySearch Wiki:Contributors Meeting 21 June 2011Edit This Page
From FamilySearch Wiki
Join the meeting, the ID is 7770
1 p.m. Mountain time on Tuesdays
New to this meeting?
• You can join up to 10 minutes early. If you try to join the meeting at any other time, you will get an error that the meeting doesn't exist.
• Prior to joining the meeting for the first time, run the MeetingPlace Test to verify that you can participate in a web meeting.
Purpose of the meeting
• To forge solutions with other community contributors.
• To discuss content, community, best practices, current issues, and strategy.
Be bold! Post your agenda items!
Feel free to post on the agenda any items you wish to discuss during the meeting. If your item requires details or feedback, post them on the discussion page and link to them from the agenda.
Introduce new members
Kudos go to ...
• Ana Cabrera: for getting the Great Illinois Genealogy Scavenger Hunt advertised in the FamilySearch Research Help Community Newsletter. We've already received 20 new submissions since it went out yesterday!! THANKS!!!
Business/Announcements
Forums Overview
Be part of the solution! Make your opinions known! Post comments to an existing thread or start a new discussion at Wiki Contributors Corner forum.
Current forum threads of interest:
Polls
• no new polls
New since last week
Comments added since last week
Decisions made since last week
Project Help Requests
Need help with your project? See a project that needs to be done? Add it here:
Training Requests
Improve the Wiki
Moderators and Adopters
• This page was last modified on 21 June 2011, at 18:56.
• This page has been accessed 202 times.
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T08:58:52.000Z
|
4saa5esq6ap6h5s53lkpkmm3awdkgsbn
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40552",
"uncompressed_offset": 378654710,
"url": "www.fides.org/en/news/31664?idnews=31664&lan=eng",
"warc_date": "2013-11-22T19:22:56.000Z",
"warc_filename": "<urn:uuid:13f63844-c522-473f-8d3f-47f93bc4d98e>",
"warc_url": "http://www.fides.org/en/news/31664?idnews=31664&lan=eng"
}
|
cccc_CC-MAIN-2013-20
|
http://www.fides.org
Africa
2012-06-05
AFRICA/LIBYA - "Libya is free, but it is a freedom that must be conquered," said Bishop Martinelli
Tripoli (Agenzia Fides) - "The situation is calm again. When we left this morning at 7 am after Mass, we did not notice anything special " said His Exc. Mgr. Giovanni Innocenzo Martinelli, Apostolic Vicar of Tripoli to Fides, where yesterday the tension had increased after the militia had occupied the civilian airport. The assault was led by Brigadier Al-Awfea of Tarhuna, a town 80 miles southeast of Tripoli, who calls for the release of one of his leaders, who has disappeared in unclear circumstances in Tripoli. After the occupation, air traffic was blocked. After a few hours the Deputy Minister of the Interior, Omar al-Khadrawi, announced that the authorities had regained control of the airport. The Deputy Minister said that dozens of assailants were arrested and their weapons confiscated.
"This is an episode that is part of an internal dialogue that must be built, hoping that dialogue is reached by abandoning weapons. Libya is free, but it is a freedom that must be re-conquered. It is continuous training to learn how to dialogue," underlines Mgr. Martinelli.
Tensions in Tripoli and Benghazi (where yesterday evening there were clashes between the military police and a local brigade) appear to be related to the elections for the Constituent Assembly, scheduled for mid-June but will likely be postponed. "The common opinion is that the elections will be postponed to July before the start of Ramadan," said Mgr. Martinelli. The Apostolic Vicar of Tripoli remains confident, however, on the evolution of Libya, and ensures that "the Catholic community continues its journey and service to the Libyan people with courage. Let us make Pope Benedict XVI’s exhortation our own: "courage", fully accepting his words." (L.M.) (Agenzia Fides 05/06/2012)
Share: Facebook Twitter Google Blogger Altri Social Network
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T08:20:39.000Z
|
a6j7oag2qimprqfb6urujafxjlytnkwg
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40556",
"uncompressed_offset": 402633006,
"url": "www.go4expert.com/forums/i-dont-command-exist-t16018/",
"warc_date": "2013-11-22T19:22:56.000Z",
"warc_filename": "<urn:uuid:13f63844-c522-473f-8d3f-47f93bc4d98e>",
"warc_url": "http://www.go4expert.com/forums/i-dont-command-exist-t16018/"
}
|
cccc_CC-MAIN-2013-20
|
i dont know a command... may not exist...
Skilled contributor
1Feb2009,16:58 #1
ok well, i was reading and i want to partake in a little project. but the tut was for a windows system(damn cmd)... and i use fedora... and in the tut they used a "net use" command. is there anything like this for a linux system?
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T09:01:21.000Z
|
sz5tw75omamq6myxlmmjclvttli243me
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40557",
"uncompressed_offset": 402640249,
"url": "www.go4expert.com/forums/witch-operating-internet-t23140/page2/",
"warc_date": "2013-11-22T19:22:56.000Z",
"warc_filename": "<urn:uuid:13f63844-c522-473f-8d3f-47f93bc4d98e>",
"warc_url": "http://www.go4expert.com/forums/witch-operating-internet-t23140/page2/"
}
|
cccc_CC-MAIN-2013-20
|
Banned
3Oct2011,12:27 #11
in my opinion windows XP-2 is best operting system than anyother windows ..
Go4Expert Member
21Oct2011,17:59 #12
I like windows 7... however if you'll be just working online and no much local application to run then I suggest you use ubuntu as this is more resistant to virus.
Newbie Member
22Oct2011,04:20 #13
W7&FF is better
Light Poster
22Oct2011,14:52 #14
it depends on your hardware, software specification and configuration and internet connection. OS like XP n 7 are much better. hopefully useful.
Banned
29Dec2011,16:06 #15
Hey friends,
Thank you for yours valuable suggestion, The best Microsoft Windows operating system to use depends on what its intended use will be and who will be using it. There is no specific operating system which can be called "the best" overall, and since most current operating systems share most common and advanced features there is much debate on the topic. A few of the most popular operating system, their pros and cons, and some of their best uses are described below.
Thanks a lot again
Carly Fiorina
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T08:53:34.000Z
|
yrvrlmnuksii7l5ndnnz6i627jd4t3mt
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40563",
"uncompressed_offset": 436957695,
"url": "www.isfdb.org/cgi-bin/ea.cgi",
"warc_date": "2013-11-22T19:22:56.000Z",
"warc_filename": "<urn:uuid:13f63844-c522-473f-8d3f-47f93bc4d98e>",
"warc_url": "http://www.isfdb.org/cgi-bin/ea.cgi?1954"
}
|
cccc_CC-MAIN-2013-20
|
Peter Hamilton, Jr. - Summary Bibliography
You are not logged in. If you create a free account and sign in, you will be able to customize what is displayed.
Pseudonym. See: Peter Hamilton (or view all titles by this pseudonym here)
Copyright (c) 1995-2011 Al von Ruff.
ISFDB Engine - Version 4.00 (04/24/06)
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T08:43:33.000Z
|
ea4hhqvmfo2hkw2ep3rth6lqfwiyhx4k
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40564",
"uncompressed_offset": 436960551,
"url": "www.isfdb.org/cgi-bin/title.cgi",
"warc_date": "2013-11-22T19:22:56.000Z",
"warc_filename": "<urn:uuid:13f63844-c522-473f-8d3f-47f93bc4d98e>",
"warc_url": "http://www.isfdb.org/cgi-bin/title.cgi?127234"
}
|
cccc_CC-MAIN-2013-20
|
Bibliography: Books (F&SF, July 1999)
You are not logged in. If you create a free account and sign in, you will be able to customize what is displayed.
Title: Books (F&SF, July 1999)
Author: Douglas E. Winter
Year: 1999
Type: ESSAY
Series: Books (F&SF)
ISFDB Record Number: 127234
User Rating: This title has fewer than 5 votes. VOTE
Current Tags: None Add Tags
Publications:
Copyright (c) 1995-2011 Al von Ruff.
ISFDB Engine - Version 4.00 (04/24/06)
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T08:47:50.000Z
|
uv4bh6j5cu534ubzmgd7qqko3g6l4yny
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40573",
"uncompressed_offset": 466958836,
"url": "www.libreoffice.org/download/?lang=gu&type=rpm-x86_64&version=3.6.4",
"warc_date": "2013-11-22T19:22:56.000Z",
"warc_filename": "<urn:uuid:13f63844-c522-473f-8d3f-47f93bc4d98e>",
"warc_url": "http://www.libreoffice.org/download/?type=rpm-x86_64&lang=gu&version=3.6.4"
}
|
cccc_CC-MAIN-2013-20
|
The free office suite
Download LibreOffice
LibreOffice Linux - rpm (x86_64), version 3.6.4, Gujarati. Not the version you wanted? Change System, Version or Language
You need to download and install these files in order:
• Source code
LibreOffice is an open source project and you can therefore download the source code to build your own installer.
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T08:34:12.000Z
|
tkzsaua2al6ilabpzyvxct3qswpmnf43
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40574",
"uncompressed_offset": 482559625,
"url": "www.mdpi.com/1660-3397/10/10/2234",
"warc_date": "2013-11-22T19:22:56.000Z",
"warc_filename": "<urn:uuid:13f63844-c522-473f-8d3f-47f93bc4d98e>",
"warc_url": "http://www.mdpi.com/1660-3397/10/10/2234"
}
|
cccc_CC-MAIN-2013-20
|
Mar. Drugs 2012, 10(10), 2234-2245; doi:10.3390/md10102234
Article
Biosynthetic Studies on Water-Soluble Derivative 5c (DTX5c)
1 University Institute for Bio-Organic Chemistry “Antonio González”, University of La Laguna, Av. Astrofísico Francisco Sánchez 2, La Laguna 38206, Spain 2 Department of Organic Chemistry, Faculty of Pharmacy, University of La Laguna, Av. Astrofísico Francisco Sánchez s/n, La Laguna 38206, Spain 3 Department of Chemical Engineering and Pharmaceutical Technology, Faculty of Pharmacy, University of La Laguna, Av. Astrofísico Francisco Sánchez s/n, La Laguna 38206, Spain
* Authors to whom correspondence should be addressed.
Received: 10 August 2012; in revised form: 18 September 2012 / Accepted: 20 September 2012 / Published: 12 October 2012
Download PDF Full-Text [1272 KB, uploaded 12 October 2012 13:36 CEST]
Abstract: The dinoflagellate Prorocentrum belizeanum is responsible for the production of several toxins involved in the red tide phenomenon known as Diarrhetic Shellfish Poisoning (DSP). In this paper we report on the biosynthetic origin of an okadaic acid water-soluble ester derivative, DTX5c, on the basis of the spectroscopical analysis of 13C enriched samples obtained by addition of labelled sodium [l-13C], [2-13C] acetate to artificial cultures of this dinoflagellate.
Keywords: biosynthesis; marine toxin; DSP; marine polyether; polyketide
Article Statistics
Click here to load and display the download statistics.
Cite This Article
MDPI and ACS Style
Vilches, T.S.; Norte, M.; Daranas, A.H.; Fernández, J.J. Biosynthetic Studies on Water-Soluble Derivative 5c (DTX5c). Mar. Drugs 2012, 10, 2234-2245.
AMA Style
Vilches TS, Norte M, Daranas AH, Fernández JJ. Biosynthetic Studies on Water-Soluble Derivative 5c (DTX5c). Marine Drugs. 2012; 10(10):2234-2245.
Chicago/Turabian Style
Vilches, Tamara S.; Norte, Manuel; Daranas, Antonio H.; Fernández, José J. 2012. "Biosynthetic Studies on Water-Soluble Derivative 5c (DTX5c)." Mar. Drugs 10, no. 10: 2234-2245.
Mar. Drugs EISSN 1660-3397 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T07:44:35.000Z
|
tfdiplfdit7s5oy7tppnjnhr54vsi6wi
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40578",
"uncompressed_offset": 518328239,
"url": "www.ohloh.net/forums/10/topics/4051",
"warc_date": "2013-11-22T19:22:56.000Z",
"warc_filename": "<urn:uuid:13f63844-c522-473f-8d3f-47f93bc4d98e>",
"warc_url": "http://www.ohloh.net/forums/10/topics/4051"
}
|
cccc_CC-MAIN-2013-20
|
"Negative line counts for Launchpad"
The code analysis for Launchpad gives negative line counts for SQL and HTML:
https://www.ohloh.net/p/launchpad/analyses/latest
These negative values were present in the original analysis and appear to have grown larger since then:
https://www.ohloh.net/p/launchpad/analyses/741055
For example, the HTML line count has gone from -4,430 (2nd Sep) to -4,689 (1st Nov).
It is a Bazaar enlistment if that makes a difference.
James Henstridge
over 3 years ago
Hi James,
I highly suspect that this is caused by a design flaw in Ohloh's source control importer.
It's the same problem discussed in this post. That post should help explain what's going wrong.
It affects all source control systems that arrange their commits as a DAG. When parallel changes occur on more than one branch and then are merged back into the main line, Ohloh's line counts will not balance.
For example, if you add a file on the main line, then remove it on two different branches, and then merge both of those branches back into the main line, you can end up with a history log that shows two file deletions but only one file addition. This breaks Ohloh's line counts.
It's purely Ohloh's fault, and it's an artifact of trying to adapt the analysis tools we originally created for CVS and Subversion (which have simple, linear commit histories) and trying to apply these tools to SCMs that use non-linear commit graphs.
I do hope we'll fix it soon. For now, I think we're stuck with this sorts of issues whenever repositories have lots of branching and merging. :-(
Robin Luckey
over 3 years ago
Copyright © 2013 Black Duck Software, Inc. and its contributors, Some Rights Reserved. Unless otherwise marked, this work is licensed under a Creative Commons Attribution 3.0 Unported License . Ohloh ® and the Ohloh logo are trademarks of Black Duck Software, Inc. in the United States and/or other jurisdictions. All other trademarks are the property of their respective holders.
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T08:34:05.000Z
|
5zcezbpq5pcxur4v6ct4zy7qhkapiju7
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40585",
"uncompressed_offset": 525811455,
"url": "www.panarmenian.net/eng/news/145480/",
"warc_date": "2013-11-22T19:22:56.000Z",
"warc_filename": "<urn:uuid:13f63844-c522-473f-8d3f-47f93bc4d98e>",
"warc_url": "http://www.panarmenian.net/eng/news/145480/"
}
|
cccc_CC-MAIN-2013-20
|
Italy’s ex-spy chief sentenced to 10 years in jail over CIA case
PanARMENIAN.Net - Italy's former military intelligence chief was sentenced to 10 years in jail on Tuesday, February 12 for his role in the kidnapping of an Egyptian Muslim cleric in an operation organized by the United States, Reuters said.
An American former CIA station chief was this month sentenced in absentia to seven years in jail after imam Abu Omar was snatched from a Milan street in 2003 and flown to Egypt for interrogation during the United States' "war on terror".
The Milan appeals court sentenced Niccolo Pollari, former head of the Sismi military intelligence agency, to 10 years in prison and his former deputy Marco Mancini to nine years.
The court also awarded a provisional 1 million euros in damages to the imam, the Ansa news wire reported, as well as 500,000 euros to the imam's wife.
Nicola Madia, a lawyer for Pollari, said he was disturbed by the decision and that his client would appeal to Italy's highest court. Pollari will not have to go to jail until the appeals process has been exhausted.
Madia said Pollari had not been able to defend himself properly because successive Italian governments had declared the case to be covered by state secrecy laws.
The sentences are part of the fallout from a campaign waged by then U.S. president George W. Bush after the September 11, 2001, attacks on the United States.
Abu Omar says he was tortured for seven months after being flown to Egypt in what was known as an "extraordinary rendition" operation. He was resident in Italy at the time of his abduction.
Former CIA Rome station chief Jeffrey Castelli and two other American officials were convicted in their absence by the Milan appeals court for their part in the plot, but are unlikely to serve their sentences.
Human rights groups have been fighting to expose heavy-handed tactics used by the CIA during the Bush administration.
Partner news
Top stories
Jorge Rafael Videla, an austere former army commander, led Argentina during the bloodiest days of its Dirty War dictatorship.
According to the United Nations, April was Iraq's bloodiest month for almost five years, with 712 people killed.
Reports suggest the rebel fighters may have tried to blow up the walls of the prison, which holds some 4,000 inmates.
Moscow has condemned other nations for supporting rebel forces and failing to condemn what it describes as terrorist attacks on the Syrian regime.
Partner news
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T09:01:08.000Z
|
3ymmqopszbld25hpfywjblsymrajfb7y
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40590",
"uncompressed_offset": 585768609,
"url": "www.sourcewatch.org/index.php?title=John_Hall",
"warc_date": "2013-11-22T19:22:56.000Z",
"warc_filename": "<urn:uuid:13f63844-c522-473f-8d3f-47f93bc4d98e>",
"warc_url": "http://www.sourcewatch.org/index.php?title=John_Hall"
}
|
cccc_CC-MAIN-2013-20
|
CMD sent two reporters to track ALEC in Oklahoma
Click here to help support our future investigations.
John Hall
From SourceWatch
Jump to: navigation, search
John Hall previously served the 19th Congressional district of New York
John Hall, a Democrat, is a former U.S. Representative for the 19th Congressional District of New York, having served 2007 to 2011. (map) [1]
Contents
Record and controversies
General information about important bills and votes for can be found in Congresspedia's articles on legislation. You can add information you find on how John Hall voted by clicking the "[edit]" link to the right and typing it in. Remember to cite your sources!
Iraq War
For more information see the chart of U.S. House of Representatives votes on the Iraq War.
Environmental record
For more information on environmental legislation, see the Energy and Environment Policy Portal
Nuclear energy
Indian Point Energy Center (IPEC) is a three-unit nuclear power plant station located on the east bank of the Hudson River, about twenty-four miles north of New York City (within Hall’s district). During Hall’s 2006 campaign for Congress, he released a 34-page plan for a national Sustainable Energy Center to replace the nuclear plant at Indian Point. He stated, “I have called for the closure of Indian Point on many occasions, and now, with undetermined amounts of radioactive water leaking from the plant, it may be more appropriate than ever to shut it down. But opposition to nuclear power also carries with it the corollary of supporting sustainable energy.” [1] (Read Rep. Hall’s full proposal)
Several weeks into Hall’s first term, several blogs (the Congressman John Hall Blog and the Green Nuclear Butterfly Blog) criticized Hall for his inaction relating to the nuclear plant. At the time, he had not introduced any legislation pertaining to the matter. During the 109th Congress, before Hall was elected to Congress, Rep. Maurice Hinchey (D-N.Y.) introduced a bill in the House, “to require the Nuclear Regulatory Commission to conduct an independent safety assessment of the Indian Point Nuclear Power Plant.” Sen. Hillary Clinton (D-N.Y.) introduced a Senate version. Neither, however, made it to the floor for a vote. [2] [3]
Veteran's health
On March 21, 2007, the House considered a bill, Veterans' Compensation Cost-of-Living Adjustment Act of 2007, sponsored by Rep. Hall to raise compensation rates for veterans with service-connected disabilities, as well as the rates determining dependency and indemnity compensation for survivors of some disabled veterans. Clothing allowance increases would also be included. The scope of the rate increases were not specified in the bill; rather, it authorized the Department of Veterans Affairs to institute and publish the enhanced rate increases in the near future. The bill passed 418-0.
Main article: U.S. veterans and soldiers legislation
Biography
Hall was born on July 23, 1948 in Baltimore, Maryland. He was a student at Notre Dame University when he quit to pursue a career in music. Songwriting and session time with such artists as Janis Joplin, Seals & Crofts and Bonnie Raitt preceded his founding of Orleans in January 1972 in Ulster County, New York with Wells Kelly and Larry Hoppen. [4]
In 1977, Hall left the band to begin a solo career and became active in the anti-nuclear movement, co-founding Musicians United for Safe Energy. Another group, the John Hall Band, released two solo albums, but disbanded after limited chart success. Hall spent the next few decades writing songs for other artists and reunited with Orleans in 1990, 1996, and 2000. In 2005 he released the album, Rock Me on the Water. [5]
Political career
In late October 2004, Hall publicly commented that the presidential campaign of George W. Bush never received permission to use the Orleans song "Still the One" at campaign events. The campaign responded by dropping the song from their playlist.
In 1989, Hall was elected to the Ulster County Legislature. In the late nineties, after three successive school budgets were rejected by the voters, John ran for, and was elected twice to, the Saugerties Board of Education. His fellow trustees elected him president, and budgets were passed each year of Hall's tenure.
Hall ran in the September 2006 primary race as Democrat in New York. He won the primary, with a commanding 48% in a 4-way race, and faced incumbent Rep. Sue Kelly (R-N.Y.) in the general election. Hall's platform favored universal healthcare, intensive alternative energy initiatives, and complete funding of No Child Left Behind. [6]
2006 election
Hall defeated Republican Rep. Sue Kelly 51% to 49% to win a seat in the 110th Congress. [7]
2010 election
Hall lost his seat to Republican Nan Hayworth.[1]
Money in politics
This section contains links to – and feeds from – money in politics databases. <crpcontribdata>cid=N00027888&cycle=2006</crpcontribdata>
Links to more campaign contribution information for John Hall
from the Center for Responsive Politics' OpenSecrets.org site.
Fundraising profile: 2006 election cycle Career totals
Top contributors by organization/corporation: 2006 election cycle Career totals
Top contributors by industry: 2006 election cycle Career totals
Committees and affiliations
More background data
Background information on Sue Kelly, whom John Hall challenged in the 2006 congressional elections:
Former contact
Washington D.C. Office:
1217 Longworth House Office Bldg
Washington, DC 20515
Phone: (202) 225-5441
Fax: (202) 225-3289
Web Email
Website
Goshen Office:
Orange County Gov’t Center
255 Main St., Room 3232G
Goshen, NY 10924
Phone: (845) 291-4100
Fax: (845) 291-4164
Carmel Office:
40 Gleneida Avenue, 3rd Floor
Carmel, New York 10512
Phone: 845-225-3641 ext. 371
Fax: 845-228-1480
Articles and resources
Resources
References
1. 1.0 1.1 John Hall profile, The Washington Post, accessed January 2011.
Local blogs and discussion sites
Articles
Corresponding article on Wikipedia and Cause Caller. (If Cause Caller link does not work, pick from its list of senators and representatives.)
Current Office: U.S. House of Representatives
111th Congress
Leadership Position:
Committees Chaired:
Committees,
Ranking Member On:
Caucuses:
Committees:
110th Congress
Leadership Position:
None
Committees Chaired:
House Committee on Veterans' Affairs/Subcommitee on Disability Assistance and Memorial Affairs
Committees,
Ranking Member On:
Caucuses:
Committees: House Select Committee on Energy Independence and Global Warming, House Committee on Transportation and Infrastructure, House Committee on Transportation and Infrastructure/Subcommittee on Aviation, House Committee on Transportation and Infrastructure/Subcommittee on Water Resources and Environment, House Committee on Veterans' Affairs, House Committee on Veterans' Affairs/Subcommittee on Disability Assistance and Memorial Affairs, House Committee on Veterans' Affairs/Subcommittee on Economic Opportunity
Congressional Career
First Elected to Current Office:
November 7, 2006
First Took Current Office:
January 4, 2007
Next Election:
November 2, 2010
Term Ends:
Freshman Member?
No
Previous Political Work?
Saugerties Board of Education
Other Party Membership:
District Offices:
1. Orange County Gov’t Center 255 Main St., Room 3232G Goshen, NY 10924
Phone: 845-291-4100 / Fax: 845-291-4164
2. 40 Gleneida Avenue, 3rd Floor Carmel, New York 10512
Phone: 845-225-3641 ext. 371 / Fax: 845-228-1480
Campaign Contact:
Website:
Webform Email: / Email:
Campaign Offices:
1.
Phone: / Fax:
Zip Code Affiliations:
Misc:
Date of Birth: July 23, 1948
Personal tools
Namespaces
Variants
Actions
Navigation
How To
Other Info
Other Policies
Google AdSense
Toolbox
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T08:50:59.000Z
|
xact44l6ykzcngbbq5vrdbyujn5wn2wk
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40597",
"uncompressed_offset": 660096166,
"url": "www.werelate.org/wiki/Place:Terre_Haute,_Vigo,_Indiana,_United_States",
"warc_date": "2013-11-22T19:22:56.000Z",
"warc_filename": "<urn:uuid:13f63844-c522-473f-8d3f-47f93bc4d98e>",
"warc_url": "http://www.werelate.org/wiki/Place:Terre_Haute,_Vigo,_Indiana,_United_States"
}
|
cccc_CC-MAIN-2013-20
|
Place:Terre Haute, Vigo, Indiana, United States
Watchers
NameTerre Haute
TypeCity
Coordinates39.47°N 87.39°W
Located inVigo, Indiana, United States (1750 - )
source: Getty Thesaurus of Geographic Names
source: Family History Library Catalog
the text in this section is copied from an article in Wikipedia
Terre Haute is a city and the county seat of Vigo County, Indiana, United States, near the state's western border with Illinois. As of the 2010 census, the city had a total population of 60,785 and its metropolitan area had a population of 170,943. The city is the county seat of Vigo County and the self-proclaimed capital of the Wabash Valley. Terre Haute was named the 'Community of the Year' in 2010 by the Indiana Chamber.
History
the text in this section is copied from an article in Wikipedia
The name of the city has been derived from the French phrase terre haute (pronounced in French), meaning "High Ground". It was named by French explorers in the area in the early 18th century to describe the unique location in the Wabash Valley and beside the Wabash River (see French colonization of the Americas). When the area was claimed by the French and English, these highlands were considered the border between Canada and Louisiana.
During "Tecumseh's War" in 1811, the construction of Fort Harrison during an expedition led by William Henry Harrison marked the known beginning of a permanent population of European-Americans. A Wea village called Weautano (also known as "Rising Sun" and "Old Orchard Town") already existed near the fort. Captain Zachary Taylor defended the fort from a British–inspired attack by an estimated 600 Native Americans during the Battle of Fort Harrison on September 4, 1812. The orchards and meadows kept by the local Wea populations became the site of present–day Terre Haute, a few miles south of Fort Harrison. Before 1830, the few remaining Wea had departed under pressure from white settlement.
The village of Terre Haute, then a part of Knox County, Indiana, was platted in 1816. Its early identity was as an agricultural and pork-packing center and as a port on the then-navigable Wabash River for steamboats and other river-craft. Between 1835 and late 1839, Terre Haute served as the headquarters for the U.S. Army Corps of Engineers under Major Cornelius A. Ogden during the construction of the National Road. As a result, a number of West Point graduates and other highly educated people located in the town. Wealthy Terre Haute entrepreneur Chauncey Rose built The Prairie House, a fancy hotel, in 1838 primarily to accommodate those families. In 1855, the name of The Prairie House was changed to the Terre Haute House.
Development in anticipation of completion of the Wabash and Erie Canal, the longest man-made body of water in the western hemisphere, also brought prosperity to the community. The canal finally reached Terre Haute in October 1849. Founded by Chauncey Rose, the Terre Haute and Richmond Railroad began operations between Terre Haute and Indianapolis in February 1852 and its traffic soon surpassed that on the canal. The name of the Terre Haute and Richmond Railroad (West of Indianapolis) soon was changed to the Terre Haute and Indianapolis Railroad. It became the operating company of the Vandalia Railroad System. The community quickly gained the reputation as a transportation hub.
In 1832, Terre Haute became a town and, in May 1853, elected to become a city. After the American Civil War, it developed into an industrial and mining center, with iron and steel mills, hominy plants and, late in the 19th century, distilleries, breweries, coal mines and coal operating companies. Business boomed.
Terre Haute's Famous "Four-Cornered" Race Track was the site of more than 20 world harness racing records and helped trigger the city's reputation as a sporting center. The bustling economy also led to establishing several institutes of higher education: Saint Mary-of-the Woods Institute (now Saint Mary-of-the-Woods College), John Covert's Terre Haute Female College, Indiana State Normal School (now Indiana State University), Terre Haute School of Industrial Science (now Rose-Hulman Institute of Technology) and Coates College for Women. The city developed culture and a reputation in the arts. As a base of industry, it also developed a strong tradition of union activity, which resulted in hosting a two-day conclave beginning on August 3, 1881, of the National Trade Union Congress, renamed the Federation of Organized Trades and Labor Unions of the U.S. and Canada. In 1886, the Federation was renamed the American Federation of Labor. The city also produced labor leader Eugene V. Debs.
The city's river traffic contributed to its reputation for being "wide open", with gambling and a well-developed "red light district". The latter was not fully eliminated until urban renewal of the riverfront in the 1960s. During the second decade of the 20th century, Terre Haute was rocked by political scandal and that reputation persisted for several decades. In 1955, Terre Haute was labeled Sin City by the monthly magazine Stag.
Prohibition had a major adverse impact on the city's economy. It forced the closure of several distilleries and all but one brewery, which reduced its payroll by 70% and converted to produce root beer. Four large glass manufacturing firms drastically reduced production, and two eventually closed. The Root Glass Company survived, primarily because it had secured the patent for the Coca-Cola bottle in 1915. Two of the distilleries were sold to Commercial Solvents Corporation, which acquired the rights to produce acetone from Chaim Weizmann in exchange for royalties.
With some aspects of the economy booming in the mid-1920s, the owners of the Terre Haute House decided to demolish their older building and erect a grand edifice befitting such a modern city as Terre Haute. In 1928, the new Terre Haute House opened, attracting the wealthy – famous and infamous alike – to its luxurious splendor. Al Capone is rumored to have been a guest in the new hotel's early years. After closing in 1970, the structure remained nonoperational for 35 years until 2005 when it was sold to a local developer. He demolished it and two other properties on the same block and sold the property to Dora Brothers Hospitality for development of a Hilton Garden Inn.
Research Tips
This page uses content from the English Wikipedia. The original content was at Terre Haute, Indiana. The list of authors can be seen in the page history. As with WeRelate, the content of Wikipedia is available under the Creative Commons Attribution/Share-Alike License.
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T08:26:29.000Z
|
z5lnnkp2eyja3ppbhlh7pyksaz3frncx
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40611",
"uncompressed_offset": 9182870,
"url": "answers.onstartups.com/questions/41043/what-should-i-offer-a-startup-advisor?answertab=active",
"warc_date": "2013-11-22T19:24:13.000Z",
"warc_filename": "<urn:uuid:57a60f5f-b60e-41e7-9169-fb441e04293b>",
"warc_url": "http://answers.onstartups.com/questions/41043/what-should-i-offer-a-startup-advisor?answertab=active"
}
|
cccc_CC-MAIN-2013-20
|
Tell me more ×
Answers OnStartups is a question and answer site for entrepreneurs looking to start or run a new business. It's 100% free, no registration required.
I've searching for advisors in NYC area.I have no idea what kind of deals are being offered to advisors. I need someone to help me to clear it up for me. I don't want to offer a deal that maybe disrespectful.
share|improve this question
1 Answer
up vote 1 down vote accepted
You may want to consider using the Founders Institutes Founder Advisor Standard Template (FAST) (Link to .doc file) - as a starting point.
Also - techcrunch did a how much for advisors? article late 2011 - still relevant. I esp. like the way the article defines company maturity level, expected time commitment and ranges. Everyone will argue about whether the numbers are valid, but at least there is a reference to go from.
Also: I would say that the initial contact is important - there are lots of newco's looking for free advice, so indicating up front the company maturity level, what type of commitment the newco is looking for, and what remuneration options are available (equity, advisory fees) will help separate the "looking for free advice" from "looking for a partnership" requests.
share|improve this answer
Your Answer
discard
By posting your answer, you agree to the privacy policy and terms of service.
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T07:39:39.000Z
|
pby6i2tzci6k7skqqun52xigrspsirmh
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40616",
"uncompressed_offset": 13395391,
"url": "arthritis-research.com/content/6/3/107/abstract",
"warc_date": "2013-11-22T19:24:13.000Z",
"warc_filename": "<urn:uuid:57a60f5f-b60e-41e7-9169-fb441e04293b>",
"warc_url": "http://arthritis-research.com/content/6/3/107/abstract"
}
|
cccc_CC-MAIN-2013-20
|
Commentary
Citrullinated proteins: sparks that may ignite the fire in rheumatoid arthritis
Erik R Vossenaar* and Walther J van Venrooij
Author Affiliations
Department of Biochemistry, University of Nijmegen, Nijmegen, The Netherlands
For all author emails, please log on.
Arthritis Res Ther 2004, 6:107-111 doi:10.1186/ar1184
Published: 19 April 2004
Abstract
Antibodies directed to citrullinated proteins (e.g. anti-CCP [cyclic citrullinated peptide] antibodies) are highly specific for rheumatoid arthritis (RA). These antibodies are produced at the site of inflammation in RA, and therefore citrullinated antigens are also expected to be present in the inflamed synovium. We discuss literature showing that the presence of citrullinated proteins in the synovium is not specific for RA. The RA-specific antibodies are therefore most likely the result of an abnormal immune response that specifically occurs in RA patients. It was recently shown that presence of anti-CCP antibodies precedes the onset of clinical symptoms of RA by years. It thus appears that it may take years for initial events that cause the generation of anti-CCP antibodies to develop into full-blown disease.
Keywords:
anti-CCP autoantibodies; citrullination; peptidylarginine deiminase; rheumatoid arthritis
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T08:50:09.000Z
|
rfejzj5ewmddwaxk7g2iuezsja34kgc3
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40647",
"uncompressed_offset": 64550508,
"url": "dotnetkicks.com/stories/15890/NHibernate_hiding_ID_setters",
"warc_date": "2013-11-22T19:24:13.000Z",
"warc_filename": "<urn:uuid:57a60f5f-b60e-41e7-9169-fb441e04293b>",
"warc_url": "http://dotnetkicks.com/stories/15890/NHibernate_hiding_ID_setters"
}
|
cccc_CC-MAIN-2013-20
|
Error!
Success!
NHibernate: hiding ID setters
0
kicks
NHibernate: hiding ID setters (Unpublished)
Encapsulation is a key concern in object oriented development. Sometimes you have to break encapsulation a bit to make your code interoperable with the infrastructure. In this article I explain how to make a domain entity play well with NHibernate while keeping an encapsulated interface towards the user.
Kicked By:
Drop Kicked By:
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T07:49:51.000Z
|
2n4d5z6uclk3cvgyuy52r4ytzdsse2d6
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40648",
"uncompressed_offset": 64557450,
"url": "dotnetkicks.com/stories/26084/How_and_why_to_write_testable_code",
"warc_date": "2013-11-22T19:24:13.000Z",
"warc_filename": "<urn:uuid:57a60f5f-b60e-41e7-9169-fb441e04293b>",
"warc_url": "http://dotnetkicks.com/stories/26084/How_and_why_to_write_testable_code"
}
|
cccc_CC-MAIN-2013-20
|
Error!
Success!
How and why to write testable code
0
kicks
How and why to write testable code (Unpublished)
In my personal experiance, highly testable code often equals good code. My deffinition of good code is that it should be loosly coupled layers, follow basic object oriented principals, small methods, good readability and it shouldn´t have much code duplication. I find, that if you think about testing or use TDD while writing your code, you will automaticly follow those "rules" pretty good.
Kicked By:
Drop Kicked By:
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T08:39:33.000Z
|
l7jnrxtbl7abucfd7kfqltehvmguhzkn
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40650",
"uncompressed_offset": 66841364,
"url": "dungeons.wikia.com/wiki/UA:Character_Flaws?oldid=12254",
"warc_date": "2013-11-22T19:24:13.000Z",
"warc_filename": "<urn:uuid:57a60f5f-b60e-41e7-9169-fb441e04293b>",
"warc_url": "http://dungeons.wikia.com/wiki/UA:Character_Flaws?oldid=12254"
}
|
cccc_CC-MAIN-2013-20
|
Wikia
UA:Character Flaws
Talk0
9,503pages on
this wiki
Revision as of 08:14, August 11, 2009 by Surgo (Talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
This material is published under the OGL
Character Flaws Edit
Flaws are like the flip side of feats. Whereas a feat enables a character to be better than normal at performing a task (or even to do something that normal characters can't), a flaw restricts a character's capabilities or imposes a penalty of some sort.
A player may select up to two flaws when creating a character. After 1st level, a character cannot take on additional flaws unless the Dungeon Master specifically allows it (for examples of times when doing this might be appropriate, see Character Traits). Each flaw a player selects entitles his character to a bonus feat. In other words, when you create a character, if you select two flaws, you can also take two bonus feats beyond those your character would be normally entitled to.
Unlike traits, flaws are entirely negative in their impact on a character's capabilities.
Metagame Analysis: Creating Flaws Edit
You can create new flaws, but be careful: Flaws can unbalance your game. When creating flaws, keep a few issues in mind:
1. A flaw must have a numeric effect on a character's specific capabilities. Flaws with primarily roleplaying or story effects have unpredictable effects on game balance.
2. Flaws are generally bigger in magnitude than feats. That's because players always choose flaws that have the least impact on their characters, while taking feats that have the most. For example, while a feat affecting skills grants a +2 bonus on two skills, its counterpart flaw might impose a -4 penalty on two skills.
3. A flaw must have a meaningful effect regardless of character class or role. That way, a player can't reduce the flaw's importance through multiclassing. For instance, a flaw that only affects spellcasters might seem reasonable - but for nonspellcaster characters, the flaw likely proves meaningless. Even if you restrict the selection of such feats to characters of specific classes, a player can easily select a spellcasting class at 1st level, choose two flaws that apply to spellcasters, gain the bonus feats, multiclass into a nonspellcasting class at 2nd level and thereafter proceed as a primarily nonspellcasting character. The player has sacrificed a level to gain two bonus feats, a tradeoff that appeals to some players.
4. Similarly, a flaw that penalizes a character's Charisma based skill checks only has a significant impact on the party spokesperson - the quiet fighter or barbarian likely won't feel any impact from the penalties.
Flaw Descriptions Edit
Each of the flaws described here has a specific game effect. Some flaws can only be taken by a character who meets a special requirement.
Feeble
Frail
Inattentive
Meager Fortitude
Murky-Eyed
Noncombatant
Pathetic
Poor Reflexes
Shaky
Slow
Unreactive
Vulnerable
Weak Will
Back to Main PageVariant RulesBuilding Characters
This page is protected from editing because it is distributed under the OGL. Please discuss possible problems or changes on the talk page.
Advertisement | Your ad here
Photos
Add a Photo
1,231photos on this wiki
See all photos >
Recent Wiki Activity
See more >
Around Wikia's network
Random Wiki
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T08:18:11.000Z
|
sncswebm3rcswjj6cloz544mzrgoc2c6
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40655",
"uncompressed_offset": 71552698,
"url": "elinux.org/index.php?oldid=3979&title=System_Size",
"warc_date": "2013-11-22T19:24:13.000Z",
"warc_filename": "<urn:uuid:57a60f5f-b60e-41e7-9169-fb441e04293b>",
"warc_url": "http://elinux.org/index.php?title=System_Size&oldid=3979"
}
|
cccc_CC-MAIN-2013-20
|
System Size
From eLinux.org
Revision as of 20:19, 26 July 2007 by TimBird (Talk | contribs)
Jump to: navigation, search
Here are some links to information and projects related to Linux system size.
Contents
Documentation on reducing kernel size
Kernel Size Tuning Guide is a draft of a document on the subject of measuring and reducing the size of the Linux kernel
Technologies for decreasing system size
The Linux-tiny patchset
• see the Linux Tiny page. There is a project to characterize the sub-patches in the Linux-tiny patchset, in order to prioritize them for porting to non-x86 architectures.
• see Linux Tiny Test Project
Compiler options for reducing kernel size
An LWN article talks about three gcc options to shrink the kernel.
Shrinking the Kernel with GCC
The first option is -Os which is already in the tiny kernel patch.
The second option is new in gcc 3.4, -funit-at-a-time. This apparently makes gcc do a much better job of inlining and dead code removal. It reduces the size of both text and data. It depends on another inlining patch that I think is in the tiny kernel patch (maybe same idea but different details).
The third option, -mregparm=3, seems to be x86 specific, it instructs the compiler to use registers for the first three function arguments. by John Rigby
SquashFS file system
For read-only data, it is useful to utilize a compressed file system. The following are used heavily in embedded systems:
• Cramfs - [should put some information or link here]
• SquashFS - see the Squash Fs page
Use of a smaller libc
• uClibc - small footprint but complete C library
• klibc - very small library for use in init ram filesystems
• dietlibc - another library to produce very small statically compiled executables.
• Subset Libc Specification - CELF is researching the possibility of creating a subset libc specification
Kernel XIP
By executing the kernel in-place from flash, it is possible to save RAM space.
Application XIP
By executing applications in-place from flash, it is possible to save RAM space.
• see ApplicationXIP
Data Read In Place (DRIP)
This is a technique for keeping data in flash, until it is written to, and then making a RAM page for it.
Size measurement tools and techniques
How to measure the kernel image size
• to see the size of the major kernel sections (code and data):
size vmlinux */built-in.o
[tbird@crest ebony]$ size vmlinux */built-in.o
text data bss dec hex filename
2921377 369712 132996 3424085 343f55 vmlinux
764472 35692 22768 822932 c8e94 drivers/built-in.o
918344 22364 36824 977532 eea7c fs/built-in.o
18260 1868 1604 21732 54e4 init/built-in.o
39960 864 224 41048 a058 ipc/built-in.o
257292 14656 34516 306464 4ad20 kernel/built-in.o
34728 156 2280 37164 912c lib/built-in.o
182312 2704 736 185752 2d598 mm/built-in.o
620864 20820 26676 668360 a32c8 net/built-in.o
1912 0 0 1912 778 security/built-in.o
133 0 0 133 85 usr/built-in.o
• to see the size of the largest kernel symbols:
• nm --size -r vmlinux
[tbird@crest ebony]$ nm --size -r vmlinux | head -10
00008000 b read_buffers
00004000 b __log_buf
00003100 B ide_hwifs
000024f8 T jffs2_garbage_collect_pass
00002418 T journal_commit_transaction
00002400 b futex_queues
000021a8 t jedec_probe_chip
00002000 b write_buf
00002000 D init_thread_union
00001e6c t tcp_ack
How to measure the memory usage at runtime
See Runtime Memory Measurement for a description of ways to measure runtime memory usage in Linux.
Also, see Accurate Memory Measurement for a description of techniques (and patches) which can be used to measure the runtime memory more accurately.
Linux size increase from 2.4 to 2.6
Linux increased in size by between 10% and 30% from version 2.4 to 2.6. This incremental growth in kernel size has been a big concern by forum members.
Please see the Szwg Linux 26Data page for supporting data.
GCC Code-Size Benchmarking
CSiBE is a code size benchmark for the GCC compiler. The primary purpose of CSiBE is to monitor the size of the code generated by GCC. In addition, compilation time and code performance measurements are also provided.
CSiBE
Case Studies
• Motorola reduction of system size (presumably for cell phones) using 2.4 Linux: MotSizeReduction.ppt - this is a placeholder for this Powerpoint as it was too big to upload to the wiki. Email btraynor at gmail.com if you need it immediately.
Other Tidbits on System Size
Memory leak detection for the kernel
Catalin Marinas of ARM has been recently (as of 2.6.17?) been posting a memory leak detector for the Linux kernel. It may get mainlined in the future. Here's a link to the LKML discussions around it: http://lkml.org/lkml/2006/6/11/39
How System Size may affect performance
It has long been theorized that reducing system size could provide a performance benefit because it could reduce cache misses. There does not appear to be hard data to support this theory on Linux, but this has been discussed on the kernel mailing list.
See this post by Linus Torvalds
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T07:44:33.000Z
|
4fu5i6eowhkp23zea2qeoa46xl6tku6j
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40683",
"uncompressed_offset": 98261618,
"url": "globalvoicesonline.org/2012/03/07/south-korea-violent-clashes-intensify-over-jeju-naval-base-construction/",
"warc_date": "2013-11-22T19:24:13.000Z",
"warc_filename": "<urn:uuid:57a60f5f-b60e-41e7-9169-fb441e04293b>",
"warc_url": "http://globalvoicesonline.org/2012/03/07/south-korea-violent-clashes-intensify-over-jeju-naval-base-construction/"
}
|
cccc_CC-MAIN-2013-20
|
GlobalVoices in Learn more »
South Korea: Violent Clashes Intensify over Jeju Naval Base Construction
This post also available in:
Español · Corea del Sur: Violentos enfrentamientos se intensifican por la construcción de la Base Naval de Jeju
Arrest and detention and violent clampdowns are worsening in Gangjeong village, South Korea's Jeju island as dynamites for construction purposes were delivered this week. Media Mongu is live-tweeting photos of clashes between the government and activists, residents and religious groups.
World regions
Countries
Languages
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T08:49:52.000Z
|
74vydxtpptvgd634ljdq3knlfh7643nc
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40697",
"uncompressed_offset": 120767627,
"url": "josm.openstreetmap.de/browser/josm/trunk/data/es.lang?rev=3506",
"warc_date": "2013-11-22T19:24:13.000Z",
"warc_filename": "<urn:uuid:57a60f5f-b60e-41e7-9169-fb441e04293b>",
"warc_url": "http://josm.openstreetmap.de/browser/josm/trunk/data/es.lang?rev=3506"
}
|
cccc_CC-MAIN-2013-20
|
source: josm/trunk/data/es.lang @ 3506
Last change on this file since 3506 was 3506, checked in by stoecker, 3 years ago
updated i18n
• Property svn:mime-type set to application/octet-stream
File size: 217.7 KB
HTML preview not available, since no preview renderer could handle it. Try downloading the file instead.
Note: See TracBrowser for help on using the repository browser.
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T07:44:46.000Z
|
64nfbmlbkgvtaeroiygsdxqxrorja2pu
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40726",
"uncompressed_offset": 169613218,
"url": "opensource.org/minutes20110810",
"warc_date": "2013-11-22T19:24:13.000Z",
"warc_filename": "<urn:uuid:57a60f5f-b60e-41e7-9169-fb441e04293b>",
"warc_url": "http://opensource.org/minutes20110810"
}
|
cccc_CC-MAIN-2013-20
|
You are here
OSI Board Meeting Minutes, Wednesday, August 10, 2011
Quorum
Quorum reached and meeting called to order at 15:04 UTC.
Attendees
Board Members
1. Mr. Michael Tiemann, President
2. Mr. Karl Fogel, Director
3. Mr. Harshad Gune, Director (on IRC)
4. Mr. Jim Jagielski, Director
5. Mr. Fabio Kon, Director (until 16:05 UTC)
6. Mr. Martin Michlmayr, Secretary
7. Mr. Andrew Oliver, Asst. Treasurer
8. Mr. Simon Phipps, Director
9. Ms. Alolita Sharma, Treasurer
10. Mr. Tony Wasserman, Director
Guests and Observers
1. Ms. Danese Cooper, Board Observer (joined at 15:11 UTC)
2. Mr. Mark Radcliffe, General Counsel
Expected, but Not Present
1. Mr. Ken Coar, Board Observer
2. Mr. Michael Godwin, Director
3. Mr. Russell Nelson, Board Observer
4. Ms. Nnenna Nwakanma, Board Observer
Sent Regrets
None.
Agenda
1. Minutes Review and Approval
2. Officer Reports
3. Committee Reports
4. Old Business
5. New Business
6. Motions for Consideration by Board
7. Action items
8. Next Board Meeting
Minutes Review and Approval
The Board reviewed the minutes of the July meeting. Mr. Jagielski moved that the Board approve the minutes. Ms. Sharma seconded. Minutes approved by general consent.
Officer Reports
President's Report (Mr. Tiemann)
No report submitted.
Secretary's Report (Mr. Michlmayr)
Mr. Michlmayr reports:
• The following minutes have to be reviewed by the Board for approval:
• July 13, 2011
• The following approved minutes have been posted to opensource.org:
• June 8, 2011
• The bylaws approved in the July meeting have been posted to opensource.org.
Treasurer's Report (Ms. Sharma)
Ms. Sharma provided details on OSI finances which included bank balances, funds inflow, outflow and expected expenses as of the end of June 2011.
Mr. Tiemann thanked Ms. Alolita for producing the Treasurer Reports and remarked that it would be great to put together an annual operating budget. A budget projection would show the constraints and opportunities with regards to sponsoring additional projects and efforts.
Mr. Michlmayr asked whether the income via PayPal were donations or t-shirt sales. Mr. Michlmayr noted that Mr. Oliver needs access to PayPal so he is informed about t-shirt sales. Ms. Sharma agreed to share the PayPal password with Mr. Oliver (for t-shirt fulfilment) and the President and Secretary.
Mr. Phipps asked what happened to the fees owed to the government and how large the liability is. Ms. Sharma noted that there has been no progress. The government still has to get back to us regarding the last two years but they have refunded everything else (see the June report). Ms. Cooper added that the fees are roughly 1500 USD. Mr. Phipps asked for this liability to be shown in the Treasurer Report until it is resolved.
General Counsel's Report (Mr. Radcliffe)
Mr. Radcliffe posted a modified copy of the bylaws to the Board mailing list. There was some confusion as to which version had been use as the basis for this copy of the bylaws. Mr. Radcliffe explained that the confusion around the bylaws exists because before he was General Counsel we used to have bylaws and then we published some amendments but the amendments were not incorporated into the bylaws. The source of the problems is therefore that there's no single integrated set of bylaws. Mr. Phipps noted that the Board approved a set of bylaws at the last Board meeting that incorporated all changes that the Board was able to identify by consensus. Mr. Radcliffe agreed to take these bylaws (as published on the OSI web site) as the base line and propose some changes.
Committee Reports
(Listed in alphabetical order)
Education Committee (Mr. Kon)
Mr. Kon is working on proposal for a panel on Open Source Education for OSS'2011.
Mr. Wasserman intends to talk to Roberto di Cosmo at Open World Forum to discuss a possible collaboration since Mr. di Cosmo is doing a lot of work around open source education in France.
License Committee (Mr. Fogel)
The biggest upcoming item right now are Python licenses. Mr. Fogel has scheduled phone calls next week with Van Lindberg of PSF, and Jilayne Lovejoy, Tom Incorvia of SPDX, mainly to resolve license naming issues, but that's somewhat connected to content issues too in the case of the proposed PSF licenses. See http://projects.opensource.org/redmine/issues/3, which has links to email threads describing the situation in excruciating detail.
Mr. Fogel made some FAQ additions and anchorizations (but not complete yet). A larger FAQ reorganization is in the works, see http://projects.opensource.org/redmine/issues/10 and http://projects.opensource.org/redmine/issues/16.
Mr. Fogel made some minor fixes to some license pages and to the FAQ; thanks to Martin Michlmayr for jumping on some of the license page issues.
Mr. Fogel gave an update on license deprecations: he explicitly deprecated OSL-1.0, see http://projects.opensource.org/redmine/issues/11. There is an overview of remaining deprecations at http://projects.opensource.org/redmine/issues/4.
Mr. Fogel is making an effort to always answer FAQs by pointing to an FAQ, and creating a new anchor when necessary. Once FAQ reorganization and anchorability effort is complete, Mr. Fogel will post to license-discuss about this, encouraging others to handle common questions the same way.
Mr. Fogel asked whether the license lists are affected by Friday's list move and Mr. Oliver confirmed that they are. Mr Fogel asked whether the mailing list archives would be transfered but Mr. Oliver said that there has been no work on importing the archives yet.
Finally, Mr. Fogel noted that all licensing issues are tracked at http://projects.opensource.org/redmine/projects/licensing/issues
No report submitted.
Membership-Governance Committee (Mr. Phipps)
Mr. Phipps discussed potential affiliate schemes at the Foundations Meeting at OSCON, to general approval.
Mr. Tiemann asked whether there have been any meetings of the governance committee recently. Mr. Phipps noted that there has been open discussion on the mailing list that resulted in comments that were incorporated. However, participation from the mailing list is fairly low at the moment.
Policy and Economic Development Committee (Mr. Tiemann)
Mr. Tiemann tried to contact Carlo Daffara but his message was rejected due to blacklisting. Mr. Michlmayr offered to forward the message since he successfully exchanged email with Mr. Daffara in the past.
Administrative Committees
Communications Committee (Mr. Phipps)
Mr. Phipps noted that there has been no traffic on the Communications list.
IT Infrastructure Committee (Mr. Oliver)
Mr. Oliver reminded everyone that the mailing lists would change to OSI's server on Friday. He asked everyone responsible for a mailing list to inform all users.
New Projects / Outreach Committee (Ms. Sharma)
Ms. Sharma had some good conversations at OSCON with a number of open source projects about the upcoming membership changes. They are interested in joining once we have a membership program.
Old Business
Next face-to-face meeting
Based on the Doodle poll, Mr. Michlmayr suggested three possible dates. The Board discussed the dates and agreed on November 12-13. Mr. Fogel made the motion to hold the next face-to-face meeting from November 11 at 6pm to November 13 at 4pm in San Francisco. Ms. Sharma seconded. Motion approved by general consent.
Ms. Sharma will check availability of the Wikimedia Foundation facilities for this date and reserve a hotel block. Mr. Radcliffe also offered the DLA Piper facilities in San Francisco.
Review of action items
• Mr. Tiemann: contact Carlo Daffara regarding Policy and Economic Development Committee. Carlo has migrated his work to http://www.osbr.ca/ojs/index.php/osbr/article/view/535/493 which offers an OSS directory he has put together. Coordinated with other OSSCC efforts, the OSI could point to that as a general resource.
• Mr. Michlmayr: publish bylaws on the web site. DONE.
• Mr. Sharma: check availability of WMF facility from September-November. Ms. Sharma will have an answer by next week.
• Ms. Sharma: obtain copy of 2010 tax returns and post to board. Pending.
• Mr. Godwin: talk to Mr. Tiemann about the role of the Legal Affairs Committee. Pending.
• Ms. Sharma and Mr. Jagielski: create an outreach plan. This will happen at the next face-to-face meeting.
New Business
OSI Affiliate Scheme for Open Source Non-Profits
Mr. Phipps is seeking approval from the Board of the OSI Affiliate Scheme. He would like to approach initial affiliates, such as Apache, in order to test the current Affiliate Scheme and make further modifications before officially adopting the Affiliate Scheme.
Mr. Radcliffe asked how we are planning to implement the change. In order to change to a membership organization, we have to change our bylaws. It seems that Mr. Phipps is following a framework to evolve into a membership organization instead of changing to a membership organization immediately.
Mr. Phipps confirmed that this was his plan. Mr. Phipps added that we are not changing our bylaws until we have verified that this scheme works. We will test out this scheme with some prospective affiliates and run the spring election like this. If the process works, the Board will change the bylaws to actually make these organizations formal members. However, we won't change the bylaws until we know that the process works.
Mr. Radcliffe agreed with this approach. He wondered whether it would make sense to offer MOUs to these organizations in case they want a formal agreement. Mr. Phipps agreed that we can make an MOU to establish a binding relationship in lieu of changing the bylaws.
Mr. Phipps made the following motion. Mr. Radcliffe seconded. Motion approved by general consent.
Mr. Phipps added that the next step is to work on a text to allow other organizations such as open source centers for competence or OSU-OSL (which is not a legal entity) to join as affiliates. Mr. Wasserman remarked that his group at CMU is in a similar position to OSU-OSL.
Full text of the motion:
"RESOLVED that the following text be used as the scheme description for recruiting potential affiliate organisations to join OSI, with the text subject to further review in the light of that experience prior to final adoption.
OSI Affiliate Scheme for Open Source Non-Profits
This scheme is intended to permit bona fides open source non-profit organisations to affiliate with OSI. The benefits of doing so include:
• Expression of identification with the Mission of OSI
• Engagement in the OSI Governance process
• Potential collaboration with other Affiliates using OSI as a venue
Qualification
Affiliates are qualified for inclusion in Affiliate Groups as "OSI Non-Profit Affiliates" when they meet the requirements for affiliation:
• They are an entity whose articles of incorporation, mission statement or bylaws express an alignment of purpose with OSI.
• They are a legally-recognised non-profit entity outside the control of another entity
• To the satisfaction of the OSI Board and at their sole discretion, they demonstrate
• they have been in existence for over 6 months,
• they have sound governance including a diverse board,
• they practice support of the principles of open source,
• they will optionally make appropriate financial donations to OSI, in addition to other possible participation
• They apply to the Board for Affiliation using the Board's preferred procedure
Affiliate Status
Once accepted:
• Affiliates are subject to a probationary period of one quarter
• At least every three years, the Board will review each Affiliate to determine if they still qualify for Affiliate status.
• Affiliates may participate in OSI governance as below
• Affiliates may use the terms "OSI Affiliate" and/or "Affiliated with the Open Source Initiative" to identify themselves (other branding options TBD)
Governance
Affiliates may use a transparent process of their own choosing to appoint a delegate to act for the interests of the Affiliate at OSI. The OSI Board will place new delegates into an appropriate Affiliate Group. Once an Affiliate Group meets the requirements for size and activity (TBD), it is able to elect a representative to join the electoral pool for the next OSI Director election by a transparent and fair mechanism of its own choosing.
All delegates are entitled to vote in OSI Director elections; Affiliates should identify a suitable process by which to direct the votes of their delegate."
"Commercial" vs "Open Source"
Mr. Fogel noted the problem of increasingly seeing the use of the term "commercial" used as opposite of "open source" in many places. Mr. Fogel will defer this discussion to the next meeting and will write down his thoughts in more detail before then.
Statement for Open World Forum
Mr. Tiemann remarked that it would be great to prepare a statement for Open World Forum about the OSI affiliate scheme. Mr. Wasserman noted that OWF has become a confederation of smaller meetings and that therefore there are fewer plenary sessions. However, we can try to get a few minutes in a plenary.
Next Board meeting
Mr. Michlmayr proposed to hold the next meeting on September 14 rather than September 7 since several OSI members will be at TransferSummit in Oxford on September 7. Mr. Fogel noted that he would not be able to attend on September 14, but the Board agreed that September 14 is a better date for the majority of the Board.
Action Items
• Ms. Sharma: check WMF availability for weekend of November 12-13 and reserve hotel block.
• Mr. Wasserman or Mr. Phipps: check if we can get some time in a plenary at OWF to discuss the OSI affiliate scheme.
Next Board Meeting
The next OSI BOD meeting is scheduled for Wednesday, September 14, 2011.
Meeting adjourned at 16:20 UTC.
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T08:26:49.000Z
|
2lft4rvimvbtzwh7xxberr2tse76mmga
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40737",
"uncompressed_offset": 183717987,
"url": "quotationsbook.com/quote/40639/",
"warc_date": "2013-11-22T19:24:13.000Z",
"warc_filename": "<urn:uuid:57a60f5f-b60e-41e7-9169-fb441e04293b>",
"warc_url": "http://quotationsbook.com/quote/40639/"
}
|
cccc_CC-MAIN-2013-20
|
Quotation added by staff
Why not add this quote to your bookmarks?
... A second sort, is of those that have some natural dispositions which have better grace in youth, than in age; such as is a fluent and luxuriant speech; which becomes youth well, but not age: so Tully saith of Hortensius, Idem manebat, neque idem decebat. The third is of such, as take too high a strain at the first, and are magnanimous, more than tract of years can uphold. As was Scipio Africanus, of whom Livy saith in effect, Ultima primis cedebant.
Of Beauty
Virtue is like a rich stone, best plain set. and surely virtue is best, in a body that is comely, though not of delicate features; and that hath rather dignity of presence, than beauty of aspect. Neither is it almost seen, that very beautiful per- sons are otherwise of great virtue; as if nature were rather busy, not to err, than in labor to produce excellency. And therefore they prove accom- plished, but not of great spirit; and study rather behavior, than virtue. But this holds not always: for Augustus Caesar, Titus... Bacon, Francis
Excerpt from Essays of Francis Bacon · This quote is about virtue · Search on Google Books to find all references and sources for this quotation.
A bit about Bacon, Francis ...
Francis Bacon, 1st Viscount St Alban, KC (22 January 1561 - 9 April 1626) was an English philosopher, statesman and essayist but is best known for leading the scientific revolution with his new 'observation and experimentation' theory which is the way science has been conducted ever since. He was knighted in 1603, created Baron Verulam in 1618, and created Viscount St Alban in 1621; both peerage titles became extinct upon his death.
These people bookmarked this quote:
More on the author
This quote around the web
Loading...
Search Quotations Book
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T08:34:21.000Z
|
otsef5vmh2ucrkavwcvurgywjatlsee3
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40767",
"uncompressed_offset": 219674672,
"url": "talk.maemo.org/newreply.php?do=newreply&p=1107319",
"warc_date": "2013-11-22T19:24:13.000Z",
"warc_filename": "<urn:uuid:57a60f5f-b60e-41e7-9169-fb441e04293b>",
"warc_url": "http://talk.maemo.org/newreply.php?do=newreply&p=1107319"
}
|
cccc_CC-MAIN-2013-20
|
vBulletin Message
You are not logged in or you do not have permission to access this page. This could be due to one of several reasons:
1. You are not logged in. Fill in the form at the bottom of this page and try again.
2. You may not have sufficient privileges to access this page. Are you trying to edit someone else's post, access administrative features or some other privileged system?
3. If you are trying to post, the administrator may have disabled your account, or it may be awaiting activation.
Log in
User Name:
Password:
Forgotten Your Password?
The administrator may have required you to register before you can view this page.
Forum Jump
All times are GMT -4. The time now is 04:34 AM.
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T08:49:41.000Z
|
pwffap4lbf6hw72x5z4qm7ulobjrvm3m
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40800",
"uncompressed_offset": 245027867,
"url": "wiki.gentoo.org/index.php?oldid=12803&title=KDE",
"warc_date": "2013-11-22T19:24:13.000Z",
"warc_filename": "<urn:uuid:57a60f5f-b60e-41e7-9169-fb441e04293b>",
"warc_url": "http://wiki.gentoo.org/index.php?title=KDE&oldid=12803"
}
|
cccc_CC-MAIN-2013-20
|
KDE
From Gentoo Wiki
Revision as of 05:51, 31 January 2013 by Astaecker (Talk | contribs)
Jump to: navigation, search
External resources
KDE is a powerful graphical desktop environment for Unix workstations.
Contents
Available versions
KDE SC 4 is the current KDE version supported by upstream. In Portage there is a stable version, and there might be one (or more) non-stable versions. Under normal conditions new versions get in stabilized after a month. In addition, KDE upstream provides live git source repositories. The Gentoo KDE team provides trunk and latest branch live ebuilds through the kde overlay.
Choose what KDE SC version is most appropriate for you:
KDE SC version Repository Status
KDE SC 4.9.5 Portage Stable for amd64, ppc and x86, testing for arm
KDE SC 4.9 stable branch kde overlay Live version
KDE SC 4.10 snapshots kde overlay Beta/RC's versions
KDE SC trunk kde overlay Live version
Note
Users with stable systems need to put this keywords file in /etc/portage/package.keywords to install testing versions.
Note
If you are running KDE PIM and upgrade from 4.4 to 4.9, please have a look at the KDE PIM 4.7 Upgrade Guide first (it still applies to 4.9)! If you want to stick with KDE PIM 4.4 you can mask KDE PIM 4.9.
Prerequisites
Profile
The Desktop profile has been split to KDE and GNOME subprofiles. This means that KDE and GNOME specific USE flags have been stripped from the basic desktop profile and have been migrated to the subprofiles. Choosing a subprofile does not restrict you to use only the equivalent desktop environment. In order to choose the profile that suits you, run
root # eselect profile list
to get the profile list, and
root # eselect profile set X
where X is the appropriate number of the profile you want to select. See the page on profiles for more details. For a full KDE desktop environment we recommend to use the desktop/kde profile, which is specially tailored for KDE.
Services
Before you install KDE SC it is recommended that you set up several services. Part of that is done automatically if you use a desktop/kde or desktop profile. In detail you should use:
• ConsoleKit: Enables the ConsoleKit framework for defining and tracking users, login sessions and seats.
• D-Bus: Enables use of the D-Bus message bus system.
• polkit: Enables the polkit framework for controlling privileges for system-wide services.
• udev: Enables support for udev Linux dynamic and persistent device naming.
• udisks: Enables support for some storage related services.
Follow the links for information how to set up these services. Note that other USE flag combinations than set in this profile may technically be possible (especially if you do not run a full KDE desktop environment but only selected applications), but may be unsupported, untested, or lead to unexpected loss of functionality.
X server
Read and follow the instructions in the X server article to setup your X environment.
Installation
Note
If you're updating, check the upgrade subpage.
Note
For live versions see the kde overlay article.
Packages
In Gentoo there are various packages that will install a KDE environment:
It's usually a good idea to start with kdebase-meta and install whatever else you need as you go:
root # emerge --ask kdebase-meta
There are other meta packages that can be installed to pull in parts of the KDE suite:
Localization
For localization of KDE install kde-base/kde-l10n. If you want only selected languages, define beforehand the LINGUAS USE flag, e.g. for German:
File/etc/portage/make.conf
LINGUAS="de"
root # emerge --ask kde-l10n
For localization of packages included in kde-base/kdepim-meta you need to install kde-base/kdepim-l10n.
app-office/calligra has its own localization package too, app-office/calligra-l10n.
Configuration
Boot service
Set KDM as your default display manager:
File/etc/conf.d/xdm
DISPLAYMANAGER="kdm"
To start KDE on boot, add xdm to your default runlevel:
root # rc-update add xdm default
To start KDE now:
root # /etc/init.d/xdm start
Add-on Software
Widgets
Many useful widget are in the kde-base/kdeplasma-addons package:
root # emerge --ask kdeplasma-addons
More KDE software
The most important KDE applications are in the portage tree and many are located in the kde-base and kde-misc categories.
See also
External resources
Personal tools
Namespaces
Variants
Actions
Go to: Gentoo Home Documentation Forums Lists Bugs Planet Store Wiki Get Gentoo!
Navigation
Toolbox
Categories
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T08:48:43.000Z
|
vx733cvzqmfrxpuwnav3fpyavujujvhr
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40802",
"uncompressed_offset": 245184840,
"url": "wiki.openbravo.com/wiki/ERP/2.50/Developers_Guide/Database_Model/org.openbravo.model.common.enterprise/C_AcctSchema_Table_DocType",
"warc_date": "2013-11-22T19:24:13.000Z",
"warc_filename": "<urn:uuid:57a60f5f-b60e-41e7-9169-fb441e04293b>",
"warc_url": "http://wiki.openbravo.com/wiki/ERP/2.50/Developers_Guide/Database_Model/org.openbravo.model.common.enterprise/C_AcctSchema_Table_DocType"
}
|
cccc_CC-MAIN-2013-20
|
View source | Discuss this page | Page history | Printable version
ERP/2.50/Developers Guide/Database Model/org.openbravo.model.common.enterprise/C AcctSchema Table DocType
Contents
C_AcctSchema_Table_DocType
This table contains the following columns:
Name Nullable Data Type Description
C_Acctschema_Table_Doctype_ID NVARCHAR2(32)null
C_Acctschema_Table_ID NVARCHAR2(32)Acctschema table
AD_Client_ID NVARCHAR2(32)Client for this installation.
AD_Org_ID NVARCHAR2(32)Organizational entity within client
Isactive NCHAR(1)A flag indicating whether this record is available for use or de-activated.
Created NDATEThe date that this record is completed.
Createdby NVARCHAR2(32)User who created this records
Updated NDATEx not implemented
Updatedby NVARCHAR2(32)User who updated this records
AllowNegative YCHAR(1)Allow negative entries in credit and debit
Docbasetype NVARCHAR2(60)A classification of document types that are shown and processed in the same window.
AD_Createfact_Template_ID YVARCHAR2(32)Accounting Template
Other Info
Check constraints
These are the check constraints for this table:
top
Indexes
These are the indexes for this table (for each index there is a list of all the columns included within it):
Unique
top
Columns
C_AcctSchema_Table_DocType_ID
top
Acctschema table
Foreign key column to C_Acctschema_Table table, (column: C_Acctschema_Table_ID)
top
Client
Foreign key column to AD_Client table, (column: AD_Client_ID)
Validation Rule AD_Client Security validation: Clients with user access rights. With the following code:
AD_Client.AD_Client_ID IN (@#User_Client@)
top
Organization
Foreign key column to AD_Org table, (column: AD_Org_ID)
Validation Rule AD_Org Security validation: Organizations of the Client with user acces rights. With the following code:
(@AD_Client_ID@='0' AND AD_Org.AD_Org_ID='0') OR (@AD_Client_ID@!='0' AND ((AD_Org.AD_Client_ID IN (@#User_Client@) AND AD_Org.AD_Org_ID IN (@#User_Org@)) OR AD_Org.AD_Org_ID='0' AND AD_Org.IsSummary='N'))
top
Active
There are two methods of making records unavailable in the system: One is to delete the record, the other is to de-activate the record. A de-activated record is not available for selection, but available for reporting. There are two reasons for de-activating and not deleting records:
(1) The system requires the record for auditing purposes.
(2) The record is referenced by other records. E.g., you cannot delete a Business Partner, if there are existing invoices for it. By de-activating the Business Partner you prevent it from being used in future transactions.
top
Creation Date
The Created field indicates the date that this record was created.
top
Created By
Foreign key column to AD_User table, (column: AD_User_ID)
Reference Table AD_User
top
Updated
The Updated field indicates the date that this record was updated.
top
Updated By
Foreign key column to AD_User table, (column: AD_User_ID)
Reference Table AD_User
top
Allow negative
Allow negative entries in credit and debit
top
Document Category
The Document Base Type identifies the base or starting point for a document. Multiple document types may share a single document base type.
Validation Rule C_AcctSchema_Table DocBaseType: Doc base type of the selected document. With the following code:
Value IN (SELECT DOCBASETYPE FROM C_DOCTYPE, C_ACCTSCHEMA_TABLE WHERE C_DOCTYPE.AD_TABLE_ID = C_ACCTSCHEMA_TABLE.AD_TABLE_ID AND C_ACCTSCHEMA_TABLE.C_ACCTSCHEMA_TABLE_ID = @C_Acctschema_Table_ID@)
List values: C_DocType DocBaseType
The allowed values for this list are:
top
AD_Createfact_Template_ID
Foreign key column to AD_Createfact_Template table, (column: AD_Createfact_Template_ID)
Validation Rule AD_Table Acctschema table: null. With the following code:
AD_CreateFact_Template.AD_Table_ID=@AD_Table_ID@
top
Retrieved from "http://wiki.openbravo.com/wiki/ERP/2.50/Developers_Guide/Database_Model/org.openbravo.model.common.enterprise/C_AcctSchema_Table_DocType"
This page has been accessed 633 times. This page was last modified on 2 July 2011, at 20:44. Content is available under Creative Commons Attribution-ShareAlike 2.5 Spain License.
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T07:45:25.000Z
|
uhogngs4qhifbj5hwlgjhfqnha4ebdkk
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40804",
"uncompressed_offset": 245522468,
"url": "wikitravel.org/en/Puerto_Cabezas",
"warc_date": "2013-11-22T19:24:13.000Z",
"warc_filename": "<urn:uuid:57a60f5f-b60e-41e7-9169-fb441e04293b>",
"warc_url": "http://wikitravel.org/en/Puerto_Cabezas"
}
|
cccc_CC-MAIN-2013-20
|
Help Wikitravel grow by contributing to an article! Learn how.
Puerto Cabezas
From Wikitravel
Jump to: navigation, search
Puerto Cabezas is in Caribbean Nicaragua.
[edit] Understand
[edit] Get in
[edit] Get around
[edit][add listing] See
[edit][add listing] Do
[edit][add listing] Buy
[edit][add listing] Eat
[edit][add listing] Drink
[edit][add listing] Sleep
[edit] Contact
[edit] Get out
This article is an outline and needs more content. It has a template, but there is not enough information present. Please plunge forward and help it grow!
Personal tools
Namespaces
Variants
Actions
Navigation
feeds
Destination Docents
Toolbox
In other languages
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T08:22:29.000Z
|
xm6rdqndkyjbhneory5zfir5jde6yyf5
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40805",
"uncompressed_offset": 245539203,
"url": "wikitravel.org/wiki/en/index.php?oldid=371625&title=Telemark",
"warc_date": "2013-11-22T19:24:13.000Z",
"warc_filename": "<urn:uuid:57a60f5f-b60e-41e7-9169-fb441e04293b>",
"warc_url": "http://wikitravel.org/wiki/en/index.php?title=Telemark&oldid=371625"
}
|
cccc_CC-MAIN-2013-20
|
Help Wikitravel grow by contributing to an article! Learn how.
Telemark
From Wikitravel
Europe : Scandinavia : Norway : East Norway : Telemark
Revision as of 05:47, 22 September 2006 by 203.144.143.4 (Talk)
Jump to: navigation, search
Telemark is a county in East Norway.
• Nome - a municipality
This article is still a stub and needs your attention. It does not have a template. Please plunge forward and help it grow!
Personal tools
Namespaces
Variants
Actions
Navigation
feeds
Destination Docents
Toolbox
In other languages
other sites
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T07:45:24.000Z
|
snnzjwoje4pejw3laae2srigf5uljgm3
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40812",
"uncompressed_offset": 255419202,
"url": "www.abs.gov.au/AUSSTATS/abs%40.nsf/ViewContent?Action=Expand&Num=1.5&view=mediareleasesbyReleaseDate",
"warc_date": "2013-11-22T19:24:13.000Z",
"warc_filename": "<urn:uuid:57a60f5f-b60e-41e7-9169-fb441e04293b>",
"warc_url": "http://www.abs.gov.au/AUSSTATS/abs@.nsf/ViewContent?readform&view=mediareleasesbyReleaseDate&Action=Expand&Num=1.5"
}
|
cccc_CC-MAIN-2013-20
|
Australian Bureau of Statistics
Celebrating the International Year of Statistics 2013
ABS Home > News & Media > Media Releases by Release Date
Media Releases by Release Date
January, 2013
30/01/2013 Women still under-represented in positions of leadership (Media Release), Jan 2013 (cat no. 4125.0)
23/01/2013 Consumer Price Index, Australia (Media Release), Dec 2012 (cat no. 6401.0)
23/01/2013 One in ten full-time employees earn $2,364 or more per week (Media Release), May 2012 (cat no. 6306.0)
17/01/2013 Labour Force, Australia (Media Release), Dec 2012 (cat no. 6202.0)
16/01/2013 Long term unemployment remains steady (Media Release), July 2012 (cat no. 6222.0)
10/01/2013 Building Approvals, Australia (Media Release), November 2012 (cat no. 8731.0)
09/01/2013 ABS conducting largest survey of Aboriginal and Torres Strait Islander Health
09/01/2013 Retail Turnover falls 0.1 per cent in November 2012 (Media Release), Nov 2012 (cat no. 8501.0)
© Commonwealth of Australia 2013
Unless otherwise noted, content on this website is licensed under a Creative Commons Attribution 2.5 Australia Licence together with any terms, conditions and exclusions as set out in the website Copyright notice. For permission to do anything beyond the scope of this licence and copyright terms contact us.
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T08:22:35.000Z
|
w3cqpaoovd36gdwsvikk2apyswo5lfeo
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40813",
"uncompressed_offset": 255425824,
"url": "www.abs.gov.au/AUSSTATS/abs%40.nsf/allprimarymainfeatures/2CFADC680780E702CA25722E001A8028",
"warc_date": "2013-11-22T19:24:13.000Z",
"warc_filename": "<urn:uuid:57a60f5f-b60e-41e7-9169-fb441e04293b>",
"warc_url": "http://www.abs.gov.au/AUSSTATS/abs@.nsf/allprimarymainfeatures/2CFADC680780E702CA25722E001A8028?opendocument"
}
|
cccc_CC-MAIN-2013-20
|
Australian Bureau of Statistics
Celebrating the International Year of Statistics 2013
ABS Home > Statistics > By Release Date
5439.0 - International Merchandise Imports, Australia, Mar 1997
Previous ISSUE Released at 11:30 AM (CANBERRA TIME) 17/04/1997
Page tools: Print Page Print All RSS Search this Product
• About this Release
Presents the total imports (international trade basis) for the reference month only, together with commodity aggregates at the one digit level of the Standard International Trade Classification (Revision 3). No analysis is provided.See also 5368.0.Monthly; ISSN:1328-2980; Replaces: Merchandise Imports, Australia: Balance of Payments Basis (5320.0)
This publication has been converted from older electronic formats and does not necessarily have the same appearance and functionality as later releases.
© Commonwealth of Australia 2013
Unless otherwise noted, content on this website is licensed under a Creative Commons Attribution 2.5 Australia Licence together with any terms, conditions and exclusions as set out in the website Copyright notice. For permission to do anything beyond the scope of this licence and copyright terms contact us.
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T08:20:44.000Z
|
7sa2gmf3uaphb35ao6cjq4d6md2t5vn2
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40816",
"uncompressed_offset": 298255800,
"url": "www.biomedcentral.com/1471-2490/4/2/",
"warc_date": "2013-11-22T19:24:13.000Z",
"warc_filename": "<urn:uuid:57a60f5f-b60e-41e7-9169-fb441e04293b>",
"warc_url": "http://www.biomedcentral.com/1471-2490/4/2/"
}
|
cccc_CC-MAIN-2013-20
|
Case report
Ureterolithiasis after Cohen re-implantation – case report
Sonal Chaudhary1, Miranda Lee1, Henry O Andrews2 and Noor NP Buchholz2*
Author Affiliations
1 Barts and the London Queen Mary's School of Medicine and Dentistry, London, United Kingdom
2 Department of Urology, St. Bartholomew's Hospital, London, United Kingdom
For all author emails, please log on.
BMC Urology 2004, 4:2 doi:10.1186/1471-2490-4-2
The electronic version of this article is the complete one and can be found online at: http://www.biomedcentral.com/1471-2490/4/2
Received:8 January 2004
Accepted:10 March 2004
Published:10 March 2004
© 2004 Chaudhary et al; licensee BioMed Central Ltd. This is an Open Access article: verbatim copying and redistribution of this article are permitted in all media for any purpose, provided this notice is preserved along with the article's original URL.
Abstract
Background
In the past decades, the widespread use of cross-trigonal ureteral reimplants for the treatment of children with vesicoureteral reflux has resulted in a large population of patients with transversely lying ureters. As this population gets older they will consequently be entering an age group at higher risk for stone and urothelial cancer formation. If ureteroscopy becomes necessary, the transverse position of the ureter makes ureteric access often impossible.
Case Presentation
We present the case of a young man who not only suffered from urolithiasis due to hyperparathyroidism, but also further jeopardized his treatment by omitting the fact that as a child he underwent Cohen reimplantation of the right ureter.
Conclusions
This case illustrates the particular difficulties the endoscopist may face in this group of patients. Patients with difficult ureteric access, abnormal anatomy, or those with known cross-trigonal ureteric reimplantations should be managed in a specialised endourology unit.
Case Presentation
A 28-year-old man with known primary hyperparathyroidism presented with right-sided colicky pain in the lumbar region radiating to the groin. A XKUB demonstrated the presence of two urinary calculi, one 8 mm right renal pelvis stone, and one 10 mm stone in the right distal ureter. IVU revealed hydronephrosis of the right kidney and a dilated ureter up to the ureteric stone. The ureter distal of the stone was not opacified on any of the films. After a failed attempt by a colleague to insert a ureteric stent to de-block the right kidney, the patient was referred to our endourology service. The colleague had failed to find the right ureteric orifice.
At no point did the patient mention that he underwent bladder surgery as a child for a large bladder diverticulum on the right and had a Cohen ureteric reimplantation on that side.
A percutaneous nephrolithotomy (PCNL) and a combined retrograde-anterograde flexible ureteroscopic approach (URS) were planned. Again, an initial attempt to localize the right ureteric orifice on cystoscopy failed. A PCNL was performed and the kidney stone removed. A guidewire was passed anterogradely down the right ureter alongside the stone into the bladder. At that point, it became clear that immediately distal of the stone the right ureter angulated 90 degrees to the left within the posterior wall of the bladder and exited in the left bladder half. The stone was firmly lodged within that bend. The stone could be visualized endoscopically anterogradely and retrogradely, but due to inflammation, bleeding and lack of vision, a safe laser lithotripsy could not be attempted in that session. Finally, a thin anterograde double-J stent was inserted.
Only now, questioned again about this most unusual anatomy, the patient remembered his childhood operation. He was scheduled for another retrograde transurethral URS, and this time the operation was successful due to an easy and marked access by the double-J stent. Four weeks later, the patient underwent hyperparathyroidectomy. So far, he is doing well without stone recurrence or complications.
Conclusions
To date, urologists are increasingly confronted with a group of patients that had a childhood cross-trigonal reimplantation of one or both ureters. With this technique, first described by Cohen in 1975, the ureter is tunnelled cross-trigonally within the posterior wall of the bladder to exit in the contralateral bladder half. This allows in almost all patients to achieve adequate submucosal length of the ureter. These patients are now coming into an age where they are prone to develop all sorts of urological pathologies necessitating a retrograde ureteric access [1]. This is nicely illustrated by our case where a young man with such a reimplantation happens to develop hyperparathyroidism and urolithiasis. Not knowing about the reimplantation, several factors played together to obscure the picture for the surgeons. Firstly, the patient did not report his complete medical history, or perhaps, since this had happened in early childhood, he had simply forgotten about it. Secondly, the stone was lodged into the angulation of the ureter, therefore still projecting over the natural course of the right ureter. And finally, the stone blocked the ureter completely, thus not revealing any information about the course of the distal part of the ureter on IVU.
Cohen reimplantation has been reported as leading to difficulties in ureteric access [1-4]. A variety of approaches to solve the problem has been proposed such as a combination of cystoscopy and suprapubic percutaneous ureteric catheter insertion [2,3], percutaneous transvesical ureteroscopy [1], and transurethrally by using a curved tip vascular catheter combined with an angled tip glide wire [4]. Where the expertise is readily available, the ureter can also be accessed anterogradely and then later, if needed, retrogradely as in our case. We also found that once the ureter is marked, the insertion of an extra stiff guidewire will straighten the ureter and make access straightforward [4].
Patients with difficult ureteric access, abnormal anatomy, or those with known cross-trigonal ureteric reimplantations should be managed in a specialised endourology unit.
Competing Interests
None declared.
Authors' contributions
SC and ML researched the literature and wrote a first draft of the manuscript. HA provided clinical background, supervision and reviewed the paper. NB supervised the work and wrote the final version of the manuscript.
References
1. Santarosa RP, Hensle TW, Shabsigh R: Percutaneous transvesical ureteroscopy for removal of distal ureteral stone in reimplanted ureter.
Urology 1993, 42(3):313-316. PubMed Abstract | Publisher Full Text
2. De Castro R, Ricci S: Catheterization of the ureter after anti-reflux reimplantation using the Cohen technique.
Pediatr Med Chir 1981, 3(1):67-70. PubMed Abstract
3. Lamesh AJ: Retrograde Catheterization of the ureter after antireflux plasty by the Cohen technique of transverse advancement.
J Urol 1981, 125(1):73-74. PubMed Abstract
4. Wallis MC, Brown DH, Jayanthi VR, Koff SA: A novel technique for ureteral catheterisation and/or retrograde ureteroscopy after cross-trigonal ureteral reimplantation.
J Urol 2003, 170(4):1664-1666. PubMed Abstract | Publisher Full Text
Pre-publication history
The pre-publication history for this paper can be accessed here:
http://www.biomedcentral.com/1471-2490/4/2/prepub
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T08:47:52.000Z
|
4rhjlujnkibgfp6hvxxgfwnae7i43wx4
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40818",
"uncompressed_offset": 300870619,
"url": "www.blogbyben.com/2006/08/first-steps.html",
"warc_date": "2013-11-22T19:24:13.000Z",
"warc_filename": "<urn:uuid:57a60f5f-b60e-41e7-9169-fb441e04293b>",
"warc_url": "http://www.blogbyben.com/2006/08/first-steps.html"
}
|
cccc_CC-MAIN-2013-20
|
Saturday, August 12, 2006
First steps
There is nothing more precious than watching a baby take their first steps. In this case, the baby got a running start on all fours, and then walked on two, and then landed on one (her bottom). We had a great time playing with her, and she liked my challah! She's invited for dinner anytime.
LinkWithin
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T08:33:55.000Z
|
vzbrgxxv3jx5c2haiie5342xflygm6go
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40830",
"uncompressed_offset": 373703964,
"url": "www.eea.europa.eu/data-and-maps/figures/annual-average-river-nitrate-concentration",
"warc_date": "2013-11-22T19:24:13.000Z",
"warc_filename": "<urn:uuid:57a60f5f-b60e-41e7-9169-fb441e04293b>",
"warc_url": "http://www.eea.europa.eu/data-and-maps/figures/annual-average-river-nitrate-concentration"
}
|
cccc_CC-MAIN-2013-20
|
Personal tools
Sign up now!
Get notifications on new reports and products. Currently we have 55575 subscribers. Frequency: 3-4 emails / month.
Follow us
Twitter
Facebook
YouTube channel
RSS Feeds
Notifications archive
Write to us
For the public:
For media and journalists:
Contact EEA staff
Contact the web team
FAQ
Call us
Reception:
Phone: (+45) 33 36 71 00
Fax: (+45) 33 36 71 99
next
previous
items
Skip to content. | Skip to navigation
Sound and independent information
on the environment
You are here: Home / Data and maps / Maps and graphs / Annual average river nitrate concentration (mg/l NO3-N) in 2008, averaged by river basin district
Annual average river nitrate concentration (mg/l NO3-N) in 2008, averaged by river basin district
Created : Dec 02, 2010 Published : Dec 02, 2010 Last modified : Nov 29, 2012 11:41 AM
Topics: ,
This map shows the mean annual concentrations of Nitrate (NO3) as mg/L NO3-N measured at Eionet-Water River monitoring stations during 2008. All data are annual means. For most countries these are based on measurements over the whole year, whereas some countries have samples only from the growing season (due to ice cover in winter)
Download
Metadata
Additional information
For countries that report only total oxidised nitrogen (TON = NO3 NO2) and not nitrate alone, the map shows the TON-N data, taken as an estimate for NO3. In most rivers TON-N will be almost the same as NO3-N. Note that these data are not yet quality-checked. Certain values and colour codes might therefore be incorrect.
European Environment Agency (EEA)
Kongens Nytorv 6
1050 Copenhagen K
Denmark
Phone: +45 3336 7100
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T09:00:22.000Z
|
ozthw7hhgmcdzjrtgap3fdzvub2v3pep
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40831",
"uncompressed_offset": 378455467,
"url": "www.envirolink.org/topics.html?catid=10&do=catsearch&topic=Corporate+Accountability&topicsku=2002121144512&topictype=subtopic",
"warc_date": "2013-11-22T19:24:13.000Z",
"warc_filename": "<urn:uuid:57a60f5f-b60e-41e7-9169-fb441e04293b>",
"warc_url": "http://www.envirolink.org/topics.html?topic=Corporate%20Accountability&topicsku=2002121144512&topictype=subtopic&do=catsearch&catid=10"
}
|
cccc_CC-MAIN-2013-20
|
advanced search
Corporate Accountability - Articles
Actions You Can Take (15)
Articles (20)
Educational Resources (3)
E-Mail Lists (0)
Events (0)
General Info (13)
Government Resources (2)
Organizations (50)
Jobs & Volunteer Opportunities (0)
Publications (14)
Displaying 1 - 20 of 20 resources in Corporate Accountability and Articles:
1. Clean Production, Part 1
Over the past decade, a loose-knit group of environmental activists, progressive business people and government officials has developed a new concept for sustainable living. It ...
Category: Articles
2. Clean Production, Part 2
Clean production is not just about making the same old products by slightly cleaner methods; instead, it is an entirely new way of looking at ...
Category: Articles
3. Companies in The Rainforest
USA
Rainforests are very important to life on Earth. Over half of all the world's animals are found in the rainforest, and one quarter of all ...
Category: Articles
4. Corporate Environmental Reporting Goes Mainstream
After decades of silence, corporate environmental reporting (CER) isbeginning to emerge as a business practice. The use of CERs is spreading asmany companies, mostly large, ...
Category: Articles
5. Corporate Rights vs. Human Need
For many years, the potential market for baby foods and infant formula in the "developed" countries has been shrinking because birth rates have declined. Therefore, ...
Category: Articles
6. Drilling To The Ends Of The Earth: The Case Against New Fossil Fuel Exploration
USA
The quest for oil has defined the twentieth century. Many still view oil as black gold, a resource to be exploited as economically and expediently ...
Category: Articles
7. Ecological Stewardship in Japanese Firms
According to a recent Fortune Magazine ranking of the world's largest companies, five of the six largest corporations in terms of revenue are Japanese: Mitsubishi, ...
Category: Articles
8. Genetically Altering The World's Food
On January 14, after an 8-year scientific review, Canada rejected Monsanto corporation's request for approval of its genetically altered milk hormone, rBGH, a drug that ...
Category: Articles
9. Mitsubishi - Eclipse of Environmental Ethics
USA
Tracks Mitsubishi group activities related to rainforest destruction, biotechnology, nuclear plants and other ethical issues. ...
Category: Articles
10. Money in the Rainforest
USA
Ways that corporations make money in the rainforest: logging, oil, beef, etc. ...
Category: Articles
11. Steps Toward A Corporate State
Governments in the U.S. -- federal, state, and local -- together spend more than a trillion dollars of taxpayers' money per year. That's a thousand ...
Category: Articles
12. Sustainability Island How a Corporate Retreat Transformed a Hawaiian Resort
Interface, Inc. turned its 24th anniversary party into an opportunity to demonstrate sustainable business practices. ...
Category: Articles
13. The 1997 Corporate Conscience Awards
The Council On Economic Priorities'(CEP) Corporate Conscience Awards recognizes innovative corporate commitment that goes far beyond requirements and regulations to demonstrate "Leadership for a Better ...
Category: Articles
14. The Bad Seed
Monsanto Corporation of St. Louis has been maneuvering for more than a decade to dominate the world's supply of seed for staple crops (corn, soybeans, ...
Category: Articles
15. The Breast Cancer Money-Go-Round
They're good girls and boys. Racing for the cure. Crying for the cameras. Sharing their pain. Wearing that crown of thorns like a halo. Nice ...
Category: Articles
16. The Lottery
Whenever I walk by the drug store in my neighborhood, or the 7-11 or the liquor store, I see a line of people waiting patiently ...
Category: Articles
17. The Market for Sustainable Business is Bigger Than You May Think
Several recent studies show between 40-50 million Americans - about 25% of the adult population - are beginning to make value-based choices in more and ...
Category: Articles
18. The Meaning of Sustainability--Part 1
The Natural Step (TNS) is a Swedish invention, a set of simple guidelines for judging whether human activities are "sustainable" or not. These simple guidelines ...
Category: Articles
19. The Meaning of Sustainability--Part 2
After writing about The Natural Step (TNS) last week, I was referred to an interview with Dr. Karl-Henrik Robert -- the Swedish scientist who initiated ...
Category: Articles
20. Wild Profits: How Multinationals are Restoring Habitat and Saving Money
Companies are finding that it's beneficial to employees and operations budgets to restore corporate lands into viable wildlife habitats. ...
Category: Articles
Home | Site Map | About EnviroLink | Advanced Search | Suggest a Resource
All content on this website is governed by a Creative Commons license.
This site powered by WebDNA
Community Information Systems provided by Rhiza Labs
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T08:19:40.000Z
|
7oz23tsjz5rapiu543qgl3pfx5dlni3h
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40835",
"uncompressed_offset": 417307197,
"url": "www.go4expert.com/contests/how-old-12-jul-2009-t18497/",
"warc_date": "2013-11-22T19:24:13.000Z",
"warc_filename": "<urn:uuid:57a60f5f-b60e-41e7-9169-fb441e04293b>",
"warc_url": "http://www.go4expert.com/contests/how-old-12-jul-2009-t18497/"
}
|
cccc_CC-MAIN-2013-20
|
How Old | 12 Jul 2009
Go4Expert Founder
12Jul2009,14:26 #1
How many seconds have passed since launch of Go4Expert.com ? Describe your calculation because when you post the answer few seconds error may always be there.
Invasive contributor
12Jul2009,14:40 #2
2625357 seconds
on the assumption that this post will appear at 2:40 pm
and 1st post was on 15-Jul-2004 10:43 AM
Invasive contributor
12Jul2009,14:42 #3
15-Jul-2004 10:43 AM is the time for the first post of 1st thread
http://www.go4expert.com/showthread.php?t=1
~ Б0ЯИ Τ0 С0δЭ ~
12Jul2009,14:47 #4
Wrong answer. !!
Shabbir wants the time elapsed since launch, not the first post.
FYI, G4EF was launched on 12 July 2004, not 15 July. I don't know how to find out the time to the accuracy of seconds, though !
Invasive contributor
12Jul2009,14:47 #5
Sorry wrong calculation
that was in minutes
assuming this post appears on 12-Jul-2009 2:47:00 PM
then it would be 157521840 seconds as per above calculation
Invasive contributor
12Jul2009,14:49 #6
I believe it can be measured from 1st post of 1st thread only
Banned
12Jul2009,18:06 #7
157,793,040 seconds If posted on GMT 5.5+ 06:07 PM.
Banned
12Jul2009,18:06 #8
157,793,040 seconds If posted on GMT 5.5+ 06:07:00 PM.
Go4Expert Founder
12Jul2009,20:13 #9
The answers may be close but not perfect and I would still leave if someone can come up with something more accurate.
Go4Expert Founder
12Jul2009,20:14 #10
Quote:
Originally Posted by naimish
157,793,040 seconds If posted on GMT 5.5+ 06:07 PM.
Whats the basis of it?
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T08:41:11.000Z
|
m3tuznurhy7btd56bdmkxtlodn7aabnv
|
{
"content_type": "application/xhtml+xml",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40837",
"uncompressed_offset": 433120768,
"url": "www.hindawi.com/journals/pm/2011/916486/",
"warc_date": "2013-11-22T19:24:13.000Z",
"warc_filename": "<urn:uuid:57a60f5f-b60e-41e7-9169-fb441e04293b>",
"warc_url": "http://www.hindawi.com/journals/pm/2011/916486/"
}
|
cccc_CC-MAIN-2013-20
|
About this Journal Submit a Manuscript Table of Contents
Pulmonary Medicine
Volume 2011 (2011), Article ID 916486, 9 pages
doi:10.1155/2011/916486
Research Article
Gradual Increase of High Mobility Group Protein B1 in the Lungs after the Onset of Acute Exacerbation of Idiopathic Pulmonary Fibrosis
1Department of Respiratory Medicine, Tohoku University Graduate School of Medicine, 1-1 Seiryo, Aoba-ku, Sendai 980-8574, Japan
2Department of Respiratory Medicine, Tosei General Hospital, Seto, Aichi 489-8642, Japan
3Department of Veterinary Biochemistry, Rakuno Gakuen University, Ebetsu, Hokkaido 069-8501, Japan
4Central Institute, Shino-Test Corporation, Kanagawa 229-0011, Japan
5Virus Research Center, National Hospital Organization, Sendai 983-0045, Japan
6Department of Medicine, Keio University, Tokyo 160-8582, Japan
7Department of Laboratory and Molecular Medicine, Kagoshima University, Kagoshima 890-8520, Japan
8Department of Thoracic Surgery, Tohoku University Hospital, Sendai 980-8574, Japan
Received 14 August 2010; Revised 27 December 2010; Accepted 29 December 2010
Academic Editor: A. Azuma
Copyright © 2011 Masahito Ebina et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Abstract
The pathogenesis of acute exacerbation of idiopathic pulmonary fibrosis (IPF) remains to be elucidated. To evaluate the roles of inflammatory mediators in acute exacerbation, the concentrations of high mobility group protein B1 (HMGB1), a chief mediator of acute lung injury, and 18 inflammatory cytokines were measured in the bronchoalveolar lavage fluid, serially sampled from seven IPF patients after the onset of acute exacerbation. HMGB1 gradually increased in the alveolar fluid after the onset of acute exacerbation, in positive correlation with monocytes chemotactic protein-1 (MCP-1), a potent fibrogenic mediator. In the lung tissues of eight IPF patients autopsied after acute exacerbation, intense cytoplasmic staining for HMGB1 was observed in the alveolar epithelial cells in alveolar capillary augmented lesions, where the capillary endothelial cells remarkably reduced the expression of thrombomodulin, an intrinsic antagonist of HMGB1. These results suggest pathogenic roles for HMGB1 and MCP-1 in the late phase of acute exacerbation of IPF.
1. Introduction
Idiopathic pulmonary fibrosis (IPF) is one of the most refractory of all lung diseases lacking effective therapy [1]. Not only progressive pulmonary fibrosis but also acute exacerbation, defined as clinically significant deterioration of unidentifiable cause, is attributed to the poor survival of these patients [2]. In the pathologic findings in the lungs of IPF patients afflicted with acute exacerbation, diffuse alveolar damage, which is consistent with the findings observed after acute lung injury from various causes [2], is the most characteristic underlying usual interstitial pneumonia. However, the etiology of acute exacerbation of IPF has yet to be elucidated.
High mobility group protein B1 (HMGB1) was originally identified as a nuclear nonhistone protein with DNA-binding domains and implicated as an important endogenous danger signaling molecule [3] as well as a late mediator of systemic inflammation in septic shock [4, 5], thus having a putative role in the pathogenesis of acute lung injury [6, 7]. In addition, several studies have identified the B-box domain of HMGB1 as important for many of the proinflammatory properties of HMGB1, including cytokine release [8, 9]. HMGB1 is released passively during cellular necrosis by almost all cells which have a nucleus and signals to neighboring cells in the case of ongoing damage [5]. However, HMGB1 also is secreted actively by immune cells such as monocytes, macrophages, and dendritic cells [4, 10, 11]. The receptor for advanced glycation end products (RAGE) was the first receptor demonstrated to bind HMGB1 [12], and HMGB1 signaling through RAGE was found to promote chemotaxis and the production of cytokines in a process that involves the activation of the transcription factor nuclear factor-κB (NF-κB) [13, 14]. Nevertheless, the contribution of HMGB1 in the pathogenesis of acute exacerbation of IPF has not been determined yet.
We previously reported the heterogeneous remodeling of CD34-positive alveolar capillaries in the lungs of patients with IPF [15]. The alveolar capillaries were decreased in fibrotic lesions, but increased in nonfibrotic alveolar septa around the fibrotic lesions, where VEGF and IL-8, potent angiogenic factors, were augmented [15]. Since VEGF is also a potent inducer of vascular permeability [16], these capillary dense lesions in nonfibrotic alveolar septa are considered to be leaky, and thus susceptible to the alveolar infiltration triggered by inflammatory mediators in acute lung injury [17]. We are also interested in thrombomodulin, an endothelial anticoagulant cofactor, which is highly expressed in alveolar capillaries in normal control lungs but less so in IPF lungs [15]. This is because the N-terminal domain of thrombomodulin binds HMGB1 so as to prevent its interaction with RAGE and thus suppresses the induction of proinflammatory events [18].
In this context, we examined the bronchoalveolar lavage fluid serially sampled from patients with IPF after acute exacerbation, along with the lung tissue specimens, biopsied from patients with stable IPF and autopsied from IPF patients who died after acute exacerbation, to evaluate the involvement of inflammatory mediators in the pathogenesis of acute exacerbation of IPF.
2. Materials and Methods
Clinical Samples
Acute exacerbation of idiopathic pulmonary fibrosis was diagnosed according to the Japanese diagnostic criteria established in 2004 [19], which are essentially compatible with the criteria by the Idiopathic Pulmonary Fibrosis Clinical Research Network Investigators in 2007 [2]. Bronchoalveolar lavage fluid was sampled at Tosei General Hospital from seven patients with IPF after two to four instances of acute exacerbation in each patient to allow for the diagnostic exclusion of infection, and the samples were stored at −80°C degrees. The surgical biopsies of ten patients with stable IPF, and the autopsied lungs of eight patients with IPF who died after acute exacerbation, were obtained at Tohoku University Hospital. The disease-free lung tissues autopsied from three patients without any chronic lung diseases were also examined as controls. These lung tissues were fixed in 10% buffered formalin and imbedded in paraffin wax. The written informed consent obtained from the patients for using these clinical samples was approved by the ethics committee of Tohoku University.
Measurement of HMGB1 and Cytokines
HMGB1 in BALF was measured by a highly sensitive and specific ELISA method (Shino-test, Kanagawa, Japan) [20], as reported previously [6, 7]. In brief, black polystyrene microtiter plates (Corning Laboratory Science, Corning, NY) were coated with anti-HMGB1 polyclonal antibody in phosphate-buffered saline (PBS), washed 3 times with PBS containing 0.05% Tween-20, and blocked by PBS-1% bovine serum albumin for 2 hours. After washing, 100 μl of 8 dilutions each of the standard and samples, 1 : 1 dilutions in 0.2 mol/L Tris (pH 6.5), 0.15 mol/L NaCl containing 1% BSA were added to the wells and incubated for 24 hours at room temperature. After washing, antihuman HMGB1 peroxidase-conjugated monoclonal antibody was added and incubated at room temperature for 30 minutes. After another washing step, PS-atto (Lumigen, Southfield, MI) was added, and its luminescence was measured with a 9000D microplate luminescence reader (DIA-IATRON, Tokyo, Japan). The concentrations of 17 cytokines in these BALF samples, consisting of Interleukin (IL)-1β, IL-2, IL-4, IL-5, IL-6, IL-7, IL-8, IL-10, IL-13, IL-17, granulocyte colony stimulating factor (G-CSF), monocytes chemotactic protein-1 (MCP-1), granulocyte/macrophage-colony stimulating factor (GM-CSF), macrophage inflammatory protein (MIP)-1β, interferon (IFN)-γ, and tumor necrosis factor (TNF-α), were determined using Bio-Plex (Bio-Rad Laboratories Inc.) following the manufacturer's protocol. The total TGF-β1 in these BALF samples was also measured using the enzyme immunoassay (EIA) produced by MBC Laboratories, Inc. (Tokyo, Japan).
Virus Isolation
Each BALF sample was subjected to virus isolation by the microplate method [21] at the Virus Research Center at the National Hospital Organization (Sendai, JAPAN). In short, the specimen was placed in transport medium composed of Eagle’s minimum essential medium (Sigma, St. Louis, MO, USA) with 0.5% gelatin containing 500 units/ml of penicillin G and 500 mg/ml of streptomycin and was centrifuged at 4,000 g at 4°C for 15 min. The supernatant fraction was inoculated into cultured cells of human embryonic fibroblasts, using the cell lines, HEp-2; Vero; HMV-II, MDCK, LLC-MK2 cells, which can support the growth of numerous viruses, including respiratory syncytial virus, influenza viruses, parainfluenza viruses, enteroviruses, adenoviruses, cytomegalovirus, herpes simplex virus, rhinovirus, mumps virus, measles virus, human coronavirus 229E, and human metapneumovirus. After inoculation, cytopathic effects were examined daily for two weeks, and, furthermore, when no CPE was found, blind passage was performed once for another two weeks with the same system. RT-PCR was also performed for human metapneumovirus virus isolation [22].
Immunohistochemistry
Tissue sections of 3 μm thickness were deparaffinized and treated with a peroxidase-blocking reagent (DAKO, Carpinteria, CA) for 10 minutes at room temperature before incubation with the primary antibodies. The antibodies and the optimal dilutions used in this study were as follows: monoclonal antibodies against human HMGB1 (1 : 3,000, Shino-test), the same antibody used for ELISA, RAGE (MAB5328, 1 : 50, CHEMICON International, Inc., Temecula, CA), thrombomodulin (TM1009, 1 : 100, DAKO Company Ltd., Glostrup, Denmark), CD34 (4A1, 1 : 100, Nichirei Co., Tokyo, Japan), and antihuman von Willebrand factor (vWF) monoclonal antibody (F8/86, 1 : 1,000, Nichirei). The tissues were incubated with a primary antibody in a moist chamber at 4°C for overnight and were further reacted with a polymer reagent (ENVISON kit; DAKO, Carpinteria, CA) for 60 minutes at room temperature. For double immunohistochemical staining, the antigen-antibody complex was visualized with Vector Red (Vector Laboratories, Burlingame, CA) or 1 mM 3.3′-diaminobenzidine (DAB), as described previously [15].
Morphometric Evaluation
The percentages of the distribution area of the cells immunoreactive for thrombomodulin among those immunoreactive for CD34 were estimated from 30 randomly selected color images at a magnification of 400 in each case using a digital image analysis system (Lumina Vision, Mitani Corporation, Fukui, Japan).
Statistical Analysis
For analysis of two unpaired samples, the nonparametric Mann-Whitney U test was used. A significant difference was defined as . All values were represented as the means ± SEM.
3. Results
3.1. Cytokines in BALF after Acute Exacerbation
The bronchoalveolar lavage fluid (BALF) that we examined in this study was serially sampled two to four times after acute exacerbation from each IPF patient (). Although all of these patients were treated with steroid therapy after the diagnosis of acute exacerbation (Day 1), none of these patients were mechanically ventilated during the treatment. We measured the concentrations of HMGB1 and 18 other inflammatory cytokines, consisting of IL-1β, IL-2, IL-4, IL-5, IL-6, IL-7, IL-8, IL-10, IL-13, IL-17, G-CSF, MCP-1, GM-CSF, MIP-1β, IFN-γ, TNF-α, and TGF−β. The findings in two of these seven patients are illustrated (Figures 1(a) and 1(b)). Although the concentration of HMGB1 in BALF was low in the early phase of acute exacerbation, HMGB1, and MCP-1 as well, continued increasing even after steroid therapy. The pooled data (16 samples from 7 patients) of the HMGB1 concentration in the BALF of these seven patients also revealed a gradual increase of HMGB1 after acute exacerbation (Figure 1(c)). Among the inflammatory cytokines examined in these BALF samples, only MCP-1 was increased in positive correlation with HMGB1 (Figures 1(a) and 1(d)).
Figure 1: Inflammatory mediators in the BALF of IPF patients after acute exacerbation. (a) The concentrations of inflammatory mediators in the BALF of a 69-year-old male (an ex-smoker, Brickman index = 400) on days 1, 2, 13, and 21 after steroid therapy against acute exacerbation. He had been followed up without immunosuppressive therapy against IPF before administration to the hospital. No mechanical ventilator was used for treatment. He died 5 months later. (b) A 67-year-old female (a nonsmoker, no previous treatment for IPF) diagnosed with acute exacerbation 3 days after “flu-like” phenomena and died 3 months later. No mechanical ventilator was used for treatment. (c) The pooled data of the HMGB1 concentration in 16 BALF samples obtained from 7 patients showed a gradual increase of HMGB1 even after the steroid therapy for acute exacerbation (, ). (d) Among the 18 cytokines in the BALF samples examined, only MCP-1 was increased in positive correlation with HMGB1 (, ) after the steroid therapy for acute exacerbation.
Our attempts at virus isolation in the BALF specimens sampled after acute exacerbation did not uncover any of the usual pathogenic bacteria or viruses, such as respiratory syncytial virus, influenza viruses, parainfluenza viruses, enteroviruses, adenoviruses, rhinovirus, cytomegalovirus, herpes simplex virus, coronavirus, mumps virus, or metapneumovirus (data not shown).
3.2. HMGB1 Producing Cells in Lung Tissue
The immunohistochemical expression of HMGB1 in the lung tissues of 18 patients with IPF was compared between two patient groups: the autopsied lung tissues of eight patients who had who died after acute exacerbation and the surgically biopsied lung tissues of ten patients with stable IPF. In the autopsied lung tissues, intense cytoplasmic staining for HMGB1 was observed in most of alveolar macrophages and alveolar epithelial cells with or without nuclear staining (Figure 2(a)). Double immunostaining for HMGB1 and CD34, a marker of alveolar capillary endothelial cells [15], clearly revealed the distribution of these cells, with an intense expression of HMGB1 near the capillary augmented alveolar septa that were without apparent fibrosis (Figures 2(b) and 2(c)). In contrast, only nuclear staining for HMGB1 was observed in the surgical lung biopsies of the patients with stable IPF (Figure 2(d)).
Figure 2: Immunohistochemical HMGB1 expression in lung tissues. (a) Intense cytoplasmic and nuclear staining HMGB1 was observed in alveolar macrophages and alveolar epithelial cells in the lungs of patients with IPF who died after acute exacerbation (HMGB1 in brown, bar = 50 μm). (b) and (c) The immunoreactive cells for HMGB1 were distributed in the alveolar damaged lesions in which the alveolar capillaries were increased (CD34 in red and HMGB1 in brown; scale bars: 100 μm in (b) and 50 μm in (c)). (d) In the surgical lung biopsies of the IPF patients (d) revealed only nuclear staining for HMGB1 (HMGB1 in brown; scale bar: 50 μm). The sections were counterstained with Elastica-Goldner staining, showing the elastic fibers in purple and collagen in light blue ((b)–(d)).
The average percentage of the cells immunoreactive for HMGB1 was % (mean ± SEM) in the autopsied lung tissues of IPF patients after acute exacerbation (Figure 3). In the surgical biopsies of patients with stable IPF, % of the cells were positive for HMGB1 without a significant difference compared with the autopsies (); however, most of these cells with HMGB1 immunoreactivity in the case of the surgical biopsies exhibited nuclear staining (Figure 2(d)) along with rare cytoplasmic staining (%), which was significantly different compared with the percentage of nuclear staining in autopsies (%, ) (Figure 3).
Figure 3: Quantitative distribution of HMGB1-positive cells in lung tissues. (a) The distribution patterns of the cells positive for HMGB1 were quantified in the autopsied lung tissues after acute exacerbation in 8 IPF patients (AEx IPF), using the biopsied lung tissues of 10 patients with stable IPF and three controls. (b) The percentages of immunoreactive cells with nuclear or cytoplasmic staining for HMGB1 are shown. The cells with both cytoplasmic and nuclear staining for HMGB1 were counted as cytoplasmic.
3.3. Expression of MCP-1, RAGE, and Thrombomodulin
The distribution of the cells immunoreactive for HMGB1 was compared with that of MCP-1 and RAGE, one of the main receptors for HMGB1, in the postmortem lung tissues of patients with IPF and acute exacerbation. The cells producing MCP-1 coincided with the cells having cytoplasmic HMGB1 expression (Figures 4(a) and 4(b)), while the intense expression of RAGE was chiefly observed in epithelial cells and to a lesser extent in capillary endothelial cells (Figures 4(c) and 4(d)).
Figure 4: Distribution of HMGB1, MCP1 and RAGE in the lungs after acute exacerbation. The cells immunoreactive for HMGB1 (a) and MCP-1 (b) in the consecutive sections of the autopsied lung tissues of IPF patients who died after acute exacerbation (bars = 100 μm). The intense immunoreactivity of RAGE, the receptor of HMGB1, was observed in type I alveolar epithelial cells in these lungs ((c) and (d)) ((c), bar = 100 μm; (d), bar = 10 μm). The sections were counterstained with Elastica-Goldner staining, showing the elastic fibers in purple and collagen in light blue ((a)–(d)).
The alveolar capillaries which were immunoreactive for CD34 expression (Figure 5(a)) and thrombomodulin (Figure 5(b)) were revealed in consecutive sections of a typical case of surgical biopsies. The immunoreactivity of thrombomodulin was almost always sustained in CD34-positive alveolar capillaries. In contrast, the endothelial expression of thrombomodulin was apparently decreased in the autopsied lung tissues of IPF patients after acute exacerbation (Figures 5(c) and 5(d)). Morphometric analysis using a digital image analyzer system clearly revealed the decrease of immunoreactivity for thrombomodulin compared to CD34 in the autopsied lung tissues of IPF patients died after acute exacerbation (%, ) in comparison with controls (%, ) and even with the biopsied lung tissues from stable IPF patients (%, ). No significant difference was found between the stable IPF patients and normal controls in terms of thrombomodulin reactivity against CD34 (Figure 5(e)).
Figure 5: Distribution of alveolar capillary endothelial cells positive for thrombomodulin in stable IPF, acute exacerbation of IPF and controls. (a) and (b) The lung tissues which were surgically biopsied from a patient with stable IPF were double immunostained for HMGB1 (in brown) and CD34 (in red) (a). The consecutive sections were stained for HMGB1 (in brown) and thrombomodulin (in red) (b) (bars = 100 μm). (c) and (d) The lung tissues which were obtained by autopsy from a patient who died after acute exacerbation were double immunostained for HMGB1 (in brown) and CD34 (in red) (c) or thrombomodulin (in red) (d) in the consecutive sections (bars = 100 μm). (e) The percentages of the distribution areas of the capillary endothelial cells immunoreactive for thrombomodulin per those immunoreactive for CD34 were evaluated by a digital image analyzer and compared among stable IPF (), acute exacerbation (AEx IPF, ) of IPF, and controls ().
4. Discussion
This is the first report of a persistent elevation of HMGB1 and MCP-1 after the onset of acute exacerbation in the lungs of patients with IPF. Both of these mediators were produced by alveolar macrophages and alveolar type II epithelial cells distributed in the capillary-increased alveolar lesions in which the capillary endothelial cells exhibited reduced expression of thrombomodulin, an intrinsic antagonist of HMGB1 [18].
The gradual increase of HMGB1 in the bronchoalveolar lavage fluid after the onset of acute exacerbation suggests several plausible roles in the pathogenesis of acute exacerbation of IPF. One of the roles of HMGB1 is as a late mediator of acute exacerbation, because the concentration of HMGB1 was low at the initial onset of acute exacerbation. Although no virulent organisms or viruses were detected in the bronchoalveolar lavage fluids examined in this study, all of these patients had flu-like symptoms a few days before the onset of acute exacerbation, which can cause a trigger-like effect of fulminating inflammation similar to acute lung injury. The gradual increase of HMGB1 in the epithelial lining fluids in the lungs after the initial onset of lung injury was also reported in both experimental and clinical acute lung injury [6]. Although HMGB1 can be released by macrophages in response to viral infection [23], the gradual increase of HMGB1 observed in this study is considered to be induced by passive release from necrotic alveolar type II epithelial cells [5] and by active secretion from alveolar macrophages in response to TNFα, IL-1, IFNγ, and oxidative stress without proved molecular mechanisms [2426]. This is because HMGB1 increased in the absence of virulent virus and because the cytoplasmic staining of HMGB1 was significantly increased in these cells after acute exacerbation.
In contrast to the role promoting severe inflammation, HMGB1 has been reported to promote tissue repair and regeneration [27]. Importantly, HMGB1 induces the migration of stem cells toward inflamed regions to promote repair and regeneration [28]. For example, in smooth muscle cells, HMGB1 induces proliferation and rapid changes in cellular architecture, resulting in cell migration [29, 30]. Interestingly, many of these restorative effects are mediated through the same receptors (e.g., RAGE) that mediate the proinflammatory properties of the molecule [29]. Considering a recent report that the loss of RAGE contributes to pulmonary fibrosis [31], the increase of HMGB1 in alveolar fluids itself may induce fibrogenesis through other HMGB1 receptors, such as the Toll-like family of receptors (TLRs), TLR4, TLR2, or TLR9 [32, 33]. The gradual increase of MCP-1 in positive correlation with HMGB1 in alveolar fluids after acute exacerbation may also contribute to fibroproliferation [34, 35], which is thought to be involved in the regenerative effects of HMGB1. Of course, we cannot deny at this point the plausibility that treatment, including steroid therapy, for these patients in the hospital after the onset of acute exacerbation might affect the gradual increase of HMGB1. In addition, the correlation of the concentration of HMGB1 and/or MCP-1 in BALF with the disease severity of acute exacerbation of IPF has been left for expectations.
We observed that the cells with cytoplasmic expression of HMGB1 were distributed in the alveolar capillary augmented lesions [15] in which the endothelial cells displayed reduced expression of thrombomodulin, an intrinsic antagonist of HMGB1 [18], after acute exacerbation. As we reported previously, even though neutrophils could be origin of HMGB1 in acute lung injury [7], in addition to alveolar epithelial cells and alveolar macrophages, the concentration of HMGB1 beside capillaries should be elevated. These capillary augmented lesions in IPF patients are susceptible to acute lung injury, not only because these capillaries reduce the ability to antagonize HMGB1 but also because VEGF, which is elevated (augmented) in these lesions [15], loosens the tight junctions of endothelial cells so as to induce leakage [36, 37]. The decreased expression of thrombomodulin, which is an anticoagulant [38] as well, may readily induce coagulation in these capillary augmented lesions, which frequently occurs in cases of acute exacerbation in IPF patients [39].
We conclude from these results that HMGB1 and MCP-1 are increased in the lungs of IPF patients after acute exacerbation and that the alveolar capillary augmented lesions with decreased expression of thrombomodulin, an intrinsic inhibitor of HMGB1, may exacerbate alveolar damage and fibrogenesis.
Acknowledgments
This work was supported in part by Grant-in-Aid for Scientific Research by Japan Society for the Promotion of Science (no. 22390164 to M. Ebina) and by a grant to the Diffuse Lung Diseases Research Group from the Ministry of Health, Labor and Welfare of Japanese Government (to M. Ebina).
References
1. W. D. Travis, T. E. King, E. D. Bateman et al., “American thoracic society/European respiratory society international multidisciplinary consensus classification of the idiopathic interstitial pneumonias,” American Journal of Respiratory and Critical Care Medicine, vol. 165, no. 2, pp. 277–304, 2002. View at Scopus
2. H. R. Collard, B. B. Moore, K. R. Flaherty et al., “Acute exacerbations of idiopathic pulmonary fibrosis,” American Journal of Respiratory and Critical Care Medicine, vol. 176, no. 7, pp. 636–643, 2007. View at Publisher · View at Google Scholar · View at PubMed
3. J. R. Klune, R. Dhupar, J. Cardinal, T. R. Billiar, and A. Tsung, “HMGB1: endogenous danger signaling,” Molecular Medicine, vol. 14, no. 7-8, pp. 476–484, 2008. View at Publisher · View at Google Scholar · View at PubMed · View at Scopus
4. H. Wang, O. Bloom, M. Zhang et al., “HMG-1 as a late mediator of endotoxin lethality in mice,” Science, vol. 285, no. 5425, pp. 248–251, 1999. View at Publisher · View at Google Scholar · View at Scopus
5. P. Scaffidi, T. Misteli, and M. E. Bianchi, “Release of chromatin protein HMGB1 by necrotic cells triggers inflammation,” Nature, vol. 418, no. 6894, pp. 191–195, 2002. View at Publisher · View at Google Scholar · View at PubMed · View at Scopus
6. H. Ueno, T. Matsuda, S. Hashimoto et al., “Contributions of high mobility group box protein in experimental and clinical acute lung injury,” American Journal of Respiratory and Critical Care Medicine, vol. 170, no. 12, pp. 1310–1316, 2004. View at Publisher · View at Google Scholar · View at PubMed · View at Scopus
7. E. N. Ogawa, A. Ishizaka, S. Tasaka et al., “Contribution of high-mobility group box-1 to the development of ventilator-induced lung injury,” American Journal of Respiratory and Critical Care Medicine, vol. 174, no. 4, pp. 400–407, 2006. View at Publisher · View at Google Scholar · View at PubMed · View at Scopus
8. J. Li, R. Kokkola, S. Tabibzadeh et al., “Structural basis for the proinflammatory cytokine activity of high mobility group box 1,” Molecular Medicine, vol. 9, no. 1-2, pp. 37–45, 2003. View at Scopus
9. D. Messmer, H. Yang, G. Telusma et al., “High mobility group box protein 1: an endogenous signal for dendritic cell maturation and Th1 polarization,” Journal of Immunology, vol. 173, no. 1, pp. 307–313, 2004. View at Scopus
10. M. T. Lotze and K. J. Tracey, “High-mobility group box 1 protein (HMGB1): nuclear weapon in the immune arsenal,” Nature Reviews Immunology, vol. 5, no. 4, pp. 331–342, 2005. View at Publisher · View at Google Scholar · View at PubMed · View at Scopus
11. E. Abraham, J. Arcaroli, A. Carmody, H. Wang, and K. J. Tracey, “Cutting edge: HMG-1 as a mediator of acute lung inflammation,” Journal of Immunology, vol. 165, no. 6, pp. 2950–2954, 2000. View at Scopus
12. O. Hori, J. Brett, T. Slattery et al., “The receptor for advanced glycation end products (RAGE) is a cellular binding site for amphoterin. Mediation of neurite outgrowth and co-expression of RAGE and amphoterin in the developing nervous system,” The Journal of Biological Chemistry, vol. 270, no. 43, pp. 25752–25761, 1995. View at Publisher · View at Google Scholar · View at Scopus
13. R. Palumbo, B. G. Galvez, T. Pusterla et al., “Cells migrating to sites of tissue damage in response to the danger signal HMGB1 require NF-κB activation,” Journal of Cell Biology, vol. 179, no. 1, pp. 33–40, 2007. View at Publisher · View at Google Scholar · View at PubMed · View at Scopus
14. J. S. Park, J. Arcaroli, H. K. Yum et al., “Activation of gene expression in human neutrophils by high mobility group box 1 protein,” American Journal of Physiology, vol. 284, no. 4, pp. C870–C879, 2003. View at Scopus
15. M. Ebina, M. Shimizukawa, N. Shibata et al., “Heterogeneous increase in CD34-positive alveolar capillaries in idiopathic pulmonary fibrosis,” American Journal of Respiratory and Critical Care Medicine, vol. 169, no. 11, pp. 1203–1208, 2004. View at Scopus
16. S. Fischer, T. Gerriets, C. Wessels et al., “Extracellular RNA mediates endothelial-cell permeability via vascular endothelial growth factor,” Blood, vol. 110, no. 7, pp. 2457–2465, 2007. View at Publisher · View at Google Scholar · View at PubMed · View at Scopus
17. M. Mura, C. C. Dos Santos, D. Stewart, and M. Liu, “Vascular endothelial growth factor and related molecules in acute lung injury,” Journal of Applied Physiology, vol. 97, no. 5, pp. 1605–1617, 2004. View at Publisher · View at Google Scholar · View at PubMed · View at Scopus
18. K. Abeyama, D. M. Stern, Y. Ito et al., “The N-terminal domain of thrombomodulin sequesters high-mobility group-B1 protein, a novel antiinflammatory mechanism,” Journal of Clinical Investigation, vol. 115, no. 5, pp. 1267–1274, 2005. View at Publisher · View at Google Scholar · View at Scopus
19. H. Taniguchi, M. Ebina, Y. Kondoh, et al., “Pirfenidone in idiopathic pulmonary fibrosis,” European Respiratory Journal, vol. 36, no. 3, pp. 695–696, 2010. View at Publisher · View at Google Scholar · View at PubMed
20. S. Yamada, K. Inoue, K. Yakabe, H. Imaizumi, and I. Maruyama, “High mobility group protein 1 (HMGB1) quantified by ELISA with a monoclonal antibody that does not cross-react with HMGB2,” Clinical Chemistry, vol. 49, no. 9, pp. 1535–1537, 2003. View at Publisher · View at Google Scholar · View at Scopus
21. Y. Numazaki, T. Oshima, A. Ohmi et al., “A microplate method for isolation of viruses from infants and children with acute respiratory infections,” Microbiology and Immunology, vol. 31, no. 11, pp. 1085–1095, 1987. View at Scopus
22. A. Suzuki, O. Watanabe, M. Okamoto et al., “Detection of human metapneumovirus from children with acute otitis media,” Pediatric Infectious Disease Journal, vol. 24, no. 7, pp. 655–657, 2005. View at Publisher · View at Google Scholar · View at Scopus
23. W. Jiang, C. W. Bell, and D. S. Pisetsky, “The relationship between apoptosis and high-mobility group protein 1 release from murine macrophages stimulated with lipopolysaccharide or polyinosinic-polycytidylic acid,” Journal of Immunology, vol. 178, no. 10, pp. 6495–6503, 2007. View at Scopus
24. B. Rendon-Mitchell, M. Ochani, J. Li et al., “IFN-γ induces high mobility group box 1 protein release partly through a TNF-dependent mechanism,” Journal of Immunology, vol. 170, no. 7, pp. 3890–3897, 2003. View at Scopus
25. A. Rouhiainen, J. Kuja-Panula, E. Wilkman et al., “Regulation of monocyte migration by amphoterin (HMGB1),” Blood, vol. 104, no. 4, pp. 1174–1182, 2004. View at Publisher · View at Google Scholar · View at PubMed · View at Scopus
26. D. Tang, Y. Shi, R. Kang et al., “Hydrogen peroxide stimulates macrophages and monocytes to actively release HMGB1,” Journal of Leukocyte Biology, vol. 81, no. 3, pp. 741–747, 2007. View at Publisher · View at Google Scholar · View at PubMed · View at Scopus
27. M. E. Bianchi and A. A. Manfredi, “High-mobility group box 1 (HMGB1) protein at the crossroads between innate and adaptive immunity,” Immunological Reviews, vol. 220, no. 1, pp. 35–46, 2007. View at Publisher · View at Google Scholar · View at PubMed · View at Scopus
28. R. Palumbo and M. E. Bianchi, “High mobility group box 1 protein, a cue for stem cell recruitment,” Biochemical Pharmacology, vol. 68, no. 6, pp. 1165–1170, 2004. View at Publisher · View at Google Scholar · View at PubMed · View at Scopus
29. B. Degryse, T. Bonaldi, P. Scaffidi et al., “The high mobility group (HMG) boxes of the nuclear protein HMG1 induce chemotaxis and cytoskeleton reorganization in rat smooth muscle cells,” Journal of Cell Biology, vol. 152, no. 6, pp. 1197–1206, 2001. View at Publisher · View at Google Scholar · View at Scopus
30. A. Porto, R. Palumbo, M. Pieroni et al., “Smooth muscle cells in human atherosclerotic plaques secrete and proliferate in response to high mobility group box 1 protein,” The FASEB Journal, vol. 20, no. 14, pp. 2565–2566, 2006. View at Publisher · View at Google Scholar · View at PubMed · View at Scopus
31. J. M. Englert, L. E. Hanford, N. Kaminski et al., “A role for the receptor for advanced glycation end products in idiopathic pulmonary fibrosis,” American Journal of Pathology, vol. 172, no. 3, pp. 583–591, 2008. View at Publisher · View at Google Scholar · View at PubMed · View at Scopus
32. J. S. Park, F. Gamboni-Robertson, Q. He et al., “High mobility group box 1 protein interacts with multiple Toll-like receptors,” American Journal of Physiology, vol. 290, no. 3, pp. C917–C924, 2006. View at Publisher · View at Google Scholar · View at PubMed · View at Scopus
33. J. Tian, A. M. Avalos, S. Y. Mao et al., “Toll-like receptor 9-dependent activation by DNA-containing immune complexes is mediated by HMGB1 and RAGE,” Nature Immunology, vol. 8, no. 5, pp. 487–496, 2007. View at Publisher · View at Google Scholar · View at PubMed · View at Scopus
34. B. B. Moore, M. Peters-Golden, P. J. Christensen et al., “Alveolar epithelial cell inhibition of fibroblast proliferation is regulated by MCP-1/CCR2 and mediated by PGE,” American Journal of Physiology, vol. 284, no. 2, pp. L342–L349, 2003. View at Scopus
35. I. Inoshima, K. Kuwano, N. Hamada et al., “Anti-monocyte chemoattractant protein-1 gene therapy attenuates pulmonary fibrosis in mice,” American Journal of Physiology, vol. 286, no. 5, pp. L1038–L1044, 2004. View at Publisher · View at Google Scholar · View at PubMed · View at Scopus
36. S. Fischer, T. Gerriets, C. Wessels et al., “Extracellular RNA mediates endothelial-cell permeability via vascular endothelial growth factor,” Blood, vol. 110, no. 7, pp. 2457–2465, 2007. View at Publisher · View at Google Scholar · View at PubMed · View at Scopus
37. M. Mura, C. C. dos Santos, D. Stewart, and M. Liu, “Vascular endothelial growth factor and related molecules in acute lung injury,” Journal of Applied Physiology, vol. 97, no. 5, pp. 1605–1617, 2004. View at Publisher · View at Google Scholar · View at PubMed · View at Scopus
38. C. T. Esmon, “The roles of protein C and thrombomodulin in the regulation of blood coagulation,” The Journal of Biological Chemistry, vol. 264, no. 9, pp. 4743–4746, 1989. View at Scopus
39. H. Kubo, K. Nakayama, M. Yanai et al., “Anticoagulant therapy for idiopathic pulmonary fibrosis,” Chest, vol. 128, no. 3, pp. 1475–1482, 2005. View at Publisher · View at Google Scholar · View at PubMed · View at Scopus
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T08:39:51.000Z
|
7iflsufm76s7lblcgfdwiwpcqgcod7ql
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40852",
"uncompressed_offset": 503147788,
"url": "www.mdpi.com/1422-0067/13/12/17077",
"warc_date": "2013-11-22T19:24:13.000Z",
"warc_filename": "<urn:uuid:57a60f5f-b60e-41e7-9169-fb441e04293b>",
"warc_url": "http://www.mdpi.com/1422-0067/13/12/17077"
}
|
cccc_CC-MAIN-2013-20
|
Int. J. Mol. Sci. 2012, 13(12), 17077-17103; doi:10.3390/ijms131217077
Review
Plant Glandular Trichomes as Targets for Breeding or Engineering of Resistance to Herbivores
1 Department of Population Biology, Institute for Biodiversity and Ecosystem Dynamics, 1098 XH Science Park 904, Amsterdam, The Netherlands 2 Department of Plant Breeding, Subtropical and Mediterranean Horticulture Institute "La Mayora" (IHSM), Spanish Council for Scientific Research (CSIC), Experimental Station "La Mayora", E-29750, Algarrobo-Costa, Málaga, Spain 3 Department of Plant Physiology, Swammerdam Institute of Life Sciences, 1098 XH, Science Park 904, Amsterdam, The Netherlands
* Author to whom correspondence should be addressed.
Received: 6 November 2012; in revised form: 28 November 2012 / Accepted: 5 December 2012 / Published: 12 December 2012
(This article belongs to the Special Issue Green Biocides)
Download PDF Full-Text [1172 KB, uploaded 12 December 2012 14:36 CET]
Abstract: Glandular trichomes are specialized hairs found on the surface of about 30% of all vascular plants and are responsible for a significant portion of a plant’s secondary chemistry. Glandular trichomes are an important source of essential oils, i.e., natural fragrances or products that can be used by the pharmaceutical industry, although many of these substances have evolved to provide the plant with protection against herbivores and pathogens. The storage compartment of glandular trichomes usually is located on the tip of the hair and is part of the glandular cell, or cells, which are metabolically active. Trichomes and their exudates can be harvested relatively easily, and this has permitted a detailed study of their metabolites, as well as the genes and proteins responsible for them. This knowledge now assists classical breeding programs, as well as targeted genetic engineering, aimed to optimize trichome density and physiology to facilitate customization of essential oil production or to tune biocide activity to enhance crop protection. We will provide an overview of the metabolic diversity found within plant glandular trichomes, with the emphasis on those of the Solanaceae, and of the tools available to manipulate their activities for enhancing the plant’s resistance to pests.
Keywords: glandular trichome; plant-herbivore interactions; pathogen; Solanaceae; pest resistance; plant defense; leaf hair; tomato; plant breeding; genetic engineering
Article Statistics
Click here to load and display the download statistics.
Cite This Article
MDPI and ACS Style
Glas, J.J.; Schimmel, B.C.J.; Alba, J.M.; Escobar-Bravo, R.; Schuurink, R.C.; Kant, M.R. Plant Glandular Trichomes as Targets for Breeding or Engineering of Resistance to Herbivores. Int. J. Mol. Sci. 2012, 13, 17077-17103.
AMA Style
Glas JJ, Schimmel BCJ, Alba JM, Escobar-Bravo R, Schuurink RC, Kant MR. Plant Glandular Trichomes as Targets for Breeding or Engineering of Resistance to Herbivores. International Journal of Molecular Sciences. 2012; 13(12):17077-17103.
Chicago/Turabian Style
Glas, Joris J.; Schimmel, Bernardus C.J.; Alba, Juan M.; Escobar-Bravo, Rocío; Schuurink, Robert C.; Kant, Merijn R. 2012. "Plant Glandular Trichomes as Targets for Breeding or Engineering of Resistance to Herbivores." Int. J. Mol. Sci. 13, no. 12: 17077-17103.
Int. J. Mol. Sci. EISSN 1422-0067 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T08:49:32.000Z
|
u3gy6je4fgifgpu7qqus2vhqm45ku4b5
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40853",
"uncompressed_offset": 503160108,
"url": "www.mdpi.com/1424-8220/12/3/2561",
"warc_date": "2013-11-22T19:24:13.000Z",
"warc_filename": "<urn:uuid:57a60f5f-b60e-41e7-9169-fb441e04293b>",
"warc_url": "http://www.mdpi.com/1424-8220/12/3/2561"
}
|
cccc_CC-MAIN-2013-20
|
Sensors 2012, 12(3), 2561-2581; doi:10.3390/s120302561
Article
Error Estimation for the Linearized Auto-Localization Algorithm
Centro de Automática y Robótica (CAR), Consejo Superior de Investigaciones Científicas (CSIC)-UPM, Ctra. Campo Real km 0.2, La Poveda-Arganda del Rey, 28500, Madrid, Spain
* Author to whom correspondence should be addressed.
Received: 6 January 2012; in revised form: 17 February 2012 / Accepted: 20 February 2012 / Published: 24 February 2012
(This article belongs to the Special Issue Sensorial Systems Applied to Intelligent Spaces)
Download PDF Full-Text [810 KB, uploaded 24 February 2012 16:13 CET]
Abstract: The Linearized Auto-Localization (LAL) algorithm estimates the position of beacon nodes in Local Positioning Systems (LPSs), using only the distance measurements to a mobile node whose position is also unknown. The LAL algorithm calculates the inter-beacon distances, used for the estimation of the beacons’ positions, from the linearized trilateration equations. In this paper we propose a method to estimate the propagation of the errors of the inter-beacon distances obtained with the LAL algorithm, based on a first order Taylor approximation of the equations. Since the method depends on such approximation, a confidence parameter τ is defined to measure the reliability of the estimated error. Field evaluations showed that by applying this information to an improved weighted-based auto-localization algorithm (WLAL), the standard deviation of the inter-beacon distances can be improved by more than 30% on average with respect to the original LAL method.
Keywords: auto-localization; auto-calibration; local positioning systems; differential sensitivity analysis; uncertainty propagation
Article Statistics
Click here to load and display the download statistics.
Cite This Article
MDPI and ACS Style
Guevara, J.; Jiménez, A.R.; Prieto, J.C.; Seco, F. Error Estimation for the Linearized Auto-Localization Algorithm. Sensors 2012, 12, 2561-2581.
AMA Style
Guevara J, Jiménez AR, Prieto JC, Seco F. Error Estimation for the Linearized Auto-Localization Algorithm. Sensors. 2012; 12(3):2561-2581.
Chicago/Turabian Style
Guevara, Jorge; Jiménez, Antonio R.; Prieto, Jose Carlos; Seco, Fernando. 2012. "Error Estimation for the Linearized Auto-Localization Algorithm." Sensors 12, no. 3: 2561-2581.
Sensors EISSN 1424-8220 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T07:40:02.000Z
|
kohz6bnjai7qrmxm7aii7iy6ugnyw5eq
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40864",
"uncompressed_offset": 542313729,
"url": "www.openwetware.org/index.php?diff=prev&oldid=344631&title=Kafatos%3APrinters",
"warc_date": "2013-11-22T19:24:13.000Z",
"warc_filename": "<urn:uuid:57a60f5f-b60e-41e7-9169-fb441e04293b>",
"warc_url": "http://www.openwetware.org/index.php?title=Kafatos:Printers&diff=prev&oldid=344631"
}
|
cccc_CC-MAIN-2013-20
|
Kafatos:Printers
From OpenWetWare
(Difference between revisions)
Jump to: navigation, search
(List of printers)
Line 14: Line 14:
Crisanti Printers
Crisanti Printers
<br>
<br>
-
;crisantihp.bio.ic.ac.uk: HP Laserjet 2200 Series PCL 5 (b/w) on <tt>155.198.150.120</tt> in 5th floor lab
+
;crisantihp2.bio.ic.ac.uk: HP Laserjet 2200 Series PCL 5 (b/w) on <tt>155.198.150.169</tt> in 5th floor lab next to nanodrop
-
;crisantihp2.bio.ic.ac.uk: HP Laserjet 2200 Series PCL 5 (b/w) on <tt>155.198.149.135</tt> in 4th floor
+
;crisantihp.bio.ic.ac.uk: HP Laserjet 2200 Series PCL 5 (b/w) on <tt>155.198.149.135</tt> on 4th floor
+
;lc-acrsprn.saf.ic.ac.uk: HP Color LaserJet 4700 (c) on <tt>155.198.150.158</tt> in 5th floor lab
<br>
<br>
Revision as of 08:22, 27 August 2009
Home Lab Members Research Publications Contact
List of printers
Note: all printers print double sided (duplex) - if you have problems getting this to work, please ask Bob.
Kafatos/Christophides Printers
bio-fckprn.saf.ic.ac.uk
HP Color LaserJet 4700dn on 155.198.151.124 in 6th floor lab
bio-fckprn2.bio.ic.ac.uk
HP LaserJet 2430 (b/w) on 155.198.151.20 in 6th floor lab
ls-fckprn1.saf.ic.ac.uk
Canon LBP3370 (b/w) on 155.198.150.214 in Room 520 (RIP: HP P2015dn)
Crisanti Printers
crisantihp2.bio.ic.ac.uk
HP Laserjet 2200 Series PCL 5 (b/w) on 155.198.150.169 in 5th floor lab next to nanodrop
crisantihp.bio.ic.ac.uk
HP Laserjet 2200 Series PCL 5 (b/w) on 155.198.149.135 on 4th floor
lc-acrsprn.saf.ic.ac.uk
HP Color LaserJet 4700 (c) on 155.198.150.158 in 5th floor lab
Consumables
Please please please: replace toner when needed (shake and replace first - sometimes this gets another 1000 pages!) - and put the old cartridge and box on Bob or Yasmeen's desk so that we can re-order well before your next major deadline.
Windows Vista: Instructions for setting up a printer
1. Click on "Add a printer" in the control panel under "Printers"
2. Click on "Add a network, wireless or bluetooth printer"
3. The printer will not be in the list so select "Add a printer using a TCP/IP adress or hostname"
4. Paste IP adress (e.g. 155.198.151.124) or hostname (e.g. bio-fckprn.saf.ic.ac.uk) and click OK once
Windows XP: Instructions for setting up a printer
1. In the control panel under "Printers and Faxes" click "Add printer"
2. Select "Local Printer attached to this computer" but unselect the tickbox for P&P below
3. Choose "Create a new port" and select "Standard TCP/IP Port"
4. Paste IP adress (e.g. 155.198.151.124) or hostname (e.g. bio-fckprn.saf.ic.ac.uk) and click Next
5. Select manufacturer and model and then click next (Note that there is a generic "HP LaserJet" driver that you can use)
6. Click next a few times (You do not need to share your printer) and then finish
OS-X: instructions for setting up a printer
See alternate instructions below for the Canon printer.
1. Open "System Preferences" and select "Print & Fax"
2. Click on the plus sign (+) below the printers list
3. Click on "IP" in the top panel
4. Paste IP adress (e.g. 155.198.151.124)
5. Wait until it says "Valid and complete address"
6. Click "Add" and then "Continue" on the next screen
At least one of our printers (room 520) will wait for you to press a button on the actual printer before printing a "Letter" document on A4 paper if you are using a mac. If your Mac has "Letter" paper as default in "Page Setup" for all applications, you can change this: Go to Applications → Utilities → Printer Setup Utility → Preferences. Change the default paper option to A4.
It should work... please don't all print a test-page!
Canon LBP3370 Setup
Windows and Mac OS-X drivers are available from Canon's website - just follow the "drivers and software" link (top right). Bob also has a Windows-only Installer CD.
On Windows you have a choice of PCL5, PCL6 and UFR II drivers. You may want to try more than one (just make sure the port name is different).
On Mac, it looks like only the UFR II driver is available.
Adding the printer in Mac OS-X
It's not at all obvious how to do this, so here are some click-by-click instructions.
1. Install the drivers by downloading from the web as above, open the "dmg" and run the installer. Annoyingly, this requires all applications to be shut and a restart.
2. Open the Printer Setup Utility (Applications->Utilities)
3. Immediately click on "More Printers..." at the bottom of the dialogue box
4. Then in the uppermost pull-down menu, select "Canon IP (UFRII)"
5. Then enter the IP address: 155.198.150.214
6. Then you should be home and dry.
Personal tools
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T07:44:02.000Z
|
7xr2j3werworqqe7lpv5j5km5ruimxdw
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40866",
"uncompressed_offset": 542333272,
"url": "www.openwetware.org/wiki/BIO254:AP",
"warc_date": "2013-11-22T19:24:13.000Z",
"warc_filename": "<urn:uuid:57a60f5f-b60e-41e7-9169-fb441e04293b>",
"warc_url": "http://www.openwetware.org/wiki/BIO254:AP"
}
|
cccc_CC-MAIN-2013-20
|
BIO254:AP
From OpenWetWare
Jump to: navigation, search
WIKIPEDIA BIO154/254: Molecular and Cellular Neurobiology
[Course Home] Wiki Home People Materials Schedule Help
Contents
Introduction
An action potential is a wave of electrical activity carrying information within and between tissues. It is a brief, explosive change in membrane potential which goes from a negative to a positive potential. Action potentials are self-regenerating and occur spontaneously when the membrane is depolarized to a critical voltage called the threshold. Action potentials enable nerve cells to carry signals over long distances.
Action Potentials are Initiated by a Change in Membrane Potential
A neuron at rest maintains an electrical potential difference across its membrane. This difference arises from the separation of electric charges across the resistive membrane barrier. In the neuron, the major ions in play are potassium (K+) and sodium (Na+).
Membrane potential is determined by the equilibrium potential and relative permeabilities of the ions in the system. [K+] is higher inside the neuron while [Na+] is higher outside the neuron. This creates a driving force for K+ to go out of the cell and Na+ to come into the cell. At rest, the membrane is most permeable to K+; thus, the resting potential is closest to the equilibrium potential of K+ (~ -110mV). However, during an action potential, the permeability to Na+ is dramatically increased by the opening of Na+ channels. This depolarizes the membrane and brings the potential closer to the equilibrium potential of Na+ (~ +50mV).
An increase in ionic conductance in the membrane of the axon results in an increase in the action potential. The rising phase of the action potential is caused by an influx of Na+, while the falling phase of the action potential is caused by a later increase permeability to K+.
Resting Potential vs. Action Potential
The pattern or frequency of action potentials define a neuron's ability to transmit information throughout the nervous system. In contrast, when cells are at rest, or when there is a lack of electrical signaling, they maintain a resting membrane potential of approximately -60 to -70 mV. By convention, the potential outside the neuron is arbitrarily defined as zero, and the relative number of intracellular negative charges creates a potential difference across the plasma membrane; this is why resting potentials are expressed as negative values. The opening and closing of Na+ and K+ channels during an action potential make electrical signals an active process, yet membrane pumps and channels must also be active to maintain the resting membrane potential. To preserve the chemical and electrical gradients necessary for the initiation of an action potential, various membrane proteins must work to transport ions across the cell surface. The Na+/K+-ATPase enzyme is perhaps the most crucial membrane pump found in neurons; for each ATP molecule hydrolyzed, this enzyme extrudes three Na+ ions and intakes two K+ ions. Maintaining the membrane potential is energetically costly--up to 60% of a cell's energy or ATP supply may be used to bring the cell back to resting membrane potential following an action potential.
Differences between resting membrane and action potentials are apparent on the molecular level: while action potentials utilize voltage-gated ion channels, ATP-dependent pumps are used for resting membrane potentials. The two major ions that play a role in initiating and ending action potentials are Na+ and K+. However, Cl-, Ca++, Na+, and K+ may all help contribute to the resting membrane potential. While the membrane is at "rest," ionic species are not distributed evenly across the plasma membrane; Na+ and Cl- ions are more concentrated on the outside of the neuron while K+ and organic anions (proteins) are concentrated intracellularly. Action potentials disrupt this concentration gradient through sudden influx and efflux of Na+ and K+ respectively. Many neurodegenerative deseases such as epilepsy may stem from a neuronal inability to maintain the resting membrane potential, such that abnormal electrical signals fire spontaneously and irregularly. Hence, a better understanding of the mechanisms leading to action potentials as well as proper maintenance of resting potentials can provide insight into the causes of such disorders.
Characteristics of the Action Potential
1. Action potentials are triggered by depolarization. This is normally in the form of an external stimulus such as the stretching of a muscle or the firing of another neuron.
2. A threshold level of depolarization must be reached in order to trigger an action potential. This level is typically 10-20mV.
3. Action potentials are all-or-none events. Once an action potential is initiated, its amplitude is independent of the strength of the stimulus.
4. The amplitude and form of an action potential remain constant along the length of an axon. An action potential travels uniformly down the axon at a rate of ~ 10-100m/s. The speed depends upon the diameter and myelination of the axon.
5. At the peak of the action potential, the membrane potential reverses sign, becoming inside positive. The membrane potential transiently overshoots zero (called the overshoot). Also, during repolarizing, it becomes more negative than normal (called the undershoot).
6. After a neuron fires, there is an absolute refractory period during which it is impossible to trigger another action potential. This period is ~ 1ms. Thus the maximum firing rate of a neuron is ~ 1000 action potentials per second.
The following is a link that demonstrate all the above!
1. Named link:
[1]
Phases and Landmark Points of an Action Potential
1. Threshold. Before an action potential begins, the initial depolarization must reach a threshold of ~ 10-20mV above resting potential, when the inward Na+ current exceeds the outward K+ current. The net influx of positive charges depolarizes the membrane potential and leads to opening of more voltage-gated sodium channels. This positive feedback cycle continues depolarizing the membrane potential.
2. Rising Phase. Voltage-dependent sodium channels open, thus increasing Na+ permeability. There is a large driving force on Na+ which pushes Na+ into the neuron. The membrane depolarizes towards the equilibrium potential of Na+.
3. Overshoot. The period during which the membrane potential is above zero.
4. Peak. The highest level of depolarization reached before the falling phase.
5. Falling Phase. Repolarization of the membrane occurs when a second class of K+ channels opens, increasing the permeability of K+ to exit the cell. In addition, Na+ channels are time-dependent and inactivate, reducing the permeability of Na+. This reduces the inward current of Na+.
6. Undershoot. The period during which the membrane potential is below resting potential. The membrane is hyperpolarized.
7. Refractory period. Action potentials cannot be generated for ~ 1ms after an action potential is fired. This is a result of Na+ channel inactivation.
Propagation of Action Potential Along Myelinated Axons
In myelinated axons, the action potential appears to jump along the axon in a process known as saltatory conduction. The action potential jumps from one unmyelinated Node of Ranvier to the next, being regenerated only at these nodes. This increases the conduction velocity without the need for a dramatic increase in axon diameter. The myelin decreases membrane capacitance, reducing the extent to which ions of opposite charge interact with each other from across the cell membrane and thereby increasing the speed at which the ions are conducted. However, this prevents the regeneration of action potentials because of the lack of ion channels in these areas. The Nodes of Ranvier contain many voltage-gated sodium channels and are spaced along the axon to allow for the regeneration of the action potential. The internodal length is such that the optimal balance between high speed of action potential conduction and robustness of the signal is achieved.
Propagation of Action Potential Along Unmyelinated Axons
In unmyelinated axons, when voltage-gated Na+ channels are opened by depolarizing one patch of cell membrane, Na+ ions enter the cell. Postively-charged Na+ ions attract negative ions away from adjacent membrane. Thus, positive ions travel down the axon. When the adjacent patch of membrane is depolarized, the voltage-gated Na+ channels open, repeating the cycle. An action potential is generated at each segment of the membrane.
Voltage-Clamp Technique in Action Potentials
Diagram of arrangement for the voltage-clamp technique. The voltage-clamp operates by negative feedback mechanism. The membrane potential amplifier measures the potential at the intracellular electrode and an extracellular electrode. The output of the membrane potential amplifier and the command potential is connected to the inputs of the feedback amplifier. The feedback amplifier subtracts the difference between the two inputs and amplifies it. The output of the feedback amplifier is connected to a current electrode (also known as the axon). Source: Wikipedia
The voltage-clamp technique by Hodgkin and Huxley enables us to understand the ionic mechanisms in action potentials. From the voltage-clamp experiment, when there is a small depolarizing voltage, there is a brief outward capacitive current, a leakage current that persists for the period of the depolarization and then a brief inward capacitive current, before the ionic current returns to zero. When there is a larger depolarizing voltage, the initial brief outward capacitive current is larger in amplitude. This is followed by a brief inward leakage current and an outward leakage current that is maintained for the duration of the depolarization voltage. The inward Na+ channel and outward K+ channel is turned on sequentially by the depolarizing voltage and the two currents partially overlap in time. By using chemicals such as tetrodoxin to block Na+ channels and tetraethylammonium to block K+ channels, we can determine the currents belonging to Na+ and K+ channels. The voltage-clamp technique shows that Na+ channels turn on and off more quickly than K+ channels.
Voltage-Gated Sodium and Potassium Channels
Voltage-gated Na+ and K+ channels are sequentially opened. Na+ channels open and close rapidly, while K+ channels have a delayed opening but are open for a longer period. Action potentials are thus generated. Source: Kandel
Na+ and K+ open when the membrane is depolarized. However, after some time, Na+ channels begin to close, causing inward current to decrease (known as inactivation), while K+ channels remain open. Voltage-gated Na+ channels have 3 states - resting, activated and inactivated. In the resting state, the activated gated is closed and the inactivated gated is open. In the activated state, the activation gate opens and Na+ flows through the channel. In the inactivated state, the inactivation gates close. By repolarizing, Na+ channels return to the resting state. A small interval between two depolarizing pulses result in a small increase in the conductance of Na+. However, a longer interval between the two depolarizing pulses result in a larger conductance of Na+ because more Na+ channels will be in resting stage when the second depolarizing pulse arrives.
Depolarizing the membrane causes Na+ channels to open quickly and an inward Na+ current to flow. The inward current flow causes further depolarization and more Na+ channels to open. The positive feedback cycle drives the membrane potential to the peak of the action potential, attributing to the rising phase of the action potential. The voltage-gated K+ channels are delayed in opening and the depolarizing state of the action potential results in an inactivation of the Na+ channels causing the action potential duration to be brief. The decrease in inward Na+ current and an increase of outward K+ current repolarizes the membrane.
Electrical Equivalent Circuit to Calculate Membrane Conductances
Schematic circuit diagram of electrical equivalent circuit. The conductances of Na+ and K+ are represented by resistors and the potentials are represented by batteries.
From Ohm's law, the current through X+ voltage-gated channel, where X+ = Na+ or K+,
IX = gX(VmEX)
Rearranging, the conductance of X+,
Vm,EX and IX are determined from voltage-clamp data.
Genes of Potassium and Sodium Channels
The genes of K+ and Na+ families come from a common family. They share several important domains and are quite similar. In Na+ channel molecules, three subunits are isolated - one large glycoprotein α and two smaller polypeptides β1 and β2. The α subunit forms the aqueous pore of the channel, while the smaller subunits regulates the α subunit.
Schematic diagram of the sodium channel α and β subunits. Three subunits in Na+ channel are isolated - The α subunit genes has four repeats (domains I - IV). Each of the repeats has six membrane regions (S1-S6) and a seventh P region that connects the S5 and S6 segments. The S4 region is the voltage sensor. Source: Goldin
Schematic diagram of the Kv and KIr channel subtypes. The Kv channel α subunit genes has a single repeat, with six membrane regions (S1-S6) and a seventh P region that connects the S5 and S6 segments. The KIr channel has two membrane regions and a P region. Source: Miller
The charge in the S4 region influences the opening and closing of the voltage-gated Na+ channel. In the resting stage, the net negative charge inside the membrane attracts the positively charged S4 region inside the membrane. However, when the cell is depolarized, the change in electrical charge across the membrane drives the S4 region toward the extracellular face of the membrane, opening the activation gate. The K+ channel genes has one repeat in the α subunit. However, to form a K+ channel, four α subunits surround a central pore.
Major References and Recommended Reading
Bear, M.F., Connors, B.W., and Paradiso, M.A. Neuroscience: Exploring the Brain. (Lippincott Williams and Wilkins, Baltimore, Maryland, 2001).
Matthews, G.G. Cellular Physiology of Nerve and Muscle, Fourth Edition (Blackwell Science Ltd, United Kingdom, 2003).
Kandel, E.R, Schwartz, J.H, and Jessel, T.M. " Principles of Neural Science, Fourth Edition" (McGraw Hill, 2000)
Hodgkin, A.L., Huxley A. F., Katz B., "Measurement of Current-Voltage Relations in the Membrane of the Giant Axon of Loligo" (J. Physiol II6, 424-448, 1952)
Miller, C., " An Overview of the Potassium Channel Family" (Genome Biology, 2000)
Goldin, A.L., "Mechanisms of Sodium Channel Inactivation" (Elsevier, 2003)
Neher, E. "Ion Channels for Communication between and within cells" (Neuron 8, 605, 1992)
Hille, B. "Ionic Channels in Nerve Membranes", (Progress in Biophysics and Molecular Biology 21, 1-32, 1970)
Recent updates to the site:
Personal tools
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T08:51:07.000Z
|
6kedrtualozycqyarjdiusl7rln3347e
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40867",
"uncompressed_offset": 542345689,
"url": "www.openwetware.org/wiki/Haynes_Lab:Notebook/ASU_iGEM/2012/06/20",
"warc_date": "2013-11-22T19:24:13.000Z",
"warc_filename": "<urn:uuid:57a60f5f-b60e-41e7-9169-fb441e04293b>",
"warc_url": "http://www.openwetware.org/wiki/Haynes_Lab:Notebook/ASU_iGEM/2012/06/20"
}
|
cccc_CC-MAIN-2013-20
|
Haynes Lab:Notebook/ASU iGEM/2012/06/20
From OpenWetWare
Jump to: navigation, search
ASU iGEM 2012 Main project page
Previous entry Next entry
6-20-12
• Plated negative control on LB Amp plate
• Liquid cultures of T7 promoter and constitutive promoter
• Transformation (LSE)
• Transformed DNA:
• RBS (well 1:1H BBa_B0030)
• TetR GFP (well 2:8A Part:BBa_I13522)
Personal tools
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T08:50:54.000Z
|
wiprhwc5zcnghfl2zj3env6tceixsah5
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40869",
"uncompressed_offset": 552908533,
"url": "www.perseus.tufts.edu/hopper/text?doc=urn%3Acts%3AlatinLit%3Aphi0914.phi0019.perseus-lat1%3A16.6",
"warc_date": "2013-11-22T19:24:13.000Z",
"warc_filename": "<urn:uuid:57a60f5f-b60e-41e7-9169-fb441e04293b>",
"warc_url": "http://www.perseus.tufts.edu/hopper/text?doc=urn:cts:latinLit:phi0914.phi0019.perseus-lat1:16.6"
}
|
cccc_CC-MAIN-2013-20
|
Click on a word to bring up parses, dictionary entries, and frequency statistics
This work is licensed under a Creative Commons Attribution-ShareAlike 3.0 United States License.
An XML version of this text is available for download, with the additional restriction that you offer Perseus any modifications you make. Perseus provides credit for all accepted changes, storing new additions in a versioning system.
load focus Summary (Latin, Benjamin Oliver Foster, Ph.D., 1926)
load focus Summary (Latin, W. Weissenborn, H. J. Müller, 1898)
load focus Summary (English, Benjamin Oliver Foster, Ph.D., 1926)
load focus Latin (Charles Flamstead Walters, Robert Seymour Conway, 1919)
load Vocabulary Tool
hideData/Identifiers
Citation URN: urn:cts:latinLit:phi0914.phi0019.perseus-lat1:16.6
Document URN: urn:cts:latinLit:phi0914.phi0019.perseus-lat1
hide Display Preferences
Greek Display:
Arabic Display:
View by Default:
Browse Bar:
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T07:39:27.000Z
|
rpamrwilvcbfij25iimhfrp5ue42zejg
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40882",
"uncompressed_offset": 687652943,
"url": "www.wikidoc.org/index.php/Occupational_Safety_and_Health_Administration",
"warc_date": "2013-11-22T19:24:13.000Z",
"warc_filename": "<urn:uuid:57a60f5f-b60e-41e7-9169-fb441e04293b>",
"warc_url": "http://www.wikidoc.org/index.php/Occupational_Safety_and_Health_Administration"
}
|
cccc_CC-MAIN-2013-20
|
Occupational Safety and Health Administration
Jump to: navigation, search
The United States Occupational Safety and Health Administration (OSHA) is an agency of the United States Department of Labor. It was created by Congress under the Occupational Safety and Health Act, signed by President Richard M. Nixon, on December 29, 1970. Its mission is to prevent work-related injuries, illnesses, and deaths by issuing and enforcing rules (called standards) for workplace safety and health. As of March 2006, the agency is headed by Assistant Secretary of Labor Edwin Foulke.
OSHA authority
OSHA's statutory authority extends to most nongovernmental workplaces where there are employees. State and local government workers are excluded from Federal coverage, however, states operating their own workplace safety and health programs under plans approved by the U.S. Department of Labor are required to extend their coverage to public sector (state and local government) employees. Section 2 (11) of the OSH Act encourages states to do this.
The Williams-Steiger Occupational Safety and Health Act, which created OSHA also created the National Institute for Occupational Safety and Health (NIOSH) as a research agency focusing on occupational health and safety.
OSHA regulations [29 CFR Part 1956] also permit states to develop approved plans that cover only public sector workers. In these states, private sector employment remains under Federal OSHA jurisdiction. Twenty-two states and territories operate plans covering both the public and private sectors and four "states" — Connecticut, New Jersey, New York and the US Virgin Islands — operate public employee only plans.
In 2000 the United States Postal Act made the U.S. Post Service the only quasi-governmental entity within OSHA's jurisdiction. This change permits OSHA to fine the US Postal Service as if it was a regular non-governmental organization.
History
OSHA was widely criticized in its early years for confusing, burdensome regulations. A good deal of the early conflict came about because of arbitrary and inconsistent enforcement during OSHA's early years. In addition, businesses were expected to retrofit guards and other safety devices on existing equipment and to implement other hazard controls, often at considerable expense, to bring them in line with then-current best safety practices. Other requirements, such as mandated training, communication, and extensive documentation were seen as even more difficult and expensive.
With time, manufacturers of industrial equipment have included OSHA-compliant safety features on new machinery. Enforcement has become more consistent across jurisdictions, and some of the more outdated or irrelevant rules have been repealed or are not enforced.
During the Jimmy Carter administration, under the leadership of University of Cincinnati toxicologist Eula Bingham, OSHA began to concentrate more on health hazards, such as toxic chemicals. Bingham also launched the "New Directions" program, OSHA's first worker training grant program.
With the Ronald Reagan and George H.W. Bush administrations came efforts to weaken OSHA enforcement and rulemaking, although several important rules were issued including hazard communication (right to know about chemical exposures) and blood-borne pathogens (to protect workers against illnesses such as hepatitis and AIDS). The Reagan administration also launched OSHA's Voluntary Protection Program (VPP), OSHA's first foray into voluntary programs and partnerships with industry. In the VPP, management, labor, and OSHA establish cooperative relationships at workplaces that have implemented a comprehensive safety and health management system. Approval into VPP is OSHA’s official recognition of the outstanding efforts of employers and employees who have achieved exemplary occupational safety and health.
The Bill Clinton administration began a reorganization of OSHA's approach, focusing more on "stakeholder" satisfaction through compliance assistance. When the Republicans took over Congress in 1994, one of their goals was reducing some of the agency's ability to issue standards. Some Republican sponsored bills were stopped by the Democratic minority and moderate Republicans, but other legislation passed, such as the Small Business Regulatory Enforcement Fairness Act of 1996 and the Congressional Review Act.
In 2000, OSHA issued the ergonomics standard after ten years of study and struggles with a Republican-controlled Congress and business associations such as the Chamber of Commerce and National Association of Manufacturers that were unconvinced that additional government regulation was the right way to address the issue of ergonomic injuries to American workers. Ergonomic injuries (also known as musculoskeletal injuries) such as back injuries and carpal tunnel syndrome, account for 1/3 of all serious injuries suffered by American workers.Template:Facts In March 2001, the Republican controlled Congress voted to repeal the standard and the repeal was one of the first major pieces of legislation signed by President George W. Bush. Since the repeal of the ergonomics standard, OSHA has issued three ergonomics guidelines, and only a small handful of ergonomic citations under the Act's "general duty" clause.[citation needed]
The Bush administration has largely replaced the process of issuing mandatory regulations with voluntary guidelines and put additional resources into other, previously existing voluntary programs, as well as new "Alliance" program. In 2004, the General Accounting Office issued a report report recommending that the Agency collect more data from participants in order to better ascertain the benefits of the program. A GAO report released in 1992 concluded that employers participating in the program benefited from significant cost reductions in workers' compensation premiums while improving labor productivity.
It is a some times held misconception that the Agency promotes "voluntary compliance" when, in fact, all employers are required by law to comply with all final published rules promulgated under the Occupational Safety and Health Act of 1970.
Controversy
Much of the debate about OSHA regulations and enforcement policies revolves around the cost of regulations and enforcement, versus the actual benefit in reduced worker injury, illness and death. A 1995 study of several OSHA standards by the Office of Technology Assessment (OTA)[1] found that regulated industries as well as OSHA typically overestimate the expected cost of proposed OSHA standards.
OSHA has come under considerable criticism for the ineffectiveness of its penalties, particularly criminal penalties. OSHA is only able to pursue a criminal penalty when a willful violation of an OSHA standard results in the death of a worker[citation needed]. The maximum penalty is a misdemeanor with a maximum of 6-months in jail[citation needed]. In response to the criticism, OSHA, in conjunction with the Department of Justice, has pursued several high-profile criminal prosecutions for violations under the Act, and has announced a joint enforcement initiative between OSHA and the United States Environmental Protection Agency (EPA) which has the ability to issue much higher fines than OSHA. Meanwhile, Congressional Democrats, labor unions and community safety and health advocates are attempting to revise the OSH Act to make it a felony with much higher penalties to commit a willful violation that results in the death of a worker. Some local prosecutors are charging company executives with manslaughter and other felonies when criminal negligence leads to the death of a worker[citation needed].
In its 30 plus years of existence OSHA has been able to secure only 12 criminal convictions[citation needed]. This has been attributed to lack of resources[citation needed]. OSHA has been accused of being more devoted to the numbers of inspections than to actual safety. OSHA has also been criticized for taking decades to develop new regulations[citation needed]. Industry associations and unions have resorted to court action to force OSHA to promulgate new standards such as the Hexelvalant Chromium standard.
Regulatory impact
Here are some of the changes in industrial safety regulation brought about by OSHA:
1. Guards on all moving parts - By 1970, there were guards to prevent inadvertent contact with most moving parts that were accessible in the normal course of operation. With OSHA, use of guards was expanded to cover essentially all parts where contact is possible.
2. Permissible exposure limits (PEL) - Maximum concentrations of chemicals stipulated by law for chemicals and dusts. They cover only around 600 chemicals and most are based on research from the 1950's and 1960's
3. Personal protective equipment (PPE) - broader use of respirators, gloves, coveralls, and other protective equipment when handling hazardous chemicals; goggles, face shields, ear protection in typical industrial environments
4. Lockout/tagout - In the 1980s, requirements for locking out energy sources in an "off" condition when performing repairs or maintenance
5. Confined space - In the 1990s, specific requirements for air sampling and use of a "buddy system" when working inside tanks, manholes, pits, bins, and similar enclosed areas
6. Hazard Communication (HazCom) - Also known as the "Right to Know" standard, it was issued as 29CFR1910.1200 on November 25, 1983 (48 FR 53280, requires developing and communicating information on the hazards of chemical products used in the workplace.
7. Process Safety Management (PSM) - Issued in 1992 as 29CFR1910.119 in an attempt to reduce large scale industrial accidents. Although enforcement of the standard has been spotty, its principles have long been widely accepted by the petrochemical industry.
8. Bloodborne Pathogens (BBD)- In 1990, OSHA issued a standard designed to prevent health care (and other) workers from being exposed to bloodborne pathogens such as hepatitis B and HIV.
9. Trenching and shoring - OSHA rules specify that trenches and excavations where workers are working must be provided with safeguards against slumps and caveins.
See also
External links
Template:DOL agenciesde:Occupational Safety and Health Administrationsimple:Occupational Safety and Health Administration
Navigation WikiDoc | WikiPatient | Popular pages | Recently Edited Pages | Recently Added Pictures
Table of Contents In Alphabetical Order | By Individual Diseases | Signs and Symptoms | Physical Examination | Lab Tests | Drugs
Editor Tools Become an Editor | Editors Help Menu | Create a Page | Edit a Page | Upload a Picture or File | Printable version | Permanent link | Maintain Pages | What Pages Link Here
There is no pharmaceutical or device industry support for this site and we need your viewer supported Donations | Editorial Board | Governance | Licensing | Disclaimers | Avoid Plagiarism | Policies
Personal tools
Namespaces
Variants
Actions
Navigation
Toolbox
In other languages
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T08:49:13.000Z
|
nhonokmcu2enwzr2idhg6mtivwjmp4qs
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40883",
"uncompressed_offset": 687667181,
"url": "www.wikidoc.org/index.php/Transition_metal",
"warc_date": "2013-11-22T19:24:13.000Z",
"warc_filename": "<urn:uuid:57a60f5f-b60e-41e7-9169-fb441e04293b>",
"warc_url": "http://www.wikidoc.org/index.php/Transition_metal"
}
|
cccc_CC-MAIN-2013-20
|
Transition metal
Jump to: navigation, search
In chemistry, the term transition metal (sometimes also called a transition element) has two possible meanings:
• More strictly, IUPAC defines a transition metal as "an element whose atom has an incomplete d sub-shell, or which can give rise to cations with an incomplete d sub-shell." By this definition, zinc, cadmium, and mercury are excluded from the transition metals, as they have a d10 configuration. Only a few transient species of these elements that leave ions with a partly filled d subshell have been formed, and mercury(I) only occurs as Hg22+, which does not strictly form a lone ion with a partly filled subshell, and hence these three elements are inconsistent with the latter definition.[1] They do form ions with a 2+ oxidation state, but these retain the 4d10 configuration. Element 112 may also be excluded although its oxidation properties are unlikely to be observed due to its radioactive nature. This definition corresponds to groups 3 to 11 on the periodic table.
The first definition is simple and has traditionally been used. However, many interesting properties of the transition elements as a group are the result of their partly filled d subshells. Periodic trends in the d block (transition metals) are less prevailing than in the rest of the periodic table. Going across a period, the valence doesn't change, so the electron being added to an atom goes to the inner shell, not outer shell, strengthening the shield. [2]
The (loosely defined) transition metals are the 40 chemical elements 21 to 30, 39 to 48, 71 to 80, and 103 to 112. The name transition comes from their position in the periodic table of elements. In each of the four periods in which they occur, these elements represent the successive addition of electrons to the d atomic orbitals of the atoms. In this way, the transition metals represent the transition between group 2 elements and group 13 elements.
Group 3 (III B) 4 (IV B) 5 (V B) 6 (VI B) 7 (VII B) 8 (VIII B) 9 (VIII B) 10 (VIII B) 11 (I B) 12 (II B)
Period 4 Sc 21 Ti 22 V 23 Cr 24 Mn 25 Fe 26 Co 27 Ni 28 Cu 29 Zn 30
Period 5 Y 39 Zr 40 Nb 41 Mo 42 Tc 43 Ru 44 Rh 45 Pd 46 Ag 47 Cd 48
Period 6 Lu 71 Hf 72 Ta 73 W 74 Re 75 Os 76 Ir 77 Pt 78 Au 79 Hg 80
Period 7 Lr 103 Rf 104 Db 105 Sg 106 Bh 107 Hs 108 Mt 109 Ds 110 Rg 111 Uub 112
Properties
Transition elements tend to have high tensile strength, density and melting and boiling points. As with many properties of transition metals, this is due to d orbital electrons' ability to delocalise within the metal lattice. In metallic substances, the more electrons shared between nuclei, the stronger the metal.
There are several common characteristic properties of transition elements:
• They often form colored compounds.
• They can have a variety of different oxidation states.
• At least one of their compounds has an incomplete d-electron subshell.
• They are often good catalysts.
• They are silvery-blue at room temperature (except copper and gold).
• They are solids at room temperature (except mercury).
• They form complex ions (aqua ions included).
• They are often paramagnetic.
Variable oxidation states
As opposed to group 1 and group 2 metals, ions of the transition elements may have multiple stable oxidation states, since they can lose d electrons without a high energetic penalty. Manganese, for example has two 4s electrons and five 3d electrons, which can be removed. Loss of all of these electrons leads to a +7 oxidation state. Osmium and ruthenium compounds are commonly found alone in stable +8 oxidation states, which is among the highest for isolatable compounds.
File:Transition metal oxidation states 2.png
This table shows some of the oxidation states found in compounds of the transition-metal elements.
A solid circle represents a common oxidation state, and a ring represents a less common (less energetically favourable) oxidation state.
Certain patterns in oxidation state emerge across the period of transition elements:
• The number of oxidation states of each ion increases up to Mn, after which they decrease. Later transition metals have a stronger attraction between protons and electrons (since there are more of each present), which then would require more energy to remove the electrons.
• When the elements are in lower oxidation states, they can be found as simple ions. However, transition metals in higher oxidation states are usually bonded covalently to electronegative elements like oxygen or fluorine, forming polyatomic ions such as chromate, vanadate, or permanganate.
Other properties with respect to the stability of oxidation states:
• Ions in higher oxidation states tend to make good oxidizing agents, whereas elements in low oxidation states become reducing agents.
• The 2+ ions across the period start as strong reducing agents and become more stable.
• The 3+ ions start stable and become more oxidizing across the period.
Catalytic activity
Transition metals form good homogeneous or heterogeneous catalysts, for example iron is the catalyst for the Haber process. Vanadium(V) oxide is used for the contact process, nickel is used to make margarine and platinum is used to speed up the manufacture of nitric acid. This is because they are able to form numerous oxidation states, and as such, are able to form new compounds during a reaction providing an alternative route with a lower overall activation energy.
Colored compounds
File:Coloured-transition-metal-solutions.jpg
From left to right, aqueous solutions of: Co(NO3)2 (red); K2Cr2O7 (orange); K2CrO4 (yellow); NiCl2 (green); CuSO4 (blue); KMnO4 (purple).
We observe color as varying frequencies of electromagnetic radiation in the visible region of the electromagnetic spectrum. Different colors result from the changed composition of light after it has been reflected, transmitted or absorbed after hitting a substance. Because of their structure, transition metals form many different colored ions and complexes. Color even varies between the different ions of a single element - MnO4 (Mn in oxidation state 7+) is a purple compound, whereas Mn2+ is pale-pink.
Coordination by ligands can play a part in determining color in a transition compound, due to changes in energy of the d orbitals. Ligands remove degeneracy of the orbitals and split them in to higher and lower energy groups. The energy gap between the lower and higher energy orbitals will determine the color of light that is absorbed, as electromagnetic radiation is only absorbed if it has energy corresponding to that gap. When a ligated ion absorbs light, some of the electrons are promoted to a higher energy orbital. Since different frequency light is absorbed, different colors are observed.
The color of a complex depends on:
• the nature of the metal ion, specifically the number of electrons in the d orbitals
• the arrangement of the ligands around the metal ion (for example geometric isomers can display different colors)
• the nature of the ligands surrounding the metal ion. The stronger the ligands then the greater the energy difference between the split high and low 3d groups.
The complex ion formed by the d block element zinc (though not strictly a transition element) is colorless, because the 3d orbitals are full - no electrons are able to move up to the higher group.
See also
References
1. Cotton, F. Albert; Wilkinson, G.; Murillo, C. A. (1999). Advanced Inorganic Chemistry (6th ed.). New York: Wiley.
2. http://www.jce.divched.org/Journal/Issues/2005/Nov/abs1660.html
af:Oorgangsmetale
ar:فلز انتقالي ast:Metal de transición bn:অবস্থান্তর ধাতু ca:Metall de transició cs:Přechodný kov de:Übergangsmetalle el:Στοιχεία μετάπτωσηςeo:Transirmetalogl:Metal de transición ko:전이 금속 hr:Prijelazni metali id:Logam transisi is:Hliðarmálmur it:Metalli del blocco d he:מתכות מעבר sw:Metali ya mpito jbo:binjimkle lmo:Metàj de transizziun ms:Logam peralihan nl:Overgangsmetaalnn:Transisjonsmetall nds:Övergangselementsimple:Transition metal sk:Prechodný prvok sl:Prehodni element sr:Прелазни метали sh:Prelazni metali fi:Siirtymämetalli sv:Övergångsmetall th:โลหะทรานซิชันuk:Перехідні метали
Navigation WikiDoc | WikiPatient | Popular pages | Recently Edited Pages | Recently Added Pictures
Table of Contents In Alphabetical Order | By Individual Diseases | Signs and Symptoms | Physical Examination | Lab Tests | Drugs
Editor Tools Become an Editor | Editors Help Menu | Create a Page | Edit a Page | Upload a Picture or File | Printable version | Permanent link | Maintain Pages | What Pages Link Here
There is no pharmaceutical or device industry support for this site and we need your viewer supported Donations | Editorial Board | Governance | Licensing | Disclaimers | Avoid Plagiarism | Policies
Personal tools
Namespaces
Variants
Actions
Navigation
Toolbox
In other languages
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T08:32:36.000Z
|
xngoyeg5q4dep4tpuirtyhwnzxfpvokt
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40900",
"uncompressed_offset": 34435348,
"url": "buffalo.nas-central.org/w/index.php?oldid=16402&title=Talk%3ATerastation_Harddisk_Layout_%28PPC%29",
"warc_date": "2013-11-22T19:24:31.000Z",
"warc_filename": "<urn:uuid:9a9b47e6-b499-43ac-9a3b-592f7d5fecab>",
"warc_url": "http://buffalo.nas-central.org/w/index.php?title=Talk:Terastation_Harddisk_Layout_(PPC)&oldid=16402"
}
|
cccc_CC-MAIN-2013-20
|
Talk:Terastation Harddisk Layout (PPC)
From NAS-Central Buffalo - The Linkstation Wiki
Revision as of 20:04, 15 November 2007 by Mindbender (Talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search
What happens if you add a larger hard drive to the RAID5?
What happens if you add a larger hard drive to the RAID? For example, if one of my drives dies on my 1.0TB model and I replace it with a 400gb instead of a 250gb drive? Has anyone tried this??
Nothing. If you are using bigger drives than installed the RAID will only use that amount of space which correspond with the original size of the partition on the old drive. The RAID is not able to scale its capacitiy. The GROW option of mdadm is not supported on the TeraStation. Cheers, Joerg
Personal tools
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T08:50:56.000Z
|
5247xagg56exjf5zaa57gorzf7jmpp5u
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40904",
"uncompressed_offset": 39332639,
"url": "ccsenet.org/journal/index.php/ass/article/view/10233",
"warc_date": "2013-11-22T19:24:31.000Z",
"warc_filename": "<urn:uuid:9a9b47e6-b499-43ac-9a3b-592f7d5fecab>",
"warc_url": "http://ccsenet.org/journal/index.php/ass/article/view/10233"
}
|
cccc_CC-MAIN-2013-20
|
Theoretical Framework of Fair Distribution of Affordable Housing in China
Tao Zhang, Ahmad Hariza B Hashim
Abstract
Urbanization and industrialization in China result in dramatic growth of population in urban areas. The housing price rises so high that low-income people living in urban cannot afford to buy their own houses. In order to alleviate their housing plight, affordable housing has been built in mainland China. However, unfair distribution of affordable housing failed to accomplish the goal of this program. The paper firstly introduces the current situation and problem of affordable housing distribution. It then discusses the rationale of Theory of Justice from John Rawl, and puts forward a systematic legal framework, which consists of affordable housing legislation, enforcement, judiciary and sanction, to safeguard the justice of affordable housing distribution.
Full Text: PDF
This work is licensed under a Creative Commons Attribution 3.0 License.
Asian Social Science ISSN 1911-2017 (Print) ISSN 1911-2025 (Online)
Copyright © Canadian Center of Science and Education
To make sure that you can receive messages from us, please add the 'ccsenet.org' domain to your e-mail 'safe list'. If you do not receive e-mail in your 'inbox', check your 'bulk mail' or 'junk mail' folders.
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T07:47:20.000Z
|
bisxphocach2bndkx2p3mfg25x4p3e2b
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40905",
"uncompressed_offset": 39337793,
"url": "ccsenet.org/journal/index.php/cis/article/view/17734/0",
"warc_date": "2013-11-22T19:24:31.000Z",
"warc_filename": "<urn:uuid:9a9b47e6-b499-43ac-9a3b-592f7d5fecab>",
"warc_url": "http://ccsenet.org/journal/index.php/cis/article/view/17734/0"
}
|
cccc_CC-MAIN-2013-20
|
Simulation and Visualization of Chaotic Systems
Athanasios I. Margaris
Abstract
The objective of this paper is to present a suite of applications that allow the simulation and study of chaotic systems, as well as the estimation of the most important properties associated with them. These applications implement fundamental algorithms from the field of chaotic system dynamics, such as the reconstruction of the system trajectory in the appropriate embedding space, and the estimation of the Lyapunov exponents and the fractal dimension. Furthermore, they provide additional features such as the study of bifurcation diagrams and the detection of chaotic regions in the parameter space. The current version of the applications has been developed in the programming framework of Visual C++ 6.0 and they can be used under the operating system of Microsoft Windows.
Full Text: PDF DOI: 10.5539/cis.v5n4p25
This work is licensed under a Creative Commons Attribution 3.0 License.
Computer and Information Science ISSN 1913-8989 (Print) ISSN 1913-8997 (Online)
Copyright © Canadian Center of Science and Education
To make sure that you can receive messages from us, please add the 'ccsenet.org' domain to your e-mail 'safe list'. If you do not receive e-mail in your 'inbox', check your 'bulk mail' or 'junk mail' folders.
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T08:50:33.000Z
|
3uoenbj524ipp76aexnvq2dnvxgiva2t
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40906",
"uncompressed_offset": 39343263,
"url": "ccsenet.org/journal/index.php/ies/article/view/6162",
"warc_date": "2013-11-22T19:24:31.000Z",
"warc_filename": "<urn:uuid:9a9b47e6-b499-43ac-9a3b-592f7d5fecab>",
"warc_url": "http://ccsenet.org/journal/index.php/ies/article/view/6162"
}
|
cccc_CC-MAIN-2013-20
|
The Emerging Roles of Coaches in the Malaysian Dual Training System
Nor Hazana Abdullah
Abstract
This paper discusses the new task of industry personnel as coaches in the National Dual Training System (NDTS), a newly introduced training initiative for producing k-workers in Malaysia. The decision to introduce this initiative was made by the Malaysian Cabinet on the 19th May 2004 with the hope that it will resolve the issue of skilled workers being produced, but not meeting the needs of the industry. The initiative began in 2005 for four skill sets, i.e., manufacturing tools (tool and dies), automatic control process, automotive mechanics and plant operations. Its implementation involves two parties: training providers and industries, where about 70% to 80% of training at the industries, with the remaining 20% to 30% at the training institutes. After completion of the four semesters program, apprentices are awarded the NDTS k-Worker Certificate. Since the industry personnel plays a greater role than before through the newly introduced system, the understanding of new tasks of industry personnel as coaches to the apprentices is explored. The analysis of literature shows that different levels of personnel, i.e., executive, supervisory and senior technician require different skill sets in carrying out the coaching tasks. Based on this requirement, therefore, the potential enhancement programs required to equip these personnel with necessary skills can be developed.
Full Text: PDF
This work is licensed under a Creative Commons Attribution 3.0 License.
International Education Studies ISSN 1913-9020 (Print), ISSN 1913-9039 (Online)
Copyright © Canadian Center of Science and Education
To make sure that you can receive messages from us, please add the 'ccsenet.org' domain to your e-mail 'safe list'. If you do not receive e-mail in your 'inbox', check your 'bulk mail' or 'junk mail' folders.
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T07:39:25.000Z
|
hzoyu2lfjclyfeohsapc3dijtou5sft7
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40924",
"uncompressed_offset": 57917002,
"url": "dendroica.blogspot.com/2005/08/piping-plover-news-finally-we-get-to.html",
"warc_date": "2013-11-22T19:24:31.000Z",
"warc_filename": "<urn:uuid:9a9b47e6-b499-43ac-9a3b-592f7d5fecab>",
"warc_url": "http://dendroica.blogspot.com/2005/08/piping-plover-news-finally-we-get-to.html"
}
|
cccc_CC-MAIN-2013-20
|
Monday, August 22, 2005
Piping Plover News
Finally we get to have some good news about the endangered piping plover. The Great Lakes region appears to be seeing an increase in the population of piping plovers despite continued development. As on the east coast, plover nesting has become a cause for controversy between wildlife officials who want to protect the nests and would-be beachgoers. At one site in Ontario, the conflict centers on a former bombing range where piping plovers have begun to nest; in addition to the plovers, there may be unexploded ordnance on the beaches. Closer to Washington, the piping plovers at Cape Henlopen in Delaware managed to fledge twelve chicks despite continual interruptions, including plane crashes and the filming of surfing scenes for a movie (this one?).
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T08:39:12.000Z
|
t7z7eykmwlrjfu35cur4gw3qwlcj2od6
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40930",
"uncompressed_offset": 70995591,
"url": "dungeons.wikia.com/wiki/SRD:Maximize_Spell?diff=prev&oldid=15269",
"warc_date": "2013-11-22T19:24:31.000Z",
"warc_filename": "<urn:uuid:9a9b47e6-b499-43ac-9a3b-592f7d5fecab>",
"warc_url": "http://dungeons.wikia.com/wiki/SRD:Maximize_Spell?diff=prev&oldid=15269"
}
|
cccc_CC-MAIN-2013-20
|
Wikia
Changes: SRD:Maximize Spell
Edit
Back to page
(Changes references from (Endhaven) to (Endhaven Supplmenet))
m (1 revision: SRD Import)
Latest revision as of 22:32, August 11, 2009
This material is published under the OGL
Maximize Spell [Metamagic]Edit
BenefitEdit
All variable, numeric effects of a spell modified by this feat are maximized. Saving throws and opposed rolls are not affected, nor are spells without random variables. A maximized spell uses up a spell slot three levels higher than the spell’s actual level.
An empowered, maximized spell gains the separate benefits of each feat: the maximum result plus one-half the normally rolled result.
Back to Main PageSystem Reference DocumentFeats
Around Wikia's network
Random Wiki
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T07:50:36.000Z
|
yqpzwfkokpma3bi2fy3gpnkm3m6y2khm
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40941",
"uncompressed_offset": 78622072,
"url": "eunis.eea.europa.eu/habitats/2443/habitats",
"warc_date": "2013-11-22T19:24:31.000Z",
"warc_filename": "<urn:uuid:9a9b47e6-b499-43ac-9a3b-592f7d5fecab>",
"warc_url": "http://eunis.eea.europa.eu/habitats/2443/habitats"
}
|
cccc_CC-MAIN-2013-20
|
Skip to content. Skip to navigation
Sign up now!
Get notifications on new reports and products. Currently we have 32837 subscribers. Frequency: 3-4 emails / month.
Follow us
Twitter
Facebook
YouTube channel
RSS Feeds
Notifications archive
Write to us
For the public:
For media and journalists:
Enquiry web form
Contact EEA staff
Contact the web team
Call us
Reception:
Phone:
(+45) 33 36 71 00
Fax: (+45) 33 36 71 99
EEA
Lime-rich oligotrophic vegetation of spring brooks
Document Actions
Habitat type syntaxa
Name Relation Source (abbreviated) Author References
Ranunculion fluitantis n/a European Vegetation Survey 2000 Neuhäusl Rodwell, J.S., Schamineé, J.H.J., Mucina, L., Pignatti, S., Dring, J. & Moss, D.
EUNIS
General information
User operations
European Environment Agency, Kongens Nytorv 6, DK - 1050 Copenhagen K, Denmark - Phone: +45 3336 7100
The European Environment Agency (EEA) is an agency of the European Union.
Comments to EEA Web Team.
Code and API for developers, Legal notice, Disclaimer, Privacy policy
This site conforms to the following standards:
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T08:32:28.000Z
|
7lxbosy2glosjehpwjfncbqvgsifyow2
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40943",
"uncompressed_offset": 84231010,
"url": "figshare.com/articles/Diagnosing_Lassa_Virus_Infection_by_Tracking_the_Antiviral_Response/97280",
"warc_date": "2013-11-22T19:24:31.000Z",
"warc_filename": "<urn:uuid:9a9b47e6-b499-43ac-9a3b-592f7d5fecab>",
"warc_url": "http://figshare.com/articles/Diagnosing_Lassa_Virus_Infection_by_Tracking_the_Antiviral_Response/97280"
}
|
cccc_CC-MAIN-2013-20
|
Diagnosing Lassa Virus Infection by Tracking the Antiviral Response
Share this:
Cite this:
Diagnosing Lassa Virus Infection by Tracking the Antiviral Response. Ignacio Sanchez Caballero, Judy Y Yen, Gracia Bonilla. figshare.
http://dx.doi.org/10.6084/m9.figshare.97280
Retrieved 08:32, May 18, 2013 (GMT)
Description
Hemorrhagic fever viruses can only be diagnosed by conventional methods when the infection has spread to the blood the patient (viremia, around 8 days after infection). We set out to determine if the transcriptional dynamics of the circulating immune cells (PBMCs) in non-human primates infected with the Lassa virus could be used as an ealier indicator of infection. We identified a strong signal of infection that appear almost 5 days earlier (3dpi) than the one detected by conventional methods.
Comments (0)
You must be logged in to post comments.
378
views
2
shares
Published on 09 Nov 2012 - 13:16 (GMT)
Filesize is 1.86 MB
Categories
Authors
Tags
Export
Cite "Filename"
Place your mouse over the citation text to select it
Claim article
You claim request was sent. I will be handled in the next 24 hours.
Close window
Feedback
We appreciate all your comments, questions, suggestions or gratitude.
Login
The username or password entered are wrong.
Reset password
Your password will be sent to your registered e-mail address.
Create account
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T08:18:21.000Z
|
6mtorpagzqjdwmqa52bpubo4igkzwhid
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40958",
"uncompressed_offset": 117230547,
"url": "ipkitten.blogspot.com/2009/02/april-fees-foolery-from-epo.html",
"warc_date": "2013-11-22T19:24:31.000Z",
"warc_filename": "<urn:uuid:9a9b47e6-b499-43ac-9a3b-592f7d5fecab>",
"warc_url": "http://ipkitten.blogspot.com/2009/02/april-fees-foolery-from-epo.html"
}
|
cccc_CC-MAIN-2013-20
|
For the half-year to 30 June 2013, the IPKat's regular team is supplemented by contributions from guest bloggers Stefano Barazza, Matthias Lamping and Jeff John Roberts.
Two of our regular Kats are currently on blogging sabbaticals. They are Birgit Clark and Catherine Lee.
Friday, 13 February 2009
April fees foolery from the EPO
The IPKat has just been reminded by patent attorney Donald McNab about a previous post from November 2008, which some readers may have forgotten about. Back then, the IPKat pointed out a decision by the Administrative Council (CA/D 4/08), which introduced a few esoteric changes to the EPC Rules, including a change to the way the EPO takes its fees for applications in the way of page charges. The EPO have recently issued a slightly more helpful notice outlining what the changes, due to come into force on 1 April 2009, actually mean in practice.
(right: the IPKat's French cousin gets confused about 1 April)
As from 1 April, all applications filed at the EPO (including requests for PCT applications to enter the European regional phase) will be subject to further massively increased claims fees and to page charges that were previously payable only on approving the text of an application for grant. Fortunately the page charge of 12 Euros per page over 35 has not been increased (as the IPKat incorrectly predicted), though this probably has more to do with the general freeze on fee increases at the EPO due to the current economic climate than with any lack of desire to go for a hike. Also, the massive claims fees of 500 Euros per claim only apply for the 51st and subsequent claims, so are unlikely to affect too many applicants. For those applications where it does matter, there are some obvious and fairly easy tricks to avoid payment, which all patent attorneys should by now be aware of.
As the notice makes clear, if the new excess claims fees and page charges are to be avoided, all the legal requirements to make a valid European application have to be completed before 1 April, including paying all fees due and, where necessary, making an explicit request for a PCT application to enter the European phase early. Just to make it a bit more interesting, the current system of paying up to seven designation fees is being scrapped as from 1 April, in favour of a single designation fee of 500 Euros for all applications. Fortunately, the new single fee is less than seven times the old fee. The IPKat suspects that the EPO will be having to make quite a few refunds over the next few months as a result.
This all appears to the IPKat like the EPO is playing the game so that very few patent attorneys will be wanting to try to get applications in under the wire to save on a few fees for their client, as the added hassle is probably not going to be worth it. Perhaps some lessons have been learned from the claims fee fiasco last year. Who knows, the EPO may actually get some more money as a result this time.
Subscribe to the IPKat's posts by email here
Just pop your email address into the box and click 'Subscribe':
|
v0
|
2024-06-03T21:29:49.458Z
|
2013-05-18T09:00:58.000Z
|
agsllap7ao3krzyph4tv44ucpdge46z2
|
{
"content_type": "text/html",
"provenance": "cccc-CC-MAIN-2013-20-0000.json.gz:40959",
"uncompressed_offset": 118679017,
"url": "issuepedia.org/Euphemisms",
"warc_date": "2013-11-22T19:24:31.000Z",
"warc_filename": "<urn:uuid:9a9b47e6-b499-43ac-9a3b-592f7d5fecab>",
"warc_url": "http://issuepedia.org/Euphemisms"
}
|
cccc_CC-MAIN-2013-20
|
Euphemisms
From Issuepedia
Jump to: navigation, search
Contents
[edit] Overview
This page is a collection of euphemisms, in case it turns out to be useful. Perhaps interesting discussions will ensue.
[edit] Related Pages
[edit] The List, by term
• cognitively challenged: stupid
• faith-based (Bush Jr. administration): requiring no rational justification; current policy
• politically correct (mostly a liberal/academic usage, now somewhat out of favor and used largely in jest): in line with our favored ideology
• politically incorrect (same usage as "politically correct"): racist, sexist, or discriminatory against any favored minority
• reality-based (Bush Jr. administration): not in line with our current policy
• truth enhancement: lying
[edit] The List, by definition
• agreeing with our opinion: "politically correct", "faith-based"
• contrary to our opinion: "politically incorrect", "reality-based"
• lying: truth enhancement
• stupid: cognitively challenged
[edit] List of satirical euphemisms
• vertically challenged: short
Personal tools
bookmarking
|
v0
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.