text:
User:Kernigh/chmod

chmod changes permissions of files. One must be familiar with Unix file permissions to understand this command. There are three permissions: read ("r"), write ("w"), and execute ("x"). There are three sets of permissions: for the owning user of the file ("u"), for the group of the file ("g"), and for other users ("o").

For a file, "execute" means to run it as a program. For a directory, "execute" permission is required to use anything in that directory tree, so doing anything with "/usr/share/doc/README" requires execute permissions on all of "/", "/usr", "/usr/share", and "/usr/share/doc".

If you are interested in more advanced topics like the set-uid, set-gid, sticky bits and octal numbers, try reading the FreeBSD manual page at http://www.FreeBSD.org/cgi/man.cgi (type "chmod" in the form and submit).

Options
-R recursively change or set permissions on an entire directory tree

Examples
We wrote a shell script called "configure". We make it executable ("+x") and then execute it as a command. Usually, "+x" is the same as "u+x" or "ug+x", depending on the status of the file mode creation mask. > chmod +x configure > ./configure

Only allow the owning user to run "configure": > chmod u+x configure

Deny the group and other users from running "configure": > chmod go-x configure

For all users except the owner ("gw"), disable all access to "~/mail" and "~/private" ("-rwx"). This way, the contents are private and only their owner (or root) can access them. > chmod go-rwx ~/mail ~/private

Note that in the previous example, "-R" was not specified. By disabling the execute bit ("-x"), all files inside ~/{mail,private} are protected even if their group and other read bits are enabled. Thus, simply moving some file from inside ~/{mail,private} to some public place like "/tmp" can make the files available to other users again.

The "root" user wants to set up "/usr/local/src" so that all users in group "wsrc" (including "tux") can create files there. Root will continue to own the directory. This is done by changing the group of "/usr/local/src" to "wsrc" and then by granting to the group ("g") the read, write, and execute permissions ("+rwx"). > chown :wsrc /usr/local/src > chmod g+rwx /usr/local/src

All Unix-like systems should allow all users to create temporary files in "/tmp" and "/var/tmp". Thus root gives everyone ("a", short for "ugo") all permissions ("+rwx") on the files. > chmod a+rwx /tmp /var/tmp

The problem with the above is that because all users have write access to /tmp and /var/tmp, every user can delete and rename files, even ones not created by them. For example, "tux" could create "/tmp/socket.3908" and another user could delete it or rename it to "/tmp/garbage", thus annoying Tux. To keep temporary files safe, we use the sticky bit called "t". This limits the deletion and renaming of files in /tmp to root, the owner of /tmp (also root), and the owner of the file (Tux for "/tmp/socket.3908"). It does the same for /var/tmp. So what we should do is: > chmod a+rwxt /tmp /var/tmp

Category Guide to UNIX/Commands/File system utilities

title: User:Kernigh/chmod


text:
Formal Logic/Sentential Logic/Inference Rules

= Inference Rules =

Overview
Inference rules will be formated as in the following example.

 * Conditional Elimination (CE)
 * $$(\varphi \rightarrow \psi)\,\!$$
 * $$\underline{\varphi \quad \quad \quad}\,\!$$
 * $$\psi\,\!$$

The name of this inference rule is 'Conditional Elimination', which is abbreviated as 'CE'. We can apply this rule if formulae having the forms above the line appear as active lines of text in the derivation. These are called the antecedent lines for this inference. Applying the rule adds a formula having the form below the line. This is called the consequent line for this inference. The annotation for the newly derived line of text is the line numbers of the antecedent lines and the abbreviation 'CE'.

Note. You might see premise line and conclusion line for antecedent line and consequent line. You may see other terminology as well, as most textbooks avoid giving any special terminology here.

Each sentential connective will have two inference rules, one each of the following types.

 * An introduction rule. The introduction rule for a given connective allows us to derive a formula having the given connective as its main connective.

 * An elimination rule. The elimination rule for a given connective allows us to use a formula already appearing in the derivation having the given connective as its main connective.

Three rules (Negation Introduction, Negation Elimination, and Conditional Introduction) will be deferred to a later page. These are so-called discharge rules which will be explained when we get to subderivations.

Three rules (Conjunction Elimination, Disjunction Introduction, and Biconditional Elimination) will have two forms each. We somewhat arbitrarily count the two patterns as forms of the same rule rather than separate rules.

The validity of the inferences on this page can be shown by truth table.

Negation
Negation Introduction (NI)
 * Deferred to a later page.

Negation Elimination (NE)
 * Deferred to a later page.

Conjunction
Conjunction Introduction (KI)
 * $$\varphi\,\!$$
 * $$\underline{\psi \quad \quad \ \ }\,\!$$
 * $$(\varphi \land \psi)\,\!$$

Conjunction Introduction traditionally goes by the name Adjunction or Conjunction.

Conjunction Elimination, Form I (KE)
 * $$\underline{(\varphi \land \psi)}\,\!$$
 * $$\varphi\,\!$$

Conjunction Elimination, Form II (KE)
 * $$\underline{(\varphi \land \psi)}\,\!$$
 * $$\psi\,\!$$

Conjunction Elimination traditionally goes by the name Simplification.

Disjunction
Disjunction Introduction, Form I (DI)
 * $$\underline{\varphi \quad \quad \ \ }\,\!$$
 * $$(\varphi \lor \psi)\,\!$$

Disjunction Introduction, Form II (DI)
 * $$\underline{\psi \quad \quad \ \ }\,\!$$
 * $$(\varphi \lor \psi)\,\!$$

Disjunction Introduction traditionally goes by the name Addition.

Disjunction Elimination (DE)
 * $$\varphi \lor \psi\,\!$$
 * $$(\varphi \rightarrow \chi)\,\!$$
 * $$\underline{(\psi \rightarrow \chi)}\,\!$$
 * $$\chi\,\!$$

Disjunction Elimination traditionally goes by the name Separation of Cases.

Conditional
Conditional Introduction (CI)
 * Deferred to a later page.

Conditional Elimination (CE)
 * $$(\varphi \rightarrow \psi)\,\!$$
 * $$\underline{\varphi \quad \quad \quad}\,\!$$
 * $$\psi\,\!$$

Conditional Elimination traditionally goes by the Latin name Modus Ponens or, less often, by Affirming the Antecedent.

Biconditional
Biconditional Introduction (BI)
 * $$(\varphi \rightarrow \psi)\,\!$$
 * $$\underline{(\psi \rightarrow \varphi)}\,\!$$
 * $$(\varphi \leftrightarrow \psi)\,\!$$

Biconditional Elimination, Form I (BE)
 * $$(\varphi \leftrightarrow \psi)\,\!$$
 * $$\underline{\varphi \quad \quad \quad}\,\!$$
 * $$\psi\,\!$$

Biconditional Elimination, Form II (BE)
 * $$(\varphi \leftrightarrow \psi)\,\!$$
 * $$\underline{\psi \quad \quad \quad}\,\!$$
 * $$\varphi\,\!$$

Examples
Inference rules are easy enough to apply. From the lines

 * (1)   $$\mathrm{P} \land \mathrm{Q} \rightarrow (\mathrm{S} \leftrightarrow \mathrm{T})\,\!$$

and

 * (2)   $$\mathrm{P} \land \mathrm{Q}\,\!$$

we can apply Conditional Elimination to add

 * (3)   $$\mathrm{S} \leftrightarrow \mathrm{T}\,\!$$

to a derivation.

The annotation will be the line numbers of (1) and (2) and the abbreviation for Conditional Elimination, namely '1, 2, CE'. The order of the antecedent lines does not matter; the inference is allowed regardless of whether (1) appears before or after (2).

It must be remembered that inference rules are strictly syntactical. Semantically obvious variations is not allowed. It is not allowed, for example, to derive (3) from (1) and

 * (4)   $$\mathrm{Q} \land \mathrm{P}\,\!$$

However, you can get from (1) and (4) to (3) by first deriving

 * (5)   $$\mathrm{Q}\,\!$$

and

 * (6)   $$\mathrm{P}\,\!$$

by Conjunction Elimination (KE). Then you can derive (2) by Conjunction Introduction (KI) and finally (3) from (1) and (2) by Conditional Elimination (CE) as before. Some derivation systems have a rule, often called Tautological Implication, allowing you to derive any tautological consequence of previous lines. However, this should be seen as an (admittedly useful) abbreviation. On later pages, we will implement a restricted version of this abbreviation.

It is generally useful to apply break down premises, other assumptions (to be introduced on a later page) by applying elimination rules—and then continue breaking down the results. Supposing that is why we applied CE to (1) and (2), it will likely be useful to derive

 * (7)   $$\mathrm{S} \rightarrow \mathrm{T}\,\!$$

and

 * (8)   $$\mathrm{T} \rightarrow \mathrm{S}\,\!$$

by applying Biconditional Elimination (BE) to (3). To further break this down, you might then attempt to derive $$\mathrm{S}\,\!$$ or $$\mathrm{T}\,\!$$ so that you can apply CE to (7) or (8).

If you know what line you want to derive, you can build it up by applying introduction rules. That was the strategy for deriving (2) from (5) and (6).

license: Creative Commons - Attribution Share-Alike - https://creativecommons.org/licenses/by-sa/4.0/


text:
HyperText Markup Language/Layers

Layers are not a part of HTML 4.01 or XHTML. They were a proprietary element created by Netscape. You can achieve the same effect using CSS's  property.

Confusingly, Dreamweaver has a layers feature which is functionally similar but is based on  elements styled with CSS and optionally animated with Javascript.

title: HyperText Markup Language/Layers


text:
Blender 3D: Blending Into Python/Optimize

Writing Optimal Exporters and Importers for Blender:Python
If you are starting out in writing a script, don't take these guidelines too seriously, its worth getting things working and then sight a need for optimization before you begin to look for areas to optimize your script. If you're making a tool for others, keep in mind that they might use it with larger datasets than those you have been testing with. So before releasing it can be good time to try to optimize.

For more generic python performance tips see http://wiki.python.org/moin/PythonSpeed/PerformanceTips

Getting Objects (Exporting/General Blender)
Blender.Object.Get is often used to get all objects for exporting. This is bad practice since Object.Get will return objects from every scene in Blender, this is almost never what the user wants and could result in overlapping data, but also could take a long time if the user has 2 or more large scenes consuming a lot of memory. Instead use Blender.Scene.GetCurrent.getChildren This returns all objects from the current scene. Another alternative is to use Blender.Object.GetSelected which returns selected objects on visible layers in the current scene.

Getting Mesh data (Exporting Only)
Meshes are not just thin wrappers like most of the other Types in Blender so you want to avoid meshObject.getData and meshObject.data as much as possible, its best practice only calling each mesh data once. To get the name of the data the object references do not use ob.getData.name simply to get the name of the object. Instead use obj.getData(1) ... meaning obj.getData(1=name_only) this is nice because it works for all data types, its just that Note, recently (as of 15/10/05) the addition of the Mesh module (a thin wrapper around Blenders mesh data) means that you can do a <tt>meshObject.getData(mesh=1)</tt> without the problem NMesh has, however this is new and doesn't support all the NMesh functions.

Use new python functionality mesh.transform (Exporting Only)
As of Blender 2.37 <tt>nmesh.transform(ob.matrix)</tt> can be used to transform an NMesh by a 4x4 transformation matrix. On my system it is over 100 times faster than transforming each vert's location and normal by a matrix within python. Though the overall speed gained by using this in my obj exporter was about %5. make sure that if you are exporting vertex normals add a 1, <tt>mesh.transform(matrix, recalc_normals=1)</tt> This avoids un-needed vertex normal transforming.

Beware of python hogging memory. (python generally)
You may ignore this point, for small applications, but I have found that for larger scenes this can become a problem if not allowed for early on.

A List in python (and therefore blender:python) is never deallocated, however python can re-use the memory whilst the script is running. Basically making large lists in python and a lot of recursive variable assignment can leak memory that can only be regained with a restart. - *If you can- avoid making large lists.

This is Fixed in Python 2.4.1 which will compile with blender.

List Lookup
In Python there are some tricky list functions that save you having to search through the list. Even though you're not looping on the list data python is, so you need to be aware of functions that will slow down your script by searching the whole list. myList.count(listItem) myList.index(listItem) myList.remove(listItem) if listItem in myList: ... The above functions performs a full loop on the list, so if you can avoid using them on large lists, your script will run faster.

Modifying Lists
In python we can add and remove from a list, This is slower when lists are modified in length at the start of the list, since all the data after the index of modification needs to be moved up or down 1 place. Of course the most simple way to add onto the end of the list is to use <tt>myList.append(listItem)</tt> or <tt>myList.extend(someList)</tt> and the fastest way to remove an item is <tt>myList.pop</tt> To use an index you can use <tt>myList.insert(index, listItem)</tt> and pop also takes indicies for list removal, but these are slower. Sometimes its faster (but more memory hungry) to just rebuild the list. Say we want to remove all triangle faces in a list. Rather then fIdx = len(mesh.faces) # Loop backwards while fIdx: # While the value is not 0 fIDx -=1

if len(mesh.faces[fIDx].v) == 3: mesh.pop(fIdx) # Remove the tri It is faster to build a new list with list comprehension. mesh.faces = [f for f in mesh.faces if len(f.v) != 3]

Adding list items
If you have a list that you want to add onto another list, rather then appending in a for loop, use myList.extend([li1, li2...]) instead of... for l in someList: myList.append(l) Note that insert can be used when needed, but it is slower than append especially when inserting at the start of a long list. This example shows a very suboptimal way of making a reversed list. for l in someList: myList.insert(0,l)

Removing List Items
Use <tt>myList.pop(i)</tt> rather then <tt>myList.remove(listItem)</tt> This requires you to have the index of the list Item but is faster since remove needs to search the list. Using pop for removing list items favors a while loops instead of a for loop. Here is an example of how to remove items in 1 loop, removing the last items first, which is faster (as explained above) listIndex = len(myList) while listIndex: listIndex -=1 if myList[listIndex].someTestProperty == 1: myList.pop(listIndex)

A fast way of removing items, where you can mess up the list order, is to swap 2 list items, so the item you remove is always last. popIndex = 5

myList[-1], myList[popIndex] = myList[popIndex], myList[-1]
 * 1) Swap so the popIndex is last.

myList.pop When removing many items in a large list this can provide a good speedup.
 * 1) Remove last item (popIndex)

Avoid Copying Lists
When passing a list/dictionary to a function, it is better to have the function modify the list rather then returning a new list. This means python dosn't need to create a new list in memory. Functions that modify a list in their place are more efficient then functions that create new lists. <tt>normalize(vec)</tt> faster: no re-assignment ...is faster then. <tt>vec = normalize(vec)</tt> slower, only use for functions that are used to make new, unlinked lists. Also be note that passing a sliced list makes a copy of the list in python memory eg.. <tt>foobar(mylist[4:-1])</tt> If mylist was a large list of floats, a copy could use a lot of extra memory.

Dict Lookup
When you access a dictionary item, someDict['foo'] A lookup is performed, pythons lookups are very fast, but if your are accessing this data in a loop its better to make a variable that can be referenced faster.

for key in someDict.keys: ...wip

=Strings=

Pathnames (Exporting)
Blender pathnames are not compatible with path names from other generic python modules. python native functions don't understand blenders <tt>//</tt> as being the current file dir in blender and <tt>#</tt> to be the current framenumber. A common example is where your exporting a scene and want to export the image paths with it. <tt>Blender.sys.expandpath(img.filename)</tt> Will give you the absolute path, so you can pass the path to functions from other python modules.

Correct string parsing (Import/Exporting)
Since many file formats are ASCII, the way you parse/export strings can make a large difference in how fast your program runs. When importing strings to make into blender there are a few ways to parse the string.

Passing String
Use float(string) rather then eval(string) and if you know the value will be an int then int(string) float will work for an int too but its faster if ints are converted as ints.

Checking String Start/End
If your checking the start of a string for a keyword, use... if line.startswith('vert '): ...rather then if line[0:5] == 'vert ': Using Startswith is slightly faster (about 5%). myString.endswith('foobar') can be used for line endings too. Also, if your unsure whether the text is upper or lower case use lower or upper string function. Eg. <tt>if line.upper.startswith('VERT ')</tt>

Writing Strings to a File (Python General)
Here are 3 ways of joining multiple strings into 1 string for writing This really applies to any area of your code that involves a lot of string joining. Pythons string addition. Dont use if you can help it, especially in the main data writing loop. file.write(str1 + ' ' + str2 + ' ' + str3 + '\n') String formatting. Use this when you're writing string data from floats and int's file.write('%s %s %s\n' % (str1, str2, str3)) Pythons string joining function. To join a list of strings file.write(' '.join([str1, str2, str3, '\n'])) join is fastest on many strings, string formatting is quite fast too (better for converting data types). And string arithmetic is slowest.

=Other=

Profile your code (Python General)
Simply timing sections of your code will point you to the part that needs optimizing. Eg time1 = Blender.sys.time

for i in range(10): x = i*2

print Blender.sys.time - time1

Psyco JIT Compiler (Python General)
A python module called psyco exists that can dynamically compile some of python functions. Most of the speed gains affect algorithms written in python, so importers and exporters have less to gain from them then scripts that deal with 3d math.

For many scripts, a no brainier way of using psyco is to do a. import psyco psyco.full Psyco can also profile your code. import psyco psyco.profile For scripts to be distributed it is polite to try loading psyco to avoid raising an error. try: import psyco psyco.full except: print 'For optimal performance on an x86 CPU, install psyco' Note that psyco reports to use a lot of system memory, if you run out of ram it may be best not to use psyco.

Use Try/Except Sparingly
The try function is useful to save time writing code to check a condition, However 'try' is about 10 times slower then 'if', so dont use 'try' in areas of your code that execute in a loop that runs many times (1000's or more). There are cases where using 'try' is faster than checking wether the condition will raise an error, so it is worth experimenting.

Use "is" instead of "
" === In some cases "is" can be used instead of "==" for comparison, "is not" for "!=". "==" Checks whether the 2 variables are the same value, where as "is" tests that the python object is the same, shares the same memory - are both an instance of the same object. (Python Object, not Blender a Object) The advantage of using "is" is that its faster since it dosent need to compare as much data. Here is a benchmark test that compares a python class and a blender vector- one the same and one different. from Blender import *

print '\n\nStarting benchmark.'

class a:       pass
 * 1) Test class

class1 = a class2 = a vec1 = Mathutils.Vector(1,2,3) vec2 = Mathutils.Vector(1,2,4)

f = 400000

t = sys.time for i in range(f): class1 is class1 class1 is class2 vec1 is vec1 vec1 is vec2 print ' Is Banchmark %.6f' % (sys.time - t)

t = sys.time for i in range(f): class1 == class1 class1 == class2 vec1 == vec1 vec1 == vec2

print ' == Benchmark %.6f' % (sys.time - t) print 'Done\n' My Computer showed the following results. I should do more tests- but this is representative of other tests. Starting benchmark. Is Banchmark 0.284363 == Benchmark 3.367173 Done The same test with vec1, vec2, class1, class2 as ints and floats. "is" still faster. Starting benchmark. Is Banchmark 0.272853 == Benchmark 0.322123 Done


text:
User:JMRyan/Sandbox

Logical form
We will not try to explain fully what logical form is. Both natural languages such as English and logical languages such as $$\mathcal{L_S}\,\!$$ exhibit logical form. A primary purpose of a logical language is to make the logical form explicit by having it correspond directly with the grammar. In the context of $$\mathcal{L_S}\,\!$$, a logical form is indicated by a metalogical expression containing no sentence letters but containing metalogical variables (in our convention, Greek letters). A single formula can have several logical forms of varying degrees of explicitness or granularity. For example, the formula $$((\mathrm{P^0_0} \land \mathrm{Q^0_0}) \rightarrow \mathrm{R^0_0})\,\!$$ has the following three logical forms:

 * $$((\phi \land \psi) \rightarrow \chi)\,\!$$
 * $$(\phi \rightarrow \psi)\,\!$$
 * $$\phi\,\!$$

Obviously, the first of these is the most explicit or fine-grained.

We say that a formula is an instance of a logical form. For example, the formula $$(\phi \rightarrow \psi)\,\!$$ has, among many others, the following instances.

 * $$(\mathrm{P^0_0} \rightarrow \mathrm{Q^0_0})\,\!$$
 * $$((\mathrm{P^0_0} \land \mathrm{Q^0_0}) \rightarrow \mathrm{R^0_0})\,\!$$
 * $$((\mathrm{P^0_0} \land \mathrm{Q^0_0}) \rightarrow (\mathrm{Q^0_0} \lor \mathrm{R^0_0}))\,\!$$

Formal semantics
The formal semantics for a formal language such as $$\mathcal{L_S}\,\!$$ goes in two parts.

 * Rules for specifying an interpretation. An interpretation assigns semantic values to the non-logical symbols of a formal syntax.  The semantics for a formal language will specify what range of vaules can be assigned to which class of non-logical symbols.  $$\mathcal{L_S}\,\!$$ has only one class of non-logical symbols, so the rule here is particularly simple.  An interpretation for a sentential language is a valuation, namely an assignment of truth values to sentence letters. In predicate logic, we will encounter interpretations that include other elements in addition to a valuation.

 * Rules for assigning semantic values to larger expressions of the language. For sentential logic, these rules assign a truth value to larger formulae based on truth values assigned to smaller formulae.For more complex syntaxes (such as for predicate logic), values are assigned in a more complex fashion.

An extended valuation assigns truth values to the molecular formulae of $$\mathcal{L_S}\,\!$$ (or similar sentential language) based on a valuation. A valuation for sentence letters is extended by a set of rules to cover all formulae.

title: User:JMRyan/Sandbox


text:
Chess Opening Theory/1. e4/1...e5/2. Nf3/2...Nc6/3. Bb5/3...f5

= Schliemann Defence =

The first thing to note about the Schliemann Defence, formerly known as the Jaenisch Gambit, is that it isn't a gambit. Despite the apparent similarity to the Latvian Gambit, the knight on c6 changes everything. Obviously, White can't capture on e5 immediately, and capturing on e5 after exchanging on c6 doesn't win a pawn either because the usual Ruy Lopez rejoinder ...Qd4 wins it straight back. Capturing the other way with 4.exf5 is possible but then 4...e4 would embarrass the f3-knight and lead, surprisingly, to a draw by repetition after only 7 moves.

So rather than blast the Schliemann Defence off the board, White must try to act natural and exploit the weakened Black kingside further down the line. The two moves that contribute to White's development while also defending the e4-pawn are Black's next move is going to be ...fxe4, so choosing between these two moves amounts to choosing which piece you want to recapture with. A knight on e4 would immediately invite ...d5, to which White can react with a hair-raising temporary piece sacrifice. A pawn on e4 creates the prospect of preventing Black from castling with the remarkable manoeuvre Qd1-d3-c4. A little theory goes a long way in both cases!
 * 4. Nc3, the Berger Variation, and
 * 4. d3, the Safe Variation.

Theory table
.
 * 1.e4 e5 2.Nf3 Nc6 3.Bb5 f5


text:
User talk:85.250.62.173

Hey dude! I noticed that you did some work on the Final Fantasy X page that I created. I've been looking for some help. I was wondering if you could make this your main project and help me out. Username's Americanidiot. Please contact me. See you around!

title: User talk:85.250.62.173


text:
User talk:The Visual Rhetoric Collective

this is a note.


text:
Talk:Blended Learning in K-12/Success Tips

Yet again, I forget to log in. I am 66.162.20.237 in the history. Jean Val Jean, Bob Seger, and me.

More substantively, I wonder if all the establishment of Mssr. Troha's bon fides it is effective. After several lines it seems to take over the focus of the paragraph.

_nl_

merge
I suggest merging Success Tips into Blended Learning in K-12/Success Tips. --DavidCary (talk) 16:16, 30 October 2008 (UTC)


text:
Folkstyle Wrestling

Table Of Contents

 * 1) What is Folkstyle Wrestling?
 * 2) Wrestling Rules
 * 3) /Basic Wrestling Strategy/
 * 4) /Stance and Movement/
 * 5) /Position and Control/
 * 6) /Basic Movements/
 * 7) /Basic Moves From Neutral/
 * 8) /Basic Moves From Top Position/
 * 9) /Basic Moves From Bottom Position/
 * 10) /Basic Offensive Moves From Referee's Position/
 * 11) /Basic Defensive Moves From Referee's Position/
 * 12) /Advanced Wrestling Strategy/
 * 13) /Advanced Offensive Moves From Neutral/
 * 14) /Advanced Offensive Moves From Referee's Position/
 * 15) /Advanced Defensive Moves From Neutral/
 * 16) /Advanced Defensive Moves From Referee's Position/

 * 1) Training Techniques
 * 2) /Where To Practice/

/Wrestling Websites/

title: Folkstyle Wrestling


text:
Arabic/LearnRW/Row 6/Letter-Sound

If an English word has a silent letter, that letter does not count. Think about the sound, not the English spelling when doing this exercise.

Exercise 1
Instructions: Write the Arabic letter that represents the sound that the English word starts with. examples:

 * think   ث
 * face  ف

Begin:

 * 1) this
 * zap
 * 1) damn
 * 2) think
 * 3) daisy
 * 4) boot
 * 5) family
 * 6) handsome
 * 7) case
 * 8) basic
 * 9) therefore
 * 10) wait
 * 11) weight
 * 12) doctor
 * 13) Robert
 * ram
 * 1) basic
 * 2) yawn
 * 3) doctor
 * 4) thoughtful
 * 5) there
 * 6) maybe
 * 7) might
 * 8) castle
 * 9) deaf
 * 10) king
 * 11) destruction
 * 12) camp
 * 13) them
 * him
 * yes
 * 1) mouth
 * 2) rabbit
 * 3) zipper
 * 4) fourth
 * dad
 * 1) demonstration
 * 2) third
 * 3) three
 * 4) table
 * 5) zero
 * 6) master
 * 7) distance

Exercise 2
Instructions: Write the Arabic letter that represents the sound of the English sound that the English word ends in. Because fate end in the "t" sound, write  ت (taa) beside the word. Examples:
 * fate ت

 * fat  ت

 * bluff  ف

Answers
 * 1) printer
 * 2) fake
 * 3) numb
 * 4) bath
 * 5) maybe
 * say
 * 1) jumper
 * 2) denominator
 * 3) rake
 * 4) bathe (they bathe in the pool)
 * 5) murder
 * 6) bite
 * 7) jade
 * 8) Jake
 * hay
 * 1) breath
 * 2) breathe (they breathe)
 * 3) expand
 * ate
 * 1) calculate
 * 2) number
 * 3) eight
 * 4) fate
 * 5) gulf
 * 6) golf
 * bay
 * 1) sore
 * 2) compute
 * 3) amaze
 * 4) mouth
 * rye
 * lay
 * 1) more
 * 2) random
 * 3) band
 * 4) zoom
 * 5) Dubai
 * 6) back
 * 7) wolf
 * 8) soothe
 * 9) maze
 * 10) yolk
 * 11) rate
 * 12) math
 * 13) folklore

title: Arabic/LearnRW/Row 6/Letter-Sound


text:
Arabic/LearnRW/Row 6/Letter-Sound/Answers

Exercise 1

 * 1) this-ذ
 * 2) zap-ز
 * 3) damn-د
 * 4) think-ث
 * 5) daisy-د
 * 6) boot-ب
 * 7) family-ف
 * 8) handsome-ه
 * 9) case-ك
 * 10) basic-ب
 * 11) therefore-ذ
 * 12) wait-و
 * 13) weight-و
 * 14) doctor-د
 * 15) Robert-ر
 * 16) ram-ر
 * 17) basic-ب
 * 18) yawn-ي
 * 19) doctor-د
 * 20) thoughtful-ث
 * 21) there-ذ
 * 22) maybe-م
 * 23) might-م
 * 24) castle-ك
 * 25) deaf-د
 * 26) king-ك
 * 27) destruction-د
 * 28) camp-ك
 * 29) them-ذ
 * 30) him-ه
 * 31) yes-ي
 * 32) mouth-م
 * 33) rabbit-ر
 * 34) zipper-ز
 * 35) fourth-ف
 * 36) dad-د
 * 37) demonstration-د
 * 38) third-ث
 * 39) three-ث
 * 40) table-ت
 * 41) zero-ز
 * 42) master-م
 * 43) distance-د

Exercise 2

 * 1) printer-ر
 * 2) fake-ك
 * 3) numb-م
 * 4) bath-ث
 * 5) maybe-ي
 * 6) say-ي
 * 7) jumper-ر
 * 8) denominator-ر
 * 9) rake-ك
 * 10) bathe (they bathe in the pool)-ذ
 * 11) murder-ر
 * 12) bite-ت
 * 13) jade-د
 * 14) Jake-ك
 * 15) hay-ه
 * 16) breath-ث
 * 17) breathe (they breathe)-ذ
 * 18) expand-د
 * 19) ate-ت
 * 20) calculate-ت
 * 21) number-ب
 * 22) eight-ت
 * 23) fate-ت
 * 24) gulf-ف
 * 25) golf-ف
 * 26) bay-ي
 * 27) sore-ر
 * 28) compute-ت
 * 29) amaze-ز
 * 30) mouth-ث
 * 31) rye-ي
 * 32) lay-ي
 * 33) more-ر
 * 34) random-م
 * 35) band-د
 * 36) zoom-م
 * 37) Dubai-ي
 * 38) back-ك
 * 39) wolf-ف
 * 40) soothe-ذ
 * 41) maze-ز
 * 42) yolk-ك
 * 43) rate-ت
 * 44) math-ث
 * 45) folklore-ر


text:
Diagnostic Radiology/Musculoskeletal Imaging/Dysplasia Basic/Achondroplasia

Achondroplasia is a common nonlethal form of chondrodysplasia. It is transmitted as an autosomal dominant trait with complete penetrance. De novo mutations cause 75-80% of cases. The mutation rate is estimated to be 0.000014 per gamete per generation. Cardinal features include short stature, rhizomelic shortening of the arms and legs, a disproportionately long trunk, trident hands, midfacial hypoplasia, prominent forehead (frontal bossing), thoracolumbar gibbus, true megalencephaly, and caudal narrowing of the interpedicular spaces.

Etiology
Achondroplasia is an autosomal dominant disease due to mutations in the fibroblast growth factor receptor 3 (FGFR3) gene. Most cases are due to sporadic mutations. Advanced paternal age is a risk factor.

In achondroplasia, there is a decrease in endochondral ossification, with a smaller zone of proliferating chondrocytes. Periosteal ossification, however, is not affected.

The fibroblast growth factors (FGFs) and their receptors are very important in cells growth and differentiation. The mutation in fibroblast growth factor receptors (FGFRs) result in many genetic disease. Achondroplasia is one of the most common forms of human dwarfism; it is also associated with the mutation in the FGFR3. The activation of tyrosine kinase receptors is created by two main steps. The first step is the binding of FGFs to their receptors cause the receptors to aggregate, forming adimer. In the second step, the tyrosine kinase is activated by the eggregation from step one; the phosphorylation will occurs between the tyrosine kinase and its neighbors, phosphates are added to tyrosine on the tail of the other polypeptide. The signal will be initiated; the protein is now activated. One tyrosine kinase receptor dimmer will be able to activate ten or more different intracellular proteins simultanteous. There are three main signals. The first one is the activation of the ras G protein and the MAP kinase cascade to signal to the transcription DNA. The second one is the activation of phospholipase C to make the separation of PIP2 into IP3 and DAG. The third signal is the phosphorylation of Stat1 transcription and its subsequent translocation into the nucleus. In the activation of the FGFRs, heparin has been found to have effects on the biding of FGFs to their receptors. It will help the FGFs binding together as a web and link to their receptors. There are many types of FGFRs in human body and also there will bee many types of FGFRs mutation in our body. In this article, there are three first FGFRs introduced such as: mutations in FGFR1, FGFR2 and FGFR3. Mutation in FGFR1 can cause the Pfeiffer Syndrome, a malformation syndrome, leads to the abnormal of skull and facial shape. Mutation in FGFR2 may cause three different type of syndrome such as Crouzon Syndrome, Jackson-Weiss Syndrome and Apert Syndrome. Mutation in FGFR3 can give Achondroplasia or Thanatophoric Dysplasia. The most common forms of achondroplasia are found with a very high percentage (97%) specific to FGFR3 mutation in the transmembrane of the receptors. In a normal condition of the transmembrane region of the protein, Glycine amino acid is found on DNA at the position 380. But in the mutation FGFR3, there is the absence of glycine; and at that location, there is an appearance of arginine. This is the results of a genetic mutation of glycine to arginine. The achondroplasia is caused by the mutation in FGFR3 as the “gained-of-function” mutation because the FGFRs gain their activeness. Usually, the binding of the FGF to the FGFRs will help the FGFRS becoming more active. But in the mutations of FGFRs, the FGFRs are able to be more active without binding to the FGF ligands. The FGFRs has been gain the function of the Stat1 transcription factor and its subsequent translocation into nucleus. This is the third type of signaling. Under the effects of gaining the function of Stat1 transcription factor, the more signaling of this function is the more the cell cycle is limited and inhibited, leads to the cell growth arrest. This is how “gain-of-function-mutation” affects the growth of the affected individual. The FGFRs and FGFs relate to achondroplasia as the mutation in FGFR3. Furthermore, the mutation in FGFRs is responsible to many diseases. FGFs and FGFRs have an important position in cell growth and differentiation.

Clinical Features
Achondroplasia causes proximal shortening of the limbs, short stature, relatively enlarged head with frontal bossing, and a depressed nasal bridge. The thorax is long and narrow, and is accompanied by thoracolumbar kyphosis. There is tilting of the sacrum with associated exaggeration of the lumbar lordosis. Affected individuals are of normal intelligence. Homozygous mutations are rare, and usually affect children of two affected parents. In this case, the features of the disease are more severe, and usually causes death early in life.

Communicating hydrocephalus and spinal stenosis can occur.

Radiologic Findings
A skeletel survey is useful to confirm the diagnosis of achondroplasia. Skull films demonstrate a large skull with a narrow foramen magnum, and relatively small skull base. The vertabral bodies are short and cuboidal, and there is congenitally narrowed spinal canal. The iliac wings are small and squared, with a narrow sciatic notch. The tubular bones are short and thick with metaphyseal cupping and flaring and irregular growth plates. Fibular overgrowth is present. The hand is broad with short metacarpals and phalanges, and a trident configuration. The ribs are short with cupped anterior ends. If the radiographic features are not classic, a search for a different diagnosis should be entertained.

The diagnosis can be made on by fetal ultrasound by progressive discordance between the femur length and biparietal diameter by age. The trident hand configuration can be seen if the fingers are fully extended.


text:
Arabic/Pronouns/Charts

Compact Pronoun Charts
How the following pronoun charts work: The numbers before the semicolons indicate person. 1st person is used when you are talking about yourself, 2nd person to someone, and 3rd about someone/something.

The first word, after the number is in the Singular form. A comma separating two words means the first one of those two words is masculine, the other is feminine. A semicolon indicates a change in number. After the first comma is the dual and plural forms. If they are different there will be comma separating the dual and plural forms.

Plural forms are reserved for animate objects. Dual forms are not plural forms. Plural inanimate objects are treated as feminine singular.

The feminine plural form is only used when all members of the group referred to are feminine. The same applies to the dual.

<>: < > ; < >  ; < >

Question Words: man = who mataà = when aina = where maadħaa = what (before verb) maa = what (before noun) limaadħaa = why kaifa = how li-man = whose kam = how many/how much
 * مَنْ
 * متى
 * أين
 * ماذا
 * ما
 * لِماذا
 * كَيفَ
 * لِمَن
 * كَمْ

Subject Pronouns: 1: anâ ; nahžnu 2: anta, anti ; antumaa ; antum, antunna 3: huwa, hiya ; humaa,humaa ; hum,hunna

Possessive Adjectives are always suffixed to a noun: 1: iî/-ya ; -naa 2: -ka,-ki ; -kumaa ; -kum, -kunna 3: -huú**, -haa ; -humaa,-humaa ; -hum,-hunna

Object Pronouns suffixed to verbs: 1: -nii ; -naa

Dative:  li + noun Or one of the following pronouns 1: lii/liya ; lanaa 2: laka, laki ; lakumaa ; lakum,lakunna 3: lahuu, lahaa; lahumaa, lahumaa ; lahum, lahunna

Possessive Pronouns: li + subject pronoun. Sometimes the word mulk meaning property is used.Sometimes the dative is used as a possessive noun.

Relative pronouns: (In English: which, who, that) X: Elladħii, Ellatii; ; Elladħiina,

This (default one, in English "that" is default) X: Haadħaa,Haadħihii; ;Haaŵulaa'i, That X: Dħaalika,Tilka ; ; Ulaaŷika The word "inna" usually starts sentences and joins with a pronoun in the following manner. When it doesn't begin a sentence it is best translated as "that", it has also been translated as "verily". There is no adequete way to translate it into English. The following are sometimes used instead of placing subject pronouns after "inna". 1: inna-nii (in-nii) ; inna-naa (in-naa) 2: inna-ka,inna-ki ; inna-kumaa ; inna-kum,inna-kunna 3: inna-huu,inna-haa ; inna-humaa,inna-humaa ; inna-hum, inna-hunna Using the word "in" to mean "inna" is archaic.

The word "anna" works exactly the same way. Just change the "i" to an "a". The word "laakin", meaning usually ends like inna when the subject is being mentioned, in which case it becomes "laákinna". (huwa) qaala anna-nii... He said that I... Laákin-nii... but I

The following are really close in meaning but the first kind is rarely found. Inna anâ... Inna-nii Laakin anâ... Laakinna-nii

Gender

 * f-female (The pronoun represents a woman, or a girl, or a grammatically feminine word)
 * m-masculine (The pronoun represents a man, or a boy, or a grammatically masculine word)

Note: Non-human objects, as with the case in Romance Languages, must be either masculine or feminine. For example "book" (كتاب) is masculine, and so uses the subject pronoun "هو". "Library," (مكتبة) however, is feminine, and so uses the subject pronoun "هي". However, ALL non-human plurals take the feminine singular. (e.g. libraries = هي, books = هي)

سيارة meaning "car". سيارات meaning "cars".
 * السيارة --> هي (as-saiyaarah->hiya)

 * السيارات --> هي (as-saiyaaraat->hiya)

but أم meaning "mother". أمهات meaning "mothers".
 * الأم-->هي (al-um-->hiya)

 * الأمهات-->هن (al-ummuhaat-->hunna)

title: Arabic/Pronouns/Charts


text:
Diagnostic Radiology/Musculoskeletal Imaging/Joint Disorders/Septic Arthritis

Septic arthritis is a common destructive arthropathy that requires prompt diagnosis and treatment to avoid the significant morbidity that results from the loss of a joint. Therefore, it should be strongly considered in the differential diagnosis of monoarticular disease.

Diagnosis
Traditionally, the diagnosis of septic arthritis was based on clinical assessment and prompt arthrocentesis. However, the clinical picture may be obscured by multiple confounding factors and a paucity of specific findings especially for the deep joints, i.e. the hip or shoulder. Imaging can be used to confirm the diagnosis of septic arthritis and more importantly, imaging findings suggestive of septic arthritis can direct the clinician to a diagnosis that may not have been considered.

Radiologic Findings
Plain film findings of septic arthritis include: joint effusion, soft tissue swelling, periarticular osteoporosis, loss of joint space, marginal and central erosions and bone ankylosis. CT is more sensitive than plain films for the detection of early bone destruction and effusion.

The role of MRI in the diagnosis of septic arthritis has been increasing in recent years in an effort to detect this entity earlier. Findings are usually evident within 24 hours following the onset of infection and include: synovial enhancement, perisynovial edema and joint effusion. Signal abnormalities in the bone marrow can indicate a concomittant osteomyelitis. The sensitivity and specificity of MRI for the detection of septic arthritis has been reported to be 100% and 77% respectively.

Fig. 1 Septic arthropathy right hip with joint space loss and loss of the subchondral line in the tectum of the acetabulum.

Fig. 2 Coronal STIR-weighted sequence of the hips demonstrates a large left joint effusion with perisynovial edema. Abnormal marrow hyperintensity within the proximal femur and acetubulum consistent with concomittant osteomyelitis.


text:
User:Adam C

I am a third year biochemistry major at the University of Florida.

title: User:Adam C


text:
Coding and Information Theory

Is Coding Theory Boring?
That depends on how you look at it. Everything in the universe is an encoding of something else. You can think of color, light, sound, music, teddy bears, your friends and many other things as encodings of energy.

What is coding theory?
The key idea is “most efficient”; this comes up all the time in life. For instance, "What is the best way to get to work?" or "What is the cheapest lunch?" These are really asking what is the most efficient path from one point to another, in terms of some way of measuring things.

In this article, it should be remembered the term Information is used in an abstract way. It can mean information in an ordinary sense; but it can also mean patterns, energy, sound, or a lot of other things.

So coding theory is the study of how to encode information (or behaviour or thought, etc.) in the most efficient way. It also has to do with methods of deleting noise in the environment, so that the original message can be received clearly. But this also should be done in the most efficient way.

The flow of information in the universe
Energy is constantly being transformed from one form to another. Heat to light, light to heat, potential to kinetic and so on. One can think of the entire universe as a computer and the matter as the data. So then one has a continuous data transformer. If this seems too restrictive and breeds questions about free will and so on, then one can simply look at the inanimate universe in this way.

Music
Heinrich Schenker is one of the most famous music theorists. He isn't too well known to the general public because you almost have to be a graduate student in music to understand what he is saying. It is hoped that others who have studied the theory wont frown wrathfully (like Beethoven) at the oversimplifications in this section. But hopefully more people will understand it from this point of view.

His main ideas gradually took their present form over the course of his life. His ideas were still under construction when he passed away, and it is somewhat debatable where they would have led him if he had lived to be very very old. A reasonable guess is that he would have concluded that all music exists before it is even written. As waves radiate outward when a stone is dropped into water, so music has a natural immutable form that cannot be changed; it arises from the initial disturbance of sound, just as the waves in the pond do. So the music is simply playing itself out recursively, and the job of the composer is to find the "sweep of improvisation" that plays out the initial disturbance.

His central concept is the "chord of nature"; he taught that all music arises from and falls back into this chord, just as a feedback version of fourier series and interference patterns arises from and then recedes back into a Chinese gong when it is struck. The chord itself is based on physics and is well known to scientists. But here we see an example of coding theory. That is, if the music is already there, and is simply moving back to equilibrium, then it is really looking for the most efficient path to that chord. It should not waste any energy, so to speak, and this is what gives it its beauty and natural artistry, just as rain or snow has a natural artistry. So the most profound music is an encoding of sound information that matches the Shannon entropy. (There is probability inherent in this in the sense that sound can be thought of as brownian motion, and the waves as global effects of the brownian motion).

Note that there is no error correcting in music though. If you miss it, you miss it. It would be interesting to see what Schenker would have said about communication in the presence of lots of other radios playing, horns honking, and noise in general. Perhaps he would have come up with a theory of Music in the Presence of Noise, just as Shannon did for other types of information.

Astronomy
One author asked the question "why does Copernicus seem more right than the theorists that went before him?" Both the epicycle model and the Copernican model of the solar system can be used to predict the location of the planets. He concluded that the human race feels that Copernicus is more right because his ideas are simpler - the key is simplicity. So one could say that he found a more efficient encoding of the information of the solar system, and that the human race is passionate about coding theory without even realizing it!

Politics
What makes the following political statements powerful (or at least famous)?

Ich...bin...ein...Berliner! (cheers) Ask not what your country can do for you, but what you can do for your country

One can argue that what gives these statements their force is efficiency of expression; they are an interpolation of many feelings, attitudes and perceptions;  they are an efficient encoding of emotional and mental information.

A modern example: cell phone technology
At the time of this writing cell phones are important. But cellphone text messaging costs money. So how do you minimize costs? In some third world nations, people are actually developing elaborate languages for data transmission that help them save money. For instance, one may encode the message "talk to you at 7 o'clock" as "tk 2 u @ 7" and so on. This is effective in the situation that Claude E. Shannon described as Communication Without Noise. That is, as long as the message is properly received, no harm is done. But Shannon also stated that because of the presence of noise, some redundancy may be important. He noted that the English language seems to be about 50% meaningless syntax, letters, phrasing and so on. He felt that this occurred by the natural function of the mind, the purposeful addition of excessive information that allows for error correction - by the listener or reader.

Animals also encode information efficiently in various ways. Chirps, squawks, growls, tweets, meows, woofs and even elephants' pounding on the ground in order to communicate with other elephants far away; these are all examples of encodings of information that attempt to be as efficient as possible.

At this point an interesting question about cellphone technology becomes apparent: Is there one most optimal encoding method for cellphone communication? In order to answer that effectively, one would have to average all messages sent (in a region for example), then translate the result into binary, then construct a stochastic process (essentially a computer that sends an average message in terms of probabilities of various patterns occurring) that is essentially equivalent to those messages. At that point the entropy could be calculated and a matching code developed. But the lingering problem is this: given a communication pattern (a stochastic process), how can you generate an efficient encoding scheme? In summary, one is looking for a black box that receives a stochastic process and produces a code.

average message --->  black box --->  best encoding scheme

A Powerful Solution: Neural Networks
One can design a neural network that can essentially writes programs by itself. It is possible to train a network on a large number of randomly chosen stochastic processes, while providing an increased reward for producing a more efficient code, and a decreased reward for producing a less efficient code. In many situations, the entropy can almost certainly be approximated.

Neural networks are interpolations of data. As they learn the pattern they can be more finely tuned and so on. However this is not the fun kind of interpolation that may be taught in high school as Lagrange interpolation; although an interesting game, this method involves usually a single variable and a few data points. On the other hand, neural networks can be quite intense, in the sense that the number of variables can be very large, and the number of data points can run into the millions. Therefore, there is no way of using ordinary methods to interpolate that kind of data.

Proponents of differential geometry have proposed that neural networks should be studied carefully in order to produce a solid mathematical theory that can be used to predict their behaviour exactly in every situation. But the task is very complex, and almost no hope of achieving the goal exists at the present time. So the general study remains as more of an experimental science. In practice however, networks have been used very effectively in many situations and are very intriguing.

A River of Sound
When a composer writes a song, he or she may be given the melody first, and then may want to put "chords" to it. That is, he or she is harmonizing the melody. Sometimes the person will put a nice chord to the melody at each point, but the chords will not match in the long run. Locally, the music sounds nice, but globally it sounds rather ghastly. Yet when they alter one of the chords, to make it sound nice globally, it takes away from the quality at an unexpected chord somewhere else. So you end up with a knot that is almost impossible to untangle.

The technical term is The Harmonization of Chorales. This is a standard part of musical training in universities. One can see how it may take a lot of practice and training to become good at it. (In the previous paragraph, the concept of several melodies is oversimplified to the concept "chord" in order to make it easier to read). Can computers be used to solve problems like this?

Yes, but not ordinary computers. Neural networks have been used a lot during the past decade to harmonize chorales. They have been very successful and people are putting a lot of time and energy into the study.

So you can see that global harmony is in interpolation of the sound information, in such a way as to maximize the total beauty of the music. Its a matter of efficiency. Gradually moving from one point to another with each step instantaneously optimized. This is exactly how a river flows, maximizing efficiency at each step instantaneously. (The reader may recall the use of the word Instantaneous from Calculus).

Computer Programs as Encodings
If you were going to tell a taxi driver where to go, would you take ten minutes to do so? Why not just give him the address and go? It you are going to tell a mechanic what is wrong with your car, why spend days explaining it? Why not explain it in a single sentence?

In the same way, a program that tells a computer what to do can be very wordy or very precise. This may make the difference between solving a large-scale programming project and not solving it, and it can make or break a multimillion dollar contract renewal. The process is essentially summed up as numerical analysis.

The task is to find the most efficient program (in terms of time and/or storage); a study to which people have dedicated their entire careers. There are many professional journals that deal with nothing else. But it suggests that there is pre-existing best program in nature, apart from the programmers efforts. That is, there is an entropy associated with programs, just as there is a predictable pattern of the behaviour of comets or of other entities that occur in nature.

Therefore we are having difficulty in separating the concept of 'problem to be solved' from 'solution of problem'. Again, they seem to occur as dual objects in nature, just as the behaviours of Pluto and Charon are fully dependent on each other. So a different concept of complexity was developed, and this is known as Kolmogorov's complexity. It says that the information (or light or sound) is the same as the most efficient possible program (or sentence) that generates it. But we have to find the most efficient program; so again neural networks can be used as a means of trying to solve the problem. It is interesting that a technology modeled on the human brain (a computer that exists in nature) should be used to find a solution to problems that occur in nature.

An interesting generalization of the Kolmogorov complexity is the Kolmogorov complexity for an infinite (or perhaps finite) number of parallel processors. That is, what is the most efficient sentence that generates a pattern with several processors all working at the same time? One can see how the answer will depend on the total number of processors allowed.

Geodesics and Galaxies
What is a geodesic? It's just the shortest distance from point A to point B. But isn't that just a straight line? If you are working on a flat plane, then it is. But a flat plane is just the limit of an infinite sequence of surfaces. So then what is the shortest distance on those surfaces? That's exactly the problem, and it can be a very interesting one.

Now of course one can see how this has to do with life. In every day situations, with many variables and fluctuations of data going on all the time, the most efficient path from one situation to another situation can be thought of as a geodesic. And the set of all possible situations can be thought of as a surface. Therefore the best plan of action would be the most efficient encoding of information. The poorer the encoding, the less effective the action. The better the encoding, the more effective the action. Remember that the more realistic the variables are, the more valuable the encoding will be.

For instance, if a young man wants to meet a certain woman, he doesn't want to spend 30 lifetimes accomplishing it. Therefore his plan of action can be thought of as a geodesic on the surface of all life situations, and the better he encodes that information, the more valuable his actions will be.

Another example would be a mouse learning to solve a maze. He has to repeatedly re-encode the information in his mind so that he can improve his actions. Therefore he is computing a geodesic of the information manifold of the maze.

Everything in the inanimate universe follows geodesics. This is how the galaxies rotate and what gives them their power and beauty.

title: Coding and Information Theory


text:
Talk:Blended Learning in K-12/Guiding Principles of Blended Learning

It is now 11:55 on Wednesday, 10.12.05, the deadline for this assignment. While this section is, for the most part, complete, there are a few holes in the dike.

 * references need to be included in the reference page
 * internal citations need to be edited to conform with APA conventions
 * proofing for typos, grammar, bizarre syntax, and spelling errors
 * I fear that I have omitted an important feature of bl: encouraging active learning.

Most depressingly, I'm not sure that I've achieve what I set out to do. Partly this is because there isn't a consensus of what the essential design principles for bl are. Still, I feel that all I have done is assembled a pastiche' from a few articles. I'm not sure that after reading this section a person would know what the guiding principles of bl design are.

I will fix the top stuff tomorrow, even though it is past the deadline, for the sake of acknowledging the work I used if for no other reason. As to the last two, without a major re-write I think I'm stuck with what I put together.

At least I discovered how to create tables in wiki markup.

Geoff

Final thoughts: Overall, our product is better than I thought last night. Enthusiastic pruning would help a great deal. The introductory section, Blended Learnig by Design, in particular need some serious thinning. It should be about a quarter of its current state IMHO. I think we also repeat some elements between the sections. This is true across the other chapters I have glanced at. If I was Norma, I'd want to scream if I had to look at another listing of blended learning components (mine included). All in all, a pretty good effort.

One more thing, is it just me or do citations become almost impossibly fussy? I think I understand the need to document sources with standard conventions but geez, I get tired of pondering whether or not I need a period after this phrase or if proceeding should be cited differently than an electronic article, etc. Done venting.

Geoff


text:
User talk:67.164.212.67

Jan, 01 0000
Do you think "Jan, 01 0000" is a propper date? You added Action script to the Template:Programming languages bookshelf but you did not add a propper date of when you have read the book!

--Krischik T 06:26, 13 October 2005 (UTC)

title: User talk:67.164.212.67


text:
Biblical Studies/Christianity/Protestant churches/The Reformation

The Protestant Reformation
The occasion of the outbreak of the Reformation was the sale of indulgences in Germany. It had always been a tenet of the Catholic Church that indulgences remit penalties due to sin after severe repentance and aid of the sacrament of penance. Leo X, in 15l3, being desirous to complete the great temple of Saint Peter's, which Julius II had commenced, granted an indulgence to those who would contribute financial aid for that purpose. A certain Johann Tetzel, to whom the archbishop of Magdeburg had delegated the power of dispensing indulgences in Saxony, was a well-known figure of the realm. He had been inquisitor general of Poland and was also associated with the Dominican monastery at Leipzig, but he carried out his commission in such a way that wrong ideas about the effect of indulgences began to spread among the ignorant and credulous, and many intelligent Christians opposed his methods. Martin Luther, an Augustinian monk and teacher of theology at the University of Wittenberg, was foremost among those who denounced Tetzel, and as this preacher of indulgences appeared at Juterbog in the vicinity of Wittenberg just at the time of the celebration of a yearly festival, when it was customary to post on the church doors bulletins of general interest to the parish, Luther accordingly nailed to the door ninety-five theses, on October 31, 1517, warning the people against such persons as Tetzel and emphasizing the necessity of a penitent heart and a loving spirit in making gifts to the Church. Copies of these theses were widely dessiminated, and all the continent was soon plunged into a tumult of controversy. Luther, meanwhile, devoted himself to further study of the Bible, Church history and canon law, in order to defend the position he had taken, and he drifted further and further from the Church. His public utterances and writings became bolder, and he was soon attacking the entire system and body of teachings of the Church of Rome. He maintained that contrition, confession and absolution were not necessary to secure salvation, denied the infallibility of the councils of the Church and asserted that the Bible was the only foundation of faith and that bishops, priests and formal ritual were wholly unnecessary. Owing to his wide reputation for learning and piety, his opinions on these subjects influenced a great many people.

At first the pope, Adrian VI, did not regard the matter as of serious import; but at length, being convinced that Luther's influence was becoming dangerous, he urged the Diet of Nuremberg to institute determined action against him. The Diet, however, felt powerless to carry out the desire of the pope, because of the popularity of Luther with a number of the German princes. Frederick the Elector became his great patron. His writings were, however, condemned as heretical, and he himself, if he did not recant his errors in sixty days, was to be seized and sent to Rome to be tried for heresy. Luther publicly burned this communication. In 1521 Luther was summoned by emperor Charles V to appear before the Diet of Worms and was called upon to recant his errors. Refusing to do so, he was conveyed privately to the Wartburg Castle by Frederick, elector of Saxony, where he lived in seclusion for a time and busied himself with the translation of the New Testament into German. In 1524 William Tyndale driven from England for his reformation views sought haven in Germany while translating the New Testament into English. On May 4, 1526, an alliance of the reform-minded princes was formed at Torgau, under the leadership of John (Frederick), the elector of Saxony, and Philip, the landgrave of Hesse. The Catholics formed a counter-alliance at Dessau, which emphasized a disunion that was destined to exercise an influence in every part of the world. The followers of Luther having become so numerous, Philip of Hesse convened a synod at Homburg in October, 1526, to systematize the doctrines and establish a rule of faith. A constitution was there formed which gave an individual congregation power to decide its own ecclesiastical rules. This was adopted in the several Lutheran states, in each of which the chief, or head, of the government was to be supreme in relation to the Church. In addition to John (Frederick) of Saxony and Philip of Hesse the dissenting electors included George of Brandenburg, princes Ernest and Francis of Brunswick-Luneburg, and Wolfgang, prince of Anhalt, together with fourteen imperial cities, the chief of which were Strassburg, Nuremberg, Ulm, and Constance.

Martin Luther had a keen interest in the education of the youth. Included in his ideas about local school systems was the establishment of elementary schools for the instruction of girls. To educate the younger element of the people, Luther wrote a small catechism of a doctrinal character in 1529, which was extensively circulated. The invention of the printing press spread the written works of Luther broadly over Europe and contributed to the rapidity of change. Because of the Islamic threat from Turkish incursions in southern Europe and a desire to allay, if possible, the dissensions which had arisen in relation to questions of an ecclesiastical nature, a diet was held on April 19, 1529, at Spires. The Catholics submitted what they regarded as moderate claims. The state sponsors of Luther’s revolt held out against papal supremacy. A decree was issued from Charles V of the Holy Roman Empire that the religious tolerance instituted in 1526 would be reversed. This led to vigorous protest by the followers of Luther, which was the origin of the name Protestant, referring to states or territories in the religio-political sense. That name has since been applied to Lutherans and other Christian denominations who differ with the doctrines of the Roman Catholic Church.

Return to Protestant churches page


text:
Talk:ActionScript Programming

merge
Actionscript is not exhaustive enough to be a book on it's own and schould be merged into to the Programming book.

This page should be a #REDIRECT.

--Krischik T 06:49, 13 October 2005 (UTC)

 * Forget it, I think this whole thing should just be removed. Another more competent team is working on a bigger lesson guide at WikiVersity. Can redirects be done to other wiki projects?

 * --205.151.163.28 14:58, 29 September 2006 (UTC)

ActionScript 3 was released as part of Flash CS3 not CS4, also consider talking about the origins of actionscript in relation to javascript as part of ECMA script in the introduction. —Preceding unsigned comment added by 85.195.139.202 (discuss • contribs) 06:54, 3 April 2009
 * You can fix the CS3/4 issue directly by a simple edit. However, the origin being ECMA is a bit more in-depth and can be researched later. --Sigma 7 (talk) 14:53, 4 April 2009 (UTC)

Oppose merger. There are lots of books, at least in 2010 anyway, about ActionScript. Don't know about 2005, when I was just a 7-year-old. Kayau ( talk | email | contribs ) 07:24, 19 July 2010 (UTC)

title: Talk:ActionScript Programming


text:
Cookbook:Tomato Coulis

Ingredients

 * Onions, chopped
 * Garlic, minced
 * White granulated sugar
 * Tomatoes, chopped
 * Herbes de Provence
 * Vinegar (optional)

Procedure

 * 1) Fry onions in olive oil until translucent. Ensure that the onions don't burn.
 * 2) Add lots of minced garlic. Again, ensure it doesn't burn.
 * 3) Add a large amount of sugar. Don't caramelise it.
 * 4) Add tomatoes to onions and garlic, along with additional olive oil.
 * 5) Simmer for approximately 4 hours to lose as much water as possible.
 * 6) Add salt, pepper, herbes de Provence, and vinegar.

title: Cookbook:Tomato Coulis


text:
Diagnostic Radiology/Musculoskeletal Imaging/Trauma/Lisfranc fracture-dislocation

The Lisfranc joint, named after a field surgeon in Napoleon's army who described a new technique of forefoot amputation for soldiers with gangrene related to frostbite, defines the boundary between the midfoot and forefoot. The joint can be disrupted traumatically by axial loading, with rotational forces directed either medially or laterally. This classically occurs when patients get their foot caught in something, such as stirrups when horse riding. Disruption of the lisfranc joint is also seen in the Charcot joint in diabetics.

Clinical Presentation
The presention of patients with a traumatic lisfranc injury is variable depending on its severity. While some patients will present with obvious physical foot deformities, others may present with only midfoot pain with weight bearing. The typical clinical signs include midfoot plantar echhymosis, midfoot instability, and pain along the TMT joints with motion.

Anatomy
The 5 TMT joints form the Lisfranc joint. Important ligaments transverse these joints, critical for support and strength. Ligaments connect the bases of each of the metatarsals to each other, except the first two. There is also an oblique ligament between the medial cuneiform and the base of the 2nd metatarsal.

Radiologic Findings
The initial radiological work-up consists of an AP, lateral, and medial oblique views. If these views fail to demonstrate a lisfranc injury and there is high clinical suspicion, getting full weight bearing views or stress views if the patient is unable to weight bear is essential. A CT scan can also be obtained, which may show an occult injury.

The following should be considered when evaluating radiographs for a Lisfranc fracture-dislocation:
 * 1) Perhaps the most important alignment is along the second metatarsal and second cuneiform. A step-off between these two bones is indicative of a Lisfranc disruption.
 * 2) Malalignment of the fourth metatarsal and cuboid can also be diagnostic of a Lisfranc injury.
 * 3) The medial cuneiform-second metatarsal space should be evaluated for the "fleck sign" indicating avulsion of the Lisfranc ligament.

Fig. 1 Example of a Lisfranc fracture, demonstrating incongruity of the medial shaft of the 2nd metatarsal and middle cuneiform.

Fig. 2 Lisfranc fracture demonstrating lateral dislocation.

Fig. 3 Lisfranc fracture demonstrating medial dislocation of the 1st metatarsal.

Treatment
Anatomically stable injuries can be treated conservatively, whereas unstable injuries or malalignment requires surgery. Generally, surgery involves open reduction and fixation with screws across the affected TMT joint(s). Screws are typically left in for 6 months.