I need to retrieve the code I was given to activate my creative suite design & web premium.

PLEASE can someone help me. I need to retrieve the code I was given to activate my creative suite design & web premium. I have got a new mac and it is only saying I have a 30 day trial.

Similar Messages

Used CS6 for a year or more, now says it's not registered! I have 1 or 2 unused keys but do not want to use them. Can't get the CS6 applications to open to enter the codes I was given when I first registered them...

Used CS6 for a year or more, now says it's not registered! I have 1 or 2 unused keys but do not want to use them. Can't get the CS6 applications to open to enter the codes I was given when I first registered them...

You'll need to use web chat. This file shows you links to Web Chat:
Adobe ID, sign in, and account help

Need Creative Suite 4 (Web Premium) on disc or download

I need to reinstall my Creative Suite 4 (Web Premium) but I have lost the main disc. When I talked to support tonight they suggested coming on here asking if anyone can help with either providing a DVD of Suite 4 or a download link. Can anyone help out? I have my serial number I just need a copy and they no longer can provide me with a replacement disc just an upgrade that would cost me $599 and I don't want to do that.
Hoping someone can help.

I'm in a similar situation. In my case we had a sewer flood in the basement (where my office is) and the clean-up crew (running around in hazmat suits) were a bit overzealous tossing everything in the dumpster.
Adobe's scripted response: "We only keep copies of the current version." When I pointed out that several of Adobe's own License Agreements state that copies of DVDs are available for several years (i.e. of versions other than the current one) I was promised that they'd get back to me "within 2 or 3 business days". Several weeks later I finally received a reply; no replacement DVDs are available but I could upgrade to the latest version (at the regular upgrade cost)...
Given that some of the License Agreements state that replacement DVDs will be available for some time after the new version has been released contrary to Adobe's stock answer that such copies are never available, I wonder if it would help to contact the Attorney General in my state and/or whether there's ground for a class-action lawsuit?

Hi I need help installing my creative suite 5 web premium cd on to my new pc which is windows 8 64bit os, thanks

Hi I need help installing my creative suite 5 web premium cd on to my new pc which is windows 8 64 bit os, thanks

copy the all the cds' contents to one desktop directory. install from that directory.

Having problems getting past the Upgrade Check screen when re-installing Creative Suite 4 Web Premium

I'm trying to reinstall Creative Suite 4 Web Premium, and I get stumbling on the Upgrade Check screen. Creative Suite 4 Web Premium isn't an option to select, and I put in my serial number with every choice, and it doesn't work. I can't get past this screen to continue the install, and I don't want to click trial because I have the serial number. Any thoughts or help would be awesome! Thanks!

I'm having the same exact problem.... did you ever get this resolved? It won't recognize a serial number from a previous version/purchase.

Need disk 2 of Creative Suite 4 Web Premium

So, my laptop crashed and I needed to re-install Windows 7 and all of my software including CS4-Web Premium.
I put in disk one and entered my code, no problem. Install started up. A few minutes later, it asked for disk 2. I put it in and nothing. Drive spins but Nada. I try to explore disk: Nada. I put disk in another computer: Nada. Disk ='s blank. ....:/
I suffer through multiple customer service calls to India only to find that Adobe no longer supports their $600 product. Come to find out, the only place to get any support is here. The Forums.
OK, that is some pretty special customer service. The kind that comes from a fully cornered market I suppose....
A few searches later, I find that the one and only place to DL anything old and Adobe is: http://prodesigntools.com/download-adobe-cs4-and-cs3-free-trials-here.html
'cept, I can't get it to work. at. all.
Seems my only talent is finding their:
502 Bad Gateway
<hr>
nginx
Message.
So, now what should I do?
Can anyone here help me?
....please?

Please follow the Note: Very Important Instructions on the same page -
You need to have a free Adobe account and be logged into it to use the links below, as Adobe sets a session cookie on your browser that allows you to access the direct download links. Otherwise, you will receive an “access denied” or “resume your download” message preventing the connection. So please follow these instructions carefully or the links will not work!
Adobe recommends temporarily turning off any surfing restrictions you might have running, like site or cookie blocking, filtering, firewalls or antivirus software.
Click «HERE» to visit this page and then select the “Download Now” button at the bottom.
If asked, then sign in with your Adobe ID or take a minute to create one for yourself.
Now close or cancel any windows that may pop up or any downloads that started.
OK! Now you’re logged in at Adobe with the trials cookie set, so you can instantly download any of the software below. Just make sure you have enough disk space.
Download the files either by clicking directly on the DDL links, or by right-clicking and choosing “Save Link As…” on the popup menu – and save all files to the same place.
Then follow the product installation instructions here.

Help - need Adobe Creative Suite 4 Web Premium Mac OS Installation Disk 2

Hey there,
Hoping someone can help me out on here. I recently moved and purchased a new computer and went to reinstall CS4 only to find that I am missing installation disk 2. As Adobe no longer supports the media for this, they reccomended that I contact someon ont he Adobe Forums who might be able to assist.
Just need the Application Disk 2 for the Mac OS of CS4.
Thanks!

Contact Adobe Technical Support. Installation problems for current versions of the suites and applications are resolved without charge. Despite the fact that 16MB of video memory is beneath stated requirements, it is unlikely that this particular shortcoming is what is causing your problems.
- Dov

¿Why I can not update the components of my Creative Suite 5 Web Premium?

Hello, good morning:
I have this version on CD from a few years ago both my old computer and the new system that has a 64-bit Windows 7 Professional. He settled smoothly and became the first updates. The updater Adobe tells me every few minutes I have new pending updates (Bridge, Dreamweaver, Extension Manager, Fireworks, Flash Pro, Illustrator, Photoshop, Camera Raw), I give accept all or separately one by one, it starts the discharged smoothly and then tells me this: have not been able to install the updates, try again or if you need assistance, please contact customer service. I give the link and I get: error page, sorry this page is not avaliable, error returned 404 ..
what I can do to update products and solve the problem?
Thanks and I expect an answer

Thanks Ned:
I could install one by one all the updates from the link you provided me.
Thanks for your answer and help.

Adobe Creative Suite 3 Web Premium instructions needed

I'm starting to use my dad's illustrator program in this CS3....windows
He thinks there was an instruction book/bible but,can't remember....probably lost with the move into the condo.
Are there any out there to be bought?
thanks for any info...........lk

Here's one to download: http://helpx.adobe.com/illustrator/archive.html
Should be for the other apps as well.

Do we need to compile the code migrating from JDK 1.4.2.11. to 1.4.2.15

Hi
Currently our application is running in JDK 1.4.2.11 and because of the SSL vulnerability issues we are planning to upgrade the JDK to 1.4.2.15 version.
Just wanted to know do we need to complie the code for this change.

In general, no. However, if your code depends on code that was changed as part of a bugfix, you may have to make source changes, and then recompile.
Test and see. And review the release documents for the versions involved.

My Macbook pro won't open downloaded programs. it just opens the code it was written in using the text and edit app. How can I fix this?

My Macbook pro won't open downloaded programs, it just opens the code it was written in using the text and edit app. How can I fix this? I just bought the computer last month so this is some what frustrating.

If you are downloading .exe files, those are Windows programs, and will not run on your Mac unless you install Windows on it. (That is possible, if you need one of those apps.)

Need help improve the code

I have this file but I need to improve the code on some method. The methods are addNode, deleteNode, saveNode, findLader and are they anyway for me to iliminate the findsmallest method?
here is the code
import java.io.*;
import java.util.LinkedList;
import java.util.Stack;
import javax.swing.*;
public class Graph {
private LinkedList graph;
private BufferedReader inputFile;
public Graph() {
graph = new LinkedList();
// read the words from the given file
// create a GraphNode
// Add the node to the graph
public void createGraph(String fileName) throws IOException {
inputFile = new BufferedReader(
new InputStreamReader(new FileInputStream("word.txt")));
// Convert the linkedlist to an array 'a'
// sort the array 'a'
// create a string from all elements in 'a'
// return the string
public String printGraph() {
String output = new String();
// will contain String objects
// ... do some work with the list, adding, removing String objects
String[] a = new String[graph.size()];
graph.toArray(a);
// now stringArray contains all the element from linkedList
quickSort(a, 0, a.size() - 1);
for(int i=0;i<a.length;++i)
output = output + new String(a.toString())+"\n";
return output;
private static void quickSort(Comparable[] theArray,
int first, int last) {
// Sorts the items in an array into ascending order.
// Precondition: theArray[first..last] is an array.
// Postcondition: theArray[first..last] is sorted.
// Calls: partition.
int pivotIndex;
if (first < last) {
// create the partition: S1, Pivot, S2
pivotIndex = partition(theArray, first, last);
// sort regions S1 and S2
quickSort(theArray, first, pivotIndex-1);
quickSort(theArray, pivotIndex+1, last);
} // end if
} // end quickSort
private static int partition(Comparable[] theArray,
int first, int last) {
// Partitions an array for quicksort.
// Precondition: theArray[first..last] is an array;
// first <= last.
// Postcondition: Returns the index of the pivot element of
// theArray[first..last]. Upon completion of the method,
// this will be the index value lastS1 such that
// S1 = theArray[first..lastS1-1] < pivot
// theArray[lastS1] == pivot
// S2 = theArray[lastS1+1..last] >= pivot
// Calls: choosePivot.
// tempItem is used to swap elements in the array
Comparable tempItem;
// place pivot in theArray[first]
//choosePivot(theArray, first, last);
Comparable pivot = theArray[first]; // reference pivot
// initially, everything but pivot is in unknown
int lastS1 = first; // index of last item in S1
// move one item at a time until unknown region is empty
for (int firstUnknown = first + 1; firstUnknown <= last;
++firstUnknown) {
// Invariant: theArray[first+1..lastS1] < pivot
// theArray[lastS1+1..firstUnknown-1] >= pivot
// move item from unknown to proper region
if (theArray[firstUnknown].compareTo(pivot) < 0) {
// item from unknown belongs in S1
++lastS1;
tempItem = theArray[firstUnknown];
theArray[firstUnknown] = theArray[lastS1];
theArray[lastS1] = tempItem;
} // end if
// else item from unknown belongs in S2
} // end for
// place pivot in proper position and mark its location
tempItem = theArray[first];
theArray[first] = theArray[lastS1];
theArray[lastS1] = tempItem;
return lastS1;
} // end partition
// Given a new word, add it to the graph
public void addNode(String word) {
GraphNode node = new GraphNode(word);
if(graph.contains(node)){
JOptionPane.showMessageDialog(null,"Duplicate Word, operation terminated");
for(int i=0; i<graph.size(); ++i) {
if(isAnEdge((String)(((GraphNode)graph.get(i)).getVertex()),(String)(node.getVertex()))) {
EdgeNode e1 = new EdgeNode((String)node.getVertex(),1);
EdgeNode e2 = new EdgeNode((String)((GraphNode)graph.get(i)).getVertex(),1);
node.addEdge(e2);
((GraphNode)graph.get(i)).addEdge(e1);
graph.add(node);
public boolean deleteNode(String word) {
GraphNode node = new GraphNode(word);
EdgeNode n = new EdgeNode(word,1);
if(!graph.contains(node)) {
return false;
else {
for(int i=0; i<graph.size();++i) {
((GraphNode)graph.get(i)).getEdgeList().remove(n);
graph.remove(node);
return true;
public void save(String fileName) {
try {
PrintWriter output = new PrintWriter(new FileWriter("word.txt"));
for(int i=0; i< graph.size();++i) {
output.println(((GraphNode)graph.get(i)).getVertex());
output.close();
catch (IOException e) {
// given two word, find the ladder (using dijkstra's algorithm
// create a string for the ladder and return it
public String findLadder(String start,String end) {
String ladder = new String();
GraphNode sv = new GraphNode(start);
GraphNode ev = new GraphNode(end);
if(!graph.contains(sv)) {
JOptionPane.showMessageDialog(null,start + " not in graph");
return null;
if(!graph.contains(ev)) {
JOptionPane.showMessageDialog(null,end + " not in graph");
return null;
LinkedList distance = new LinkedList(((GraphNode)graph.get(graph.indexOf(sv))).getEdgeList());
LinkedList visited = new LinkedList();
visited.add(start);
LinkedList path = new LinkedList();
path.add(new PathNode(start,"****"));
for(int i=0; i<distance.size();++i) {
PathNode p = new PathNode((String)((EdgeNode)distance.get(i)).getKey(),start);
path.add(p);
while(!visited.contains(end)) {
EdgeNode min = findSmallest(distance,visited);
String v = (String)min.getVertex();
if(v.equals("****"))
return null;
visited.add(v);
// for(int i=0;i<graph.size();++i) {
// String u = (String)(((GraphNode)(graph.get(i))).getVertex());
GraphNode temp1 = new GraphNode(v);
int index = graph.indexOf(temp1);
LinkedList l = new LinkedList(((GraphNode)graph.get(index)).getEdgeList());
for(int i=0;i<l.size();++i)
String u = (String)(((EdgeNode)(l.get(i))).getVertex());
if(!visited.contains(u)) {
int du=999, dv=999, avu=999;
dv = min.getCost();
EdgeNode edge = new EdgeNode(u,1);
if(distance.contains(edge)) {
du = ((EdgeNode)(distance.get(distance.indexOf(edge)))).getCost();
GraphNode temp = new GraphNode(v);
GraphNode node = ((GraphNode)(graph.get(graph.indexOf(temp))));
LinkedList edges = node.getEdgeList();
if(edges.contains(edge)) {
avu = ((EdgeNode)(edges.get(edges.indexOf(new EdgeNode(u,1))))).getCost();
if( du > dv+avu) {
if(du == 999) {
distance.add(new EdgeNode(u,dv+avu));
path.add(new PathNode(u,v));
else {
((EdgeNode)(distance.get(distance.indexOf(u)))).setCost(dv+avu);
((PathNode)(path.get(path.indexOf(u)))).setEnd(v);
if(!path.contains(new PathNode(end,"")))
return null;
LinkedList pathList = new LinkedList();
for(int i=0;i<path.size();++i) {
PathNode n = (PathNode)path.get(path.indexOf(new PathNode(end,"****")));
if(n.getEnd().compareTo("****") != 0) {
pathList.addFirst(end);
n = (PathNode)path.get(path.indexOf(new PathNode(n.getEnd(),"****")));
end = n.getStart();
pathList.addFirst(start);
for(int i=0;i<pathList.size()-1;++i) {
ladder = ladder + ((String)(pathList.get(i))) + " --> ";
ladder = ladder + ((String)(pathList.get(pathList.size()-1)));
return ladder;
private EdgeNode findSmallest(LinkedList distance, LinkedList visited) {
EdgeNode min = new EdgeNode("****",999);
for(int i=0;i<distance.size();++i) {
String node = (String)(((EdgeNode)distance.get(i)).getVertex());
if(!visited.contains(node)) {
if(((EdgeNode)distance.get(i)).getCost()<min.getCost()) {
min = (EdgeNode)distance.get(i);
return min;
// class that represents nodes inserted into path set
private class PathNode {
protected String sv;
protected String ev;
public PathNode(String s,String e) {
sv = s;
ev = e;
public String getEnd() {
return ev;
public String getStart() {
return sv;
public void setEnd(String n) {
ev = n;
public boolean equals(Object o) {
return this.sv.equals(((PathNode)o).sv);
public String toString() {
return "("+sv+":"+ev+")";
thank you

let me fix my misstake which was point out by some one in here and thank you ofr do so because I'm new at this.
I have this file but I need to improve the code on some method. The methods are addNode, deleteNode, saveNode, findLader and are they anyway for me to iliminate the findsmallest method?
here is the code
import java.io.*;
import java.util.LinkedList;
import java.util.Stack;
import javax.swing.*;
public class Graph {
private LinkedList graph;
private BufferedReader inputFile;
public Graph() {
graph = new LinkedList();
// read the words from the given file
// create a GraphNode
// Add the node to the graph
public void createGraph(String fileName) throws IOException {
inputFile = new BufferedReader(
new InputStreamReader(new FileInputStream("word.txt")));
// Convert the linkedlist to an array 'a'
// sort the array 'a'
// create a string from all elements in 'a'
// return the string
public String printGraph() {
String output = new String();
// will contain String objects
// ... do some work with the list, adding, removing String objects
String[] a = new String[graph.size()];
graph.toArray(a);
// now stringArray contains all the element from linkedList
quickSort(a, 0, a.size() - 1);
for(int i=0;i<a.length;++i)
output = output + new String(a.toString())+"\n";
return output;
private static void quickSort(Comparable[] theArray,
int first, int last) {
// Sorts the items in an array into ascending order.
// Precondition: theArray[first..last] is an array.
// Postcondition: theArray[first..last] is sorted.
// Calls: partition.
int pivotIndex;
if (first < last) {
// create the partition: S1, Pivot, S2
pivotIndex = partition(theArray, first, last);
// sort regions S1 and S2
quickSort(theArray, first, pivotIndex-1);
quickSort(theArray, pivotIndex+1, last);
} // end if
} // end quickSort
private static int partition(Comparable[] theArray,
int first, int last) {
// Partitions an array for quicksort.
// Precondition: theArray[first..last] is an array;
// first <= last.
// Postcondition: Returns the index of the pivot element of
// theArray[first..last]. Upon completion of the method,
// this will be the index value lastS1 such that
// S1 = theArray[first..lastS1-1] < pivot
// theArray[lastS1] == pivot
// S2 = theArray[lastS1+1..last] >= pivot
// Calls: choosePivot.
// tempItem is used to swap elements in the array
Comparable tempItem;
// place pivot in theArray[first]
//choosePivot(theArray, first, last);
Comparable pivot = theArray[first]; // reference pivot
// initially, everything but pivot is in unknown
int lastS1 = first; // index of last item in S1
// move one item at a time until unknown region is empty
for (int firstUnknown = first + 1; firstUnknown <= last;
++firstUnknown) {
// Invariant: theArray[first+1..lastS1] < pivot
// theArray[lastS1+1..firstUnknown-1] >= pivot
// move item from unknown to proper region
if (theArray[firstUnknown].compareTo(pivot) < 0) {
// item from unknown belongs in S1
++lastS1;
tempItem = theArray[firstUnknown];
theArray[firstUnknown] = theArray[lastS1];
theArray[lastS1] = tempItem;
} // end if
// else item from unknown belongs in S2
} // end for
// place pivot in proper position and mark its location
tempItem = theArray[first];
theArray[first] = theArray[lastS1];
theArray[lastS1] = tempItem;
return lastS1;
} // end partition
// Given a new word, add it to the graph
public void addNode(String word) {
GraphNode node = new GraphNode(word);
if(graph.contains(node)){
JOptionPane.showMessageDialog(null,"Duplicate Word, operation terminated");
for(int i=0; i<graph.size(); ++i) {
if(isAnEdge((String)(((GraphNode)graph.get(i)).getVertex()),(String)(node.getVertex()))) {
EdgeNode e1 = new EdgeNode((String)node.getVertex(),1);
EdgeNode e2 = new EdgeNode((String)((GraphNode)graph.get(i)).getVertex(),1);
node.addEdge(e2);
((GraphNode)graph.get(i)).addEdge(e1);
graph.add(node);
public boolean deleteNode(String word) {
GraphNode node = new GraphNode(word);
EdgeNode n = new EdgeNode(word,1);
if(!graph.contains(node)) {
return false;
else {
for(int i=0; i<graph.size();++i) {
((GraphNode)graph.get(i)).getEdgeList().remove(n);
graph.remove(node);
return true;
public void save(String fileName) {
try {
PrintWriter output = new PrintWriter(new FileWriter("word.txt"));
for(int i=0; i< graph.size();++i) {
output.println(((GraphNode)graph.get(i)).getVertex());
output.close();
catch (IOException e) {
// given two word, find the ladder (using dijkstra's algorithm
// create a string for the ladder and return it
public String findLadder(String start,String end) {
String ladder = new String();
GraphNode sv = new GraphNode(start);
GraphNode ev = new GraphNode(end);
if(!graph.contains(sv)) {
JOptionPane.showMessageDialog(null,start + " not in graph");
return null;
if(!graph.contains(ev)) {
JOptionPane.showMessageDialog(null,end + " not in graph");
return null;
LinkedList distance = new LinkedList(((GraphNode)graph.get(graph.indexOf(sv))).getEdgeList());
LinkedList visited = new LinkedList();
visited.add(start);
LinkedList path = new LinkedList();
path.add(new PathNode(start,"****"));
for(int i=0; i<distance.size();++i) {
PathNode p = new PathNode((String)((EdgeNode)distance.get(i)).getKey(),start);
path.add(p);
while(!visited.contains(end)) {
EdgeNode min = findSmallest(distance,visited);
String v = (String)min.getVertex();
if(v.equals("****"))
return null;
visited.add(v);
// for(int i=0;i<graph.size();++i) {
// String u = (String)(((GraphNode)(graph.get(i))).getVertex());
GraphNode temp1 = new GraphNode(v);
int index = graph.indexOf(temp1);
LinkedList l = new LinkedList(((GraphNode)graph.get(index)).getEdgeList());
for(int i=0;i<l.size();++i)
String u = (String)(((EdgeNode)(l.get(i))).getVertex());
if(!visited.contains(u)) {
int du=999, dv=999, avu=999;
dv = min.getCost();
EdgeNode edge = new EdgeNode(u,1);
if(distance.contains(edge)) {
du = ((EdgeNode)(distance.get(distance.indexOf(edge)))).getCost();
GraphNode temp = new GraphNode(v);
GraphNode node = ((GraphNode)(graph.get(graph.indexOf(temp))));
LinkedList edges = node.getEdgeList();
if(edges.contains(edge)) {
avu = ((EdgeNode)(edges.get(edges.indexOf(new EdgeNode(u,1))))).getCost();
if( du > dv+avu) {
if(du == 999) {
distance.add(new EdgeNode(u,dv+avu));
path.add(new PathNode(u,v));
else {
((EdgeNode)(distance.get(distance.indexOf(u)))).setCost(dv+avu);
((PathNode)(path.get(path.indexOf(u)))).setEnd(v);
if(!path.contains(new PathNode(end,"")))
return null;
LinkedList pathList = new LinkedList();
for(int i=0;i<path.size();++i) {
PathNode n = (PathNode)path.get(path.indexOf(new PathNode(end,"****")));
if(n.getEnd().compareTo("****") != 0) {
pathList.addFirst(end);
n = (PathNode)path.get(path.indexOf(new PathNode(n.getEnd(),"****")));
end = n.getStart();
pathList.addFirst(start);
for(int i=0;i<pathList.size()-1;++i) {
ladder = ladder + ((String)(pathList.get(i))) + " --> ";
ladder = ladder + ((String)(pathList.get(pathList.size()-1)));
return ladder;
private EdgeNode findSmallest(LinkedList distance, LinkedList visited) {
EdgeNode min = new EdgeNode("****",999);
for(int i=0;i<distance.size();++i) {
String node = (String)(((EdgeNode)distance.get(i)).getVertex());
if(!visited.contains(node)) {
if(((EdgeNode)distance.get(i)).getCost()<min.getCost()) {
min = (EdgeNode)distance.get(i);
return min;
// class that represents nodes inserted into path set
private class PathNode {
protected String sv;
protected String ev;
public PathNode(String s,String e) {
sv = s;
ev = e;
public String getEnd() {
return ev;
public String getStart() {
return sv;
public void setEnd(String n) {
ev = n;
public boolean equals(Object o) {
return this.sv.equals(((PathNode)o).sv);
public String toString() {
return "("+sv+":"+ev+")";
}thank you

Error in attaching to container node - The code returned was 404

I have a customer who has messed with their NTCWS and I'm trying to resurect it.
I've been able to setup the correct Remote Server, Crawler Web Service (.NET CWS etc), Data Source - Remote (.NET CWS Data Source), Crawler and Job etc., but the job always fails.
Here is the job log output:
12/13/04 16:33:49- Starting to run operations (1 total) for job 'Neil Test NTCWS Job'. Will stop on errors. (PID=6248)12/13/04 16:33:50- *** Job Operation #1 of 1: Crawler 'Neil Test NTCWS Crawler' [Run as owner 'Neil Gidley']12/13/04 16:33:50- Starting Crawler "Neil Test NTCWS Crawler" at 12/13/2004 4:33:50 PM.12/13/04 16:33:50- Crawler starting from scratch: Neil Test NTCWS Crawler12/13/04 16:33:50- Error in attaching to container node Crawler Start Node to get child documents and containers: IDispatch error #19880 (0x80044fa8): [The SOAP Connection stopped executing method urn:plumtree-com:ContainerProvider.Initialize after 1 attempt(s). Last error: The SOAP Connection has recieved an HTTP error while executing during connection attempt 1 of method urn:plumtree-com:ContainerProvider.Initialize!. The code returned was 404.]12/13/04 16:33:50- Crawler has experienced a fatal error (Could not attach provider to start node, crawl cannot proceed.), shutting down.12/13/04 16:33:50- Bulk import completed, resulting in the successful storage of 0 new cards.12/13/04 16:33:50- Could not attach provider to start node, crawl cannot proceed.12/13/04 16:33:50- *** Job Operation #1 failed: Could not attach provider to start node, crawl cannot proceed. (0x4)12/13/04 16:33:50- Done with job operations.12/13/04 16:33:50- Could not attach provider to start node, crawl cannot proceed.
Any ideas why I'd be receiving a 404 and causing the Job to Fail? The target crawl location is local to the portal itself - it is all installed on the same machine and the files we're trying to crawl are on the same machine.
i've created a share with read/write etc access by Everyone. The Data Source - Remote is using my domain/name account which has Logon As Batch abilities etc...and should be able to crawl these files.

My tcptrace says 'invalid hostname'.
I assume that is the hostname of the target given in the Crawler object of where it is trying to attach and not the hostname of the Remote Server where the NTCWS code resides in the CWS Web Service.
I've tried the following values:
\\CESRVPP01.eugene1.net\Neil
\\cesrvpp01\Neil
\\10.10.34.41\Neil
Here's the full tcpTrace output:
POST /ntcws/ContainerProviderSoapBinding.asmx HTTP/1.1Host: ceppdportal:9999Cache-Control: no-cachePragma: no-cacheSOAPAction: "urn:plumtree-com:ContainerProvider.Initialize"Content-Type: text/xml; charset="UTF-8"User-Agent: Mozilla/4.0 (compatible; MSIE 6.0 compatible; Plumtree 4.0; Windows NT)Accept: */*Accept-Encoding: gzipConnection: Keep-AliveContent-Length: 000002692
<?xml version='1.0' encoding='UTF-8'?><SOAP-ENV:Envelope xmlns:SOAP-ENV="http://schemas.xmlsoap.org/soap/envelope/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:xsd="http://www.w3.org/2001/XMLSchema"> <SOAP-ENV:Body > <Initialize xmlns="urn:plumtree-com:ContainerProvider"> <DataSourceInfo > <NamedValue xmlns="http://www.plumtree.com/xmlschemas/xui/"> <name >PTC_MAX_FILE</name> <value >50000000</value> </NamedValue> <NamedValue xmlns="http://www.plumtree.com/xmlschemas/xui/"> <name >PTC_SOAP_USE</name> <value >LOCAL</value> </NamedValue> <NamedValue xmlns="http://www.plumtree.com/xmlschemas/xui/"> <name >PTC_SOAP_OPEN</name> <value >URL</value> </NamedValue> <NamedValue xmlns="http://www.plumtree.com/xmlschemas/xui/"> <name >PTC_FILE_PASS</name> <value >PUilp4ElTOdKWHrhA09aGhkjQ==</value> </NamedValue> <NamedValue xmlns="http://www.plumtree.com/xmlschemas/xui/"> <name >PTC_PBAGFORMAT</name> <value >1000</value> </NamedValue> <NamedValue xmlns="http://www.plumtree.com/xmlschemas/xui/"> <name >PTC_GATEWAY</name> <value >0</value> </NamedValue> <NamedValue xmlns="http://www.plumtree.com/xmlschemas/xui/"> <name >CSP-SESSION-TOKEN</name> <value >2498|1103050835|4QWhsGW/5APMi1aPx7R9arhbOdI=</value> </NamedValue> <NamedValue xmlns="http://www.plumtree.com/xmlschemas/xui/"> <name >PTC_FILE_USER</name> <value >CEDOM100\cedxnpg</value> </NamedValue> </DataSourceInfo> <CrawlInfo > <NamedValue xmlns="http://www.plumtree.com/xmlschemas/xui/"> <name >PTC_CRAWL_DEPTH</name> <value >1</value> </NamedValue> <NamedValue xmlns="http://www.plumtree.com/xmlschemas/xui/"> <name >PTC_FOLDER_NAME</name> <value >Neil</value> </NamedValue> <NamedValue xmlns="http://www.plumtree.com/xmlschemas/xui/"> <name >PTC_CDLANG</name> <value >en</value> </NamedValue> <NamedValue xmlns="http://www.plumtree.com/xmlschemas/xui/"> <name >PTC_PBAGFORMAT</name> <value >3000</value> </NamedValue> <NamedValue xmlns="http://www.plumtree.com/xmlschemas/xui/"> <name >PTC_UNIQUE</name> <value >\\CESRVPP01.eugene1.net\Neil</value> </NamedValue> </CrawlInfo> </Initialize> </SOAP-ENV:Body></SOAP-ENV:Envelope>--------------------------HTTP/1.1 400 Bad RequestContent-Type: text/htmlDate: Tue, 14 Dec 2004 18:55:38 GMTConnection: closeContent-Length: 39
<h1>Bad Request (Invalid Hostname)</h1>

I need to cancel the code that I redeem and restart the code

I went to use another email and pass word to redeem my gift card. I did not relize I could use my email. so I need to have the code canceled from the [email protected] so I can use it on my [email protected] can some one help me. this is my first time using itunes

Click here and request assistance.
(63314)

TS1292 The code which was sent to me to redeem OSX Mountain Lion is Invalid

Greetings,
The code which was sent to me to redeem OSX Mountain Lion is invalid.

Contact: Contacting Apple for support and service

I need to retrieve the code I was given to activate my creative suite design & web premium.

Similar Messages

Maybe you are looking for