Convert images from JPGS to PDFS with the terminal
How can I convert JPG into PDF easily?
My MATLAB launcher doesn't work I've installed MATLAB R2011a on Ubuntu 11.10 today following . I've also followed the steps to create the launcher. It appeared, but when I click on it nothing happens. Does anyone knows what can I do to fix it? Additional info I can run it perfectly through terminal. My only problem is getting the launcher to work. To create the launcher I used :   Get an icon:  sudo wget http://upload.wikimedia.org/wikipedia/commons/2/21/Matlab_Logo.png -O /usr/share/icons/matlab.png   Get the launcher file:  sudo wget 'https://help.ubuntu.com/community/MATLAB?action=AttachFile&amp;do=get&amp;target=matlab-r2011a.desktop' -O /usr/share/applications/matlab.desktop In HLW8012 where should I connect the reference voltage (GND) In the , the both 33nF capacitors , 1K resistor and 0.1uF capacitor are connected to GND. I'm not sure where should I connect those ends of components marked with GND symbol, (To Live, To Natural or the DC GND). I can't read Chinese, I don't really know what everything mean there.  Live directly connects to the shunt resistor and this means that live is also GND (0 volt reference) for the chip? Should I connect those end of components marked as GND symbol to Live wire? Windows 10 100% Disk Usage after Startup After startup for 5 minutes my system is very slow. The Task Manager shows that the disk usage is at 100%. (Later this number is around 2-4 %, but sometimes for 1-2 minutes go up again at 100%.)  I searched a lot on Google. For example I read , and also other pages. I opened two topic on Microsoft answer.  and one in Hungarian.  But I didn't found the solution yet. So I would like to ask Community's help. :)  Here the steps I already done:   I disabled everything at startups (including services) and the issue is the same.  I disabled Prefetch and Superfetch, the Baground Intellingent Transmission, Windows Search and Windows Defender but the issue is still persists. I made a health check on HDD, I made defrag and file system error check, but there are no errors. Also I tried to reinstall the HDD's driver. I made a full hardware check up, with no errors. The Windows and all the drivers are up-to-date. I tried a clean start. The issue is the same. I deleted Dropbox and all antivirus. I turned of the MSI mode.      I using also Linux, where this error is not occurs. Good to know, that Windows had 4 partitions, but I deleted 2 of them for the Linux. I don't know what partitions was these but both was only 10 - 20 MB.  I using a Dell Inspiron 15R SE 7520 with Windows 10 Home.  Personally I think it can be the Intel Rapid Store Technology "driver", because the problem started around when I installed it. (However I'm not sure.) And my hardware not supported yet by Intel, so I have no the newest driver. However I deleted Intel's software and driver and the issue is the same.    Thank you in advance for your assistance! I am looking for a reference which has a self-contained (elementary, that is, at the "undergraduate algebra level") proof of the the fact that any one-dimensional Noetherian UFD is a PID. Does anyone know such a reference?   (Note: I have looked at the similar questions on this website but don't find them particularly useful). Could we please be a bit nicer to new users? There is a distinct decline in the level of civility on all the sites here.  Some of this is due to new users coming in and posting spam and other nonsense, but the off-topic and downvote buttons are doing a pretty good job of keeping this under control. Unfortunately, a lot of this is coming from more experienced users, and the site's built-in moderation system does not (and probably cannot) handle this very well.  Folks are rushing to pound new users down with &quot;this belongs on meta!&quot;, &quot;this is off topic&quot;, &quot;this is a duplicate!&quot; and &quot;read the Help!&quot;. (Which is correct, but should be done nicer) All this, of course, is accompanied by a flurry of downvotes.  This is not very welcoming to new users who don't know about meta, the Help, or what counts as off-topic. Now I am not proposing that we just allow off-topic, meta, or duplicate questions.  However, I think we could be gentler in the way we express these sorts of things.  Explain what meta and the FAQ are and provide useful links.  Just using please and thank-you when asking folks to read the FAQ or post something on meta would be an improvement.  I also think we could rein in the downvoting a bit.  Not that we shouldn't vote stuff down, but unless a new user's post is clearly spam, voting it down to -1 or -2 should be sufficient to send a message without piling on. I like Stack Exchange and I want it to become a resource for everyone, not just an elitist site for high-rep users on the sites. How do I change a close vote to a duplicate? Voted to close a question based on "lack of minimal understanding".  Later realized the question was a duplicate.  How to I change vote to mark as duplicate instead? Get date for monday and friday for the current week (PHP) Importing Nodes to D7 with all custom fields I've got a Drupal site with an obscene about of content that has been given to me in CSV format. I'm toying with the idea of building a module to let me do this but if there's one already out there that I can use to just get this site out of the way that would be awesome.  My question is: Is there anything out there that allows you to import a CSV file into D7 that will populate the node table and all the custom fields tables as well?  Thanks. Ratio test and the Root test Similar to this question posted in August 2014:       Has the fact that  (as  in The Fires of Pompeii, and  in Torchwood’s Children of Earth season) yet been addressed/explained either in, or out of universe? What is the significance of a mostly blank user card? T-Shirt print resolution Is there any way I can separate a List&lt;SomeObject&gt; into several separate lists of SomeObject, using the item index as the delimiter of each split?  Let me exemplify:  I have a List&lt;SomeObject&gt; and I need a List&lt;List&lt;SomeObject&gt;&gt; or List&lt;SomeObject&gt;[], so that each of these resulting lists will contain a group of 3 items of the original list (sequentially).  eg.:   Original List: [a, g, e, w, p, s, q, f, x, y, i, m, c] Resulting lists: [a, g, e], [w, p, s], [q, f, x], [y, i, m], [c]   I'd also need the resulting lists size to be a parameter of this function. When I type "[singular noun] and [singular noun]" in Word 2010, I find some interesting things.        Bread and butter is essential. (the auto-correction warns me of subject-verb disagreement.)   Bread and butter are essential. (OK)   A knife and fork is on the table. (OK)   A knife and fork are on the table. (OK)   The needle and thread is new. (OK)   The needle and thread are new. (OK)   Cost and revenue is directly linked. (OK)   Cost and revenue are directly linked. (OK)      I wonder how a native speaker would consider this phenomenon. How do I efficiently get "the most recent corresponding row"? I have a query pattern that must be very common, but I don't know how to write an efficient query for it.  I want to look up the rows of a table that correspond to "the most recent date not after" the rows of another table.  I have a table, inventory say, which represents the inventory I hold on a certain day.  date       | good | quantity ------------------------------ 2013-08-09 | egg  | 5 2013-08-09 | pear | 7 2013-08-02 | egg  | 1 2013-08-02 | pear | 2   and a table, "price" say, which holds the price of a good on a given day  date       | good | price -------------------------- 2013-08-07 | egg  | 120 2013-08-06 | pear | 200 2013-08-01 | egg  | 110 2013-07-30 | pear | 220   How can I efficiently get the "most recent" price for each row of the inventory table, i.e.  date       | pricing date | good | quantity | price ---------------------------------------------------- 2013-08-09 | 2013-08-07   | egg  | 5        | 120 2013-08-09 | 2013-08-06   | pear | 7        | 200 2013-08-02 | 2013-08-01   | egg  | 1        | 110 2013-08-02 | 2013-07-30   | pear | 2        | 220   I know one way of doing this:  select inventory.date, max(price.date) as pricing_date, good from inventory, price where inventory.date &gt;= price.date and inventory.good = price.good group by inventory.date, good   and then join this query again to inventory. For large tables even doing the first query (without joining again to inventory) is very slow.  However, the same problem is quickly solved if I simply use my programming language to issue one max(price.date) ... where price.date &lt;= date_of_interest ... order by price.date desc limit 1 query for each date_of_interest from the inventory table, so I know there is no computational impediment.  I would, however, prefer to solve the whole problem with a single SQL query, because it would allow me to do further SQL processing on the result of the query.  Is there a standard way to do this efficiently? It feels like it must come up often and that there should be a way to write a fast query for it.  I'm using Postgres, but an SQL-generic answer would be appreciated. The  specifically says not to ask  for career advice but people do it anyway.  Should I consider the Help Center outdated or only loosely enforced?    And what about a career advice site on the network?  There are 70+ sites, and most of them are for relatively narrow interests (which is not a criticism, I enjoy looking through the many sections).  A career section seems like it would be very popular.  Also, a careers section would help keep career questions off the other sites. I have tried some of the solutions posted elsewhere in the support forum, one seemed like it worked but after a steam update i found myself back at square one  I am a new Linux user and am already at a learning curve :)  Thanks for any help  Reading package lists... Done Building dependency tree        Reading state information... Done Some packages could not be installed. This may mean that you have requested an impossible situation or if you are using the unstable distribution that some required packages have not yet been created or been moved out of Incoming. The following information may help to resolve the situation:  The following packages have unmet dependencies:  libgl1-mesa-glx:i386 : Depends: libglapi-mesa:i386 (= 10.1.3-0ubuntu0.3)  unity-control-center : Depends: libcheese-gtk23 (&gt;= 3.4.0) but it is not going to be installed                         Depends: libcheese7 (&gt;= 3.0.1) but it is not going to be installed E: Error, pkgProblemResolver::Resolve generated breaks, this may be caused by held packages. Press return to continue: BootChamp no longer works on El Capitan, what's the fastest way to boot into Windows? Contraction mapping in the context of $f(x_n)=x_{n+1}$. I'm interested in convergence of $f(x_n)=x_{n+1}$ and often hear this term referenced.  What does it mean to be a contraction mapping in the context of the sequence of real numbers given by $f(x_n)=x_{n+1}$? And what does it tell us about such sequence?  A search online gives the answer given by Wikipedia, that it is a function $f$ defined on a metric space $(M,d)$ from $M$ to itself with the property that for some real number $k \in [0,1)$,  $$d(f(x),f(y)) \leq k d(x,y)$$  This definition is quite unhelpful because I barely know what a metric space is. I feel like this definition is to generalized, and I'm interested in in the specific case of recursively defined real sequences $f(x_n)=x_{n+1}$ that there should be a more specific answer to my question. How are multiple volunteers handled during the Reaping? While skimming through the first few chapters of The Hunger Games to answer another question, I noticed this sentence when Katniss is describing the rules surrounding volunteers after Prim's name is called (at the beginning of the second chapter):     In some districts, in which winning the reaping is such a great honor, people are eager to risk their lives, the volunteering is complicated.   The only reason I can see for volunteering being complicated is if there's more than one volunteer for a particular year, and I don't recall this ever being addressed in the books.  Is there anything in the books that I've missed or any reliable, external sources (interviews or other supplementary material by the author) that explain exactly how this situation is resolved?