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.

Similar Messages

HT204408 My applications folder has a black question mark on it at the bottom of my screen. I do not know what error I made, but my fan effect of the previous applications has gone away. Can I get some help with this?

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.

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!

Really need some help with this low earpiece volume issue.

I'm taking my iPhone to an Apple Store Genius tomorrow to check out the low volume in the earpiece. Has anyone else taken their phone in to an Apple Store and had the issue addressed? Are Geniuses just saying it is within spec? Has Apple published an article on this?
I realize that people are also frustrated over the low speakerphone volume, but the low volume in the earpiece is particularly concerning.
While traveling down the road it is very difficult to hear the person on the other end of the phone when using just the earpiece (no earbuds, no BT headset). The volume while using the earbuds is plenty loud.
Can anyone please shed some new light on this? I have had my iPhone for one week and I've got a bad feeling in my gut that this is a hardware issue and the earpiece speaker can't go any louder. Bummer.
(Obviously, all of my volume settings are maxed out).
-Joe

When the iPhones were first released, some people reported on their posts that they were able to take them to the Genius Bar, have a tech test it out, the tech would agree that the volume sounded low, and get their phone swapped right away. Unfortunately, there is no cut and dry answer because people have reported all sorts of different things- that the various software updates have fixed their volume, messing with the volume setting within iTunes, etc.
Personally, I think it is a software glitch. Why? I did this: I was playing the iPod without the earbuds and the volume was only set midrange. I covered the speaker on the bottom, cranked up the volume, and the sound coming out of the receiver was MUCH louder than it ever is when I am using the iPhone on a call. That to me indicates that the low volume it just a glitch that can be fixed, because it CAN obviously sound louder, just within a different function. Hope that makes sense.
Good luck tomorrow.

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

HT201195 Who can I call about getting help with redeeming my iTunes card?

Title is pretty self explanatory: Who can I call about getting help with redeeming my iTunes card?

There isn't a phone number for iTunes Support, you can contact them via this page (you will probably need to give them images of the front and back of the card, and possibly its receipt) : http://www.apple.com/support/itunes/contact/ - click on Contact iTunes Store Support on the right-hand side of the page, then iTunes Cards And Codes

Ever since I had my screen replaced, my laptop has slowly gone to ****. Half of my songs have been lost, webpages die out, shockwave crashes, and no I can't even sign into my laptop. Who can I contact to get this all fixed?

Ever since I had my screen replaced, my laptop has slowly gone to ****. Half of my songs have been lost, webpages die out, shockwave crashes, and no I can't even sign into my laptop. Who can I contact to get this all fixed?

How about the people who fixed the screen?

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.

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.

Who can I contact about my iTunes U Application status?

We have submitted an application for iTunes U for our teaching hospitals. Saint Barnabas Health Care System in New Jersey. It's been after 14 days, and we have not heard back yet. Who can I contact about our iTunes U application status? We are located in New Jersey.

In another post it was suggested to send an email to [email protected] That might be worth a try, anyway.
Regards.

Error 1603: Need some help with this one

When installing iTunes I first get an error box saying
"Error 1406: Could not write value to key \Software\classes\.cdda\OpenWithList\iTunes.exe. Verify that you have sufficient access to that key, or contact your support personnel."
The second one (after I click on Ignore on the last box) I get it this one:
"Error: -1603 Fatal error during installation.
Consult Windows Installer Help (Msi.chm) or MSDN for more information"
Strange thing is that I do have full access to my computer (or atleast in all other cases I have had since I am the only one with an account on it).
I have done my best in trying to solve it myself but I'm running out of ideas. I have downloaded latest versions from the website and tried installing Quicktime separately. I have also tried removing Quicktime using add/or remove programs though I just I didn't dare to take full removal because it said something about system files.
Anyway I really need some help with this, anyone got any ideas?
Greets,
Sixten
Windows XP Pro

Do you know how to count backwards? Do you know how to construct a loop? Do you know what an autodecrementor is? Do you know how to use String length? Do you know Java arrays start with index 0 and run to length-1? Do you know you use length on arrays too? Do you know what System.out.println does?
Show us what you have, there isn't anything here that isn't easily done the same as it would be on paper.

Powerpoint presentation I have stored in icloud until recently were syncing to Keynote on my iPad with no problem. Now when I open Keynote on my iPad there is nothing. I could use some help with this problem.

powerpoint presentation I have stored in icloud until recently were syncing to Keynote on my iPad with no problem. Now when I open Keynote on my iPad there is nothing. I could use some help with this problem.

Morning AndreD86,
Thanks for using Apple Support Communities.
These articles explain exactly what is backed up by using their method.
iTunes: About iOS backups
http://support.apple.com/kb/ht4946
and
iCloud: Backup and restore overview
http://support.apple.com/kb/ht4859
Also we want to double-click the Home button and swipe the Task Bar to the right.
Then make sure the button on the far left of Task Bar is not muted.
Best of luck,
Mario

I got hacked and the 'Report a Problem' isn't working. Who can I contact about the purchase I didn't make?

There is a purchase on my iTunes account made yesterday. I DID NOT make this purchase, but the 'Report a Problem' feature is not working. I am following the directions from the Help section accurately. When I logged in though, it said I needed to change my password because of suspicious activity. Who can I contact?

Hello,
I woke up today around 9:30 am UK Time, checked my emails on my phone and then started playing "Talking Ginger" kids game because of one of the offers, around 10:00 I noticed an email alert on top of my iphone screen about itunes receipt.
When I opened this, it was about "Kids Song Collection" purchase reciept for £1:49.
I was shocked because first of all my 3 years old daughter is sleeping, secondly I have security settings configured in iphone with a complex password to purchase and she does not know that password and thirdly I am using the phone and I know I didn't even open App Store or that app so how come this has happened. I did a search on google about how to report and tried to follow the process through itunes but every time I click on "report a problem in itunes" this opens a new apple page in firefox "http://www.apple.com/uk/support/itunes/"
Whilst further browsing Purchase History in itunes I also noticed another purchase from yesterday about "FireWorks Arcade" and this was unbelieveable because I didn't even receive any receipt yesterday about that purchase and again I am the only one who can make purchases due to the complex password known only to myself.
I am not sure what is going on here, but clearly as per today's incident it seems that apple is loosing their control.
Please advise what can be done here.

Itunes has made the same charge multiple times and now has drained my bank account, who can i contact to get my $500 back?!

i owe apple $30.48 but in the past 45 min itunes has made that charge multiple times to my account and now my bank account has dropped to a mere 6 cents. who can i contact to resolve this issue!

We are all users here like you. You are not addressing Apple. Please navigate to the Contact Us link at the bottom of this page and contact Apple.
Hope that helps

Who can I contact about poor quality aperture photobook

I have used aperture photobook without difficulty in the past. This time, I ordered a book and it had a line going through one or more of the photos on arrival at my home. This was a gift. Nowhere when I proofed this was this line evident. I realize that I had moved a photo but this line was not apparent . Does anyone at the printing end not proof as well? I could not believe this was printed. I do not know who to contact. If I do not get a free reprint this will be my last time using this service. Thanks for any comments

You can convert them to MP3, but it is a lossy format, so will lose some of the music's info. How much information that you lose will depend upon the quality settings that you had for the MP3 conversion - the options for MP3 range from 16 kbps at the lowest end to 320 at the highest (higher numbers will also give larger file sizes, so each track will take up more space on your iPod). You can change the conversion settings via the 'Import Settings button bottom right of the General tab in Edit > Preferences (iTunes > Preferences on a Mac) :
Creating a different version of a track : iTunes: How to convert a song to a different file format - Apple Support
And check what shows at the bottom of the iPod's Summary tab when connected to your computer's iTunes, there is a tickbox for 'convert higher bit rate songs to ...'
Your iPod will play AAC files (you can buy music from the iTunes store app on your iPod, and they will download as AAC, so they should play). AAC files will also take up more space.
So depending upon your iPod's capacity and how much music that you want on it you want to play with the track settings and see which gives you quality that you're happy with.

After i downloaded Firefox 7, I cannot open more than one page at a time. I have done everything you suggested about ad-on, etc. Other people are having problems. Can I get reall help with this or should I just reload Firefox 4?

Firefox 7 is a dud. Cannot open more than one tab at a time, will not open additional pages. Nothing you suggested has worked.
Can I take down Firefox 7 and reload Firefox 4?
I need to talk with a live person! I am real disappointed with this.

Sorry there is no telephone support. You could try the IRC if you want a quick response, ( whilst it is [https://support.mozilla.com/en-US/kb/ask open] )
Firefox 4 is not supported, but firefox 3.6 is
* see [[installing a previous version of firefox]]
There is a change to a preference which may help, post back with more details of your problems please.

Who can I contact about getting some help with this ongoing (several months) issue???

Similar Messages

Maybe you are looking for