The brightness function keys on my Asus laptop don't work on Ubuntu. The function key combinations for sound volume (Fn+F12/F11/F10) and turning the screen on and off (Fn+F7), but not those that should adjust the brightness (Fn+F6/F5)...  After some, I tried , but it still doesn't work.  I tried  but again no success.  What else can I try?

The brightness shortcuts via fn key don't work.  I tried each solution from . After editing /etc/default/grub file I rebooted.  GRUB_CMDLINE_LINUX="acpi_osi=Linux" GRUB_CMDLINE_LINUX="acpi_backlight=vendor" GRUB_CMDLINE_LINUX="acpi_osi=linux acpi_backlight=vendor" GRUB_CMDLINE_LINUX="acpi_osi_Linux"   What other workarounds/solutions are there?  Relevant output:  $ sudo lshw -C display   *-display UNCLAIMED             description: 3D controller        product: GK107M [GeForce GT 750M]        vendor: NVIDIA Corporation        physical id: 0        bus info: pci@0000:01:00.0        version: a1        width: 64 bits        clock: 33MHz        capabilities: pm msi pciexpress bus_master cap_list        configuration: latency=0        resources: memory:f6000000-f6ffffff memory:e0000000-efffffff memory:f0000000-f1ffffff ioport:e000(size=128) memory:f7000000-f707ffff   *-display        description: VGA compatible controller        product: 4th Gen Core Processor Integrated Graphics Controller        vendor: Intel Corporation        physical id: 2        bus info: pci@0000:00:02.0        version: 06        width: 64 bits        clock: 33MHz        capabilities: msi pm vga_controller bus_master cap_list rom        configuration: driver=i915 latency=0        resources: irq:50 memory:f7400000-f77fffff memory:d0000000-dfffffff ioport:f000(size=64)


It used to be that when a question was flagged for closing, if the question was closed, the flag was automatically marked as "helpful." Since the recent closing overhaul, I have seen at least a couple questions that I have flagged get closed, without any action taken on the flag. Is this the intended behavior?  I am tagging this as a bug because I do not remember seeing any discussion of this behavior changing.  Example:  I flagged  for closing on Islam.SE. Nobody acted on my flag for a few hours. I mentioned it to one of the mods in chat, and he said that he never saw my flag, but after I linked to the question, he closed it. Currently, though, the flag still seems to be open in my list of flagged posts. The mod says that, as far as he can tell, nobody has taken action on the flag.

While handling flags over the past few days, I've noticed something odd. It seems that when closing a question from the queue using the queue's "Close Question" button, the flag is not marked as handled.  I have noticed this in a couple circumstances. First, by questions I have put on-hold myself; when reloading the queue, or refreshing the question's page, I still see the flags there. Also, I have seen flags requesting closing, and seen that another mod has viewed and closed the question, yet the flag remains.  The only other automatic-handling situation was for deleting posts; this seems still to mark the flag(s) as handled as before; it seems only to be Closing which has this trouble.    Per the comments and further information, it seems this only applies when the post has had a Custom flag on it. That makes sense, and I'll be testing it (for example, on one with only a close flag).  In the meantime, I'll note that if intended, the UI could use some improvement there, as the way is works now once we close the question, it's not apparent that the flag(s) are still present.    Just confirmed with a Low Quality flag that when closing from the Mod Queue, the flag is indeed cleared.


I am a first-timer trying to prepare to host my first D&D night as DM with a bunch of curious friends (also first-timers in roleplaying).  I got the Starter Set so I'll be trying to play the Lost Mine of Phandelver campaign. After reading the Starter Set Rulebook and the first chapter of the campaign book, I find myself wondering about turns and time.  Are there still turns between encounters inside a dungeon? Are the player characters limited by their speed while moving in the dungeon out of combat?

In most circumstances, it is easy to determine when turn based combat ends:   One side is completely killed, unconscious or has fled All parties declared truce   But when in a hostile area, like a Dungeon, do you end turn based action after each chamber with an encounter or do you stay in it for the whole crawl?  This is relevant because there are various effects in the game where you gain a bonus each time you roll initiative or depending on whether an enemy already acted.  As an example:  When you are in a dungeon or building completely filled with enemies and the PCs just cleared a room from enemies, but they don't know whether there are enemies in the next room and if there are whether they have noticed the sounds of battle.  Do you keep them in round based action, because maybe the door opens and enemies enter? Or do you leave it and possible give away that there is no nearby danger or have to reroll initiative when enemies enter the room (and give them the corresponding bonuses).


I was thinking "What is before addition", and came up with this. This analogy describes it: Addition is to multiplication as [operation] is to addition. On  it says it is just "1+b". I came up with an alterantive; the symbol that I'll use for it will be $@$.  $b@b=b+2$  $b@b@b=b+3$  $b@b@b@b=b+4$...  For example:  $3@3=5$  If you try to compute it you run into problems. For example:  $3@2=(0@0@0)@(0@0)$ but it also equals $(-1@-1@-1@-1)@(-1@-1@-1)$  $(0@0@0)@(0@0)=(-1@-1@-1@-1)@(-1@-1@-1)$  $0@0@0@0@0=-1@-1@-1@-1@-1@-1@-1$  $0+5=-1+7$  $5\neq6$  So, you can't take away or add parentheses.  1)Is this new?  2)How do you compute it?

I had a difficult time in phrasing my question. But I was wondering if there is an operation that, when repeated n times, results in the addition operator. Same way as repeating addition n times results in the multiplication operator, and repeating multiplication n times results in the exponentiation operator etc.  So $n$ times addition of a number $x$ results in $x\times n$.  And $n$ times multiplication of a number $x$ results in $x^n$  Then my question is $n$ times ...what... results into the number $x+n$.  Let's call this operator: $@$.  For example, the following would then hold:  $$a\times a=a^2$$  $$a+a=a\times 2$$  $$a@a=a+2$$  My question is, does it make any sense thinking of such an operator, is there anything known about it, can it be followed through even further like $a\sim a = a@2$?


Which one of these sounds correct (American English)? Is there a better way of saying this?    I was not sober enough for you not to notice I'd been drinking. I was not sober enough for you to not notice I'd been drinking.

Mark's generosity in this crisis seems to more than make up for his earlier stinginess.   Should those sentences always be avoided, or are there cases where they are valid?


What is the term for replacing a letter with a number in a word, such as UNREAL being written as UNR34L?  Quite often seen on licence plates, it is almost satirical misspelling, but the definition of that does not seem to include substitution of letters for numbers.

Sometimes, more in some languages than in others, a word is spelled using one or more numbers instead of letters. Is there a term for this?  The only example I can think of in English is se7en (seven).   Therefore,     The number se7en was not spelled entirely with letters; it was written in   ______.


I want to evaluate $$\int _0^1\frac{\ln ^2\left(x\right)\ln \left(1-x\right)\ln \left(1+x\right)}{x}\:dx$$ I tried integration by parts and shape it in a way that i could expand either $\ln$ terms. $$-\int _0^1\frac{\ln ^3\left(x\right)\ln \left(1-x\right)}{1+x}dx+\int _0^1\frac{\ln ^3\left(x\right)\ln \left(1+x\right)}{1-x}\:dx$$ After this i tried expand the terms but i still couldnt go through, any different approaches are welcome.


I can log into a box via ssh using an ssh key, passwordless.  I have set my password using sudo passwd myusername and I get the success message passwd: password updated successfully.  When I try to log into the GUI console using that password I get two beeps (sounds like a failure tone I think) and it just goes back to the list of users.  Are there some tricks that might be disallowing my user from logging on via the console? How would I even debug the issue? I don't see anything obvious in dmesg.

My Ubuntu is stuck in a login loop when trying to enter my desktop. When I login, the screen gets black and soon after that the login screen comes back.   I've read that the problem might be caused by an error depending on the graphics, here's my graphics card: ATI Radeon 7670M


I use OS X and have Xcode 11.2. I tried to push an app to TestFlight and got a warning that I needed to upgrade to Xcode 11.2.1. Every time that I've upgraded Xcode in the past, I went to the Updates tab in the App Store, and downloaded the version there if there were any.  Right now there's no version 11.2.1 in the App Store.  What I Want To Know:  1) If 11.2.1 exists, why isn't it in the Updates tab of the App Store? Is it only new major and minor versions, and not patch versions, that show up there?  2) What's the best way to get version 11.2.1?

I am aware there are more questions with the same title, but I couldn't find any other post with this specific case.  I have Xcode 7.0 and I want to update to the last version (7.3). But it doesn't appear in the updates page of the App Store. So, I searched for Xcode in the App Store and clicked the little update button. The button remains pressed and a loop icon appears on the top. But it stays like that for hours and there's no sign it's updating.    This doesn't seem to be working. I found in the internet that if I uninstall and reinstall it may work, but I don't want to lose all my projects.


I'm interested in cutting edge string theory studied by research physicist. I'm wonder what  mathematics is needed and how far am I in terms of mathematics background needed and how much more mathematics do I need in order to study it properly and reach my goal. My mathematics level is at calculus/Linear algebra.

Can someone please give me the prerequisites and mathematics required for string theory? Are there some good references to study it, both online and in a book? Please consider I am a newbie in string theory, and only about up to the level explained in Hawking's Brief History of Time and Penrose's Road to Reality. I would prefer something which does not omit rigor, but builds it up.Also, are there good online lectures on this?  (I have covered most of GR, but I am not really comfortable with advanced Quantum mechanics. I have studied QM only from Griffith's book, and a few McGraw hill lecture notes.)


I went through all the steps of setting up authorship on my website, but it doesn't seem to be working. My photo appears in some search results, but not for my website. I attached a screen shot of search results which shows my website at the top (without photo thumbnail) and other results with the photo.   How can I get it to show up with my website?

I was trying to add author information for search. I followed  link and did everything in option 2. Added ?rel=author and added my blog in my Google+ account. But even after re submitting for index from Google webmasters author info doesnt come up. I have tested this through the Rich snippet testing tool in Webmasters account and everything seems fine and I do see a dummy result showing full info. And it also says rel=author markup has successfully established   So what am I missing out here ?  EDIT: Ok after long time it did come up in search results last week, but now its not coming up ? Is it related to traffic to site(which is not too bad) ?


I know how to generate the symbol \Delta. But is there a way to generate the similar triangle symbol underlined in pink:

I'd like to write a majuscule delta-like symbol in LaTeX but I can't find it's syntax anywhere. You can see the symbol on equation (12) of the following paper:  "".


I have submitted a manuscript to one of the top-tier journal of my field at six month ago. The recent status of the paper is "under review" which status is there for last four months.   My question is:  In that situation is it ok to ask the Editor-in -Chief of that journal about the reason of the review delay?  Also could anyone please help me by giving a useful reference to a template of such mail (to the Editor-in-Chief), which ask the above question to the editor in a polite and effective manner.

I have a manuscript that has been in review for 60 days. The journal asks for reviews within four weeks. At what point is it acceptable (and not detrimental) to contact the editor for an update? How should I phrase the request?


I have this simple substraction code:  <?php     $n1 = 257931.076;     $n2 = 257930;      echo $n1 - $n2; ?>   Why i got 1.0760000000009 instead of 1.076  Where did the 0000000009 came from? i need precise result and i don't want to use round() or number_format() because sometime i have more than 3 decimal, for example: 12345.678912, anyone know?  I have tried to use round() or number_format() but it only for fixed decimal point, not dynamic

Consider the following code:   0.1 + 0.2 == 0.3  ->  false   0.1 + 0.2         ->  0.30000000000000004   Why do these inaccuracies happen?


Total newbie when it comes to Linux in general and Ubuntu in specific (literally installed it last night).  I'm having trouble installing software and read that GDebi would make it much easier. However, I can't even figure out how to install GDebi properly (it's a wonder I managed to install Opera!)  When I enter the command:  sudo apt-get install gdebi   I get  josiah@LAPTOP-JOSIAH-UBUNTU:~$ sudo apt-get install gdebi
 [sudo] password for josiah:
 Reading package lists... Done
 Building dependency tree
   Reading state information... Done
 You might want to run 'apt-get -f install' to correct these:
 The following packages have unmet dependencies:
  gdebi : Depends: gdebi-core (= 0.9.5.7ubuntu1) but it is not going to be
 installed
          Depends: gksu but it is not going to be installed
          Depends: gnome-icon-theme but it is not going to be installed
  gdebi-kde : Depends: gdebi-core (= 0.9.5.3ubuntu2) but it is not going to
 be installed
              Depends: python3-pykde4 but it is not going to be installed
              Depends: kdebase-runtime but it is not going to be installed or
                       kde-runtime but it is not going to be installed or
                       kdesudo but it is not going to be installed
  megasync : Depends: libc-ares2 (>= 1.7.4) but it is not going to be installed
             Depends: libcrypto++9v5 but it is not going to be installed
 E: Unmet dependencies. Try 'apt-get -f install' with no packages (or specify a solution).  So I tried      apt-get -f install   But get:  E: Could not open lock file /var/lib/dpkg/lock - open (13: Permission denied)
 E: Unable to lock the administration directory (/var/lib/dpkg/), are y   Also tried installing via the Ubuntu Software Center, but get "waiting to install", which is the same problem that's causing me to install gdebi in the first place.  Hope someone can help!

I get this error whenever I try to install programs using the terminal:  home@ubuntu:~$ apt-get install myunity E: Could not open lock file /var/lib/dpkg/lock - open (13: Permission denied) E: Unable to lock the administration directory (/var/lib/dpkg/), are you root?   Also I'm unable to install updates using the terminal.


There were a few concrete driveways poured in my neighborhood this year. The contractor (largest in the area) took, what I always thought was, an unconventional approach to the joints.  Typically, I would expect them to pour the concrete, and then tool the joints in.  This company poured the driveways on one day, then returned a day later to cut the joints in with saws.  Is there some advantage to cutting the joints, as opposed to tooling them?

I'm looking at getting a lot of concrete work done and am looking to educate myself past the minimal anecdotal information I posses so that I can have a better conversation with prospective contractors.    Expansion joints, saw cut or hand troweled - is this just preference or is there a good reason to go for one over another? From an aesthetic perspective I like hand troweled but I've been told that the saw cut can leave the concrete stronger as you are interacting with the wet concrete less.   Google doesn't seem to provide much info by way of POV on this, just that there are options, so I look to the community here to see if there is a collective wisdom.  For perspective, this is for a standard 4" thick driveway, 6" thick apron, and garage floor.


Give the smallest positive value of  $x$ for which $\tan x$ is undefined. An answer and explanation on how to solve would be great.

Why is the trigonometric function $\tan((1/2)\pi)$ undefined?


I wanna add some data into two columns in a table.  Would be something like:  INSERT INTO dm.billables_links (billable_id) VALUES ((SELECT billable_id FROM junk.wm_260_billables2 WHERE info ilike '%Ali%')),  INSERT INTO dm.billables_links (mobiuser_id) VALUES ((SELECT id FROM public.ja_mobiusers WHERE name_first LIKE 'Ali%' AND name_last LIKE 'Daon%'))   Question:  Note that the "billable_id" selected on the first INSERT must be related to the "mobiuser_id" selected on the second INSERT.  How can I do such a thing?   Table dm.billables.links columns:  billable_id, mobiuser_id  SELECT id FROM public.ja_mobiusers WHERE name_first LIKE 'Ali%' AND name_last LIKE 'Daon%'  950898  SELECT billable_id FROM junk.wm_260_billables2 WHERE info ilike '%Ali%'  13270372

I've got a table that has several columns, But I need to insert data into two columns of that table. I need to add data into those columns, from a select statement.  Would it be something like:  INSERT INTO dm.billables_links (billable_id, mobiuser_id) SELECT billable_id FROM junk.wm_260_billables2 WHERE info ilike '%Alisha%' SELECT id FROM public.ja_mobiusers WHERE name_first LIKE 'Alisha%' AND name_last LIKE 'Dson%'   It has to be in the same transaction because the mobiuser_id must go to the selected billable_id on the first select.  How can I do that?     1 - Select billable_id from dm.billable       2 - Select mobiuser_id from   ja_mobiusers       3 - Insert the billable_id and the mobiuser_id to the   dm.billables_links table.   I've a CONSTRAINT on the target table: (That's why I need to get it done at the same time. So I won't get errors like:      ERROR:  new row for relation "billables_links" violates check   constraint "cc_one_and_only_one_target"   ALTER TABLE dm.billables_links   ADD CONSTRAINT cc_one_and_only_one_target CHECK ((("customer_id" IS NOT NULL)::integer + ("role_id" IS NOT NULL)::integer + ("mobiuser_id" IS NOT NULL)::integer) = 1);   This is related to my previous question - Which I've asked to be deleted because have done the wrong question and it has been confused.   UPDATE 1: This is an example of what I need  1 - select the billable_id: (SELECT1)  SELECT billable_id FROM junk.wm_260_billables2 WHERE info ilike '%Alisha%'   2 - select the mobiuser_id: (SELECT2)  SELECT id FROM public.ja_mobiusers WHERE name_first LIKE 'Alisha%' AND name_last LIKE 'Dadryl%'   3 - Insert those two data into the dm.billables_links table (EXAMPLE):  INSERT INTO dm.billables_links (billable_id, mobiuser_id) VALUES (**SELECT1**, **SELECT2**);


I'm preparing a campaign of Star Wars Saga Edition, and I'm stuck with two of my player's backgrounds. The campaign takes place in 3 659 BBY, and the party is mainly composed of Sith.  The characters, a Jawa (Bob) and a droid HK-51 (John), serve the same master, a Sith Lord. The Jawa has became a Sith's acolyte, but is not supposed to possess a lightsaber. Nonetheless, he has disobeyed his master, and crafted one by himself in secret.  The problem is, "a HK-51 is fully and only loyal to his master, and would sacrifice his existence, rather than betray him in any way". My droid-player is really devoted to this aspect of his character.  The Jawa and me suggested two options:   The Jawa managed to put a "control bolt" (literally translated from French) on the droid, preventing John from telling Bob's secret to their master. The droid maintains that he would prefer to destroy himself. The Jawa could be in charge of the maintenance of the droid. Thus, John could calculate that it's best for everyone if he doesn't denounce Bob: their master could use two servants rather than one. John said that he would still denounce Bob, as he is fully loyal to their master.   Now, as a player, I understand the devotion of John toward his character. But, as a first time DM, it's kind of tricky to come out with a solution.  Is there a way to prevent John denouncing Bob?

I've been reading forum posts and blogs who mention "my guy" syndrome as a specific type of difficult player, but I can't seem to find a solid definition for the term. Can someone explain this particular kind of problem player to me? How do you deal with this kind of problem?


I am trying to use javascript and html5 to create a HMI for a project. In this first experiment i just want to change a text element in the svg document.  The svg object is defined in html like this:  <object id="image-svg" width="800" height="800" type="image/svg+xml" data="image.svg"></object>   This script:  function update_txtPv( val ) {     var imageSvgDoc = document.getElementById( "image-svg" ).contentDocument;     var txtPv = imageSvgDoc.getElementById( "txtPv" );     txtPv.textContent = val; }  update_txtPv( "test" );   gets called once when the page loads.  Problem is that if I refresh the page ten times it only sets the text object to "test" about three of the times.  if I add an alert( "something" ); in the beginning of the function it works.  What is going on?  //John

I need to edit (using javascript) an SVG document embedded in an html page.  When the SVG is loaded, I can access the dom of the SVG and its elements. But I am not able to know if the SVG dom is ready or not, so I cant' perform default actions on the SVG when the html page is loaded.  To access the SVG dom, I use this code:  var svg = document.getElementById("chart").getSVGDocument();   where "chart" is the id of the embed element.  If I try to access the SVG when the html document is ready, in this way:  jQuery(document).ready( function() { var svg = document.getElementById("chart").getSVGDocument(); ...   svg is always null. I just need to know when it is not null, so I can start manipulate it. Do you know if there is a way to do it?


Sam is a level 8 sorcerer that takes 1 level of wizard for his 9th level. He now has a wizard spellbook and all that.  Walter the level 9 wizard has a thought. Walter hands Sam his own spellbook for a day.   Can Sam prepare the 5th level wizard spells in Walter's book? He has the spell slots and the book has the spells.      Not in the scope of the question:  Number of spells preparable. Sam is a level 1 wizard with Int 14 - so, three spells.  Walter is a curious wizard who is willing allowing this to happen.  Sam can read the language in Walter's spell book.

The "Your Spellbook" sidebar for the wizard includes the following line:  Copying a Spell into the Book. When you find a wizard spell of 1st level or higher, you can add it to your spellbook if it is of a level for which you have spell slots and if you can spare the time to decipher and copy it.  Does this mean that a Wizard 1/Cleric 19 can copy any wizard spell they find into their spellbook? Is there anything preventing them from casting these spells?


We are watching the whole Marvel Cinematic Universe in preparation for the new Avengers movie coming up in May. While watching Captain America: The First Avenger, I realized that it's never explained how the Tesseract came to be on Earth for Red Skull to find it in World War II. Did it come from Asgard when Jotunheim and Asgard fought on Earth?

Wikis say that the Tesseract came to Earth accidentally. How exactly, did it come to Earth?


This is printing 16 and 4 as the answer but it should be printing as 8 and 4 because both a and b are integer type variables. So can we think this as the compiler stores the address of the variable a in a separate variable while copying to b that is why it is resulting in 4 + 4 + 8 = 16? If not then what is it? #include <iostream> using namespace std;  class C { public:   int a = 45;   int &b = a; };  int main() {   C ob1;   cout << sizeof(ob1) << endl;   cout << sizeof(ob1.b);    return 0; }

Why does the sizeof operator return a size larger for a structure than the total sizes of the structure's members?


I have noticed that my specific questions that are capped with a request for any lessons-learned are often met with resistance from moderators.  The request for lessons-learned as it pertains to a specific topic / question is often used solicit relevant facts and answers to questions that one can not ask, unless one has experience.  Why is there resistance to lessons-learned / experience?  This is the only question with regard to this thread  For example, I might ask the question, when is the best time of year to visit the Paris' Arc De Triophe as a tourist?  Any lessons learned are appreciated.  The answer may be in November because that is when there are the fewest tourist and the companion lesson-learned is that the elevator is out-of-service for the next 6 months.  So if you are go with your 70 year old mother mother, then you need to ensure that she is able and willing to walk up many flights of stairs and back down again.  Maybe this is not the best example, there can be other permanent pitfalls / obstacles that can / should be avoided, but hopefully the gist is there.  The ability to ask a question and gain the knowledge-based experience is  priceless.  Not every question has a quantifiable answer that can be Googled and more often than not the original specific question needs to be refined through the lessons-learned mechanism.  In every industry I have worked in, this is a common mechanism for learning.  That being said, I would (respectfully) suggest that the leadership at stackexchange re-examine policy / culture with regard to lessons-learned.  From my observations: it seems that there too many that are too quick to unnecessarily police (censor) questions, instead of providing useful insight.   I do not believe that incentive (points) should be awarded for modifying / correcting questions and that question moderators should be those that have a history of providing accepted answers and not necessarily points (i.e. credibility)

I'm on SO pretty much every day researching something to do with programming, and over the last month or two, I find I'm growing frustrated and a little disgusted at how many interesting questions have been closed as "not a good fit" or "too subjective".  I think there is a confusion between "subjective" and "calls for judgement". To me one of the most valuable things about SO is the tremendous breadth and depth of experience of the members, and experience translates into smart decisions and advice, and that advice cannot always be asked for, or expressed in terms of, bald facts and data.  It's going to be 'subjective'.  I don't think SO should be Wikipedia. I think that if I could ask a question to a group of skilled programmers sitting around a table at lunch, and get interesting, valuable answers, then I don't care whether the question or the answers are 'subjective', I think that question should equally well be fair game for Stack Overflow.  I would like to see a mechanism whereby people who vote to close a question lose reputation when somebody expresses interest in that question or its responses.  How can I, or can I, influence this aspect of SO?


I have windows 8 before installing ubuntu 13.04 on my lenovo z580 laptop. While installing ubuntu i have chosen to erase the disk without knowing. I cant find any files of my hard disk. Plese help me. Thank u very much if it is helpful.

I have a Toshiba satellite A-200 laptop with a Vista OS on it with 4 NTFS partitions  (C:) Vista  (D:) Entertainment  (E:) Work  (F:) Sources   and I wanted to start using Ubuntu instead. So I tried it first from the live CD and everything was OK and all the partitions were shown and working and so I decided to install Ubuntu to replace Vista on the (C:) drive. After I did that I can no longer find my folders and files on the (D:), (E:), (F:) partitions and the only file system that is shown is one 198 GB although my HDD is 320 GB.  I can't access the lost data on the remaining 120 GB which I hope is still there and not totally lost  I am now working from the live CD but I am unable to install testdisk. Can I recover the Vista partitions by the product recovery CD to get my laptop back to the factory settings? Can I recover the NTFS partitions using a recovery program for Windows or will that make the problem worse?   I need these data badly as I don't have a backup for them.


My Ubuntu 10.10 is no longer supported. Some programs like Update Manager will not open. And a bunch of other Ubuntu programs. I was wondering if it would work if I:  1: Got an 8GB USB flash drive  2: Correctly put Ubuntu 14.04.3 on the USB flash drive  3: Plugged the USB flash drive (with Ubuntu on it) in the computer that runs the faulty Ubuntu   Installed it and totally get rid of Ubuntu 10.10 Ran the new Ubuntu   Would this work? Because I figured that it would because it is just like installing any other Ubuntu.  Today (10-22-15) I will be going out to buy a USB flash drive! Please leave a response if you read this.

Recently I have installed an older version of Ubuntu on my old machine. Whenever I try to install any software, I get an error saying it couldn't be found:  $ sudo apt-get install vlc Reading package lists... Done                Building dependency tree        Reading state information... Done     E: Couldn't find package vlc


For any positive integer m&n.$n\ge m$ , let $\left( {\begin{array}{*{20}{c}} n\\ m \end{array}} \right) = {}^n{C_m}$. Prove that $\left( {\begin{array}{*{20}{c}} n\\ m \end{array}} \right) + 2\left( {\begin{array}{*{20}{c}} {n - 1}\\ m \end{array}} \right) + 3\left( {\begin{array}{*{20}{c}} {n - 2}\\ m \end{array}} \right) + .. + \left( {n - m + 1} \right)\left( {\begin{array}{*{20}{c}} m\\ m \end{array}} \right) = \left( {\begin{array}{*{20}{c}} {n + 2}\\ {m + 2} \end{array}} \right)$ My approach is as follow $n=4, m=2$ $\left( {\begin{array}{*{20}{c}} 4\\ 2 \end{array}} \right) + 2\left( {\begin{array}{*{20}{c}} 3\\ 2 \end{array}} \right) + 3\left( {\begin{array}{*{20}{c}} 2\\ 2 \end{array}} \right) = \left( {\begin{array}{*{20}{c}} 6\\ 4 \end{array}} \right) = 15$ $6 + 6 + 3 = 15 \Rightarrow LHS = RHS$ But not able to solve it via property

$${2\choose 2} {10\choose 3}+{3 \choose 2}{9 \choose 3}+{4 \choose 2}{8 \choose 3}+{5 \choose 2}{7 \choose 3}+{6 \choose 2}{6 \choose 3}+{7 \choose 2}{5 \choose 3}+{8 \choose 2}{4 \choose 3}+{9 \choose 2}{3 \choose 3}={13 \choose 6}$$   I am supposed to get the answer ${13\choose 6}$. I wonder if there is any formula for combination addition like this or are there some tricks to do this?


How can I format the following very long set description? Ideally, it should split into two lines.  The general structure of the set description is:  \{f(x) :| x \in S |: P(x)\}  This is a non-standard set notation, which means: the set obtained by running through all the x's in the set S, choosing only those x's that satisfy the predicate P, and then applying the function f to the selected x's and collecting the results into a set.  Additionally, the left part of the set below is of the form a \mapsto b (b being the cases structure). This is simply syntactic sugar for the ordered pair (a,b)  \documentclass{article} \usepackage{amsmath} \begin{document} $$ \left\{\ddot{\mathbf{A}}_{d(\Omega;\dot{E})}(T.d)[i] \mapsto f_{d(\Omega;\dot{E})}^T(l,u)[i]\ :\!|\ i \in [1..T.d.n]\ |\!:\ F_{d(\Omega;\dot{E})}^T[i-1] \leq u \wedge F_{d(\Omega;\dot{E})}^T[i] \geq l\right\} $$ \end{document}   Here the typeset result is seen in context. It extends into the right margin almost all the way to the right edge of the page.      I've tried using \split and \multlined as per egreg's suggestion in a comment below.  SPLIT  \begin{split} \left\{\ddot{\mathbf{A}}_{d(\Omega;\dot{E})}(T.d)[i] \mapsto f_{d(\Omega;\dot{E})}^T(l,u)[i]\ &:\!|\ i \in [1..T.d.n]\\ &|\!:\ F_{d(\Omega;\dot{E})}^T[i-1] \leq u \wedge F_{d(\Omega;\dot{E})}^T[i] \geq l\right\} \end{split}   It produces the following error message:  Extra }, or forgotten \right.   MULTLINED  \begin{multlined}[t] \left\{\ddot{\mathbf{A}}_{d(\Omega;\dot{E})}(T.d)[i] \mapsto f_{d(\Omega;\dot{E})}^T(l,u)[i]\ :\!|\ i \in [1..T.d.n]\\ |\!:\ F_{d(\Omega;\dot{E})}^T[i-1] \leq u \wedge F_{d(\Omega;\dot{E})}^T[i] \geq l\right\} \end{multlined}   It produces the following error message:   Missing \right. inserted.

I have a multi-line equation that I want to have matching sized parentheses. The advice I read online was to use \left( equation \right. \\ left. rest-of-equation \right) . However, this syntax leaves first half of the equation unaware of what is in the second half. For example, if you include a square root term after the break, the second parenthesis will be larger than the opening parenthesis. When you are using the aligned environment to split a long equation this can look somewhat offputting.    Compare the top equation to the bottom one. The parentheses match in size for the bottom equation, but the left hand parentheses for the top one is  noticeably smaller.  Top Code:   \begin{aligned}[t]   \gamma_{\text{u}} + \frac{1}{108}   \left(57\gamma_{\text{er}} \right. &+  38\gamma_{\text{se}}\\ & {}\pm  \left.\sqrt{2601 \gamma_{\text{er}}^2 + 3648  \gamma_{\text{er}}\gamma_{\text{se}} + 1444 \gamma_{\text{se}}^2}  \right)   \end{aligned}   Bottom Code:  \begin{aligned}[t] \gamma_{\text{u}} + \frac{1}{16} \left(9\gamma_{\text{er}}  +  6\gamma_{\text{se}} \pm  \sqrt{49 \gamma_{\text{er}}^2 + 76 \gamma_{\text{er}}\gamma_{\text{se}} + 36 \gamma_{\text{se}}^2} \right) \end{aligned}


I am developing web application using C#. I want to replace multiple character in a string. For example,  string str = "abc_def|ghij_klmn:opq|rst:uv_wx|yz"; str = str.Replace("_","-"); str = str.Replace("|",", "); str = str.Replace(":",". ");   OR  string str = "abc_def|ghij_klmn:opq|rst:uv_wx|yz"; str = str.Replace("_","-").Replace("|",", ").Replace(":",". ");   The above are the sample coding, actually I want to replace more characters. Is there any performance related issue in above two codes?  This may be a duplicate question, I searched for that, but I didn't find...  Thanks

string str1 = "12345ABC...\\...ABC100000";   // Hypothetically huge string of 100000 + Unicode Chars  str1 = str1.Replace("1", string.Empty);  str1 = str1.Replace("22", string.Empty);  str1 = str1.Replace("656", string.Empty);  str1 = str1.Replace("77ABC", string.Empty);   // ...  this replace anti-pattern might happen with upto 50 consecutive lines of code.   str1 = str1.Replace("ABCDEFGHIJD", string.Empty);   I have inherited some code that does the same as the snippet above. It takes a huge string and replaces (removes) constant smaller strings from the large string.  I believe this is a very memory intensive process given that new large immutable strings are being allocated in memory for each replace, awaiting death via the GC.  1. What is the fastest way of replacing these values, ignoring memory concerns?  2. What is the most memory efficient way of achieving the same result?  I am hoping that these are the same answer!  Practical solutions that fit somewhere in between these goals are also appreciated.  Assumptions:    All replacements are constant and known in advance Underlying characters do contain some unicode [non-ascii] chars


For $s > 1$, define the zeta function by $$\zeta(s) = \sum_{n = 1}^{\infty}n^{−s}$$ Fix $s > 1$, and let $X$ be a random variable with $P(X = n) = n^{−s}/\zeta(s)$.  1) Show that the events $\{p \text{ divides } X \text{ s.t. } p \text{ is prime} \}$ are independent and deduce Euler’s formula $$ \frac{1}{\zeta(s)} = \prod_{p: \ p \ \text{prime}} \left(1 - \frac{1}{p^s}\right).$$  2) Prove also that $P(X \text{ is square-free}) = \dfrac{1}{\zeta (2s)}$  3) Let $Y$ be an independent copy of $X$ and let $G$ be the greatest common divisor of $X$ and $Y$ . Show that $P(G = n) = \dfrac{n^{−2s}}{\zeta(2s)}$.  [$X$ is square-free = No perfect square other than $1$ divides $X$.]  I have been able to show (1) and (2). How to go about with (3)?

In , $\exists$ this exercise.  Let $s > 1$ and let $\zeta(s) = \sum_{n=1}^\infty n^{-s}$.  Let $X$ and $Y$ be independent $\mathbb{N}$-valued random variables with $P(X=n)=P(Y=n)=\dfrac{n^{-s}}{\zeta(s)}$.  Facts:  1 The events ($E_p$: $p$ prime) where $E_p =$ ($X$ is divisible by $p$) (This time $p$ may not be prime) are independent.  2 The events ($F_p$: $p$ prime) where $F_p =$ ($Y$ is divisible by $p$) (This time $p$ may not be prime) are independent.  3 $P(E_p) = p^{-s}$  4 This is Euler's formula $1/\zeta(s) = \prod_p (1-1/p^s)$ where $p$ is prime.  5 $P(X=1) = 1/\zeta(s) = \prod_p (1-1/p^s)$  6 $P(\text{no square other than 1 divides }X)= \dfrac{1}{\zeta(2s)}$  Here is the exercise:  Let $H$ be the highest common factor of $X$ and $Y$. Prove that $P(H=n) = \dfrac{n^{-2s}}{\zeta(2s)}$.  How do I go about doing this? I know $H$ divides both $X$ and $Y$ but that's just making use of the fact that $H$ is a common factor. Since it is the highest, all the natural numbers greater than $H$ do not divide $X$ and $Y$ or something like that?


Im not at all up with graphic design however i'm trying to get some samples of products manufactured in China and the company has asked for a vector file. I have no idea what it is or how to turn the image I have into a vector file. Any advice at all would be hugely appreciated.  cheers  Casey

I understand from prior knowledge that there are two different image format / composition options available for creating images; raster and vector.  I would like to understand more about them, such as what the defining characteristics of each are, and what typical, generic use-cases each might have.       What are raster graphics composed of?   When would I want to choose raster over vector?       What are vector graphics composed of?   When would I want to choose vector over raster?


I need to prove this statement with induction: if n is odd then $n^3 - n $ is divisible by 24 I've proved the base case (when $n = 1$) but I only have a small idea of what is to do in the induction step ($p(n) \Longrightarrow p(n+2)$)

At our college, a professor told us to prove by a semi-formal demonstration (without complete induction):   For every odd natural: $24\mid(u^3-u)$   He said that that example was taken from a high school book - maybe I din't get something, but I really have no idea to prove that without using complete induction.  Any idea of smart demonstration?  Thanks for your help. (Excuse my bad English.)


I have am application for Windows which only supports HTTP proxies (no SOCKS support).   Because I already have some good SOCKS proxy lists, I was wondering: Is there some HTTP proxy server for Windows OS, that could "forward" (translate?) connections to SOCKS proxies?  So the connection would look like this:      App → local HTTP proxy (as "translator" to SOCKS proxies) → SOCKS proxy   Is it possible? Is there such software?

I'm currently doing some testing work with TOR and ran in to a small problem. Tor's client only supports receiving connections through a SOCKS5 protocol, but the applications I'm using only support HTTP Proxy Protocals.  Is it possible to put something in the middle? So that for example it went.  My Program (HTTP Only) > HTTP to SOCKS Converter > Tor SOCKS5 Server


The problem was to prove that $5^{3^n}+1$ is divisible by $3^{n+1}$ for all nonnegative integers.   I attempted to prove the claim by induction.  Claim: For all $ n \ge 0 $  $$ 3^{n+1} ~|~ 5^{3^n}+1 $$ Basis case: $$ 3^{0+1} = 3  ~|~ 6 =  5^{3^0} + 1 ~ ~\checkmark$$  Inductive step: Assume $$ 3^{k+1} ~|~ 5^{3^k} + 1 $$ It follows by the definition of divides, $ 5^{3^k } + 1 = 3^{k+1}\cdot m $ for some integer $m$.     Then $$~~~~~ 5^{3^{k+1}} +1 \\   = 5^{3^k \cdot 3 }+1  \\ = 5^{3 \cdot 3^k}+1   \\ = \left( 5^3 \right)^{3^k} +1  \\=  125^{3^k} +1 $$ I have no idea how to proceed. Am I on the right track? If it is possible can I get a hint. One thing I did notice is that it might be easier to prove $$ 3^{n} ~|~ 5^{3^n}+1 $$ This statement seems to be true, since the basis case is then $1|6$.

Prove by mathematical induction that $2^{3^n}+1$ is divisible by $3^{n+1}.$   I'm currently trying to finish a task that requires me to use mathematical induction to prove that $2^{3^n}+1$ is divisible by $3^{n+1}$. This is the first time that the divider is not a simple integer and I'm having trouble trying to prove it.   This is what I managed to do:     First step:      For $n=1$:      $2^3+1=9$      $3^2=9$      $L=P$      Second step: I assume that for some numbers $n>=1$  $2^{3^n}+1$ is divisible by $3^{n+1}$      Third step: (induction hypothesis):   $2^{3^{n+1}}+1$ is divisible by $3^{n+1}$   I'm getting stuck here, trying to do some algebra and simplify the dividend:     $2^{3^{n+1}}+1 = 2^{3^n*3}+1$


When putting together an ecommerce website structure, one of the ongoing questions I keep asking myself, is:     What would I need to do, in the event of future product expansion.  Ideally, how can I 'future proof' said website.   More specifically, let's say the site has the following Product structure:   Wall Art > Wooden Wall Art > Product Name   This would typically create the following URL structure:  www.example.com/wall-art/wooden-wall-art/product-name/   So far, fairly simple!  Then, 12 months later, the site decides it would like to expand its product offering.  It now wishes to sell Clocks.  As such, it would like to create a 'Wall Decor' Product Category.  As such, the site would have the following Product structures:   Wall Decor > Wall Art > Wooden Wall Art > Product Name Wall Decor > Clocks > Wooden Clocks > Product Name   Referring to the 'Wooden Wall Art' Product structure, we can now see that the URL has changed from ...  www.example.com/wall-art/wooden-wall-art/product-name/   to ...  www.example.com/wall-decor/wall-art/wooden-wall-art/product-name/   Consequently, requiring the implementation of various '301 Redirects'.  It has been said that '301 Redirects' do not affect SEO.  Regardless, I would like to avoid this avenue as I personally as it adds a few extra milliseconds to a site load speed.  Also, I associate redirects with pop up ads etc.  Some people may feel the same and as such, may immediately click off as soon as a page starts to redirect.  As such, I am contemplating the idea of getting rid of a 'hierarchical' URL altogether.  Let's say, someone wishes to visit:   Wall Art > Wooden Wall Art   Instead of the generated URL being ...  www.example.com/wall-art/wooden-wall-art/   ... it would be:  www.example.com/wooden-wall-art/   Say the site should expand to include a 'Wall Decor' Product Category, then the user would still be taken  to ...  www.example.com/wooden-wall-art/   Rather than ...  www.example.com/wall-decor/wall-art/wooden-wall-art/   In order to generate the required internal linking, between Product Categories, all Category Pages would have Breadcrumbs.  It would be through these Breadcrumbs, which would highlight the linking structure.  Prior to adopting this approach, I am wondering if anyone is aware of any potential SEO issues or whether this would cause any other problems; be it SEO or organisational related.  As a side not, I realise that the Product pages themselves would be unaffected.  The reason being that all Product pages would have the following URL structure:  www.example.com/product/product-name/   with all ...  www.example.com/product-category/product-name/   URL variants containing a Canonical link.

Let’s take an example of a movie site. So a well structured set of URLs for this site can be:     Movie page - example.com/movies/the-matrix Review for movie - example.com/movies/the-matrix/reviews Trailers for movie - example.com/movies/the-matrix/trailers Specific trailer for movie - example.com/movies/the-matrix/trailers/trailer1   where it’s possible to navigate the resource even by directly deleting/appending resource name seamlessly.  For SEO purpose I read somewhere that for two given pages, Google will prefer the page which have search query up in the URL hierarchy among other things. So for the given 2 URLs and the query "the matrix trailer"    example.com/movies/the-matrix/trailers example.org/trailers/the-matrix/    `     Google might prefer the second URL as it has the keyword "trailer" at first level comparing to first URL which has "trailer" at 3rd level (a resource deeper in URL hierarchy may be less important).    If it is correct, one may be tempted to create URL hierarchy somewhat like      Movie page - example.com/movies/the-matrix Review for movie - example.com/reviews/the-matrix/ Trailers for movie - example.com/trailers/the-matrix/ Specific trailer for movie - example.com/trailers/the-matrix/trailer1     which will break the seamless hierarchy.    My questions are:   Is it true that resource deeper in URL hierarchy is tend to be less important when comparing to URLs of other site?   Is sacrificing meaningful, seamless hierarchy worth for this SEO optimization?


I like to make homemade butter from cream using a churn, but it's super super stiff and I can't spread it on food without ripping it apart. Is there something I can add to make it softer?  I tried leaving it out in a butter try, but it starts to grow mold in a day or two.

How do you correctly soften butter for spreading on bread? Is it simply a matter of leaving it at room temperature for a few hours, or do tools like butter conditioners do a better job?


I have an inner class, which I want to instantiate from the static method of the parent class as follows:  public class MyClass {     public class B {         private int v;         B(int x) {             v = x;         }          public void pr() {             System.out.println(this.v);         }     }      public static void main(String args[]) {       int x=10;       int y=25;       int z=x+y;     B bb = new B(3);       System.out.println("Sum of x+y = " + z);     } }   It is throwing an error as follows:  error: non-static variable this cannot be referenced from a static context     B bb = new B(3);            ^ 1 error

What is the main difference between an inner class and a static nested class in Java? Does design / implementation play a role in choosing one of these?


For example $\prod_{2 \le j  < 1} 2^j= 1.$ How does that happen?

Give:  $fn(S)=\prod_{x\in S}x$  what is:  $fn(\emptyset)$  I can see reason that it would be defined as 1 or 0.    Note: I thought about restricting the domain of $S$ but that would make the problem less general. If there is no general answer then answers for restricted domains would be valid.


I have a sequence, called $A$. It's elements are $a_1 , a_2 , \ldots , a_n $ for example: $(5, 11, 2)$  Then how to prove, that this formula results the highest value in the series?  $$ \lim_{x \rightarrow \infty} \sqrt[x]{ \sum\limits_{i=1}^n a_i^x } = \max( a_1, \ldots, a_n ) $$

Let $m\in \mathbb{N}$ and $c_1,c_2,\ldots,c_m \in \mathbb{R}_+$. Show that $$\lim_{n\rightarrow \infty} \sqrt[n]{c_1^n+c_2^n+\ldots+c_m^n} = \max\{c_1,c_2,\ldots,c_m\}$$  My attempt: Since $$\lim_{n\rightarrow \infty} \sqrt[n]{c_1^n+c_2^n+\ldots+c_m^n} \leq \lim_{n\rightarrow \infty}\sqrt[n]{\max\{c_1,c_2,\ldots,c_m\}} = \lim_{n\rightarrow \infty} \sqrt[n]{n}\sqrt[n]{\max\{c_1,c_2,\ldots,c_m\}}=\lim_{n \rightarrow \infty} \max\{\sqrt[n]{c_1^n},\sqrt[n]{c_2^n},\ldots,\sqrt[n]{c_m^n}\}=\lim_{n \rightarrow \infty}\max\{c_1,c_2,\ldots,c_m\}=\max\{c_1,c_2,\ldots,c_m\}$$  it follows that $\lim_{n\rightarrow \infty} \sqrt[n]{c_1^n+c_2^n+\ldots+c_m^n}$ is bounded, but I don't think it's monotonically decreasing, at least I can't prove this. Can anybody tell me whether the approach I have chosen is a good one, whether what I have done is correct and how to finish the proof?


I have to find the total working time of a staff.  Variables in my hand is,  $work_time_start = "8:00:00"; $work_time_end = "18:00:00"; $lunch_break_start = "13:00:00"; $lunch_break_end = "14:00:00";   From this I have to find the total working time of a staff.  For example.  //example 1      $work_start_time = "14:00:00"; $work_end_time = "14:25:00";  //The output should be: 00:25:00  //example 2  $work_start_time = "14:00:00"; $work_end_time = "10:25:00";  //The output should be: 06:25:00   How to achieve the required output. I have no idea.

How to calculate minute difference between two date-times in PHP?


I already proved it if $1729$ divides $a$, or if it doesn't divide $a$ but it's Greatest Common Divisor is not equal to $1$ (we get that the left side is equal to $0$ and the right side is equal to $0$ thus in these cases $a^{1729}\:=_{1729}\:\:a$ is a true statement). But I can't find a proof for $1729$ does not divide $a$ and it's Greatest Common Divisor is equal to $1$.

I want to know a proof of an alternative form of Fermat-Euler's theorem   $$a^{\phi (n) +1} \equiv a \pmod n$$   when $a$ and $n$ are not relatively prime.   I searched some number theory books and a cryptography book and internet, but there were only proofs of the original theorem  $a^{\phi (n)} \equiv 1 \pmod n$ or in case n=pq which is used for RSA. So I would be very thankful if someone show me a proof or book I should read.


I was trying to derive the function $h(x)$ that describes the shape of a string fixed at two points with distance $D$ (which aligned with the x-axis), in other words, $h(0)=h(D)=0$ but I got stuck.  I am interested in a solution that involves Lagrangian mechanics, as I am curious to know how one should solve a problem where the object in question is not rigid with the tool. All I could get is that the integral $$\int_0^D\sqrt{1+h'(x)}\mathrm dx=L,$$ where $L$ is the length of the string.

The height of a string in a gravitational field in 2-dimensions is bounded by $h(x_0)=h(x_l)=0$ (nails in the wall)  and also $\int_0^l ds= l$. ($h(0)=h(l)=0$, if you take $h$ as a function of arc length) .  What shape does it take?  My try so far: minimise potential energy of the whole string,  $$J(x,h, \dot{h})=\int_0^l gh(x) \rho \frac{ds}{l}=\frac{g \rho }{l}\int_0^l h(x) \sqrt{1+\dot{h}^2} dx$$  With the constraint  $$\int_0^l \sqrt{1+\dot{h}^2} dx- l=0$$ If it helps, it's evident that $\dot{h}(\frac{l}{2})=0$.  Generally, this kind of equation is a case of a constrained variational problem, meaning that the integrand in  $$\int_0^l \frac{g \rho }{l}h(x) \sqrt{1+\dot{h}^2} +\lambda(\int_0^l \sqrt{1+\dot{h}^2} dx- l)dx$$  Must satisfy the Euler Lagrange equation. The constraint must also be satisfied.  But, in truth, by this point I am clueless. $\lambda$ is worked through $\nabla J  = \lambda \nabla(\int_0^l \sqrt{1+\dot{h}^2} dx- l)$. I have tried this , but get nonsensical answers.  Is this method the best? If so, in what ways am I going about it wrongly thusfar?


Hey all,  CUDA error: Out of memory in mem_alloc_result, line 850  I'm unable to render a model I quickly put together (Is it considered simple?) When I attempt to render the scene, my system will completely crash/lock up or blender will force quit.  I'm using blender 2.8 with cycles as my render. I have GPU + CPU selected underneath CUDA in the user prefs and am trying to render at 1080x1920.  My hardware specs: GeForce GTX 1070 8gb, 16gb ram, Intel i7-7700 @ 3.60ghz  I'm confused because I feel like my model is basic. I have a sunlight lamp and materials using only a diffuse.    Can anyone point me in the right direction on getting this solved? I've uploaded the blend file here if anyone would be kind enough to inspect what's going on. I'm new so I'm just trying to figure out if this is user error, or if I need a better computer!? Thank you so much! -K

Essentially, my problem is that i am trying to render a scene, however, blender crashes on me early during the render. I only have about 14 total objects in the scene. (It's not that complex) I tried to render a different blender file which was bigger than the one that i am having problems with, and the scene renders just fine. There is no difference in the render presets for both of these files. However, i still cannot render the other scene. It gets to preparing scene data, but then it crashes.  Thank you.


Inshort Surface tension occurs due to imbalance of the intermolecular forces of attraction on water molecules. At the surface it is more so net force is inwards.  I read somewhere on this app that "which liquid has zero surface tension". But is it possible to have zero surface tension, because surface tension occurs if there is surface but if surface tension is zero it means there is no surface. Which doesn't make sense.

Having read the Wikipedia page on  I'm still not sure if stuff like liquid helium at the lambda point actually have surface tension or not. Is superfluidity the same thing? And are there any liquids with no surface tension at room temperature?


How to create table with existing table structure without iterate row by row like this in Oracle? Thanks in Advance.  CREATE TABLE new_table   AS (SELECT *       FROM old_table WHERE 1=2);

I know the statement:  create table xyz_new as select * from xyz;   Which copies the structure and the data, but what if I just want the structure?


Consider the series:  $$\sum_{i = 1}^{\infty}\frac{1}{\mathrm{Prime}(i)^{\mathrm{Prime}(i)}}$$ where Prime(i) denotes the i-th prime.  Proving the convergence of this series is trivial but finding the value to which converges has defied me so far. Mathematica says this series converges to ≈0.287358.  I tried Googling about this series and found very little information about this series.  My questions are:  What does this series converge to? Does this series arise in any context and are there interesting trivia to be known about this series? Is it irrational, transcendental? Does it have a name?

A very simple question, but I can't seem to find anything relating to it :  Is there any research, are there any results that have focused on or given insight on   $\sum 1/p^p$, ${p \in \mathbb P}$ ?  A very basic series, converges extremely fast, its value is around .29. What more can there be said about it ?  From what little I know about more advanced number theory, similar sequences (I can think of a few similar ones that I can't find any relevant research or results about) can be very non-trivial to compute or to analyse.


I have a couple of Ubuntu 14.04 64 bit boxes. One of them can talk to internet (say Machine1) and the other can not due to network restrictions (say Machine2).  Machine 2 needs some specific software to be installed, for example I may need to install google-chrome (just as an example) on this machine.  What I tried is to create a /localrepo/amd64 diretory on Machine 1. Downloaded the stable .deb package and put it in this /localrepo/amd64 directory.  This directory has a link symbolic link at /var/www/html, so the machine at least over local network can access this directory.  I ran dpkg-scanpackages amd64 | gzip -9c > amd64/Packages.gz that generated a Packages.gz file.  On the Machine1 I edit the sources.list file to add   http://Machine2FQDN/localrepo amd64/   I comment out all other lines that were trying to point to various ubuntu repos.  I do an apt-get update and then try to install the package, I got a dependency issue.  Now, my question is if I want all the dependencies for the .deb file to be downloaded at Machine1 localrepo diractory what is the way for it.  I have seen answers like run the apt-get install -f, which does not work in my case, I can not allow Machine 2 to talk to ubuntu repos directly and resolve dependencies via apt-get. I do not need every single package in cache to be copied to this local repo, I need only the specific associated dependency packages to get downloaded (not installed) when I download a package through a single command.  Do we have a solution for that?  Please let me know if you need any further information.  Note: I know running apt-cache depends google-chrome-stable lists the dependencies, but I need those dependencies to be downloaded to my own custom folder /localrepo/

I have a friend who has got a computer that is not connected to the Internet. Is there any way to install software offline easily?


I am confused as to what really a function is ?    Is a function the steps by which we get the output from an input ?   Or is it the name of the process by which we get the output from an input ?

I have been quite confused by the definition of functions and their uses.. First of all can one define functions in a clear understandable way, with a clear explanation of their uses, how they work and what they do?  Also I have some specific questions regarding functions Let me give you a examples:   $y = f(x) \rightarrow$ This is one of the main reasons I have difficulties understanding functions... What does the above statement tell me, and if $y$ is a function why do we use $y=$ at all for a formula like $y = mx + b$ would it be the same as writing $f(x) = mx + b$?   Something like $y = x^2$ is apparently a function...... but where is the function name? Which is the input and which is the output? Lastly another example : Let me suppose $f =$ distance                         $f(t) = t^2$                         $f(2) = 4 \rightarrow$ Does this mean distance is $4$.. which is the input which is the output?   Mainly what I'm looking for in an answer is a clear and 'easy' explanation with examples to help me understand this new topic


I'm using the glossaries package to define a list of acronyms, and I cannot get the .idx and .ind files to write themselves. This is my MWE:  %!TEX TS-program = xelatex %!TEX encoding = UTF-8 Unicode \documentclass[12pt,oneside]{book} \usepackage{makeidx} \usepackage[french]{babel} \usepackage{fontspec,xltxtra,xunicode} \usepackage{hyperref} \usepackage[nonumberlist,acronym]{glossaries} \newacronym{np}{\textsc{np}}{nom propre} \makeglossaries \makeindex  \begin{document} \printglossary[title=Abréviations dans les gloses morphosyntaxiques,type=acronym,nopostdot]  Il s'agit d'un \acrshort{np}.  \tableofcontents \end{document}   And here is what I get on the console log when, after compiling to pdf a first time, I run MakeIndex:  This is makeindex, version 2.15 [TeX Live 2016] (kpathsea + Thai support). Scanning input file myDoc.idx...done (0 entries accepted, 0 rejected). Nothing written in myDoc.ind. Transcript written in myDoc.ilg.   That means that when compiling a second time, the glossary won't print. I tried using \makenoidxglossaries and \printnoidxglossary, but this brings another problem (not on this MWE) that I'll address another time.

I am copying the very first piece of code from  in order to create a glossary. While I get no problem in the compilation I do not get the "glossary part" that appears in the example. I literally copy paste.  Also, I want to create a document that only consists of a glossary of various terms. That is to put everything in alphabetical order (with the possibility to include references as well). How could I possibly do this? I tried some itemize options with alphabetical order but does not look that good.


I am wondering why some websites have a / at the end of their URL, but others don't.  For example:   www.google.com/ but then www.khanacademy.org (No /)

My home page could be potentially linked as:  http://example.com http://example.com/ http://example.com/?ref=1 http://example.com/index.html http://example.com/index.html?ref=2  (the same page is served for all those URLs)   I am thinking about defining a canonical URL to make sure Google doesn't consider those urls to be different pages:  <link rel="canonical" href="/" /> (relative) <link rel="canonical" href="http://example.com/" /> (trailing slash) <link rel="canonical" href="http://example.com" /> (no trailing slash)   Which one should be used? I would just slap / but messing with canonical seems like a scary business so I wanted double check first.  Is it a good idea at all for defining a canonical URL for a home page?


I came across this question and I was unable to solve it. I know a bit about integrating linear functions, but I don't know how to integrate when two functions are divided. Please explain. I'm new to calculus.   Question: $$\int \frac{e^x}{e^{2x} + 1}dx$$  Thanks in advance.

Ok, I give up, I have tried with $u$-substitution and integration by parts but I can't solve it. The integral is:  $$\int{\frac{e^x dx}{1+e^{2x}}}$$  I have tried $u=e^x$, $u=e^{2x}$ and also integration by parts but I can't solve it. The result should be:  $$\arctan(e^x)$$


I’ve circled the icon in red. What is this notification/alert for?

I'm concerned about an app on my child's phone. I saw an app icon in the notification area that looked strange (Andy Android head, slightly tilted as its icon).  How can I find out what app it is from just having seen that icon in the notification bar?


My school was giving away old broken Dell Optiplex 745s away, so after working on it for a few days, I got it to work. But when I turned it on, it was still connected to the schools domain. So when I tried to change the password, there was no password to change. I've tried many things, but to no avail.

I got a brand new Windows 7 machine, installed the operating system, created one account and forgot its password. What can I do?  There is no external CD, the operating system is loaded from somewhere inside the machine.  I already tried to remember passwords and tried all candidates with all possible combinations of caps lock, num lock etc.


I set a custom $PATH in ~/.bashrc with PATH=$HOME/.bin:$PATH. When I launch the  from the terminal it is able to find my custom build tools that are located in $HOME/.bin. When I launch Geany with an XFCE launcher, it doesn't pick up the custom path and my custom build tools do not work. Is it possible to set a custom path such that the launcher will pick it up? I would prefer not to have to create a custom .desktop file.  While  would provide an answer if I knew what shell, and how that shell is started, is used when I use a shortcut to start a program. Presumably, it is not an interactive bash shell or else .bashrc would be sourced.

Is ~/.bashrc  the only place to specify user specific environment variables, aliases, modifications to PATH variable, etc?  I ask because it seems that ~/.bashrc seems to be bash-only, but other shells exist too…


I hope i'll be able to explain this well, so pls bear with me... Firstly, I got Ubuntu 12.4 I forgot the password for my admin account, so i changed it in thhe grub- in recovery mode. after i've been able to access only the guest account, where at least i changed the option login withou passwd for my admin account (obviously at this point the passwd worked since for changing this option u need sudo privileges) However, i still couldnt log in into my master account- when i click on login on startup, the page goes black, then comes back to the same point where u select users. i tried many different options- probably messed it up too! but I am not able to even use the password again in the guest account. Im totally logged out, pls help.  note that a solution without using a dvd/bootable usb to fix grub/linux would be much more preferred! Since Im travelling in remote areas :p

I'm working on a Ubuntu system, and my client has completely forgotten his administrative password. He doesn't even remember entering one; however it is there.  I've tried the suggestions on the website, and I have been unsuccessful in deleting the password so that I can download applets required for running some files. Is there a solution?


I've been trying to solve explicitly the following indefinite integral:  $$\int\frac{dx}{x(x+1)(x+2)\cdot\space...\space\cdot(x+n)}$$  I tried to perform partial fraction decomposition, and after substituting some natural n's, I figured the Binomial Theorem might help here, but I couldn't figure out how to use it.   Thank you and have a good day/night!

I try to find a partial fraction expansion of $\dfrac{1}{\prod_{k=0}^n (x+k)}$ (to calculate its integral). After checking some values of $n$, I noticed that it seems to be true that $\dfrac{n!}{\prod_{k=0}^n (x+k)}=\sum_{k=0}^n\dfrac{(-1)^k{n \choose k}}{x+k}$. However, I can't think of a way to prove it. Can somebody please help me?


Duh!  But, do the books ever describe what he actually looks like? I found a diagram by Tolkien himself:  But this looks too... vague? And I don't know whether he was ever intent on continuing with this one as the official look for the great villain. I just started reading Fellowship, completed half of it, when I was informed that everything in the movies is not accurately modelled after the book. And I know for a fact that the fiery eye was just imagined by Peter Jackson for the movies. So, is the Sauron seen in the movie a correct description? Is there a description at all? And if there is, how do the books describe Sauron?

During the time frame of the Lord of the Rings, was the Eye of Sauron Sauron's actual physical form? If not, what form did he have?


Basically if I call wp_editor via ajax it acts funny, I noticed it does not include 2 scripts it DOES include if i call it normally within a form (NOT thru ajax). I found some anwers like tinemce needs to be reinitialized and whatnot so that WP would call again the necessary scripts, but I can't figure it out.  My ajax call:  $.ajax({             type: "POST",             async: true,             url: vkrwps_admin.ajax_url,             data: {                 action: 'EDIT_PROD',                 sv: sv,                 preload: vkrwps_admin.preloader             },             cache: false,             beforeSend: function() {                 $('div.mule').html(u);             },             success: function(response){                 var r = (new Date()).getTime();                  $('div.mule').html(response).find('img').prop('src', function(_, src) {                      return src + '?v=' + r;                 });                 // call chosen on select                 $('select').chosen({                     // placeholder_text: "Choose a product..."                     'disable_search': true                 });                   // $('select.dropsearch').val(4).trigger('change');             },             complete: function() {                 // $('select.dropsearch').one().val(cf).trigger('change');             }         });   From what I found here:  I tried putting the following on top of my script that has the ajax call in it:  $.fn.tinymce_textareas = function(){   tinyMCE.init({     skin : "wp_theme"     // other options here   }); };   and then I changed my success to:  $('div.mule').html(response).tinymce_textareas();   But then I  get an error:  ReferenceError: tinyMCE is not defined   How do I make WP call the necessary scripts?

Once a page has loaded, how do I create a TinyMCE editor?  Putting a wp_editor call in an AJAX request then displaying it gives this:    Visual and text tabs are nonfunctional, no toolbar, no active TinyMCE instance, just the html markup. I need to instantiate the JS component of TinyMCE, but how?  I've also tried making a call in my AJAX response PHP to _WP_Editors::editor_js();, and I can see the response in the console using console.log and I see the JS script there, but it is not inserted into the DOM and it is never executed


I am trying to install a 60 amp sub panel in my house to power my wife's saltwater tanks. I know I need 6/3 to go from main panel to sub panel. My question is I have to run it along the wall to get to the ceiling then down the wall to get to sub panel. What type of wire and do I need conduit? The sub panel will be just outside the backdoor under the porch. Coming out of main panel the wire will be exposed upto ceiling then over about 2 feet at which time will go into ceiling. Then will come out porch ceiling outback into the sub panel. Project is on hold to I can get clarification.


For example, to find the partitions of 7, I wouldn't need to like do trial and error kind of thing and have to constantly check whether I have already got such a partition, miss out on some combinations and all that of confusion. So any simple method to do this without much head-scratching?  I'm not talking about the number of partitions btw, just the partitions themselves like 1+1+1, 2+1, 3.

Is there a way to get all possible partitions of an integer? Possibly specifying max and/or min summand. I'm interested in partitions themselves, not just partition count.


I made an application for taxi service with PHP and MySQL. And I use PDO for connecting. I setup an admin panel and I wrote a delete query for delete unwanted price records according to its priceid. But nowadays I lost all price data(Table become empty) sometimes without any action from Admin. Please check my delete query page code below. Thank you for your time.  ob_start(); include 'inc/database.php'; include 'inc/header.php';  if (isset($_GET['getid'])) {     $getId = $user -> cleaninput($_GET['getid']); } else {     header("Location:prices.php"); }  if (!empty($getId) && is_numeric($getId)) {     $adData = $DB_con->prepare("DELETE FROM price_data WHERE price_ID=".$getId." LIMIT 1");     $adData -> execute();     header("Location:prices.php"); } else {     header("Location:prices.php"); }

From what I can gather, there are three categories:   Never use GET and use POST Never use POST and use GET It doesn't matter which one you use.   Am I correct in assuming those three cases? If so, what are some examples from each case?


I just read  post (and these too - , ) answering how does Jon Skeet get above 200 reps a day. I was just curious to know how much Jon Skeet's reputation would be by now (14 March 2015) without the 200 reputation limit.  How much would be the reputation of others in the highest reputation section. How large would be the gap?

Just curious about this, but how much rep would he currently have if there was no daily rep cap of 200?


My apologies if this is a basic question. In Latex, is it possible to set text in a triangular shape, as was often done at the end of chapters in Early Modern typography? I imagine it would be easy for a package to do. For an example of what I'd like to do, see this page from the Book of Common Prayer:

is it possible to wrap a text inside a triangle like the following image?


I want to prove that $\lvert G\rvert=24$, then it has a non-trivial normal subgroup.  Here is my attempt:  $n_2$: number of 2-Sylow subgroup; $n_3$: number of 3-Sylow subgroup.  $n_2\in\{1,3\},\:\:n_3\in\{1,4\}$ by Sylow's Theorem.  Suposse $n_2=3$, $n_3=4$.  $n_3=4$ means there are 4 Sylow subgroups of order 3, which means 8 elements of order 3.  $n_2=3$ means there are 3 Sylow subgroups of order 8. Suppose $P_1,P_2,P_3$. Using $\lvert P_1P_2\rvert\leq 24$, then $2<\lvert P_1\cap P_2\rvert <8$, so it is 4.  Suppose $P_1=\{1,a_1,\ldots,a_7\}$.  $\lvert P_1\cap P_2\rvert=4 \Longrightarrow P_2=\{1,a_1,a_2,a_3,b_1,b_2,b_3,b_4\}$ for example.  $\lvert P_1\cap P_3\rvert=4$ and $\lvert P_3\cap P_2\rvert=4$ $\Longrightarrow P_3=\{1,a_7,a_6,a_5,b_1,b_2,b_3,c\}$ for example.  Then we have 12 different elements of even order.  Adding we get 21 different elements.

Let $G$ be a group of order 24, and we shall assume there there exist a non-normal 2-sylow group in $G$. i want to show that it's not simple.  first i have showed that there are exactly three 2-sylow group's.   and now i am trying to show that there is a non trivial homomorphism from $G$ to $S_3$. i know that $S_3\cong D_3$  and indeed there are three 2-sylow groups in $D_3$ , the reflection's. and there is one $3-$sylow group in $D_3$  so i wanted to creat a homomorphism that take the different p-sylow groups in $G$  and set them in right $p-$sylow group's in $D_3$  but for that i need to show that the intersection of every two $2-$sylow gouts in $G$  is trivial. and i can't manage to do that....


So I was using Tasksel to install the MATE desktop env to try it out as an alternative to GNOME.  After that lengthy installation of MATE, MATE itself worked, but when using GNOME again, GNOME slowly started failing. Mostly using the Desktop Links of Nautilus, which broke. Nautilus only worked when started from the terminal and leaving that open.   This started days ago and I tried reinstalling Nautilus and its depending packages several times. No avail. Uninstalled Caja as I thought it may interfere.   Today I booted into recovery mode and used tasksel there inside GUI mode in a Terminal, still not sure how I got into GNOME from recovery mode...  It listed MATE as U but uninstalled ubuntu-mate-desktop anyway.   After a while, I noticed Symbols vanish, fonts being missing, etc until all I was left was the wallpaper.  After reboot, it went straight into shell.   How do I get back into GNOME, when tasksel just apparently uninstalled the whole system? I can't use APT there, the network seems missing.   Tools like the initramfs thing are missing for some unknown reason too.   Oh, I am... Well was... Using Ubuntu 18.04 latest updates.   How can I recover my system? Was tasksel always this volatile?

I tried to remove samba-server with this command (sudo tasksel remove samba-server) and every app even the system apps are deleted and now xubuntu is stuck at boot, just showing loading. What should I do?  Did tasksel deleted my files too?


I have looked on the Internet but there are no updated answers. I am using ArcMap 10.2. I am trying to print the route resolved by network analyst but there is no way I can display overlapped generated route when printed.    This is an example where the encircled section is passed through three times. Please help with how I can show them separately.

Some common problems with displaying routes created from street data, such as bus routes, include:   Routes may overlap themselves, such as when a route takes the same road in opposite directions Routes may overlap other routes that take the same street. Routes are often overly detailed, or "noisy", owing to their derivation from street data. Indicating a route's direction unambiguously without overloading it with arrows can be a challenge.   What are some techniques for dealing with these issues in order to create a practical and usable route map, such as this ? Do you know of any such public transport maps that were produced by automatic techniques rather than manual illustration/digitization?  Specifically I am using ArcGIS 10, but solutions involving other software are welcome as well.  One technique I have had some success with for dealing with 1) is using ArcMap's  with a negative offset -- assuming the lines are oriented in the direction of travel, this will offset the lines such that the right and left-hand sides are distinct and oriented as you would expect (at least for  countries, for left-hand traffic countries one would use a positive offset). However the result tends to be a bit wonky around turns, interchanges and and U-turns, and is inflexible when dealing with multiple routes.  Another possibility that I am not very familiar with but which seems promising is  -- however, I have not had much luck in finding examples of using representations for transportation maps and whether it might fit the bill.


The following question might be a duplicate of . If so, feel free to close it. But I ask because it's not clear to me whether it's a duplicate question or not. Sometimes I see a question or answer by a user which I like so much, I wander over to the user's page and scroll through their other questions / answers to see what else they've written. I click on the ones that look interesting and read them, and from time to time I upvote or (more rarely) downvote a question / answer which I find deserving. In practice, it's unusual for me to vote on more than 2-3 questions / answers from a single user in a session of doing this. Once I've visited a user's page in this way, it's unlikely that I'll ever return to their user page, and especially unlikely that I'll return to their page within the next few months. The intention of the whole business is not to give the user "extra rep", subverting the bounty system, nor to punish the user with spurious downvotes, but simply to expose myself to some of a good user's work on Stack Exchange. Now, I'm pretty sure that this behavior is  entirely  borderline appropriate on any Stack Exchange site. That is, there's some line between the kind of behavior I've described and vote manipulation, and I'm pretty sure that what I've described is  well  on the acceptable side. I imagine the actual threshold for vote manipulation is  well  slightly above the level of voting I've described. Question: Is there anything else to be said about the kind of behavior I've described in the context of avoiding vote manipulation? I understand that the voting fraud detection system never automatically punishes a user beyond reversing inappropriate votes -- any punishment for voting fraud is manual and would presumably only come about if there were a repeated problem, with ample warning and clarification on what's appropriate. I also understand the value in not being too precise publicly about what counts as "appropriate" and what doesn't to avoid the scenario of somebody trying to game the system and fly just barely under the radar in a vote manipulation campaign. So I'm perfectly happy with the answer to my question being "No, just use your best judgment and don't be stupid; if it ever becomes a problem we'll talk about it then". I just thought I'd ask in case there is more to be said.

Why is it wrong to serial voteup someone you like his answers?  Sometimes I just came to stackoverflow to read certain people answers(there are 4 guys currently) I have their profile bookmarked in my browser and in my free time at office I go to their profile and read their answers and learn a lot from them, but because I'm afraid to be a serial voter, I dont voteup them.   I think there is nothing wrong with that, if there is, please let me know.


I have multithread readers/writers that use shared collection.  foreach (var account in accounts) {   ThreadPool.QueueUserWorkItem(o => Execute(account)); }   in Execute Method I read static Dictionary, get first record where value is null and block it.  do {   if (collection.Any(x => x.Value == null))       {           var wall = collection.First(x => x.Value == null).Key;           collection[wall] = 0; //block           //Do something           Console.Write(wall);           collection[wall] = result;       }  } while (collection.Any(x => x.Value == null));   In result in console I get all walls that thread visited:  thread 1 : ABDFH  thread 2 : ACEFG  I read , but BlockingCollection using to block unsafety add or delete element, how to thread-safety change collection? I use .NET 4.0.

I was able to implement a thread-safe Dictionary in C# by deriving from IDictionary and defining a private SyncRoot object:  public class SafeDictionary<TKey, TValue>: IDictionary<TKey, TValue> {     private readonly object syncRoot = new object();     private Dictionary<TKey, TValue> d = new Dictionary<TKey, TValue>();      public object SyncRoot     {         get { return syncRoot; }     }       public void Add(TKey key, TValue value)     {         lock (syncRoot)         {             d.Add(key, value);         }     }      // more IDictionary members... }   I then lock on this SyncRoot object throughout my consumers (multiple threads):  Example:  lock (m_MySharedDictionary.SyncRoot) {     m_MySharedDictionary.Add(...); }   I was able to make it work, but this resulted in some ugly code.  My question is, is there a better, more elegant way of implementing a thread-safe Dictionary?


How to write test case for below method  Custom Object  : SAM_Request__c Global Variable :crossChargeInfoSetFlag , samAdminFlag , samTeamFlag  boolean crossChargeInfoSetFlagMethod(SAM_Request__c requestRecord)     {          if(requestRecord.txt_Request_Type_for_UI__c == 'Project' && (requestRecord.pkl_Status__c == SAM_Constants.QUOTE_APPROVED  || requestRecord.pkl_Status__c == SAM_Constants.CHARGING_REJECTED  || requestRecord.pkl_Status__c ==  SAM_Constants.AWAITING_CC_DETAILS_PENDINGWITHULSAM )){              if(requestorFlag && !samAdminFlag && !samTeamFlag){                 crossChargeInfoSetFlag =false;             }else if(financeTeamFlag && !samAdminFlag && !samTeamFlag){                 crossChargeInfoSetFlag = false;             }else if((requestRecord.lkp_Assign_To__c !=null) && (samTeamFlag && requestRecord.lkp_Assign_To__c == userinfo.getuserid())){                  crossChargeInfoSetFlag = true;             }else if(samAdminFlag ){                  crossChargeInfoSetFlag = true;             }         }       return crossChargeInfoSetFlag;     }   Kindly help.

This is a canonical question and answer developed by the community to help address common questions. If you've been directed here, or your question has been closed as a duplicate, please look through the resources here and use them to shape more specific questions. To browse all canonical questions and answers, including more unit test resources, navigate to the  tag.  This canonical question is intended to address several classes of common questions by providing a quick summary and links to comprehensive resources:   How do I start writing my first unit test?  How do I unit test this code?  I need help writing this unit test.   Salesforce Stack Exchange looks for detailed, specific questions that the community can help you with, and can't write tests on your behalf. We feel that working with the resources below can help you get started, and we encourage you to make an attempt to write your test and return to SFSE with your specific questions when you encounter challenges you can't resolve.


So I have a regex pattern:  no = 'C 030234(A) ZMM'  pattern = '\d{1,2}(\s*)' + no   What I need to do is add a backslash before the ')' and '(' characters in the variable, no, to make the literals.   I tried something like  tList = [] for c in no:   if np.logical_or(c=='(',c==')'):     tList.append('\\'+c)   else:     tList.append(c)   no = "".join(tList) pattern = '\d{1,2}(\s*) ' + no   But this yields a regex pattern of   '\d{1,2}(\s*)C 030234\\(A\\) ZMM'   I need to find away to any string in the form of no, and add a escape character before any parenthesis to make the proper regex pattern  '\d{1,2}(\s*)C 030234\(A\) ZMM'

I want to use input from a user as a regex pattern for a search over some text.  It works, but how I can handle cases where user puts characters that have meaning in regex? For example, the user wants to search for Word (s): regex engine will take the (s) as a group.  I want it to treat it like a string "(s)" .  I can run replace on user input and replace the ( with \( and the ) with \) but the problem is I will need to do replace for every possible regex symbol. Do you know some better way ?


I tried to install jessyink in ubuntu doing the following:  sudo add-apt-repository ppa:jessyink-team/ppa   then update  sudo add-apt-repository ppa:jessyink-team/ppa   finally:  sudo apt-get install jessyink   but the following error is showed:     E: Unable to locate package jessyink   I'm in lubuntu 16

When I try to install any package through the command line, I get an error.   $ sudo apt-get install <package> Reading package lists... Done Building dependency tree        Reading state information... Done E: Unable to locate package <package>   Can anyone help me on this?


Show that for all $x \in (0, \frac\pi2)$ the inequality $1-\cos(x) <\frac{x^2}{2}$ holds.   Setting $f(x) = \frac{x^2}{2}+\cos(x)-1$ and differentiating it results in $f'(x)=x-\sin(x)$.  Differentiating the function once more we get $f''(x)=1-\cos(x) \geqslant 0$, since $-1 \leqslant \cos(x) \leqslant 1$.  So we know that $f'$ is strictly increasing. My question is, how should we continue from here?

In  answer the value of $1 - \cos(x)$ has to be evaluated in order to find its upper limit, if it exists.  In particular, $x = 2 \pi / n$. The answer is related to the length of a side of a regular $n$-gon inscribed into a unit-radius circumference; because the perimeter of the $n$-gon is always less than $2 \pi$, the single side must always be less than $2 \pi / n$.  The inequality  $$1 - \cos (x) \leq \displaystyle \frac{x^2}{2}$$ (1)  is used and the proof is completed with   $$2(1 - \cos(x)) \leq (2 \pi / n)^2$$  $$\sqrt{2(1 - \cos(x))} \leq 2 \pi / n$$  But it is well known that the cosine is a function $f(x) \in [-1;1]$, so $1 - \cos (x) \in [0,2]$. By using this information, we would obtain  $$1 - \cos (x) \leq 2$$ (2)  The proof would provide  $$2(1 - \cos(x)) \leq 4$$  $$\sqrt{2(1 - \cos(x))} \leq 2$$  which is a completely different result.   Why in that case it is preferable to use (1) instead of (2)? How to choose when it is convenient to use (1) and when to use (2) in a proof?


This question is specific to dwellers who are out exploring the wasteland. Not in production rooms.  I am aware that in the wasteland, dwellers who have Endurance over 10(by equipping an outfit which increases Endurance on top of having full(10) Endurance) will not suffer radiation damage.  My question is, do any of the other Special stats also have benefits if they are over 10? I have not noticed anything but I may very well have missed something.

Besides its workplace uses, like Charisma in Living Quarters, Strength in Power Generators, Agility in Diners.   Do we know if Endurance increases HP in the Dwellers, or that strength helps in melee damage / survivability in the wastelands? And Perception?


I have defined a singleton as below:  struct Conditions {     bool bMonolithic;     bool bKeepVersion;     bool bToc;      static Conditions& initialize() {         if (instance == nullptr)             instance = new Conditions;         return *instance;     } private:      Conditions():bMonolithic(false), bKeepVersion(false), bToc(false) {}     static Conditions* instance; };   When I try to use it, I call the initialize() function:  Conditions& kcondition = Conditions::initialize();   However, the compiler gives me this error:  error LNK2001: unresolved external symbol "private: static struct Conditions * Conditions::instance" (?instance@Conditions@@0PEAU1@EA)   What is the correct way to use the singleton?

Very simply put:  I have a class that consists mostly of static public members, so I can group similar functions together that still have to be called from other classes/functions.  Anyway, I have defined two static unsigned char variables in my class public scope, when I try to modify these values in the same class' constructor, I am getting an "unresolved external symbol" error at compilation.  class test  { public:     static unsigned char X;     static unsigned char Y;      ...      test(); };  test::test()  {     X = 1;     Y = 2; }   I'm new to C++ so go easy on me. Why can't I do this?


Difference between inner and outer join. i am using two table and want to fetch data from both table so which type join we should use owning of that we can solve our problem

Also how do LEFT JOIN, RIGHT JOIN and FULL JOIN fit in?


got a problem when changing my appendix. The problem is that tex is producing two extra blank pages which I want to be removed.   Before the problem:  Main.tex  [...]  \begin{appendix}     \include{anhang/Apple1}     \include{anhang/Apple2}     \include{anhang/Apple3}     \include{anhang/Banana1}     \include{anhang/Banana2} \end{appendix}  [...]   Content of anhang/Apple1:  \includepdf[pages=1,scale=.8, offset= 0 -75,pagecommand={\chapter{blabla}\label{somelabel}}]{pdf/anything.pdf}   Content of anhang/Apple2:  \includepdf[pages=1,scale=.8, offset= 0 -75,pagecommand={\chapter{blabla2}\label{anotherlabel}}]{pdf/another.pdf}   and so on...  This worked fine. No extra pages were included. But when extending my work there was a few more appendix and I didn't want to get a new entry for every single page. So I decided to change the appendix to:  [...]  \begin{appendix}     \include{anhang/Apple}     \include{anhang/Banana} \end{appendix}  [...]   Content of anhang/Apple:  \chapter{Apple}  \includegraphics[width=15cm]{pdf/apple1.pdf} \includegraphics[width=15cm]{pdf/apple2.pdf} \includegraphics[width=15cm]{pdf/apple3.pdf}   same for banana. So hopefully you get my point. Tried to merge contents and not to have an extra appendix for every single pdf file. It looks okay this way but my problem is: TeX adds two extra blank pages BEFORE appendix A. If more information is needed please ask.  Anyone have some advice please? Thanks.

I am using pdfpages which works quite well.  But this time, I want to include a 5 page pdf and the first page should be scaled down a bit such that above the first page is enough space for a subsection (in the LaTeX document).  Using just  \usepackage{pdfpages} ...  \subsection{Interesting Letter} \includepdf{letter.pdf}   does not work, because includepdf inserts a newpage command before the first page.  I looked at the pdfpages manual but could not find options relating to that.  I hacked this command, which kind of works:  \newcommand{\insertrep}[1]{% \hspace*{-2.4cm} \fbox{\includegraphics[page=1,scale=0.8]{#1}} \includepdf[scale=0.8,pages=2-,frame]{#1} }  \subsection{Interesting Letter} \insertrep{letter.pdf}   The subsection is printed on the same page as the first page of the pdf, but an empty page is inserted before the section ...  The empty page vanishes if I scale the first page to 0.5 - which is too small ...  It seems that \includegraphics inserts an empty page before the graphic, if the inserted graphic violates the margins of the page.  Besides, the hspace value does not always fit.  Thus, my question: How to solve this right?


Assume I have a string like this:  "a-b-c-d"   n = 4 sequences seperated by "-".   Now I want to receive the first n - 1 sequences ("a-b-c") and the last sequence - ("d").  I can achieve this with the following code:  std::string string{ "a-b-c-d" };  std::regex reg{ "^(.*)-(.*)$" };  std::smatch match; std::regex_match(string, match, reg);  std::cout << match.str(1) << '\n'; std::cout << match.str(2) << '\n';   producing the excpected output:  a-b-c d     However, following the pure logical grammar of this regex ("^(.*)-(.*)$")  a b-c-d   or  a-b c-d   could also be valid matches of the string. Afterall (.*) could be interpreted differently here and the first (.*) could decide to stop at the first character sequence or the second etc.  So my question: is std::smatch guaranteed to behave this way? Does std::smatch always explicitly look for the last patterns when giving the option to capture with (.*)? Is there a way to tell std::smatch to look for the first occurrence rather than the last?

I have this gigantic ugly string: J0000000: Transaction A0001401 started on 8/22/2008 9:49:29 AM J0000010: Project name: E:\foo.pf J0000011: Job name: MBiek Direct Mail Test J0000020: Document 1 - Completed successfully  I'm trying to extract pieces from it using regex. In this case, I want to grab everything after Project Name up to the part where it says J0000011: (the 11 is going to be a different number every time). Here's the regex I've been playing with: Project name:\s+(.*)\s+J[0-9]{7}:  The problem is that it doesn't stop until it hits the J0000020: at the end. How do I make the regex stop at the first occurrence of J[0-9]{7}?


I've the follwing enum:  public enum eFlexCreateMode {     Man = 0,     Auto = 1 }   which I convert into a dictionary in order to use inside my wpf page (binded as combobox)  Dictionary<int, string> EnumCreateMode = Enum.GetValues(typeof(eFlexCreateMode)).Cast<eFlexCreateMode>().ToDictionary(t => (int)t, t => t.ToString());  <ComboBox Grid.Column="10" Width="70" ItemsSource="{Binding Path=EnumCreateMode, RelativeSource={RelativeSource Mode=FindAncestor, AncestorType=local:ViewerFlexConfig}}" SelectionChanged="Combo_SelectionChanged" DisplayMemberPath="Value" SelectedValuePath="Value" SelectedValue="{Binding ConfigObject.Create_Mode, Mode=TwoWay, UpdateSourceTrigger=PropertyChanged}" />   Now I put the summary tag of each items of my enum and I would use it as tooltip for my combobox. Is it possible to achieve a task like this? There's no doc available

As an example take the following code:  public enum ExampleEnum { FooBar, BarFoo }  public class ExampleClass : INotifyPropertyChanged {     private ExampleEnum example;      public ExampleEnum ExampleProperty      { get { return example; } { /* set and notify */; } } }   I want a to databind the property ExampleProperty to a ComboBox, so that it shows the options "FooBar" and "BarFoo" and works in mode TwoWay. Optimally I want my ComboBox definition to look something like this:  <ComboBox ItemsSource="What goes here?" SelectedItem="{Binding Path=ExampleProperty}" />   Currently I have handlers for the ComboBox.SelectionChanged and ExampleClass.PropertyChanged events installed in my Window where I do the binding manually.  Is there a better or some kind of canonical way? Would you usually use Converters and how would you populate the ComboBox with the right values? I don't even want to get started with i18n right now.  Edit  So one question was answered: How do I populate the ComboBox with the right values.  Retrieve Enum values as a list of strings via an ObjectDataProvider from the static Enum.GetValues method:  <Window.Resources>     <ObjectDataProvider MethodName="GetValues"         ObjectType="{x:Type sys:Enum}"         x:Key="ExampleEnumValues">         <ObjectDataProvider.MethodParameters>             <x:Type TypeName="ExampleEnum" />         </ObjectDataProvider.MethodParameters>     </ObjectDataProvider> </Window.Resources>   This I can use as an ItemsSource for my ComboBox:  <ComboBox ItemsSource="{Binding Source={StaticResource ExampleEnumValues}}"/>


on my PC and can't get rid of it so I thought of blocking its executable(s) from running. For the latter, I found  on How-To Geek; this describes how to create a blacklist of executables that will not be allowed to run. Unfortunately, the program's executable name contains a random number/date, meaning that it cannot be referred to using a static name such as Notepad.exe since it changes every time. I thought of writing some kind of regular expression matching all executables that start with Shell&ServicesEngine and end with .exe for the blocking. How do you do it though? Note that I appreciate as well if you know how to properly solve this malware problem.

What should I do if my Windows computer seems to be infected with a virus or malware?  What are the symptoms of an infection? What should I do after noticing an infection? What can I do to get rid of it? how to prevent from infection by malware?   This question comes up frequently, and the suggested solutions are usually the same. This community wiki is an attempt to serve as the definitive, most comprehensive answer possible. Feel free to add your contributions via edits.


I want to use a command to copy the entire contents of a folder (including subfolders) to a different drive.  For example:  robocopy c:\evernote\ e:\evernote\<datestamp>\   where <datestamp> is a new folder whose name represents the current date in this format:  2018_05_21   So, the target "evernote" folder will contain a series of subfolders, one folder for each date. Each subfolder will contain the files that were copied from source to target on that date.  For me, I don't think it matters if the command is copy, robocopy, xcopy, or whatever. However, I believe that robocopy is most up-to-date, and therefore most likely to be of future use to me.  BTW: To keep this simple, there's no need to allow for different time zones, and no need for "automation" - I will run the BAT file myself, and add automation later.  Thanks.

Update: Now that it's 2016 I'd use PowerShell for this unless there's a really compelling backwards-compatible reason for it, particularly because of the regional settings issue with using date. See @npocmaka's     What's a Windows command line statement(s) I can use to get the current datetime in a format that I can put into a filename?  I want to have a .bat file that zips up a directory into an archive with the current date and time as part of the name, for example, Code_2008-10-14_2257.zip. Is there any easy way I can do this, independent of the regional settings of the machine?  I don't really mind about the date format, ideally it'd be yyyy-mm-dd, but anything simple is fine.  So far I've got this, which on my machine gives me Tue_10_14_2008_230050_91:  rem Get the datetime in a format that can go in a filename. set _my_datetime=%date%_%time% set _my_datetime=%_my_datetime: =_% set _my_datetime=%_my_datetime::=% set _my_datetime=%_my_datetime:/=_% set _my_datetime=%_my_datetime:.=_%  rem Now use the timestamp by in a new ZIP file name. "d:\Program Files\7-Zip\7z.exe" a -r Code_%_my_datetime%.zip Code   I can live with this, but it seems a bit clunky. Ideally it'd be briefer and have the format mentioned earlier.  I'm using Windows Server 2003 and Windows XP Professional. I don't want to install additional utilities to achieve this (although I realise there are some that will do nice date formatting).