I need to improve speed....
Gents,
I'm having an Java app which is logging "messages" into another another window(emulating the console with some clever functionality). In this window I'm using a JTextArea for displaying messages, and it seems that repainting this JTextArea is a bottleneck for performance... Do some of you have experience about the topic and some ideas of how to improve speed ?
Maybe use a simpler component than JTextArea, but I need copy&paste functionality in there ?
Cheers,
Preben
I feel the need...the need for speed!Sounds like my last 2 weeks! We developed filters for the database to clean some data and projected comletion of the run with filtes was 135 days for the first set (not good, especially since 17 different algorithms had to be applied). We've steadily brought it down, so now a run takes about 16 minutes.
speed... Speed... SPEED... I feel the need!
Similar Messages
-
Need to improve speed when graphing large arrays
My app generates several arrays of 500.000 elements which I want to display in a graph. Sending this array directly to a graph makes everything go very slow, I guess because of large memory allocations (LV is obviously not very good at handling large data unless having very good insight in how LV handles memory etc). It has been suggested in other posts and in App notes to decimate the data before displaying, since the graph can't display more points than the pixel-width anyway. The question is how to implement a decimation algorithm in order to get the same graph as if no decimation was made, and to preserve resolution when zooming into the graph. which require doing a new decimation with a new subset of the data. I think this graph decimation algo should have been implemented as a VI in LV, to put between the data and the graph. Since this is inherent in Labview when trying to graph more data points than pixelwidth, it should be hard to implement such a feature in LV. I would think this is quite common problem and would like to get some comments , especially from NI people, about this issue. Any work-arounds are also appreciated.
You are probably going to need the following sub vi's as well.
Thank You,
Earl
Attachments:
Contrast Bright Controls.vi 24 KB
AI Read config.vi 28 KB
Read Line.vi 21 KB -
Tips to improve speed? AX + AE in WDS
First, my network setup. I have a Verizon FiOS Actiontek router with the wireless radio turned off. I have an ethernet cable from that to an airport extreme (802.11g + modem). The airport extreme is configured as a bridge, relying on the FiOS router to assign IP address. That is all upstairs in my office. Downstairs I have an Airport Express (802.11n) configured as a WDS remote.
Everything is working fine and reliably. My issue is with speed. I'm paying for a 20M down, 5M up from Verizon. With my Mac Pro connected directly to the upstairs AE via ethernet, and using the speakeasy speedtest, I get the full 20/5. When I use my macbook downstairs connected to the AX, I get maybe 2M/300k.
I turned off interference robustness on both, jacked the transmit rate up to 11, turned off airtunes, and some other suggestions I read online to boost speed. That got me up to 6M/1M.
Any other tips to improve speed? Ideally I'd like to get the full 20M/5M everywhere in the house but I understand there is some serious overhead in a WDS network. Do you think 10M/2M would be feasible?
By the way, the AX is separated from the AE by 1 floor (almost directly below) and it is inside a cabinet.
Message was edited by: Brent R - corrected acronyms.You're going to be somewhat limited on what can be done to "improve" the wireless bandwidth with the WDS. At best, I would expect that you may get up to 30 Mbps for bandwidth on the extended local network.
One thing to try is to temporarily take the AX out of the cabinet to see if this provides an improvement. You want the best signal possible between the base stations. You may also want to use a utility, like iStumbler, to calculate the Signal-to-Noise Ratio (SNR) of the AirPort Extreme Base Station (AEBS) at the location of the AX. You may be surprised on how a small change in position, can improve the SNR. The higher the SNR value, the "better" the signal.
Let me know if you need further instructions on how to calculate SNR. -
HT1338 my mac keep freezing? what can i do to improve speed.
My mac pro keeps freezing what can I do to improve speed amd performance?
Things That Can Keep Your Computer From Slowing Down
If your computer seems to be running slower here are some things you can do:
Boot into Safe Mode then repair your hard drive and permissions:
Repair the Hard Drive and Permissions Pre-Lion
Boot from your OS X Installer disc. After the installer loads select your language and click on the Continue button. When the menu bar appears select Disk Utility from the Utilities menu. After DU loads select your hard drive entry (mfgr.'s ID and drive size) from the the left side list. In the DU status area you will see an entry for the S.M.A.R.T. status of the hard drive. If it does not say "Verified" then the hard drive is failing or failed. (SMART status is not reported on external Firewire or USB drives.) If the drive is "Verified" then select your OS X volume from the list on the left (sub-entry below the drive entry,) click on the First Aid tab, then click on the Repair Disk button. If DU reports any errors that have been fixed, then re-run Repair Disk until no errors are reported. If no errors are reported click on the Repair Permissions button. Wait until the operation completes, then quit DU and return to the installer.
If DU reports errors it cannot fix, then you will need Disk Warrior and/or Tech Tool Pro to repair the drive. If you don't have either of them or if neither of them can fix the drive, then you will need to reformat the drive and reinstall OS X.
Repair the Hard Drive - Lion
Boot from your Lion Recovery HD. When the recovery menu appears select Disk Utility. After DU loads select your hard drive entry (mfgr.'s ID and drive size) from the the left side list. In the DU status area you will see an entry for the S.M.A.R.T. status of the hard drive. If it does not say "Verified" then the hard drive is failing or failed. (SMART status is not reported on external Firewire or USB drives.) If the drive is "Verified" then select your OS X volume from the list on the left (sub-entry below the drive entry,) click on the First Aid tab, then click on the Repair Disk button. If DU reports any errors that have been fixed, then re-run Repair Disk until no errors are reported. If no errors are reported, then click on the Repair Permissions button. Wait until the operation completes, then quit DU and return to the main menu. Select Restart from the Apple menu.
Boot to the Recovery HD:
Restart the computer and after the chime press and hold down the COMMAND and R keys until the menu screen appears. Alternatively, restart the computer and after the chime press and hold down the OPTION key until the boot manager screen appears. Select the Recovery HD and click on the downward pointing arrow button.
Restart your computer normally and see if this has helped any. Next do some maintenance:
Suggestions for OS X Maintenance
For situations Disk Utility cannot handle the best third-party utility is Disk Warrior; DW only fixes problems with the disk directory, but most disk problems are caused by directory corruption; Disk Warrior 4.x is now Intel Mac compatible.
OS X performs certain maintenance functions that are scheduled to occur on a daily, weekly, or monthly period. The maintenance scripts run in the early AM only if the computer is turned on 24/7 (no sleep.) If this isn't the case, then an excellent solution is to download and install a shareware utility such as Macaroni, JAW PseudoAnacron, or Anacron that will automate the maintenance activity regardless of whether the computer is turned off or asleep. Dependence upon third-party utilities to run the periodic maintenance scripts was significantly reduced since Tiger. These utilities have limited or no functionality with Snow Leopard or Lion and should not be installed.
OS X automatically defragments files less than 20 MBs in size, so unless you have a disk full of very large files there's little need for defragmenting the hard drive. As for virus protection there are few if any such animals affecting OS X. You can protect the computer easily using the freeware Open Source virus protection software ClamXAV. Personally I would avoid most commercial anti-virus software because of their potential for causing problems. For more about malware see Macintosh Virus Guide.
I would also recommend downloading a utility such as TinkerTool System, OnyX 2.4.3, or Cocktail 5.1.1 that you can use for periodic maintenance such as removing old log files and archives, clearing caches, etc.
For emergency repairs install the freeware utility Applejack. If you cannot start up in OS X, you may be able to start in single-user mode from which you can run Applejack to do a whole set of repair and maintenance routines from the command line. Note that AppleJack 1.5 is required for Leopard. AppleJack 1.6 is compatible with Snow Leopard. There is no confirmation that this version also works with Lion.
When you install any new system software or updates be sure to repair the hard drive and permissions beforehand.
Get an external Firewire drive at least equal in size to the internal hard drive and make (and maintain) a bootable clone/backup. You can make a bootable clone using the Restore option of Disk Utility. You can also make and maintain clones with good backup software. My personal recommendations are (order is not significant):
Carbon Copy Cloner
Data Backup
Deja Vu
SuperDuper!
SyncTwoFolders
Synk Pro
Synk Standard
Tri-Backup
Visit The XLab FAQs and read the FAQs on maintenance, optimization, virus protection, and backup and restore.
Additional suggestions will be found in Mac maintenance Quick Assist.
Referenced software can be found at CNet Downloads or MacUpdate.
Additional Hints
Be sure you have an adequate amount of RAM installed for the number of applications you run concurrently. Be sure you leave a minimum of 10% of the hard drive's capacity as free space.
Add more RAM. If your computer has less than 2 GBs of RAM and you are using OS X Leopard or later, then you can do with more RAM. Snow Leopard and Lion work much better with 4 GBs of RAM than their system minimums. The more concurrent applications you tend to use the more RAM you should have.
Always maintain at least 15 GBs or 10% of your hard drive's capacity as free space, whichever is greater. OS X is frequently accessing your hard drive, so providing adequate free space will keep things from slowing down.
Check for applications that may be hogging the CPU:
Open Activity Monitor in the Utilities folder. Select All Processes from the Processes dropdown menu. Click twice on the CPU% column header to display in descending order. If you find a process using a large amount of CPU time, then select the process and click on the Quit icon in the toolbar. Click on the Force Quit button to kill the process. See if that helps. Be sure to note the name of the runaway process so you can track down the cause of the problem.
Often this problem occurs because of a corrupted cache or preferences file or an attempt to write to a corrupted log file. -
I need to improve the wireless router range of my time capsule. What sort of extender (repeater?) should I be considering? Will it affect my use of the time capsule as a hard drive backup?
In order to insure compatibility, you need to consider an Apple AirPort Express or AirPort Extreme if you are thinking about "extending" or "repeating" the network wirelessly.
It is also possible to extend the network by connecting an AirPort Extreme or Express back to the Time Capsule using a permanent wired Ethernet cable connection, which will provide better performance.
If you have a new "tower" model of the Time Capsule, then you would need a new "tower" version of the AirPort Extreme to take full advantage of the capabilities of the Time Capsule.
If you have an earlier "flat" or "square" version of the Time Capsule, then an AirPort Express would be a good match for the capabilities of the Time Capsule.
An "extender" will not affect the operation of your Time Capsule other than allow wireless devices to connect from a greater range at higher speeds. -
Will upgrading ram improve speed in Mac and windows (VMware fusion)?
I Am using VMware fusion for music production and that program requires a lot of workspace. I have a MacBook Pro 4gb ram and when I turn VMware on it goes to 2 gb ram in Mac and 2 gb ram in windows. My Mac speed is normal when VMware fusion is turned off but when I turn it on my Mac is very slow. Will upgrading ram improve speed in mac and also in windows (windows is also very slow)
Btw my english isn't very goodAdding RAM only makes it possible to run more programs concurrently. It doesn't speed up the computer nor make games run faster. What it can do is prevent the system from having to use disk-based VM when it runs out of RAM because you are trying to run too many applications concurrently or using applications that are extremely RAM hungry. It will improve the performance of applications that run mostly in RAM or when loading programs.
In your case it will most likely help. You should plan on at least 8 GBs or more, depending upon what your model supports. -
How can I improve speed on iMovie?
How can I improve speed on iMovie?
Hello jaquade,
Thanks for using Apple Support Communities.
For more information on this, take a look at:
iMovie: Tips to improve performance
http://support.apple.com/kb/TA27648?viewlocale=en_US
Best of luck,
Mario -
I have a MacBook 5,1 (13.3" aluminum from 2007 or 2008). Automatic updates will only let me get to OSX 10.5.8. Can I upgrade to Snow Leopard, Lion, or Mountain Lion (to improve speed)? I'm willing to purchase if necessary and it really helps.
MacBook upgrade possibilities - https://discussions.apple.com/message/19577869 - "The Early 2006 model 1,1 Core Duo can only run a maximum of 10.6 Snow Leopard. The models Late 2006 Core 2 Duos 2,1 through Early 2008 4,1 can only run a maximum of 10.7 Lion. The Late 2008 model 5,1 Aluminum Unibody through the Mid 2010 White Unibody model 7,1 can run 10.8 Mountain Lion."
Kappy 08/2012 post on upgrading to Snow Leopard, then Lion or Mountain Lion - https://discussions.apple.com/message/19401628 - including how to get Snow Leopard and Lion since Apple removed them from the online store. -
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 youlet 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 -
Need to improve query performance
I need to improve the following query, that takes more than 20 minutes to run...
all variables with v_ are set within procedure based on wheather user selected to filter on the field or chose not to
in my basic search, I only pass in equipment_index_number, when_discovered_date range and s_class
/*+ ORDERED INDEX (JCN, ad_jcn_trak_seq_wdd_ein_fil) USE_NL (JCN AM SH)
JCN.JOB_ID as JOB_ID,
JCN.JOB_SEQ as job_seq,
JCN.EQUIPMENT_INDEX_NUMBER as EQUIPMENT_INDEX_NUMBER,
AM.JOB_DATE_OF_LAST_UPDATE as job_date_of_last_update,
SH.UNIT_NAME as unit_name,
JCN.FILTER_KEY as FILTER_KEY,
AM.WHEN_DISCOVERED_CODE as when_discovered_code,
AM.MAN_HOURS_OPENING as man_hours_opening,
AM.TYPE_AVAILABILITY_CODE as type_availability_code,
AM.WHEN_DISCOVERED_DATE as WHEN_DISCOVERED_DATE,
AM.JCN as JCN,
AM.STATUS_CODE as STATUS_CODE,
AM.MAN_HOURS_REMAINING as MAN_HOURS_REMAINING,
AM.PRIORITY_CODE as PRIORITY_CODE,
AM.DATE_CLOSING as DATE_CLOSING,
AM.EQUIPMENT_NOMENCLATURE as EQUIPMENT_NOMENCLATURE,
AM.DEFERRAL_REASON_CODE as DEFERRAL_REASON_CODE,
AM.DUE_DATE as DUE_DATE,
AM.LOCATION as LOCATION,
AM.ACTION_TAKEN_CODE as ACTION_TAKEN_CODE,
AM.SAFETY_CODE as SAFETY_CODE,
AM.ESWBS_OPENING as ESWBS_OPENING,
AM.CSMP_NARRATIVE_SUMMARY as CSMP_NARRATIVE_SUMMARY,
AM.INSURV_NUMBER as INSURV_NUMBER ,
AM.INSURV_MAINTENANCE_INDICATOR as INSURV_MAINTENANCE_INDICATOR,
AM.INSURV_MISSION_DEGRADING_CODE as INSURV_MISSION_DEGRADING_CODE,
AM.PROBLEM_DESCRIPTION as PROBLEM_DESCRIPTION ,
AM.RECOMMEND_SOLUTION as RECOMMEND_SOLUTION,
AM.ACTUAL_SOLUTION as ACTUAL_SOLUTION ,
AM.CLOSING_REMARKS as CLOSING_REMARKS ,
AM.ADDITIONAL_NARRATIVE as ADDITIONAL_NARRATIVE
FROM
AD_TR JCN JOIN
RW_ACT_MAINT AM ON
JCN.JOB_SEQ = AM.JOB_SEQ
LEFT JOIN
SH_UNIT SH ON
JCN.HULL_NUMBER = SH.HULL_NUMBER
WHERE
JCN.JOB_SEQ is NOT null and
JCN.WHEN_DISCOVERED_DATE between p_from_date and p_to_date and
(v_jcn = -1 or AM.TYPE_HULL||AM.WORK_AREA||AM.JOB_SEQUENCE_NUMBER IN (select jcn from temp_hull_wa_jsn)) and
(v_apl = -1 or AM.APL IN (select apl from temp_apl_eic)) and
(v_eic = -1 or AM.EIC IN (select eic from temp_apl_eic)) and
(v_ein = -1 or JCN.EQUIPMENT_INDEX_NUMBER IN (select equipment_index_number from temp_ein)) and
(v_filter = -1 or JCN.FILTER_KEY IN (select filter_key from temp_filter)) and
(v_tmr = -1 or TRIM(AM.ACTION_TAKEN_CODE) = '8') and
(v_s_class = -1 or AM.S_CLASS IN (select s_class from temp_s_class)) and
(v_discovered = -1 or AM.WHEN_DISCOVERED_CODE IN (select when_discov_code from temp_when_discov_code)) and
(v_action = -1 and v_atc = -1) or
(v_action = 1 and v_atc = 1 and
(AM.ACTION_TAKEN_CODE IS NULL or AM.ACTION_TAKEN_CODE IN (select action_code from temp_action_code))
) or
(v_action = 1 and v_atc = -1 and
AM.ACTION_TAKEN_CODE IN (select action_code from temp_action_code)
) or
(v_action = -1 and v_atc = 1 and
AM.ACTION_TAKEN_CODE IS NULL
) and
(v_status = -1 or AM.STATUS_CODE IN(select status_code from temp_status_code)) and
(v_priority = -1 or AM.PRIORITY_CODE IN(select priority_code from temp_priority_code))and
(v_cause = -1 or AM.CAUSE_CODE IN(select cause_code from temp_cause_code))and
(v_deferral = -1 or AM.DEFERRAL_REASON_CODE IN(select deferral_reason_code from temp_deferral_code))and
(v_availability = -1 or AM.TYPE_AVAILABILITY_CODE IN(select type_availability_code from temp_type_avail_code)) and
(v_narrative = -1 or UPPER(AM.CSMP_NARRATIVE_SUMMARY) LIKE v_upper_narrative or
UPPER(AM.PROBLEM_DESCRIPTION) LIKE v_upper_narrative or UPPER(AM.RECOMMEND_SOLUTION) LIKE v_upper_narrative or
UPPER(AM.ACTUAL_SOLUTION) LIKE v_upper_narrative or UPPER(AM.CLOSING_REMARKS) LIKE v_upper_narrative or
UPPER(AM.ADDITIONAL_NARRATIVE) LIKE v_upper_narrative or UPPER(AM.SLR_NARRATIVE) LIKE v_upper_narrative) and
(v_niin = -1 or EXISTS
(select 1 from rw_issues pi
where pi.job_seq=am.job_seq and
pi.niin in (select niin from temp_niin))
or EXISTS
(select 1 from rw_demands pd
where pd.job_seq=am.job_seq and
pd.niin in (select niin from temp_niin))
ORDER BY JCN.H_NUMBER, JCN.WORK_AREA, JCN.JSN, JCN.JCN_SUFFIX;
AD_TR table has 5 mil rows, RW_ACT_MAINT has 15 mil rows and sh_unit has only 1000 rows
I have index on AD_TR table for job_seq, when discovered date, equipment_index_number and filter_key which is the most frequent search selections that user makes...
any suggestions?SQL> show parameter optimizer
NAME TYPE VALUE
optimizer_dynamic_sampling integer 2
optimizer_features_enable string 10.2.0.4
optimizer_index_caching integer 0
optimizer_index_cost_adj integer 100
optimizer_mode string ALL_ROWS
optimizer_secure_view_merging boolean TRUE
SQL>
SQL> show parameter db_file_multi
NAME TYPE VALUE
db_file_multiblock_read_count integer 16
SQL>
SQL> show parameter db_block_size
NAME TYPE VALUE
db_block_size integer 8192
SQL>
SQL> show parameter cursor_sharing
NAME TYPE VALUE
cursor_sharing string EXACT
SQL>
SQL> column sname format a20
SQL> column pname format a20
SQL> column pva12 format a20
SQL>
SQL> select sname
2 , pname
3 , pval1
4 , pval2
5 from
6 sys.aux_stats$;
SNAME PNAME PVAL1 PVAL2
SYSSTATS_INFO STATUS COMPLETED
SYSSTATS_INFO DSTART 12-05-2007 14:40
SYSSTATS_INFO DSTOP 12-05-2007 14:40
SYSSTATS_INFO FLAGS 1
SYSSTATS_MAIN CPUSPEEDNW 1227.03273
SYSSTATS_MAIN IOSEEKTIM 10
SYSSTATS_MAIN IOTFRSPEED 4096
SYSSTATS_MAIN SREADTIM
SYSSTATS_MAIN MREADTIM
SYSSTATS_MAIN CPUSPEED
SYSSTATS_MAIN MBRC
SNAME PNAME PVAL1 PVAL2
SYSSTATS_MAIN MAXTHR
SYSSTATS_MAIN SLAVETHR
13 rows selected.
SQL>
SQL> explain plan for
Execution Plan
Plan hash value: 2373934626
| Id | Operation | Name | Rows | Bytes | Cost (%CPU)| Time | Pstart| Pstop |
| 0 | SELECT STATEMENT | | 113 | 13221 | 319 (1)| 00:00:04 | | |
| 1 | SORT ORDER BY | | 113 | 13221 | 319 (1)| 00:00:04 | | |
|* 2 | HASH JOIN OUTER -
I have a macbook pro 13’ (late 2011) 2.8Ghz Intel i7 memory 4GB 1333 MHz DDR3 and have upgraded my OS X Lion to Mavericks 10.9.5. Everything has slowed down and the battery lasts a bit earlier. How do I go back to the older OS X Lion? Or should I improve speed differently? Would improving memory to 8GB help?
i have run the EntreCheck and here is the report:
EtreCheck version: 1.9.15 (52)
Report generated 28 September 2014 16:16:39 GMT+3
Hardware Information: ?
MacBook Pro (13-inch, Late 2011) (Verified)
MacBook Pro - model: MacBookPro8,1
1 2.8 GHz Intel Core i7 CPU: 2 cores
4 GB RAM
Video Information: ?
Intel HD Graphics 3000 - VRAM: 384 MB
Color LCD 1280 x 800
System Software: ?
OS X 10.9.5 (13F34) - Uptime: 0 days 4:59:22
Disk Information: ?
TOSHIBA MK7559GSXF disk0 : (750.16 GB)
S.M.A.R.T. Status: Verified
EFI (disk0s1) <not mounted>: 209.7 MB
Macintosh HD (disk0s2) / [Startup]: 749.3 GB (203.96 GB free)
Recovery HD (disk0s3) <not mounted>: 650 MB
MATSHITADVD-R UJ-8A8
USB Information: ?
Apple Inc. FaceTime HD Camera (Built-in)
Vodafone (ZTE) Vodafone Mobile Broadband K3565-Z
Apple Inc. BRCM2070 Hub
Apple Inc. Bluetooth USB Host Controller
Apple Inc. Apple Internal Keyboard / Trackpad
Apple Computer, Inc. IR Receiver
Thunderbolt Information: ?
Apple Inc. thunderbolt_bus
Gatekeeper: ?
Mac App Store and identified developers
Kernel Extensions: ?
[not loaded] com.ZTE.driver.ModemDriverMac (1.0.2d1) Support
[loaded] com.ZTE.driver.ZTEUSBCDCACMData (1.3.1) Support
[not loaded] com.ZTE.driver.ZTEUSBMassStorageFilter (1.3.1) Support
[not loaded] com.roxio.BluRaySupport (1.1.6) Support
[not loaded] com.roxio.TDIXController (2.0) Support
Startup Items: ?
HWNetMgr: Path: /Library/StartupItems/HWNetMgr
HWPortDetect: Path: /Library/StartupItems/HWPortDetect
StartOuc: Path: /Library/StartupItems/StartOuc
Launch Daemons: ?
[running] cn.com.zte.PPPMonitor.plist Support
[loaded] com.adobe.fpsaud.plist Support
[loaded] com.microsoft.office.licensing.helper.plist Support
[running] PPPMonitord.plist Support
Launch Agents: ?
[running] cn.com.zte.usbswapper.plist Support
[running] com.hp.devicemonitor.plist Support
[loaded] com.hp.messagecenter.launcher.plist Support
[running] Swapper.plist Support
User Login Items: ?
iTunesHelper
Dropbox
Internet Plug-ins: ?
SharePointBrowserPlugin: Version: 14.0.0 Support
FlashPlayer-10.6: Version: 15.0.0.152 - SDK 10.6 Support
Flash Player: Version: 15.0.0.152 - SDK 10.6 Support
QuickTime Plugin: Version: 7.7.3
Default Browser: Version: 537 - SDK 10.9
Safari Extensions: ?
AdBlock-2
Audio Plug-ins: ?
BluetoothAudioPlugIn: Version: 1.0 - SDK 10.9
AirPlay: Version: 2.0 - SDK 10.9
AppleAVBAudio: Version: 203.2 - SDK 10.9
iSightAudio: Version: 7.7.3 - SDK 10.9
iTunes Plug-ins: ?
Quartz Composer Visualizer: Version: 1.4 - SDK 10.9
3rd Party Preference Panes: ?
Flash Player Support
MacFUSE Support
Tuxera NTFS Support
Time Machine: ?
Time Machine not configured!
Top Processes by CPU: ?
5% Safari
3% WindowServer
2% BitTorrent
2% hidd
0% softwareupdated
Top Processes by Memory: ?
229 MB Safari
160 MB softwareupdated
156 MB com.apple.WebKit.WebContent
135 MB com.apple.IconServicesAgent
102 MB VLC
Virtual Memory Information: ?
45 MB Free RAM
1.55 GB Active RAM
1.52 GB Inactive RAM
895 MB Wired RAM
628 MB Page-ins
0 B Page-outs -
I ran the program to improve speed and crashing and lost my norton tool bar and vault login
I ran the program to improve speed and crashing and lost my norton tool bar and vault with all my log ins. I am sure it is still here some place but can not find it.
Hi flkeen, Did you try to uninstall that program which you install to improve speed ..see if that works after un install that program....and restore the firefox after uninstalling that program.
see link here for reset firefox https://support.mozilla.org/en-US/kb/reset-preferences-fix-problems?esab=a&s=restore+firefox&r=1&as=s#w_solution-1-reset-firefox-to-its-default-state -
FCP 10.1 slow timeline and editing - Any suggestions to improve speed?
Recently updated to OS X 10.9.1 and FCP 10.1. Now experiencing very slow editing and movement in timeline. FCP is responding some 2 to 5 seconds after providing an editing command. The slowest response is to scrolling in the timeline - 2 finger scroll does not respond for up to 10 seconds after doing it.
Render times are fine and similar to previous FCP X versions.
Never had this problem in previous versions of FCP X.
So far I have done the following things based on forums and a call to apple support(?).
Deleted all plug ins.
Started from scratch a project that I was half way through and imported all clips from scratch to a new Library (external Hard Drive).
Deleted FCP and reinstalled including deleting all preferences.
Timeline is quick in the early stages of the project but gets slower as I progress - about 3 minutes into my project now (approx 200 clips) and editing time is becoming impossible.
Am using Mac Book Pro with 2.5 GhzIntel Core i7, 8GB 1333 MHz DDR3, Intel HD Graphics 3000 512 MB.
Anyone able to assist with further suggestions?
ThanksHi Ian and Russ
Thanks for your interest.
Hard drive is 500GB of which I have used approx 300GB. I am using an external hard drive for this project.Footage is from Canon 7D/70D which is H.264 which is the same as other successful projects.
Yes I do have a number of photos (say 30 @ 18mp) that I am using as part of the project although I have used these before in previous versions of FCP X without impact.
Tried activity monitor (first time I had used it).
When scrowling through time line (one of the problem activities) memory does not move much- Real memory approx 925mb, Virtual memory 6GB, shared memory 44mb, Private memory 75mb. Interstingly though when performing this task CPU usage goes > 100% and averages 130%.
Does this help with any potential diagnostics and solutions?
Thanks
Re: FCP 10.1 slow timeline and editing - Any suggestions to improve speed? -
Need apps: BEST speed dialer favorite, BEST video viewer, BEST list maker..
Need apps: BEST speed dialer favorite (I have to turn on/off and reset hourly to get email so I can't keep favorites in my phone area), BEST video viewer (short form or longer form) AND BEST list maker that allows sync with online component (so I can keep a list on iPhone and/or online when not on iPhone).
Thanks!Ah yeah I know that. I am asking users on this board what they consider the "BEST" in a specific category. The app store is not very user friendly (too many clicks), plus the categories are vague and contain a mish-mosh of stuffs. I have downloaded several apps (free and paid) for other needs—but really would like suggestions on those I have yet to download.
BTW your response was rather lame and not very helpful. -
Ps4 needing a minimum speed of 100 10 160 meg spee...
Will bt be able to deliver the speed for ps4 online gaming bettween 100 to 160 meg per second minimum with virgin going to do those speeds for the same price bt infinty 2 prices and for ultra hd film download bt need to resolve this very quickly before the 29/11/2013 and virgin are going to do fttp not this fttc bt do so when will bt deliver full fiber broadband not fiber to the cabinate fiber to the premise or customers home to me to be called fiber broadband say to me from exchange to your home not the cabinate witch is not good enough to me and a load of other like minded people
All the news sources I can see on the net talk about needing faster upload speeds. Standard ADSL tops out at about 1M.
If the PS4 really needs 100M broadband to work (and I can't see any possible reason why it should) then it will be dead in the water on launch, as most people simply don't have that sort of speed and won't be able to get it.
Maybe you are looking for
-
Can I return my purchase in App Store?
I bought a radio software from App Store for my MAC, but it shows that it can't works good. Can I return it and refund? How to return? Thanks
-
I had been using the IPAD and all of a sudden it started talking back to me and when swiping apps to close them they would not close. She (the IPAD) kept talking back to me such as "use three fingers" etc. Then the screen went blank and if I touched
-
How can I get Adobe Bridge to show XMP metadata using Adobe Drive 4 CMIS Connector?
I have successfully connected to an Alfresco Enterprise Edition 4.1.0 repository, using the Adobe Drive 4, created a test folder and uploaded a jpeg file containing XMP metadata into it. When I view the image's metadata (using Adobe Bridge), I observ
-
Sudden problem with importing tiff files with alpha channel (CS5)
OK this is driving me nuts. For years I have been importing image files that have an alpha channel into FCP as.tiff files. I use Photoshop files only when I want to use the layers as they are too cumbersome otherwise). I have recent upgraded Photosh
-
Has anyone "ripped" a dvd of a TV to their ipod? I have, but the audio will not match the video and the video stutters. I've ripped movies from dvd's without any problems. Anyone...? Thanks!!