Shortest path with prohibited turn (without Navteq data)
I have a network builded with TeleAtlas data.
The link$ and node$ tables don't consider the turn prohibited.
e.g. at this link of google maps:
http://maps.google.it/maps?f=d&source=s_d&saddr=45.6165251,+9.247544&daddr=45.6159678,+9.2477555+to:45.6159678,+9.2477555+to:45.6160557,+9.2481154&geocode=FY0NuAIdOBuNAA%3BFWALuAIdDByNAA%3BFWALuAIdDByNAA%3BFbgLuAIdcx2NAA&hl=it&mra=ls&sll=45.616249,9.247651&sspn=0.001017,0.000767&ie=UTF8&ll=45.61621,9.247667&spn=0.001056,0.00284&z=19&layer=c&cbll=45.616297,9.247631&panoid=6f3M-O4JQKPGc6-I24luQw&cbp=12,163.12,,0,0.5
you can't turn to left because it's prohibited (look blue signal to the right before intersection).
Huiling tells me that for USA network:
Huiling wrote:
Yes, navteq provides prohibited turn information. We associate the prohibited turn information with links as link user data, and implement a network constraint to decide whether going to the next link allowed.Now, for TeleAtlas data, I have two tables that contains informations about turn prohibited. I don't understand how can use these information. Must I extract these informations and must I insert them into a field of link$ table? (and after create an user_data on this field?)
By ndm_tutorial, I installed the NAVTEQ_SF_SAMPLE.dmp and by link$ table:
SQL> desc edge
Name Null? Type
EDGE_ID NUMBER
START_NODE_ID NUMBER
END_NODE_ID NUMBER
PARTITION_ID NUMBER
FUNC_CLASS NUMBER
LENGTH NUMBER
SPEED_LIMIT NUMBER
GEOMETRY MDSYS.SDO_GEOMETRY
NAME VARCHAR2(128 CHAR)
DIVIDER VARCHAR2(1)I want ask you where are the turn prohibited information.
Thank you very much in advance.
Hello,
I implemented these two methods as from example but the problem persist.
Can you help me to understand the problem?
The algorithm diverges.
Thank you very much.
This is my code:
public boolean isSatisfied(LODAnalysisInfo info) {
boolean res = true;
LogicalLink currentLink = info.getCurrentLink();
LogicalLink nextLink = info.getNextLink();
if (currentLink != null){
String prohibitedTurnIds = (String) currentLink.getUserData(UserDataMetadata.DEFAULT_USER_DATA_CATEGORY).get(indexPRO_TURN);
prohibitedTurnIds += currentLink.getId() + "|";
boolean isTurnValid = false;
if (res){
isTurnValid = true;
String nextLinkString = "|"+nextLink.getId()+"|";
if (prohibitedTurnIds.contains(nextLinkString)){
isTurnValid = false;
} else
if (!isTurnValid)
res = false;
//update partiallyExpandedNodes
LogicalNetNode currNode = info.getCurrentNode();
if(!prohibitedTurnIds.equals("|")) //no pturn involved
partiallyExpandedNodes.remove(currNode.getId());
else
LogicalNetLink[] outLinks = currNode.getOutLinks(true);
boolean[] isOutLinksExpanded = partiallyExpandedNodes.get(currNode.getId());
if(isOutLinksExpanded==null)
isOutLinksExpanded = new boolean[currNode.getNumberOfOutLinks()];
partiallyExpandedNodes.put(currNode.getId(), isOutLinksExpanded);
boolean isFullyExpanded = true;
for(int i=0; i<outLinks.length; i++)
if(outLinks.getId()==nextLink.getId())
if(isTurnValid)
isOutLinksExpanded[i] = true;
isFullyExpanded = isFullyExpanded && isOutLinksExpanded[i];
if(isFullyExpanded)
partiallyExpandedNodes.remove(currNode.getId());
return res;
public void reset() {
partiallyExpandedNodes.clear();
public boolean isCurrentNodePartiallyExpanded(LODAnalysisInfo info)
long currNodeId = info.getCurrentNode().getId();
boolean res = partiallyExpandedNodes.containsKey(currNodeId);
return res;
public boolean isNextNodePartiallyExpanded(LODAnalysisInfo info)
long nextNodeId = info.getNextNode().getId();
boolean res = partiallyExpandedNodes.containsKey(nextNodeId);
return res;
Similar Messages
-
PC Crashed, need to get iPhone synced with new PC without losing data
I have an iPhone 4 which I purchased a few weeks ago. Love the phone. The PC I set it up with has crashed so I need to use another PC to store/transfer data to/from the iPhone. I don't want to lose the data I have already put on the iPhone (about 700 songs, movies, 200 apps, contacts...) so a simple sync will not work. The files on this other PC are almost identical to the files I had on the original PC. Is there any way to change the single PC the phone will connect with, without changing/losing the data already on the iPhone?
It has always been very basic to always maintain a backup copy of your computer files/docs/pics/music/etc.
Use your backup copy to put everything on the new computer.
The music sync is one way - computer to iphone. The only exception is itunes purchases. Without syncing: File>Transfer Purchases
If you sync your iphone contacts/calendars to a blank computer, then they will be erased as well. Another reason to use your backup.
If for some reason you have failed to maintain a backup, then you can enter one unique contact and calendar entry on the new computer. When you first sync, then you should get the option to merge. -
Shortest path with more than one traveler and time constraints
Please have a look at this problem...Thank you..
(the problem is ok with one traveler. but when two or more come into the picture they really mess things up)
Here it is
I have a number of destinations that devides evenly up between a
number of travelers. (5 travelers with 20 destinations = 4
destinations each)
All destination can be visited by all travelers but it can ony be visited once
Each destination has to be visited and
each traveler has to visit the same amount of destinations.
The total amount of traveling has to be minimized.
Grid references have been given to work out the distance between each
destination. (the distances have not been worked out prior to the
start of the problem)
The starting point of each traveler is not at any of the destinations
and is different to each other. This point is also known and can be
used to calculate the distance to any destination.
there is an extra part of the problem (which I think I can sort out but if its of interest here it is any way): Each destination can only be
visited at a certain time of the day (ie between 7- 9 and 9-12 and
12-3 and 3-6)
A typical problem would have about 300 destinations and about 50
travelers every day. ie about 6 destination a day per traveler.
Could any one please give me an idea of how you would go about working the
routes out for each traveler that minimizes travelling distance as there is no algorithm that does this kind of routing.
I would really like some help with this one please. I have many ideas of how to do it but i really feel like it is not optimised...
I have to complete this in one week and have no AI experiance ( I would like to do this without AI or anything to do with ant colonies and or swarm optimization)
Thank you.The reason that the time is in fact a simple constraint is because this is a homework problem and the kids only have a week to work on it. If it were a real world problem you you not conveniently have the number of travelers divide evenly into the number of cities.
If it were not some homework problem you would not have a constraint that reads "Oh by the way, for extra credit, you can only visit some cities at certain times during the day." It would either be a real constraint or not.
The other indication that it is a homework problem is that the student was given a week to do it. I will perhaps be going out on a limb here, but NO reasonable business gives some bozo one week to complete an assignment for which the bozo is so clueless that he has to hit the net and ask random people if they can tell him how to do it.
Had there been any need to model travel time, then velocity of travelers would have been mentioned at some point. If the traveler were actually doing anything in a city, time to load or unload the truck would have been given. And lastly, what real world problem would add a constraint that no two travelers could go to the same city. What if it is shorter to get from A to C by going through B which has already been visited. This constraint was the tip that the solution was a partition of a set of cities.
My gross simplification is merely that this is a homework problem and therfore if I haven't been told otherwise I am free to assume that a traveler moving at infinite velocity is perfectly OK. This means that my traveler waits at the door to a city until it opens, picks off that city and all other in zero time, until it bangs up against a city that opens at a later time, where it must again wait till opening time. The only thing that prevents him from completing his circuit is if an early city comes after a late city. A simple sort is all you need.
Lastly, even if you want to toss in a more complicated velocity model, it does little more than mildly complicate the sort comparison calculation so instead of making the comparison
boolean ICanMakeIt = city.openingTime <= city[i+1].openingTime
it becomes
boolean ICanMakeIt = city.exitTime +
Traveler[j].vel*dist(i,i+1) <= city[i+1].closingTime
I think you are mistaken in declaring this to be a difficult modeling problem -
How to view windows Xp formatted hard drive with Macbook pro without losing data
How to view Windows Xp programed Hard drive with Macbook pro with out losing data on hardrive
Go to the First Aid tab in Disk Utility, select the external drive partition and read the format from the lower left, at the bottom.
-
Register with BES server without Enterprise data plan
I read on this forum that there is a few ways to register with your company's BES even if you have the standard 29.99 data plan. The limitation is that you have to be connected to your company's lan, and perform the registration while on the lan.
In order to register remotely, you must purchase the 44.99 enterprise data plan, which I do not want to do.
Both verizon support and my helpdesk is telling me they can't do it, but I found instructions on this. Can it be done? Am I missing something?
http://support.opt3.com/KB/a45/activate-blackberry-using-blackberry-enterprise-server.aspxHi,
To answer your question, it can not be done unless you have the BES plan added to your account, which is currently $44.99/month. If I read the article you mentioned in your post correctly, it states the following:
Note: BlackBerry smartphones cannot be activated over the wireless network or the organization's Wi-Fi® network if they have a data plan for BlackBerry Internet Service only.
I read that as if you have a Blackberry that is currently on a data plan (BIS), the regular individual data plan, you can not activate your device. Hope this helps,
Doc -
Hey guys, first...Happy thanksgiving :)
Ok, so I'm on my last assignment for my amazingly taught Data Structures class. I battled my way successfully through recursion, binary trees, redblack trees, 234 trees, B Trees, and heaps!...no issues at all!....but, now I have hit graphs. I understand the concept, but my latest assignment has me a bit frustrated..Im so close to finishing I can taste it!!....I just cant find the spoon..
Here we go:
We are given a graph on paper. It has circles (verteci) representing cities in the USA. These circles are connected by lines (edges) representing the distance between the cities. Also, the lines have arrows pointing the direction they may be traversed.
We are to construct the graph in the computer, and then compute the shortest path from washington (Vertex 0) to every other city.
I managed to construct the graph, and it will find the shortest path no problem. My only issue is that, it wants us to print the path it took, not just the destination and total distance....
I have tried using a stack to push the verteci onto as theyre visited, but im not getting happy results.
I should also mention, this code is taken out of the book with modifications by me so that it can add edges and verteci, and it now accepts String types for the vertex labels instead of characters.
Here is my code
PATH.JAVA (the important part)
// path.java
// demonstrates shortest path with weighted, directed graphs
// to run this program: C>java PathApp
import java.lang.*;
import java.io.*;
class DistPar // distance and parent
{ // items stored in sPath array
public int distance; // distance from start to this vertex
public int parentVert; // current parent of this vertex
public DistPar(int pv, int d) // constructor
distance = d;
parentVert = pv;
} // end class DistPar
class Vertex
public String label; // label (e.g. 'A')
public boolean isInTree;
public Vertex(String lab) // constructor
label = lab;
isInTree = false;
} // end class Vertex
class Graph
private final int MAX_VERTS = 20;
private final int INFINITY = 1000000;
private Vertex vertexList[]; // list of vertices
private int adjMat[][]; // adjacency matrix
private int nVerts; // current number of vertices
private int nTree; // number of verts in tree
private DistPar sPath[]; // array for shortest-path data
private int currentVert; // current vertex
private int startToCurrent; // distance to currentVert
private stack path_taken; // stack to record path taken
public Graph() // constructor
vertexList = new Vertex[MAX_VERTS];
// adjacency matrix
adjMat = new int[MAX_VERTS][MAX_VERTS];
nVerts = 0;
nTree = 0;
for(int j=0; j<MAX_VERTS; j++) // set adjacency
for(int k=0; k<MAX_VERTS; k++) // matrix
adjMat[j][k] = INFINITY; // to infinity
sPath = new DistPar[MAX_VERTS]; // shortest paths
path_taken = new stack(MAX_VERTS);
} // end constructor
public void addVertex(String lab)
vertexList[nVerts++] = new Vertex(lab);
public void addEdge(int start, int end, int weight)
adjMat[start][end] = weight; // (directed)
public void path() // find all shortest paths
int startTree = 0; // start at vertex 0
vertexList[startTree].isInTree = true;
nTree = 1; // put it in tree
// transfer row of distances from adjMat to sPath
for(int j=0; j<nVerts; j++)
int tempDist = adjMat[startTree][j];
sPath[j] = new DistPar(startTree, tempDist);
// until all vertices are in the tree
while(nTree < nVerts)
int indexMin = getMin(); // get minimum from sPath
int minDist = sPath[indexMin].distance;
if(minDist == INFINITY) // if all infinite
{ // or in tree,
System.out.println("There are unreachable vertices");
break; // sPath is complete
else
{ // reset currentVert
currentVert = indexMin; // to closest vert
startToCurrent = sPath[indexMin].distance;
// minimum distance from startTree is
// to currentVert, and is startToCurrent
// put current vertex in tree
vertexList[currentVert].isInTree = true;
nTree++;
path_taken.push(sPath[indexMin]);
adjust_sPath(); // update sPath[] array
} // end while(nTree<nVerts)
displayPaths(); // display sPath[] contents
nTree = 0; // clear tree
for(int j=0; j<nVerts; j++)
vertexList[j].isInTree = false;
} // end path()
public int getMin() // get entry from sPath
{ // with minimum distance
int minDist = INFINITY; // assume minimum
int indexMin = 0;
for(int j=1; j<nVerts; j++) // for each vertex,
{ // if it's in tree and
if( !vertexList[j].isInTree && // smaller than old one
sPath[j].distance < minDist )
minDist = sPath[j].distance;
indexMin = j; // update minimum
} // end for
return indexMin; // return index of minimum
} // end getMin()
public void adjust_sPath()
// adjust values in shortest-path array sPath
int column = 1; // skip starting vertex
while(column < nVerts) // go across columns
// if this column's vertex already in tree, skip it
if( vertexList[column].isInTree )
column++;
continue;
// calculate distance for one sPath entry
// get edge from currentVert to column
int currentToFringe = adjMat[currentVert][column];
// add distance from start
int startToFringe = startToCurrent + currentToFringe;
// get distance of current sPath entry
int sPathDist = sPath[column].distance;
// compare distance from start with sPath entry
if(startToFringe < sPathDist) // if shorter,
{ // update sPath
sPath[column].parentVert = currentVert;
sPath[column].distance = startToFringe;
column++;
} // end while(column < nVerts)
} // end adjust_sPath()
public void displayPaths()
for(int j=0; j<nVerts; j++) // display contents of sPath[]
System.out.print(vertexList[j].label + "="); // B=
if(sPath[j].distance == INFINITY)
System.out.print("inf"); // inf
else
System.out.print(sPath[j].distance); // 50
String parent = vertexList[ sPath[j].parentVert ].label;
System.out.print(" (" + parent + ") "); // (A)
System.out.println("");
System.out.println("PRINTING path_taken");
DistPar thing = null;
while((thing = path_taken.pop()) != null)
System.out.println(" " + vertexList[thing.parentVert].label + " "+ thing.distance);
} // end class GraphSTACK.JAVA (my stack class)
// stack.java
// demonstrates stacks
// to run this program: C>java StackApp
class stack
private int maxSize; // size of stack array
private DistPar[] stackArray;
private int top; // top of stack
public stack(int s) // constructor
maxSize = s; // set array size
stackArray = new DistPar[maxSize]; // create array
top = -1; // no items yet
public void push(DistPar j) // put item on top of stack
stackArray[++top] = j; // increment top, insert item
public DistPar pop() // take item from top of stack
return stackArray[top--]; // access item, decrement top
public DistPar peek() // peek at top of stack
return stackArray[top];
public boolean isEmpty() // true if stack is empty
return (top == -1);
public boolean isFull() // true if stack is full
return (top == maxSize-1);
}PATHAPP.JAVA (test program..builds the graph and calls path())
class PathApp
public static void main(String[] args)
Graph theGraph = new Graph();
theGraph.addVertex("Washington");
theGraph.addVertex("Atlanta");
theGraph.addVertex("Houston");
theGraph.addVertex("Denver");
theGraph.addVertex("Dallas");
theGraph.addVertex("Chicago");
theGraph.addVertex("Austin");
theGraph.addEdge(0,1,600);
theGraph.addEdge(1,0,600);
theGraph.addEdge(0,4,1300);
theGraph.addEdge(4,3,780);
theGraph.addEdge(3,1,1400);
theGraph.addEdge(1,2,800);
theGraph.addEdge(2,1,800);
theGraph.addEdge(4,5,900);
theGraph.addEdge(4,6,200);
theGraph.addEdge(6,4,200);
theGraph.addEdge(6,2,160);
theGraph.addEdge(3,5,1000);
theGraph.addEdge(5,3,1000);
System.out.println("Shortest Paths");
theGraph.path();
//theGraph.displayPaths();
System.out.println();
}Im mostly having trouble comprehending the Path.java file. A few friends and I stared at it for a few hours and couldnt get it to do what we wanted...
path_taken is the stack I added in to try and push/pop the verteci as theyre traversed, but with what I stuck in right now, it still just prints the most recently visited vertex, and the sum of the distances.
Any help is greatly appreciated!
Thanks :)
----ArkhanIf your graph is G(V, E), and you're trying to get to vertex v_end, then create a new graph G'(V', E') whereV' = (V x N) U {v_end'}
(v_end' is a new object)
E' = {((u, t), (v, t + f(u, v, t))) : (u, v) in E, t in N} U
{((u, t), (u, t + 1)) : u in V, t in N} U
{((v_end, t), v_end') : t in N}G' is infinite, so you'll need to use a lazy graph structure. Then just use Dijkstra from (v_start, 0) to v_end'. -
Export PDF converts filled PDF form without the data - Turns filled PDF form onto blank Word doc. Is there a solution to this or did Adobe just sell me a service that doesn't work?
ExportPDF is not for forms. In general, converting forms to Word is a really, really bad idea which can even cause legal problems. Work with the form as a PDF. Acrobat (not Reader) can export form data as simple text for example.
-
Revision: 4793
Author: [email protected]
Date: 2009-02-02 11:20:06 -0800 (Mon, 02 Feb 2009)
Log Message:
Fix bug SDK-17734 Path with width and height set different than path data has incorrect bounds
Fix: When calculating the bounds position we should take into account the implicit scaling factor actualSize/naturalSize. Also did some refactoring, getting rid of the protected method calculateTopLeft.
QE Notes: None
Doc Notes: None
Bugs: SDK-17734
Reviewer: Ryan
tests: mustella gumbo/layout/GraphicElement
Ticket Links:
http://bugs.adobe.com/jira/browse/SDK-17734
http://bugs.adobe.com/jira/browse/SDK-17734
Modified Paths:
flex/sdk/trunk/frameworks/projects/flex4/src/mx/graphics/Ellipse.as
flex/sdk/trunk/frameworks/projects/flex4/src/mx/graphics/Path.as
flex/sdk/trunk/frameworks/projects/flex4/src/mx/graphics/graphicsClasses/GraphicElement.a sThank you so much for replying.
Yes I have removed and reinstalled WMP.
I had good results with the PD6 application installed on the default path onto the C: drive with the one exception that if the application was launched by accident and the user data path was not available, the PD6 application would blow away my custom user path registry settings. Now that I know what they are I have made a .reg file to repair my registry to my desired user data paths.
Installing the application on the removable drive appeared to help prevent me from launching the application by accident and overwriting my registry with default user paths.
So which is the less of the two evils?
If the application directory is not available, windows media player still tries to launch the .msi for installing PD6.
If I install the application to the C: drive but the user data to the removable drive, launching the PD6 application without the user data drive will still corrupt my registry settings for a user data path.
Both these issues seem like a logical (if not easy) fix that should be done in the PD6 application and installation package. I mean really, cannot anyone tell me why windows media player is checking the PD6 application directory? Why in PD4 did we have an option control for setting the user data path from the PD4 application? Why is this option not in the PD6 application, just the installer?
I am given a choice during installation to move the user data to another non default location. Why else would this be provided if not to accommodate my kind of request to store the user data into an alternate location other than “My Document”. Certainly Palm is not trying to force the users on how to protect and store their personal data?
Post relates to: Centro (Verizon) -
Shortest Path Algorithm with Djikstra
Hi all,
im developing a shortest path searching techniques by using Djikstra's algorithm. My search space is very huge and it is about 100,000 nodes or we can call it Vertex. I store all the nodes and weight of edges in MySql as follows:
From | To | PathCost
A B 2
B A 2
A D 9
D A 9
B C 7
C B 7
B E 5
E B 5
C D 5
D C 9
Whenever the class receive any request from someone who want to go from point A to point Z, it will load the data from mysql by using "Select * FROM table WHERE From='Variable' ", and declare it as new Vertex, and perform the search. The reason i load it from MySql everytime i receive a new request is because any new node can be added to database anytime.
In a nut shell, im developing a system to search for a shortest path in real world, i represent buildings as a Vertex, and road as edges, any idea of what can i improve my current djikstra searching method or any new developement to reduce the running time to lowest??
regards,
howsenminimal spanning tree != shortest path...
Mr. Pike is indeed correct. Consider this simple example. arrange a bunch of dots around the rim of a circle. Consider the distance between them to be just the standard measure of distance in the plane. Assume that the points are fairly evenly spaced, but not exactly evenly spaced.
The minimal spanning tree, which you got by first joining the two closest points and then the next two, and then by joining more points to that structure, will end up looking like a letter C going around the circle and leaving a gap between the two points that were the furthest apart on the circle.
Every point connects to every other point, possibly by passing through other points and it is minimal because it left out the widest gap.
On the other hand, the quickest way to get from one tip of the C to the other tip is to go straight from the one to the other, not to walk all the way around the circle following a path that goes through every single other point in the system.
Reducing a graph to a minimal spanning tree, gets you a single subgraph of the original grpah that has the least total distance. That, unfortunately, has nothing to do with telling you the fastest way to get from point A to point B traveling along the original graph.
hence minimal spanning tree != shortest path... -
How do you turn off cellular data on Ipad Air 2 with IOS 8.1.2
We have three new iPad Air 2s within the family. All have wi-fi capability but we are not needing to suscribe to it at this time, plan to use it on trips away from home. All of them get a popup message every 1-2 hours reminding to select a cellular plan. If it were only asking to select a cellular carrier I would understand, but when you do that it requires you to select a plan and add payment info for it. We are not ready to do that at this time. There is no "off" button on the cellular setting as there is on the iPhone. Is there a way to turn off the constant reminders to add a cellular plan?
There is no option to not sign up for the data plan. I just returned from the Apple Genius Bar and my genius said the only way to stop the message now is to remove the SIM card, but be sure to keep it in a safe place for when I want to activate Cellular. The change from the older iPads is that the pre-installed SIM is a generic one that will work with ATT, TMobile and Verizon. In the past you selected your carrier when you purchased the iPad and their dedicated SIM card was installed. I really dislike this solution, especially keeping up with the itsy bitsy SIM card and having it readily available when I need it. I did try a temporary solution mentioned in another thread to tell Siri to turn off Cellular Data. She will do it, but it resets when you reboot the iPad. That is preferable to me than removing and keeping up with the SIM card.
-
My system got crashed and I dont have backup fo my iphone.... now how do i synch my iphone with new itunes without loosing my data ?
See if this user-tip for syncing to a new computer helps : https://discussions.apple.com/docs/DOC-3141
If you have music from other sources on your phone (e.g. copied from CDs) and you don't have them on a backup, then there are some program listed half-way down this page which might be able to copy them back : https://discussions.apple.com/docs/DOC-3991 -
A relative synced my iphone with his laptop without me knowing. It had a passcode on the phone but the sync still worked. I have since found out he is quite IT knowledgeable and has been known to track other peoples phones that he wants to know information about. How is my data useful to him and can he restore this data on another iPhone and run it parallel to mine? I have had people send me messages which I have not received. These have been screen shot to me later including time and I have just not got them. I had 4 weeks worth of messages go missing from my phone..I know that he synced my phone because his work laptops I'd came up in my settings. Also if the above can be done can he change the settings on my actual phone and access my location without placing tracking software on my phone. Can someone please help here as I can't restore a backup to my phone for obvious reasons and refuse to change my number because of this loser.
Connect the device to the computer.
In iTunes, select the content desired to sync.
Sync.
This is all described in the User's Guide, reading it may be a good place to start. -
Hello impossible to start my computer blank creen with apple and circle always turning without stop
Question : need help imossible to strat my computer i Mac 27' (bought June 2011) OS X Lion always get blank screen with apple and circle always turning without stop
Reinstall Lion:
Reinstalling Lion
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. Alterhatively, 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.
Repair the Hard Drive and Permissions: Upon startup select Disk Utility from the main menu. Repair the Hard Drive and Permissions as follows.
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 click on the Repair Permissions button. Wait until the operation completes, then quit DU and return to the main menu.
Reinstall Lion: Select Reinstall Lion and click on the Continue button.
Note: You can also re-download the Lion installer by opening the App Store application. Hold down the OPTION key and click on the Purchases icon in the toolbar. You should now see an active Install button to the right of your Lion purchase entry. There are situations in which this will not work. For example, if you are already booted into the Lion you originally purchased with your Apple ID or if an instance of the Lion installer is located anywhere on your computer. -
Hi, I have a new laptop and would like to syncronise my iphone with iTunes (which I have installed again). But my old laptop has died so I could not transfer any media files, etc. Can I simply connect my iPhone to the laptop without any data being lost?
Many thanks in advance!you have a new phone and a new comp and you want to restore to your old data ?!
I can't think of anything but icloud, and what was purchased via itunes -
I'm using a 16GB iPhone 4S, with the latest version of iOS 8.1.1. Whenever I go to the "Cellular" settings on the main settings page and turn OFF cellular data usage for native apps like mail, app store, contacts, photos etc , the moment I back out and come back in, all the native apps I turned cellular off for are back on again. Kindly help me
Exact same question as ankit1986, specifically with the photos while on cellular-only, and as simple as it sounds, I tried the hard reboot Ingo2711 suggested. Still experiencing the same error with the native apps reverting to on. It's killing our shared data-plan (2GB).
Maybe you are looking for
-
How to pull multiple lines of info from a table for a Specific Company/Address
What I would like to do is have one Table that I enter all my information on in Numbers for incoming rent like the one below. Since I have 8 spaces to rent I will have up to 96 plus rows of information to look at. But I would like to have Numbers the
-
HT5622 Do we need to make a new Apple ID for every iPhone we have?
I seem to be getting family members conversations and also when I send a message it gets sent back to me in text message as well as go to who I sent to. Was just curious as to if we all made our own Apple ID if this would be corrected?
-
Implement Function module logic in BI
Hi all, the bellow is the DataSource FM code i wanted to implement same in the BI side, instead system date user wants to enter the date according to the user entry date the calculation should happen if t_tab-net_d < sy-datum. if t_bsid
-
Graphics update with OS X Leopard?
Does anyone know if apple plans on upgrading the MBP's ATI X1600 to something beefier with the OS release?
-
Anyone know what this theme is?
-- mod edit: read the Forum Etiquette and only post thumbnails http://wiki.archlinux.org/index.php/For - s_and_Code -- http://www.cacti.net/get_image.php?imag - 1095&y=972