linq expressions is to complex for me when i need to do complex searches over list.  let's say i have List  public class Object {     var length;     var height;     var depth; }   How to filter objects id by max length, if there are more than one index, then filter by max width, if there are more than one index, then filter by   max depth, if there more then one index return first one.   i found max values:   float maxWidth = boxes.Max(x => x.width); float maxHeight = boxes.Max(x => x.height); float maxDepth = boxes.Max(x => x.depth);   then i used for loop to get values. And it's ok, but after each loop i have to create another list to get another value and etc.  private GameObject largestSurfaceBox() {      //find max length.width, height box     float maxWidth = boxes.Max(x => x.GetComponent<Box>().dimensions.x);     List<GameObject> maxWidthBoxes = new List<GameObject>();      for (int i = 0; i < boxes.Count; i++) {         if (System.Math.Abs(boxes[i].GetComponent<Box>().dimensions.x - maxWidth) < float.Epsilon) {             maxWidthBoxes.Add(boxes[i]);         }     }      float maxHeight = maxWidthBoxes.Max(x => x.GetComponent<Box>().dimensions.y);     List<GameObject> maxHeightBoxes = new List<GameObject>();      for (int i = 0; i < maxWidthBoxes.Count; i++) {         if (System.Math.Abs(maxWidthBoxes[i].GetComponent<Box>().dimensions.y - maxHeight) < float.Epsilon) {             maxHeightBoxes.Add(boxes[i]);         }     }      List<GameObject> maxDepthBoxes = new List<GameObject>();     float maxDepth = maxHeightBoxes.Max(x => x.GetComponent<Box>().dimensions.z);      for (int i = 0; i < maxHeightBoxes.Count; i++) {         if (System.Math.Abs(maxHeightBoxes[i].GetComponent<Box>().dimensions.z - maxDepth) < float.Epsilon) {             maxDepthBoxes.Add(boxes[i]);         }     }      return maxDepthBoxes[0]; }   How to do that elegant linq way with if statements if possible?

I have two tables, movies and categories, and I get an ordered list by categoryID first and then by Name.  The movie table has three columns ID, Name and CategoryID. The category table has two columns ID and Name.  I tried something like the following, but it didn't work.  var movies = _db.Movies.OrderBy( m => { m.CategoryID, m.Name })


Can we define inner product on every vector space?  I don't know any example of any vector space that do not have any inner product .  Help me

Quick question: Can I define some inner product on any arbitrary vector space such that it becomes an inner product space? If yes, how can I prove this? If no, what would be a counter example? Thanks a lot in advance.


In "Harry Potter and the Prisoner of Azkaban" Harry and Hermione saved two lives (Sirius and Buckbeak). And in "The Order of Phoenix" Sirius died by Harry's fault. Why didn't Harry use The Time-Turner in that time to take him back again?

With the use of a time turner, that opens a whole "Pandora's Box" of possibilities.  While the use of one can be problematical, when the Ministry of Magic found out how dangerous Voldemort was, why didn't they simply use a time turner to go back and stop him before he became dangerous?  (I know this does open a lot of plot holes, but witches and wizards don't seem to worry about laws of science, so it would seem strange that magic that seems to easily supersede laws of physics (like brooms that fly without propulsion) would worry about the problematical issues of time travel.)


I have an arrayList with a bunch of strings in it. I also have another arrayList with a bunch of strings. I would like to see whether the first array list contains any string from the second arrayList and if so, just to print it out. Should be simple but it doesn't seems to work (and there are definitely strings in common).  Here is my code:   ArrayList<String> che=new ArrayList<String>();  for (int i = 1; i <= rsmd.getColumnCount(); i++) {      System.out.println("COL"+rsmd.getColumnName(i));      che.add(rsmd.getColumnName(i).trim());  }  String key = "";  String keys = "";  for (Entry<String, String> entry : map.entrySet()) {      key = entry.getKey().replace(":","")            .replace(">","MoreThan").replace("__","")            .replaceAll("\\." ,"").replaceAll("\\(s\\)" ,"")            .replaceAll(",$" ,"").replaceAll("%" ,"")            .replaceAll("\\(" ,"").replaceAll("\\)" ,"")            .replace("-" ,"").replace("-" ,"")            .replace("_" ,"").replace("#" ,"")            .replaceAll("\\/", "_").replaceAll("@", "AT")            .replaceAll("&", "AND").replaceAll("\\?", "AND")            .replace("≤","LessThan").replace("≥","MoreThan")            .replaceAll("\\s" ,"").replaceAll("^,","");        for (String n:che){          System.out.println("Che_String "+n);          System.out.println("KEY_String "+key);          if (n==key){              System.out.println("Detected the same: "+key.trim());          }      }  }   I know there are a lot of replaces and I should use StringUtils.repaceEach and I will do so but need to sort this first  The System.out.println output shows that there are several similar strings but they are not being picked up eg  Che_String Gender KEY_String Gender   But my Detected the same: output is empty.  I've also tried che.contains(key) with the same results.

I've been using the == operator in my program to compare all my strings so far. However, I ran into a bug, changed one of them into .equals() instead, and it fixed the bug.  Is == bad? When should it and should it not be used? What's the difference?


I have this simple question :     for an operator $T$ in a complex  Hilbert space we have:    $\langle u,Tu \rangle =0$ for all $u$ in this Hilbert space. So does this imply that $T=0$? If yes, how to prove it?

Suppose $T$ is a linear operator on a complex inner product space. Is it a theorem that if $\langle Tx,x\rangle=0$ for all $x$ in the space then $T=0$. The theorem fails in the real case, as seen for instance by rotation by $\pi/2$ on $\mathbb{R}^2$.  Is there anything deeper behind this fact, or can it mostly be looked at as a quirk of the conjugate-linearity of the complex inner product?  If anyone is interested in looking up this proof, it is theorem 9.2 in Roman's Linear Algebra, third edition.


I've setup a web server for production use. The OS is Windows Server, and it runs Apache 2.0 and PHP 5.3 as an apache module (and MySQL too...). It is used to host several virtual hosts (Apache vhosts) belonging to different customers.  At this point PHP is running as the system user. In the future FTP access might be granted to customers, so - by default - every customer would be able to access the whole system through PHP. That is obviously unacceptable.  I understand that I can set open_basedir in PHP, yet I am not sure if it is encompassing and solid enough to be considered a solution - does it limit access on all PHP functions, such as include...? How about PHP streams?  I also know that IIS offers a solution to that problem, but I prefer to keep Apache.  What I would ideally like to set up, is a solution that would fulfill the following requirements (mainly):   Be elegant and somehow automatic. I am manually managing the server - I want the setup of each vhost to involve the least amount of setup and configuration editing as possible. Allow for an exception. Most hosted websites are developed by myself, and I'd like to link all of them to a single library folder, so read-only access should be allowed to that folder although it would be outside the root of the vhost.   So, what are the options available, if any? I already did some research and it seems that most work in that field was done on Linux systems.

This is a  about  the use of a *AMPP's stack.    I recently had a talk with some experienced people and they suggested to me not to use a WAMP stack, and instead install apache, mysql and php separately.  I don't understand why they have suggested this, though, so can anyone tell me?  Is there a particular disadvantage of WAMP, or a particular advantage to installing all of them separately?  Since a WAMP stack itself is composed of apache, mysql and php, then what's the difference between using the WAMP stack and installing them all separately?


Let $p\in\mathbb N$ be a prime. I want to prove that there is an infinite amount of primes $p$ with the property $p+2$ is not a prime. I am stuck on how to do this, though. I have tried an alternation of Euclids proof of the infinitude of primes but I cannot seem to find a construction that implies the desired result. Any help would be appreciated.

Well, we all know the twin prime conjecture. There are infinitely many primes $p$, such that $p+2$ is also prime. Well, I actually got asked in a discrete mathematics course, to prove that there are infinitely many primes $p$ such that $p + 2$ is NOT prime.


ALright so I got a homework from my teacher to first select every individual
 and then use modulus to select only the odd ones and change their color. And I have to say that I am completely stumped.  I have tried selecting using child nodes: var listaOne = document.getElementById ("lista1").childNodes[0];  HTML

List item 1

List item 2

List item 3

List item 4

List item 5

   JS      listaOne = document.getElementById ("lista1").childNodes[0]; listaTwo = document.getElementById ("lista1").childNodes[1]; listaThree = document.getElementById ("lista1").childNodes[2]; listaFour = document.getElementById ("lista1").childNodes[3]; listaFive = document.getElementById ("lista1").childNodes[4];   I want to be able to choose an
 individually

if you create html layout like so

   and try to select odd elements with 'a' class like so $$('.a:odd') you will get empty array, and if you do $$('.a:even') you will get all four li elements with 'a' class.. It really strange.. But im new to mootools, maybe im doing something wrong..    So my question is how to select first and third li elements with a class. I know that i can do it with function like this  $$('.a').filter(function(item, index) { return index%2; }  but its too complicated for such small task as selecting odd or even elements..


Why would someone use WHERE 1=1 AND <conditions> in a SQL claus. I don't understand why would someone use this construction for defining a view, or use it inside a stored procedure.  for example:  select * from user where 1=1

Why would someone use WHERE 1=1 AND <conditions> in a SQL clause (Either SQL obtained through concatenated strings, either view definition)  I've seen somewhere that this would be used to protect against SQL Injection, but it seems very weird.  If there is injection WHERE 1 = 1 AND injected OR 1=1 would have the same result as injected OR 1=1.  Later edit: What about the usage in a view definition?    Thank you for your answers.  Still, I don't understand why would someone use this construction for defining a view, or use it inside a stored procedure.  Take this for example:  CREATE VIEW vTest AS SELECT FROM Table WHERE 1=1 AND table.Field=Value


I have just started reading about quantum mechanics and i stumbled upon this silly question - Quantum mechanical model of an atom  says that path of an electron around the nucleus is uncertain. Then how can we be sure that it's not circular?

I have read the quantum mechanical model of an atom which says that path of an electron around the nucleus is uncertain due to uncertainity principle which says that it is impossible to measure both momentum and position of an electron at the same time so it is impossible for an electron to move in a well defined circular orbit.But  what if we simply do not measure the elcetron then it should move in a well defined path.So what really restrict it from moving like that?


Basically I have this formula:  =(MIKE!$B8)   and I have a bunch of cells withs Numbers like so:  Cell | Cell Number Change C1 | 10  C2 | 16 C3 | 29 C4 | 40 C5 | 61   What I want to do is to be able to change the number "8" for the formula by referencing a cell to grab a number, which will thus change the formula and the output of the data. I'll use it to copy and paste down and change the numbers out to get only the output of different cells that I need.

I have a cell in Excel, to which I want to pull data from another cell that is defined as a value in a third cell.  For example:  A1=5 A2=10 A3=insert syntax here, using A4 as source for cell reference A4=user-input selection  When A4 is set to "A1", then A3 should return 5.  When A4 is set to "A2", A3 should return 10.  The above is actually a bit of an over-simplification.  What I'm really looking to do, is to use one cell to define which sheet to pull data from for calculations that will be performed in another cell.  Scenario:  A workbook contains several sheets (Sheet1, Sheet2, Sheet3, etc.) which are laid out identically - a value in 'Sheet1'!A2 represents the same sort of information as is represented by the value in 'Sheet2'!A2.  I want to build another sheet, named Comparison, that allows me to easily compare data between two chosen sheets.  This sheet will also be laid out identically to the others, but the values here should be calculations of the difference between the similar values in the target sheets.  This sheet will also have two special cells which are configured with data validation and in-cell drop-downs, to allow selection of two other sheets, by name, for comparison.  Let's say the selection cells are in A5 and A6.  Given:  A5=Sheet5 A6=Sheet3  Then the formula in 'Comparison!'A2 should result in the same as 'Sheet5'!A2-'Sheet3'!A2.  If I change A6 to "Sheet7", then the formula should adjust to 'Sheet5'!A2-'Sheet7'A2.  Is this sort of dynamic cell referencing easily doable (without a crap-ton of IF statements) in Excel?


In reference to a question asked back last October "" I implemented the method of PDFs opening in the current browser tab (as provided to be an answer to the question). However when creating a table/ holding over 1,000+ pdfs customers had voiced about having to constantly hit the back button every-time they needed to access a pdf.   One major concern is customers using a data-table are always returned to the first rows of entries having to paginate until they reach their desired rows. This step is repeated multiple times until customers are frustrated and felt constrained having to go back and fourth while losing their place within the long table trying to locate desired pdfs.   If a website has a table/data-table containing over 200 - 1,000+ pdfs should the pdf open in the current browser tab or should it open within a new tab?  *NOTE: I understand as stated above there was an answer to a previous question but that question's answer doesn't fit my needs with a large datatable/table. The question's "Should PDFs open in a new tab" answer was to open a pdf in the current browser window. This method does not work with a data-table containing over 1,000 rows of pdfs. If a user paginates to say 33 and clicks the pdf, views pdf in the current browser window and hits the back button, they are directed to page 1 of the pagination. Opening the pdf in the current browser is creating more work for the user as every-time they need to open a pdf the same process is followed always taking them away from their previous pagination.  Here is a small example of what I am working with

A section on a website has a list of links to PDF files (containing end user content).  When a user clicks on one of these links should it open in a new tab on the browser? Or should it open in the current tab/window?    I notice that when you click on external links on Twitter or Facebook they open in a new tab, but I am unsure about best practices for internal links to PDF documents.


Lots of spoilers, obviously.  At the end of the last series, in The Name of the Doctor:      The Doctor and Clara are forced to travel to Trenzalore by the Great Intelligence, where Clara steps into the Doctor's grave - a scar in spacetime where she is scattered across his history. The 11th Doctor jumps in to save her and it ends on a cliffhanger where they meet the War Doctor for the first time.   Then in the 50th anniversary special The Day of the Doctor:      It starts with Clara working as a teacher and the Doctor travelling.   How? What happened between these two episodes? The 11th Doctor mentions Clara having met 'Mr Grumpy' before, but there seems to be some missing narrative. Have I missed a special or something?      How do Clara and the Doctor escape from the Doctor's grave on Trenzalore?

In the last episode of season 7, The Doctor goes into his timeline to save Clara. It ends when they see his war regeneration and Clara faints. Did I miss a special episode between that one and the 50th anniversary special? Because they never explained how they escaped his timeline.


I read about some differences between spherical and aspherical lenses. Mostly about geometry though. I was wondering what is the difference on the pictures.   How are the pictures of an aspherical lens different? I see some lenses being advertised as aspherical (). However the specs of other lenses do not specify if they are spherical or aspherical. For instance the . Why is that? Is the latter spherical?

Many lenses (like the , or the ) are described as having "aspherical lens elements". Does this mean that regular lenses are spherical lenses? What's the difference, and what are the advantages of one over the other?


I am using ArcGIS 10.1.  I inserted a legend however the items in the legend are too large because of the size i set them in the data view.  How do i scale the items in the legend so they will be the same size in the layout tab as they are in the data view tab.

As you can see from the image below, my enormous scale for traffic pattern shadows the other objects in the legend. Are there ways to reduce the size of object portrayed in the scale?


I have a dictionary of words I want to replace. preprocess_pattern = {r" AND ": r" & ",  r" O\A ": r" O/A ",  r" D\B ": r" O/A ",  r" D/B ": r" O/A "}  def preprocess_rules(text):      for detect_pattern, replace_pattern in preprocess_pattern .items():         text = re.sub(detect_pattern, replace_pattern, str(text))              return text  preprocess_rules('AMAZON O\A MICROSOFT')  It gives me a result of 'AMAZON O\A MICROSOFT'; with two slashes(). The O\A didn't replace to O/A. Was wondering what is causing this issue.

I am tired of always trying to guess, if I should escape special characters like '()[]{}|' etc. when using many implementations of regexps.  It is different with, for example, Python, sed, grep, awk, Perl, rename, Apache, find and so on. Is there any rule set which tells when I should, and when I should not, escape special characters? Does it depend on the regexp type, like PCRE, POSIX or extended regexps?


I'm trying to create an event on my database which will be executed every 6 hours, Currently I'm doing this daily and it's annoying because sometimes I forget to do it, I'm doing this on 2 steps Select A.id_ from timemanagement_Assignment as A Left join project_Task as T on T.id_ =A.task_id_ Left join project_Phase as P on P.id_ =T. phase_id_ Left join project_Iteration as I on I.id_ =P. iteration_id_ Left join project_Lot as L on L.id_ =I. Lot_id_ Left join project_Project as Pr on Pr.id_ =L. project_id_ Where A.isfavoris_ =true and Pr.status_ in("Closed", "Archived","Suspended");  Then, I copy the result and separate them by a comma then put them between the () in the following Query update  timemanagement_Assignment  set  timemanagement_Assignment.isFavoris_=false where id_  in ();  When I try to execute this in one step using :  update  timemanagement_Assignment      set  timemanagement_Assignment.isFavoris_=false     where id_  in (Select A.id_ from     timemanagement_Assignment as A     Left join project_Task as T on T.id_ =A.task_id_     Left join project_Phase as P on P.id_ =T. phase_id_     Left join project_Iteration as I on I.id_ =P. iteration_id_     Left join project_Lot as L on L.id_ =I. Lot_id_     Left join project_Project as Pr on Pr.id_ =L. project_id_     Where A.isfavoris_ =true and Pr.status_ in("Closed", "Archived","Suspended"));  I got the following error Error Code: 1093. You can't specify target table 'timemanagement_Assignment' for update in FROM clause I discovered that for some reason MySQL doesn't allow this type of queries. Could you please help me to find a way to re-write this in one step to put it in an event ? Thank you

I have a table story_category in my database with corrupt entries. The next query returns the corrupt entries:  SELECT *  FROM  story_category  WHERE category_id NOT IN (     SELECT DISTINCT category.id      FROM category INNER JOIN         story_category ON category_id=category.id);   I tried to delete them executing:  DELETE FROM story_category  WHERE category_id NOT IN (     SELECT DISTINCT category.id      FROM category        INNER JOIN story_category ON category_id=category.id);   But I get the next error:      #1093 - You can't specify target table 'story_category' for update in FROM clause    How can I overcome this?


I'm creating an animation where I rotate an object, insert a LocRotScale keyframe (via the I key), select another frame, rotate the object again and insert a LocRotScale keyframe.  For example I use this:  Z, 190, Enter   Now I want to rotate the object around its own z-axis instead of the global z-axis. I've found out if you press the [Z] two times you get the Local axis instead of Global.  For example I do this now:  ZZ, 190, Enter  The rotation is ok, but when I insert the LocRotScale keyframe it did the rotation, but not around the Normal axis, but it used the Global axis.  Any suggestion on what I'm doing wrong here?

So, I've been using Blender for several years, including a fair amount of animation, and in the past it's always been useful to align an object with its local coords. I.e. having the y-axis pointing down the nose of an airplane makes it much easier to animate.  However, I recently noticed that the keyframes aren't recorded in local coordinates (anymore?), but in global coordinates. This makes animating off-axis rotation very difficult.  Changing the rotation mode doesn't seem to help (Euler, quaternion, etc.).  Unfortunately, I can't upload any examples because the project is proprietary, and I don't really have time to setup another animation, but the example goes something like this: I want to animate a record rotating in a record player, but the player is not sitting flat, it's tilted at an angle. Normally, this wouldn't be a problem. Just model the record with z up, and you can tilt the record at whatever angle you need so that it sits on the tilted player, and still rotate the record around its own z-axis, right? Unfortunately, this is not what's happening. Instead, I animate it rotating 180d twice and it wobbles all over the place because it's interpolating global coordinates, not local coordinates.  EDIT: Here's a demo afterall:   It maybe a little hard to see because it's so fast, but the second time I animate the cube, it wobbles instead of rotating around its own z-axis like I expect it to.  Does anyone know what magic button I pressed that did this?  Or am I just crazy and remembering something that has never been possible? It's happened before...  EDIT: In fact, I KNOW this has worked before, cuz I just went back and looked at some old stuff, and I know I animated using the local coordinates then... I'm gonna go see if 2.70 behaves differently from 2.70a...  EDIT: Nope, 2.70 behaves the same way.


I read a  which discussed SHA-3. I noticed it mention that security was often compromised in the name of speed (not always a bad thing, of course). It gave some examples:     What I'm saying is that although they care deeply about security, they are also looking for compromises to gain speed. This can be seen with the push for 0-RTT in TLS, but I believe we're seeing it here as well with a push for either KangarooTwelve (K12) or BLAKE2 instead of SHA-3/SHAKE and BLAKE (which are more secure versions of K12 and BLAKE2).   This is explicitly claiming that BLAKE is more secure than BLAKE2. I wasn't able to find anyone else claiming that, so I went to read the  to see what changes it made to the original:   Fewer constants used. The original argument was that the constants improve diffusion. Fewer rounds used (from 14 to 10 for 256-bit digests and from 16 to 12 for 512-bit digests). Fancy features such as hash trees and personalization values added. Some generic security trade-offs made (in regards to salt and IV processing). Extensive speed and memory optimizations for implementations in software.   The first two points do not increase security at all, and arguably reduce security. Reducing the rounds was done because the best preimage attack was only found against a 2.5 round variant. This improves speed considerably at the expense of security (at least on a theoretical level). The reduced number of round constants reduce diffusion in the name of a lower ROM footprint.  It's possible that the author of the blog post mentioned simply read about it using fewer rounds and claimed the security was meaningfully reduced as a result, or it could be that it may have practical implications. My question is whether or not there is any concrete reason to consider BLAKE2 to be less secure than BLAKE and to use the latter instead for that reason (when speed is not an issue).

The  uses round constants derived from $\pi$ to improve diffusion, even if the additions modulo $2^{32}$ are replaced with bitwise XOR when processing a null message and null initial state:     The higher weight in the original model is due to the addition carries induced by the constants $c_0,\dots,c_{15}$. A technique to avoid carries at the first round and get a low-weight output difference is to choose a message such that $m_0 = c_0,\dots,m_{15} = c_{15}$. At the subsequent rounds, however, nonzero words are introduced because of the different permutations.   However, the  describes changes it made to BLAKE that remove these constants:     Constants in G initially aimed to guarantee early propagation of carries, but it turned out that the benefits (if any) are not worth the performance penalty.  This change saves two xors and two loads per G, that is, 16% of the total arithmetic (addition and xor) instructions.   This statement was made as part of an argument that reducing the number of constants in BLAKE2 does not weaken it, while simultaneously decreasing RAM and ROM footprint. Unfortunately, unlike many of the other trade-offs it discusses, no further explanation is given. What are the benefits of guaranteeing early propagation of carries that lead to BLAKE's constants, and why are these benefits in doubt?


I’ve been scouring my memory for the name of a book I read decades ago. I only remember fragments. Inter-dimensional portals, a female warrior who is immortal (and beautiful), an average man protagonist.   A Boris type cover with the scantily clad woman warrior on the cover... possibly with a Stonehenge type structure.

I am looking for some help remembering this book series I listened to on audiobook many years ago. It was a good story I just for the life of me can't remember the name, author or any of the character names lol I think this is a long shot as I don't remember many details but I really would like to read it again.  Some of the details I do remember: the story is set in a medieval time, not on this planet.  It's told from the viewpoint of a man, I believe he was a soldier. The main character meets him in a war torn world and allows him to travel with her.  The main character is a woman. She is a wanderer and carries a sword that only she can hold. If I remember correctly the magic is too powerful for anyone else to bear and it physically hurts them.  This sword allows her to pass through portals into other worlds. The portals are stationary and they need to travel to them.  There was also something special about her horse.... Ugh.  Each book is set on a different world.I only remember two of the worlds.  One is doomed world. It's land is sinking and towards the end there is a rush to get to the next portal. The book is set in a bog filled environment.  The other world I remember is more lush. Open plains and dense forest. The man is separated from the woman for some time. He stays with tribes-people, elves maybe? When it's time for them to go to the next world the man is torn between staying with his new friends and leaving.  So that's really all I remember. At the time I remember noting after I had read a few of the books that the author never really finished the series.  Any help would be appreciated :) throw me some guesses so I can do some research!


I wanted to know if it's possible to combine at least two systems into one image :  Example :   I have a Debian image (.iso) and a Clonezilla image (.iso) and I want to make one image and the GRUB (installed into the image) let me choose between Clonezilla or Debian.  Is it something easily doable or should I make a fully custom image ?

I want to cut my 8 GB USB key into several partitions to use  for a Windows XP (maybe d before).   I also want to put the  remix pack into it such that it has the second bootable OS. I want to tweak and modify it a little because if I can I want to switch Ubuntu 9.04 to the  version.  How to do it easily?  IMP: in short I want to make a dual-boot USB key with Windows XP SP3 and Ubuntu 8.04.3 LTS.


If I am a Celestial Warlock and I take the Magic Initiate - Cleric (Cure Wounds), does that now count as a Warlock spell for me?   Since under The Celestial it says: "The following spells are added to the warlock spell list for you." and Cure Wounds is on the list.   This last part in the SAC would lead me to believe yes: "In short, you must follow your character’s normal spellcasting rules, which determine whether you can expend spell slots on the 1st-level spell you learn from Magic Initiate."  Bonus question, option 2: If i took the feat after having one level in Celestial Warlock, could I take Cure Wounds using Magic Initiate - Warlock.

The multiclassing spellcasting rules (PHB p. 164, or ) state:  Each spell you know and prepare is associated with one of your classes, and you use the spellcasting ability of that class when you cast the spell.  According to the above, every spell you know or prepare should be associated with a class.  However, for spells learned from feats like Drow High Magic or Wood Elf Magic are these actually associated with a class? If so, what class? If not, is the PHB statement above wrong/outdated? Are the spells learned in these feats (and others like it) associated with something else (like your race, in these cases)?  For reference, the  racial feat (XGtE p. 74) states:  You learn more of the magic typical of dark elves. You learn the detect magic spell and can cast it at will, without expending a spell slot. You also learn levitate and dispel magic, each of which you can cast once without expending a spell slot. You regain the ability to cast those two spells in this way when you finish a long rest. Charisma is your spellcasting ability for all three spells.  The  racial feat (XGtE p. 75) states:  You learn the magic of the primeval woods, which are revered and protected by your people. You learn one druid cantrip of your choice. You also learn the longstrider and pass without trace spells, each of which you can cast once without expending a spell slot. You regain the ability to cast these two spells in this way when you finish a long rest. Wisdom is your spellcasting ability for all three spells.  In regards to the third and fourth questions, the fact that the PHB quote says "use the spellcasting ability of that class when you cast the spell" and the fact that the feats specify what ability the spell uses in these examples (independent of class) suggests to me that they are not associated with class.


I loaded Ubuntu on an older laptop with windows vista. I opted for the dual boot. the computer boots to the Grub menu and I pick Ubuntu it loads and goes to the log in screen. I log in and hit enter the screen goes black, a few lines of code pop up then it goes back to the log in screen. this is my first time with Ubuntu. I was able to go into vista fine. I decided to try to re-install Ubuntu thinking that it would overwrite what was on the computer but it just installed a second instance. The same thing happens with the log in screen on either instance and now I can't get into vista. I would like to use Ubuntu on that laptop but how do i get Ubuntu to continue past the login?  I looked at the listings of this being a duplicate question. I changed the install to a solo install of 14.04 Ubuntu. I get to the log in screen and still not able to log in as user or guest. I did ctrl-alt-f1 and logged in on the shell. I can run commands on the shell. I tried the chmod and chown command lines listed on the duplicate. when i shift back to the log in screen still no luck. I tried the install-session and that didn't work. I noticed that when I ran the sudo command the prompt stayed at $ instead of switching to #.   Have there been issues with Unity desktop on an Nvidia video card? what command line sequence do i use to download the Unity desktop with nvidia drivers?  I am using a compaq presario cq60 laptop.

I have a problem that i never seen before. I upgraded my Ubuntu 12.04 64bit to 14.04 using the following command:  $ sudo update-manager -d   After that I can't login to my user account, when I log it just flashes and then  it goes back to the login screen, but the odd thing is that I can log in with the guest account.  I tried to create another account but couldn't log to that account either.  FYI I don't have any graphic cards like NVIDIA or AMD.


This might sound like a stupid question, maybe even so obvious that I can't find the answer anywhere else, but could someone please shed light on why inductors don't short out?  With basically all of the inductors that I've seen, the wire coils touch.. a lot. Why doesn't the electron flow just take the "path of least resistance" and go straight from the input lead to the output lead?  To illustrate, my understanding of how electricity flows through a conductor is as follows (please excuse the dodgy looking MS Paint overlay):    Since the wires are touching, I'm wondering why it doesn't go like this:   The only explanation that I could think of is that the silver-coloured contacts at the ends (somewhat covered by my drawing) are actually elemental silver, and the wires are only coated in copper. This seems like the only explanation, because according to www.tibtech.com/conductivity.php and chemistry.about.com/od/moleculescompounds/a/Table-Of-Electrical-Resistivity-And-Conductivity.htm, the only thing with less electrical resistance than copper is silver. Presumably the difference is sufficient to force the current to run the entire way around the coil and not just short through the copper.  If anyone could shed light on this, that would be great - thanks :)

This has been bugging me for a long time. Take  for example.  I have always thought that electricity will take the shortest path. When the electromagnet's windings are uninsulated, it seems that the electricity would flow straight through the "mass of metal" created by the wire, not in the circular path needed for the electromagnet to work. I have also seen solenoids that work like this. How does this design work?


I need to grep words like these:  ABC-DEF AB2-DEF AB3-DEF AB-DEF   So I was trying:  grep AB*-DEF grep -w -AB*-DEF grep -w AB*DEF   But neither of them are working.

Comparing     grep '.*[s]' file   with     grep .*[s] file   Why do you need quotation marks to let this work properly? In the second case, grep seems trying to inspect every file with a period.


I recently was given the task to create power using magnets, I would think that if I were to put some same poled magnets together, and they were facing the same poled magnets, they would repel and rotate around a shaft.

As a child, I imagined this device, which may seem to rotate indefinitely. I have two questions.   Is this perpetual motion machine already known? If it is, could you please give some references? What is the exact mechanism that makes it stop? By this, I mean an explanation, not simply "because it would break law of energy conservation". Of course energy conservation is true and this machine cannot work indefinitely. But for any known (presumed) perpetual mobile, there was an explanation, usually based on showing that the force generating the motion is . For example, Stevin obtained the laws of the inclined plane from the perpetual motion device     I would like to make some observations.   I don't try to convince anyone that it will move forever because I don't believe in breaking the energy conservation. It is true that , and nowadays some who think that there may be  in MWI believe, but I don't. But I don't consider an enough explanation simply to refer to the energy conservation. I am interested in an explanation showing exactly how the magnetic forces making it rotate, are balanced.  If the forces are balanced, only then friction will make it slow down and stop. I don't think that we can explain only by referring to friction, which in principle can be made as small as needed. There has to be a balance of forces. Why spending time trying to understand or explain something that admittedly can't work? Well, even though perpetual motion machines cannot actually work, I think they may be interesting as puzzles.


How can I enter the symbol in picture, which is like “O”,  in Latex? The symbol means "proportional to" in mathematics.  Thanks in advance.

I know what my symbol or character looks like, but I don't know what the command is or which math alphabet it came from. How do I go about finding this out?


I type @ or $ or & or * way more often than I do 2, 4, 7 or 8.   Especially with () it is usually a bit more difficult to hit ⇧Shift 9 and immediately ⇧Shift + 0.  Can I somehow default the numeric keys to print the ⇧Shifted values by default, and print the digits when I actually use ⇧Shift?   This is not remapping of values, this is using the modifier key always for certain keys. This is not a duplicate, I do not want to use Ukelele for this.

I want to remap § to ` and ± to ~ on my Mac keyboard because they are located in a place I am not used to. Is there an easy way to do this?


Let $M$ be any subset of a Topological space $X$. We say $M$ is dense in $X$ if $\overline{M}=X$. Now I have to prove the question:     $M$ dense in $X$ $\Leftrightarrow$ for any subset $V \subseteq X : V \cap M \neq \emptyset $ where $V$ is open and not empty.   I tried to prove that by contradiction but didnt get far i hope you can help me out here.

I was wondering if this proof of this basic topological result concerning the  closure works.  Proposition: Let $A \subseteq (X,\tau)$. Then, $A$ is dense in $X$ if and only if every non-empty open subset of $X$ intersects $A$ non trivially. Proof: [only if] Assume that $A$ is dense in $X$. This means that $A \cup A' = X$, where $A'$ denotes the set of all the limit points of $A$. Let $G \in \tau$ be non-empty. Thus, $G \subseteq (A \cup A') = X$. Hence, either $G \cap A \neq \varnothing$, which establishes the result, or $G \cap A' \neq \varnothing$, which leads to a contradiction. [if] Assume that $A$ is not dense in $X$. Thus, there is a $x^* \in X \setminus (A \cup A')$. Notice, that $X \setminus (A \cup A')$ is open, because $A \cup A'$ is closed, and it is not empty. Hence, we can conclude by realizing that $X \setminus (A \cup A') \cap A = \varnothing$, which completes the proof. $\square$  It is one of the first proofs I attempt in topology, and I am not planning to see how it is proved in the book I am reading (unless you answer me that my proof is completely wrong). Thus, I am really looking forward to any feedback, also contentwise. Thank you for you time.


Let X and Y be independent random variables, X ~ Gamma(α,λ) and Y ~ Gamma(β,λ). Prove tha S=X+Y andT =X/(X+Y) are independent ,S~Gamma(α+β,λ) and T ∼Beta(α,β).

Let $X_1,\dots,X_{k+1}$ be mutually independent random variables, each having a gamma distribution with parameters $\alpha_i,i=1,2,\dots,k+1$ show that $Y_i=\frac{X_i}{X_1+\cdots+X_{k+1}},i=1,\dots,k$, have a joint ditribution as $\text{Dirichlet}(\alpha_1,\alpha_2,\dots,\alpha_k;\alpha_{k+1})$   Joint pdf of $(X_1,\dots,X_{k+1})=\frac{e^{-\sum_{i=1}^{k+1}x_i}x_1^{\alpha_1-1}\dots x_{k+1}^{\alpha_{k+1}-1}}{\Gamma(\alpha_1)\Gamma(\alpha_2)\dots \Gamma(\alpha_{k+1})}$.Then to find joint pdf of $(Y_1,\dots,Y_{k+1})$ I can not find jacobian i.e.$J(\frac{x_1,\dots,x_{k+1}}{y_1,\dots,y_{k+1}})$


Here you can see my today chat history:    Yeah, the blue colored are mine.   Why these are right aligned?  Is it because of most people are right handed or earlier chat app implemented this way?  I'm also expecting links for research papers that provide complete answer.

I'm building a small chat. Now I see but in other chats (whatsapp, facebook mobile chat, sms ...) that the arrangement is always the same:  Left: the chat partner. right: myself      Why is that?


When I insert any figure into my Latex document all I get as the output is a total black background instead of the image (when I use switch [demo] on). However when I disable the demo, I get an error message      LaTex could not determine the graphics size    What should I do in this case?  Here is my preamble:  \documentclass[12pt,letterpaper]{article} \usepackage[utf8]{inputenc} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{graphicx} \usepackage[left=2cm,right=2cm,top=2cm,bottom=2cm]{geometry}

I write some of my network notes in TeX. I wanted to make a table, and inside it insert an image:   .   I wrote a document:  \documentclass{article} \usepackage[demo]{graphicx} \usepackage{booktabs} \usepackage{array}  \begin{document} \begin{tabular}{m{3cm}m{3cm}m{5cm}} \toprule Configuration for ... & Commands & Topology\\ \midrule PPP: CHAP, PAP & \#sh int se 0/0/0  & \includegraphics[width=4cm, height=4cm]{chappap.png}\\  & & \\ \bottomrule \end{tabular} \end{document}   But instead of my network topology image, I see only this: .   I don't know what is wrong, cause my image is 100% in the same dir, as my *.tex file.  EDIT:  Changed my code as @Jubobs suggested, now everything is as I wanted:  \documentclass{article}     \usepackage{graphicx}     \usepackage{booktabs}     \usepackage{array}      \begin{document}     \begin{tabular}{m{3cm}m{3cm}m{5cm}}     \toprule     Configuration for ... & Commands & Topology\\     \midrule     PPP: CHAP, PAP & \#sh int se 0/0/0  & \includegraphics[width=4cm, height=4cm]{chappap.png}\\      & & \\     \bottomrule     \end{tabular}     \end{document}


I have the following setup in flask:  @app.route('/restart/<int:id>') def feed_info(id):     con = sqlite3.connect(database)    con.row_factory = sqlite3.Row    cur = con.cursor()     main_q = "UPDATE feed SET update_flag = 1 WHERE id = {};".format(id)    print(main_q)     cur.execute(main_q)     return "Set to update!"   However, even though the SQL seems to work on its own, it doesnt actually make the update when I call the method in Flask.  Any ideas?

I'm having some trouble updating a row in a MySQL database. Here is the code I'm trying to run:  import MySQLdb  conn=MySQLdb.connect(host="localhost", user="root", passwd="pass", db="dbname") cursor=conn.cursor()  cursor.execute("UPDATE compinfo SET Co_num=4 WHERE ID=100") cursor.execute("SELECT Co_num FROM compinfo WHERE ID=100") results = cursor.fetchall()  for row in results:     print row[0]  print "Number of rows updated: %d" % cursor.rowcount  cursor.close() conn.close()   The output I get when I run this program is:     4Number of rows updated: 1   It seems like it's working but if I query the database from the MySQL command line interface (CLI) I find that it was not updated at all. However, if from the CLI I enter UPDATE compinfo SET Co_num=4 WHERE ID=100; the database is updated as expected.  What is my problem? I'm running Python 2.5.2 with MySQL 5.1.30 on a Windows box.


I've been going through Java API java.util.HashMap and java.util.Hashtable  I've understood the internal implementation of get(Key k) and put(Key k, Value v)methods of HashMap, and Hashtableseems almost same to me in terms of get(k) and put(k,v)method.  Please tell me does Hashtable internally work in the same way as it is in HashMap or differently?  I know other stuff about synchronization, default capacity and null key/values, but apart from these does it differ in terms of its internal implementation of get and put method.  I've already checked java source code for the mentioned class and also visited this link:  I'd like to know about the internal get and put method implementations of the classes.  Please share your knowledge. Thanks!

What are the differences between a  and a  in Java?  Which is more efficient for non-threaded applications?


I have updated to Ubuntu 18.04 and I am using TexLive 2017 from the repositories.  In my Beamer presentations, I have always used \section*{} before the last slides corresponding to acknowledgements, thank you to the audience, etc. Like this, those slides do not correspond to any section. This is detailed in .  However, now that command does not produce the desired effect. In the MWE below, the circles corresponding to the navigation on top of the slides should not be filled for the "no section" slides, but now they are filled and they screw up the navigation (which should direct to the "My Section" slides when clicking in the circles...).  Why does the \section*{} command not work correctly now? Is it deprecated now? What should be the correct way to obtain the effect it used to have? Thanks!  \documentclass{beamer}  \mode<presentation> {     \usetheme{Singapore}     \usecolortheme{orchid} }  \begin{document}  \begin{frame}[plain] \titlepage % Print the title page as the first slide \end{frame}  \section{My Section} \begin{frame} My Section slide 1 \end{frame}  \begin{frame} My Section slide 2 \end{frame}  \section*{} %"no section" section \begin{frame} No section slide 1 \end{frame}  \begin{frame} No section slide 2 \end{frame}  \end{document}

I am trying to achieve the same thing as in  but using the Berlin theme, namely, I want to have a "Conclusion" slide at the end that does not appear in the top navigation panel.  By putting it in an empty-titled section as per the accepted answer I have succeeded in making it not appear as an additional slide in the last section. However, when the "Conclusion" slide is displayed, the navigation button to the first slide of the last section is highlighted (but the name of the section isn't). I would like to stop it, so that nothing in the top panel is highlighted when the "Conclusion" slide is displayed.  \documentclass{beamer}  \usetheme{Berlin}  \begin{document}      \begin{frame}         \titlepage     \end{frame}      \begin{frame}{Introduction}     \end{frame}      \begin{frame}{Outline}         \tableofcontents[pausesections]     \end{frame}      \section{Context}     \begin{frame}{Context}     \end{frame}      \section{Development}     \begin{frame}{Development}     \end{frame}      \section{Results}     \begin{frame}{Results}     \end{frame}     \begin{frame}{More results}     \end{frame}      \section{}     \begin{frame}{Conclusion}     \end{frame}  \end{document}


I use tabular environment in LaTeX.   I want to write a column in a table as a row in the LaTeX code.   For the problem I am writing in LaTeX, it is natural to think of a column at a time.  For example instead of   1 & 3 & 5  2 & 4 & 6   I want to write   1,2   3,4  5,6    Is there some code that I can write for this?

I would like to be able to transpose a tabular(x) table like in the following example. It is not necessary to be completely automated, but I don't want to change the data order, which is a painful and stupid. By "not completely automated" I mean that e.g. the headers can be done seperately etc.  Let's see the MWE:  \documentclass{article}  \usepackage{booktabs} \def\Midrule{\midrule[\heavyrulewidth]}  \begin{document}  \centering  \begin{tabular}{*6c}\toprule \bfseries Name & Alice & Bob & Chuck & Dave & Eve\\\Midrule \bfseries Sex & Female & Male & Male & Male & Female\\\midrule \bfseries Age & 18 & 19 & 20 & 21 & 22\\\bottomrule \end{tabular}  \bigskip  Which I want to look like  \bigskip  \begin{tabular}{*3c}\toprule \bfseries Name & \bfseries Sex & \bfseries Age\\\Midrule Alice & Female & 18\\\midrule Bob & Male & 19\\\midrule Chuck & Male & 20\\\midrule Dave & Male & 21\\\midrule Eve & Female & 22\\\bottomrule \end{tabular}   \end{document}     Note: I know that , but I would like to get it without expl3 (mostly because people would might use my code quite often have an old LaTeX installed and I cannot be convincing them to change this).


I made a cleaning cart in blender using quite a few Boolean modifiers. Originally I had the same issue within blender, but after just messing around with the object I was able to fix it. Now once I export the object as an FBX into UE4, it mysteriously "grows" a face over the handle area. I have exported the cart with just one (1) receptacle and had no issues, but as soon as I shift D the receptacle part to the other side and join all three (3) objects I have this issue. I have also unwrapped the UV's multiple times and feel like they are at the most optimized they can be.   Other questions on this site related to this issue did not help me.

After learning that booleans were apparently "bad" in my past question of this same problem, I decided to learn to use the knife tool instead to cut windows and doors in my ship.  Old thread:   Unfortunately, despite using the knife tool and everything looking allright in Blender, when exporting to fbx and using in ClothingToolCHECKED of the Nvidia apex cloth simulation, the cut outs were extremely deformed. This is the second time this has happened, even though I'm not using booleans!  This is very frustrating, as it took me a long time to redo the parts of my ship that had booleans in them.  Here are images of what I mean:  Blender:    fbx export:


In my application one form is there having 10 elements.All elements are having same ID but with different number at the end.I want to locate all the elements.Can anyone give me xpath please.  @FindBy(xpath=".//*[@id='ext-gen1095']") WebElement period_type; @FindBy(xpath=".//*[@id='ext-gen1472']") WebElement months; @FindBy(xpath=".//*[@id='ext-gen1097']") WebElement period_start; @FindBy(xpath=".//*[@id='ext-gen1464']") WebElement submit; @FindBy(xpath=".//*[@id='ext-gen1482']") WebElement clear;

How to Handle Dynamic Changing IDs In XPath? for example :   //div[@id='post-body-3647323225296998740']/div[1]/form[1]/input[1]   In this xpath id "3647323225296998740" is changing every time when reloading the page.   Is there any way to handle this type of situation in Selenium?


How can I compare the means of two data sets where there is some overlap in the samples so that the groups are neither paired nor independent? That is there has been some change in the samples with some subjects providing data in BOTH sets, some respondents only providing data in the first set and others only providing data in the second set?

An investigator wishes to produce a combined analysis of several datasets.  In some datasets there are paired observations for treatment A and B.  In others there are unpaired A and/or B data.  I am looking for a reference for an adaptation of the t-test, or for a likelihood ratio test, for such partially paired data.  I am willing to (for now) to assume normality with equal variance and that the population means for A are the same for each study (and likewise for B).


In Ubuntu 13.10, I want to change my suspend timer to go to sleep after 3 hours, but in System Settings I can not do that. I'm wondering is there any way to set it?  I've already tried the instructions in this question:

I run Mythtv on some Ubuntu 11.10 based machines.  In the power settings, I can choose from a list of time periods from 5 minutes up to 1 hour for the the machine to suspend when inactive.  I would like to set the suspend to occur at a longer interval, like 2 hours or 4.  Previously with Gnome, I would think that I could go into the gconf editor and find the key there, I am not sure with Unity where to override a setting like this.  Any suggestions?


(Just upgraded to 16.04; still getting things working...)  Right now, I have two hard drives.   I have the 2nd internal hard drive mount location symbolically linked, and I don't really want to change anything at this point.   The only problem is, it does not mount until I click on the hard drive icon in the unity launcher.  Only after I click it do the symbolic links start working.    How do I make it automatically do whatever it is going to do when I click it...on start up?

How do you make HDDs and partitions mount at startup on Ubuntu?  I always keep my media and data files on separate partitions - one 2tb HDD and a 400 odd gig partition.  I have been trying to swap the default folder location for the home directory to my other drives.  It works when I change the /home/user_name/.config/user-dirs.dirs file to the directories I want, but only until I reboot the system. I am only assuming that the drives not mounting is the problem with it, but it would be helpful either way.  If any one knows another reason for why the directories change back to default each time that would be good also.


How can I prevent the hyphenation of words with hyphens?  For example: Wi-Fi, F-1  Is it possible to add the exceptions to \hyphenation?

With ~ we can enforce that no line break occures between two words.  But this does not seem to work with special characters. I want LaTeX to enforce not to break the line after the - in (re-)creation.  In my document the line breaks between (re- and )creation, which looks a bit ugly.  How can I achieve this?


I've literally spent 3 hours trying to add a favourite.  Some applications can be added, and some can't.  There's no error message anywhere to help you find out why it doesn't work.  The "Add to favorites" menu option is simply not offered.  I had no problems adding favorites in 16.04, but some of the same files and apps cannot be added after upgrading (or is it downgrading?) to 18.04.  Here's the "evil" desktop launcher that works fine but cannot be added as a favorite:  #!/usr/bin/env xdg-open [Desktop Entry] Version=1.0 Type=Application Terminal=false Exec=/home/russellr/bin/idea Name=Intellij-Idea Icon=/home/russellr/IDEA/bin/idea.png StartupNotify=true   Things I've tried that don't work:   dconf-editor as described  re-creating desktop files from scratch using an app to create the desktop files (gnome-desktop-item-edit --create-new) putting the files in Desktop folder putting the files in ~/.local/share/applications (and this means they don't appear on the desktop at all despite all the advice you can find on the web to say that's the right place!) writing a C program to launch the app creating a brand new account in 18.04 (on the assumption that my old account was somehow damaged after multiple upgrades)   The problem appears to be related to shell scripts, but that's not consistent.  Is there any wonder the ?

I have made .desktop files for Ubuntu 16.04 to access my Google Chrome profiles, but once I upgraded to Ubuntu 17.10 (it worked up to Ubuntu 17.04) they got removed from the dock and I can't pin them back. Sample File: #!/usr/bin/env xdg-open  [Desktop Entry] Version=1.0 Type=Application Terminal=false Icon[en_US]=google-chrome Name[en_US]=Google Chrome Exec=google-chrome --profile-directory=Default Comment[en_US]=Chrome Name=Google Chrome Comment=Chrome Browser Icon=google-chrome Categories=Browser;Internet;


Let $M$ be a compact manifold, then I am trying to prove that if $\chi(M)=0$ then $M$ admits a nowhere vanishing vector field.  To do this I am told to use the following 2 facts  If $\phi : S^{n-1}\rightarrow S^{n-1}$ has degree zero then it's homotopic to a constant map.   Given a finite collection of points $C=\{p_1,...,p_N\}$ we can find a diffeomorphism which sends $C$ to an open ball in $M$.  Now my attempt is the following : So we know that $M$ admits vector field $X$ with a finite number of zeros , $p_1,..,p_N$, and by the second statement we can assume that they are contained in an coordinate ball $(U,\phi)$.  Now by the Poincare-Hopf theorem we know that $\chi(M)=\sum_{i=1}^{N}Ind_{p_i}X=0$. By definition we have that $Ind_{p_i}X=Ind_{\phi(p_i)}\phi_*X$ and this will be the degree of the map $G: S^{n-1}\rightarrow S^{n-1}$ that sends $p\rightarrow \frac{\phi^{-1}_* X(p)}{||\phi^{-1}_* X(p)||}$. Now we have that for every $p_i$ this map $G$ is the same and so we get that $Ndeg(G)=0$ and so $deg(G)=0$. This tells us that $G$ is homotopic to a constant and so we have an extension $G':\phi(U)\rightarrow S^{d-1}$, with this we construct the vector field that is $X$ outside $U$ and is $G'\circ \phi$ in $U$. (I am assuming the homotopy is smooth, but I guess an argument of differential topology would fix this problem if it wasn't). What do you guys think ? Thanks in advance.

There is hint: if M has isolated singular points, find a diffeomorphism to make these singular points in a any neighborhood which you want. How can we do next?


I try to insert a button with .html(...) and then he should execute some code. But it doesn´t work, the button (inserted with .html(...)) doesn´t response after clicking him.. i have no idea what i can do, i also asked google for help, but i found nothing.. i hope somebody can help me :)  Here is my html:        <title>Multiplie Files</title>     <meta charset="UTF-8">     <meta name="viewport" content="width=device-width, initial-scale=1.0">                 <button id="button">test</button>

      And here is my javascript:  $('document').ready(function() {  $('#click').click(function() {    alert(true);  });  $('#button').click(function(){     $('#field').html('<input value="Click" type="Button" id="click"/>');     //document.getElementById("field").innerHTML = '<input value="Click" type="Button" id="click"/>'; });   });  I tried with jquery .html and with normal javascript .innerHTML.. nothing works..  Thanks for every reply! :)

I have a bit of code where I am looping through all the select boxes on a page and binding a .hover event to them to do a bit of twiddling with their width on mouse on/off.  This happens on page ready and works just fine.  The problem I have is that any select boxes I add via Ajax or DOM after the initial loop won't have the event bound.  I have found this plugin (), but before I add another 5k to my pages with a plugin, I want to see if anyone knows a way to do this, either with jQuery directly or by another option.


I'm stuck on the following problem, I'd appreciate any sort of hints.  $A,B \in M_n(\mathbb{R})$ and there exists $S \in M_n(\mathbb{C})$ such that $SAS^{-1}=B$. Prove that there exists $T \in M_n(\mathbb{R})$ such that $TAT^{-1}=B$.  What I have tried so far is to assume $S$ to have the form $C+iD$ with $i$ representing the imaginary unit and $S^{-1}$ to have the form $E+iF$ and then what we find is that:  $$CAE-DAF = B$$ $$CAF+DAE = 0$$ $$CE-DF = I_n$$ $$CF+DE = 0$$  such that $C,D,E,F \in M_n(\mathbb{R})$  but I couldn't use these identities to construct an invertible matrix in Real field with required property.

$A  \underset{\mathbb{C}}{\sim} B \overset{\text{def}}{\iff} A=C^{-1}BC, \space C\in M_{n}(\mathbb{C})$ and similarly for $\underset{\mathbb{R}}{\sim}$.     I want to prove that $ A \underset{\mathbb{C}}{\sim} B$ for $A,B \in M_{n}(\mathbb{R})$ therefore $A \underset{\mathbb{R}}{\sim} B$.   My idea is that elementary divisors of $A,B$ over $\mathbb{C}$ are the same, and if $(x-z)^k$ is elementary divisor than $(x-\overline{z})^k$ is also elementary divisor $\implies$ $A,B$ have same elementary divisors over $\mathbb{R}$. But i think it's not clear.


I want to locate a directory in my system using "locate" command. I know there is a directory named "bench-repo". when I'm giving the following command it shows me the following error :  locate: can not stat () `/var/lib/mlocate/mlocate.db': No such file or directory   Why is this happening? How can I find the directory?

The locate command sounds intuitive. I would expect it to locate files on the filesystem. However, it rarely finds files on the system that are indeed present:  $ locate ipsec.secrets   This gives  no results, even when run from filesystem root directory /. The file is indeed present:  $ whereis ipsec.secrets ipsec: /usr/sbin/ipsec /etc/ipsec.secrets /etc/ipsec.d /etc/ipsec.conf /usr/lib/ipsec /usr/share/man/man8/ipsec.8.gz   Why was locate unable to find this file?


How to compute $75^{75^{75}}$ modulo $32$?  I tried:  It's $\mathrm{gcd}(75,32)=1$, so with Euler's phi function I get   $\varphi(32)=32(1-\frac{1}{2})=16$.  Then it's $75^{16}\equiv1 \ (\mathrm{mod} \ 32)$.   So I computed $75^{75}$ modulo $16$:  It's $\varphi(16)=16(1-\frac{1}{2})=8$  So $75^{75}\equiv 1 \ (\mathrm{mod} \ 8)$ and $75^{75^{75}} \equiv 1  \ (\mathrm{mod} \ 8)$  Then it's $75^{75^{75}}\equiv 75^1 \equiv 75 \ (\mathrm{mod} \ 32)$.  I'm not sure if this is correct. Is there something wrong in this calculation or can it be done like this?

What is the remainder of $\,3^{3^{3^{\:\!\phantom{}^{.^{.^.}}}}}\!\!\!$ divided by $46$?  The level of powers is $2020$.  First there is no parenthesis so it means 3 power of 3 which is also power 3 and so on 2020 times  Second I think that we can use Fermat's Little Theorem but I don't know how, and maybe there is a better way.


I want my section titles to appear in lower case small caps. I tried to define a way to force lower case, but it doesn't work.  \\documentclass[12pt]{article} \\usepackage{textcase} \\newcommand\\textlcsc[1]{\\scshape{\\MakeLowercase{#1}}}  \\usepackage{titlesec} \\titleformat*{\\section}{\\normalfont\\fontsize{40}{50}\\bfseries\\sffamily\\color{pinterestred}} \\titleformat*{\\subsection}{\\normalfont\\Large \\textlcsc\\rmfamily\\color{electricblue}} \\titleformat*{\\subsubsection}{\\normalfont\\large\\textlcsc\\rmfamily\\color{pinterestred}} \\titleformat*{\\paragraph}{\\normalfont\\normalsize\\textlcsc\\rmfamily\\color{electricblue}} \\titleformat*{\\subparagraph}{\\normalfont\\normalsize\\textlcsc\\rmfamily\\color{electricblue}}   Any thoughts?

I'm interested in setting the titles of section and more in lowercase small caps. And I don't know how to automatically achieve this.   \documentclass{scrartcl} \setkomafont{sectioning}{\scshape} \usepackage{hyperref} \begin{document}     \section{Hello}     \section{hello}     \subsection{helloHello} \end{document}   But if I write everything in lowercase, then the \tableofcontents doesn't look good unless I use small caps there too. I know about \MakeLowercase{} but this needs an argument.  By the way, as I noted, I just want to show them in lowercase small caps in the document, not in the table of contents, ….  Any ideas?  PS: I don't know if this is necessary, but I'm using the MinionPro package.  EDIT: after some research, apart from what is answered here, in  you can look at other different (or semi-different) method.


As written in the page below, lualatex seems to be a symbolic link or an lias to luatex.   However, they don't work the same way. lualatex compiles latex format documents while luatex compiles plain tex documents.  This means they are not the same 'UNIX executable' or lualatex isn't just an alias of luatex. Why do they work differently?  Thank you in advance.

Each format has its executable/command, which compiles tex files into a document in dvi, pdf etc.   For example   for TeX (proper), what is its executable? for Plain TeX, its executable is tex which will turn a plain TeX file into a dvi file.  for LaTex, its executable is latex which will turn a LaTeX file into a dvi file.  for ConTeXt, its executable is texexec which will turn a ConTeXt file into a pdf file.  A TeX engine is a program and turns a tex file into a document in dvi, pdf etc, and  it is the actual executable binary which implements the different TeX formats.   For example   Knuth's TeX ('TeX-82') (executable: initex, or -ini flag to tex) e-TeX (executable: etex) PDFTeX (executable: pdftex) XeTeX (executable: xetex) LuaTeX (executable: luatex)    I wonder what relations and differences are between executables of formats, engines, and executables of engines?  Thanks!


Building on and motivated by  on Ubuntu, I would like to collect instructions for installing all necessary tools and sources for compiling (and potentially developing) kernels for the .

What all needs to be done to install Android SDK / ADT Bundle on Ubuntu?  Each of the steps in the answer was found on some different forum as I encountered obstacles getting started with my Android SDK and posted questions in appropriate forums thereafter. So I thought this would be useful in that it is a one stop solution available, in case one ever needs to re-install Ubuntu and install the Android SDK / ADT Bundle from scratch!


I am trying to write code to reverse a string in place (I'm just trying to get better at C programming and pointer manipulation), but I cannot figure out why I am getting a :  #include <string.h>  void reverse(char *s);  int main() {     char* s = "teststring";     reverse(s);      return 0; }  void reverse(char *s) {     int i, j;     char temp;      for (i=0,j = (strlen(s)-1); i < j; i++, j--) {         temp = *(s+i);     //line 1         *(s+i) = *(s+j);   //line 2         *(s+j) = temp;     //line 3     } }   It's lines 2 and 3 that are causing the segmentation fault.  I understand that there may be better ways to do this, but I am interested in finding out what specifically in my code is causing the segmentation fault.  Update: I have included the calling function as requested.

The following code receives seg fault on line 2:  char *str = "string"; str[0] = 'z';  // could be also written as *str = 'z' printf("%s\n", str);   While this works perfectly well:  char str[] = "string"; str[0] = 'z'; printf("%s\n", str);   Tested with MSVC and GCC.


I am having trouble with the numerical integration of a divergent function. For example, \begin{equation} n= \int f(x)\,dx = \displaystyle\int \dfrac{\Theta(x-\varepsilon)\,dx}{\sqrt{x-\varepsilon}} \end{equation} is not behaving good when calculated numerically: \begin{equation} n_\text{numerical} \approx f(x_j)(x_j-\varepsilon) + \sum_{k=j+1}^N f(x_k)\Delta x \end{equation} with \begin{equation} x_i = x_\text{min} + i\Delta x \end{equation} and $x_j$ being the smallest point larger than $\varepsilon$. Due to the divergent behavior of $f(x)$ near $\varepsilon$, the numerical result has discontinuities and jumps at every $\varepsilon=x_i$ when I sweep $\varepsilon$. The smoothness of this integration is crucial in the convergence of my self-consistent simulations. Can anybody suggest a simple trick to solve the problem?

I am having trouble with the numerical integration of a divergent function. For example, \begin{equation} n= \int f(x)\,dx = \displaystyle\int \dfrac{\Theta(x-\varepsilon)\,dx}{\sqrt{x-\varepsilon}} \end{equation} is not behaving good when calculated numerically: \begin{equation} n_\text{numerical} \approx f(x_j)(x_j-\varepsilon) + \sum_{k=j+1}^N f(x_k)\Delta x \end{equation} with \begin{equation} x_i = x_\text{min} + i\Delta x \end{equation} and $x_j$ being the smallest point larger than $\varepsilon$. Due to the divergent behavior of $f(x)$ near $\varepsilon$, the numerical result has discontinuities and jumps at every $\varepsilon=x_i$ when I sweep $\varepsilon$. The smoothness of this integration is crucial in the convergence of my simulations. Can anybody suggest a simple trick to solve the problem? All I need is to have a continuous numerical result by continuously changing $\varepsilon$.


Let $X_1, X_2,...,X_{2n}$ be random variables such that $V(X_i)=4, i=1,2,...,2n$ and $Cov(X_i, X_j)=3, 1\leq i\neq j\leq 2n$. Then find  $V(X_1-X_2+X_3-X_4+...+X_{2n-1}-X_{2n})$.  I know that      $V(\sum\limits_{i=1}^{n}a_iX_i)=\sum\limits_{i=1}^{n}{a_i}^2V(X_i)+2\times\sum\limits_{i,j(i\neq j)=1}^{n}a_ia_jCov(X_i,X_j)$   So, for this problem,  $V(X_1-X_2+X_3-X_4+...+X_{2n-1}-X_{2n})$  $=\sum\limits_{i=1}^{2n}V(X_i)+2\times\sum\limits_{i,j(i\neq j)=1}^{2n}a_ia_jCov(X_i,X_j)$  $=8n+2\times\sum\limits_{i,j(i\neq j)=1}^{2n}a_ia_jCov(X_i,X_j)$  But I cannot calculate the $\sum\limits_{i,j(i\neq j)=1}^{2n}a_ia_jCov(X_i,X_j)$ part.  Please anyone help me solve the above problem. Thanks in advance.

Let $A$ and $B$ be two constant matrices and let $x$ and $ y$ be two random vectors, what is the general formula for $Var(Ax+By)$? I know the formula for when $x$ and $y$ are scalar random variables and $A$ and $B$ are constants, but what about the matrix case?


I have a question where I am asked suppose we have an $(N \times N)$ matrix with one's on the diagonal, and constant, $c$ everywhere else. What would you expect the eigenvalues to be ?  I tried calculating it using a $(2\times 2)$ matrix, but I then got stuck for $(3\times 3)$ and so forth. Is there some sort of trick that can be used here ?

I have the following $n\times n$ matrix:  $$A=\begin{bmatrix} a & b & \ldots & b\\ b & a & \ldots & b\\ \vdots & \vdots & \ddots & \vdots\\ b & b & \ldots & a\end{bmatrix}$$  where $0 < b < a$.  I am interested in the expression for the determinant $\det[A]$ in terms of $a$, $b$ and $n$.  This seems like a trivial problem, as the matrix $A$ has such a nice structure, but my linear algebra skills are pretty rusty and I can't figure it out.  Any help would be appreciated.


I want to create sth like: int main () {     string s{};          std::cout << "Enter CMD: \n";          getline(cin,s);          system(s); }  But since I can use only const char on system, its not working at all, is there any different solution to this? mabye shellexecute?

How can I convert an std::string to a char* or a const char*?


How to type something like   Thank you very much!

I want to know how can I achieve this effect in LaTeX:    Basically it looks like this: {F}IRST {L}ETTER, where the letters in the braces are a little bigger than the other ones but they all the letters are uppercase.  Any suggestions?


In Python, I am trying to do  text = re.sub(r'\b%s\b' % word, "replace_text", text)   to replace a word with some text. Using re rather than just doing text.replace to replace only if the whole word matches using \b. Problem comes when there are characters like +, (, [ etc in word. For example +91xxxxxxxx.   Regex treats this + as wildcard for one or more and breaks with error. sre_constants.error: nothing to repeat. Same is in the case of ( too.  Could find a fix for this after searching around a bit. Is there a way?

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'm working on Windows 7.  How can I permanently add a new path to the 'PATH' environment variable of the current user?  I tried to do so with wmic:  wmic ENVIRONMENT where "name='Path' and username='<%USERNAME%>'" set VariableValue="%Path%;%NEW_FOLDER_PATH%"   The result was:  No Instance(s) Available   And nothing was affected.  However if I try with the following with Administrative privilege:  wmic ENVIRONMENT where "name='Path' and username='<system>'" set VariableValue="%Path%;%NEW_FOLDER_PATH%"   It could always succeed.  The NEW_FOLDER_PATH doesn't contain any blank spaces.  How could I resolve this problem?

I have a system PATH variable with the system level config. I use the user PATH variable to complement the PATH with user-specific config.  I would like to update the user PATH variable from command-line for example with setx.  But I don't know how to reference the existing user path in setx.  In the following command (setx without /M)  setx PATH c:\my-user-specifc-bin-path;%PATH%   the first PATH means user PATH but the second %PATH% will be substituted by the "full" (user + system) PATH.  So it means that the entire system path would be duplicated in the user PATH... what is definitively not what I want.  I would like to:   Affect only the user PATH environment variable Append/Prepend one or more path element to the existing value Do it from the command-line.


I have this solved exercise in my lecture notes Let $G$ be a group and $H < G $, $\forall g \in G$ we define the conjugated subgroup with rispect to g as $gHg^{-1}$.  Verify that if H is normal, then $H=gHg^{-1}$ If $H \triangleleft G$, by the normality criterion for each $\gamma \in  G$ and $h \in H$ we have  $\gamma h\gamma^{−1} \in H $, so $\gamma h\gamma^{−1}  \subseteq H$. Taking $ \gamma = g$ and $ \gamma = g^{−1}$ we get $ghg^{−1} \in H$ and $g^{−1}hg \in H$ respectively In the first case we deduce that $gHg^{−1} ⊇ H$   ----> (1)? and in the second case that $g^{−1}Hg ⊇ H$, that is $H ⊇ gHg^{−1}$.--->(2)? In conclusion, $H = gHg^{−1}$ Can someone explain what is going on on (1) and (2) and tell if there is an error in this solution?. To prove (1)  they started witht $h\in H$, but I am not seeing they end with $h \in gHg^{-1}$. In (2) they should start with a $ ghg^{-1} \in gHg^{-1}$ and end with $ ghg^{-1} \in H$ .

Given the following definition of normal subgroup     A subgroup $H$ of a group $G$ is said to be normal if, for every $g\in G$: $$gH=Hg$$   I've tried to show that $H\mathrel{\unlhd} G$ if and only if we have $gHg^{-1}=H$ for every $g\in G$:  (if) Let $H\mathrel{\unlhd} G$, $g\in G$; if $l\in gHg^{-1}$, there exists $h\in H$ such that $l=ghg^{-1}$ and since $gh$ = $h'g$ for some $h'\in H$, then $l=ghg^{-1}=h'(gg^{-1}) = h'\in H$. Let $h\in H$; we can write $h$ as $hgg^{-1}$, and since $hg = gh'$ for some $h'\in H$, we obtain $h = hgg^{-1} = gh'g^{-1}\in ghg^{-1}$. So $gHg^{-1}=H$.  (only if) Let $gHg^{-1}=H$, $g\in G$; if we take an $l\in Hg$, $l = hg$ for some $h\in H$, we note immediately that $l=hg=(gh'g^{-1})g=gh'\in gH$. What should I do to show that $gH\subset Hg$?  I'm also wondering if this mess is correct, and if it is possible a more elegant proof of this fact.


Just starting out with photoshop CC 2017 and I am trying to add flame in my image but Filter<Render<Flame this option is not active, after a lots of efforts and time I am not able to activate them and couldn't find what's the problem behind of it. Can anybody guide me how can I activate them?

I am a beginner in Photoshop and trying to add flame in my image but I couldn't find that option at Filter>Render>Flame. I am using Photoshop CC 2015 version. Anybody please tell me how can I get that option?    Note: Photoshop has been updated to CC2017 and the filter is still missing.


When the user enters several names, I would like to break only if the user enters the value end.   I am trying this but it doesn't work.  Scanner sc = new Scanner (System.in);      String name = "";      while(name != "end"){       System.out.print("Enter name : " + name);       name = sc.next();       if (name == "end") {      break;      }    }

I've been using the == operator in my program to compare all my strings so far. However, I ran into a bug, changed one of them into .equals() instead, and it fixed the bug.  Is == bad? When should it and should it not be used? What's the difference?


When running the following code the counter testcount will update outside but not inside the \edef. Why?  \documentclass{scrartcl}   \global\newcounter{testcount} \message{TESTCOUNT NEW: \thetestcount} % outputs 0  \setcounter{testcount}{1} \message{TESTCOUNT SET: \thetestcount} % outputs 1  \addtocounter{testcount}{3} \message{TESTCOUNT ADD: \thetestcount} % outputs 4  \edef\trytoadd{%     \addtocounter{testcount}{3}     \message{TESTCOUNT EDEF: \thetestcount}     % still outputs 4 - why? } \trytoadd   \begin{document}  \end{document}

When I try to change a counter in an \edef using \stepcounter, I get a whole lot of error messages ("Missing \endcsname inserted"). When I try to do the same with \addtocoutner I get no error, but the counter remains unchanged within the \edef.  The following MWE produces "E, EE, F". If you remove the %, the errors will appear.  \documentclass{article}  \newcounter{testcount} \setcounter{testcount}{5}  %\edef\foo{\Alph{testcount}\stepcounter{testcount}\Alph{testcount}} \edef\bar{\Alph{testcount}\addtocounter{testcount}{1}\Alph{testcount}}  \begin{document}  \Alph{testcount} , \bar , \Alph{testcount}  \end{document}   Why is this and how can I achieve the effect that one would expect \foo and \bar to have?


I'm attempting to install git with sudo apt-get install git and this is the error I get: E: Could not get lock /var/lib/dpkg/lock-frontend. It is held by process 4284 (aptd) N: Be aware that removing the lock file is not a solution and may break your system. E: Unable to acquire the dpkg frontend lock (/var/lib/dpkg/lock-frontend), is another process using it?

I get this error when trying to use apt-get:  E: Could not get lock /var/lib/dpkg/lock - open (11 Resource temporarily unavailable) E: Unable to lock the administration directory (/var/lib/dpkg/) is another process using it?     How can I fix this?


I'm writing an article and eating numbering theorems according to the chapter, when I use \newtheorem ... elias numar with 1,2,3 ...  How do I number with 1.1, 1.2, 1.3 ... as far as I want and from there  starting to number with 2.1, 2.2 ...  Also, how to write "Definition" in the source of proposals, theorems ... without using the assigned number?  Note: I do not know how to define a chapter yet, is there any way to do a \begin{chapter}?

Some document elements (e.g., figures in the book class) are numbered per chapter (figure 1.1, 1.2, 2.1, ...). How can I achieve continuous numbering (figure 1, 2, 3, ...)?  And vice versa: Some document elements (e.g., figures in the article class) are numbered continuously. How can I achieve per-section numbering?  \documentclass{book}% for "vice versa" variant, replace `book` with `article`  \begin{document}  \chapter{foo}% for "vice versa" variant, replace `\chapter` with `\section`  \begin{figure} \centering \rule{1cm}{1cm}% placeholder for graphic \caption{A figure} \end{figure}  \end{document}   Bonus question: Is it possible to adjust the numbering of the sectioning headings themselves? Can I, e.g., switch from per-chapter to continuous numbering of sections in the book class?


I am curious how I would accomplish the following:  I have created a level with walls, ceiling and flooring (all as one solid 3D object). I then want to be able to import the object into Unity and once in Unity, I want to be able to select only the walls and give them a tag "wall" as well as be able to drop a texture onto the walls using unity and only have it texturize the walls, not the entire game object.  Same for flooring and ceiling.

I want to make the teeth a separate child object from the mouth. I want to know the best way to do this.   I have tried going into edit mode with Tab and trying to select all the vertices but that doesn't move the teeth. Is there an easy way to select just that part and make it a separate child mesh to the rest of the mouth?


Well the question is clear. The reason behind it is, that I think it would be handyt to have 1 64 GB USB stick on my keychain to repair or reinstall computers with. I was thinking of some kind of on stick bootloader or something.

I have no idea how to do this.  I have 7 iso's that I want to be able to easily boot from using a USB Stick and they are:   Windows 7 Ultimate x86 Windows 7 Ultimate x64 Windows 8.1 x64 Hirens BootCD Ultimate BootCD Windows XP Professional Ubuntu   Basically, I want to be able to boot my USB stick and instead of it just loading a single OS (like it does at the moment) I want a list of options ^ like above that I can choose and it will load that OS/ISO.  Any ideas how this can be achieved?


Some domestic flights (e.g. to remote islands like Australia's Christmas Island, or to exclaves like Alaska) occasionally have to divert due to weather or mechanical issues to a diversion airport that is outside the country of origin. Over at  the more general question of what happens when you divert to an unexpected country is discussed, but the discussion there seems to assume that we're talking about an international flight that lands in a third country and just need to arrange an emergency visa. In that case, passengers will have gone through appropriate outbound immigration clearance in the country of origin and will have international travel documents with them. On the other hand, if it's a domestic flight that has diverted, some passengers may not have any ID apart from what's necessary to board a domestic flight, and they won't have been recorded as having cleared outbound immigration and left the country of origin either. And I'm sure there's other differences in how domestic vs international flights operate that I'm not aware of. Does anything happen differently in this scenario versus diverting to a 3rd country on an international flight?

In a question about travel to Puerto Rico :  Note also that you should bring your green card and passport if you travel to or from Puerto Rico or the US Virgin Islands. While this is a purely domestic flight, and it is not strictly required for you to have your passport, if the flight has an emergency it may need to divert to an airport at an island which is not part of the USA. You will need your travel documents if this happens.  Are there historical examples of this happening, either in Puerto Rico or elsewhere? Presumably most passengers on the plane will have no passports in this case and would thus be ineligible to enter under default circumstances. Is it thus recommended to take a passport if your flight goes over foreign territory?


I was using Windows 7 and had 250GB hard disk which were divided in many drives.  I lost all the data on disk after installing Ubuntu.  Can I get my old data back?

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 Japanese friend asked me why we can say "Is he gone?" but we can't say "Is he arrived yet?". I corrected it to "Has he arrived yet?".  I'm not sure how to explain this grammatically :( Can someone please help me? Thank you.

So my Japanese friend asked me why we can say   Is he gone?  Is he finished?   But we can't say   Is he changed?  Is he arrived?  Is he fallen?  Is he shrunk?  Is he departed?  Is he died?  Is he melted?   I'm wondering what the grammar here is. changed, fallen, departed can be used as adjectives so shouldn't it be okay to use it in that kind of sentence? But I feel a entence like "Is he fallen?" sounds unnatural.   How do I go about explaining this in an easy-to-understand way to my Japanese friend?   I appreciate any help! Thank you.


I've got on object made with two walls and a floor for a virtual room, shaded as an Eeevee shadowcatcher, and have created some transparent cubes to act as window openings in the walls. So, the room has Boolean modifier running for two of the window "cutout" objects on one wall, and they work great. When I move the cutouts into the wall, holes appear! Whoo hoo! But if I copy one of these cutout objects and move it to the adjacent wall, Boolean difference doesn't work. It looks more like union, with "exact" box checked. I've tried copying the Boolean difference modifier to make sure settings are exactly the same, and they are. It's just that the difference modifier works on one wall and the floor, but not the adjacent wall! Here's a pic - you can see cutouts 1 & 2 work great, cutout 3 does not.  Any ideas?   Sorry - don't know how to embed these videos! You can see how the cube I'm trying to use as a "cutout" interacts with the various walls.  OK, solved! It was an issue of non-manifold geometry. I extruded the walls to give them some dimension, so now they have an official inside AND outside. Works now!

I'm trying to model an , but it's not going so well when it comes to the magazine of the weapon.   Next to the magazine is a mesh. I want to cut holes in the mag with that mesh. But the magazine just goes invisible or connects with the mesh when trying to execute the Boolean Modifier. I have tested to invert the normals and some other stuff, but it isn't working.


What is Stack Overflow, or in general, Stack Exchange's standing on (innocently positioned) personally identifiable data?  For instance, this following post has information that may be PID. It may or may not belong directly to the author, but could be an innocent byproduct of a naive user not understanding the implications!    What are the guidelines in such a case? Should we simply edit it and replace it with Chuck Norris' data, or flag it?

I've observed several incidents where users inadvertently posted detailed, sensitive information. For example, a Server Fault user who posted a question with working login credentials to his actual production server, or the Stack Overflow user who posted actual medical records as example data for his question.   What should be the procedure for handling such cases?


What is the fastest / most efficient way of getting all the distinct items from a list?  I have a List<string> that possibly has multiple repeating items in it and only want the unique values within the list.

Anyone have a quick method for de-duplicating a generic List in C#?


I got very curious to know why we use casting to allocate heap memory by malloc in C language like instructions below: #include<stdlib.h>  int main() {     double *var = (double*) malloc(sizeof(double));     return 0; }  Does malloc function return an appropriate address? If so, why do we use casting? Thanks for answering.

In , someone suggested in a  that I should not cast the result of malloc. i.e., I should do this: int *sieve = malloc(sizeof(int) * length);  rather than: int *sieve = (int *) malloc(sizeof(int) * length);  Why would this be the case?


You can look up file sizes on Google drive but it does not show the size of the whole folder. I've been looking for ways to get the size of a folder on Google Drive but couldn't find any. Is there any way to see how much space a folder has taken on Google Drive?

In Google Drive, you can use Sort split-button and choose Quota Used to show the size of each file there.   However, folder sizes are not shown.   I guess it's really a basic requirement in order to manage folders in Google Drive. I have a folder full of subfolders and files, and I can't go summing up the size of each file recursively.   I need to decide whether deleting this folder or not. But I need to know it's size beforehand.  Is there any way to see how much volume a folder has taken?


I was playing with some configurations for my home intranet and toyed with a few different non-standard port configurations. Along the way, Chrome seems to have gotten one of the configurations stuck in its head and won't let it go.  Specifically, accessing one of my servers at the regular :80 redirects to :99 (one of the configurations I played with and later removed). Other browsers aren't playing this game so it has to be something to do with Chrome retaining previous routing.  I've tried in Canary & IE (which weren't exposed to the test configurations) and both resolve the request correctly without swapping ports on me.  I'm at a loss and really frustrated. Any thoughts on how I can tell Chrome to reset itself without having to do a full re-install. Also, even with a full re-install, I'm not convinced that would resolve the issue if Chrome has let this issue make its way into my user data...

I am working on a web application that is using redirects (for pretty URLs).  I am trying to debug logic in the way the redirects are working. However Google Chrome keeps remembering the redirects and even after I change the code, redirecting the same way.  This is making it very hard to troubleshoot.  For example if I redirect /this to /that, then change my code to NOT redirect /this anymore. Google Chrome is still redirecting to /that. Like the redirect is cached or something. Is there a way to turn this off?


A public key for RSA encryption given by the pair (143,11). I am confused to solve it because if I select p =11, q = 13 so, n=143  then e should be 7?

When given $p = 5, q = 11, N = 55$ and $e = 17$, I'm trying to compute the RSA private key $d$.  I can calculate $\varphi(N) = 40$, but my lecturer then says to use the extended Euclidean algorithm to compute $d$. That's where I get stuck.    Here's my work so far:  First I use the Euclid algorithm to calculate:  40 = 2(17) + 6  17 = 2(6) + 5 6 = 1(5) + 1 = gcd   So I know the GCD is 1. Applying the 'extended' section of the algorithm:  6 = 40-2(17) 5 = 17-2(6) 1 = 6-1(5) 1 = 6-1(17-2(6)) 3(6) = 1 (17) 3(40 - 2(17)) - 1(17) 3(40) - 3(17)   I know the answer is $33$, but I have no idea how to get there using the extended Euclidean algorithm. I can't figure out why I'm getting $3(40) - 3(17)$ when I know the answer should contain $33$.


I have some info in my database. I subsequently echo json_encode($array); the array in which the info is contained and return it to the page displaying the content via AJAX/jQuery.   For example;   "Dave's apples are sour".  My webpage displays it as:  "Daveâ€™s apples are sour".  This is obviously a character encoding issue. we've never had issues until my hosting company was acquired by a different company.  The header of the page in which the content is displayed contains:  <meta http-equiv="Content-Type" content="text/html; charset=UTF-8" />   Since then we've tried the following:   mysqli_set_charset($conn, "utf8"); <- does not solve the problem echo json_encode( $array, JSON_UNESCAPED_UNICODE ); <- does not solve the problem   A echo mb_detect_encoding(); on the specific variable that contains "Dave's apples are sour" echoes: "UTF-8".  When examining the console of the page on which the info is displayed reveals that the content arrives to the script "messed up", FireBug shows the response literally being: Daveâ€™s apples are sour.  The column in which the data is contained has the following structure:  ID, Name, Type, Collations  6, BlogPost, text, utf8_general_ci    Does anybody have some new insights? I have been searching for hours on StackOverflow without result.

I'm setting up a new server and want to support UTF-8 fully in my web application. I have tried this in the past on existing servers and always seem to end up having to fall back to ISO-8859-1.  Where exactly do I need to set the encoding/charsets? I'm aware that I need to configure Apache, MySQL, and PHP to do this — is there some standard checklist I can follow, or perhaps troubleshoot where the mismatches occur?  This is for a new Linux server, running MySQL 5, PHP, 5 and Apache 2.


My main board has only usb 3.0 ports. If I connect those ports to USB 2.0 ports on pc case will they work as USB 3.0 port (with full speed) or will they work as USB 2.0 ports (with lower bandwith). In other words do 2.0 ports differt from 3.0 ports on computer casing?

If a computer case has a USB port in the front, will it support USB 3.0 if my motherboard supports it? Or does the case vendor need to specifically mention USB 3 support? (BTW, I haven't seen such case yet.)


My Ubuntu Software Center keeps crashing and it won't open :(   This happened after I installed GNOME 3.10 and then I GNOME 3.10 but the issue keeps happening.  Is there a way to reinstall the USC?

Since migrating to a true install and upgrading to 12.04 I have had several problems that seem to relate to the Ubuntu Software Center. Hanging at applying changes and blank screen on screen lock only when it is running, for instance.  My question is: Can I safely uninstall and reinstall Ubuntu Software Center and could this possibly fix those problems or are they just bugs I have to wait for updates for?


I'm experiencing a very annoying problem on my Windows 7 workstation. Two or more times per day the computer freezes for more than one minute (with the azure ring cycling), then it works as expected. The CPU utilization during these periods of unavailability is supposed to be low: I'm not asking for heavy computation when the problem occur.  The computer freezes while I'm executing ordinary activity such as inserting text from keyboard, opening a folder, opening a file or clicking a link in the browser.  There is no record of malfunctioning in the event log. The hard disk seems ok, I had some problem with the integrated nic and disabled it after adding a PCI one.  The workstation is inside a windows domain and folder redirection is active.  The operative system was reinstalled after the first symptoms, but nothing changed.  Do you think it can be due to a nearly faulted hardware ?  How can I investigate the root causes of this problem ? I completely lack adequate tools and ideas...  Thanks Filippo

A machine is described as being "really slow" or "freezing". How can I troubleshoot/resolve this issue? What should be the first steps to take?


I am stuck on a single view in my project. I can't get the file toolbar at the top or the timeline at the bottom.

Here is the blender window I have:    As you see, it doesn't have the menu that is usually displayed at the top of the screen.  How can I get the menu back?


Is there any solution for drawing simple graphs in LaTeX like the following? I came across tikz but couldn't figure out how to do it. Are there also possibilities to extend such graphs without caring too much about node distances etc?

Is there some package to draw nice RDF graphs, such as the one below (taken from )?  Can such a graph (with the same style) be produced in TikZ?


I have a folder structure that looks like this:   Files/0/Image1.png Files/0/Image2.png Files/0/Image3.png Files/1/Image4.png Files/1/Image5.png  Files/1/Image6.png   All the way to 1000.  I need to get all the contents of the subfolders into the directory "Files", so there's no subfolders anymore. Just the parent folder which holds all the files.  Is there any easy way to do this? Except for C/P'ing 1000 folders?

In Windows 7, I have a directory of folders which each contain files as their contents.  Is there any way to extract all of the contents of each the folders to a separate location other than cutting and pasting the content one folder at a time?


I have converted an image file into hex file which has R,G,B and alpha values in multiple columns. For example :  3c 48 36 ff 1d 2b 19 ff 08 18 06 ff 08 17 05 ff 14 1f 0d ff 1b 22 11 ff 1a 1f 0e ff 1a 1b 0b ff 1d 1a 0b ff 20 1a 0b ff 23 1a 0c ff 23 1c 0d ff 24 1d 0e ff 24 1d 0e ff 21 1c 0d ff 23 1c 0d ff 1f 1a 0b ff 1e 19 0a ff 1c 19 0a ff 1e 1a 0b ff 20 1a 0b ff 24 18 0b ff 23 18 0a ff 21 18 0a ff  Now I want a way to read and store this data as a collection of 32 bits( i.e. 4bytes). If I do not know how bytes are present in the file (since file can be of any size), how can I achieve this?

I have a text file named "Hex_data.txt". I want to load content of Hex_data.txt into a variable name RAM in verilog. When I try this, I get an error that the text file can't be found. Where is this file loaded from?  The content of "hex_data.txt" :            21            a4          2a          26          7a          ff           6f   I want to create a variable name "RAM" defined like:   reg [6:0] RAM; in which the above content save like:  RAM[0]=21     RAM[1]=a4           RAM[2]=2a             RAM[3]=26            RAM[4]=7a             RAM[5]=ff             RAM[6]=6f   I wrote a code:  module file_read;      reg [7:0] RAM [0:6];          initial $readmemh("Hex_data.txt", RAM);   integer i;               initial begin                    $display("data:");                for (i=0; i < 7; i=i+1)                $display("%d:%h",i,RAM[i]);              end                 endmodule        But the above code not working. How can i get desired output?


I accidentally touched "upvote" twice, and I saw this message:    I'm assuming it meant "You cannot perform this action for another 1 second," but there's so many errors I can't be sure ;-)

In the Android app, the notification that is displayed when you up-vote two answers too quickly has a grammar error. There does not appear to be a space between the 1 and seconds. This message was displayed when I did the following:   On a question with more than one answer (probably easiest on a question with multiple short answers) Up-vote two different answers very quickly (probably within a second of each other) Notification appears if you voted twice too quickly   Also, and this just might be my personal opinion, I think it should be worded a little better. Instead of You perform this action for another 1 seconds, I think it would make more sense if it read You can't perform this action for another 1 second or You cannot perform this action for another 1 second. The way it is currently worded makes it sound like your are doing something for another second but really, you can't do something for another second.    I'm on version 1.0.3