The Thien Audible Tension Gauge for Bandsaws (Beta)
Copyright (c) 2009, J. Phil Thien. All rights reserved.
The purpose of this interactive worksheet is to determine the frequency a properly tensioned bandsaw blade should generate when plucked. By entering just six numbers, we will compute that frequency. Sample files of "virtual blades" being plucked aid the user of this worksheet in adjusting their saw's tension.
More on tension
Questions & answers
Step #1. Determine the weight of your bandsaw blade. To do this, weigh the blade on a digital kitchen scale set to GRAMS. We use grams instead of ounces because most kitchen scales are more precise when resolving in grams.
blade weight (grams!)
Want to give it a test-spin? Try entering 84 grams, the weight of my 72-1/2" Blade Runner blade.
Step #2. For our computations, we need to know the length of the blade, in inches.
blade length (inches)
Want to give it a test-spin? Try 72.5, which is the length of saw blade for my saw.
Step #3. Now we need to know the thickness of your bandsaw blade. For best results, measure with one of those inexpensive digital calipers. You should also be able to get this data from the blade manufacturer.
blade thickness (inches)
Want to give it a test-spin? Try.022, which is the thickness of my Blade Runner blade.
Step #4. We're getting there. Now we need to know the blade's width at the narrowest section (in the gullet). I'll get a picture up how to measure this up soon. But basically, you want to measure the blade body (not counting the teeth).
blade width (inches)
Want to give it a test-spin? Try.390, the width of my 1/2" blade runner excluding the teeth.
Step #5. Almost done. Now we need to install the blade on the saw, and tension it. Just take the slack out of the blade, that's all the tension we need. Now, measure the distance between the two centers of your bandsaw's wheels. This is our beam length, or how long of an unsupported distance the blade spans.
wheel separation (inches)
Want to give it a test-spin? Enter 19.75, the distance between by axles when the blade is pre-tensioned.
Step #6. Now we just need to know the tension you desire. Manufacturers of blades typically suggest everything from 15000 up to 30000-PSI, with 20000-PSI pretty common for woodworking blades.
desired tension (PSI)
Want to give it a test-spin? Enter 15000, the PSI suggested by the manufacturer for my Blade Runner blade.
Step #7.
Enter the values above, then click on the "calculate" button to determine the tuning frequency...
If you were following the test-spin, you should have received an answer of 78.95-Hz.
Frequency samples
Once we've computed the frequency, you can use the files below to hear what a blade tensioned to that frequency should sound like. These are MIDI files, which should open in MS MediaPlayer (or any other suitable MIDI player).
20.601-Hz (midi16.mid)
38.890-Hz (midi27.mid)
73.416-Hz (midi38.mid)
138.591-Hz (midi49.mid)
21.826-Hz (midi17.mid)
41.203-Hz (midi28.mid)
77.781-Hz (midi39.mid)
146.832-Hz (midi50.mid)
23.124-Hz (midi18.mid)
43.653-Hz (midi29.mid)
82.406-Hz (midi40.mid)
155.563-Hz (midi51.mid)
24.499-Hz (midi19.mid)
46.249-Hz (midi30.mid)
87.307-Hz (midi41.mid)
164.813-Hz (midi52.mid)
25.956-Hz (midi20.mid)
48.999-Hz (midi31.mid)
92.498-Hz (midi42.mid)
174.614-Hz (midi53.mid)
27.500-Hz (midi21.mid)
51.913-Hz (midi32.mid)
97.998-Hz (midi43.mid)
184.997-Hz (midi54.mid)
29.135-Hz (midi22.mid)
55.000-Hz (midi33.mid)
103.826-Hz (midi44.mid)
195.997-Hz (midi55.mid)
30.867-Hz (midi23.mid)
58.270-Hz (midi34.mid)
110.000-Hz (midi45.mid)
207.652-Hz (midi56.mid)
32.703-Hz (midi24.mid)
61.735-Hz (midi35.mid)
116.540-Hz (midi46.mid)
220.000-Hz (midi57.mid)
34.647-Hz (midi25.mid)
65.406-Hz (midi36.mid)
123.470-Hz (midi47.mid)
223.081-Hz (midi58.mid)
36.708-Hz (midi26.mid)
69.295-Hz (midi37.mid)
130.812-Hz (midi48.mid)
246.914-Hz (midi59.mid)
PLEASE NOTE: As I'm still in the testing phase, I encourage you to proceed with caution. If it seems like you are overtensioning or undertensioning, please contact me and let's work through it. You assume all responsibility for using this site and my method.
More on tension
The topic of bandsaw tension is perhaps second only to dust collection in its ability to spark heated discussions among woodworkers.
My current bandsaw (a Delta BS150LS) has no tension gauge. It is a direct-drive 10" bandsaw with a 1/2-HP motor, and 7" of resaw capability (and I've resawed 7" stock with it, too). But like I said, there is absolutely no tension gauge to guide the user in setting blade tension. The manual instructs the user to turn the tension knob until all the slack is removed from the blade. Then, depending on the size of the blade, the user is instructed to turn the knob from 3 to 7 more times (3 turns for a 1/4" blade, 7 turns for a 3/8" blade).
This has worked sorta alright. The results were very repeatable, but I had no idea if I was achieving the 15k to 25k-PSI tension that the band manufacturers typically recommend. Thicker stock (resawing) tended to give me more problems than cutting thinner stock. I often assumed the tension had something to do with that, but I had no way of knowing for sure.
I had even greater difficulty when I decided to try a 1/2" Blade Runner band on the saw. The Blade Runner (from Iturra Design) is made from the same Atlanta Sharptech stock as the Wood Slicer blades from Highland Hardware. These blades have done very well in the reviews (winning the Fine Woodworking blade shoot-out, for example). But, the manual for my saw offered no guidance in tensioning a 1/2" blade. While the band fit, and I seemed to have no problem achieving lots of tension with it in place, I had no idea how many turns of the tension knob were required to properly tension it.
So I considered purchasing an aftermarket tension gauge. Typically selling for $100 to $300, these clamp to the blade and measure how much a band stretches as it is tensioned. Young's modulus is used in order to convert the measured stretch to tension (in PSI). However, Mark Duginske, a noted bandsaw expert and author of at least a couple of bandsaw books, has argued that these aftermarket gauges fall short. Testing performed by Mike Cutler (a materials engineer) on Mr. Duginske's behalf indicated that the gauges are neither accurate, nor repeatable. Mr. Duginske announced these findings in one of the woodworking forums and both Mr. Duginske and Mr. Cutler had to immediately begin defending their findings. Several users of the gauges were unwilling to accept the results of the tests. However, it is clear that the tests were exhaustive, with standards traced back to NIST (National Institute of Standards and Testing). Mr. Cutler spent hours speaking with engineers at Delta and blade manufacturers. The results were accurate, the aftermarket gauges were not.
I was aware of shop-made gauges. These pretty much emulate the spendy aftermarket gauges I mention above (clamping to the blade to measure stretch). While they're certainly much less expensive to make than to buy ($20 instead of $100 and up), if the $100 to $300 gauges are neither accurate not repeatable, I didn't see the sense of making a copy of one. Yet on one rainy Saturday afternoon I did experiment with shop-made solutions. I had less than satisfactory results.
[The reason I imagine these gauges don't work well (in case you were wondering) is that they rely on the user's ability to get them on an untensioned blade such that the blade is perfectly straight and true between


Two prisoners are imprisoned at opposite ends of the prison. They cannot meet, nor exchange any kind of information. However, one day they are brought together by the ward who tells them:
"I shall give you a chance for getting free. In one hour you'll be separated again, and one of you will go back to his cell, while the other one will stay here. I shall show the former six different numbers randomly chosen among the positive integers $ 1,...., 245 $. He may think about the numbers and then will have to reject one of the six numbers and tell me the other five. I shall write these five numbers down on a piece of paper, in one line and in the same order as I hear them. Then this guy will have to leave the room. The other man will be called in. I show him my piece of paper with the five numbers, and he must say a number. If he says the rejected number, then the two of you will be free. "
How can these two guys get free?
 - 1
 $\begingroup$ 'in one line' - does this mean that the second person won't know if 345 is 34, 5 or 3, 45 or 3, 4, 5.... Or that he will know what the different numbers are? $\endgroup$ – Ben Feb 24 '16 at 10:57
 - 5
 $\begingroup$ Sounds like the Fitch Cheney card trick $\endgroup$ – Julian Rosen Feb 24 '16 at 14:19
(1) We observe that $245=5\times49$. Instead of working with the integers $1,\ldots,245$, we will use the integers $1,\ldots,49$ in the five colors red, blue, yellow, green and orange.
(2) Among the six numbers randomly chosen by the ward, there will be at least two of the same color, say integers $x$ and $y$ both in color red. Modulo $49$, exactly one of $x-y$ and $y-x$ is in the range $1,\ldots,24$; assume that $y-x$ is in the range $1,\ldots,24$. Then we reject $y$, and put $x$ as the first number on the list. With this, the second prisoner knows that the rejected number has the same color as the first number $x$ on the list and is one of $x+1,x+2,\ldots,x+24$ (taken modulo $49$).
(3) There are $4!=24$ permutations of the other four integers. This is enough to communicate the value of $y-x$ to the other prisoner. (The two prisoners just have to agree on a bijection between permutations of four objects and the numbers $1,2,\ldots,24$.)
 - $\begingroup$ This is brilliant, but I think it needs to be expanded to include the code for part 3, because they only have one hour to agree it and they also need to be able to encode and decode it relatively easily. $\endgroup$ – jhabbott Feb 25 '16 at 15:51
 - 3
 $\begingroup$ _USER_ Label four objects ABCD. Put their 24 permutations in alphabetical order. The first permutation (ABCD) is 1, the second permutation (ABDC) is 2, and so on. $\endgroup$ – f'' Feb 25 '16 at 16:58
 - $\begingroup$ _USER_ - see my post where I explain how to encode 1-120 from permulations of 5 integers. For 4 integers, just drop $a_5$ and $d_4$, and you can encode 1-24. $\endgroup$ – Paul Sinclair Feb 25 '16 at 17:18
This doesn't work. I will leave it in case someone can use it to create a real solution. The problem is this:
Consider the sequence 121, 122, 123, 124, 125. Whatever scheme I came up with, it was possible to add a number to that sequence that would defeat the strategy. Try adding 120, 126, 1 or 245 as the sixth number and by my reckoning one of those should be unreachable by strategies like the one below. The idea of using permutations to indicate a number between 1 and 120 is valid and Paul Sinclair has given an elegant explanation in his post.
The prisoner who is to leave announces that his strategy will be
To reject either the largest or the smallest number given. Of the remaining five numbers, if there are fewer numbers larger than the largest remaining numbers, then the largest was rejected. Likewise for smaller. In case of a tie, the rejected number is smaller. Thus no more than (245 - 5) / 2 = 120 numbers remain.
The prisoners then agree on the following numbering system:
The base ordering of the five numbers is largest to smallest. This represents the number 1. If the final two numbers are permuted, this represents the number 2. If the third and fifth numbers are permuted, this represents 3 and so on. The number of permutations is 5!, exactly enough to solve the worst case.
 - $\begingroup$ I'm afraid I don't understand the second half of your explanation -- how does the permutation represent a number? $\endgroup$ – Fund Monica's Lawsuit Feb 24 '16 at 13:40
 - $\begingroup$ _USER_ - I added an answer (too long for a comment) explaining a scheme for representing the number as a permutation. I am not sure if it the scheme that Hugh Meyers intended, but it does the job. $\endgroup$ – Paul Sinclair Feb 24 '16 at 14:25
 - 1
 $\begingroup$ As far as I understand it this doesn't work. If I understand you right the second person should compare the range of numbers that are larger than the largest remaining one and the range of thos that are smaller than the smallest remaining one and depending on which is smaller should focus the second step on this range. However given for example the initial numbers [3, 119, 120, 121, 242, 244] the first person can't make such a situation happen. If he removes the 244 the second person will focus on the range [1, 2] and if he removes the 3 the second person will focus on the range [245]. $\endgroup$ – The Dark Truth Feb 24 '16 at 14:39
 - $\begingroup$ _USER_ - Don't reject the largest or smallest, unless they have equal ranges - then reject one of them to make the ranges unequal. If they are already unequal, reject some middle number. The 2nd person uses the smaller range. Everything else proceeds as Hugh Meyers said. $\endgroup$ – Paul Sinclair Feb 24 '16 at 14:46
 - $\begingroup$ _USER_ I don't think your proposal works - if the second person sees 10 as their smallest number and 225 as their largest, how do they know if 225 was the largest number given to the first person (and thus they rejected some middle number), or if the first person rejected 235? $\endgroup$ – Dan Staley Feb 24 '16 at 19:24
Arrange the numbers from 1 to 245 clockwise around a circle, and mark the locations of the six numbers on it. Consider the gaps left between the marked numbers. There are six gaps, with a total length of 245. Each gap is at least 1, so the largest possible sum of two gaps is 241, and the second-largest gap is at most 120.
Find the largest gap (or possibly one that is tied for largest). The number that will be removed is the one on the clockwise edge of this gap. The next gap clockwise (before the number is removed) is at most 120, so its length can be encoded by the order of the five numbers to be written.
The other prisoner receives the five numbers and similarly plots them on a circle. They will necessarily find that one of the five gaps is larger than any of the others. The removed number comes from this gap, and its value can be found by converting the order of the five numbers back into a value from 1 to 120, and counting that many places counterclockwise from the clockwise edge of the gap.
 - $\begingroup$ Really nice solution if you can write on paper and you don't have to remember much details $\endgroup$ – Falco Mar 1 '16 at 12:37
Not an answer, but too long to add as a comment to Hugh Meyer's answer. I don't completely follow his scheme for converting a permutation to a number either, but here is one that works:
Let $a_1, a_2, a_3, a_4, a_5$ be the five numbers in the order given. Then for $k = 1, 2, 3, 4$ define $d_k$ to be the count of numbers $a_1,..., a_k$ which are less than $a_{k+1}$. So for example, $$\begin{align}d_1 &= \begin{cases} 0 & \text


text:
- Value is a concrete instance of a certain type.
- Nodes can contain both child nodes and key/value pairs.
- Nodes and keys get created on the fly if they don't exist.
The only requirement that
XmlConfiguration imposes on values is that they must be convertible to string and back. This requirement actually comes from the fact that the underlying storage is an XML file; the
TreeConfiguration itself does not impose any such requirements.
The list of types that can be managed using the
XmlConfiguration includes all.NET primitive types (
DateTime etc.) and FCL types that support generic type conversion by means of the
TypeConverter class. Types like
Rectangle (all from the
System.Drawing namespace) are just some of the examples of FCL types that can be managed using the
XmlConfiguration right out of the box. (You can find a detailed discussion about type conversion issues here.)
The general rule is: whatever type can be edited as a single property in the Visual Studio Property Browser should also be suitable for use with the
XmlConfiguration. For any other types, there is no magic—you have to help to make conversion happen by writing a type converter.
The generic type conversion implies that the managed types are simple enough so that their instances can be represented by a single string. This isn't really a big problem because the individual configuration settings are typically either primitive types or otherwise very simple types such as
Size etc. (And even if a type instance cannot be represented with a single string, it can always be broken down to pieces that can.)
In any case, the
XmlConfiguration doesn't limit support to only built-in FCL types. It can work with user-defined types as well, provided that you implement a
TypeConverter-derived type converter for them. The source code package comes with a simple example that shows how to build one.
Search and Removal
From time to time you'll want to check if a single key or node exists, remove it, or even erase the complete hierarchy. The following example shows these operations:
bool valueExists = cfg["/Database/Login/Username"]!= null;
cfg["/Database/Login/Username"] = null;
ConfigurationNode n = cfg.FindNode("/Database/Login");
bool nodeExists = n!= null;
bool hasSubNodes = n.HasSubNodes;
bool hasKeys = n.HasKeys;
bool isEmpty = n.Empty;
bool removed = cfg.RemoveNode("/Database/Login");
Most of the configuration settings are inherently static: they get stored in a fixed, predefined location in the configuration hierarchy and their data size is constant. Managing this kind of settings is easy because everything is known in advance: a setting can be referenced using a hard-coded path and the code can make safe assumptions about the content structure.
On the other side, some configuration settings, such as the list of most recently opened documents, have a dynamic structure: the size of the data is variable and it may even happen that there is no data at all. In terms of configuration elements, a node that represents dynamic settings contains a variable number of subnodes and key/value pairs.
In order to read the content of a dynamic setting, the content has to be made discoverable. For that reason the
TreeConfiguration class exposes the node content in the form of collections of subnodes, keys and values. These three collections are accessible through corresponding named properties
ICollection subNodes = cfg.Nodes["/node1/node2/node3"];
foreach (ConfigurationNode n in subNodes)
ICollection keys = cfg.Keys["/node1/node2/node3"];
foreach (string key in keys)
ICollection values = cfg.Values["/node1/node2/node3"];
foreach (object value in values)
(Make sure you check the file Test.cs for concrete examples.)
Managing culture-specific data
Type conversion quite often results in formatted strings: for example, numbers are presented with decimal and thousands separators, dates are presented with date and time separators etc. The resulting string format is culture-dependent.
Storing culture-sensitive formatted strings without culture information used to produce them is often an expensive mistake. The initial version of the
XmlConfiguration did not store any culture information, often making it impossible to correctly read a configuration file in an environment that has a different regional setting from the one the file was created in.
To reliably convert formatted strings back to concrete types,
TypeConverter needs the information about the culture used for the conversion. This is why the
XmlConfiguration type now exposes a string property named
Culture to identify the culture used in type conversions.
By default, if
Culture property is not set, the
XmlConfiguration will use
CultureInfo.CurrentCulture for all type conversions. When specifying the culture use standard names, as in the following example:
XmlConfiguration cfg = new XmlConfiguration(...);
cfg.Culture = "fr-FR";
Culture info can also be specified for each individual
ConfigurationNode node. Culture info specified for a concrete node applies to all its subnodes and key/value pairs. In fact, setting the
XmlConfiguration.Culture property just sets the
Culture property of the root
ConfigurationNode. If there are no subnodes that override the root node setting, culture info applies to the whole configuration. The following example shows how to set and override culture info:
XmlConfiguration cfg = new XmlConfiguration(...);
float number = 123.456F;
DateTime now = DateTime.Now;
cfg.Culture = "fr-FR";
cfg["/french/number"] = number; cfg["/french/date"] = now;
ConfigurationNode rootNode = cfg.FindNode("/");
ConfigurationPath path = new ConfigurationPath("southafrican");
ConfigurationNode subNode = rootNode.CreateSubNode(path);
subNode.Culture = "af-ZA";
subNode["number"] = number; subNode["date"] = now;
(For a more detailed example, check the Test.cs file.)
Can't wait to try it! What's in the package?
The package contains two projects:
TreeConfiguration class library.
- Files that implement the actual functionality: TreeConfiguration.cs, ConfigurationNode.cs, ConfigurationPath.cs, XmlConfiguration.cs, CustomTypeConverter.cs and TreeConfiguration.xsd;
- Home-made unit testing framework: UnitTest.cs;
- Functionality tests executed by the unit testing framework: Test.cs;
- Documentation: docs\*.xml files, a help file generated by NDoc, and an NDoc project file used to build it.
- A sample console application that does nothing but runs all the tests against the
A home-made unit testing framework was added to the package only to avoid having dependencies to a third-party framework that some readers might not have on their machines. Under normal circumstances, something like TestDriven.NET would be more appropriate.
The tests in the Test.cs file not only verify the correctness of the given functionality but also demonstrate all aspects of usage. This file is the first place to look for the answers to any questions you might have.
In order to test the serialization of certain FCL classes, the TreeConfiguration project contains a few otherwise unnecessary references to assemblies such as
To build the documentation help file such as the one that is part of the package (TreeConfiguration.chm), you will need NDoc. The project source code files themselves contain no comments—only references to external files where the actual comments are. When the project gets built, all those references to individual documentation files in the docs subfolder get analyzed and the corresponding files get compiled into a single resulting XML documentation file. NDoc uses that file to build a help file in a number of different formats.
And that pretty much rounds up this idyllic story about the
TreeConfiguration. I just hope that the reality won't distort it too much, and that you'll find the code usable.
- Added support for managing data stored in a culture-specific format.
- Fixed reading of manually created XML configuration files that contain comments.

source: openbmb/Ultra-FineWeb


text:
The Two Towers
Orthanc and Cirith Ungol
... an article by Phil Benjamin Coker
The Waterworks Chimney, Edgbaston, 1913
Tolkien himself foresaw this confusion before the book was published in November 1954, as is revealed in a letter to Rayner Unwin (the publisher) written on 22nd January of that year: Tolkien wrote am not at all happy about the title The Two Towers. It must if there is any real reference in it to Vol. II refer to Orthanc and the Tower of Cirith Ungol. But since there is so much made of the basic opposition of the Dark Tower and Minas Tirith, that seems very misleading.
So Tolkien believed that the title The Two Towers refered to Orthanc, the abode of Saruman, and Cirith Ungol. Tolkien letter would seem to settle the confusion butut for the fact that Tolkien original cover design for The TwoTowers features a tower which is black with three horns and the sign of the white hand underneath it, which must be Orthanc (the white hand being Saruman sign). The other tower on the cover is white with a thin crescent moon above it, which is an obvious reference to Minas Morgul (Tower of Sorcery); its original name was Minas Ithil (Tower of the Moon hence the moon motif). This would suggest Orthanc and Minas Morgul were The TwoTowers.
On another level one could argue that these towers were indeed The Two Towers because both held Palanti (seeing stones) and it was through their use that much evil came to pass during the later years of the third age of Middle-earth. However, one could also argue that if the palanti determined The Two Towers then the title should be the Three Towers as three palanti were involved, the two from Orthanc and Minas Morgul and the one used by Denethor in Minas Tirith.
Another reason that throws doubt on Cirith Ungol as a contender for one of The Two Towers is in its name, Cirith Ungol - spider's pass (no reference to it being a tower).That there was a tower here is not in doubt, as Chapter 1 of Book VI is called The Tower of Cirith Ungol. What does cause doubt are the facts that Cirith Ungol was, firstly, one of many minor towers built around Mordor by the men of Numenor - others were Narchost & Carchost, fire fort and fang fort respectively or Towers of the Teeth; Durthang, dark opposition and Isenmouthe or Carach Angren, Iron Jaws. These towers / fortifications were built to stop evil from escaping from or to Mordor, but when compared to Orthanc, Minas Morgul or Minas Tirith they are not really in the same class. Secondly, The Tower of Cirith Ungol is not part of The Two Towers, it is a chapter in The Return of the King: it is sundered from The Two Towers by more than two hundred pages, which really does not help to make things clear.Whatever the arguments may be I am content to go along with the author's view, as expressed in his letter referred to above, that The Two Towers are Orthanc and the Tower of Cirith Ungol.
Orthanc or Mount-fang is a translation from the Elven tongue (Sindarin), which literally means forked height. It was constructed from glossy black stone, stood five hundred feet high and had been built by the Men of Gondor at the end of the second age. By the middle of the third age it had fallen into disuse and had been locked. Beren, the then steward of Gondor, gave the keys of Orthanc to Saruman in the year 2953. Hidden within the tower was a Palantir (seeing stone) which Saruman found and was thus able to communicate with Sauron who also had found one of the lost Palanti.
Minas Morgul or Tower of Sorcery had originally been called Minas Ithil or Tower of the Moon, and had been built by the men of Gondor. It was once the principal city of the southern realm and the high seat of Isildur. Minas Morgul was so renamed after it fell to the Nazg in 2002 of the third age. The tower contained a Palantir which Sauron claimed and with which he was able to pervert both Saruman and Denethor. It was completely destroyed and its foundations removed by Aragorn (King Elessar) after the War of the Ring at the end of the third age.
- The letters of J.R.R. Tolkien / Humphrey Carpenter & Christopher Tolkien (ed.)London: HarperCollins, 1995
- The Languages of Tolkien's Middle-earth / Ruth S. Noel.Boston: Houghton & Mifflin, 1974
- The New Tolkien Companion / J.E.A. Tyler. - 2nd ed.London: Picador, 1979
- The Two Towers / J.R.R. Tolkien. - 3rd ed.London: Unwin, 1979
Two Towers Post Script (Sept. 2003)
I recently re-read The Fellowship of the Ring only to find another oddity to the vexing subject of the Two Towers. On the very last page (in italics) Tolkien previews The Two Towers and says:-
since the events recounted in it are dominated by Orthanc,
the citadel of Saruman, and the fortress of Minas Morgul
that guards the secret entrance to Mordor&
This statement is obviously at variance with what Tolkien wrote in his letter to Rayner Unwin and throws serious doubt on Cirith Ungol as a contender for one of the Two Towers.

source: HuggingFaceFW/fineweb-edu


text:
Christa McAuliffe: How her legacy lives on
Christa McAuliffe was never able to teach from space, but her lesson plans, now updated to reflect current technology, remain available to all.
Christa McAuliffe never had the chance to fulfill her dream of teaching from space and in the aftermath of the accident, her lesson plans were filed away by NASA with sadness and grief. The lessons were incomplete, unfinished, and most regrettably, they were never were taught. I wrote an article two-and-a-half years ago how NASA engineer Jerry Woodfill — the same endearing engineer from our series "13 Things That Saved Apollo 13" — had come across McAuliffe's unfinished lesson plans by accident and worked for several months to resurrect them and give them new life with current technology. On this 25th anniversary of the Challenger accident, I wanted to remind our readers of this engaging story, and how the Challenger Centers for Space Science Education are now using McAuliffe's lessons. The lessons are also available for any teacher, or anyone who wants to view or use them.Skip to next paragraph
Subscribe Today to the Monitor
Also, the Challenger Centers offer a wonderful education resource and experience for young people. Please consider donating to their mission, started by the families of the Challenger astronauts lost in the accident. Your donation will honor the Challenger 7 heroes and help inspire the next generation.
Nancy Atkinson blogs at Universe Today.


text:
I have a twelve-year-old Windows program. As may be obvious to the knowledgeable, it was designed for ASCII characters, not Unicode. Most of it has been converted, but there's one spot that still needs to be changed over. There is a serious constraint on it though: the exact same
ASCII byte sequence MUST be created by different encoders, some of which will be operating on non-Windows systems.
I'm trying to determine whether UTF-8 will do the trick or not. I've heard in passing that different UTF-8 sequences can come up with the same Unicode string, which would be a problem here.
So the question is: given a Unicode string, can I expect a single canonical UTF-8 sequence to be generated by any standards-conforming implementation of a converter? Or are there multiple possibilities?


text:
[en] The efficiency of the transmission of surface plasmon waves by use of a dielectric diffraction grating is discussed. The Kretschmann device allows us to obtain a surface plasmon resonance that consists of an absorption peak in the reflection spectrum. When surface plasmon resonance occurs, the TM-polarization mode of the incident electromagnetic wave is neither transmitted nor reflected. The procedure to transform an absorption peak into a transmission peak is described. Transmittivity of 68% is obtained for a simple structure that consists of a thin-film layer of Ag coated on a volume diffraction grating and embedded between two dielectric media. The results presented herein were obtained by numerical simulations that were carried out by use of an algorithm based on the rigorous coupled-wave theory.
Service de Physique Générale, Hololab
Fonds pour la formation à la Recherche dans l'Industrie et dans l'Agriculture (Communauté française de Belgique) - FRIA


text:
Provided by: freebsd-manpages_8.0-1_all
GEOM - modular disk I/O request transformation framework
The GEOM framework provides an infrastructure in which "classes" can
perform transformations on disk I/O requests on their path from the upper
kernel to the device drivers and back.
Transformations in a GEOM context range from the simple geometric
displacement performed in typical disk partitioning modules over RAID
algorithms and device multipath resolution to full blown cryptographic
protection of the stored data.
Compared to traditional "volume management", GEOM differs from most and
in some cases all previous implementations in the following ways:
· GEOM is extensible. It is trivially simple to write a new class of
transformation and it will not be given stepchild treatment. If
someone for some reason wanted to mount IBM MVS diskpacks, a class
recognizing and configuring their VTOC information would be a trivial
· GEOM is topologically agnostic. Most volume management
implementations have very strict notions of how classes can fit
together, very often one fixed hierarchy is provided, for instance,
subdisk - plex - volume.
Being extensible means that new transformations are treated no
differently than existing transformations.
Fixed hierarchies are bad because they make it impossible to express the
intent efficiently. In the fixed hierarchy above, it is not possible to
mirror two physical disks and then partition the mirror into subdisks,
instead one is forced to make subdisks on the physical volumes and to
mirror these two and two, resulting in a much more complex configuration.
GEOM on the other hand does not care in which order things are done, the
only restriction is that cycles in the graph will not be allowed.
TERMINOLOGY AND TOPOLOGY
GEOM is quite object oriented and consequently the terminology borrows a
lot of context and semantics from the OO vocabulary:
A "class", represented by the data structure g_class implements one
particular kind of transformation. Typical examples are MBR disk
partition, BSD disklabel, and RAID5 classes.
An instance of a class is called a "geom" and represented by the data
structure g_geom. In a typical i386 FreeBSD system, there will be one
geom of class MBR for each disk.
A "provider", represented by the data structure g_provider, is the front
gate at which a geom offers service. A provider is "a disk-like thing
which appears in /dev" - a logical disk in other words. All providers
have three main properties: "name", "sectorsize" and "size".
A "consumer" is the backdoor through which a geom connects to another
geom provider and through which I/O requests are sent.
The topological relationship between these entities are as follows:
· A class has zero or more geom instances.
· A geom has exactly one class it is derived from.
· A geom has zero or more consumers.
· A geom has zero or more providers.
· A consumer can be attached to zero or one providers.
· A provider can have zero or more consumers attached.
All geoms have a rank-number assigned, which is used to detect and
prevent loops in the acyclic directed graph. This rank number is
assigned as follows:
1. A geom with no attached consumers has rank=1.
2. A geom with attached consumers has a rank one higher than the
highest rank of the geoms of the providers its consumers are
SPECIAL TOPOLOGICAL MANEUVERS
In addition to the straightforward attach, which attaches a consumer to a
provider, and detach, which breaks the bond, a number of special
topological maneuvers exists to facilitate configuration and to improve
the overall flexibility.
TASTING is a process that happens whenever a new class or new provider is
created, and it provides the class a chance to automatically configure an
instance on providers which it recognizes as its own. A typical example
is the MBR disk-partition class which will look for the MBR table in the
first sector and, if found and validated, will instantiate a geom to
multiplex according to the contents of the MBR.
A new class will be offered to all existing providers in turn and a new
provider will be offered to all classes in turn.
Exactly what a class does to recognize if it should accept the offered
provider is not defined by GEOM, but the sensible set of options are:
· Examine specific data structures on the disk.
· Examine properties like "sectorsize" or "mediasize" for the provider.
· Examine the rank number of the provider's geom.
· Examine the method name of the provider's geom.
ORPHANIZATION is the process by which a provider is removed while it
potentially is still being used.
When a geom orphans a provider, all future I/O requests will "bounce" on
the provider with an error code set by the geom. Any consumers attached
to the provider will receive notification about the orphanization when
the event loop gets around to it, and they can take appropriate action at
A geom which came into being as a result of a normal taste operation
should self-destruct unless it has a way to keep functioning whilst
lacking the orphaned provider. Geoms like disk slicers should therefore
self-destruct whereas RAID5 or mirror geoms will be able to continue as
long as they do not lose quorum.
When a provider is orphaned, this does not necessarily result in any
immediate change in the topology: any attached consumers are still
attached, any opened paths are still open, any outstanding I/O requests
are still outstanding.
The typical scenario is:
· A device driver detects a disk has departed and orphans the
provider for it.
· The geoms on top of the disk receive the orphanization event
and orphan all their providers in turn. Providers which are
not attached to will typically self-destruct right away. This
process continues in a quasi-recursive fashion until all
relevant pieces of the tree have heard the bad news.
· Eventually the buck stops when it reaches geom_dev at the top
of the stack.
· Geom_dev will call destroy_dev(9) to stop any more requests
from coming in. It will sleep until any and all outstanding
I/O requests have been returned. It will explicitly close
(i.e.: zero the access counts), a change which will propagate
all the way down through the mesh. It will then detach and
destroy its geom.
· The geom whose provider is now detached will destroy the
provider, detach and destroy its consumer and destroy its geom.
· This process percolates all the way down through the mesh,
until the cleanup is complete.
While this approach seems byzantine, it does provide the maximum
flexibility and robustness in handling disappearing devices.
The one absolutely crucial detail to be aware of is that if the device
driver does not return all I/O requests, the tree will not unravel.
SPOILING is a special case of orphanization used to protect against stale
metadata. It is probably easiest to understand spoiling by going through
Imagine a disk, da0, on top of which an MBR geom provides da0s1 and
da0s2, and on top of da0s1 a BSD geom provides da0s1a through da0s1e, and
that both the MBR and BSD geoms have autoconfigured based on data
structures on the disk media. Now imagine the case where da0 is opened
for writing and those data structures are modified or overwritten: now
the geoms would be operating on stale metadata unless some notification
system can inform them otherwise.
To avoid this situation, when the open of da0 for write happens, all
attached consumers are told about this and geoms like MBR and BSD will
self-destruct as a result. When da0 is closed, it will be offered for
tasting again and, if the data structures for MBR and BSD are still
there, new geoms will instantiate themselves anew.
Now for the fine print:
If any of the paths through the MBR or BSD module were open, they would
have opened downwards with an exclusive bit thus rendering it impossible
to open da0 for writing in that case. Conversely, the requested
exclusive bit would render it impossible to open a path through the MBR
geom while da0 is open for writing.
From this it also follows that changing the size of open geoms can only
be done with their cooperation.
Finally: the spoiling only happens when the write count goes from zero to
non-zero and the retasting happens only when the write count goes from
non-zero to zero.
INSERT/DELETE are very special operations which allow a new geom to be
instantiated between a consumer and a provider attached to each other and
to remove it again.
To understand the utility of this, imagine a provider being mounted as a
file system. Between the DEVFS geom's consumer and its provider we
insert a mirror module which configures itself with one mirror copy and
consequently is transparent to the I/O requests on the path. We can now
configure yet a mirror copy on the mirror geom, request a
synchronization, and finally drop the first mirror copy. We have now, in
essence, moved a mounted file system from one disk to another while it
was being used. At this point the mirror geom can be deleted from the
path again; it has served its purpose.
CONFIGURE is the process where the administrator issues instructions for
a particular class to instantiate itself. There are multiple ways


text:
There are many proverbs and sayings in English that involve money. Here are some of the most popular.
1. A fool and his money are soon parted
Means that people who spend their money on foolish things will lose their money and become poor. This is something that often happens to people who suddenly get a lot of money, especially if that money comes in one lump sum or over the period of a few years.
This happens a lot with lottery winners and athletes. They get a lot of money at one time, spend it on silly, useless things and before they know it, the money is gone.
- He won $50 million dollars and somehow lost it all in just a few short years. He spent it on silly things and loaned money to friends and family. A fool and his money are soon parted.
2. A good name is better than riches
Means that a good reputation is worth more than any amount of money.
- Always do what you say you are going to do. A good name is better than riches.
3. A good payer is a master of another's purse
Means that someone who pays their bills on time can always borrow money. In other words if you have good credit, people will lend you money.
- My parents taught me that it's always important to pay your bills in full and on time. A good name is better than riches.
4. A good paymaster never wants workmen
Means that if an employer pays on time and pays fairly, they will always have people to work for them. In other words, pay well, pay on time, and you'll have good workers.
- People really enjoy working for this company because they pay fairly and on time. A good paymaster never wants workmen.
5. If you pay peanuts, you get monkeys
Is the opposite of the proverb above. It means that if you don't pay well, you won't get good workers. If you do happen to get a good worker, they'll probably leave quickly.
- The company started paying later and later, and making it more difficult for their employees to get their money. Soon all the good employees left. If you pay peanuts, you get monkeys.
6. Early to bed, early to rise, makes a man healthy, wealthy, and wise
Refers to waking up early in the morning and going to bed early allows for people to have a productive day. Going to bed early will assure that one has a good night's sleep, and waking up early allows for one to have an entire day to get things accomplished.
- Steve says that going to bed early and getting a good night's sleep is part of his success for being super productive during the day. Early to bed, early to rise, makes a man healthy, wealthy, and wise.
7. Money doesn't grow on trees
Is one of the most common sayings involving money that is said in America. It reminds people to remember the value of money. It takes hard work to get money, it doesn't come easily. Therefore, you should keep that in mind when you spend it.
- Stop asking for things you don't need and don't really want. Money doesn't grow on trees.
- Unfortunately the car costs too much, money doesn't grow on trees you know.
8. Money is the root of all evil
Refers to money being the cause or motivation for everything bad. It simply means that all wickedness and evil comes from money.
The original quote is the love of money is the root of all evil. It has been shortened. Money isn't the problem, it's how much people love it, and what they will do to get it, that is the problem.
- He betrayed his friends in their time of need, just so he could make a few dollars.
9. Money isn't everything
Means that money is not the only thing of value, and it's not the only thing that should be focused on.There are far more important things in the world, such as love and family.
This is usually said to encourage someone to either not be disappointed because they feel they are lacking money. Or it may be said to someone who is focusing too much on money, and they need to be reminded that there are more important things.
- I know you're very focused on your career, but don't work so hard that you lose sight of what's really important. Remember, money isn't everything.
- The millionaire John Smith died yesterday from a severe sickness that has no cure, going to show that money isn't everything.
10. Money Talks!
This proverb means that money can be of great power and influence compared to promises or words alone.
- If you want them to let you into the club, give them some money, money talks.
11. Money can't buy happiness
While money can buy most things, it cannot purchase the constant feeling of joy.
- I heard that millionaire lost everything in his divorce; it's proof that money can't buy happiness.
12. Cash is king
In many places around the world, credit cards and other kinds of payments and investments are not believed to be as reliable as cash, the proverb, 'Cash is King' tells us that most people like cash.
- I'm sorry we don't accept credit cards, cash is king here.
13. Time is money
It takes time working to make money.
- I'm sorry, but I have got to go now, I am late for a job and time is money!
14. Money makes the world go round
Money is an important part of everyone's daily life around the world. Without money, many things we do or need would not be available to us.
The proverb, 'money makes the world go round' is used as a statement by itself mostly to show how important money is.
15. It takes money to make money
This proverb is used when speaking about investments and ways to make more money. Usually, to make money, you have to have some already.
- You will need to invest one million dollars into the project before you see any profit. Why so much? Because it takes money to make money.
16. You can't take it with you.
This proverb is talking about death and the fact that we can't bring our money with us when we die.
- Why do you want to make more money? You have made plenty of money during your life, and besides, you can't take it with you.
17. Money is a good servant/slave, but a bad master.
Money is beneficial to buy what we need and pay for things. But, using all of our time trying to earn more money and missing out on things that are more important, such as family, means that money is controlling us like a master controls his servant or slave.
- Poor Jenny, her husband is never home, he is always working. They have a nice house and car, but he is never around to enjoy them. It's true; money is a good servant but a bad master.
We hope these proverbs help you the next time you are speaking about money.
Do you know of any other proverbs about money? Let us know in the comments below. Why not check out some other great proverbs and idioms on our website too!


text:
Fading and drifting
FM range is limited to about 25 miles (40 km), except for some high power stations.
If a vehicle is moving away from the desired station's transmitter, the signal will tend to fade and/ or drift. This condition is more prevalent with FM than AM, and is often accompanied by distortion.
Fading and drifting can be minimized to a certain degree by careful attention to fine tuning or selection of a stronger signal.
Static and fluttering
When the line-of-sight link between a transmitter and vehicle is blocked by large buildings or mountains, the radio sound may be accompanied with static or fluttering because of the characteristic of FM.
In a similar effect, a fluttering noise is sometimes heard when driving along a tree-lined road.
This static and fluttering can be reduced by adjusting the tone control for greater bass response until the disturbance has passed.
Because of the reflecting characteristics of FM, direct and reflected signals may reach the antenna at the same time (multipath) and cancel each other out.
As a vehicle moves through these electronic dead spots, the listener may hear a momentary flutter or loss of reception.
When two FM stations are close to each other, and an electronic dead spot, such as static or multipath area, interrupts the original signal, sometimes the stronger second signal will be selected automatically until the original one returns.
This swapping can also occur as you drive away from the selected station and approach another station of a stronger signal.
Compact disk player
To avoid damage to compact disc player and discs.
Use only compact discs labeled as shown, having no dirt, damage or warpage.
Never attempt to disassemble or oil any part of the player unit.
Do not insert any object other than a disc into the slot.
Remember there are no user-serviceable parts inside the compact disc player.
Do not allow the disc to sustain any fingerprints, scrapes or stickers on the surfaces.
This may cause poor sound quality.
Hold the disc only on the edge or center hole.
When not in use, take the disc out of the player, put the disc back into its case and store it away from dust, heat, damp and direct sunlight.
Leaving the disc on the dashboard in the sun can damage the disc.
If the disc gets dirty, clean the disc by wiping the surfaces from the center to the outside in a radial direction with a soft cloth.
Do not use a conventional record cleaner or anti-static record preservative.
Disc cleaners are available in audio stores.


Business encyclopedia
Learn everything there is to know about running a business
Discounted Cash Flow (DCF)
What is Discounted Cash Flow (DCF)?
Discounted cash flow, or DCF, is one approach to valuing a business, by calculating the value of its future cash flow projections. The key to understanding this, however, is the concept that money in the future is not worth as much as that same money today. That's referred to as the time value of money.
To calculate what a certain amount of money is worth in the future, you have to discount it, or account for the fact that you lost the chance to invest it and earn money from it. Hence, why it is called the discounted cash flow method.
To illustrate the point, let's say that your company made $10,000 today. That $10,000 today is worth more than $10,000 a year from now, or five years from now. That's because you could invest today's $10,000 and earn interest that would increase the total amount after a year. At an interest rate of 5%, in a year that $10,000 would grow to be worth $10,500. Obviously, $10,500 is worth more than $10,000.
Calculating DCF
But what is $10,000 in a year worth today? Fortunately, there's an equation for that.
To calculate DCF, or what a certain amount of future money is worth today, you use this:
DCF = Cash flow/ (1 + current interest rate) years in the future
In this example, you would take: $10,000/(1 +.05)1. And $10,000/1.05 = $9,523.81.
That means that the value of $10,000 a year from now, at a 5% interest rate, is $9,523.81.
The future value of $10,000 in two years is even less - $9,070.29. The farther out you go, the less you should pay for that $10,000.
Valuing a Company
So let's apply that now to determining the value of a company you may be interested in buying, or maybe if you were considering selling your own. It's important to factor in the value of the future cash flow the company will generate. If the is expected to earn $2 million this year, that doesn't meant that you should pay $2 million for it. You would be paying too much.
You may also be interested in:


Sırpça temel - Serbian for beginners A1-A2 Class | Amphy
Sırpça temel - Serbian for beginners A1-A2 with Suzana A | Amphy
Sırpça temel - Serbian for beginners A1-A2
Çok professional ve iyi organize edilmiş (Very professional and well structered)
What you'll learn
Burasi mutlaka her şey öğreneceksiniz:
1. alfabetleri
2. temel cumler
3. çok konuşacağız
You will definitelly you will learn a lot of things here such as
1. Alphabets
2. basic phrases
3. We will speak a lot
This class is perfect for
Türkleri için
Your Teacher
[object Object]
I've been teaching online for 5 years (officially). I love teaching because it's a dynamic and an interesting job. You can teach your students and you can learn from them as well. The happiness and joy of the student + their progresses with their target language = my biggest prize (so my students are the ones who motivate me to work better)and I try to combine: a bit of reading, a bit of writing, a bit of conversation, a bit of grammar and a bit of listening by using different resources.
What students need
internet kamerası
How to participate
Lesson price


text:
CURRENT CZECH NAME: Ostroh
Ostroh Uhersky, Uhersky Ostroh, Ungarisch-Ostra, Ungarisch-Ostroh
LOCATION: Ostroh is a small
town in Moravia, located at 48.59 longitude and 17.23 latitude, 75 km E
of Brno, 9 km ENE of Bzenec (seeMap
- by Mapquest, then click
on your browser's "Back" button to return to this page).
HISTORY: The earliest known
Jewish community in this town dates from 1592. In 1635 there were
22 Jewish houses. In 1671 there were 16 Jewish houses with more than
30 Jewish families, including Isak Schulklopper, Salamon Lateiner, Israel
Isak, Mandl, Salamon Chaska, Benesch, Friedrich Kojeteiner, Schmidl, Jekl
Fleischhacker, Salamon Mojses, Rabiner, Mojses Stanjetz, Jakob Gutman,
Israel Strimpfstricker, and Loebl Isak. From _PHONE_ there were
89 Jewish families. In 1848 the community numbered 478 members, but
dropped to 220 after the First World War. The Jewish population was
70 in 1930. The present town population is 5,000 - 25,000 with fewer
than 10 Jews.
Noteworthy historical events involving or affecting the Jewish community
were the separation of a Jewish quarter in 1727 and the existence of a
self-standing political community from _PHONE_. The old Jewish
cemetery was established in 17th century, with the last known Jewish burial
in 1862. The Jewish congregation was Conservative.
Birth, Death and Marriage record books for Ostroh may be located at the
Czech State Archives in Prague, Statni istredni archiv, tr. Milady Horokove
133, CZ-166 21 Praha 6, Czech Republic, tel/fax: +42 (2) 333-20274.
Search JewishGen/Internet resources for Ostroh.
NOTABLE RESIDENTS AND DESCENDANTS:
According to the entry in the International Association of Jewish Genealogical
Societies Cemetery Project database, Chaim Weizmann, president of the State
of Israel, once lived in Ostroh.
The following rabbis worked in Ostroh: Salomo Mose (1592); David b. Samuel
Halevy (1659); Mose b. Hakadosch Elchanan from Fuerth (1655); Jesaja b.
Sabatai Scheftel (1659); Joel b. Samuel from Krakau (1668); Mhrr Pinchas
(after 1700); Mhrr Salomo (before 1719); Kolonimos b. mhrr Baruch (from
1720); Loeb Steiniz (d. 1760); Mhrr Pinchas b. mhrr Aaron (1766); Jakob
Hirsch b. Mose Loeb (Biach) Feilbogen (_PHONE_); Mose Loeb b. mhrr JA
ha-Kohen Mueller (d. 1853); Dr. Joel Mueller; Dr. S. Wolfsohn; (_PHONE_);
Dr. Israel Taglicht (_PHONE_); Dr. Emanuel Lenke; Dr. D. Herzog (_PHONE_);
Dr. Simon Friedmann; Dr. Michael Halberstamm (from 1919).
Other notables include: Mordechai b. Schalom (community elder and author
of the statutes of the chevra kadisha in 1650); Schalom b. Jecheskel (landowner
1668); Mandl Salamon Steinitzer (land deputy 1732); Michl b. R. Sch. David
(judge); Mose Singer (judge 1835); Mandl Duschak (judge 1858); Loeb Winter
(judge 1860); Jesajas Braun (judge 1864); Sal. Kihn (judge 1876); Salamon
Winter (judge _PHONE_); Jonatan Lamberg (judge); Max Kihn (judge 1898);
Dr. Eduard Stern (judge 1902); Jehuda Diamand (judge 1903); Sigmund Klein
(judge 1909); Loeb Nussbaum; Samuel Kornblueh; Sal. Sommer; Jakob Hahn;
Jakob Strauss; Jechiel Gruenbaum.
Rabbi Dr. Moritz Grünwald was born 29 March 1853 in Ostroh.
He studied at the Universities of Vienna and Leipzig. He founded
the Jüdische Centralblatt in Belovar. In 1883 he became rabbi
of Pisek and later Jungbunzlau. He was the chief rabbi of Sofia from
1893 until his death in London on 10 June 1895.
The great-greatgrandson of Amalie Reif (b. Ostroh), E.
Randol Schoenberg, is a frequent contributor to Jewishgen's Austria-Czech
SIG and the submitter of this page.
Tom Beer has submitted an interesting story about his great-grandfather,
Beer (b. Ostroh).
CEMETERIES: There are two Jewish
cemeteries in Ostroh. The older cemetery location is urban, on flat
land, separate but near other cemeteries, and not identified by any sign
or marker. It is reached by turning directly off a public road.
It is open to all. The cemetery is surrounded by no wall or fence
and there is no gate. The approximate size of cemetery before WWII
and now is 0.1277 hectares. The cemetery contains no special memorial
monuments. The cemetery contains no known mass graves. Within the limits
of the cemetery there are no structures. The municipality is the
present owner of the cemetery property, which is now utilized for recreation
(park, playground, sports field). Adjacent properties are commercial
or industrial. The cemetery boundaries have not changed since 1939.
Private visitors come rarely to the cemetery. The cemetery
was vandalized during World War II and between 1945 and 1981. No
maintenance has been done. Now there is occasional clearing or cleaning
by authorities. There is a slight threat posed by pollution and proposed
The new cemetery is located at 1.5 km to the E, Veselska-Str. This
Jewish cemetery was established in 1862. The last known Jewish burials
were in the 1950s and 1960s. The cemetery location is urban, on flat
land, separate, but near other cemeteries, and not identified by any sign
or marker. It is reached by crossing the public property of the town
cemetery. It is open to all. A continuous masonry wall surrounds
the cemetery. There is a gate that does not lock. The
approximate size of the cemetery is now 0.2777 hectares; before WWII it
was about 0.47 hectares. There are 100-500 stones. The cemetery
has no special sections. The tombstones and memorial markers
are made of marble, granite and sandstone. The tombstones vary among
flat shaped stones, finely smoothed and inscribed stones, flat stones with
carved relief decoration and obelisks. The cemetery has tombstones
with bronze decorations or lettering and metal fences around graves.
Inscriptions on tombstones are in Hebrew, German and Czech. The cemetery
contains special memorial monuments to Holocaust victims. There are
no known mass graves. Within the limits of the cemetery are no structures.
The present owner of the cemetery property is the local Jewish community
of Brno. The adjacent properties are other cemeteries.
The current Jewish cemetery boundaries are smaller now than in 1939 because
of the town cemetery. Private visitors come occasionally to the cemetery.
The cemetery has been vandalized occasionally, mostly between 1981-91.
No maintenance has been done. Local/municipal authorities and Jewish
groups from within the country did restoration work, finally completed
in 1991. Now there is occasional clearing or cleaning by authorities.
There is a moderate threat posed by pollution, vegetation and vandalism;
and slight threats are posed by uncontrolled access, weather erosion, and
existing and proposed nearby development.
These surveys were completed on 1.3.1992 by Ing. Arch. Jaroslav Klenovsky,
Zebetinska 13, 623 00 Brno.
CONTACTS: Town officials:
Magistrate Jiri Chmelar, Mestsky urad Hradistska 305, 687 24 uhersky Ostroh,
tel. 0632/91116. Regional officials: PhDr. Jana Spathova, Okresni urad,
Referat Kultury, 686 01 Uherske Hradiste, tel. 0632/432. Interested parties:
Slovacke muzeum, dir. PhDr. Ivo Frolec, Smetanovy sady, 686 01 Uherske
Hradiste, tel. 0632/2262. Other sources: Bohumil Gelbkopf, Rybare 198,
687 24 Uhers


text:
Author: Aniruddh D. Patel
Hardback: ISBN: 9780195123753 Pages: 528 Price: U.S. $ 59.95
In the first comprehensive study of the relationship between music and language from the standpoint of cognitive neuroscience, Aniruddh D. Patel challenges the widespread belief that music and language are processed independently. Since Plato's time, the relationship between music and language has attracted interest and debate from a wide range of thinkers. Recently, scientific research on this topic has been growing rapidly, as scholars from diverse disciplines, including linguistics, cognitive science, music cognition, and neuroscience are drawn to the music-language interface as one way to explore the extent to which different mental abilities are processed by separate brain mechanisms. Accordingly, the relevant data and theories have been spread across a range of disciplines. This volume provides the first synthesis, arguing that music and language share deep and critical connections, and that comparative research provides a powerful way to study the cognitive and neural mechanisms underlying these uniquely human abilities.
"This book will be required reading for specialists, and interesting and informative reading for everyone. It manages to combine remarkable breadth of coverage with genuine depth of understanding, and it's clearly and elegantly written. The author has a clear point of view and wants to get it across to other researchers, but never lets that get in the way of the book's more fundamental goal of putting the latest research within the reach of the interested non-specialist reader." -D.R. Ladd, Professor of Linguistics, University of Edinburgh


[permalink] [id link]
Page "Totally disconnected space" ¶ 20
from Wikipedia
Promote Demote Fragment Fix
Some Related Sentences
Every and totally
Every non-empty totally ordered set is directed.
* Every totally ordered set with the order topology is Tychonoff.
* Every totally ordered set that is a bounded lattice is also a Heyting algebra, where is equal to when, and 1 otherwise.
* Every totally ordered set is a distributive lattice with max as join and min as meet.
Every November the Reebok Stadium hosts Kidz up North which is one of the largest free UK exhibitions totally dedicated to children with disabilities and special needs, their parents, carers and professionals who work with them.
Every subset of a totally bounded space is a totally bounded set ; but even if a space is not totally bounded, some of its subsets still will be.
* Every compact set is totally bounded, whenever the concept is defined.
* Every totally bounded metric space is bounded.
Every compact metric space is totally bounded.
Every and compact
* Every compact metric space is separable.
* Sequentially compact: Every sequence has a convergent subsequence.
* Countably compact: Every countable open cover has a finite subcover.
* Limit point compact: Every infinite subset has an accumulation point.
* Every compact metric space ( or metrizable space ) is separable.
* Every locally compact regular space is completely regular, and therefore every locally compact Hausdorff space is Tychonoff.
Every continuous function on a compact set is uniformly continuous.
Every compact Hausdorff space is also locally compact, and many examples of compact spaces may be found in the article compact space.
* Every compact Hausdorff space of weight at most ( see Aleph number ) is the continuous image of ( this does not need the continuum hypothesis, but is less interesting in its absence ).
*( BCT2 ) Every locally compact Hausdorff space is a Baire space.
Every H * is very special in structure: it is pure-injective ( also called algebraically compact ), which says more or less that solving equations in H * is relatively straightforward.
Every and metric
* Every separable metric space is homeomorphic to a subset of the Hilbert cube.
* Every separable metric space is isometric to a subset of the
* Every metric space is Tychonoff ; every pseudometric space is completely regular.
Every uniformly continuous function between metric spaces is continuous.
*( BCT1 ) Every complete metric space is a Baire space.
This is really a special case of a more general fact: Every continuous function from a compact space into a metric space is bounded.
Every special uniformly continuous real-valued function defined on the metric space is uniformly approximable by means of Lipschitz functions.
Every metric space which is ccc is also separable, but in general a ccc topological space need not be separable.
Every locally compact group which is second-countable is metrizable as a topological group ( i. e. can be given a left-invariant metric compatible with the topology ) and complete.
Every ( almost ) complex manifold admits a Hermitian metric.
1.532 seconds.


text:
:1→J :For(I,2,dim(L₁ :If L₁(I)=L₁(J:Then :.002+L₁(J→L₁(J :Else :If L₁(I)=int(L₁(J:Then :.001+L₁(J→L₁(J :Else :J+1→J :L₁(I→L₁(J :End:End:End :J→dim(L₁
Run-length encoding (RLE) is a very easy compression algorithm that you can use for compressing a list of numbers. The way it works is that you remove all of the consecutive repeated numbers from the list, and modify the first instance of the numbers with how many repeated numbers there were.
For example, say you have a list of numbers 1,2,2,3,3,3,4. You start with the 1, and since there is only one 1, it wouldn't be modified. There are two 2's, however, so you would remove the second two, and add a decimal part (using fPart() of how many 2's there were (in this case, just two, which we represent as.002). You would do this for the rest of the list, and the final list would be 1,2.002,3.003,4.
To save memory (which is of course the reason we're compressing) we will store the result to L₁, the same list the uncompressed data is in. Throughout the loop, J is the index of the last element of the compressed part of the list, and I is the index in the uncompressed part. We don't have to worry about the indices colliding, since I is always bigger than J.
We loop over the list with I, and check if the current element has the same value as the last element of the compressed list. If it is, then it's the beginning of a run, so we add.002 to that last element.
If it isn't there's another possibility — the last element could represent an existing run of the same element. We check for this with the code If L₁(I)=int(L₁(J)). If this turns out to be the case, we add.001 to increase the length of the run. Otherwise, the element really is different, and we increase J and add a new element.
At the end, we store J to the size of L₁. This gets rid of all the unnecessary data, leaving us only with the compressed portion of the list.
Note that we never store anything to L₁ itself, only to its elements. This is a useful technique to avoid using too much memory while the program is running: if we stored to L₁, a copy of the list would be stored to Ans, which could easily give a ERR:MEMORY if the list is too large. As the program is now, the only additional memory used is contained in three real variables (I, J, and Ans).


text:
6825 mammograms from our mammography image database were segmented to find the breast outline. The outlines were averaged and smoothed to produce an average outline for each laterality and radiographic projection.
Lesions in 3304 mammograms with malignant findings were mapped on to a standardised breast image corresponding to the average breast outline using piecewise affine transforms. A four dimensional probability distribution function was found from the lesion locations in the cranio-caudal and medio-lateral radiographic projections for calcification and noncalcification lesions. Lesion locations sampled from this probability distribution function were mapped on to individual mammograms using a piecewise affine transform which transforms the average outline to the outline of the breast in the mammogram.
The four dimensional probability distribution function was validated by comparing it to the two dimensional distributions found by considering each radiographic projection and laterality independently. The correlation of the location of the lesions sampled from the four dimensional probability distribution function across radiographic projections was shown to match the correlation of the locations of the original mapped lesion locations.


text:
For Primary 5 – Primary 7 Pupils
The local to Highland Neil Gunn Writing Competition is extending its submission date for P5-P7 children across Highland until the end of term (April 5th) to provide schools with the time to get their submissions in. This is a great opportunity for children to create a piece of writing for a competition which celebrates the life of the Scottish writer Neil Gunn.
The theme for P5 – P7 is a quote from Neil Gunn's writing:
"He was wakened by a loud knocking at the door." (The Well at the World's End)
Children in P5-P7 can write a piece which is inspired by this quote, presented in either poetry or prose.


text:
regularly include chain brakes on new machines, older saws don't always have them. For that reason, inspect carefully for a brake before you rent a chainsaw, or if you're considering purchasing a used one.
The top half of the tip of any chainsaw bar is the primary kickback danger zone because the chain is travelling nearly straight down at this point. Since restriction of the chain's travel in this area is the major cause of kickback, the best way to avoid it is by preventing any contact between the chainsaw's tip and the wood. A dull chain is also more likely to kick back than a sharp one because it's less able to slice through wood, and more likely to ride on top of it. Feeling tired? Stop sawing. Fatigue increases the chance you'll make mistakes leading to kickback.
Bringing it down
Proper felling technique involves three saw cuts that work together to create a hinging action that influences the direction of a tree's fall. At the same time, they prevent the butt from jumping up or twisting wildly as the trunk hits the earth. The first two cuts, made about 0.3 metres from the ground on the side the tree will naturally fall, create a notch into the trunk about one-third the tree's diameter. The third cut — the back cut — is horizontal, entering the side opposite the notch, 5 cm above its bottom face, and penetrating inward to within about 15 cm of the notch's point. It's important that the back cut doesn't intersect with the first two: The uncut wood fibres across the centre of the trunk — about 15 per cent of the thickness of the tree — create a hinge that keeps it under some control as you move back and away from the stump yelling Timber! Cutting through the hingewood is a dangerous mistake made by amateur fellers, and can allow the tree to fall in an unpredictable direction or to buck into the air as it hits the ground.
If you call in a pro
If you have to call in an arborist, know that you're buying more than expertise. You're buying insurance, too. At least you should be. "Up to 30% of what we charge customers goes straight for liability protection," explains Steven Mann of Bartlett Tree Experts. Every tree business is required by law to carry two kinds of coverage: a minimum of $1 million general liability insurance to protect property, plus Worker's Compensation insurance for every employee on site. "If you hire a so-called pro to cut a tree on your property and an accident happens, you may be named in a lawsuit if the arborist wasn't properly insured, even if the accident wasn't your fault," says Mann. "Ask to see valid insurance certificates that specifically mention cutting trees before agreeing to any kind of work." The only time Worker's Compensation coverage isn't required is when the owners of the tree-cutting business (not employees) are doing the actual work. Rates for removing trees run about $1,200 to $1,600 per day of labour for a two-person crew. And when it comes time to sign the cheque, don't get conned into paying PST. Tree removal is a service only, so GST is all you need to fork over to the government.


text:
Utah and Texas researchers have learned how quiet sounds are magnified by bundles of tiny, hair-like tubes atop "hair cells" in the ear: when the tubes dance back and forth, they act as "flexoelectric motors" that amplify sound mechanically.
"We are reporting discovery of a new nanoscale motor in the ear," says Richard Rabbitt, the study's principal author and a professor and chair of bioengineering at the University of Utah College of Engineering. "The ear has a mechanical amplifier in it that uses electrical power to do mechanical amplification."
"It's like a car's power steering system," he adds. "You turn the wheel and mechanical power is added. Here, the incoming sound is like your hand turning the wheel, but to drive, you need to add power to it. These hair bundles add power to the sound. If you did not have this mechanism, you would need a powerful hearing aid."
The new study is scheduled for publication Wednesday, April 22 in PLoS ONE,
a journal published by the Public Library of Science. The first author is Katie Breneman, a bioengineering doctoral student at the University of Utah. The study was coauthored by William Brownell, a professor of otolaryngology (ear, nose and throat medicine) at Baylor College of Medicine in Houston.
The researchers speculate flexoelectrical conversion of electricity into mechanical work also might be involved in processes such as memory formation and food digestion.
Dancing Cells and Hair-like Tubes in Your Ears
Previous research elsewhere indicated that hair cells within the cochlea of the inner ear can "dance" - elongate and contract - to help amplify sounds.
The new study shows sounds also may be amplified by the back-and-forth flexing or "dancing" of "stereocilia," which are the 50 to 300 hair-like nanotubes projecting from the top of each hair cell.
Such flexing converts an electric signal generated by incoming sound into mechanical work - namely, more flexing of the stereocilia - thereby amplifying the sound by what is known as a flexoelectric effect.
"Dancing hairs help you hear," says Breneman. The study "suggests sensory cells in the ear are compelled to move when they hear sounds, just like a music aficionado might dance at a concert. In this case, however, they'll dance in response to sounds as miniscule as the sound of your own blood flow pulsating in your ear."
In a yet-unpublished upcoming study, Rabbitt, Breneman and Brownell find evidence the hair cells themselves - like the stereocilia bundles atop those cells - also amplify sound by getting longer and shorter due to flexoelectricity.
Rabbitt and Brownell estimate the combined flexoelectric amplification - by both hair cells and the hair-like stereocilia atop hair cells - makes it possible for humans to hear the quietest 35 to 40 decibels of their range of hearing. Rabbitt says the flexoelectric amplifiers are needed to hear sounds quieter than the level of comfortable conversation.
"The beauty of the amplifier is that it allows you to hear very quiet sounds," Brownell says. Rabbit says that because hair cells die as people age, older people often "need a hearing aid because amplification by the hair cells is not working."
Because hair-like stereocilia also are involved in our sense of balance, the flexing of stereocilia not only contributes to hearing, but "also likely is involved in our sense of gravity, motion and orientation - all the things needed to have balance," Rabbitt says.
The new study is part of an effort by researchers to understand the amazing sensitivity of human hearing. Rabbitt says the hair cells are so sensitive they can detect sounds almost as small as those caused by Brownian motion, which is the irregular movement of particles suspended in gas or liquid and bombarded by molecules or atoms.
An Amplifier for All Sorts of Ears
Hair cells are inside the inner ears of many animals. They are within the ear's cochlea, which is the spiral, snail-shell-shaped cavity where incoming sound vibrations are converted into nerve impulses and sent to the brain. Incoming sounds must be amplified because incoming sound waves are "damped" by fluid that fills the inner ear.
Hair cells are about 10 microns wide, and 30 to 100 microns long. By comparison, a human hair is roughly 100 microns wide. A micron is one-millionth of a meter. The hair-like stereocilia tubes poking out the top of a hair cell are each a mere 1 to 10 microns long and about 200 nanometers wide, or 200 billionths of a meter wide.
Brownell says the new study shows how the flexoelectric effect "can account for the amplification of sound in the cochlea."
Stereocilia essentially are membranes that have been rolled into tiny tubes, so "the fact that a membrane can generate acoustic [mechanical] energy is novel," says Brownell. "Imagine hearing a soap bubble talk."
Flexoelectricity in a membrane was noted a few decades ago when a researcher in Europe showed that flexing or bending a simple membrane in a laboratory generated an electrical field. Then, in 1983, Brownell showed that a hair cell from a guinea pig's ear changed in length when an electric field was applied to it in a lab dish.
-section of part of the cochlea, the fluid-filled part of the inner ear that converts vibrations from incoming sounds into nerve signals that travel to the... Click here for more information.
| || |
| || || || || |


text:
Neurons that can multitask greatly enhance the brain's computational power, study finds.
The movie "21," a fictional work loosely based on the story of the MIT blackjack team that won millions of dollars from casinos across the country, opens in theaters Friday.
Throughout the 1990s, several MIT students were part of a team that used advanced card-counting techniques to improve their chances of winning at blackjack. Their story became Ben Mezrich's book "Bringing Down the House," which served as the basis for the fictional "21."
Most notably, the character played by Kevin Spacey, portrayed as an MIT professor, is entirely fictional. While his irresponsible acts may enliven the Hollywood script, they are entirely unrepresentative of the Institute.
Those familiar with MIT should not be surprised that its students are capable of the calculations and observations necessary to outsmart casinos. In addition to its global leadership in science and engineering, MIT remains a mathematics powerhouse. As just one example, the MIT math team recently finished third at the prestigious William Lowell Putnam intercollegiate mathematics competition, garnering 21 out of the top 74 scores.
And while shots of Killian Court and other MIT exteriors dot "21," the movie was actually filmed at Boston University, at the Christian Science Center in Boston and in Las Vegas.
The careful MIT observer will notice several alumni also have small credited roles in the film, including iRobot co-founder Colin Angle '89, SM '91, who provided the movie robot; Jeffrey Ma '94; and Henry Houh '89, '90, SM '91, PhD '98.


text: 7) Knowing that fk and fz 1 both lie on a −20-dB/decade asymptote, with magnitude equal to 0 dB at fk (whether or not the asymptotes of the complete PID pass through this point) allows the construction of approximate expressions, based on Bode straight-line asymptotes, for the magnitude of the PID controller Gc (ej 2π f c, targ T s ) in terms of fk, fc,targ, fz 1, and fz 2. It can be shown that the resulting expressions, shown in Table VII, hold no matter what the relationship of fk to fc,targ, fz 1, and fz 2. The expressions of Table VII will be used here to illustrate the concept; in practice, however, appropriate scaling factors are applied to account for the deviation of the exact magnitude plots from the asymptotes at and near the locations of the zeros. The expressions of Table VII, along with the required inequality of (7), impose design constraints when inserted into the defining equation for crossover frequency Hv Gv d ej 2π f c, targ T s Gc ej 2π f c, targ T s = 1. (8) For the B1 and B2 cases, where fz 2 ≥ fc,targ, these constraints are in the formof a minimum allowed magnitude of Hv Gv d ej 2π f c, targ T s. For the A1 and A2 cases, where fz 2 < fc,targ, these constraints are in the form of a maximum allowed frequency for fz 2. Table I lists the results. REFERENCES K. J. Astrom and B. Wittenmark, Adaptive Control, 2nd ed. MA: Addison-Wesley, 1995. Authorized licensed use limited to: UNIVERSITY OF COLORADO. Downloaded on December 25, 2009 at 21:47 from IEEE Xplore. Restrictions apply. Reading, 2588 IEEE TRANSACTIONS ON POWER ELECTRONICS, VOL. 24, NO. 11, NOVEMBER 2009 K. J. Astrom, T. Hagglund, C. C. Hang, and W. K. Ho, "Automatic tuning and adaptation for PID controllers—A survey," Control Eng. Practice, vol. 1, no. 4, pp. 699–714, 1993. L. Corradini, P. Mattavelli, and D. Maksimovic, "Robust relay-feedback based autotuning for DC–DC converters," in Proc. IEEE Power Electron. Spec. Conf., 2007, pp. 2196–2202. L. Corradini, P. Mattavelli, W. Stefanutti, and S. Saggini, "Simplified model reference-based autotuning for digitally controlled SMPS," IEEE Trans. Power Electron., vol. 23, no. 4, pp. 1956–1963, Jul. 2008. J. Morroni, R. Zane, and D. Maksimovic, "Design and implementation of an adaptive tuning system based on desired phase margin for digitally controlled DC–DC converters," in IEEE Trans. Power Electron., vol. 24, no. 2, pp. 559–564, Feb. 2009. J. Morroni, L. Corradini, R. Zane, and D. Maksimovic, "Robust adaptive tuning of digitally controlled switched-mode power supplies," in Proc. IEEE Appl. Power Electron. Conf., 2009, pp. 240–246. K. J. Astrom and B. Wittenmark, "On self-tuning regulators," Automatica, vol. 9, no. 2, pp. 185–199, 1973. K. J. Astrom, U. Borrison, L. Ljung, and B. Wittenmark, "Theory and application of self-tuning regulators," Automatica, vol. 13, no. 5, pp. 457– 476, 1977. A. Kelly and K. Rinne, "A self-compensating adaptive digital regulator for switching converters based on linear prediction," in Proc. IEEE Appl. Power Electron. Conf., 2006, pp. 712–718. S. Jeong and S. Song, "Improvement of predictive current control performance using online parameter estimation in phase controlled rectifier," IEEE Trans. Power Electron., vol. 22, no. 5, pp. 1820–1825, Sep. 2007. S. Saggini, W. Stefanutti, E. Tedeschi, and P. Mattavelli, "Digital deadbeat control tuning for dc–dc converters using error correlation," IEEE Trans. Power Electron., vol. 22, no. 4, pp. 1566–1570, Jul. 2007. W. Stefanutti, P. Mattavelli, S. Saggini, and M. Ghioni, "Autotuning of digitally controlled buck converters based on relay-feedback," IEEE Trans. Power Electron., vol. 22, no. 1, pp. 199–207, Jan. 2007. Z. Zhao and A. Prodic, "Limit-cycle oscillations based auto-tuning system for digitally controlled DC–DC power supplies," IEEE Trans. Power Electron., vol. 22, no. 6, pp. 2211–2222, Nov. 2007. M. Shirazi, L. Corradini, R. Zane, and D. Maksimovic, "Autotuning techniques for digitally-controlled point-of-load converters with wide range of capacitive loads," in Proc. IEEE Appl. Power Electron. Conf., 2007, pp. 14–20. W. Stefanutti, P. Mattavelli, S. Saggini, and M. Ghioni, "A PID autotuning method for digitally controlled DC–DC boost converters," in Proc. Eur. Conf. Power Electron. Appl., 2005, p. 10. B. Miao, R. Zane, and D. Maksimovic, "Automated digital controller design," in Proc. IEEE Appl. Power Electron. Conf., 2005, pp. 2729– 2735. A. Davoudi, N. Kong, M. Hagen, M. Muegel, and P. Chapman, "A general framework for automated tuning of digital controllers in multi-phase DC– DC converters," in Proc. IEEE Appl. Power Electron. Conf., 2009, pp. 626– 630. M. Shirazi, J. Morroni, A. Dolgov, R. Zane, and D. Maksimovic, "Integration of frequency response measurement capabilities in digital controllers for DC–DC converters," IEEE Trans. Power Electron., vol. 23, no. 5, pp. 2524–2535, Sep. 2008. B. Miao, R. Zane, and D. Maksimovic, "System identification of power converters with digital control through cross-correlation methods," IEEE Trans. Power Electron., vol. 20, no. 5, pp. 1093–1099, Sep. 2005. A. V. Peterchev and S. R. Sanders, "Quantization resolution and limitcycling in digitally controlled PWM converters," IEEE Trans. Power Electron., vol. 18, no. 1, pp. 301–308, Jan. 2003. H. Peng, A. Prodic, E. Alarcon, and D. Maksimovic, "Modeling of quantization effects in digitally controlled DC–DC converters," IEEE Trans. Power Electron., vol. 22, no. 1, pp. 208–215, Jan. 2007. C. C. Fang and E. H. Abed, "Sampled-data modeling and analysis of the power stage of PWM DC–DC converters," Int. J. Electron., vol. 88, no. 3, pp. 347–369, Mar. 2001. D. Maksimovic and R. Zane, "Small-signal discrete-time modeling of digitally-controlled DC–DC converters," IEEE Trans. Power Electron., Lett., vol. 22, no. 6, pp. 2552–2556, Nov. 2007. R. W. Erickson and D. Maksimovic, Fundamentals of Power Electronics, 2nd ed. Norwell, MA: Kluwer, 2001. A. V. Oppenheim, R. W. Schafer, and J. R. Buck, Discrete-Time Signal Processing, 2nd ed. Upper Saddle River, NJ: Prentice-Hall, 1999. Mariko Shirazi (S'09) received the B.S. degree in mechanical engineering from the University of Alaska, Fairbanks, in 1996, and the M.S. degree in electrical engineering in 2007 from the University of Colorado, Boulder, where she is currently working toward the Ph.D. degree in electrical engineering. From 1996 to 2004, she was an Engineer at the National Wind Technology Center, National Renewable Energy Laboratory, where she was involved


2019年5-8月 雅思口语 Part 2 Topic 23 以前不喜欢现在感兴趣的学科 Describe a subject you didn't like before but have inte
You should say:
What it is;
When you studied the subject;
Why you didn't like it before;
And explain why you have interest in it now.
23. 以前不喜欢现在感兴趣的学科
Speaking of a subject I used to hate but like now, I would say history. I was in history classes from primary school to high school, but it never really caught my interest150. All the history teachers I had were pretty tedious151 since they just taught with textbooks. And the learning process was basically exam-oriented152. It was one of the most boring subjects I ever had. Sitting in history class was about as fun as watching paint dry153.
But things changed after I entered college. I found a talk show about history that was sensational154 on the internet. The host was Gao Xiaosong, who is also a famous music producer in
China. He has a good head for history. He loves reading historical novels and really knows history like the back of his hand. He often makes commentary for some historical movies and TV shows by going into detail about some interesting historical stories that I never learned in history class. I always listened to him with relish. It was as fun as listening to some gossip.
From his talks, I found that learning history is actually interesting and meaningful. And I gradually came to understand that it wasn't history itself that was the problem; it was just the rote learning155 of it that made me dislike history class. If I'd had a history teacher like Gao Xiaosong, I might've been a straight A student in the subject.
150 caught my interest：引起我的兴趣
151 tedious：乏味无聊
152 exam-oriented: 考试的
153 as fun as watching paint dry：形容很无聊（等着看油漆干）
154 sensational：极好的，轰动的
155 rote learning：机械学习，死记硬背


text:
Lebachia, a genus of extinct cone-bearing plants known from fossils of the Late Carboniferous and Early Permian epochs (from about 318 million to 271 million years ago). Lebachia and related genera in the family Lebachiaceae, order Coniferales (sometimes family Voltziaceae, order Voltziales), appear to be among the immediate ancestors of all extant conifers except the yews. A tree of uncertain size with pinnately arranged side branches (like the barbs of a feather), Lebachia apparently had a growth habit similar to that of the present-day Norfolk Island pine. It bore both pollen-bearing and seed-bearing cones (the latter, as detached fossils, are called Gomphostrobus) at the ends of the side branches.
Click anywhere inside the article to add text or insert superscripts, subscripts, and special characters.
You can also highlight a section and use the tools in this bar to modify existing content:
Add links to related Britannica articles!
You can double-click any word or highlight a word or phrase in the text below and then select an article from the search box.
Or, simply highlight a word or phrase in the article, then enter the article name or term you'd like to link to in the search box below, and select from the list of results.
Note: we do not allow links to external resources in editor.
Please click the Websites link for this article to add citations for


What is the Importance of Project Integration Management? | Hygger.io
Project Management
What is the Importance of Project Integration Management?
What is the Importance of Project Integration Management?
When different departments in a company work together, managing a project can be really challenging. In order to achieve the results they want, each department that works on the project is using a methodology or framework they are most comfortable with.
This makes collaboration between departments really difficult. Project challenges may also occur when working on complex projects with many parts that must eventually align.
Project integration management is what should be implemented with the aim to create harmony between departments and parts of the project.
Project integration management is the first knowledge area within the PMBOK (Project Management Body of Knowledge) guide. This knowledge area is actually the one most utilized on a day-to-day basis by experienced project managers.
So what is the importance of project integration management? How does project integration management relate to stakeholders? Why is PIM important in project management? Let's figure it out by reading this post.
Stand up meeting
What is Project Integration Management?
Integration management is the process, where a project manager receives the authority to track and coordinate all activities and functions taking place at different organization levels. It mainly focuses on ensuring proper coordination between project activities.
Effective integration management means a critical success factor for the project manager.
Project integration management ensures stability in all areas of a project such as project scope, time, costs, human resources, quality, communication, risk management, stakeholder management, procurement, and others.
These interconnected processes cannot be carried out by a single team. This is a highly valued aspect of the PMI.
Project integration management involves constant tracking of the procedures undertaken during the project lifecycle. Such integration should be focused on a given project and provide a watchful eye from the project initiation until its completion.
There are specific processes and process groups in this project management knowledge area.
What are the Key Processes of Project Integration Management?
Project integration management involves seven key processes.
1. Building a project charter
A project charter is an official doc that reflects a complete description of project deliverables and establishes project goals. The charter authorizes the project, providing PMs with the official right to apply all available project resources. It includes a summary of the project and information about the core stakeholders.
Typically, project charters are written for large and complex projects. However, any project has a charter in some form. For example, contracts, tenders, proposals, official emails, etc. If you thoroughly generate a project charter before starting project work, you will be able to run your project smoothly.
2. Maintaining project knowledge
In order to accomplish the goals, projects require specific knowledge. Different projects usually require a special team member with strong skills to carry out the work that not everyone possesses.
This can be knowledge, obtained through experience, explicit or tacit. The knowledge needed to perform the project's work in a good manner must be planned via project integration management.
3. Forming a project management plan
Agile project management and the Lean approach have allowed project managers to spend less time on planning and more time on execution. This plan is approved by sponsors. It becomes the official document that communicates to stakeholders what their expectations should be. It demonstrates how the project's goals will be accomplished. If anything changes, the project plan must be updated and re-approved.
A typical project management plan covers everything from project execution to tracking all the steps.
4. Conducting project execution
Project execution is about applying real actions. A project manager must implement project activities and monitor their execution. Managing a project team is also a part of this process. PMs should coordinate everything that happens in accordance with the project scope statement and initial plan.
5. Leading project work
This important phase involves measuring and balancing the project's progress. Project managers should be proactive in making corrections and crucial measures to eliminate the challenges and issues that can threaten the overall success. The process leads to canceling all obstacles that stop the project from achieving its goals.
6. Implementing integrated change control
Acting change controls is aimed to help project managers with their change management efforts. This is a rather difficult task, as PMs may face backlash from their teammates.
When performing change controls, you can easily approve, calculate, and direct changes in the way you need. As a result, you get advanced customer satisfaction and the ability to drive your project to success.
7. Closing project
When you have completed all project tasks and activities, delivered the outcome to customers, and received their approval, it is time to close the project.
The closure may often be skipped, for example, because funds have been depleted. However, this is one of the most significant phases to top management.
What are the Project Process Groups?
 1. The initiating process group deals with all the processes necessary for getting official approval for starting a new project. It Is about developing a project charter and a project scope statement.
 2. The planning process group generates a project plan and schedules all the activities required. It is important to know how much time each project activity would take and plan accordingly.
 3. The executing group ensures all the activities outlined in the project plan are executed in the same order. Execution of all project activities aligns with the project plan.
 4. The monitoring and controlling group collects, evaluates, and shares performance-related data to measure the progress of all project activities.
 5. The closing group works with the activities for officially closing the project. This involves delivering the final product to customers/users and getting approval from them to end the project.
Accelerate project integration management with robust software
From ordinary task management and project planning to complex resource management, Hygger helps project teams optimize collaboration and increase work velocity, empowering people to get more done.
Whether you work in construction project management, in the IT sector, education, healthcare, financial and other spheres, Hygger will make it easy to plan, manage, and report on work from anywhere, helping your team be more efficient and productive.
Create handy online Kanban boards, roadmaps, or simple to-do lists to keep your team connected and informed. This will enable project managers to get a bird's eye view of their project status and identify bottlenecks timely.
Hygger for project integration management
No Comments
Leave a Comment
Please be polite. We appreciate that.
Your email address will not be published and required fields are marked
Share via
Send this to a friend


text:
Endometriosis Diagnosis in White, Black, and Asian WomenBy: Özge Özkaya - Jun 26, 2020
There are distinct disparities in the diagnosis of endometriosis among women of different ethnic and racial origins. The authors of this article comment on the possible reasons for these disparities and the importance of recognizing them.
- This mini commentary focuses on the possible reasons for diagnostic disparities among women of different ethnic and racial origins.
- Only by recognizing and understanding the reasons for these disparities can physicians ensure all women receive an appropriate and timely referral for endometriosis diagnosis and treatment.
What's done here:
- The authors of the commentary tapped into the possible reasons why there are disparities in endometriosis diagnosis among women of different ethnic origins.
There may be several reasons why there are disparities in the diagnosis of endometriosis between white, black, and Asian women, according to the authors of the commentary. These are:
- Inconsistent symptom recognition both by patients and physicians
- Lack of a non-invasive diagnostic test
- Patient's socio-economic background and access to healthcare
- Diagnostic bias
In a commentary published in the "International Journal of Obstetrics and Gynaecology", Drs. Farland and Horne talk about a study by researchers in Canada and the Philippines, which found that black women are less likely, and Asian women are more likely to be diagnosed with endometriosis compared to white women.
According to Drs. Farland and Horne, there are many unanswered questions regarding this disparity in diagnosis. For example, it is not clear whether these associations are the result of diagnostic bias or whether there is an actual difference in the occurrence of the disease among women belonging to different ethnic groups.
Diagnostic bias is any systematic error in thinking that can influence decision making and judgment leading to a missed or inaccurate diagnosis. Historically, endometriosis has been defined as a disease affecting "high achieving women". The authors give the example of a study published in 1979 which says: "Typically, our patients with endometriosis appear to have an intense desire to excel. They are usually well-dressed and have trim figures." Today, similar views may still exist and influence clinical care, leading to disparities in the diagnosis of endometriosis, according to Farland and Horne.
Added to this, is the difficulty of diagnosing endometriosis. Women have to wait on average seven years to receive a diagnosis from the time their symptoms first appear. This is partly due to inconsistent symptom recognition by both the patient and their doctor. Another big factor is the lack of a non-invasive diagnostic test. (Laparoscopic surgery is the only way to diagnose the disease for sure.) There may be other factors contributing to the disparity in diagnosis like socio-economic background and access to private healthcare for example.
Interestingly, when the researchers focused only on women who were infertile, there was no statistically significant difference in the diagnosis of endometriosis among black, Asian, or white women. "Once patients establish access to clinical care, disparities in diagnosis diminish," Farland and Horne wrote.
The authors concluded that more research is needed to better understand the association between endometriosis and ethnicity. However, they added, disparities in access to diagnostic care must be taken into account when interpreting the results of such studies.
Research Source: _URL_
ethnicity race diagnostic bias endometriosis diagnosis