We are getting some messages with this subject line: {Phishing Fraud?} {HTML Disarmed}
RE: Smart Receipt
Obviously the RE: Smart Receipt is the actual subject of the email. Where did the Phishing Fraud and HTML statement come from? There is nothing in the Ironport documentation about this when I did a search.
I think it is nothing defined by Ironport. Either it is something defined by yourself (content/message filter) or it was already in the message from the sending part.
Peter
Similar Messages
-
One day ago I inadvertantly removed my applications folder. In it's place is a folder with a black question mark which appeared after I attempted to open up the applications file. Also, previously when I clicked on the file applications would open in a fan display. Could I please get some assistance with this?
...removed my applications folder.
From where? And to where?
If you trashed it and emptied the trash, what backup, if any, do you have? If it's still in the Trash, move it back.
If no backup, reinstall Snow, which will give you the version as of the DVD you use, then update back to 10.6.8, and run all other needed updates, including any security updates. This should save all your third party programs, as well as settings.
The white puff of smoke is nothing, it only means you moved it out of the Dock. If you still have it, or had it, as soon as you open it it would reappear in the Dock. The item in the Dock is only a kind of alias. -
Who can I contact about getting some help with this ongoing (several months) issue???
I will try to make a long story at least somewhat shorter.Comcast customer for 20 years (yes - literally 20 uninterrupted years). 8 years of service at current address.Several months ago I restructure my bill - all my promotions etc had run out and I wanted to reduce my bill. Ended up being told my customer support that I could save money by getting the "Triple Play" (I've NEVER had comcast phone service, I have my own VOIP phone solution). They told me I didn't have to "use" the phone, just getting it hooked up would save me money. Fine.Internet service was not supposed to have been touched / changed at all. A few days after making these changes, a large box from Comcast shows up at the house. It has TWO cable modems in the box. Not sure why they sent them - I already had the latest cable modem (that was capable of supporting the phone service they needed to activate). Notified comcast about the shipment. They said don't worry about it. Okay, I left them in the box. Tech shows up at house while I'm working. Wife called and I talked to tech. He said he just needed to get some "numbers" off the modem to activate the phone service (I'm in the IT industry - I will assume he wanted MAC / SN#'s). I made sure he was making no changes to the modem itself - I've got my own home network setup. The Comcast cable modem serves as a gateway and it's in bridged mode. Always has been. I have my own router etc. So a week or so after that visit, the modem started losing connectivity. It happens almost EVERY DAY and it's almost always in the later afternoon (5:30-7pm EST) and sometimes late at night. When this happens, the ONLY way to get the connection back is to unplug modem power AND the coax cable input. It will then restart the modem and it comes back. Simply unplugging power and restarting will not do it. After multiple hours spent with support on the phone (we activated the newest modem they sent - same issue. Activated the other modem they sent - same issue. In fact they weren't able to put one of them in bridged mode at all). They said a tech needed to come out. Tech comes out - checks the feed to the house. Said there is a lot of noise in the lines. (Please note that there is one main comcast feed to my house - it splits outside (in the comcast locked box) into two feeds which enter the house. One feed splits and runs the upstairs TV's (Digital Adapters) and the downstairs STB / DVR. The other feed goes DIRECTLY to my cable modem. I ran those feeds myself when I moved in this house. Never had an issue before. Cable TV never has issue - only internet. So the tech replaced some ends on the upstairs line (Cable TV - he said that signal noise could cause issues with the internet). I then helped the tech run a BRAND NEW line from the split at the comcast box, directly to the modem. He said the signal / noise looked much better. Next day - same ISSUE - modem dropped connection. Pull power and coax cable, reseat, modem restarts, signal comes back. I called support again. They gave me an incident #. Said they would have a "Crew supervisor" contact me, since it's obvious the problem lies outside of my home. A tech called and left a voice mail on my phone (was working when it came in, couldn't answer). They did not leave a call back number. Called support again. They told me a tech would call me back and was advised to leave a call back number. That was MONDAY of last week. Haven't heard anything. The contact # is my cell...no missed calls. Is there another number I can call or email address so I can escalate this issue? Having to disconnect / reconnect the modem EVERY DAY at least once is getting tiresome. I'm in the Richmond Virginia area if it matters at all. Thanks.
ctandc-
I am so sorry for the delay! I am sending you a private message so that we can discuss your billing concerns more freely.
At the top of each Forum page, you will see a small gray envelope icon. This icon will have a number next to it if you have any new messages waiting. To open a PM to read it, double click on the envelope. If you click on the white envelope a window will open with tabs for your Private Message Inbox, Sent Messages, Friends, Ignored Users, and Compose new Message. You can also access this area by clicking on the Username in a Thread or post. By default, Private Messages are enabled. You can disable this feature in My Settings>Preferences> Private Messenger. -
Could i get some help with this one
the aim of this project is to make a n by n maze and traverse this. if, while traversing the maze the system realises that there is a dead end it turns back. My problem is that sometimes it turns back and sometimes it doesnt. Here, below is the method for traversing the maze. Could i get a second pair of eyes to help me out a bit with this code?
* Prints out the current maze
public void show()
for (int i=0;i<array.length;i++)
for (int j=0; j<array.length;j++)
System.out.print(array[i][j]) ;
System.out.println();
* traverses through the maze
* @param row: the current row
* @param column: the current column
public void traverse(int row, int column)
if ((row==3)&&(column==column-1))//checks if the array has reached the end
System.out.println("array is solved");
}else
if(array[row-1][column]=='.')//checks if should move up
array[row][column]='x';//marks path
array[row-1][column]='x';//marks path
System.out.println();
show();
traverse(row-1,column);
}else
if (array[row+1][column]=='.')//checks if should move down
array[row][column]='x';//marks path
array[row+1][column]='x';//marks path
System.out.println();
show();
traverse(row+1,column);
}else
if(array[row][column+1]=='.')//checks if should move left
array[row][column]='x'; //marks path
array[row][column+1]='x';//marks path
System.out.println();
show();
traverse(row,column+1);
}else
if ((row!=3)&&(column!=0))
if(array[row][column-1]=='.')//checks if should move right
array[row][column]='x'; //marks path
array[row][column-1]='x';//marks path
System.out.println();
show();
traverse(row,column-1);
}else/*1*/ if((array[row-1][column]=='#')||((array[row-1][column]=='*'))&&(array[row+1][column]=='#')||(array[row+1][column]=='*')&&(array[row][column+1]=='#')||(array[row][column+1]=='*'))
//checks if up is clear to move back
//checks if down is clear so could move back
//checks if right is clear to move back
if(row==3&&column-1==0)//checks if at the beginning of the array
System.out.println("MAze cannot be solved");
}else
if (array[row][column-1]=='x')//checks if behind has a x to move
array[row][column]='*';//prints dead end
array[row][column-1]='.';
System.out.println();
show();
traverse(row,column-1);
}else/*2*/ if((array[row+1][column]=='#')||(array[row+1][column]=='*')&&(array[row][column-1]=='#')||(array[row][column-1]=='*')&&(array[row][column+1]=='#')||(array[row][column+1]=='*'))
//checks if left is clear to move back
//checks if right is clear to move back
//checks if up is clear to move back
if(row-1==3&&column==0)//checks if at the begining of the maze
System.out.println("MAze cannot be solved");
}else if (array[row-1][column]=='x')//checks if behind as been marked
array[row][column]='*';//marks as dead end
array[row-1][column]='.';
System.out.println();
show();
traverse(row-1,column);
}else/*3*/ if((array[row+1][column]=='#')||(array[row+1][column]=='*')&&(array[row][column-1]=='#')||(array[row][column-1]=='*')&&(array[row][column+1]=='#')||(array[row][column+1]=='*'))
//checks if right is clear to move back
// checks if left is clear to move back
//checks if up is clear to move back
if (array[row-1][column]=='x')//checks if behind as been marked as a path
array[row][column]='*';//marks as dead end
array[row-1][column]='.';
System.out.println();
show();
traverse(row-1,column);
} else/*4*/ if((array[row][column-1]=='#')||(array[row][column-1]=='*')&&(array[row+1][column]=='#')||(array[row+1][column]=='*')&&(array[row-1][column]=='#')||(array[row-1][column]=='*'))
//checks if right is clear to move back
//checks if down is clear to move back
//checks if up is clear to move back
if (array[row][column+1]=='x')//checks if behind has been marked as a path
array[row][column]='*';//marks as dead end
array[row][column+1]='.';
System.out.println();
show();
traverse(row,column+1);morgalr wrote:
That is truely one of the better threads that I've seen on the net for maze traversal.Forget "for maze traversal". That was one of the most interesting of all the threads I've seen here in quite a while. My sincerest admiration to those who contributed and eventually worked it out (and it wasn't me that's for sure), and especially to Keith. Impressive! -
Mail deletes / removes drafts when I try to save multiple messages with same subject line.
Hi,
Running 10.7.5, Mail version 5.3, I find that I cannot save multiple messages with the same subject line when I want to store them for sending to different people later. It automatically deletes the older message and only saves the new one.
Any idea/help? Can't find it online or using Macs's Help program. They are NOT being stored on my mail server, just checked.
Thanks!I am experiencing exactly the same problem. Mail will not keep multiple email drafts with the same subject line, although they are addressed to different people. At one point, I had drafted and saved a dozen or so such messages intending to send them later only to discover that Mail had deleted all of them but one. Have you received any help or guidance on this? I'm baffled. This did not happen with previous Mail versions.
-
Can I get some help with this please
I got the following error messages from java after running my code.
Exception in thread "main" java.lang.ArrayIndexOutOfBoundsException: 66
at Graph.ChainingHashTable.get(ChainingHashTable.java:76)
at Graph.Vertex.isNeighbor(Vertex.java:123)
at Graph.LinkedGraph.addEdge(LinkedGraph.java:42)
at Graph.Traversals.main(Traversals.java:311)
The following is my code
Traversal.java
package Graph;
public class Traversals implements Callback<Vertex>
public void visit( Vertex data )
System.out.println( data.getName() );
* Perform a breadth first traversal of the vertices in the given graph
* starting at the specified node. The call back object is used to process
* each node as it appears in the traversal.
* @param g the graph to traverse
* @param start the vertex where the traversal will start
* @param cb the object that processes vertices.
public void BFSTraverse( Graph g, Vertex start, Callback<Vertex> cb )
Queue<Vertex> waiting = new LinkedQueue<Vertex>(); // Queue of waiting
// vertices
// Ensure the graph has no marked vertices
List<Vertex> vertices = g.getVertices();
for( vertices.first(); vertices.isOnList(); vertices.next() )
vertices.get().setTag( false );
// Put the start vertex in the work queue
waiting.enqueue( start );
// While there are waiting vertices
while( !waiting.empty() )
// Get the next Vertex
Vertex curVertex = waiting.front();
waiting.dequeue();
// If this Vertex hasn't been processed yet
if( !curVertex.getTag() )
cb.visit( curVertex ); // Process the vertex
curVertex.setTag( true ); // Mark it as visited
// Put its unmarked neighbors into the work queue
List<Vertex> neighbors = curVertex.getNeighbors();
for( neighbors.first(); neighbors.isOnList(); neighbors.next() )
Vertex cur = neighbors.get();
if( !cur.getTag() )
waiting.enqueue( cur );
* Use Kruskal's algorithm to create a minimum spanning tree for the given
* graph. The MST is returned in the form of a graph.
* @param g the graph from which to generate the MST
* @return a graph containing the the vertices of g and the the edges
* nesseary to form a minimum spanning tree.
public Graph kruskalMST( Graph g )
// Where the MST will be stored
Graph mst = new LinkedGraph();
// All the vertices in the graph
List<Vertex> vertices = g.getVertices();
// List of Vertex Sets
List<Set<String>> vertexSets = new LinkedList();
// Add the vertices in the original graph to mst
// and create the vertex sets at the same time
for( vertices.first(); vertices.isOnList(); vertices.next() )
String curName = vertices.get().getName();
Set<String> curSet = null; // new ArrayBasedSet<Vertex>();
// Add the name of the current vertex to its set and then
// add the set to the list that contains the vertex sets
curSet.add( curName );
vertexSets.add( curSet );
// Add the current vertex to the MST graph
mst.addVertex( curName );
// Put the edges into a heap which effectively sorts them
Heap<Edge> edges = new ArrayBasedHeap<Edge>();
List<Edge> allEdges = g.getEdges();
for( allEdges.first(); allEdges.isOnList(); allEdges.next() )
edges.insertHeapNode( allEdges.get() );
// Setup is complete - run the algorithm
// There is more than one set left in the list vertex sets
while( vertexSets.size() > 1 )
// Get the smallest edge
Edge cur = edges.getSmallest();
// Find the sets where these vertices are located
int sourcePos = findSet( vertexSets, cur.getSource().getName() );
int destPos = findSet( vertexSets, cur.getDest().getName() );
// If the vertices are in different sets - add the edge to
// the MST
if( sourcePos != destPos )
Set<String> sourceSet = vertexSets.get( sourcePos );
Set<String> destSet = vertexSets.get( destPos );
// Add the edge to the MST
mst.addEdge( cur.getSource().getName(),
cur.getDest().getName(), cur.getCost() );
// Merge the sets
sourceSet.union( destSet );
vertexSets.remove( destPos );
// The MST can be read from this graph
return mst;
* Return the position of the first set in the list that contains the
* specified name.
* @param vertexSets a list of sets to search.
* @param name the name being searched for.
* @return the position of the first set in the list that contains the name
* or -1 if the name cannot be found.
private int findSet( List<Set<String>> vertexSets, String name )
int retVal = -1;
// Step through the list and examine each set. Stop when you
// find a set with the name or we fall off the list
for( int i = 0; retVal == -1 && i < vertexSets.size(); i = i + 1 )
Set curSet = vertexSets.get( i );
// Does the current set contain the name we are looking for?
if( curSet.contains( name ) )
retVal = i;
// Return the position of the set
return retVal;
* Perform Dijkstra's Shortest Path algorithm on the given graph, starting
* at the given vertex.
* @param g the Graph to traverse.
* @param name the name of the vertex where the traversal starts.
* @return an array containing vertex path costs.
public int[] dijkstraSP( Graph g, String name )
// The names of the vertices for which the shortest
// path is not known
Set<String> u = new ArrayBasedSet<String>();
// The names of the vertices for which the shortest
// path is known
Set<String> s = new ArrayBasedSet<String>();
// Put the vertices in an array to make things easier
List<Vertex> vertices = g.getVertices();
Vertex v[] = new Vertex[ vertices.size() ];
for( int i = 0; i < vertices.size(); i++ )
v[ i ] = vertices.get( i );
// The starting vertex
Vertex start = g.getVertex( name );
// The lowest costs seen so far
int c[] = new int[ v.length ];
// Temporary edge used by the program
Edge curEdge = null;
// Sort the vertices by name so that the costs will
// appear in order by name
Heap<String> names = new ArrayBasedHeap<String>();
// Build the heap
for( int i = 0; i < v.length; i = i + 1 )
names.insertHeapNode( v[ i ].getName() );
// Read out the values
for( int i = 0; !names.empty(); i = i + 1 )
v[ i ] = g.getVertex( names.getSmallest() );
// We "know" the shortest path to the source
s.add( name );
// For each vertex, compute the starting cost
for( int i = 0; i < v.length; i = i + 1 )
// If this isn't the start node
if( !v[ i ].getName().equals( name ) )
// Put it in the unknown set
u.add( v[ i ].getName() );
// Compute the initial cost to reach this Vertex
curEdge = start.getEdge( v[ i ].getName() );
if( curEdge != null )
c[ i ] = curEdge.getCost();
else
// This Vertex is currently unreachable
c[ i ] = Integer.MAX_VALUE;
else
// It costs 0 to get to the start vertex
c[ i ] = 0;
// Set is complete - run the algorithm until all of
// the paths are known
while( !u.isEmpty() )
// Find the position of the lowest-cost unknown node
int min = Integer.MAX_VALUE;
int minPos = -1;
for( int i = 0; minPos == -1 && i < c.length; i = i + 1 )
if( c[ i ] < min && u.contains( v[ i ].getName() ) )
min = c[ i ];
minPos = i;
// We know the shortest path to the vertex
s.add( v[ minPos ].getName() );
u.remove( v[ minPos ].getName() );
// Update the costs based
for( int i = 0; i < c.length; i = i + 1 )
// Get the edge between the new shortest and the
// current node in the array
curEdge = v[ minPos ].getEdge( v[ i ].getName() );
// If there is an edge
if( curEdge != null )
// If going through the new node is better than
// what has been seen update the cost
if( c[ i ] > c[ minPos ] + curEdge.getCost() )
c[ i ] = c[ minPos ] + curEdge.getCost();
return c;
public static void main( String args[] )
Traversals t = new Traversals();
Graph g = new LinkedGraph();
g.addVertex( "A" );
g.addVertex( "B" );
g.addVertex( "C" );
g.addVertex( "D" );
g.addVertex( "E" );
g.addVertex( "F" );
g.addEdge( "A", "B", 5 ); <--------------------------------------------------------------------------------------------Line 311
g.addEdge( "A", "D", 9 );
g.addEdge( "A", "C", 10 );
g.addEdge( "B", "A", 5 );
g.addEdge( "B", "D", 4 );
g.addEdge( "C", "A", 10 );
g.addEdge( "C", "D", 13 );
g.addEdge( "C", "E", 14 );
g.addEdge( "D", "B", 4 );
g.addEdge( "D", "A", 9 );
g.addEdge( "D", "C", 13 );
g.addEdge( "D", "E", 7 );
g.addEdge( "D", "F", 8 );
g.addEdge( "E", "C", 14 );
g.addEdge( "E", "D", 7 );
g.addEdge( "E", "F", 2 );
g.addEdge( "F", "D", 8 );
g.addEdge( "F", "E", 2 );
int costs[] = t.dijkstraSP( g, "A" );
for( int i = 0; i < costs.length; i = i + 1 )
System.out.println( costs[ i ] );
}ChainingHashTable.java
package Graph;
* An implementation of a HashTable using chaining for collision resolution.
* Javadoc comments for methods specified in the Table interface have been
* omitted.
* This code assumes that the preconditions stated in the comments are true when
* a method is invoked and therefore does not check the preconditions.
public class ChainingHashTable<K, V> implements Table<K, V>
private List<Tuple<K, V>> hashTable[]; // The hashtable
int size; // The size of the hash table
* Create a new hash table.
* @param cardinality the number of elements in the domain.
public ChainingHashTable( int cardinality )
// Note that the cast is necessary because you cannot
// create generic arrays in Java. This statement will
// generate a compiler warning.
hashTable = (LinkedList<Tuple<K, V>>[]) new LinkedList[ cardinality ];
size = 0;
public void put( K key, V value )
int bucket = key.hashCode();
// Do we need to create a new list for this bucket?
if( hashTable[ bucket ] == null )
hashTable[ bucket ] = new LinkedList<Tuple<K, V>>();
hashTable[ bucket ].add( new Tuple<K, V>( key, value ) );
size = size + 1;
public void remove( K key )
int bucket = key.hashCode();
List<Tuple<K, V>> chain = hashTable[ bucket ];
boolean found = false;
// Is there a chain to search?
if( chain != null )
// Step through the chain until we fall off the end or
// find the tuple to delete
chain.first();
while( !found && chain.isOnList() )
// If this tuple has the key we are looking for
// delete it and stop the loop
if( chain.get().getKey().equals( key ) )
chain.remove();
found = true;
else
chain.next();
public V get( K key )
int bucket = key.hashCode();
List<Tuple<K, V>> chain = hashTable[ bucket ]; <----------------------------------------------------------------Line 76
V retVal = null;
// Is there a chain to search?
if( chain != null )
// Step through the chain until we find the element or
// run out of list.
for( chain.first(); retVal == null && chain.isOnList(); chain
.next() )
// If this tuple has the key we are looking for,
// extract the value
if( chain.get().getKey().equals( key ) )
retVal = chain.get().getValue();
return retVal;
public boolean isEmpty()
return size == 0;
public int size()
return size;
public int cardinality()
return hashTable.length;
public List<K> getKeys()
List<Tuple<K, V>> chain;
List<K> keys = new LinkedList<K>();
// Go through each chain and create a list that contains all
// of the keys in the table
for( int i = 0; i < hashTable.length; i++ )
if( hashTable[ i ] != null )
chain = hashTable[ i ];
for( chain.first(); chain.isOnList(); chain.next() )
keys.add( chain.get().getKey() );
return keys;
public List<V> getValues()
List<Tuple<K, V>> chain;
List<V> values = new LinkedList<V>();
// Go through each chain and create a list that contains all
// of the keys in the table
for( int i = 0; i < hashTable.length; i++ )
if( hashTable[ i ] != null )
chain = hashTable[ i ];
for( chain.first(); chain.isOnList(); chain.next() )
values.add( chain.get().getValue() );
return values;
* Return a string representation of this hash table.
* @return a string representation of this hash table.
public String toString()
StringBuffer hashAsString = new StringBuffer( "" );
List chain = null;
for( int i = 0; i < hashTable.length; i = i + 1 )
hashAsString.append( "h[" + i + "]==" );
if( hashTable[ i ] != null )
chain = hashTable[ i ];
for( chain.first(); chain.isOnList(); chain.next() )
hashAsString.append( " " + chain.get() );
hashAsString.append( "\n" );
return hashAsString.toString();
} // ChainingHashTable -
Can message filters cause messages with blank subject and 1969 dates
I have done many things to try to trace why I get messages with blank subjects and 1969 dates.
downloaded TB
created all new folders
moved only persdict and msfFilterRules to the new profile.
At this try
set the option NOT to download messages on startup
went off line and compacted all folders.
emptied the inbox and all subfolders.
Exited TB.
deleted all files under pop.verizon.net except msgFilters rules.
Deleted all msf files for local folders in my profile.
opened TB.
a few times
--With Firefox went to verizon webmail and moved a few messages to the Verizon inbox.
--moved to TB window
-- Clicked <get messages>
-- still received blank messages with 1969 dates
-- deleted those messages
-- emptied trash
went to the filter rules and unclicked all filters that send files to local folders
left 2 rules in place
(1) if a sender was in my address list send the message to inbox folder called "Known sender"
(2) if the subject was NOT a weird string like "&*%$@!+=?><" send the message to inbox folder called "Suspicious" This filter is because there is not an ELSE function in TB it is extremely unlikely that a message would have such a subject.
[These two filters should move all messages except junk to the two folders.]
I then tried the above procedure of going to Verizon, moving messages to Verizon Inbox, etc. a few times.
I did NOT get the messages with blank subject and 1969 date!!
Questions:
(1) Is this just a fluke?
(2) From understanding the internals of TB is it reasonable that some now-unchecked message filter(s) had caused there to be the oddball messages?
(3) if It is a filter rule, how can I find out which one it is?I looked though all the condition specification options I do not see how using header info in a condition specification would '''change '''the header info.
I looked at the possible actions on filters.
I only see "tag" and "Star" as ones that might change header info.
However, I found out that when I unchecked the first 17 of 19 filters and just had the two I explained above I would sometimes get a message with the 1969 date.
Since then I deleted those two rules and made new versions and moved them to the bottom where the earlier versions had been. I have not had the 1969 messages since!!
I have put a new filter at the top of the list that checks whether the date is before 1/1/971. If teh date is before 1/1/1971 the filter tags the message as important and moves it into the inbox folder named "Suspicious".
I have not seen any 1969 messages since then.
Since the problem was intermittent and because I was not able to create conditions whereby The 1969 dates would or would not occur, the problem may not be 'fixed'. I'll watch it for a while
Meanwhile, I'll continue to manually go though the webmail on Verizon and as a test only download mail that I do not want to save for the long term. Messages I want to keep I'll move messages I want to keep for the long term into foldrs on Verizon. '''If '''after a while, I do not get any more of the 1969 messages, I'll move messages I want to keep into the Verizon inbox and download them into TB -
Since transferring my iTunes library to a new computer, my library is just a mess. There are lots of songs that are duplicated 2, 3 and 4 times although all but one of the songs will get a message saying iTunes cannot find the file. Now I am getting a messages with some songs that shows a different user id for iTunes and wants the password. I have spent lots of $$$ and time trying to resolve these issues but really want to know what the heck is going on here?
Maybe you purchased some of the other songs using a different itunes account.
Could this be? -
When trying to log on to I-Cloud with my Apple Id, I keep getting the message that this is a valid Apple Id but not an I-cloud account???How do I link my I-Tunes Apple Id with I-Cloud?
You are logging in iCloud for the first time. In this case, first you need to log in iCloud on an iPhone, iPad, iPod touch or Mac. See > http://www.apple.com/icloud/setup
If you have not got a device to set iCloud up, you cannot use it. You can only use iCloud on your PC if you have got an Apple device -
Just updated my iphone. Now I can se I have two! iCloud accounts? One of them appears on my phone, and I have forgotten the password. When I try to add the other account, I get the message that this account is already added, but with the name of the first account where there is no available password. I have tried several times to reset the password, bun I don't get the information I need - I have no access to email. What can I do?
Hi, thanks for the suggestion. I have tried as you suggested, and when opening the "purchased" apps some have the icloud logo next to them, but I only have "OPEN" against "Find My iPhone". When opening it up, it goes through the same routine; needs to be updated before proceeding, and wouldn't update because I don't have IOS8.
Anything else I could try, or am I doomed!
All of your help is much appreciated, thanks -
I have had to restore my pc to a place back in time when it worked correctly. This meant that iTunes was deleted. I have now downloaded the latest version of iTunes but I cant sync my iPad with it. I get the message that this iPad is synced with another iTunes Library and cant sync to this one. Thankfully all my music library is on iPad. I would be grateful for some help on this issue
Its solved I just restored it to that point
-
How do I fix the compatibility issue between my iPhone 4S with iOS 7 and my Pioneer car stereo? There was no problem with iOS 6, but now I get a message saying "this device is not compatible" and so I can't use Netflix for example. How do I fix it?
This is a typical response from the manufacturer. Did you try the fix that Lawrence mentioned. When Apple or any other phone manufacturer update phone software, they have the latest Bluetooth installed. It is usually the problem with the radio manufacturer that they devices are using the older Bluetooth protocols. You can try this support document http://support.apple.com/kb/TS3581 and see if anything there helps, but generally it requires the radio manufacturer to update their firmware.
-
I started the update for IOS 7 and now I am getting a message with a charger pointing to I Tunes, I try to turn my phone off and the same message comes up. Not sure if this is part of the updating process, or if my phone is damaged. Has anyone out there experienced the same problem before, and if so, how did you fix it?
AmandaMacDonald wrote:
..I am getting a message with a charger pointing to I Tunes, ...
You are being asked to connect to iTunes on the computer you usually Sync with. -
i have a i phone 5 that we are getting a message not enough storage this Iphone cannot be backed up beacause there is not enough Icloud storage available. But we cannot go to settings or close out the message . i cannot power off the phone or anthing. How do i clear this off the phone.
First, press and hold the home and power buttons until the Apple icon appears.
The problem could be that you don't have enough storage on the device itself, not on iCloud. Go to Settings>General>Usage to see how much "Storage" you have available on the device. Farther down the list is the available storage on iCloud.
Also check:
Go to Settings>iCloud>Storage & Backups>Manage Storage; there, tap the device you need info on and the resulting screen lists Backup Options with which apps store data on iCloud as well. Tap Show All Apps to get the complete list of apps and MB used for backup storage.
A device needs many MB of storage in order to perform a backup to iCloud.
Also see: http://support.apple.com/kb/ht4847` -
I recently updated my computer to 10.6 and now I can't get my printer MX340 (canon ) to work. I have installed the new drivers both from Canon's website and from an earlier post directly from apples website. I would surely appreciate some help with this.
Try what Terence Devlin posted in this topic:
Terence Devlin
Apr 14, 2015 11:21 AM
Re: Is Iphoto gone ? i want it back!
in response to Johannes666
Recommended
Go to the App Store and check out the Purchases List. If iPhoto is there then it will be v9.6.1
If it is there, then drag your existing iPhoto app (not the library, just the app) to the trash
Install the App from the App Store.
Sometimes iPhoto is not visible on the Purchases List. it may be hidden. See this article for details on how to unhide it.
http://support.apple.com/kb/HT4928
One question often asked: Will I lose my Photos if I reinstall?
iPhoto the application and the iPhoto Library are two different parts of the iPhoto programme. So, reinstalling the app should not affect the Library. BUT you should always have a back up before doing this kind of work. Always.
Maybe you are looking for
-
I am irritated because I bought the New I phone 6 plus . I was told that when I put in a reminder and add location to my contacts Siri will read my reminder to me when I get to the location where the reminder is set for . why isn't it working ? Also
-
CRM SURVEY SUITE + Dynamic Components
Hi, all ! There are a lot of useful functionality described (http://help.sap.com/saphelp_crm50/helpdata/en/2c/2ddf3ac9ecc11de10000000a11402f/frameset.htm). But, unfortunately, a lack of knowledges HOW to realise this features. In particular, i'm inte
-
Photoshop CS6 shut down after using for 5mins; no image can be display on canvas.
Photoshop CS6 shut down after using for 5mins; no image can display on canvas.
-
Your marketing strategies are unconscionable. I have been trying to cancel my Adobe ExportPDF "auto renewal" (pfft) for an hour now and can't reach anyone. I am a busy man, and this time is costing me money. I want it cancelled now.
-
Why do all CS products keep asking me to register?
I have long been registered for my CS products, but every so often when I go to open a CS (6) product I am told it is a trial version, which it is not, and I am told to register it! Really annoying. Why does it do this and what can I do to stop it? T