Will Apple offer a matte replacement for the Alum Macs Glossy Screen?

I bought an Aluminum iMac; and yes I love the speed etc; but the one flaw in my opinion (others might disagree) is that horrific mirror like glossy glass screen.
The glare was intolerable for anyone with an artistic eye.
I solved the problem imperfectly with a anti glare film (photodon) and its a good temp solution.
But ultimately can anyone speculate whether apple will offer a replacement matte screen? I know its easily removable; can a matte screen be added in place of the glass and still have a great display? Might they offer it as an option in the future? If not; why not?
thanks

It is simply a sheet of plate glass held in place with magnets. Supposedly it has some sort of anti-glare coating on it, but it's not apparent. You might try taking it off and bringing it to an art supply store to have them cut you an identically sized piece of anti-glare glass. I'm surprised that by this point there isn't already an after-market supplier making them for the iMac.

Similar Messages

TS2755 When will Apple ever make it convenient for the customer, I just bought an iPad Air and I'm very upset that I can only use iMessage, iPads are the biggest mistake to buy. I'll never buy another if I can text using SMS or MMS

When will Apple ever make it convenient for the customer, I just bought an iPad Air and I'm very upset that I can only use iMessage, iPads are the biggest mistake to buy if you like texting family and friends. I'll never buy another one if I can't text using SMS or MMS. Is there any hope for a patch or new operating system to fix this issue, or an app to use with iPad Air

To send messages to non-Apple devices, check out the TextFree app https://itunes.apple.com/us/app/text-free-textfree-sms-real/id399355755?mt=8
How to Send SMS from iPad
http://www.iskysoft.com/apple-ipad/send-sms-from-ipad.html
How to Receive SMS Messages on an iPad
http://yourbusiness.azcentral.com/receive-sms-messages-ipad-16776.html
Apps for Texting http://appadvice.com/appguides/show/apps-for-texting
 Cheers, Tom

I have an iPad 1 and would like to buy the new iPad. Will Apple exchange my old iPad for the new one . I live in Saudi Arabia.

I have an iPad 1 and would like to buy the new iPad. Will Apple exchange my old iPad for the new one . I live in Saudi Arabia.

Apple does not take trade-ins. You'll have to look for a dealer that does, though you'll probably get more for the iPad 1 if you sell it yourself.
Regards.

Will apple ever update imovie software for the desktop

In the Fall of 2010, Apple released iMovie 11' and since the release of the iPad, they seem to only be creating updates for iMovie on the iPad, iPhone and iPod Touch!!! I want to know if Apple is going to update it on OSX.

The last update to iMovie '11 (to version 9.0.8 if I remember correctly) was in Sep 2012. iMovie is in the App Store.
Ninja'd, darn it!
Message was edited by: g_wolfman

Will Apple offer a simple downgrade for those with messed up apps?

I wonder If perhaps Apple can give me a simple way to Downgrade my iPhone back to 3.13 and keep my settings and apps intact. The new software screwed up 2 apps that I not only bought the iPhone for but spent 100.00 on cable acessories specificly for these apps, Tv out. OK I love the phone now for many other reasons but the 100 bucks is in the trash. All I wanted was folders. I will give up the folders to get my Air Video Tv out back

No, you cannot go back.
Apple are in the market for sales. Its all money. The likes of you and I do not count. They want you to make the mistake and then throw the old phone away in favour of a new one.
Do not despair! there is a jailbreak just being released that will get you back to 3.1.3. If I give you the link, the little spies at Apple will zap my post - but if you google iphone and unlock, the chances are it will be top of the list...

Does Apple offer a Protection Plan for the IPhone

Does the IPHone have an Apple protection Plan now?

yup its true apple dose.. but just be aware that it dose not cover normal ware n tare =/
b. Limitations. The Plan does not cover:(ii) Damage to the Covered Equipment caused by accident, abuse, neglect, misuse (including faulty
installation, repair, or maintenance by anyone other than Apple or an Apple Authorized Service
Provider), unauthorized modification, extreme environment (including extreme temperature or
humidity), extreme physical or electrical stress or interference, fluctuation or surges of electrical
power, lightning, static electricity, fire, acts of God or other external causes;

If my iphone 3g screen has smashed and my phone is out of warranty. will apple be able to replace the phone for me or repair the screen?

if my iphone 3g screen has smashed and my phone is out of warranty. will apple be able to replace the phone for me or repair the screen?
i heard apple can upgrade my phone if a pay a specific amount? is this correct?
also if my phone is out of warranty how much would it cost for it to be replaced?

Apple does not repair smashed phones. It will replace the phone with another iPhone 3G as an out of warranty exchange for 199.00 USD.
You should check with your carrier to see if you are eligible for a subsidized iPhone 4. It may cost you the same as the out of warranty replacement for a phone almost 3 generations old.

Will Apple stores in Germany replace your iPhone if there is internal hard drive problems from a phone from the US. I am studying abroad and won't be home until December

Will Apple stores in Germany replace your iPhone if there is internal hard drive problems from a phone from the US. I am studying abroad and won't be home until December

You can try, but the iPhone warranty terms state that Apple "may" restrict warranty/service to country of original purchase...key word here is "may".
Good luck.

Nvidia 7900 GFX card now out!! When will Apple offer it???

Nvidia 7900 GFX card now out!! When will Apple offer it???
Hoping to get one and run Aperture with it sooner rather then wait months like usuall. PC users always get to use it before us
Where can a person order the 7800 from anyway??? Anyone know?

This would be more of an Apple request than Nvida idea. Apple have certain G5 customers to keep sweet (specificially ME!) who want to trade-up. NVida is not going to decide to offer a specific 7900/7600 card for such a low demand. So its Apples decision, i guess, to make the request, set engineering specs and prices. NVida might just want to charge a steep premium to customise the card bios, debug and then test it. Apple really need to put effort into this for our sake.
All this may be irrelevant IF there is a contract between Apple and NVida that states nVida supply 'latest and greatest' video cards no matter what technology nvida is using. Who knows.
What is worrying is we are such a small quantity of (dual-core) users who need a card upgrade that some toad may think it not worthwhile. Time will tell, but Joe Scherr's (sp?) comment on the 'dual 6600' thread is encouraging.

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

What will Apple charge me to replace hard drive?

My iMac hard drive is failing and needs to be replaced (according to Disk Utility). What will Apple charge me to replace hard drive or should I just do it myself? Purchased new in mid-2010 and I do not have AppleCare. I've seen videos on replacing the hard drive and it seems a bit tricky. Any advice?

Thanks for the response and suggestion. I will give them a call once I get ho,e and have my serial number etc on hand. If anyone has done this, please post what you were charged. Thanks!

I have a ipod classic 5th gerneration. Is there any way I can get a new battery for it? Or does Apple only get new batteries for the 7th generations? Thanks

I have a ipod classic 5th gerneration. Is there any way I can get a new battery for it? Or does Apple only get new batteries for the 7th generations? Thanks

Yes you can still purchase replacement batteries your iPod from third party repair companies. Apple does not offer replacement parts.
Do a Google search for iPod battery replacement and you should get a plethora of results. There are many good deals on Amazon and eBay.
B-rock

Will Apple get out a fix for iOS6? it's terrible

Will Apple get out a fix for iOS6? it's terrible

Since the very first iphone/ipod/ipad, Apple has consistently released software updates/improvements/bug fixes.
There is no reason to believe that they will stop doing this now.

When will Aperture 3 support RAW processing for the Canon 5D III?

When will Aperture 3 support RAW processing for the new Canon 5D III?

We are no phophets and also do not work for Apple - so we don't know.
See this thread to join into a discussion with others who also are waiting:
Canon 5D Mk III - RAW update?
Regards
Léonie

Will Apple offer a matte replacement for the Alum Macs Glossy Screen?

Similar Messages

Maybe you are looking for