Replacement for the Leopard Folder Blahs

I love Leopard but must agree with others that the generic Folders are especially blah. I spiced them up by downloading some new sets. I placed the chosen icon in my Dock folders with a "*" before the name so they appear first when you sort by name. Here's the result.
!http://idisk.mac.com/elvisapso/iSticker Toolbat icons.tiff!

Embarrassing and frustrating! I've designed hundreds of websites yet there's no simple way to display a link to a file on .mac account? Great going Apple! That's why I use a real web host. Anyhow, for anyone still interested, you can DL the screen capture at the following lame link. I was trying to help but .mac sure put a damper (and hamper) on my effort.
http://homepage.mac.com/WebObjects/FileSharing.woa/wa/default?user=elvisapso&tem platefn=FileSharing1.html&xmlfn=TKDocument.1.xml&sitefn=RootSite.xml&aff=consume r&cty=US&lang=en

Similar Messages

A replacement for the Quicksort function in the C++ library

Hi every one,
I'd like to introduce and share a new Triple State Quicksort algorithm which was the result of my research in sorting algorithms during the last few years. The new algorithm reduces the number of swaps to about two thirds (2/3) of classical Quicksort. A multitude
of other improvements are implemented. Test results against the std::sort() function shows an average of 43% improvement in speed throughout various input array types. It does this by trading space for performance at the price of n/2 temporary extra spaces.
The extra space is allocated automatically and efficiently in a way that reduces memory fragmentation and optimizes performance.
Triple State Algorithm
The classical way of doing Quicksort is as follows:
- Choose one element p. Called pivot. Try to make it close to the median.
- Divide the array into two parts. A lower (left) part that is all less than p. And a higher (right) part that is all greater than p.
- Recursively sort the left and right parts using the same method above.
- Stop recursion when a part reaches a size that can be trivially sorted.
The difference between the various implementations is in how they choose the pivot p, and where equal elements to the pivot are placed. There are several schemes as follows:
[ <=p | ? | >=p ]
[ =p | ? ]
[ <=p | =p | ? | >p ]
[ =p | p ] Then swap = part to middle at the end
[ =p | p | =p ] Then swap = parts to middle at the end
Where the goal (or the ideal goal) of the above schemes (at the end of a recursive stage) is to reach the following:
[ p ]
The above would allow exclusion of the =p part from further recursive calls thus reducing the number of comparisons. However, there is a difficulty in reaching the above scheme with minimal swaps. All previous implementation of Quicksort could not immediately
put =p elements in the middle using minimal swaps, first because p might not be in the perfect middle (i.e. median), second because we don’t know how many elements are in the =p part until we finish the current recursive stage.
The new Triple State method first enters a monitoring state 1 while comparing and swapping. Elements equal to p are immediately copied to the middle if they are not already there, following this scheme:
[ p ]
Then when either the left (<p) part or the right (>p) part meet the middle (=p) part, the algorithm will jump to one of two specialized states. One state handles the case for a relatively small =p part. And the other state handles the case for a relatively
large =p part. This method adapts to the nature of the input array better than the ordinary classical Quicksort.
Further reducing number of swaps
A typical quicksort loop scans from left, then scans from right. Then swaps. As follows:
while (l<=r)
while (ar[l]<p)
l++;
while (ar[r]>p)
r--;
if (l<r)
{ Swap(ar[l],ar[r]);
l++; r--;
else if (l==r)
{ l++; r--; break;
The Swap macro above does three copy operations:
Temp=ar[l]; ar[l]=ar[r]; ar[r]=temp;
There exists another method that will almost eliminate the need for that third temporary variable copy operation. By copying only the first ar[r] that is less than or equal to p, to the temp variable, we create an empty space in the array. Then we proceed scanning
from left to find the first ar[l] that is greater than or equal to p. Then copy ar[r]=ar[l]. Now the empty space is at ar[l]. We scan from right again then copy ar[l]=ar[r] and continue as such. As long as the temp variable hasn’t been copied back to the array,
the empty space will remain there juggling left and right. The following code snippet explains.
// Pre-scan from the right
while (ar[r]>p)
r--;
temp = ar[r];
// Main loop
while (l<r)
while (l<r && ar[l]<p)
l++;
if (l<r) ar[r--] = ar[l];
while (l<r && ar[r]>p)
r--;
if (l<r) ar[l++] = ar[r];
// After loop finishes, copy temp to left side
ar[r] = temp; l++;
if (temp==p) r--;
(For simplicity, the code above does not handle equal values efficiently. Refer to the complete code for the elaborate version).
This method is not new, a similar method has been used before (read: http://www.azillionmonkeys.com/qed/sort.html)
However it has a negative side effect on some common cases like nearly sorted or nearly reversed arrays causing undesirable shifting that renders it less efficient in those cases. However, when used with the Triple State algorithm combined with further common
cases handling, it eventually proves more efficient than the classical swapping approach.
Run time tests
Here are some test results, done on an i5 2.9Ghz with 6Gb of RAM. Sorting a random array of integers. Each test is repeated 5000 times. Times shown in milliseconds.
size std::sort() Triple State QuickSort
5000 2039 1609
6000 2412 1900
7000 2733 2220
8000 2993 2484
9000 3361 2778
10000 3591 3093
It gets even faster when used with other types of input or when the size of each element is large. The following test is done for random large arrays of up to 1000000 elements where each element size is 56 bytes. Test is repeated 25 times.
size std::sort() Triple State QuickSort
100000 1607 424
200000 3165 845
300000 4534 1287
400000 6461 1700
500000 7668 2123
600000 9794 2548
700000 10745 3001
800000 12343 3425
900000 13790 3865
1000000 15663 4348
Further extensive tests has been done following Jon Bentley’s framework of tests for the following input array types:
sawtooth: ar[i] = i % arange
random: ar[i] = GenRand() % arange + 1
stagger: ar[i] = (i* arange + i) % n
plateau: ar[i] = min(i, arange)
shuffle: ar[i] = rand()%arange? (j+=2): (k+=2)
I also add the following two input types, just to add a little torture:
Hill: ar[i] = min(i<(size>>1)? i:size-i,arange);
Organ Pipes: (see full code for details)
Where each case above is sorted then reordered in 6 deferent ways then sorted again after each reorder as follows:
Sorted, reversed, front half reversed, back half reversed, dithered, fort.
Note: GenRand() above is a certified random number generator based on Park-Miller method. This is to avoid any non-uniform behavior in C++ rand().
The complete test results can be found here:
http://solostuff.net/tsqsort/Tests_Percentage_Improvement_VC++.xls
or:
https://docs.google.com/spreadsheets/d/1wxNOAcuWT8CgFfaZzvjoX8x_WpusYQAlg0bXGWlLbzk/edit?usp=sharing
Theoretical Analysis
A Classical Quicksort algorithm performs less than 2n*ln(n) comparisons on the average (check JACEK CICHON’s paper) and less than 0.333n*ln(n) swaps on the average (check Wild and Nebel’s paper). Triple state will perform about the same number of comparisons
but with less swaps of about 0.222n*ln(n) in theory. In practice however, Triple State Quicksort will perform even less comparisons in large arrays because of a new 5 stage pivot selection algorithm that is used. Here is the detailed theoretical analysis:
http://solostuff.net/tsqsort/Asymptotic_analysis_of_Triple_State_Quicksort.pdf
Using SSE2 instruction set
SSE2 uses the 128bit sized XMM registers that can do memory copy operations in parallel since there are 8 registers of them. SSE2 is primarily used in speeding up copying large memory blocks in real-time graphics demanding applications.
In order to use SSE2, copied memory blocks have to be 16byte aligned. Triple State Quicksort will automatically detect if element size and the array starting address are 16byte aligned and if so, will switch to using SSE2 instructions for extra speedup. This
decision is made only once when the function is called so it has minor overhead.
Few other notes
- The standard C++ sorting function in almost all platforms religiously takes a “call back pointer” to a comparison function that the user/programmer provides. This is obviously for flexibility and to allow closed sourced libraries. Triple State
defaults to using a call back function. However, call back functions have bad overhead when called millions of times. Using inline/operator or macro based comparisons will greatly improve performance. An improvement of about 30% to 40% can be expected. Thus,
I seriously advise against using a call back function when ever possible. You can disable the call back function in my code by #undefining CALL_BACK precompiler directive.
- Like most other efficient implementations, Triple State switches to insertion sort for tiny arrays, whenever the size of a sub-part of the array is less than TINY_THRESH directive. This threshold is empirically chosen. I set it to 15. Increasing this
threshold will improve the speed when sorting nearly sorted and reversed arrays, or arrays that are concatenations of both cases (which are common). But will slow down sorting random or other types of arrays. To remedy this, I provide a dual threshold method
that can be enabled by #defining DUAL_THRESH directive. Once enabled, another threshold TINY_THRESH2 will be used which should be set lower than TINY_THRESH. I set it to 9. The algorithm is able to “guess” if the array or sub part of the array is already sorted
or reversed, and if so will use TINY_THRESH as it’s threshold, otherwise it will use the smaller threshold TINY_THRESH2. Notice that the “guessing” here is NOT fool proof, it can miss. So set both thresholds wisely.
- You can #define the RANDOM_SAMPLES precompiler directive to add randomness to the pivoting system to lower the chances of the worst case happening at a minor performance hit.
-When element size is very large (320 bytes or more). The function/algorithm uses a new “late swapping” method. This will auto create an internal array of pointers, sort the pointers array, then swap the original array elements to sorted order using minimal
swaps for a maximum of n/2 swaps. You can change the 320 bytes threshold with the LATE_SWAP_THRESH directive.
- The function provided here is optimized to the bone for performance. It is one monolithic piece of complex code that is ugly, and almost unreadable. Sorry about that, but inorder to achieve improved speed, I had to ignore common and good coding standards
a little. I don’t advise anyone to code like this, and I my self don’t. This is really a special case for sorting only. So please don’t trip if you see weird code, most of it have a good reason.
Finally, I would like to present the new function to Microsoft and the community for further investigation and possibly, inclusion in VC++ or any C++ library as a replacement for the sorting function.
You can find the complete VC++ project/code along with a minimal test program here:
http://solostuff.net/tsqsort/
Important: To fairly compare two sorting functions, both should either use or NOT use a call back function. If one uses and another doesn’t, then you will get unfair results, the one that doesn’t use a call back function will most likely win no matter how bad
it is!!
Ammar Muqaddas

Thanks for your interest.
Excuse my ignorance as I'm not sure what you meant by "1 of 5" optimization. Did you mean median of 5 ?
Regarding swapping pointers, yes it is common sense and rather common among programmers to swap pointers instead of swapping large data types, at the small price of indirect access to the actual data through the pointers.
However, there is a rather unobvious and quite terrible side effect of using this trick. After the pointer array is sorted, sequential (sorted) access to the actual data throughout the remaining of the program will suffer heavily because of cache misses.
Memory is being accessed randomly because the pointers still point to the unsorted data causing many many cache misses, which will render the program itself slow, although the sort was fast!!.
Multi-threaded qsort is a good idea in principle and easy to implement obviously because qsort itself is recursive. The thing is Multi-threaded qsort is actually just stealing CPU time from other cores that might be busy running other apps, this might slow
down other apps, which might not be ideal for servers. The thing researchers usually try to do is to do the improvement in the algorithm it self.
I Will try to look at your sorting code, lets see if I can compile it.

Replacement for the Replacement? help!! 1st generation program

Hi my name is Juan Robles I recently enter to the 1st generation ipod program replacement, and they do send me a better ipod touch nano 8 gb 6 generation.
but it doesn't charge, i let it charge for a hole day and I even try it with a usb cable and a wall charger and once you disconected, it goes dead not even a blink... but if i plug it back to the cable it turn on very fast in less than 5 seconds.
My question is do they support a replacement for the replacement they send me, it is less than 90 days of from the date of service.
The Fedex box, the one with the replacement new ipod don't have the return address like the first one, the one where i send my 1st generation ipod. So any one resolve a similar issue , i will love to have the return address. I allready try the thec phone support but they put me on hold for more tha a hour and nothing.
Thanks in advance...

Apple Service Operations
3011 Laguna Blvd., Building A
ELk Grove, CA 95758

How to check for the sub folder in the document library Is already Exist using CSOM?

Hi,
My requirement is to create the folder and sub folder in SharePoint document library. If already exist leave it or create the new folder and the subfolder in the Document library using client side object model
I able to check for the parent folder.
But cant able to check the subfolder in the document library.
How to check for the sub folder in the document library?
Here is the code for the folder
IsFolder alredy Exist.
private
string IsFolderExist(string InputFolderName)
string retStatus = false.ToString();
try
ClientContext context =
new ClientContext(Convert.ToString(ConfigurationManager.AppSettings["DocumentLibraryLink"]));
 context.Credentials =
CredentialCache.DefaultCredentials;
List list = context.Web.Lists.GetByTitle(Convert.ToString(ConfigurationManager.AppSettings["DocumentLibraryName"]));
FieldCollection fields = list.Fields;
CamlQuery camlQueryForItem =
new CamlQuery();
 camlQueryForItem.ViewXml =
string.Format(@"<View Scope='RecursiveAll'>
<Query>
 <Where>
<Eq>
<FieldRef Name='FileDirRef'/>
<Value Type='Text'>{0}</Value>
 </Eq>
</Where>
</Query>
 </View>",
@"/sites/test/hcl/"
+ InputFolderName);
 Microsoft.SharePoint.Client.ListItemCollection listItems = list.GetItems(camlQueryForItem);
 context.Load(listItems);
 context.ExecuteQuery();
if (listItems.Count > 0)
 retStatus =
true.ToString();
else
 retStatus =
false.ToString();
catch (Exception ex)
 retStatus =
"X02";
return retStatus;
thanks
Sundhar

Hi Sundhar,
According to your description, you might want to check the existence of sub folder in a folder of a library using Client Object Model.
Please take the code demo below for a try, it will check whether there is sub folder in a given folder:
public static void createSubFolder(string siteUrl, string libName, string folderServerRelativeUrl)
ClientContext clientContext = new ClientContext(siteUrl);
List list = clientContext.Web.Lists.GetByTitle(libName);
CamlQuery camlQuery = new CamlQuery();
camlQuery.ViewXml =
@"<View Scope='RecursiveAll'>
<Query>
<Where>
<Eq>
<FieldRef Name='FSObjType' />
<Value Type='Integer'>1</Value>
</Eq>
</Where>
</Query>
</View>";
//camlQuery.FolderServerRelativeUrl = "/Lib1/folder1";
camlQuery.FolderServerRelativeUrl = folderServerRelativeUrl;
ListItemCollection items = list.GetItems(camlQuery);
clientContext.Load(items);
clientContext.ExecuteQuery();
Console.WriteLine(items.Count);
if (0 == items.Count)
//create sub folder here
Best regards
Patrick Liang
TechNet Community Support

What are the correct permissions for the Home folder?

Since buying my first mac (G4 iMac) I've since bought 2 other macs & transferred my home folder from the older computer each time. Since then I've messed around with the permissions of the Home folder a few times to try share files & folders between my Windows PCs. So the permissions of the Home folder on all computers could be messed up a little.
I want to set up permissions how they should be set up as default.
I created another user account with admin priveliges & it looks like the Home folder should be set up as follows:
Owner: 'my name'
Access: Read & Write
Group: admin or 'my name'
Access: Read only
Others: Read only
And the sub folders (Documents, Pictures etc.) should be set up as follows:
Owner: 'my name'
Access: Read & Write
Group: admin or 'my name'
Access: No access
Others: No accesss
Is this correct, & if so shall I just set permissions on my Home folder exactly the same as the new account I set up?
Or is there some way of resetting permissions for the Home folder?
(I know repairing permissions with Disk Utility doesn't do this).
Power Mac G5 Dual 2.3, 2.5 GB RAM, 20 Cinema Display | MacBook Pro 2.0 15" Mac OS X (10.4.6)

Mac OS X does not have a built-in way of doing this, but you can make one yourself. Open the Script Editor in the /Applications/AppleScript/ folder and enter the following:
do shell script "chmod 755 ~"
try
do shell script "chmod 700 ~/Desktop"
end try
try
do shell script "chmod 700 ~/Documents"
end try
try
do shell script "chmod 700 ~/Library"
end try
try
do shell script "chmod 700 ~/Music"
end try
try
do shell script "chmod 700 ~/Pictures"
end try
try
do shell script "chmod 755 ~/Public"
end try
try
do shell script "chmod 755 ~/Sites"
end try
This script can be saved as an application, which makes it possible to fix the permissions on a home folder with two clicks. The try statements are included so that the script will run if a folder doesn't exist. If the ~ object is a symbolic link, the permissions on it may not be changed; you can use the code block
tell application "Finder"
set the_home to POSIX path of (home as alias)
end tell
do shell script ("chmod 755 " & the_home)
in this case. The rest of the script works as before.
(12450)

I used "my documents" for the profile folder, I removed the profile and firefox asked if i want to remove its file, and it took ALL my file except a few, all my photographs etc, are these now unrecoverable? as they are not in the recycle bin

I used "my documents" for the profile folder, I removed the profile and firefox asked if i want to remove its file, and it took ALL my file except a few, all my photographs etc, are these now unrecoverable? as they are not in the recycle bin
disaster, thanks firefox 1 year of photos lost

Thanks for the obvious question. I mean it. The very same thought came to me this morning and, sure enough, I had booted into another drive--my old one that, of course, had the old desktop, etc.
It didn't dawn on me that this was the case since I hadn't set it as a boot drive but I guess in the course of all the restarts I did, it got switched.
I'm back to normal again.

Is there a replacement for the canon 7d

Is there a replacement for the canon 7d

See this thread
http://forums.usa.canon.com/t5/EOS/Is-there-going-to-be-another-canon-7d-with-ten-frames-a-second/m-...

Exactly what IPod's are being received as replacement for the recalled 1st generation

Exactly what IPod's are being received as replacements for the recalled 1st generation one's

6th Generation Silver Nano 8GB

Remove KM permissions for childs folders and not for the father folder.

Hi Forum
   I am removing a "some_group" permisssion of a subfolder in a repository, but how can i remove only this subfolder permission and not the father permission ?
For example:
     I want the next the repository with the "some_gruup" permission for the father folder:
      /Folder
     But i want to remove the "sub_folder1" and "sub_folder2" permissions for "some_group", i haven´t do it because this is like an inherited permission of the father folder.
      /Folder/sub_folder1
      /Folder/sub_folder2
     But when i

I found the solution in the post The specified item was not found. by Avishai Zamir
The code is:
IAclSecurityManager asm = (IAclSecurityManager)sm;
IResourceAclManager ram = asm.getAclManager();
IResourceAcl ra = ram.getAcl(newResource);
/******************* BEGIN if the most important code ********************/
if(ra == null) {
     ram.removeAcl(newResource);
     ra = ram.createAcl(newResource);
/*******************     END of the most important code ******************/
IResourceAclEntryList rel = ra.getEntries();
IResourceAclEntryListIterator it = rel.iterator();
while (it.hasNext()) {
     ra.removeEntry(it.next());
Edited by: Josue Cruz on Jun 25, 2008 9:48 PM
Edited by: Josue Cruz on Jun 25, 2008 9:50 PM
Edited by: Josue Cruz on Jun 25, 2008 9:51 PM
Edited by: Josue Cruz on Jun 25, 2008 9:53 PM

Replacement for the J6400

We currently have a HP OfficeJet J6400 All-in-One Printer. It works fine and we are happy with it. However, our platforms are changing. We both have iPhones, iPads and iPods. We need to migrate to an Air Printer in order to make better use of our technology. It's a pain to have to send something to another platform (laptop) and then print.
My question is, which HP with Air Print would be a good replacement for the J6400. We still want all the features of an All-in-One.
Thanks,
Jim
This question was solved.
View Solution.

Hello jghannah
For a list of AirPrint printers check the right hand side of this page.
I personally think either the Officejet 6500A Plus or the Officejet Pro 8600 would be perfect for your upgrade. They share a similar design to that of the Officejet 6400 series. They all have Airprint as well. For a good comparison between them check out the following link: Officejets with Airprint Comparison
Don't forgot to say thanks by giving "Kudos" to those that help solve your problems.
When a solution is found please mark the post that solves your issue.

TS3048 Can you buy a replacement for the little battery cover on the left side of the wireless mouse?

Can you buy a replacement for the little battery cover on the left side of a wireless keyboard?

Did you try a Google search for one: battery cover for Apple wireless keyboard
OT

Performing a Find/Replace for an entire Folder of html files

Hello,
I have been working away on adding an include to my html pages and getting the code all set up for a header and footer. With lots of help from kind people on this forum I finally have it working!
Now I want to add this to an entire folder of 500 or so HTML pages.
Can someone walk me through how to do this?
I also want to eliminate some stupid code that I put in years ago to prevent right clicking.
Perhaps this is a multi step job? First get rid of old code. Then add new header. Then add new footer???
Here is the fully functioning page with the new code:
http://www.glennbartley.com/naturephotography/birds/ACORN%20WOODPECKER.html
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html>
<head>
<title>ACORN WOODPECKER</title>
<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
</head>
<body bgcolor="#000000" text="#CCCCCC" link="#CCCCCC" vlink="#CCCCCC" alink="#999999">
<div align="center">
<?php $filepath = $_SERVER['DOCUMENT_ROOT'] . '/naturephotography/Header-Test.html'; include($filepath); ?>
</div>
<h1 align="center">ACORN WOODPECKER</h1>
NORTH AMERICA
<img src="../GB Collection/Acorn Woodpecker - 01.jpg" alt="Acorn Woodpecker" width="530" height="775"> 
<img src="../GB Collection/Acorn Woodpecker - 02.jpg" alt="Acorn Woodpecker" width="530" height="775">
<img src="../GB Collection/Acorn Woodpecker - 03.jpg" alt="Acorn Woodpecker" width="530" height="775">
<img src="../GB Collection/Acorn Woodpecker - 04.jpg" alt="Acorn Woodpecker" width="530" height="775">
<img src="../GB Collection/Acorn Woodpecker - 05.jpg" alt="Acorn Woodpecker" width="530" height="775">
<img src="../GB Collection/Acorn Woodpecker - 06.jpg" alt="Acorn Woodpecker" width="775" height="530">
<img src="../GB Collection/Acorn Woodpecker - 07.jpg" alt="Acorn Woodpecker" width="530" height="775">
<img src="../GB Collection/Acorn Woodpecker - 08.jpg" alt="Acorn Woodpecker" width="530" height="775">
<div align="center"><?php $filepath = $_SERVER['DOCUMENT_ROOT'] . '/naturephotography/Footer-Test.html'; include($filepath); ?>
</div>
</body>
</html>
And an example of one of the existing pages:
http://www.glennbartley.com/naturephotography/birds/COMMON%20LOON.html
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html>
<head>

<SCRIPT LANGUAGE='JavaScript' type='text/javascript' >

</SCRIPT>
<title>COMMON LOON</title>
<meta name="description" content="Photographs of Common Loon in Ontario. Nature Wildlife and Landscape Photography. Bird Photography">
<meta name="keywords" content="Loon, Common Loon, bird photography, birds of Ontario, nature photography">
<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
<script language="JavaScript" type="text/JavaScript">

</script>
</head>
<body bgcolor="#000000" text="#CCCCCC" link="#CCCCCC" vlink="#CCCCCC" alink="#999999">
<h1 align="center">COMMON
LOON</h1>
<img src="../GB Collection/_Update - Aug 24, 2011/Common Loon - 19.jpg" width="775" height="530">
<img src="../GB Collection/_Update - Aug 24, 2011/Common Loon - 20.jpg" width="775" height="530">
<img src="../GB Collection/_Update - Aug 24, 2011/Common Loon - 21.jpg" width="530" height="775">
<img src="../GB Collection/_Update - Aug 24, 2011/Common Loon - 22.jpg" width="775" height="530">
<img src="../GB Collection/_Update - Aug 24, 2011/Common Loon - 23.jpg" width="775" height="530">
<img src="../GB Collection/_Update - Aug 24, 2011/Common Loon - 24.jpg" width="775" height="530">
<img src="../GB Collection/UPDATE - NOV 2012/NORTH AMERICA/Common Loon - 53.jpg" width="775" height="530">
<img src="../GB Collection/UPDATE - NOV 2012/NORTH AMERICA/Common Loon - 54.jpg" width="775" height="530">
<img src="../GB Collection/UPDATE - NOV 2012/NORTH AMERICA/Common Loon - 55.jpg" width="775" height="530">
<img src="../GB Collection/UPDATE - NOV 2012/NORTH AMERICA/Common Loon - 56.jpg" width="775" height="530">
<img src="../GB Collection/UPDATE - NOV 2012/NORTH AMERICA/Common Loon - 57.jpg" width="775" height="530">
<img src="../GB Collection/UPDATE - NOV 2012/NORTH AMERICA/Common Loon - 58.jpg" width="775" height="530">
<img src="../GB Collection/_Update - Aug 24, 2011/Common Loon - 25.jpg" width="530" height="775">
<img src="../GB Collection/_Update - Aug 24, 2011/Common Loon - 26.jpg" width="775" height="530">
<img src="../GB Collection/_Update - Aug 24, 2011/Common Loon - 27.jpg" width="775" height="530">
<img src="../GB Collection/_Update - Aug 24, 2011/Common Loon - 28.jpg" width="775" height="530">
<img src="../GB Collection/_Update - Aug 24, 2011/Common Loon - 29.jpg" width="775" height="530">
<img src="../GB Collection/_Update - Aug 24, 2011/Common Loon - 30.jpg" width="530" height="775">
<img src="../GB Collection/_Update - Aug 24, 2011/Common Loon - 31.jpg" width="775" height="530">
<img src="../GB Collection/_Update - Aug 24, 2011/Common Loon - 32.jpg" width="775" height="530">
<img src="../GB Collection/_Update - Aug 24, 2011/Common Loon - 33.jpg" width="775" height="530">
<img src="../GB Collection/_Update - Aug 24, 2011/Common Loon - 34.jpg" width="775" height="530">
<img src="../GB Collection/_Update - Aug 24, 2011/Common Loon - 35.jpg" width="775" height="530">
<img src="../GB Collection/_Update - Aug 24, 2011/Common Loon - 36.jpg" width="775" height="530">
<img src="../GB Collection/_Update - Aug 24, 2011/Common Loon - 37.jpg" width="775" height="530">
<img src="../GB Collection/_Update - Aug 24, 2011/Common Loon - 38.jpg" width="775" height="530">
<img src="../GB Collection/_Update - Aug 24, 2011/Common Loon - 39.jpg" width="530" height="775">
<img src="../GB Collection/_Update - Aug 24, 2011/Common Loon - 40.jpg" width="775" height="530">
<img src="../GB Collection/_Update - Aug 24, 2011/Common Loon - 41.jpg" width="775" height="530">
<img src="../GB Collection/_Update - Aug 24, 2011/Common Loon - 42.jpg" width="775" height="530">
<img src="../GB Collection/_Update - Aug 24, 2011/Common Loon - 43.jpg" width="775" height="530">
<img src="../GB Collection/_Update - Aug 24, 2011/Common Loon - 44.jpg" width="775" height="530">
<img src="../GB Collection/_Update - Aug 24, 2011/Common Loon - 45.jpg" width="775" height="530">
<img src="../GB Collection/_Update - Aug 24, 2011/Common Loon - 46.jpg" width="530" height="775">
<img src="../GB Collection/_Update - Aug 24, 2011/Common Loon - 47.jpg" width="775" height="530">
<img src="../GB Collection/_Update - Aug 24, 2011/Common Loon - 48.jpg" width="775" height="530">
<img src="../GB Collection/_Update - Aug 24, 2011/Common Loon - 49.jpg" width="775" height="530">
<img src="../GB Collection/_Update - Aug 24, 2011/Common Loon - 50.jpg" width="775" height="530">
<img src="../GB Collection/_Update - Aug 24, 2011/Common Loon - 51.jpg" width="775" height="530">
<img src="../GB Collection/_Update - Aug 24, 2011/Common Loon - 52.jpg" width="775" height="530">
<img src="../GB Collection/Common Loon - 01.jpg" width="775" height="530">
<img src="../GB Collection/Common Loon - 14.jpg" width="775" height="530">
<img src="../GB Collection/Common Loon - 11.jpg" width="775" height="530">
<img src="../GB Collection/Common Loon - 02.jpg" width="775" height="530">
<img src="../GB Collection/Common Loon - 03.jpg" width="775" height="530">
<img src="../GB Collection/Common Loon - 04.jpg" width="775" height="530">
<img src="../GB Collection/Common Loon - 05.jpg" width="1010" height="530">
<img src="../GB Collection/Common Loon - 06.jpg" width="775" height="530">
<img src="../GB Collection/Common Loon - 07.jpg" width="775" height="530">
<img src="../GB Collection/Common Loon - 08.jpg" width="775" height="530">
<img src="../GB Collection/Common Loon - 09.jpg" width="775" height="530">
<img src="../GB Collection/Common Loon - 10.jpg" width="775" height="530">
<img src="../GB Collection/Common Loon - 12.jpg" width="775" height="530">
<img src="../GB Collection/Common Loon - 13.jpg" width="775" height="530">
<img src="../GB Collection/Common Loon - 15.jpg" width="775" height="530">
</body>
</html>

Hello,
Thank you for the info. I did as you described and it worked like a charm.
I have removed the old code and added in teh header.
I'm kind of stumped as to how to put in the footer though as there isnt really anything to "find"?
How can I replace something at the very end of the document??
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html>
<head>
<title>AMERICAN AVOCET</title>
<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
</head>
<body bgcolor="#000000" text="#CCCCCC" link="#CCCCCC" vlink="#CCCCCC" alink="#999999">
<div align="center">
<?php $filepath = $_SERVER['DOCUMENT_ROOT'] . '/naturephotography/Header-Test.html'; include($filepath); ?>
</div>
<h1 align="center">AMERICAN
AVOCET</h1>
<img src="../GB Collection/American Avocet - 21.jpg" alt="American Avocet Image" width="775" height="530">
<img src="../GB Collection/American Avocet - 22.jpg" alt="American Avocet Image" width="775" height="530">
<img src="../GB Collection/American Avocet - 23.jpg" alt="American Avocet Image" width="775" height="530">
<img src="../GB Collection/American Avocet - 18.jpg" alt="American Avocet Image" width="775" height="530">
<img src="../GB Collection/American Avocet - 19.jpg" alt="American Avocet Image" width="775" height="530">
<img src="../GB Collection/American Avocet - 20.jpg" alt="American Avocet Image" width="530" height="775">
<img src="../GB Collection/American Avocet-11.jpg" alt="American Avocet Image" width="775" height="530">
<img src="../GB Collection/American Avocet-12.jpg" alt="American Avocet Image" width="775" height="530">
<img src="../GB Collection/American Avocet-09.jpg" alt="AMERICAN AVOCET" name="Avocet" width="775" height="530" id="Avocet">
<img src="../GB Collection/American Avocet-17.jpg" width="775" height="530">
<img src="../GB Collection/American Avocet-16.jpg" width="775" height="530">
<img src="../GB%20Collection/Avocet%20-%20CRW_5390-02.jpg" width="775" height="530">

<img src="../GB Collection/American Avocet-15.jpg" width="775" height="530">
<img src="../GB Collection/American Avocet-14.jpg" width="775" height="530">
<img src="../GB Collection/American Avocet-13.jpg" width="775" height="530">
<img src="../GB Collection/American Avocet-10.jpg" width="775" height="530">
<img src="../GB Collection/American Avocet-08.jpg" width="775" height="530">
<img src="../GB Collection/American Avocet-07.jpg" width="775" height="530">
<img src="../GB Collection/American Avocet-06.jpg" width="775" height="530">
<img src="../GB Collection/American Avocet-05.jpg" width="775" height="530">
<img src="../GB Collection/American Avocet-04.jpg" width="775" height="530">
<img src="../GB Collection/American Avocet-03.jpg" width="775" height="530">
<img src="../GB Collection/American Avocet-02.jpg" width="775" height="530">
 
 
</body>
</html>

Where can I find a replacement for the power adapter tip?

I need to replace the small adapter that allows the power adapter to be inserted into a socket. Does apple sell this part separately?
The adapter itself works fine. But the tip that gets inserted into the adapter, and then the wall, has started to make sparks. I'm afraid it's going to catch fire, or cause a fire. When plugged into the wall, I hear sparks and I see smoke coming out. If I adjust it's position by slightly withdrawing it from the wall socket, so that there is minimal contact, the sparks stop. But I am a little worried now that I can't leave my MacBook Pro retina plugged in without risk of fire. This started about a month ago after two years of use without any issues.
To be clear, I'm not talking about the adapter itself, but the tip that gets inserted into the adapter, and in turn allows the adapter to be inserted into a socket.
It seems wrong to shell out $80 for a whole new adapter when all I need to replace is the wall adapter.

What about the world travel adapter
http://store.apple.com/us/product/MB974ZM/B?fnode=MTY1NDEwMQ
The Kit is designed to work with iPod, iPhone, iPad, Apple MagSafe Power Adapters (for MacBook and MacBook Pro), Portable Power Adapters (for iBook and PowerBook), and AirPort Express.

Sort files in Finder column view for the current folder only?

Hi,
I don't really understand how finder sort settings work, even after using OS X since it first came out. Maybe someone can give me a hand.
I'm trying to sort files inside one specific folder according to their name decending. In general I have arranged them by label and sorted by file name ascending. Every time I try to use the settings in the "display options" (cmd+J), this applies also to several other folders. Even if I right-click on that particular folder to enter the settings.
Isn't it possible to apply different sort/arrange options to individual folders?
p.

For column view, there is only one arrange/sort, no matter where you are in the hierarchy. It is based on what the arrange/sort was set on the original folder opened.
In the View Options, the Brows by ??? view checkbox controls what happens when you open a folder from that view. If it is set, then the folder opens in the same view as the enclosing folder. If unchecked, and you have set a view on a folder, that folder will open in the desired view.
Again, this does not apply in column view. Column view has only one arrange/sort for the entire hierarchy.

Cost for replacement for the retina display on my iphone 4S

I droped my iPhone 4s and theres a large strip of dead pixals on the left edge plus a liquid that has crept over the top left coner of my screen. I also have many arrayed dead pixals across my screen.
I am thinking of replacing the retina display but im not sure how much it will cost.
Does anyone have had this problem or had it fixed?
Thankyou

Out-of-Warranty Service
If you own an iPhone that is ineligible for warranty service but is eligible for Out-of-Warranty (OOW) Service, Apple will service your iPhone for the Out-of-Warranty Service fee listed below.
iPhone model
Out-of-Warranty Service
iPhone 5
$229
iPhone 4S
$199
iPhone 4, iPhone 3GS,
iPhone 3G, Original iPhone
$149
A $6.95 shipping fee will be added if service is arranged through Apple and requires shipping. All fees are in U.S. dollars and are subject to local tax.

Replacement for the Leopard Folder Blahs

Similar Messages

Maybe you are looking for