Start application in certain Ubuntu workspace
How to automatically start programs in specific workspaces on start up
Why is the potential energy equal to the negative integral of a force? I don't know so much about coordinate systems...  In my office we use to deal with spatial data coming from archaeological sites. Each site has its own x-y-z coordinate system (GCS). Three simple ortogonal cartesian axis. In the last years we have been managing this spatial data through GIS software (ArcGIS), without using specific coordinate system (just leave it as "undefined")  I'd like to know if there exisits any GCS designed to deal with such datasets using simple cartesian orthogonal axis, without grid distortions of the typical GCS. In addition, I'd like to know if this system is suitable for using it in an online mapping application.  By the way, we manage 2D (ArcMap) and 3D (ArcScene) environments and work with "mm" as length base unit.   If such a thing doesn't exists, maybe someone knows how to create it. Switch command output language from native language to english Combinatorial proof of an identity with squared binomial coefficients Is it true that $\sum_kk\binom{n}{k}^2=n\binom{2n-1}{n-1}$? (I proved it using generating functions). Could you help me to prove it combinatorially? please ́╗┐' is not recognized as an internal or external command When executing certain files (mainly batch) using PsExec I get these weird ́╗┐' symbols before my command. My initial thought was, that I were using wrong encoding, but after checking, I realized that all my files were using UTF-8. Editing and manipulating tables with ArcPy? I’m new to ArcMap and was wondering if anybody could help me out. I have a shapefile with counties and wells in that county. In the table I’m trying edit it so that for each county calculate the total numbers of wells that fall into that county, and update the county table with the total count. I also want to calculate how many wells there are per area unit, and update the table with that value as well.  import arcpy featureClass = "C:/Lesson5_Data/Colorado_cities.shp" fieldList = "*"  with arcpy.da.SearchCursor(featureClass, fieldList) as cursor: for row in cursor: print row[4  population = 10000  whereClause = '"POP2007" &gt;= ' + str(population Pointwise convergent and total variation I'm preparing for a test for real analysis and I came across this problem in Royden's book:  Let $\{f_n\}$ be a sequence of real valued functions on $[a,b]$ that converges pointwisely on $[a,b]$ to the real valued function $f$. Show that $TV(f) \leq \liminf  ~TV(f_n)?$  This looks quite similar in form to Fatou's Lemma to me, but can't find any way to establish TV with integration, can anybody please help?  (TV is short for total variation) I use tikz (and tikzpicture) a fair bit, but files that used to compile fine before the latest slew of updates to pgf, and pstricks, no longer seem to do so (at least, on my MikTeX installation). The MWE (below) seems to compile correctly, but the DVI can't be rendered using yap, and dvi -> ps -> pdf fails (the dvi -> ps seems to be ok -- to the extent it isn't throwing errors), but ps2pdf fails miserably, with the following errors:   Error: /undefined in XC@.  Operand stack:    --nostringval--   --nostringval--   --nostringval--   --nostringval--   -  -nostringval--   --nostringval-- Execution stack: %interp_exit   .runexec2   --nostringval--   --nostringval--   --  nostringval--   2   %stopped_push   --nostringval--   --nostringval--   --  nostringval--   false   1   %stopped_push   2045   1   3   %oparray_pop    2044   1   3   %oparray_pop   2025   1   3   %oparray_pop   1884   1   3    %oparray_pop   --nostringval--   %errorexec_pop   .runexec2   --nostringval-  -   --nostringval--   --nostringval--   2   %stopped_push   --nostringval-- Dictionary stack:   --dict:979/1684(ro)(G)--   --dict:1/20(G)--   --dict:87/200(L)--   --    dict:182/300(L)--   --dict:58/200(L)--   Current allocation mode is local   Current file position is 99615   GPL Ghostscript 9.26: Unrecoverable error, exit code 1   Here is the MWE:  \documentclass[12pt,letterpaper,oneside]{article}  \usepackage{tikz}  \usetikzlibrary{decorations,shapes,arrows,matrix,positioning}  \begin{document}  \begin{center} \begin{tikzpicture}[x=0.175cm,y=0.175cm,scale=1]  % set up maximum and minimum x- and y-coordinates \def\xmin{0} \def\xmax{23.5} \def\ymin{0} \def\ymax{23.5}  % draw and label axes    \draw[-&gt;,thick] (\xmin,0) -- (\xmax,0) node[below=8pt,near end]  {\small{abundance ($N$)}};   \draw[-&gt;,thick] (0,\ymin) -- (0,\ymax) node[above=12pt,near   start,rotate=90] { \small{birth rate ($b$)}};  % draw vertical reference line at K/2=50   \draw[color=black, thick,  smooth] (0,20) -- (20,0)  node[below=6pt,midway,rotate=-45] {\small{slope~$=a$}};  % draw circle around point where function intersects x-axis \draw [red] (0,20)  ellipse (0.2cm and 0.2cm) node[right=3pt,black] {$b_0$};   \end{tikzpicture}  \end{center}   \end{document} Elegantly determine if more than one boolean is "true" Record Animation In BGE I am having trouble getting the Record Animation setting to work in the BGE. Is it possible to record animated characters that are controlled using BGE's logic bricks with some script? In my script I change the positions of the characters bones. How do I find out what tool a shortcut is triggering? I used to have problem with connecting two objects, because when I smooth the final object, there was a darker line on the connected parts (for example when I was making head, I've had eyes darker this way). Then I found out that I can get rid of it by hitting Ctrl+N, but I don't realy know what it does. I can just see that the lines are gone. So, what does Ctrl+N do? where does lspci gather its information from? In  I found "[The   latest   version    of   this   document   ". There I says: "… lspci is a synonym for cat /proc/pci".  Which isn't the case here, on a Crunchbang 10 system (Debian based). No such directory. I do get the basic idea and, as far as I  know, the content of proc is (mainly) created during runtime. (Wrong?). This made me curious:  Question: Where does lspci gather it's information from? And where is this documented? (Where did I miss something?)  &nbsp; Another difference I found: In kernel.org's documentation, under "Table 1-5: Kernel info in /proc"      pci &nbsp;&nbsp;&nbsp; Deprecated info of PCI bus (new way -> /proc/bus/pci/, decoupled by `lspci) My Mac Book Pro 13.-" doesn´t get past the grey booting screen with the apple and the spinning wheel (The loading bar appears but when it´s done nothing happens)   I have 220 GB in one single Partition (Macintosh HD) and there is all my work my music and the only copy of ALL MY PHOTOS. I´m so stupid I don´t have a backup of anything but know I have an external HD with 300GB space. I would like to repair my HDD but more important I need to save my files but I don´t know how to do it in Disk Utility Mode. I read there is a Diskwarrior but I don´t know how to install it without booting the mac. Please help!!!  When I start on Single User mode and enter /sbin/fsck -fs this appears  Executing fsck_hfs (version diskdev_cmds-557-393)  Checking Journaled HFS Plus volume.  The volume name is Macintosh HD  Checking extents overflow file.  Checking catalog file  Incorrect number of thread records  (4, 23745)  Checking multi-linked files.  Checking catalog hierarchy  Invalid volume directory count (It should be 175703 instead of 175701) Checking extended attributes file.  Incorrect number of extended attributes (It should be 340062 instead of 340064)  Checking volume bitmap.  Checking volume information.  The volume Macintosh HD could not be repaired after 3 attempts.  *****The volume was modified *****   What are the next steps if fsck fails to repair a drive? Problem: James has a pile of n stones for some positive integer n ≥ 2. At each step, he   chooses one pile of stones and splits it into two smaller piles and writes the product   of the new pile sizes on the board. He repeats this process until every pile is exactly   one stone.      For example, if James has n = 12 stones, he could split that pile into a pile of size   4 and another pile of size 8. James would then write the number 4 · 8 = 32 on the   board. He then decides to split the pile of 4 stones into a pile with 1 stone and a   pile with 3 stones and writes 1 · 3 = 3 on the board. He continues this way until he   has 12 piles with one stone each.      Prove that no matter how James splits the piles (starting with a single pile of n   stones), the sum of the numbers on the blackboard at the end of the procedure is   always the same.   Hint: First figure out what the formula for the final sum will be. Then prove it using strong induction.  The formula I came up with is $n(n-1) / $2. It could be totally wrong...  My (Partial) Solution:  1) Base Case: (n=2) James has one pile of 2 stones. Suppose he takes the top-most stone and puts in one pile A, which now has size 1. He takes the remaining stone and places it into another pile B, which now has size 1. Then the product of the sizes is 1. The sum of all the products on his board is 1. Now, if he were to start again, and take the bottom stone first and put it in pile A, he has a pile of size 1, and then takes the top stone and puts it in pile B, he has a pile of size 1, and the product is 1, with sum of all products on the board is 1.   2) Inductive Hypothesis (Strong Induction): Suppose for some $k \geq 2$, $n$ stones can be split in $ 2 \leq n \leq k $ stones and $k-n$ stones.  3) Inductive Step:  Consider $n=k+1$. What do I do now? Parse error in sudoers file I use the term "100% crop" to mean a portion of a picture that has been cropped but not resized, but I have also seen some confusion around that term.   Is there an accepted definition for "100% crop?" What is its opposite called?   Here's what I think it means:   If I'm right, what is the proper name for "something else?" If I'm wrong, please include illustrations.  Either way, what evidence supports the definitions? Merge two arrays as key value pairs in PHP I've got two arrays of the same size.  I'd like to merge the two so the values of one are the key indexes of the new array, and the values of the new array are the values of the other.  Right now I'm just looping through the arrays and creating the new array manually, but I have a feeling there is a much more elegant way to go about this.  I don't see any array functions for this purpose, but maybe I missed something?  Is there a simple way to this along these lines?  $mapped_array = mapkeys($array_with_keys, $array_with_values); Why the names Type 1, 2 error? Don't heavier objects actually fall faster because they exert their own gravity? GNU find and masking the {} for some shells - which?