Search Results

Search found 17260 results on 691 pages for 'folder tree'.

Page 23/691 | < Previous Page | 19 20 21 22 23 24 25 26 27 28 29 30  | Next Page >

• How to safely back up the "Private" folder?

  - by ImaginaryRobots

  I have an ecryptfs "Private" folder in my home directory, and it is set up to automatically mount whenever I log in. I want to set up automatic backups to a network drive, but I don't want the contents of Private to be readable on the remote server. My understanding is that the Ubuntu "Backup" utility would run while I'm logged in, so it would see the folder contents without encryption. I'm backing up from a laptop, so it is essentially only on when I am logged in. I know that the Private folder is essentially a mounted filesystem, so it seems like I should be able to backup the encrypted image rather than the cleartext contents. What steps are needed to safely back it up, while maintaining the encryption? Note that I'm already familiar with the backup tools available, this question is about dealing with the ecryptfs folder safely.

  Read the article

• Implementation of a distance matrix of a binary tree that is given in the adjacency-list representation

  - by Denise Giubilei

  Given this problem I need an O(n²) implementation of this algorithm: "Let v be an arbitrary leaf in a binary tree T, and w be the only vertex connected to v. If we remove v, we are left with a smaller tree T'. The distance between v and any vertex u in T' is 1 plus the distance between w and u." This is a problem and solution of a Manber's exercise (Exercise 5.12 from U. Manber, Algorithms: A Creative Approach, Addison-Wesley (1989).). The thing is that I can't deal properly with the adjacency-list representation so that the implementation of this algorithm results in a real O(n²) complexity. Any ideas of how the implementation should be? Thanks.

  Read the article

• How to access shared folder in Virtual Box

  - by alsadi90

  I followed the steps for sharing folders between windows 7 and Ubuntu in virtual box. but the folder appear with X sign and give me the following message when open it "the folder conent could not be displayed" and when choose "shared folder" from "Device" menu the following is written below "on the system page , you have asigned more than 50% of your computer's memory (2.93) to the virtual machine ...

  Read the article

• Terminal doesn't see Windows filesystem until I open in Home Folder GUI

  - by yeenow123

  I'm currently dual-booting Windows 7 and Ubuntu. When I try to access my Windows HD through the terminal I can't find it. However, I used the Home Folder application to see where those drives/folders were. And after I clicked into it in the Home Folder, I looked again at the same folder in the terminal and it appeared. Is there a reason for this and how can I set it so I always can see those folders?

  Read the article

• make a tree based on the key of each element in list.

  - by cocobear

  >>> s [{'000000': [['apple', 'pear']]}, {'100000': ['good', 'bad']}, {'200000': ['yeah', 'ogg']}, {'300000': [['foo', 'foo']]}, {'310000': [['#'], ['#']]}, {'320000': ['$', ['1']]}, {'321000': [['abc', 'abc']]}, {'322000': [['#'], ['#']]}, {'400000': [['yeah', 'baby']]}] >>> for i in s: ... print i ... {'000000': [['apple', 'pear']]} {'100000': ['good', 'bad']} {'200000': ['yeah', 'ogg']} {'300000': [['foo', 'foo']]} {'310000': [['#'], ['#']]} {'320000': ['$', ['1']]} {'321000': [['abc', 'abc']]} {'322000': [['#'], ['#']]} {'400000': [['yeah', 'baby']]} i want to make a tree based on the key of each element in list. result in logic will be: {'000000': [['apple', 'pear']]} {'100000': ['good', 'bad']} {'200000': ['yeah', 'ogg']} {'300000': [['foo', 'foo']]} {'310000': [['#'], ['#']]} {'320000': ['$', ['1']]} {'321000': [['abc', 'abc']]} {'322000': [['#'], ['#']]} {'400000': [['yeah', 'baby']]} perhaps a nested list can implement this or I need a tree type?

  Read the article

• Can't remove c:/ubuntu folder pleas help?

  - by user98978

  hi today i downloaded ubuntu with wubi-installer on my windows 7 machine but after restarting pc and booting in ubuntu installer my pc shuts down while installing because my laptops battery was gone empty i forgot to plug in my adapter so ubunutu fails to install, then i booted in windows 7 to uninstall ubuntu from add/remove programs en reainstall but the uninstaller did not fully remove the files i still have i folder in my c:/ubuntu when i double click on that folder my explorer.exe stops responding and than i need to open the task manager to kill the explorer.exe procces and restart it and right clicking does the same thing i cant do anyting with c:/ubuntu folder to reinstall ubuntu with wubi i have used unlocker1.9 to remove the folder but i get an error saying Error 0x8007045D: The request could not be performed because of an I/O device error HUH ! please help please :( EDIT: Okay i fixed my problem after following this instruction ! i don't understand why you people did not ask me to do this but it's okay i forgive you my poeple LoL !

  Read the article

• Fix folder scrolling problem in navigation pane of Explorer

  - by Marko Apfel

  Since my first steps with Win7 I hate the behavior of Explorer to scroll down the current expanded folder in the navigation pane. Today I found a solution in this thread: Bug: Windows Explorer expands folders inappropriately, jumping the folder you expand to the bottom of the navigation pane Download and install Classic Shell Activate the classic explorer bar and choose options Verify that “Fix folder scrolling” is checked Verify fixed behavior If necessary deinstall Classic Shell – the fix is persisted

  Read the article

• Problem in shared folder

  - by alsadi90

  I followed the steps for sharing folders between windows 7 and Ubuntu in virtual box. but the folder appear with X sign and give me the following message when open it "the folder conent could not be displayed" and when choose "shared folder" from "Device" menu the following is written below "on the system page , you have asigned more than 50% of your computer's memory (2.93) to the virtual machine ...

  Read the article

• What do I do with a Concrete Syntax Tree?

  - by Cap

  I'm using pyPEG to create a parse tree for a simple grammar. The tree is represented using lists and tuples. Here's an example: [('command', [('directives', [('directive', [('name', 'retrieve')]), ('directive', [('name', 'commit')])]), ('filename', [('name', 'f30502')])])] My question is what do I do with it at this point? I know a lot depends on what I am trying to do, but I haven't been able to find much about consuming/using parse trees, only creating them. Does anyone have any pointers to references I might use? Thanks for your help.

  Read the article

• Can I delete the folder "C:\WINDOWS\Installer\$PatchCache$" ?

  - by James

  This folder is taking up nearly a GB of my C partition. Is it possible to just delete it?

  Read the article

• Is there a Word field code for the folder path?

  - by Shevek

  In MS Word you can insert a field code to show the document file name with the option to include or not the full path. What I want is to only insert the folder path excluding the file name. Macros are not an option. Can this be done?

  Read the article

• Remove nesting "My Music" folder names in Windows 7.

  - by Brentley_11

  I was messing around with the Location tab in "properties" for "My Music" and ended up changing it a few times to directories on another drive. I quickly decided I didn't like the change and reverted it back. The My Music folder in my users directory is working fines but now my iTunes directory is labeled as "My Music" and the music directory within is called "My Music". Describing the issue simply: D:\iTunes\Music is labeled as Computer Local Disk(D:) My Music My Music Any suggestions on how to fix this would be appreciated.

  Read the article

• New folder doesn't appear in Finder

  - by rxt

  Many times I have the following problem. I create a new folder, but it doesn't appear in the Finder. Right now I have this problem with a folder created in Eclipse. After a while it appears, but I cannot tell when. I can see the folder in the terminal. A similar problem happens when I rename a folder or file. Then I have to move out of the parent folder, open another folder, go back, and most of the time it's there. (Finally the new folder appeared after creating another folder in the finder itself.) I'm using 10.8 Mountain Lion now, but this is not a problem of this release. I have this problem for several years now. Maybe I'm the only one with this problem? Is there a way to get this working normally?

  Read the article

• how to make a folder for the files placed in listview in c#.net ?

  - by zoya

  whats the procedure to send the files placed in a listview to a folder.. that is... i need to place all the files in the listview to a folder on button click event.. on button click it should make a folder for all the files in the list view and send them in.. im using winforms in c#.net

  Read the article

• Is there a standard Mac OS X Snow Leopard home folder naming convention?

  - by JGFMK

  I recently re-installed a fresh copy of Snow Leopard on my Mac. I was a bit surprised when the process completed it had changed the name of my home folder to use my name rather than my initials. This messed up all the paths in my Eclipse IDE workspace. I vaguely remember being asked if I use it for home or business use and wondered if something I did there has a bearing on the way the default name is assigned. Does anyone have more information on this? Links too official Apple install etc. Cheers.

  Read the article

• I can't uncheck the "read-only" attribute from a folder on a Windows Server 2008 machine.

  - by Andrei

  Hello everybody. I have a folder (C:\temp) on a windows server 2008 R2 installation. Initially it has the Read Only attribute checked, but I want to uncheck it. I am able to uncheck it and it even shows me the loading process (it is showing me that it is going through all the subfolders), but after I press OK and I go back to properties, it still remains checked as Read Only. Hope someone has an idea. Thanks. edit: I tried this one, but it doesn't seem to work: http://support.microsoft.com/kb/256614

  Read the article

• Why don't they clean up the Windows folder? [on hold]

  - by NeoLegends

  To me, that thing seems like an utter mess, at least most parts. Some are pretty organized (.NET and GAC-Folders), but most of the others (System32) are not. Wouldn't it improve the general developer productivity if they cleaned it all up? In general - I don't know why they didn't stop that folder becoming a huge mess, and why they don't take any efforts to reduce it. (Win 8 Settings App sits in System32 while Store sits in Root directory, iirc) FHS isn't perfect, but it's far better than that...

  Read the article

• minimax depth first search game tree

  - by Arvind

  Hi I want to build a game tree for nine men's morris game. I want to apply minimax algorithm on the tree for doing node evaluations. Minimax uses DFS to evaluate nodes. So should I build the tree first upto a given depth and then apply minimax or can the process of building the tree and evaluation occur together in recursive minimax DFS? Thank you Arvind

  Read the article

• How do you display a binary search tree?

  - by fakeit

  I'm being asked to display a binary search tree in sorted order. The nodes of the tree contain strings. I'm not exactly sure what the best way is to attack this problem. Should I be traversing the tree and displaying as I go? Should I flatten the tree into an array and then use a sorting algorithm before I display? I'm not looking for the actual code, just a guide where to go next.

  Read the article

• Maintaing list order in binary tree.

  - by TheBigO

  Given a sequence of numbers, I want to insert the numbers into a balanced binary tree such that when I do a preorder traversal on the tree, it gives me the sequence back. How can I construct the insert method corresponding to this requirement? Remember that the tree must be balanced, so there isn't a completely trivial solution. I was trying to do this with a modified version of an AVL tree, but I'm not sure if this can work out.

  Read the article

• Convert a post-order binary tree traversal index to an level-order (breadth-first) index

  - by strfry

  Assuming a complete binary tree, each node can be adressed with the position it appears in a given tree traversal algorithm. For example, the node indices of a simple complete tree with height 3 would look like this: breadth first (aka level-order): 0 / \ 1 2 / \ / \ 3 4 5 6 post-order dept first: 6 / \ 2 5 / \ / \ 0 1 3 4 The height of the tree and an index in the post-order traversal is given. How can i calculate the breadth first index from this information?

  Read the article

• Cladogram, tree of life, cladistics, taxonomy in JS or canvas?

  - by boblet

  Good people - I need some help to find a way to create an interactive cladogram or phylogenetic tree (yes, I have read all related posts, and do not find what I am looking for). The thing is, I need the nodes to be name-able. An example would be something like this Most scripts I find are either applets, flash, or simply do not show the node classification, ie it would skip "feliformia" in this example. This is useless to me, as I would then end up with carnivore - anonymous node - anonymous node - anonymous node - tiger, and that is not good. This tree will in theory cover all life, so it could get rather large, and get links and names in english and latin from database. So: no flash, no applets. It must be horizontal, no supertrees (circular). I have gone through this http://bioinfo.unice.fr/biodiv/Tree_editors.html but most of them seems to be either old, not displaying sub-node levels, applets, or way too complex. I imagine this would be a delightful job for canvas/jQuery..? And chances are, someone got there before me? Any pointers much appreciated. Note: if anyone out there would like to do something like this as a project, I will be happy to help, even though it would not benefit me for this project.This type of taxonomy is not as simple as it may seem, and I would be happy see this happen.

  Read the article

• How can you get the call tree with python profilers?

  - by Oliver

  I used to use a nice Apple profiler that is built into the System Monitor application. As long as your C++ code was compiled with debug information, you could sample your running application and it would print out an indented tree telling you what percent of the parent function's time was spent in this function (and the body vs. other function calls). For instance, if main called function_1 and function_2, function_2 calls function_3, and then main calls function_3: main (100%, 1% in function body): function_1 (9%, 9% in function body): function_2 (90%, 85% in function body): function_3 (100%, 100% in function body) function_3 (1%, 1% in function body) I would see this and think, "Something is taking a long time in the code in the body of function_2. If I want my program to be faster, that's where I should start." Does anyone know how I can most easily get this exact profiling output for a python program? I've seen people say to do this: import cProfile, pstats prof = cProfile.Profile() prof = prof.runctx("real_main(argv)", globals(), locals()) stats = pstats.Stats(prof) stats.sort_stats("time") # Or cumulative stats.print_stats(80) # 80 = how many to print but it's quite messy compared to that elegant call tree. Please let me know if you can easily do this, it would help quite a bit. Cheers!

  Read the article

• A data structure based on the R-Tree: creating new child nodes when a node is full, but what if I ha

  - by Tom

  I realize my title is not very clear, but I am having trouble thinking of a better one. If anyone wants to correct it, please do. I'm developing a data structure for my 2 dimensional game with an infinite universe. The data structure is based on a simple (!) node/leaf system, like the R-Tree. This is the basic concept: you set howmany childs you want a node (a container) to have maximum. If you want to add a leaf, but the node the leaf should be in is full, then it will create a new set of nodes within this node and move all current leafs to their new (more exact) node. This way, very populated areas will have a lot more subdivisions than a very big but rarely visited area. This works for normal objects. The only problem arises when I have more than maxChildsPerNode objects with the exact same X,Y location: because the node is full, it will create more exact subnodes, but the old leafs will all be put in the exact same node again because they have the exact same position -- resulting in an infinite loop of creating more nodes and more nodes. So, what should I do when I want to add more leafs than maxChildsPerNode with the exact same position to my tree? PS. if I failed to explain my problem, please tell me, so I can try to improve the explanation.

  Read the article

• Windows7 shows a drive as full in summary but files, including backup folder, shown on drive are ver

  - by Rob

  I have a drive partitioned so it is seen by Windows as 2 drives: C:\ and D:\ Windows7 shows D:\ as full up in the graphical summary in 'My Computer' summary of all the drives, e.g. the bar graph indicates full and nearly all of the drive's capacity, 108Gb, is full. So I go into the D:\ drive to look at the files, I see several folders. I select them all and the right click menu Properties to count their size, expecting the value to be about the same as what Windows reports in the summary, i.e. nearly 108Gb. But the properties shows the files are very small, Kbs and Mbs, nowhere near 108Gbs. One of the folders is a backup, but its size is very small. I've checked the folder options to show all system files and hidden files too - and counted these in the properties. Something invisible is holding the space. What is happening here? I'm afraid to delete anything if it removes valuable backups. Have I got huge backups here? Why can't I see them? How do I see them?

  Read the article

< Previous Page | 19 20 21 22 23 24 25 26 27 28 29 30  | Next Page >