text:
CA Unicenter NSM Textbook

Reference Guide To CA Unicenter NSM 3.1 (and TNG 2.2, 2.4 and TND 3.0)
This aim of this book is to be the solid reference to Unicenter NSM that you always wished you had every week you work with this tool, and to demonstrate real world ways to deliver value from a toolset that is enormous, complex and deeply mysterious to most of its users.

The book aims to cover:
 * Unicenter NSM procedures with worked examples
 * its obscure command line utilities, and their syntax, with examples that work
 * hiterto unknown or lost sources of knowledge about this product
 * how to leverage "field developed utilities"
 * how to work around all the things in the product which work in a less than ideal manner in your environment.

At this point the initial contributors envisage these sections below.

Tips on understanding the architecture
This section should include architectural level content that describes how the product works for example, what each element such as the enterprise manager, DSM does, and how they relate to each other. Often understanding the NSM framework is like peeling an onion over many years, each layer of understanding reveals another question.

Top ways to deliver value from the suite
With an admin manual running to thousands of pages it can be daunting to see how to get value quickly from the toolset.

Command reference
An encyclopedia of NSM commands, each command should have as much detail as possible about:
 * its category and usage
 * what versions of NSM it works on
 * when you might want to use it
 * some examples of use

CA Unicenter NSM Textbook/Command Reference

Tools and how to use them
An encyclopedia of NSM tools and utilities, each tool description should have as much detail as possible about: - its category and usage - what versions of NSM it works on - when you might want to use it - some step by step procedures

Other reference information
Any miscellaneous information about the tool such as tcp/ip port usage, traffic size analysis etc. CA Unicenter NSM Textbook/Other Reference Information

Workarounds to common challenges
- how to guides to customise your way out of sticky challenges. CA Unicenter NSM Textbook/Issues and Workarounds

A faq section
- how to question and answer for common problems. CA Unicenter NSM Textbook/FAQ

Links to other info sources
Expose your treasure store of useful sources to the world! CA Unicenter NSM Textbook/Useful Links

title: CA Unicenter NSM Textbook


text:
Rebol Programming/Language Features/Objects

Objects
Objects are a very common way to manage and access data in Rebol. In fact most of the Rebol system is built with objects. The SYSTEM object can be considered the spine of Rebol, the place where all non-core functions and data reside. It's the place you can find all of VID, the various networking protocols and all mezzanine functions.

Using Objects
Objects are made with the MAKE function.

Example:

>> shopping-basket: make object! [fruits: 5 vegetables: 3] >>

Note that nothing is returned on the console. Objects can hold all types of data, even other objects.

A bigger example, as you'd normally write it in your program code:

shopping-basket: make object! [  fruits: 5 vegetables: 3 dairy-products: 7 ]

Accessing Objects
If you want to view an object, you might have noticed that typing the name in doesn't return anything:

>> shopping-basket >>

You can use different methods for viewing the object data:

>> probe shopping-basket make object! [  fruits: 5 vegetables: 3 ]

A nicer overview can be returned with:

>> ? shopping-basket SHOPPING-BASKET is an object of value: fruits         integer! 5    vegetables      integer! 3    total           integer! 8

Or:

>> print dump-obj shopping-basket fruits         integer! 5    vegetables      integer! 3    total           integer! 8

These functions can't be used in programs to get values from an object, since they only print information in the console. They don't produce a return value.

One way is to use path notation:

>> shopping-basket/fruits == 5

There are multiple ways to access object data, both for manipulation and viewing.

Referring to Self
An object can refer to itself or other variables and functions within itself using SELF:

>> shopping-basket: make object! [fruits: 5 vegetables: 3 total: self/fruits + self/vegetables] >> shopping-basket/total == 8

Note, that the usage of SELF in the above example is not necessary, though.

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


text:
Cookbook:Feijão Tropeiro (Brazilian Beans and Sausage)

Feijao tropeiro is a traditional side dish in many parts of Brazil.

Ingredients

 * 2 lbs pinto beans
 * 2 lbs sausage of your choice (mild Italian is good in this dish)
 * 2 cloves garlic
 * 2 small yellow onions
 * ½ pound slab bacon
 * 4 hard boiled eggs
 * 1 bunch green onions, chopped
 * 1 bunch collard greens
 * 2 tbsp olive oil

Procedure

 * 1) Prepare beans according to their package. Drain and set aside to cool.
 * 2) In large pan, cook bacon and sausage. Remove sausage and bacon.
 * 3) Slice sausage into 1 inch-thick pieces.
 * 4) In the pan with bacon grease, sauté white onion and garlic.
 * 5) Slice collard green into small (⅛-inch) strips.
 * 6) Mix all ingredients except hard-boiled eggs in large bowl using a wooden spoon.
 * 7) Drizzle with olive oil and stir gently.
 * 8) Garnish with sliced boiled eggs.
 * 9) Serve hot or cold.


text:
Cookbook talk:Feijão Tropeiro (Brazilian Beans and Sausage)

Feij�o Tropeiro authors and history
= From Wikipedia:Talk:Feij�o Tropeiro =
 * 2005-11-23 04:12:28 User:Drini (afd)
 * 2005-11-21 04:37:17 User:152.163.100.8
 * 2005-11-21 04:31:04 User:152.163.100.8


text: User talk:68.117.34.34

title: User talk:68.117.34.34


text:
User talk:71.137.122.98

Please stop adding nonsense to Wikibooks. It is considered vandalism. If you would like to experiment, use the sandbox. Thank you.

title: User talk:71.137.122.98


text:
Blender 3D: Noob to Pro/FAQ

The following questions cover general information about Blender 3D: Noob to Pro and the software it is designed to teach, Blender.

What is Blender?
Blender is a full-blown 3D content creation suite, usable for 3D editing, animation, texture mapping, compositing and rendering; as well as 2D video and audio editing/sequencing.

It runs on:
 * Windows 8.1, 10, and 11
 * macOS 10.13 Intel · 11.0 Apple Silicon
 * Linux — Intel x86 and AMD, 32- and 64-bit
 * and more!

It is free, open-source software, available from blender.org.

Blender 3.4.1 is the latest stable release as of January 2023. Beginners are urged to learn using stable versions 3.0 or later, since they differ greatly from prior versions. However, keep in mind that many existing tutorials were written for 2.49. If you're having trouble finding a button or tool that has moved, try pressing Spacebar to search for Blender functions.

For more about Blender's history, functionality, and media productions which have utilized Blender, see the Blender entry in Wikipedia.

What is this book? And what isn't it?
Noob to Pro is a collection of tutorials. Following these tutorials you can go from a new Blender user (or a noob) to proficient power user (pro). Though the tutorials are not strictly linked, we recommend going through them in order. Earlier tutorials introduce skills and information you'll be expected to know in later sections.

Noob to Pro isn't a compendium or reference manual. Use it with other resources, including those in Blender's Help menu. Noob to Pro provides links to outside resources. We're part of the Blender community!

How accurate is the information in this book?
Blender is under continuous development! Its appearance, tools, and capabilities change from time to time, with each update bringing new features and making old ones obselete.

Even though most of the tutorials were designed for Blender versions 2.4-2.7, the general gist of each module can be applied to current versions. For example, when making a simple person, you'd still need a cube and you'd still need to extrude the faces. However, since it's so outdated, it shuold no longer be used as a general guide for learning Blender. Blender 3D: Noob to Pro readers are encouraged to edit the WikiBook in order help to keep it up to date.

I have a question, where can I get help?
Google is your friend! Try searching it up on google to see if someone has asked the same or a similar questiotn! You can also search or post questions at BlenderArtists a large, easy-to-use, English-language forum. Along with that, BlenderWiki contains a large database of documentation. Find similar forums in other languages at blender.org's community page. The discussion pages there are also useful.

If your question turns out to be very common, please take a moment to see if it can be added to the book! It is best if it can be smoothly incorporated with an existing page.

title: Blender 3D: Noob to Pro/FAQ


text:
Ada Programming/Libraries/Ada.Directories

is a unit of the Predefined Language Environment since Ada 2005. It allows various manipulations and queries of the filesystem directories.

Introduction
If the environment supports the notion of files and directories, it is possible to manipulate these in a way that is fairly OS agnostic using the.

This is a very implementation dependent package and, as such, the information that can be extracted about files and directories is kept very basic. If further information is needed (owner, group, and so on), a child package should be created for this, as can be read in the implementation advice from the Ada Reference Manual :

"If other information about a file (such as the owner or creation date) is available in a directory entry, the implementation should provide functions in a child package Directories.Information to retrieve it."

Short Use Tutorial
This section gives a quick overview on the use of the  package. If it is not detailed enough, you can also follow the Detailed Use Tutorial.

Traversing Directories
Changing the current working directory is done with. The remaining functions are fairly self-explanatory with the exception of, which returns the name of the directory containing the given directory.

Current_Directory String Set_Directory Directory  String Exists Name  String  Boolean Containing_Directory Name  String  String

Enumerating Directory Entries
This example enumerates the all the entries in the current working directory, that end in ".gpr". The  procedure is used to start enumerating a directory. It will To remove the filter criteria you can pass an empty string. Iterating through the directory involves calling  to return the next directory entry and   to check for more entries. Once the search is complete, call.

Search_Type Directory_Entry_Type Start_Search Search      Search_Type Directory  String Pattern    String Filter     Filter_Type    True Get_Next_Entry Search   Search_Type Directory_Entry   Directory_Entry_Type More_Entries Search  Search_Type  Boolean End_Search Search   Search_Type

The resulting Directory_Entry_Type has a full name, simple name, size, kind, and modification type.

Simple_Name Directory_Entry  Directory_Entry_Type  String Full_Name Directory_Entry  Directory_Entry_Type  String Kind Directory_Entry  Directory_Entry_Type  File_Kind Size Directory_Entry  Directory_Entry_Type  File_Size Modification_Time Directory_Entry  Directory_Entry_Type  .Time

Main Dir Directory_Entry_Type Dir_Search Search_Type Curr_Dir string  Current_Directory Put"Current Directory: " Put_LineCurr_Dir Start_SearchSearch Dir_Search Directory Curr_Dir Pattern "*.gpr" Get_Next_EntryDir_Search Dir PutFull_NameDir Set_Col50 KindDir Ordinary_File PutSizeDir Set_Col60 Put_LineKindDir More_EntriesDir_Search End_SearchDir_Search Main

Directory Manipulation
Creating a directory is done with. creates all the directories in the path. The directory path on GNAT Ada can contain either "\" or "/" characters. renames a directory or file within a directory.  deletes an entire hierarchy of directories and files. deletes an empty directory (non-empty directories throw a  exception.    deletes an ordinary file in a directory.  Note that the   parameters is implementation specific.  On the version of GNAT Ada I'm using, it can only be used to set the encoding.

Create_Directory New_Directory  String Form   String  "" Create_Path New_Directory  String Form   String  "" Rename Old_Name New_Name  String

Delete_Tree Directory  String Delete_Directory Directory  String Delete_File Name  String

Below is a simple example that creates a set of directories and iterates through those directories. Note that it runs on both Windows and Linux with the "/" path separator. The returned path separators are appropriate to the filesystem (e.g. Windows return "\").

Main Dir Directory_Entry_Type Dir_Search Search_Type Start_SearchSearch Dir_Search Directory  Curr_Dir Pattern  "" Create_Path"Foo" Create_Path"Bar/Baz/Qux" Get_Next_EntryDir_Search Dir Put_LineFull_NameDir More_EntriesDir_Search End_SearchDir_Search Delete_Directory"Foo" Delete_Tree"Bar" Main

Exceptions
is raised if a directory entry is invalid or when enumerating directories past the last directory. is usually thrown if the directory or filename is not able to identify a file or directory (either non-existent or invalid depending on context). is thrown if directories are not supported or directories are not traversable.

Status_Error   .Status_Error Name_Error     Name_Error Use_Error      Use_Error Device_Error   Device_Error

Detailed Use Tutorial
This article will be based on a small program,, to which we will add functionality as we progress through the various functions, procedures, and types. In its most basic form, all it does is output the current default directory:

When running the above program, you should see output somewhat similar to this:

Starting default directory: /home/thomas/wiki_examples/aDir

Rather than the above path, you should see the path of the directory from which you launched  on your system.

Directory and File Operations
When working with files and directories, some basic functionality is required. We must be able to move to a specific directory; we must be able to copy, rename, and delete both files and directories; and we must be able to create new directories. Luckily, this is exactly what the next function and procedures enable us to do.

Current_Directory
The specification for  looks like this:

We've already seen how  works, but there are a few things yet that are worth mentioning about

 * returns the full directory name for the current default directory. This does not equal the directory where the program itself resides.
 * The directory name returned is suitable for use by the Set_Directory procedure.
 * The exception  is propagated if a default directory is not supported by the operating system/environment.

When we executed the basic  program above, the output was the path to where the   program resides on my system. But lets see what happens if we invoke the program from somewhere else:

$ pwd /home/thomas/wiki_examples/aDir $ ./adir Starting default directory: /home/thomas/wiki_examples/aDir $ cd && pwd /home/thomas $ wiki_examples/aDir/adir Starting default directory: /home/thomas

As you can see,  does not equal the path to the actual program. Instead it returns the current default directory, which is entirely implementation dependent. In the above example, it varies depending on where from the program is invoked. So unless you've specifically set the default directory using Set_Directory, you cannot be 100% sure what path  will return.

The second bullet-point is self-explanatory and the third is impossible for me to test, as I currently don't own a system that does not support the notion of a directory.

Set_Directory
The specification for  looks like this:

With  we're able to change the current default directory. Add this little bit of code to the body of the  program to see how it works:

If we execute the program now, we get this:

Starting default directory: /home/thomas/wiki_examples/aDir New default directory: /home/thomas

If the directory you're trying to set doesn't exist, a  is raised. Lets see how that works:

If you add the above snippet to the core  program, you will get output that looks something like this:

Starting default directory: /home/thomas/wiki_examples/aDir Directory does not exist.

Since the directory set by the  does not exist, the   exception is raised and caught. You should not, however, habitually use  to check if a given directory exists. For this simple task we have the Exists function.

Create_Directory
The specification for  looks like this:

With this procedure we can, to nobody's surprise, create new directories. But before we try it out, we will first deal with the  parameter. The RM has this to say about it:

"The Form parameter can be used to give system-dependent characteristics of the directory; the interpretation of the Form parameter is implementation-defined. A null string for Form specifies the use of the default options of the implementation of the new directory."

For my specific environment (Slackware 12.1 and GNATMAKE GPL 2008 compiler) the  parameter does precisely nothing. This might not be the case for other implementations, but I'm fairly certain that for most standard systems (Unix, Linux, BSD, Windows)  is not used. Thus,  should be a null string, unless you're on a platform where the implementation defines the use of.

But enough about that - lets add some code to  to see how   works:

With that one line of code added to the program, we can see how the program by doing a little test:

$ ls -l -rw-rw-rw- 1 thomas users   502 2009-09-24 22:09 Proj.gpr -rwxr-xr-x 1 thomas users 578199 2009-09-29 22:03 adir* -rw-rw-rw- 1 thomas users   517 2009-09-29 22:03 adir.adb drwxr-xr-x 2 thomas users     0 2009-09-29 22:03 objects/ $ ./adir Starting default directory: /home/thomas/wiki_examples/aDir $ ls -l -rw-rw-rw- 1 thomas users   502 2009-09-24 22:09 Proj.gpr -rwxr-xr-x 1 thomas users 578199 2009-09-29 22:03 adir* -rw-rw-rw- 1 thomas users   517 2009-09-29 22:03 adir.adb drwxr-xr-x 2 thomas users     0 2009-09-29 22:03 objects/ drwxr-xr-x 2 thomas users     0 2009-09-29 22:23 some_dir/ $ cd some_dir/ $ ../adir Starting default directory: /home/thomas/wiki_examples/aDir/some_dir $ ls -l drwxr-xr-x 2 thomas users 0 2009-09-29 22:25 some_dir/

As you can see from the above,  creates the new directory in the current default directory which, in this case, is the directory from where we invoke. In case we want to create the  directory in a directory other than the current default, we're going to have to add another line of code prior to the   line:

You should of course substitute the above path with something that fits your system.

Next we delete the already created  directories, and then we try the same chain of commands as before:

$ ls -l -rw-rw-rw- 1 thomas users   502 2009-09-24 22:09 Proj.gpr -rwxr-xr-x 1 thomas users 578224 2009-09-29 22:32 adir* -rw-rw-rw- 1 thomas users   635 2009-09-29 22:32 adir.adb drwxr-xr-x 2 thomas users     0 2009-09-29 22:32 objects/ $ ./adir Starting default directory: /home/thomas/wiki_examples/aDir $ ls -l -rw-rw-rw- 1 thomas users   502 2009-09-24 22:09 Proj.gpr -rwxr-xr-x 1 thomas users 578224 2009-09-29 22:32 adir* -rw-rw-rw- 1 thomas users   635 2009-09-29 22:32 adir.adb drwxr-xr-x 2 thomas users     0 2009-09-29 22:32 objects/ drwxr-xr-x 2 thomas users     0 2009-09-29 22:40 some_dir/ $ cd some_dir/ $ ../adir Starting default directory: /home/thomas/wiki_examples/aDir/some_dir raised ADA.IO_EXCEPTIONS.USE_ERROR : creation of new directory "some_dir" failed

Our program fails at creating the  directory the second time, because it already exists, proving that the program no longer creates   wherever we invoke the program. This is exactly what we wanted, though we should probably add some code to catch the exception, instead of just letting the program crash:

Now lets try that last command again:

$ ../adir Starting default directory: /home/thomas/wiki_examples/aDir/some_dir Directory cannot be created.

Much better!

Besides, there's also  , which is raised if the name given isn't a valid directory. Let's try and change  to something that is obviously not going to cut it as a directory name: An empty string. We just need to change one line in the program:

To

Now, running the program we get:

Starting default directory: /home/thomas/wiki_examples/aDir/some_dir raised ADA.IO_EXCEPTIONS.NAME_ERROR : invalid new directory path name ""

We can catch  by adding one more exception handler:

Running the program we now get this:

Starting default directory: /home/thomas/wiki_examples/aDir Directory is not valid.

Perfect.

Delete_Directory
The specification for  looks like this:

With  you can delete a directory which is empty and for which the program has sufficient permissions. The  parameter accepts both a single named directory or the full path to a directory. In the case of a single name, the current default directory is prepended to create a full path.

Add these lines to the basic  program to see it in action:

Executing this program, we get the following output:

$ ./adir Starting default directory: /home/thomas/wiki_examples/aDir New default directory: /home/thomas/wiki_examples/aDir some_dir exists. some_dir2 exists. $ ls -l -rw-rw-rw- 1 thomas users   502 2009-09-24 22:09 Proj.gpr -rwxr-xr-x 1 thomas users 578224 2009-09-30 16:13 adir* -rw-rw-rw- 1 thomas users   973 2009-09-30 16:14 adir.adb drwxr-xr-x 2 thomas users     0 2009-09-30 16:13 objects/

The example shows that  does indeed work with both the full path to the directory and with just the directory name. The two  calls are just there to help visualize the fact that the directories are, in fact, created.

The  exception is raised if the   string does not match an existing directory and the   exception is raised if the directory cannot be deleted or if it isn't empty. Add this code to the core  program:

And the output is:

Starting default directory: /home/thomas/wiki_examples/aDir Directory not found. Cannot delete non-empty directory.

As expected. In order to delete non-empty directories, you will have to use the Delete_Tree procedure.

Create_Path
The specification for  looks like this:

With  it is possible to create nested directories, even if the parent directories do not exist. It is much like issuing a  command, where the entire path is created, all the way down to the   directory.

Just as with its sibling, the   parameter is used for implementation specific characteristics. A null string specifies the use of the implementation's default options for creating new directories.

To create the directory  all we have to add to the   program is this:

And the output is:

Starting default directory: /home/thomas/wiki_examples/aDir this/is/a/new/directory exists!

If the path already exists when calling, the procedure simply do nothing.

works relative to the current default directory, unless the  given describes a path starting from the root of a filesystem, i.e. / for *nix systems and c:/ for a Windows system. To create the  in , all we have to do is add   to the   string:

So if the path is relative, the current default directory is used as the base, but if the path is absolute, the current default directory is ignored and the path is created entirely from the parameter.

The two exceptions,  and , are raised under the same circumstances as     if the   string does not identify a directory, and   if the program is not able to create any one of the directories, for example due to permission issues.

Delete_Tree
The specification for  looks like this:

enables us to delete directories and their contents in one fell swoop, so if we build on the example from Create_Path, we can delete the  tree by adding this to the program:

And the output is:

Starting default directory: /home/thomas/wiki_examples/aDir this/is/a/new/directory exists! this/is/a/new/directory does NOT exist!

The two exceptions  and   are also available to us. They work as expected, with  being raised if the   doesn't exist and   being raised if   can't be deleted for some reason or another. There's an important note about this behavior in the RM:

"The exception Use_Error is propagated if the external environment does not support the deletion of the directory or some portion of its contents with the given name (in the absence of Name_Error). If Use_Error is propagated, it is unspecified whether a portion of the contents of the directory is deleted."

It is important to pay special attention to the last sentence: it is unspecified whether a portion of the contents of the directory is deleted.

What this means, is that a  can be raised, but that wont necessarily mean that the directory and its contents are 100% intact. Some of it may very well have been deleted.

Finally, it should be mentioned that  looks for   in the current default directory, unless an absolute path is given.

Delete_File
The specification for  looks like this:

works much the same as Delete_Directory, it just deletes files instead of directories. Files, in the context of  can be either an ordinary file or a special file:

"External files may be classified as directories, special files, or ordinary files. A directory is an external file that is a container for files on the target system. A special file is an external file that cannot be created or read by a predefined Ada input-output package. External files that are not special files or directories are called ordinary files."

The usual exceptions also apply to.

Lets create a new file:

$ touch some_file

And now add this to the basic  program:

The output is:

Starting default directory: /home/thomas/wiki_examples/aDir some_file exists some_file does NOT exist

And the  file is gone.

Here's an example where we (A) don't have the proper permissions to delete the  file and (B) try to delete a non-existent file:

The output should look like this:

Starting default directory: /home/thomas/wiki_examples/aDir some_file exists Cannot delete some_file File does not exist some_file still exists

And with that, we conclude our look at.

Rename
The specification for  looks like this:

The  procedures renames both directories and files, providing that the   doesn't already exist. The  exception is raised if   does not match a directory or file, and   is raised if the directory/file cannot be renamed. In the following example, we will assume the existence of the directory  and the file.

First we will add a procedure to the declarative part of the  program:

This procedure is just a bit of sugar to the program. It's mainly here to avoid having to repeat the  block over and over.

Next we'll add a few lines to the body of the program:

The output from this is:

Starting default directory: /home/thomas/wiki_examples/aDir No, some_new_dir does not exist No, some_new_file does not exist Yes, some_new_dir exists Yes, some_new_file exists

Renaming files and directories just doesn't get any easier than this.

Copy_File
The specification for  looks like this:

copies the contents of an existing file,, to a new file named. The result is a duplicate of the source file. does not copy directories. Only ordinary files are copied. As noted earlier, the  parameter is only used if the implementation requires it. Here's what the RM has to say about :

"The Form parameter can be used to give system-dependent characteristics of the resulting external file; the interpretation of the Form parameter is implementation-defined."

In order to copy  to , all we have to do is add this line to the body of the   program:

Please note that if  already exists, it will be overwritten. The usual exceptions,  and , also apply to

is raised if a  or   does not properly identify a file. is raised if the action fails; the files are there, but for some other reason, copying is not possible.

Name Operations
The following six functions do not interact with the file system at all. They just manipulate strings. Armed with these functions, we are able to build file path strings, extract file names from paths, extract file extensions and discover the name of the directory containing a file.

Full_Name
The specification for  looks like this:

returns the full path to a given. The  parameter can be both a single filename, a relative path to a file or an absolute path. does not care about whether the file actually exists or not. It is only concerned with returning a proper full path. The RM has this to say about it:

"Returns the full name corresponding to the file name specified by Name. The exception Name_Error is propagated if the string given as Name does not allow the identification of an external file (including directories and special files)."

When I first read that, I thought that the sentence The exception Name_Error is propagated if the string given as Name does not allow the identification of an external file meant that  would be raised if the given   parameter could not be resolved to an actual existing file. This is, however, not the case. Instead it means that  is raised if   is malformed.

Lets see how it works:

And the resulting output:

Starting default directory: /home/thomas/wiki_examples/aDir /home/thomas/wiki_examples/aDir/foo /home/thomas/wiki_examples/aDir/foo/bar /home/thomas/stuff New default directory: /tmp /tmp/foo /tmp/foo/bar /home/thomas/stuff Name parameter is malformed

As with all the other functions and procedures which depend on the current default directory, the  parameter is appended to the current default directory if   is relative, whereas the current default directory is ignored if   is an absolute path.

Simple_Name
The specification for  looks like this:

Where  returns the entire path to a file,   returns the simple name component of a path. So given the  parameter , it will return. The  exception is raised only if   is malformed. Lets see an example:

And the output is:

Starting default directory: /home/thomas/wiki_examples/aDir foo bar stuff Name parameter is malformed

Quite handy.

Containing_Directory
The specification for  looks like this:

removes the simple name of the  path given. Lets see it in action:

And the output is:

Starting default directory: /home/thomas/wiki_examples/aDir /home/thomas/wiki_examples/aDir foo /home/thomas Name_Error raised. Malformed Name. Use_Error raised. No containing directory.

As expected. Notice that the  is raised only when the given   parameter does not have a containing directory.

Extension
The specification for  looks like this:

If you want to extract the extension of a file, this function is what you need. Here's an example on usage:

And the output:

Starting default directory: /home/thomas/wiki_examples/aDir txt conf Name_Error raised. Malformed Name.

As you can see, if there are no extension (the foo/bar line), a null string is returned. The  exception is raised when the   parameter is malformed.

Base_Name
The specification for  looks like this:

I'm quite sure you've already guessed what  does, but indulge me in some example-code:

The output:

Starting default directory: /home/thomas/wiki_examples/aDir foo .secret bar stuff Name_Error raised. Malformed Name.

Notice the "odd" behavior in regards to the  file. Instead of returning the full  string, which is in fact the base name of the file, all we get is a null string. This might be considered somewhat weird, but it is in line with what the programmers of  intended. Here's a comment from the actual  function:

So there we have it, straight from the horse's mouth: If  returns a null string, you are probably dealing with a dot file, and you will have to parse it manually. So no, you cannot expect  to return the same results as for example the standard GNU tool. must work reliably across many platforms, thus the authors had to decide on a common, predictable, method. Returning a null string for dot files is just that, predictable.

Compose
The specification for  looks like this:

allows us to construct strings from directory paths, simple names and extensions. Some basic checks are made to ensure that the resulting string is syntactically sound. does not bother with the actual existence of the resulting path, it only cares about it's validity as a full name to a file.

Lets see how it works:

The output from the above is:

Starting default directory: /home/thomas/wiki_examples/aDir foo/bar.conf bar.conf /foo/bar /foo/bar.conf /foo/.conf .conf Name_Error raised. Malformed Name.

There's no surprise here.

The  exception is raised when:

"The exception Name_Error is propagated if the string given as Containing_Directory is not null and does not allow the identification of a directory, or if the string given as Extension is not null and is not a possible extension, or if the string given as Name is not a possible simple name (if Extension is null) or base name (if Extension is non-null)."

is quite handy when building string paths to a file. It's a far stretch better than just concatenating the strings yourself.

File and directory queries
The purpose of the following functions is obvious. With names such as,  ,   and   it shouldn't be too hard to guess what these functions do, so without further ado, lets dive in.

Exists
The specification for  looks like this:

If you want to know whether a file or a directory exists, you should use. We've already seen  in action in some of the previous examples, but let's see a snippet of code where   is the star of the show:

And the output:

Starting default directory: /home/thomas/wiki_examples/aDir some_file exists /home/thomas/wiki_examples/aDir/some_dir exists nonexistant_file does not exist Name_Error raised

As can be seen, the current default directory is taken into account if a relative path is given and  is raised when the given   is invalid as either a file or a directory, as is the case with the empty string in the above example. Other than that, there's not much to say about this function.

Kind
The specification for  looks like this:

In  files/directories are classified as one of three possible "file kinds": ,   or. A  is a file that is a container for other files. A  is a file that cannot be read or created by a predefined Ada input-output package. A File that is not either a  or a   is an.

Lets see how it works. First we must add a line of code to the declarative part of the  program:

And then the body:

And the output:

Starting default directory: /home/thomas/wiki_examples/aDir ORDINARY_FILE DIRECTORY SPECIAL_FILE Name_Error raised

honors the current default directory, just as all the other functions and procedures of. is raised if the given  parameter is invalid.

{{collapsible box|title=Ada.Directories.Kind Example Source|collapsed=yes|content=

Size
The specification for  looks like this:

The  type returned by   is an integer with the range. That is, on most systems, a very large number. With that noted,  does exactly what is expected of it:

And the result is:

Starting default directory: /home/thomas/wiki_examples/aDir 7  578580  Max File_Size on this system:  9223372036854775807

The size returned is the number of stream elements contained in the file, in this case 7 and 578580 bytes. The 9223372036854775807 number is there to show you how very large a number the  type can handle. I think we'd be hard pressed to find any kind of OS or file system that can handle files that large. Note that  is implementation dependent: It might be totally different on your system.

The usual  exception applies to   and you will also find a   if the file size is not of type , ie. it is either lower than 0 or higher than.

{{collapsible box|title=Ada.Directories.Size Example Source|collapsed=yes|content=

Modification_Time
The specification for  looks like this:

If you need to know what time a file was last modified, this is the function for it. As you can see, it returns an  object, so to actually see the output, we need to add a   clause and an extra line to the declarative part of. First the  clause:

And then the declaration:

And finally the code that goes into the body:

The output from this little snippet is:

Starting default directory: /home/thomas/wiki_examples/aDir 2009-10-06 14:10:04

The usual  is raised if the file is invalid and a   is raised if the environment doesn't support the notion of modification time on a file.

{{collapsible box|title=Ada.Directories.Modification_Time Example Source|collapsed=yes|content=

Directory Searching
Searching over a directory structure is done using the following types and subprograms. In the previous sections we haven't really bothered with the types, as they didn't really play an active role in using the functions and procedures, but with searching things are a bit different: Here we actively use the types to keep track of the state of a search and the result of a search.

Searching can be done either using an active or a passive iterator. The active iterator approach is merely a simple loop and the passive iterator is done using access to a subprogram that defines what to do with each result of the search. We will show how both methods work.

Directory_Entry_Type
The specification for  looks like this:

The  represents a single item in a directory. The only way to create a  is by using the Get_Next_Entry procedure. One such  object can then be used by appropriate subprograms, such as Simple_Name, Kind and so on. It should be obvious from the  record what kind of information we can extract from it.

Filter_Type
The specification for  looks like this:

There are three different kinds of files in  ,   and. With  you define which of these you wish to search for:

Here we setup a filter that ignores  and allows   and.

Search_Type
The specification for  looks like this:

contains the state of the search. You initialize the  object with Start_Search, you check it with More_Entries, you read it with Get_Next_Entry and you clean it up with End_Search.

Start_Search
The specification for  looks like this:

All the searching related types and subprograms depend heavily on each other. Because of that, I believe it will make the most sense to present a complete program that encompass them all. This means that we will deviate from the usual  program, and instead go with this:

The output from this program, when run on my system, is:

/home/thomas/wiki_examples/aDir/adir .                      dir                 2009-10-23 20:17:22      /home/thomas/wiki_examples/aDir/. ..                     dir                 2009-09-24 20:07:57      /home/thomas/wiki_examples/aDir/.. objects                dir                 2009-10-27 20:56:32      /home/thomas/wiki_examples/aDir/objects Proj.gpr               502 bytes           2009-09-24 20:09:20      /home/thomas/wiki_examples/aDir/Proj.gpr adir                   594193 bytes        2009-10-23 20:17:22      /home/thomas/wiki_examples/aDir/adir some_dir               dir                 2009-10-06 14:10:25      /home/thomas/wiki_examples/aDir/some_dir adir.adb               1781 bytes          2009-10-23 20:17:21      /home/thomas/wiki_examples/aDir/adir.adb some_file              7 bytes             2009-10-06 14:10:04      /home/thomas/wiki_examples/aDir/some_file some_new_file          7 bytes             2009-10-06 14:37:15      /home/thomas/wiki_examples/aDir/some_new_file

sets the stage for a search. It takes four parameters:  which contains the state of the search,   which is the directory to search,   which is a, well, pattern for matching filenames and   which defines the kinds of files that are returned by the search.

The interpretation of the  value is implementation defined, except that an empty string equals "match everything". It is highly probable that simple and well-known patterns like  will yield the expected result: All files with the   extension are matched.

In this case we search for everything (empty  string) that isn't considered a   (Filter is assigned  ) in the current directory.

The above program uses an active iterator: The  loop. As you can see, this loop goes on as long as  is. When this is no longer the case, the loop ends and we call  to clean up the   object. This basically resets it, so it no longer contains any entries.

We can avoid having to manage such basic house-keeping if we instead use a passive iterator. Here's what the program looks like when using a passive iterator:

The output is:

/home/thomas/wiki_examples/aDir/adir .                      dir                 2009-10-23 20:17:22      /home/thomas/wiki_examples/aDir/. ..                     dir                 2009-09-24 20:07:57      /home/thomas/wiki_examples/aDir/.. objects                dir                 2009-10-27 20:56:32      /home/thomas/wiki_examples/aDir/objects Proj.gpr               502 bytes           2009-09-24 20:09:20      /home/thomas/wiki_examples/aDir/Proj.gpr adir                   594193 bytes        2009-10-23 20:17:22      /home/thomas/wiki_examples/aDir/adir some_dir               dir                 2009-10-06 14:10:25      /home/thomas/wiki_examples/aDir/some_dir adir.adb               1781 bytes          2009-10-23 20:17:21      /home/thomas/wiki_examples/aDir/adir.adb some_file              7 bytes             2009-10-06 14:10:04      /home/thomas/wiki_examples/aDir/some_file some_new_file          7 bytes             2009-10-06 14:37:15      /home/thomas/wiki_examples/aDir/some_new_file

With the passive iterator, you get rid of the  and the   ->   ->   ->   chain. It is much cleaner and less error-prone, because you don't have to worry about forgetting the final  call. Both methods have their advantages though, so use whatever is the best fit for the situation.

The  procedure accepts almost the same parameters as , except that we have   instead of. is of course access to the subprogram that is to handle each item returned by the search. This subprogram must accept one parameter:.

{{collapsible box|title=Ada.Directories.Start_Search Example Source|collapsed=yes|content=

End_Search
The specification for  looks like this:

is a clean-up procedure. It is only necessary to use  if you've called   earlier. It is used to reset the, effectively clearing out all search entries.

Typical usage would look something like this:

An actual usage example can be found here.

More_Entries
The specification for  looks like this:

is only relevant if a prior call to  has been made. A call to  return boolean   if more entries are available on a call to. Otherwise boolean  is returned. See Start_Search for an actual usage example.

Get_Next_Entry
The specification for  looks like this:

I'm just going to quote the Ada Reference Manual on

"Returns the next Directory_Entry for the search described by Search that matches the pattern and filter. If no further matches are available, Status_Error is raised. It is implementation-defined as to whether the results returned by this routine are altered if the contents of the directory are altered while the Search object is valid (for example, by another program). The exception Use_Error is propagated if the external environment does not support continued searching of the directory represented by Search."

How this works, can be seen in the Start_Search section.

Simple_Name (Directory Entries)
The specification for  looks like this:

The functionality of this  function is exactly the same as the "regular" Simple_Name function, except it accepts a   instead of a   for the   parameter. See Start_Search for an example.

Full_Name (Directory Entries)
The specification for  looks like this:

The functionality of this  function is exactly the same as the "regular" Full_Name function, except it accepts a   instead of a   for the   parameter. See Start_Search for an example.

Kind (Directory Entries)
The specification for  looks like this:

The functionality of this  function is exactly the same as the "regular" Kind function, except it accepts a   instead of a   for the   parameter. See Start_Search for an example.

Size (Directory Entries)
The specification for  looks like this:

The functionality of this  function is exactly the same as the "regular" Size function, except it accepts a   instead of a   for the   parameter. See Start_Search for an example.

Modification_Time (Directory Entries)
The specification for  looks like this:

The functionality of this  function is exactly the same as the "regular" Modification_Time function, except it accepts a   instead of a   for the   parameter. See Start_Search for an example.

Specification
Current_Directory String Set_Directory Directory  String Create_Directory New_Directory  String Form           String  "" Delete_Directory Directory  String Create_Path New_Directory  String Form           String  "" Delete_Tree Directory  String Delete_File Name  String Rename Old_Name  String New_Name  String Copy_File Source_Name  String Target_Name  String Form         String  "" Full_Name Name  String  String Simple_Name Name  String  String Containing_Directory Name  String  String Extension Name  String  String Base_Name Name  String  String Compose Containing_Directory  String  "" Name                  String Extension             String  "" String File_Kind Directory Ordinary_File Special_File File_Size  0  implementation_defined Exists Name  String  Boolean Kind Name  String  File_Kind Size Name  String  File_Size Modification_Time Name  String  AdaCalendarTime Directory_Entry_Type Filter_Type  File_Kind  Boolean Search_Type Start_Search Search       Search_Type Directory       String Pattern         String Filter          Filter_Type    True End_Search Search   Search_Type More_Entries Search  Search_Type  Boolean Get_Next_Entry Search            Search_Type Directory_Entry     Directory_Entry_Type Search Directory  String Pattern    String Filter     Filter_Type    True Process Directory_Entry  Directory_Entry_Type Simple_Name Directory_Entry  Directory_Entry_Type String Full_Name Directory_Entry  Directory_Entry_Type String Kind Directory_Entry  Directory_Entry_Type File_Kind Size Directory_Entry  Directory_Entry_Type File_Size Modification_Time Directory_Entry  Directory_Entry_Type AdaCalendarTime Status_Error   AdaIO_ExceptionsStatus_Error Name_Error     AdaIO_ExceptionsName_Error Use_Error      AdaIO_ExceptionsUse_Error Device_Error   AdaIO_ExceptionsDevice_Error Import Ada Directory_Entry_Type Import Ada Search_Type AdaDirectories

Wikibook

 * Ada Programming/Libraries/Ada

Open-Source Implementations
Libraries:Ada.Directories

Programación en Ada/Unidades predefinidas/Ada.Directories


text:
Cellular Automata/Boundary Conditions

On bounded lattices the information about preimages outside the boundaries of the observed string $$\alpha$$ can be described by two boundary preimage vectors (left $$b_L$$ and right $$b_R$$). The observed string $$\alpha$$ can be seen as part of an infinite string $$\beta_L \alpha \beta_R$$. Boundary vector $$b_L$$ describes preimages of the semi-infinite string $$\beta_L$$ and boundary vector $$b_R$$ describes preimages of the semi-infinite string $$\beta_R$$. Vector elements are the numbers of preimages that can be traced from the boundary to infinity for each of the overlaps at the boundaries. Element at position $$o_L$$ in the left boundary vector $$b_L$$ specifies the number of preimages $$p_{-\infty \leftrightarrow o_L}(\beta_L)$$ that can be traced from left infinity to the overlap $$o_L$$ at the left boundary of the observed string. The definition of the right boundary vector $$b_R$$ is similar.

 * $$ b_L = [ p_{-\infty \leftrightarrow o_L=0}, p_{-\infty \leftrightarrow o_L=1}, \dots, p_{-\infty \leftrightarrow o_L}, \dots, p_{-\infty \leftrightarrow o_L=k^{m-1}-1} ]^T $$

 * $$ b_R = [ p_{0=o_R \leftrightarrow +\infty}, p_{1=o_R \leftrightarrow +\infty}, \dots, p_{o_R \leftrightarrow +\infty}, \dots, p_{k^{m-1}-1=o_R \leftrightarrow +\infty} ]^T $$

Since we usually don't care about the state of the CA outside the observed string, unrestricted boundary vectors can be used. \paragraph{Definition} For the \emph{unrestricted boundary vector} it is assumed that each of the boundary overlaps can be used to trace exactly one path to infinity. Therefore the unrestricted boundary vector contains all ones.

 * $$ b_u = [1,1,\dots,1]^T $$

Note The below definitions rely on assumptions that are not proved yet, so the definitions my be wrong.

General boundary vectors $$b_L$$ and $$b_R$$ describe general infinite strings $$\beta_L$$ and $$\beta_R$$. It is assumed that this strings end with an unrestricted boundary vector $$b_u$$ in the infinity.

 * $$ b_L^T = \lim_{|\beta_L|\rightarrow\infty} b_u^T \, D(\beta_L) \qquad

b_R  = \lim_{|\beta_R|\rightarrow\infty} D(\beta_R) \, b_u $$

Since an infinite string can have an infinite number of preimages, this definition is rarely useful. Boolean values can be used instead of integers to state if the overlap can be used for tracing or not. The equations are identical, only the scalar multiplication operator used for matrix multiplication is replaced by an XOR logical operation. Another option is using probabilities.

Another common boundary is an infinite periodic string with a finite period. Some commonly used boundaries can be defined this way. The periodic boundary vectors $$b_{\bar{L}}$$ and $$b_{\bar{R}}$$ describe infinite periodic strings with finite periods $$\overline{\beta_L}$$ and $$\overline{\beta_R}$$. This strings end with the same boundary vector $$b_{\bar{L}}$$ and $$b_{\bar{R}}$$ in the infinity. The preimage matrix of a sting of $$n$$ period strings $$\overline{\beta}^n$$ is computed as $$D(\overline{\beta}^n)=D^n(\overline{\beta})$$.

 * $$ b_{\bar{L}}^T = \lim_{n\rightarrow\infty} b_{\bar{L}}^T \, D^n(\overline{\beta_L}) \qquad

b_{\bar{R}}  = \lim_{n\rightarrow\infty} D^n(\overline{\beta_R}) \, b_{\bar{R}} $$

The problem with this definition is thet there may by many different vectors that fulfil the criteria. There is an example of periodic boundaries with a finite number of preimages at the end of the paper.

title: Cellular Automata/Boundary Conditions


text:
Communication Systems/Analog Modulation Introduction

Analog Modulation Overview
Let's take a look at a generalized sinewave:

x\left( t \right) = A\sin \left( {\omega t + \theta } \right) $$ It consists of three components namely; amplitude, frequency and phase. Each of which can be decomposed to provide finer detail:

 * $$x(t) = A s(t) \sin ( 2 \pi [f_c + kf_m(t)] t + \alpha \phi(t) )$$

Types of Analog Modulation
We can see 3 parameters that can be changed in this sine wave to send information:

 * $$A s(t)$$. This term is called the "Amplitude", and changing it is called "Amplitude Modulation" (AM)
 * $$kf_m(t)$$ This term is called the "Frequency Shift", and changing it is called "Frequency Modulation"
 * $$\alpha \phi (t)$$. this term is called the "Phase angle", and changing it is called "Phase Modulation".
 * The terms frequency and phase modulation are often combined into a more general group called "Angle Modulation".

The Breakdown
Each term consists of a coefficient (called a "scaling factor"), and a function of time that corresponds to the information that we want to send. The scaling factor out front, A, is also used as the transmission power coefficient. When a radio station wants their signal to be stronger (regardless of whether it is AM, FM, or PM), they "crank-up" the power of A, and send more power out onto the airwaves.

How we Will Cover the Material
We are going to go into separate chapters for each different type of modulation. This book will attempt to discuss some of the mathematical models and techniques used with different modulation techniques. It will also discuss some practical information about how to construct a transmitter/receiver, and how to use each modulation technique effectively.


text:
User talk:01mf02

Hi there,

Would you mind coming into the irc channel #blenderwiki on irc.freenode.net at your earliest convenience? Please log in under your wikibooks username and contact either myself or S68? We have some things to discuss about Noob to Pro and would like your feedback. Thank you :)

--Spiderworm 15:39, 23 November 2005 (UTC)

Pictures
As you can see at the top of this page, "All unlicensed images uploaded to wikibooks before November 1, 2006 will soon be deleted." You have uploaded images and some of them are untagged. You can see them here. Please review them and add appropriate tags. --Think Fast 04:33, 13 November 2006 (UTC)

Image copyright problems
Thanks for uploading image(s) to Wikibooks. The Wikimedia Foundation is very careful about what Wikibooks includes because of copyright law, and requires that we maintain a strict copyright policy. Some or all of your uploaded files may soon be deleted unless we can determine the copyright holder and status. The copyright holder is usually the creator, the creator's employer, or the last person who was transferred ownership rights. Please take the time to read Media to learn more about what copyright information is required to satisfy our requirements and remember to include this important information for every file that you upload in the future as well. If you have any questions, feel free to contact me, or ask another Wikibookian at the help desk.

To find the files in question, use (unlicensed|untagged)

Thanks! '''– MBA ( Bot talk | Mike talk | owner | block ) 01:22, 21 September 2007 (UTC)

 * This is an automated message. Please ignore it if you've already provided license information for all your uploads.

title: User talk:01mf02


text:
User talk:Saysaknow

Hi there,

Would you mind coming into the irc channel #blenderwiki on irc.freenode.net at your earliest convenience? Please log in under your wikibooks username and contact either myself or S68? We have some things to discuss about Noob to Pro and would like your feedback. Thank you :)

--Spiderworm 15:41, 23 November 2005 (UTC)

title: User talk:Saysaknow


text:
Muggles' Guide to Harry Potter/Magic/Polyjuice Potion

Overview
Polyjuice Potion allows the taker to assume the physical appearance of another person. The potion takes a month to brew, and must include part of the person you wish to look like.

Extended Description
One of the ingredients of Polyjuice Potion is boomslang skin. The boomslang is a very real venomous snake, native to Africa.

The potion is used in Harry Potter and the Chamber of Secrets by Harry and Ron to question Draco about the Heir of Slytherin, with almost no information gained. Hermione, by accidentally using cat's hair and therefore morphing partway into a cat, demonstrates the problems with using potions without being quite sure of the effects they will have.

The potion is also used in Harry Potter and the Goblet of Fire by the false Moody.

It is also used in Harry Potter and the Half-Blood Prince by Draco's sidekicks Crabbe and Goyle when Draco wants them to be inconspicuous guards for what he is doing.

Finally, it is used extensively by Harry, Ron, and Hermione in Harry Potter and the Deathly Hallows when they need to disguise themselves. It is used first by Mad-Eye Moody to create six replicas of Harry as a way of confusing the Death Eaters who are trying to stop his departure from the Dursleys'. It is then used by Harry to disguise himself as "Cousin Barny" at the wedding of Bill and Fleur. Harry, Ron, and Hermione use it to enter the Ministry, and Hermione uses it to enter Gringotts disguised as Bellatrix Lestrange.

Analysis
It must be extremely useful to appear to be someone else. The potion is remarkably comprehensive in its actions; the false Moody, transformed by the potion, is missing an eye and a leg, and these grow back when he is deprived of the potion. In fact, one assumes they must grow back each night, as the effects of the potion last only an hour. One must question whether the suppressed limb must be exercised to avoid it atrophying... did the false Moody have to exercise each day in his normal shape to avoid the effects of nine months without moving the suppressed leg?

The process of changing to a new shape by means of the potion is described as being quite painful, while the reversion to original self is so painless that neither Ron nor Harry notices it happening in themselves. As the false Moody was not apparently in pain when he drank from his hip flask (which contained, apparently, the Polyjuice Potion that retained his appearance), we can assume that it is the process of changing that is painful; maintenance in the unnatural shape should be much less so.

Greater Picture
One wonders what happened when Crabbe or Goyle, standing guard duty, ran out of time? They did not seem to have any additional potion with them, and it is certain that a 6th-year Crabbe or Goyle would not have fit into the robes of the students they chose to disguise themselves as, which were typically first- to third-year girls. Possibly they had additional stock of prepared potion with them, but we never see them drinking any of it. However, throughout the seventh book, the effects of the potion seem to wear off at much more convenient times than we would expect; rather than a fixed hour in duration, for instance, Harry's disguise as "Barny" seems to last for the duration of the wedding, and Harry, Ron, and Hermione's disguises as they invade the Ministry not only seem to remain in place for the entire time that they are in the Ministry, but seem to wear off very conveniently just as they leave Grimmauld Place for the forest where the Quidditch World Cup had been played two years before. This convenient duration of the potion effects seems to be one of a number of places where the author is altering the magic she has created in order to make a better story.


text:
Georgia Water/External Links/Education

Water Resources Planning

 * Georgia Tech - City and Regional Planning

 * | Master of City and Regional Planning (55 semester hours)
 * | Environmental Planning and Management speciality

 * Key Courses
 * | CP6241 Water Resources Planning

Professional Education

 * Modeling and Simulation Certificate Program - certificate from Georgia Tech (3 core courses plus 3 elective courses), no water focus here.

 * Decision support tools for river basin planning and management - short course on simulation models, at Georgia Tech
 * Hydrologic engineering for dam design - short course at Georgia Tech
 * Building a GIS database for water resources applications - short course at Georgia Tech
 * Programming water resources tools (models) with ArcObjects - short course at Georgia Tech

title: Georgia Water/External Links/Education


text:
Talk:Maple

 * Is this on Waterloo Maple? Gdd 17:28, 23 November 2005 (UTC)
 * Yes it is Jesushaces
 * Could we please get the complete ToC up? So as to know what to add to the different sections. Thank you. Jesushaces 00:57, 25 November 2005 (UTC)
 * I beleive the current table of contents is fine. I don't beleive there should be any new section added, since most of the software is covered with these chapters.--The Anarchist Beggar 00:55, 10 December 2005 (UTC)

Copyright violation
There does not seem to be any permission from http://alamanya.free.fr to translate pages from that site and make them available on this site with the GNU Free Documentation License. I have added a "possible copyright violation" sign to the Maple module.

By the Deletion policy, the contributors of these Maple modules should explain if they have permission to use these modules, or else risk having these modules deleted. --Kernigh 23:42, 9 December 2005 (UTC)

If there was permission to use the material, can someone post evidence of that? --Kernigh 23:42, 9 December 2005 (UTC)

Before begginning this wikibook, I talked with the webmaster of http://alamanya.free.fr (Alain Le Stag) to ask him if it was ok to translate parts of the totality of his webpages and he agreed. However, this agreement has only been made through e-mail, so there are no any proof of this. But you can be sure that he does not mind and told me everything was fine with this project. --The Anarchist Beggar

Chapter 6
I just added some stuff to get it started. I do have a couple of questions though. Are the images suitable? Not too large? Leave any suggestions or complaints you have. --J Darnley 22:32, 6 March 2006 (UTC)

title: Talk:Maple


text:
Novial/Hound Appendix 2

Novial home – Pronunciation Guide

Contents – Lesson 1 – Lesson 2 – Lesson 3 – Lesson 4 – Lesson 5 – Lesson 6 – Lesson 7 -

Prefixes - Suffixes

Adverbial Suffixes
_____________________________________________________________________________________ Novial home – Pronunciation Guide

Contents – Lesson 1 – Lesson 2 – Lesson 3 – Lesson 4 – Lesson 5 – Lesson 6 – Lesson 7

Prefixes - Suffixes

title: Novial/Hound Appendix 2


text:
Talk:Introduction to Philosophy/Marx and Marxists

Marx didn't reject metaphysics simply because he said Religion ... is the opium of the people. He was critiquing religion, not dismissing it outright.

Marx was always concerned with metaphysics, the philosophy of the nature of reality, because he was always concerned with reality and how it is transformed, particularly the reality of oppressed peoples. Steve W.


text:
Georgia Water/External Links/Projects

Interbasin transfers

 * Interbasin transfers in Georgia, 2001 (Table 1, page 17; Figure 1, page 18)

Navigation projects

 * Savannah Harbor Expansion Project - 2005

Reservoirs

 * Savannah River reservoirs
 * List of USACE projects with water supply purpose
 * List of dams owned by local government, by county in Georgia
 * Water Supply Reservoirs Pending (in 2001) Corps of Engineers or EPD Permit and which are exempt from the interim instream flow protection policy. (Table 1, page 32)

Restoration projects

 * Project Management Plan for Feasibillity Study: Lake Allatoona / Etowah River Watershed Ecosystem Restoration and Resources Protection, Lake Allatoona, Georgia, U.S. Army Corps of Engineers - Mobile District, May 2002.

title: Georgia Water/External Links/Projects


text:
Modern History/Introduction

What is Modern History?
For the purpose of this book, modern history starts in 1490 and continues until some end point after Beaconsfield mine collapse in 2006, but before the US Presidential Election of 2008.

Existing free texts on this topic include Wikibooks World History, and Wikipedia. This book takes a different approach from both texts. The intention is to provide features:
 * This book contains external links, especially to other Wikibooks and wikis such as Wikisource, Wikipedia, and the Alternate History Wikicity.
 * This book presents questions based on a short list of themes and answers them.
 * This book can be read as a chronological narrative, unlike Wikipedia which requires much jumping between articles.

To start creating this book, create stubs that link to Wikisource and Wikipedia.

Start of this book
By our measurement, this book began 13 November 2004 when User:DorianGray created the first page. A year later, at 23 November 2005, User:Kernigh posted the first of the themes and began expansion of this book. On 9 May 2006, the Front Cover was posted

Themes
For consistency, this book will follow the same themes through the text. The themes are Population, Governance, Philosophy, Invention, Combat, and Trade.

 * Population [P] refers to groups of persons, such as ethnic or social groups.
 * Governance [G] refers to rule over a population or populations. Many empires expanded in modern history until several states gained independence.
 * Philosophy [Ph] refers to the ideas of a thinkers that came up with ideas that radically changed thought as we know it today.
 * Invention [I] refers especially to new or recovered technology. Modern history was the time of the industrial revolution and eventually the computer revolution.
 * Weapons [W] refers to the tools of war used in battle, be it knives, guns or bombs
 * Combat [C] refers to wars, battles, and other destructive competition. In modern history, wars became more deadly until the largest war so far, World War II.
 * Trade [T] refers to any exchange of goods or services, from the exchange of some money for a slice of bread to the many ships crossing the Pacific.
 * Exploration [E] refers either to unknown lands being discovered or to not well known lands being explored.

Overview of modern history
History may be divided into many categories (Ancient History, The Dark Ages, Medieval History, Age of Empires, Space Age, etc). Modern history relates to events that have occurred in the timeframe roughly starting around the American and French Revolutions. Many textbooks date the 'beginning' of Modern History at the Industrial Revolution (the 18th-19th centuries).

Events from around the turn of the 20th century to the present day are usually described as Contemporary History. This book includes events from this time, except that it is not meant to provide a commentary on current events. Thus, this book will cover Beaconsfield mine collapse in 2006, but not yet the US Presidential Election of 2008.

15th century
(currently begins in 1490)

16th century
(1501-1600)

17th century
(1601-1700)

18th century
(1701-1800)

19th century
(1801 to 1900) This period of history saw much change in world history. The end of the Napolenic wars, the crowning of Queen Victoria, this was one of the greatest periods of world history. Thinkers during this time include Karl Marx, Benjamin Disraeli and Charles Darwin. We also have the 2nd French Revolution, Revolutions in South America, the unification of Italy and Germany and the American Civil War, all important events in world history.

20th century
The century from 1901 to 2000 saw perhaps the greatest changes in humanity's culture and technology in history. It saw the decline of the great houses of Europe. The great empires of Russia, Britain, the Ottomans and Austria were destroyed by conquest or weakened structure. The United States came from being a relatively insignificant country with an isolationist policy to one of the major players on the international stage.

The manipulation of electricity having become easier and cheaper, electronic products became more and more widespread, especially the Digital Computer. The internal combustion engine was refined and improved. The wholesale embracing of the mass-production line increased the industrial output of countries per capita to a level never seen before.

The 20th century also saw the way warfare was conducted turned upside down. The first fifty years were host to the first truly 'World Wars'. The First World War was the bloodiest war in history on a casualty-to-combatant ratio, and also forced the armies of the world to adapt to new tactics and the countries to amend their strategies. The economic and military restrictions placed on the losing powers lead to the Second World War, which was the bloodiest war in the world in terms of sheer casualties. The creation of the Atomic bomb proved for the first time that humanity was capable of fully destroying itself. The concentration of Petroleum in the Gulf of Arabia led to vast changes in this region. The ideological struggle between Capitalism and Stalinism led to a prolonged cold war.

21st Century
The 21st century began on the 1st January 2001. However, most people alive then considered the 1st January 2000 as the beginning of the century, with large celebrations and the infamous Y2K scare, followed by an Election (E2K) in the US. In 2001, on the infamous Eleventh of September, the US was attacked. This resulted in the War on Terrorism.

title: Modern History/Introduction


text: User:Athrash/Credo

title: User:Athrash/Credo


text:
Template:Modern History

Current status: This book does not yet contain much content. Work for expansion is beginning. Creation of stubs linking to Wikisource and Wikipedia is in progress.

Contributors: If you copy (instead of link) content from elsewhere into this book, for example content from Wikipedia or public domain sources, then you MUST CREDIT the source of such copied text.

title: Template:Modern History


text:
Template:Modern History/stub

''This page or section of Modern History is a stub. You can help Wikibooks by [ expanding it].'' :This template adds page to /Stubs.

title: Template:Modern History/stub


text: User talk:139.222.193.7

title: User talk:139.222.193.7


text:
User talk:83.100.228.251

Please stop adding nonsense to Wikibooks. It is considered vandalism. If you would like to experiment, use the sandbox. Thank you.

title: User talk:83.100.228.251


text:
Formal Logic/Predicate Logic/The Predicate Language

= The Predicate Language =

This page informally describes our predicate language which we name $$\mathcal{L_P}\,\!$$. A more formal description will be given in subsequent pages.

Language components
Use of $$\mathcal{L_P}\,\!$$ occurs in the context of a domain of objects. Ascribing a property to 'everything' is only interpreted as ascribing it to everything in the domain.

Definitions
Variables serve as placeholders in general statements for objects in the domain of discourse. We will use the lower case letters n through z as variables. Frequently, variables correspond to pronouns in statements. For instance, consider the statement 'For any number, if it is even then it is not odd.' Introducing the variable x produces 'For any number x, if x is even then x is not odd.'

An operation letter is a function that takes a fixed number of objects (or variables representing objects) and returns an object in the domain. We write operation letters as lower case letters a through m. An operation letter that takes n objects is called an n-place operation letter. Zero-place operation letters are allowed and merely represent a fixed object. Usually, the context is sufficient to determine the number of places of each operation letter.

For examples on this page, we also allow numerals ($$0, 1, 2, ...$$) as zero-place operation letters.

A term is any of the following:

$$) followed by a parenthesized list of n'' terms.
 * A variable
 * A zero-place operation letter.
 * An n-place operation letter (with ''$$n \geq 1

Examples include $$x, y, z $$ (variables); $$a, b, c $$ (zero-place operation letters); $$f(c)$$ (1-place operation letter $$f$$ operating on $$c$$); and $$g(x, f(c))$$ (2-place operation letter $$g$$ operating on $$x$$ and $$f(c)$$).

If a term contains no variables, then it is called a name. Each name specifies a particular object in the domain, whereas terms containing variables do not.

Examples
For the remainder of this page, assume the following translations.

 * $$\begin{aligned}

c\ &:\ \ \mbox{Cain} \\ f(x)\ &:\ \ \mbox{the father of}\ x \\ g(x, y)\ &:\ \ \mbox{the greater of}\ x\ \mbox{and}\ y \end{aligned}$$

With the right set of characters in the domain, $$c\,\!$$ names Cain, and (according to Biblical tradition) $$f(c)\,\!$$ names Adam.

The term $$g(x, y)\,\!$$ is not a name because it contains variables. Then the terms $$g(7, 3)\,\!$$ and $$g(3, 3)\,\!$$, however, name 7 and 3 respectively (assuming that 7 and 3 are in the domain).

Primitive formulae
A predicate letter is a function that takes a fixed number of objects (or variables representing objects) and returns a sentence letter. Predicate letters will consist of capital letters A through Z. The same symbols will be used for predicate letters of any number of places, so, as with operation letters, we sometimes need to specify the number of places but usually can rely on context. Notice that zero-place predicate letters are sentence letters we are familiar with from sentential logic.

A primitive formulae is either one of the following:

$$) followed by a parenthesized list of n'' terms. Examples include
 * A zero-place predicate letter (that is, a sentence letter).
 * An n-place predicate letter (with ''$$n \geq 1
 * $$\mathrm{P}\,\!$$
 * $$\mathrm{F}(f(c))\,\!$$
 * $$\mathrm{G}(g(x, y), u, v)\,\!$$

Examples
If $$\mathrm{P}\,\!$$ translates 'Snow is white', then it is true. However, it is false if it translates 'Snow is blue'.

Suppose we add the following translations to the translations above:

 * $$\mathrm{F}(x)\ :\ \ x\ \mbox{is bald}\,\!$$
 * $$b\ :\ \ \mbox{Yul Brenner}\,\!$$
 * $$k\ :\ \ \mbox{Don King}\,\!$$

We say that $$\mathrm{F}\,\!$$ is true of all bald things and false of all non-bald things. Thus $$\mathrm{F}(b)\,\!$$ is true while $$\mathrm{F}(k)\,\!$$ is false. Whether $$\mathrm{F}(f(c))\,\!$$ is true or false depends on whether Adam was bald.

Now add

 * $$\mathrm{G}(x, y, z)\ :\ \ x\ \mbox{is between}\ y\ \mbox{and}\ z\,\!$$

to the translations above. Then $$\mathrm{G}(g(x, y), u, v)\,\!$$ is neither true nor false because $$ x $$ and $$ y $$ are variables that do not name anything, nor do the variables $$u\,\!$$ or $$v\,\!$$. But if we substitute numbers for the variables, then the $$\mathrm{G}(g(3, 3), 1, 4)\,\!$$ is true while $$\mathrm{G}(g(7, 3), 1, 4)\,\!$$ is false.

Sentential connectives
The predicate language $$\mathcal{L_P}\,\!$$ will use sentential connectives just as they were used in the sentential language $$\mathcal{L_S}\,\!$$. These were:

 * $$\lnot,\ \land,\ \lor,\ \rightarrow,\ \mathrm{and}\ \leftrightarrow\,\!$$

Using the translations already set above (together with letting numerals be zero-place operation letters),

 * $$\mathrm{F}(f(d)) \lor \mathrm{G}(g(7, 3), 1, 4)\,\!$$

is true while

 * $$\mathrm{F}(f(d)) \land \mathrm{G}(g(7, 3), 1, 4)\,\!$$

is false.

Quantifiers
Quantifiers are special symbols that allow us to construct general sentences which are about all thing or about some (at least one) things.

$$\mbox{Universal quantifier:}\ \forall\,\!$$
 * $$\forall x\,\!$$ translates to English as 'for all x'.
 * $$\forall x\ \mathrm{F}(x)\,\!$$ is called a universal generalization.
 * $$\forall x\ \mathrm{F}(x)\,\!$$ is true if $$\mathrm{F}(x)\!$$ is true of all objects in the domain.  Roughly speaking, it is true if
 * $$\mathrm{F}(a_1) \land \mathrm{F}(a_2) \land ... \land \mathrm{F}(a_n)\,\!$$
 * where each $$(a_i)\,\!$$ names an object in the domain and all objects in the domain are named. This is only a rough characterization, however.  First, we do not require that all objects in the domain have a name in the predicate language.  Second, we allow there to be infinitely many objects in the domain but do not  allow infinitely long sentences.
 * Some authors use $$(x)\,\!$$ instead of $$\forall x\,\!$$. This notation is semi-obsolete and is becoming ever less frequent.

$$\mbox{Existential quantifier:}\ \exists\,\!$$
 * $$\exists x\,\!$$ translates to English as 'there exists an x ' or, perhaps a bit more clearly, 'there exists at least one x '.
 * $$\exists x\ \mathrm{F}(x)\,\!$$ is called an existential generalization.
 * $$\exists x\ \mathrm{F}(x)\,\!$$ is true if $$\mathrm{F}(x)\!$$ is true of at least one object in the domain. Roughly speaking, it is true if
 * $$\mathrm{F}(a_1) \lor \mathrm{F}(a_2) \lor ... \lor \mathrm{F}(a_n)\,\!$$
 * where each $$(a_i)\,\!$$ names an object in the domain and all objects in the domain are named. This is only a rough characterization, however.  First, we do not require that all objects in the domain have a name in the predicate language.  Second, we allow there to be infinitely many objects in the domain but do not  allow infinitely long sentences.

Translation
Using the translation scheme

 * $$\mathrm{F}(x)\ :\ \ x\ \mbox{is a number}\,\!$$
 * $$\mathrm{G}(x)\ :\ \ x\ \mbox{is prime}\,\!$$

we translate as follows.

 * All numbers are prime.
 * $$\forall x(F(x) \rightarrow G(x))\,\!$$

 * Some numbers are prime.
 * $$\exists x(F(x) \land G(x))\,\!$$

 * No numbers are prime.   (two equivalent alternatives are given)
 * $$\forall x(F(x) \rightarrow \lnot G(x))\,\!$$
 * $$\lnot \exists x(F(x) \land G(x))\,\!$$

 * Some numbers are not prime.
 * $$\exists x(F(x) \land \lnot G(x))\,\!$$

Now using the translation scheme

 * $$\mathrm{P}(x)\ :\ \ x\ \mbox{is a person}\,\!$$
 * $$\mathrm{L}(x, y)\ :\ \ x\ \mbox{loves}\ y\,\!$$
 * $$g\ :\ \ \mbox{George}\,\!$$
 * $$m\ :\ \ \mbox{Martha}\,\!$$

we can translate as follows.

 * George loves Martha.
 * $$\mathrm{L}(g, m)\,\!$$

 * Martha loves George.
 * $$\mathrm{L}(m, g)\,\!$$

 * George and Martha love each other.
 * $$\mathrm{L}(g, m) \land \mathrm{L}(m, g)\,\!$$

We can further translate as follows.

 * Everybody loves everybody.   (the second alternative assumes only persons in the domain)
 * $$\forall x (\mathrm{P}(x) \rightarrow \forall y (\mathrm{P}(y) \rightarrow \mathrm{L}(x, y)))\,\!$$
 * $$\forall x \forall y \mathrm{L}(x, y)\,\!$$

 * Somebody loves somebody.   (the second alternative assumes only persons in the domain)
 * $$\exists x (\mathrm{P}(x) \land \exists y (\mathrm{P}(y) \land \mathrm{L}(x, y)))\,\!$$
 * $$\exists x \exists y \mathrm{L}(x, y)\,\!$$

 * Everybody loves somebody (or other).   (the second alternative assumes only persons in the domain)
 * $$\forall x (\mathrm{P}(x) \rightarrow \exists y (\mathrm{P}(y) \land \mathrm{L}(x, y)))\,\!$$
 * $$\forall x \exists y \mathrm{L}(x, y)\,\!$$

 * Somebody is loved by everybody.   (the second alternative assumes only persons in the domain)
 * $$\exists y \forall x (\mathrm{P}(y) \land (\mathrm{P}(x) \rightarrow \mathrm{L}(x, y)))\,\!$$
 * $$\exists y \forall x \mathrm{L}(x, y)\,\!$$

 * Everybody is loved by somebody (or other).   (the second alternative assumes only persons in the domain)
 * $$\forall x \exists y (\mathrm{P}(x) \rightarrow \mathrm{P}(y) \land \mathrm{L}(y, x))\,\!$$
 * $$\forall x \exists y \mathrm{L}(y, x)\,\!$$

 * Somebody loves everybody.   (the second alternative assumes only persons in the domain)
 * $$\exists y \forall x (\mathrm{P}(y) \land (\mathrm{P}(x) \rightarrow \mathrm{L}(y, x)))\,\!$$
 * $$\exists y \forall x \mathrm{L}(y, x)\,\!$$


text:
Muggles' Guide to Harry Potter/Magic/Floo Network

Overview
The Floo Network is the network of fireplaces able to be reached by Floo Powder.

Extended Description
When we first see people traveling by Floo Powder, no mention is made of the Network as a separate entity; you simply travel until you reach the correct fireplace. In Harry Potter and the Goblet of Fire, where the Network is first mentioned by name, we are told that the fireplace at Number 4, Privet Drive has been temporarily added to the Floo Network. And in Harry Potter and the Order of the Phoenix it is mentioned that the Floo network is being monitored. This possibility that it could be monitored rules out its use for getting Harry out of Privet Drive and into a safe house in Harry Potter and the Deathly Hallows.

Analysis
The Floo Network can be used for travel or for communications – you can allow just your head to travel, and leave your body where it is. This ability to communicate by allowing just your head to travel is used by Sirius Black on several occasions, by Harry on two occasions, and by Amos Diggory on one occasion.

There is apparently a sub-office of the Ministry of Magic, called the Floo Regulation Panel in Harry Potter and the Goblet of Fire, which is responsible for keeping the Floo Network operating.

In Harry Potter and the Half-Blood Prince we are told that the Floo network has been connected to Hogwarts to allow students to return to school after Christmas. This seems a little odd, as we already know that the fires in Gryffindor tower, the Defence Against the Dark Arts and Potions masters' offices, and the headmasters' study are connected to the network; presumably this means that the fires in the Head of House offices have been set to respond to people desiring to travel to Hogwarts. Perhaps it is possible to make a "concealed" entry in the Floo network; you need to know the name of a fireplace before you can get there, perhaps it is possible to have some fireplaces be "ex directory" so that you need to be told the name, which presumably would not be obvious, before going to that grate. In this case, "connecting to the Floo network" would actually mean "publishing a new name for the head of house's fireplace".

Alternately, while Dumbledore appeared in the fireplace in his own office in Harry Potter and the Order of the Phoenix, in almost every other case we only saw the use of the Floo network into Hogwarts for communication. It is possible that there is some mechanism that prevents anything larger than a head from traveling to any other fireplace in Hogwarts. Such a security mechanism would certainly be a reasonable precaution for a school. In this case, "connecting to the Floo network" would involve removing the size limitation so that a whole person could travel to that fireplace.

Questions

 * 1) Number 12, Grimmauld Place is on the Floo network – Harry is able to use the Floo network to talk to people there. As its existence is only known to members of the Order of the Phoenix, how is it possible for the Floo Regulation Panel to keep it connected? Is it even necessary for them to act to keep it connected?
 * 2) Would Floo network connection be a paid service, like phones? You have to buy Floo powder, do you think you'd also have to buy connection to the Floo network?


text:
Biblical Studies/Christianity/John 5

The Updated Modernity Version (Parallel, Annotated) John 5
  THE NEW TESTAMENT

John 1 − 2  − 3  − 4  − 5  − 6  − 7  − 8  − 9  − 10  − 11  − 12  − 13  − 14  − 15  − 16  − 17  − 18  − 19  − 20  − 21

Return to Christianity contents page

title: Biblical Studies/Christianity/John 5


text:
Modern History/World in 1783

This book knows 1784 as the year in which Great Britain recognised the independence and sovereignty of the United States of America. By the end of this book, the United States will be the dominant superpower of the world.

Events

 * February 3 - American Revolutionary War: Spain recognizes United States independence.
 * February 4 - American Revolutionary War: Great Britain formally declares that it will cease hostilities with the United States of America.
 * February 4 - Earthquake in Calabria, Italy - 50.000 dead
 * March 5 - Last celebration of Massacre Day.
 * May 18 - Saint John, New Brunswick, Canada- First United Empire Loyalists reach Parrtown.
 * June 5 - The Montgolfier brothers publicly demonstrate their montgolfière (hot air balloon) in Annonay, France.
 * June 8 - The volcano Laki, in Iceland, begins an eight-month eruption which kills 9350 people and starts a seven-year famine. Eruption causes deaths of livestock when they eat contaminated grass and also widespread crop failure.
 * July 16 - Grants of land in Canada to American loyalists announced.
 * July 24 - Treaty of Georgievsk between the Imperial Russia and the Kingdom of Kartli and Kakheti (Georgia)
 * August 5 - Mount Asama erupts, causing turmoil in Edo period Japan.
 * September 3 - American Revolutionary War ends: Treaty of Paris - A treaty between the United States and the Kingdom of Great Britain is signed in Paris, ending the war.
 * November 2 - In Rocky Hill, New Jersey, US General George Washington gives his "Farewell Address to the Army".
 * November 21 - In Paris, Jean-François Pilâtre de Rozier and François Laurent, marquis d'Arlandes, make the first untethered hot air balloon flight (flight time: 25 minutes, Maximum height: 5* miles).
 * November 25 - American Revolutionary War: The last British troops leave New York City three months after the signing of the Treaty of Paris.
 * December 4 - At Fraunces Tavern in New York City, US General George Washington formally bids his officers farewell.
 * City of Sevastopol founded on the Crimean peninsula of Ukraine;
 * United Empire Loyalists flee to Canada from the new United States; Treaty of Versailles signed, ending hostilities between the Franco-Spanish Alliance and England.
 * Loyalists from New York settle Great Abaco in the Bahamas..

Independence for the United States

 * [P] In comparison to the British, who are the settlers that established the United States?
 * [G] What was the form of government of Great Britain?
 * [G] What was different in the form of the government of the US from that of Britain?

Great Britain was the combination Scotland, Wales, and especially England on a large island near the continent of Europe. Settlers mostly from England had traveled west across the Atlantic ocean and had settled on a part of the east coast of the continent of North America, occupying areas where some indigenous peoples of the Americas had lived. These settlers had established colonies of under the jurisdiction of Britain. Beginning in 1775, some of the colonies them revolted against the British government. Thirteen of the colonies declared independence in 1776. The British military and the "loyalists" fought against the "American" or "Continental" rebels in the American Revolutionary War. The two European states of Spain and especially France intervened against Britain to support the rebels; Continental forces backed by the French navy forced the withdrawal of the main British forces in 1781. The "Americans" and the British met in Paris in 1783 for the treaty to end to war.

On the British side was King George III, whose nominal description in the treaty is "Prince George the Third, by the grace of God, king of Great Britain, France, and Ireland, defender of the faith, duke of Brunswick and Lunebourg, arch-treasurer and prince elector of the Holy Roman Empire etc.". This is a traditional expression of monarchy, in which God grants rule of a realm of Christians to an inherited position called a monarch. In actuality, King George III was leader of Great Britain, Ireland, and part of the Holy Roman Empire, but not any part of France. For the purposes of this treaty, he is the King of Great Britain. Despite being King, much actual power is found at the Parliament, which is not (FIXME what was role of Parliament at this time?)

The American side has no monarch. Article 1 of the treaty gives that this side consists of twelve "sovereign and independent" states. However, these are represented by a Congress as the "United States of America". The lack of a monarch makes the treaty seem unequal, but is necessary because the states are formed from state constitutions. The United States is a supranational entity under the Articles of Confederation with borders (article 2 of the treaty) extending beyond the borders of the member states. These borders exclude other territory retained by Britain.

Births

 * January 23 - Stendhal, French writer (d. 1842)
 * March 8 - Hannah Van Buren, First Lady of the United States (d. 1819)
 * April 3 - Washington Irving, American author (d. 1859)
 * April 10 - Hortense de Beauharnais, Queen of Holland and mother of Napoleon III of France (d. 1837)
 * July 24 - Simón Bolívar, Venezuelan patriot, revolutionary leader and statesman (d. 1830).
 * September 17 - Samuel Prout, English painter (d. 1852)
 * Karl Wilhelm Gottlob Kastner, German chemist

The Pacific in 1783

 * TODO write questions

On the Pacific coast of South America, the major political entity was the Viceroyalty of Peru. As part of a series of conquests of territory, the forces of Spain had overrun the Inca Empire. This a series of actions by Spain, justified by the Pope, to spread the rule of Roman Christianity.

The Spanish placed the capital city of Lima and the regional capital of Santiago, Chile on the coast. The old Inca capital was Cusco farther inland. The economy consisted mostly of forcing the native population to labor for the Spaniards and exporting to Spain. (TODO: what was exported?) Lima was remote from Spain because the route by ship involved passing around the tip of South America and also crossing the Atlantic ocean. (The Viceroyalty of the River Plate had split in 1776 because of the inconvenience of routing trade through Lima on the Pacific coast, instead of using Buenos Aires on the Atlantic coast.)

Farther north, there was more Spanish colonies. The northernmost regions of the Viceroyalty of Peru were, since 1734, separated from that viceroyalty as the Viceroyalty of New Granada, with a capital at Bogota, which was not a port city. Wikipedia claims that travel and communications inside the Viceroyalty (were) difficult.

The northernmost possession of the Viceroyalty of New Granada was Panama. North of that existed the Viceroyalty of New Spain. This administered the territory in the Americas north of Panama. Its capital was Mexico City. Across the Pacific ocean, in the west, this viceroyalty possessed the Philippines.

In China, the Qing Dynasty ruled. Qianlong Emperor ruled while Heshen took much power.

title: Modern History/World in 1783


text:
CA Unicenter NSM Textbook/Useful Links

CA Support Resources and Documentation
Obviously... supportconnect.ca.com The best place to go is to open Product Home Pages, then Unicenter Network and Systems Management in the drop down list. There are a number of links here but the most useful is the Latest Implementation CD, which has an excellent range of technical resource info, how to guides, and information about various obscure CA tools and utilities.

Unicenter Network and Systems Management: Working With Agents 3.1 This is pdf guide book available from CA that describes in detail the operation of the DSM and communication, and possible methods for configuring agents.

Diagnostics Guide The CA pdf Diagnostics Guide for Unicenter® TNG 2.4 Unicenter® Network and Systems Management 3.0 has an excellent guide to things to try and diagnose faults and problems.

Web Discussion Groups
Tek-tips maintain an active Unicenter newsgroup at: Tek-Tips. They also have newsgroups for many other CA products such as Brighstor/Arcserve

Apsion also have an active newsgroup for Unicenter users at: Apsion Unicenter Forum

SNMP Resources
No one can really leverage this toolset without understanding SNMP.

Bytesphere technologies host a free MIB database online, where you can review or download almost 5000 MIB files. Bytesphere Technologies MIB Area

title: CA Unicenter NSM Textbook/Useful Links


text:
CA Unicenter NSM Textbook/Command Reference

This section is designed to be an encyclopedia of NSM commands, each command should have as much detail as possible ordered in the following sections:

- Command Name - Syntax - Examples - Categories - When You Might Use It - Other Related Commands - NSM Versions and Platforms Applicable - Possible Bugs and Challenges

awservices unifstat unicntrl


text:
CA Unicenter NSM Textbook/Unifstat

Syntax
unifstat unifstat -c *|component -u *|sub-component unifstat -c xxx lists status of a component only

Examples
unifstat displays all components unifstat -TRP show status of TRP service (catrapd)

Categories
Enterprise Manager, Common services, catrapd, OPR

When You Might Use It
Shows the status of enterprise management components as either ACTIVE or INACTIVE. When a component is disabled via EM settings, has been stopped or just crashed for no reason (as the TRP often does) the status shows as INACTIVE.

When diagnosing any EM related problem along with awservices status, this is one of top two commands to check what the problem might be. typically you would run unicntrl start all after finding your treasured component is not running anymore.

Component names include: SEC Security, RPT Reporting, SCH Scheduling, UNI Common (calendar), SCHM Workload manager, SCHA Workload agent, TRP catrapd

Other Related Commands
awservices, unicntrl

NSM Versions and Platforms Applicable
should be all hosts with EM installed

Possible Bugs and Challenges
can be hard to figure out relationship between a component, sub-component and how this can be started or stopped using unicntrl

title: CA Unicenter NSM Textbook/Unifstat


text:
Template:CA Unicenter NSM Textbook/links

CA Unicenter NSM Textbook | Understanding Architecture | Delivering Value | Command Reference | Other Reference Commands | Issues and Workarounds | FAQ | Useful Links


text:
Guide to Unix/Explanations/Determining Hardware

Here are some methods of Determining Hardware currently on the system:

 * run dmesg (works well on *BSD)
 * use KDE Info Center (K Menu -> System -> Info Center)

Examples
Run dmesg on a *BSD system to determine the kernel version, amount of memory, and whether this computer has an audio device. $ dmesg | less ... OpenBSD 3.8 (GENERIC) #425: Sat Sep 10 15:49:26 MDT 2005 deraadt@macppc.openbsd.org:/usr/src/sys/arch/macppc/compile/GENERIC real mem = 268435456 (262144K) avail mem = 236363776 (230824K) using 1254 buffers containing 13418496 bytes of memory mainbus0 (root) ... mpcpcibr1 at mainbus0: uni-north, Revision 0x5 pci1 at mpcpcibr1 bus 0 ... macobio0 at pci1 dev 23 function 0 "Apple Intrepid" rev 0x00 ... snapper0 at macobio0: irq 30,1,2 ... audio0 at snapper0 ...

This system has an OpenBSD 3.8 kernel, which matches the OpenBSD 3.8 operating system distribution. (Generally, the kernel on a *BSD matches some version of the system. In contrast, there are many combinations of Linux kernels and systems.)

The real memory is 262144K, but only 230824K is "avail", which probably means available. Divide by 1024 to convert to megabytes, using bc or some other method: $ bc 262144 / 1024 256 230824 / 1024 225 quit

This computer has 256 MB of memory, but only 225 MB are "avail". Because we used bc, the answers are rounded down to integers.

This line from the dmesg output indicates the presence of an audio device: audio0 at snapper0

We can go up the dmesg, learning that we have audio0 at snapper0 at macobio0 at pci1 at mpcpcibr1 at mainbus0. However, we are probably only interested in "audio0", which means that we have an audio device, and "snapper0" if we want to know the type of sound card providing this audio. On this computer, it should be possible to install programs that play sound and music.


text:
Talk:English in Use/Time and Date

Untitled
I think that instructions for the more common method of telling time (e.g. Five-Zero-Four PM) should be added so that new English speakers will understand others and so that their speech does not sound stilted.

title: Talk:English in Use/Time and Date


text:
Gmail/Send mail

Need to send an email?

Gmail makes it very easy to send emails to your friends. First log into your Gmail account. Once you have logged into your account, you will notice a prominent link under the Gmail logo that reads, "+ Compose". The "+ Compose" link is the link you will be pressing whenever you send an email.

Analyzing the screen

Once you click the "Compose Mail" link within your Gmail account, the page will change. You will be taken to a new page where you will actually write your email, or better said, compose your email. Lets analyze this new page.

First you will notice that there are three new buttons that have appeared. These buttons are in the following order: Send, Save Now, and Discard. The Send button is only pressed once you have completed composing your email in order to send the email to the addressee. The Save Now button is used to save the email to your account's draft folder in order to access it, and maybe finish writing the email, in a later time. The Discard button is used when you would like to discard the email or better said, delete the email. Take note that when you discard an email it is deleted and unrecoverable.

Next we will notice there is a To: field on the page. This field is where you type the email address of the person you are sending the email to. For example, if you are sending an email to Linus and his email is linus@linux.org then you will type linus@linux.org into the To: field. You can also send the same email to multiple email address by adding a ; between email address. For example, I can send an email to more than one friend by typing their emails into the To: field in the following format: linus@linux.org; richardstallman@gnu.org

The next text field that we see is the Subject field. This is where you type the subject of the email. The subject will be seen by the person that you are sending the email prior to he or she opening the email. It is good practice to include descriptive but short subjects whenever possible.

Last but not least, we have the body field. This field is not labeled as body but that is what it is called. The body field is where you will be writing your email.

How to send the email

Once you have filled in each field you will be able to send the email. This is done by pressing the Send button which is located at the bottom of the screen. Try to send an email to your self in order to practice the fine art of email composing.

title: Gmail/Send mail


text:
Bartending/Techniques/Blended cocktails

Frozen drinks, freezes, or blended drinks all refer to drinks made by blending ice, liqueurs, and mixers. Smoothies are popular in many parts of the United States now, and in much the same fashion involve blending ice, juice, and fruit.

Almost any of these can be made virgin by simply removing the alcohol; it is recommended to blend the drinks virgin and pour into a glass with the alcohol waiting. This allows a single, large blender to be made full of the drink and served to minors and other non-drinkers as well as legal drinkers; and also allows you to avoid washing the blender if you're hammering out, say, 4 Piña Coladas for some kids, 1 for the designated driver, and 2 for a couple teachers needing a good nerve relaxant.

Making a blended drink
Follow the below instructions when mixing a freeze. Remember to use a heavy-duty blender capable of continuously crunching through ice; most residential-quality blenders will quickly dull, wear, or break if given the task of constantly chopping ice cubes into bits and pieces. If you're going for simple preparation at home, make sure the blender you buy can handle ice; if you want to hold parties or open a bar as a small business, get a heavier duty one that can stand the workload.

 * Make sure the blender is off.
 * Stack the blender a quarter full of ice.
 * Begin adding the mixers until the ice just begins to float.
 * Put the lid on. If you're wondering what will happen if you don't, then leave the lid off.
 * Make sure no hair, fingers, or clothing are trapped in the blender or anywhere they can get caught up in.
 * Hold the lid down with one hand.
 * Start the blender at low speed.
 * After a few seconds, switch to high speed until the ingredients are well blended.
 * Pour the mixed drink into the glass, over whatever alcohol is being added.

Coladas

 * Piña Colada

Virgin blended drinks

 * Pink Snowman

title: Bartending/Techniques/Blended cocktails