Can Someone Post Info or a Link to BIOS 1.9 for KT4V boards?
Been awhile since I seen or heard anything about the 1.9 BIOS. Anyone got any info on the Beta testing or BIOS fix details?
Bump.
Similar Messages
-
I got a plain macbook (not a pro) that I got on 2010 and I've lost the CD's that came with it, can I still download Windows7? If yes, can someone please send me a link where I can get the windows? Thanks
Thanks stevejobsfan0123 for the reply, I know I have to buy a disk but when I searched for it on amazon I read many reviews about saying that either it is inadequate or that it's a scam. Do you know any website where I can get a legitimate disk of windows7?
-
I purchased standard XI but need the download - new laptop doesn't have a disk drive. Can someone please send me a link to download so I can activate with my serial #?
Downloadable installation files available:
Suites and Programs: CC 2014 | CC | CS6 | CS5.5 | CS5 | CS4, CS4 Web Standard | CS3
Acrobat: XI, X | 9,8 | 9 standard
Premiere Elements: 13 |12 | 11, 10 | 9, 8, 7
Photoshop Elements: 13 |12 | 11, 10 | 9,8,7
Lightroom: 5.7.1| 5 | 4 | 3 | 2.7(win),2.7(mac)
Captivate: 8 | 7 | 6 | 5
Contribute: CS5 | CS4, CS3
Download and installation help for Adobe links
Download and installation help for Prodesigntools links are listed on most linked pages. They are critical; especially steps 1, 2 and 3. If you click a link that does not have those steps listed, open a second window using the Lightroom 3 link to see those 'Important Instructions'.window using the Lightroom 3 link to see those 'Important Instructions'. -
Can someone post apple script code to tell Safari to refresh every 5 min?
Can someone post apple script code to tell Safari to refresh every 5 min?
thanx in advance!save the script as an application and checkmark the "Stay Open" box
-- start script
on idle
tell application "Safari"
activate
set doc_url to URL of document 1
open location doc_url
end tell
return 15 --<change the number 15 to the number of seconds you want between each refresh
end idle
-- end script
<br>
Mac OS X (10.4.7) -
Sometimes, my iPhone displays a "E" instead of "3G". Can someone explain me why and what it means ? Thx for ur help !
You are connected to an EDGE network. See page 17 in the "Basics" section of the User Guide.
http://manuals.info.apple.com/en_US/iPhone_iOS4_User_Guide.pdf -
___ Can someone point me to instructions to make custom 3D bevels for CS5? (Elf Shoe)
___ Can someone point me to instructions to make custom 3D bevels for CS5? (Elf Shoe)
I'm drawing some elf cartoon characters, and I want to create some shoes, basically an elongated 'cookie' type of shape. This one shows the default 'rounded' bevel, but I want it the arc to be angled to give a more rounded top...I realized I needed to access package contents, access and resave bevel.ai - but I have no permissions on my workstation. Oh well, I guess there's no other way.
-
hello, I uploaded a new website but all the svg files don't display on the browsers. when I open it in Muse with the "preview in browser", its fine! can someone tell me please where my problem is? (sorry for my english!)
Hi
Could you please check this thread, it might be helpful
Muse not exporting svg, can only see in preview -
Can someone please post a chart of what adapter works with the different devices? I have a MacBook air, I-pod, I-pad, and I-phone 4. I am getting my adapters mixed up.
Macbook: https://www.powerbookmedic.com/xcart1/images/D/macbook-air-adapter.gif
All iDevices until 2012 (excepting 3rd generation iPad) used the 30-pin connector: http://igyaan.in/wp-content/uploads/2012/01/idevice-30-pin-connector2.png
Newer iDevices: iPhone 5, iPad 4th generation, iPad Mini, and iPod touch 5th generation use the Lightning connector. If you do not have one of these devices, it does NOT use Lightning. http://www.macobserver.com/imgs/teaser_images/20120912lightning_connector_usb.jp g -
Can someone help with splitting a Linked List.??
Any help would be awesome!!!
My code just will not work!! Any help would be appreciated! My problem is in the last method SplitAt. These are the conditions set and my code:
Splitting a Linked List at a Given Node, into Two Sublists
a. Add the following as an abstract method to the class
LinkedListClass:
public void splitAt (LinkedListClass<T> secondList, T item);
//This method splits the list at the node with the info item into two sublists.
//Precondition: The list must exist.
//Postcondition: first and last point to the first and last nodes of the first sublist,
// respectively. secondList.first and secondList.last point to the first
// and last nodes of the second sublist.
Consider the following statements:
UnorderedLinkedList<Integer> myList;
UnorderedLinkedList<Integer> otherList;
Suppose myList points to the list with the elements 34, 65, 18, 39, 27, 89, and 12 (in this order). The statement
myList.splitAt(otherList, 18);
splits myList into two sublists: myList points to the list with elements 34 and 65, and otherList points to the sublist with elements 18, 39, 27, 89, and 12.
b. Provide the definition of the method splitAt in the class UnorderedLinkedList. Also write a program to test your method.
public class UnorderedLinkedList<T> extends LinkedListClass<T>
//Default constructor
public UnorderedLinkedList()
super();
//Method to determine whether searchItem is in
//the list.
//Postcondition: Returns true if searchItem is found
// in the list; false otherwise.
public boolean search(T searchItem)
LinkedListNode<T> current; //variable to traverse
//the list
boolean found;
current = first; //set current to point to the first
//node in the list
found = false; //set found to false
while (current != null && !found) //search the list
if (current.info.equals(searchItem)) //item is found
found = true;
else
current = current.link; //make current point to
//the next node
return found;
//Method to insert newItem in the list.
//Postcondition: first points to the new list
// and newItem is inserted at the
// beginning of the list. Also,
// last points to the last node and
// count is incremented by 1.
public void insertFirst(T newItem)
LinkedListNode<T> newNode; //variable to create the
//new node
newNode =
new LinkedListNode<T>(newItem, first); //create and
//insert newNode before
//first
first = newNode; //make first point to the
//actual first node
if (last == null) //if the list was empty, newNode is
//also the last node in the list
last = newNode;
count++; //increment count
//Method to insert newItem at the end of the list.
//Postcondition: first points to the new list and
// newItem is inserted at the end
// of the list. Also, last points to
// the last node and
// count is incremented by 1.
public void insertLast(T newItem)
LinkedListNode newNode; //variable to create the
//new node
newNode =
new LinkedListNode(newItem, null); //create newNode
if (first == null) //if the list is empty, newNode is
//both the first and last node
first = newNode;
last = newNode;
else //if the list is not empty, insert
//newNode after last
last.link = newNode; //insert newNode after last
last = newNode; //set last to point to the
//actual last node
count++;
}//end insertLast
//Method to delete deleteItem from the list.
//Postcondition: If found, the node containing
// deleteItem is deleted from the
// list. Also, first points to the first
// node, last points to the last
// node of the updated list, and count
// is decremented by 1.
public void deleteNode(T deleteItem)
LinkedListNode<T> current; //variable to traverse
//the list
LinkedListNode<T> trailCurrent; //variable just
//before current
boolean found;
if ( first == null) //Case 1; the list is empty
System.err.println("Cannot delete from an empty "
+ "list.");
else
if (first.info.equals(deleteItem)) //Case 2
first = first.link;
if (first == null) //the list had only one node
last = null;
count--;
else //search the list for the given info
found = false;
trailCurrent = first; //set trailCurrent to
//point to the first node
current = first.link; //set current to point to
//the second node
while (current != null && !found)
if (current.info.equals(deleteItem))
found = true;
else
trailCurrent = current;
current = current.link;
}//end while
if (found) //Case 3; if found, delete the node
count--;
trailCurrent.link = current.link;
if (last == current) //node to be deleted
//was the last node
last = trailCurrent; //update the value
//of last
else
System.out.println("Item to be deleted is "
+ "not in the list.");
}//end else
}//end else
}//end deleteNode
public void splitAt(LinkedListClass<T> secondList, T item)
LinkedListNode<T> current;
LinkedListNode<T> trailCurrent;
int i;
boolean found;
if (first==null)
System.out.println("Empty.");
first=null;
last=null;
count--;
else
current=first;
found=false;
i=1;
while(current !=null &&!found)
if(current.info.equals(secondList))
found= true;
else
trailCurrent=current;
i++;
if(found)
if(first==current)
first=first;
last=last;
count=count;
count=0;
else
first=current;
last=last;
last=null;
count = count- i+1;
count = i-1;
else
System.out.println("Item to be split at is "
+ "not in the list.");
first=null;
last=null;
count=0;
}Edited by: romeAbides on Oct 10, 2008 1:24 PMI dont have a test program at all. The program is supposed to prompt for user input of numbers. (it does) Take the input and end at input of -999 (it does). Then it asks user where it wants to split list (it does). When I enter a number it does nothing after that. I am going to post updated code and see if that helps along with all the classes. Thanks!
This is the class to prompt:
import java.util.*;
public class Ch16_ProgEx6
static Scanner console = new Scanner(System.in);
public static void main(String[] args)
UnorderedLinkedList<Integer> list
= new UnorderedLinkedList<Integer>();
UnorderedLinkedList<Integer> subList =
new UnorderedLinkedList<Integer>();
Integer num;
System.out.println("Enter integers ending with -999.");
num = console.nextInt();
while (num != -999)
list.insertLast(num);
num = console.nextInt();
System.out.println();
System.out.println("list: ");
list.print();
System.out.println();
System.out.println("Length of list: " + list.length());
System.out.print("Enter the number at which to split list: ");
num = console.nextInt();
list.splitAt(subList, num);
System.out.println("Lists after splitting list");
System.out.print("list: ");
list.print();
System.out.println();
System.out.println("Length of list: " + list.length());
System.out.print("sublist: ");
subList.print();
System.out.println();
System.out.println("Length of sublist: " + subList.length());
}This is the ADT:
public interface LinkedListADT<T> extends Cloneable
public Object clone();
//Returns a copy of objects data in store.
//This method clones only the references stored in
//each node of the list. The objects that the
//list nodes point to are not cloned.
public boolean isEmptyList();
//Method to determine whether the list is empty.
//Postcondition: Returns true if the list is empty;
// false otherwise.
public void initializeList();
//Method to initialize the list to an empty state.
//Postcondition: The list is initialized to an empty
// state.
public void print();
//Method to output the data contained in each node.
public int length();
//Method to return the number of nodes in the list.
//Postcondition: The number of nodes in the list is
// returned.
public T front();
//Method to return a reference of the object containing
//the data of the first node of the list.
//Precondition: The list must exist and must not be empty.
//Postcondition: The reference of the object that
// contains the info of the first node
// is returned.
public T back();
//Method to return a reference of object containing
//the data of the last node of the list.
//Precondition: The list must exist and must not be empty.
//Postcondition: The reference of the object that
// contains the info of the last node
// is returned.
public boolean search(T searchItem);
//Method to determine whether searchItem is in the list.
//Postcondition: Returns true if searchItem is found
// in the list; false otherwise.
public void insertFirst(T newItem);
//Method to insert newItem in the list.
//Postcondition: newItem is inserted at the
// beginning of the list.
public void insertLast(T newItem);
//Method to insert newItem at the end of the list.
//Postcondition: newItem is inserted at the end
// of the list.
public void deleteNode(T deleteItem);
//Method to delete deleteItem from the list.
//Postcondition: If found, the node containing
// deleteItem is deleted from the
// list.
public void splitAt(LinkedListClass<T> secondList, T item);
}This is the linked list class:
import java.util.NoSuchElementException;
public abstract class LinkedListClass<T> implements LinkedListADT<T>
protected class LinkedListNode<T> implements Cloneable
public T info;
public LinkedListNode<T> link;
//Default constructor
//Postcondition: info = null; link = null;
public LinkedListNode()
info = null;
link = null;
//Constructor with parameters
//This method sets info pointing to the object to
//which elem points to and link is set to point to
//the object to which ptr points to.
//Postcondition: info = elem; link = ptr;
public LinkedListNode(T elem, LinkedListNode<T> ptr)
info = elem;
link = ptr;
//Returns a copy of objects data in store.
//This method clones only the references stored in
//the node. The objects that the nodes point to
//are not cloned.
public Object clone()
LinkedListNode<T> copy = null;
try
copy = (LinkedListNode<T>) super.clone();
catch (CloneNotSupportedException e)
return null;
return copy;
//Method to return the info as a string.
//Postcondition: info as a String object is
// returned.
public String toString()
return info.toString();
} //end class LinkedListNode
public class LinkedListIterator<T>
protected LinkedListNode<T> current; //variable to
//point to the
//current node in
//list
protected LinkedListNode<T> previous; //variable to
//point to the
//node before the
//current node
//Default constructor
//Sets current to point to the first node in the
//list and sets previous to null.
//Postcondition: current = first; previous = null;
public LinkedListIterator()
current = (LinkedListNode<T>) first;
previous = null;
//Method to reset the iterator to the first node
//in the list.
//Postcondition: current = first; previous = null;
public void reset()
current = (LinkedListNode<T>) first;
previous = null;
//Method to return a reference of the info of the
//current node in the list and to advance iterator
//to the next node.
//Postcondition: previous = current;
// current = current.link;
// A refrence of the current node
// is returned.
public T next()
if (!hasNext())
throw new NoSuchElementException();
LinkedListNode<T> temp = current;
previous = current;
current = current.link;
return temp.info;
//Method to determine whether there is a next
//element in the list.
//Postcondition: Returns true if there is a next
// node in the list; otherwise
// returns false.
public boolean hasNext()
return (current != null);
//Method to remove the node currently pointed to
//by the iterator.
//Postcondition: If iterator is not null, then the
// node that the iterator points to
// is removed. Otherwise the method
// throws NoSuchElementException.
public void remove()
if (current == null)
throw new NoSuchElementException();
if (current == first)
first = first.link;
current = (LinkedListNode<T>) first;
previous = null;
if (first == null)
last = null;
else
previous.link = current.link;
if (current == last)
last = first;
while (last.link != null)
last = last.link;
current = current.link;
count--;
//Method to return the info as a string.
//Postcondition: info as a String object is returned.
public String toString()
return current.info.toString();
} //end class LinkedListIterator
//Instance variables of the class LinkedListClass
protected LinkedListNode<T> first; //variable to store the
//address of the first
//node of the list
protected LinkedListNode<T> last; //variable to store the
//address of the last
//node of the list
protected int count; //variable to store the number of
//nodes in the list
//Default constructor
//Initializes the list to an empty state.
//Postcondition: first = null, last = null,
// count = 0
public LinkedListClass()
first = null;
last = null;
count = 0;
//Method to determine whether the list is empty.
//Postcondition: Returns true if the list is empty;
// false otherwise.
public boolean isEmptyList()
return (first == null);
//Method to initialize the list to an empty state.
//Postcondition: first = null, last = null,
// count = 0
public void initializeList()
first = null;
last = null;
count = 0;
//Method to output the data contained in each node.
public void print()
LinkedListNode<T> current; //variable to traverse
//the list
current = first; //set current so that it points to
//the first node
while (current != null) //while more data to print
System.out.print(current.info + " ");
current = current.link;
}//end print
//Method to return the number of nodes in the list.
//Postcondition: The value of count is returned.
public int length()
return count;
//Method to return a reference of the object containing
//the data of the first node of the list.
//Precondition: The list must exist and must not be empty.
//Postcondition: The reference of the object that
// contains the info of the first node
// is returned.
public T front()
return first.info;
//Method to return a reference of object containing
//the data of the last node of the list.
//Precondition: The list must exist and must not be empty.
//Postcondition: The reference of the object that
// contains the info of the last node
// is returned.
public T back()
return last.info;
//Returns a copy of objects data in store.
//This method clones only the references stored in
//each node of the list. The objects that the
//list nodes point to are not cloned.
public Object clone()
LinkedListClass<T> copy = null;
try
copy = (LinkedListClass<T>) super.clone();
catch (CloneNotSupportedException e)
return null;
//If the list is not empty clone each node of
//the list.
if (first != null)
//Clone the first node
copy.first = (LinkedListNode<T>) first.clone();
copy.last = copy.first;
LinkedListNode<T> current;
if (first != null)
current = first.link;
else
current = null;
//Clone the remaining nodes of the list
while (current != null)
copy.last.link =
(LinkedListNode<T>) current.clone();
copy.last = copy.last.link;
current = current.link;
return copy;
//Method to return an iterator of the list.
//Postcondition: An iterator is instantiated and
// returned.
public LinkedListIterator<T> iterator()
return new LinkedListIterator<T>();
//Method to determine whether searchItem is in
//the list.
//Postcondition: Returns true if searchItem is found
// in the list; false otherwise.
public abstract boolean search(T searchItem);
//Method to insert newItem in the list.
//Postcondition: first points to the new list
// and newItem is inserted at the
// beginning of the list. Also,
// last points to the last node and
// count is incremented by 1.
public abstract void insertFirst(T newItem);
//Method to insert newItem at the end of the list.
//Postcondition: first points to the new list and
// newItem is inserted at the end
// of the list. Also, last points to
// the last node and
// count is incremented by 1.
public abstract void insertLast(T newItem);
//Method to delete deleteItem from the list.
//Postcondition: If found, the node containing
// deleteItem is deleted from the
// list. Also, first points to the first
// node, last points to the last
// node of the updated list, and count
// is decremented by 1.
public abstract void deleteNode(T deleteItem);
public abstract void splitAt(LinkedListClass<T> secondList, T item);
}And this is the UnorderedLinked Class with the very last method the one being Im stuck on. The SplitAt Method.
public class UnorderedLinkedList<T> extends LinkedListClass<T>
//Default constructor
public UnorderedLinkedList()
super();
//Method to determine whether searchItem is in
//the list.
//Postcondition: Returns true if searchItem is found
// in the list; false otherwise.
public boolean search(T searchItem)
LinkedListNode<T> current; //variable to traverse
//the list
boolean found;
current = first; //set current to point to the first
//node in the list
found = false; //set found to false
while (current != null && !found) //search the list
if (current.info.equals(searchItem)) //item is found
found = true;
else
current = current.link; //make current point to
//the next node
return found;
//Method to insert newItem in the list.
//Postcondition: first points to the new list
// and newItem is inserted at the
// beginning of the list. Also,
// last points to the last node and
// count is incremented by 1.
public void insertFirst(T newItem)
LinkedListNode<T> newNode; //variable to create the
//new node
newNode =
new LinkedListNode<T>(newItem, first); //create and
//insert newNode before
//first
first = newNode; //make first point to the
//actual first node
if (last == null) //if the list was empty, newNode is
//also the last node in the list
last = newNode;
count++; //increment count
//Method to insert newItem at the end of the list.
//Postcondition: first points to the new list and
// newItem is inserted at the end
// of the list. Also, last points to
// the last node and
// count is incremented by 1.
public void insertLast(T newItem)
LinkedListNode newNode; //variable to create the
//new node
newNode =
new LinkedListNode(newItem, null); //create newNode
if (first == null) //if the list is empty, newNode is
//both the first and last node
first = newNode;
last = newNode;
else //if the list is not empty, insert
//newNode after last
last.link = newNode; //insert newNode after last
last = newNode; //set last to point to the
//actual last node
count++;
}//end insertLast
//Method to delete deleteItem from the list.
//Postcondition: If found, the node containing
// deleteItem is deleted from the
// list. Also, first points to the first
// node, last points to the last
// node of the updated list, and count
// is decremented by 1.
public void deleteNode(T deleteItem)
LinkedListNode<T> current; //variable to traverse
//the list
LinkedListNode<T> trailCurrent; //variable just
//before current
boolean found;
if ( first == null) //Case 1; the list is empty
System.err.println("Cannot delete from an empty "
+ "list.");
else
if (first.info.equals(deleteItem)) //Case 2
first = first.link;
if (first == null) //the list had only one node
last = null;
count--;
else //search the list for the given info
found = false;
trailCurrent = first; //set trailCurrent to
//point to the first node
current = first.link; //set current to point to
//the second node
while (current != null && !found)
if (current.info.equals(deleteItem))
found = true;
else
trailCurrent = current;
current = current.link;
}//end while
if (found) //Case 3; if found, delete the node
count--;
trailCurrent.link = current.link;
if (last == current) //node to be deleted
//was the last node
last = trailCurrent; //update the value
//of last
else
System.out.println("Item to be deleted is "
+ "not in the list.");
}//end else
}//end else
}//end deleteNode
public void splitAt(LinkedListClass<T> secondList, T item)
LinkedListNode<T> current;
LinkedListNode<T> trailCurrent;
int i;
boolean found;
if (first==null)
System.out.println("Empty.");
first=null;
last=null;
count--;
count=0;
else
current=first;
found=false;
i=1;
while(current !=null &&!found)
if(current.info.equals(item))
found= true;
else
trailCurrent=first;
current=first;
i++;
if(found)
if(first==current)
first.link=first;
last.link=last;
count--;
count=0;
else
first.link=current;
last.link=last;
last=null;
count = count- i+1;
count = i-1;
} else {
System.out.println("Item to be split at is "
+ "not in the list.");
first=null;
last=null;
count=0;
Any help or just advice would be fine. Im not the best at Java, better at VB. Am completely stumped! Thanks so much! -
Can someone post a pic of a new iPad with no light bleeding
If you have an iPad with no light bleeding can you post a pic. I don't believe they exist
I have it but not horribly. I have resigned myself to wait until the mad rush for the iPad2 is over and see how they resolve the issue. Reminds me of the iPhone4 camera problem with white balance. Eventually they solved it. At that point I took mine (iPhone) back (several months later)and they still replaced it without questions. I am suspecting they will do the same with the iPads.
-
Can someone help me to find the game center i used for my clash of clans village
i play clash fo clans on ym ipod but i just got the pc version and its android. i know how to link them both so you can get the account onto my pc but when i press i want to link to another device it says "the current village is attached to a different game centre account than the one your logged into. but the problem is i dont know what game centre i logged into when i first got clash of clash. can someone plz help me.
Hello DvLNeonZz
On your iOS device you can go to Settings > Game Center to see what you ID is to get it linked up for the game.
Using Game Center
http://support.apple.com/kb/ht4314
Regards,
-Norm G. -
Can someone point me to a link for the leanest, meanest apple post flow
thank you in advance
we are looking for finishing funds for our film and i was curious that with all the advances in technology, what is the most efficient workflow - we need to have a D5 master and a film print
or do we?
thanks
craigI don't know of a link to go to, but I would say don't do either unless you have to.
If you're shopping it and you need to exhibit in digital HD, have you thought about renting an Io HD or something, and running it from a MacBook Pro for screenings? HD video from ProRes HQ QT is sweet. Multichannel audio too. I think I read somewhere online about someone that was doing festivals in HD this way...
Screeners could also be Blu-Ray, or anamorphic SD DVD, depending on what your potential distributor/investor would prefer. You could probably do that yourself. Layback to D5 seems unnecessary, unless that's what your new distributor or post house wants, and film has a cost and print ecosystem all its own.
For theatrical stuff, the post house I work with takes digital files on hard drives anyway. This bypasses a tape step for them (and me) when doing a color pass, converting to DPX, film, etc.
I'm assuming you didn't shoot with RED or something too exotic, so make it easy, do a ProRes HQ version of your project, play with it, get the look you want, export it, exhibit that, or make DVD screeners and pitch those.
Once you're happy you can always change attributes and export to whatever, time base issues aside. Keep your FCP project well organized for later finishing. If possible, I would stay away from expensive output until your movie is locked. -
Can someone post what's GOOD about new interface
since I can't really use the TV any more (without sitting two feet from it wearing 2.0x reading glasses in a dark room), i have no idea what time IMPROVEMENTS are in the new guide. i get the whole dvr-sharing thing, and that does seem valuable, but I didn't need a new interface for the interactive guide to get a feature like that.
for the defenders and beta testers, what about the guide is actually improved? who knows, maybe i can learn to love it, too.Release notes can be found here. I know since these came out there have been some added features, such as multihub and other items that were not mentioned in the initial notes because of marketing issues.
http://forums.verizon.com/t5/Verizon-at-Home/FiOS-TV-Interactive-Media-Guide-1-9-Release-Notes/ba-p/...
Like any change. Some like it some don't. I would vote for smaller thumb nails on the left and a larger timeline of programming to the right. I do not need to see a giant picture that says ABC, CBS, or HBO, Just my thoughts. But there are improvements that are not mentioned in the link posted. If you have any of the older HD hardware, say 6xxx I would attempt to get it replaced. Now the SD QIP2500 boxes even started running slow when 1.8 rolled out. -
Can someone spot my coding or linking mistake, please?
Hi there
Forum looks different from my years-ago last visit, hope I'm putting this in the right place.
Two problems.
www.dulcimerassociationofalbany.com, from index to More Info Here (2015.html), under Nina Zanetti more... (zanetti.html).
Her picture doesn't show up. Since I'm using DW, I'm not, like, spelling anything wrong.
If you go back a page and click under the other artists, their pic shows up. I think I've got them both relative to document. They are both in the same folder.
I'm assuming this is something I am overlooking, but I can't see what. (Happens to me sometimes!)
Second problem, on each of those "more..." pages I have a bit of code to open their websites in a new small window.
Doesn't work.
This is exactly the same code I use successfully on another site. (www.sonnyandperley.com/schedule.htm)
Now what am I missing?
TIA !
dennoThis is the correct location of the image
http://www.dulcimerassociationofalbany.com/Docs%202015/images/Nina%20Zanetti%20-%202015%20 %28cropped%20%231%29.jpg
Your link code is
http://www.dulcimerassociationofalbany.com/Docs%202015/images/Nina%20Zanetti%20-%202015%20 (cropped%20#1).jpg
You're going to go crazy trying to debug when you use all those spaces in your file and folder names
Use hyphens or underscores.
As for the small window, I am guessing you forgot the script in the head section
<script language="JavaScript" type="text/JavaScript">
<!--
function MM_openBrWindow(theURL,winName,features) { //v2.0
window.open(theURL,winName,features);
//-->
</script>
</HEAD> -
Can someone post s40 v6 access point wml?
Hi,
i use a nokia c3-01. I cant use email on my nokia as in the commercials suggested because my provider needs proxy settings. For the standardinstalled Internetbrowser i can configure a alternative account but the standard email prog just support wlan or access point. and in the nokia s40 v6 menu there seems to be no possibilty to configure access points with proxy.
Does someone have a wml example for nokia s40 v6 to get access point for the email prog in nokia c3-01 with proxy?
I found a WML-Example for Nokia s40 v5 but the c3-01 does not acceppt and does not show the access point after senden the generated .prov file to the c3-01. If someone needs help how to convert a wml to .prov i can help if needed.
heres the access point with proxy wml example for s40 v5:
<?xml version="1.0"?>
<!DOCTYPE wap-provisioningdoc PUBLIC "-//WAPFORUM//DTD PROV 1.0//EN"
"http://www.wapforum.org/DTD/prov.dtd">
<wap-provisioningdoc version="1.0">
<!-- This WML doc created by Ravi Mathur, January 12 2008 -->
<!-- HowardForums username: ravidavi -->
<characteristic type="BOOTSTRAP">
<!-- Name of the configuration -->
<parm name="NAME" value="Bild Postpaid JAVA"/>
</characteristic>
<!-- Defines how network access occurs -->
<characteristic type="ACCESS">
<parm name="RULE" value="Default Rule"/>
<!-- Connect through specified proxy -->
<parm name="TO-PROXY" value="BildProxy"/>
</characteristic>
<!-- Defines proxy parameters -->
<characteristic type="PXLOGICAL">
<parm name="PROXY-ID" value="BildProxy"/>
<parm name="NAME" value="Bild Proxy"/>
<characteristic type="PXPHYSICAL">
<parm name="PHYSICAL-PROXY-ID" value="Bild Proxy"/>
<parm name="PXADDR" value="139.7.29.1"/>
<parm name="PXADDRTYPE" value="IPV4"/>
<parm name="PUSHENABLED" value="0"/>
<characteristic type="PORT">
<parm name="PORTNBR" value="80"/>
</characteristic>
<!-- Connect through specified access point -->
<parm name="TO-NAPID" value="BildNAP"/>
</characteristic>
</characteristic>
<!-- Defines Network Access Point (NAP) parameters -->
<characteristic type="NAPDEF">
<parm name="NAPID" value="BildNAP"/>
<parm name="NAME" value="Bild NAP"/>
<parm name="BEARER" value="GSM-GPRS"/>
<parm name="NAP-ADDRESS" value="access.vodafone.de"/>
<parm name="NAP-ADDRTYPE" value="APN"/>
<characteristic type="NAPAUTHINFO">
<!-- PAP is "normal" authentication -->
<parm name="AUTHTYPE" value="PAP"/>
<parm name="AUTHNAME" value="Bild"/>
<parm name="AUTHSECRET" value="Bild123"/>
</characteristic>
</characteristic>
<characteristic type="APPLICATION">
<parm name="APPID" value="x-midlet"/>
<parm name="TO-PROXY" value="BildProxy"/>
<parm name="NAME" value="Bild Proxy"/>
</characteristic>
</wap-provisioningdoc>
thank you
MWI added one access point in settings and my email is working now.
I've done below steps, you could try to modify to your internet access point.
Menu->Settings->Configuration->Personal config. sett.->Options->Add new->Access point Account name: VFNZ internet Access point settings: Data bearer: Packet data Bearer settings: Packet data acc. pt.: www.vodafone.net.nz others keep the default values. Then back to the personal accounts and activate the VFNZ internet from Options.
Ovi Store can be accessed normally.
Maybe you are looking for
-
I have hundreds of addresses and phone numbers stored in outlook and want to get them converted over to address book as well as my calenders imported into the calendar program. However, I can't seem to get it to work. I export outlook to a tab and/or
-
Problem of sorting month name in pivot table
Hello, I have a month name that is sorted by month number in my repository. When I select Year + month name + measure sorted by year then by month name and I look the result in a table, everything works perfectly but when I switch to a pivot table th
-
Need help optimizing the writing of a very large array and streaming it a file
Hi, I have a very large array that I need to create and later write to a TDMS file. The array has 45 million entries, or 4.5x10^7 data points. These data points are of double format. The array is created by using a square pulse waveform generator and
-
Hi, can anyone help im trying to get a pakage to work in bluj compiler but keep getting the error package does not exist this is how the import statement is write the other query I have is do where do I put the package as the package I am using is fr
-
Upgrade JAX-WS stack inside WebLogic 10.3
I have a question on upgrading the JAX-WS stack that is built inside WebLogic 10.3. WebLogic 10.3 JAX-WS RI's version is Oracle JAX-WS 2.1.3 internally and now that JAX-WS 2.2 is out, I would like to use it for my application development. Is there a