I have this variable:  var name = "Matemáticas"   And I would like to find in database, a model that it's name is either "Matemáticas" or "Matematicas" or "MATEMÁTICAS" or "MATEMATICAS" or "MatemátiCas" or "MatemaTicAs".  I try to do this:  var first_rg = name + '[a-zA-Záéíóú]' var rg = new RegExp(first_rg, "g") Theme.findOne({name: rg}, function(error, theme) { }   But it doesn't work. I have not idea how to do this.  Thank you

I need to compare 2 strings as equal such as these:     Lubeck == Lübeck   In JavaScript.  Why? Well, I have an auto-completion field that's going out to a Java service using Lucene, where place names are stored naturally (as Lübeck), but also indexed as normalized text,   import sun.text.Normalizer; oDoc.setNameLC = Normalizer.normalize(oLocName, Normalizer.DECOMP, 0)     .toLowerCase().replaceAll("[^\\p{ASCII}]","");   This way some-one who doesn't know to type "Mèxico" can type "mexico" and get a match which returns "Mèxico" (among a lot of other possible hits, like "Café Mèxico, Dubai, UAE").  Now the thing is I don't have the ability to change the service to do any highlighting on the server side, therefore I am highlighting on the client JavaScript side with something like:  return result.replace( input.replace(/[aeiou]/g,"."), "$1");   It's a little more fancy because I am escaping special regex characters in the input. This is fine for simple one word matches at the beginning of a hit, but it really breaks down if you suddenly wish to support multi-word matches like "london cafe":  input = input.strip().toLowerCase(); //fyi prototype's strip is like trim re = new RegEx(input.replace(/[aeiou]/g,".").replace(/\s+/g,"|"),"gi"); return result.replace(re, "$1");   This doesn't work for say "london ca" (was typing london cafe), because it would mark "Jack London Cabin, Dawson City, Canada" as: "Jack London cabin, Dawson City, Canada" [note the "ck" and "Ci" particularly]  Therefore I'm sort of looking for something that's not as crazy as:  input = input.strip().toLowerCase(); input = input.replace(/a/g,"[ÀàÁáÂâÃãÄäÅåÆæĀāĂăĄą]"); input = input.replace(/e/g,"[ÈèÉéÊêËëĒēĔĕĖėĘęĚě]"); // ditto for i, o, u, y, c, n, maybe also d, g, h, j, k, l, r, s, t, w, z  re = new RegEx(input.replace(/\s+/g,"|"),"gi"); return result.replace(re, "$1");   Is there a compiled table I can refer to mapping a range of characters which are accented versions of an other character to that character, by which I don't mean the plain unicode chart. And if so, could I avoid using weird, possibly slow, RegEx statements?  About the bounty: Before I started a bounty there were two answers, the one pointing me to doing it in Ruby, and  that  wrote which was a completion of the basic form I'd put in my question. Now don't get me wrong, I really appreciate working it out as completely as he did, but I just wished that there might be another way.  It seems so far that everyone who's dropped by to look at the question and answer has decided that MizzardX covers it just fine, or that they have no different approach. I would be interested in a different approach, and if it simply isn't available before the bounty closes, MizzardX will win the bounty (though in a cruel twist, his edits mad it a community wiki answer, so I'm not sure if he'll get the bounty!)


I mistakenly pasted a message in a WhatsApp group. I noticed that immediately and turned off my internet. The message was still not sent (single tick did not appear), and I deleted that message and turned on the internet.  Will this stop the message from getting sent to the group?

I'm using Whatspp on a Moto G (1st Gen) mobile. Today I've accidentally sent a message to my friend while my mobile data was in off mode. I have deleted that message immediately. Now will the message be delivered to my friend if i turn on the mobile data?


I use lineno packaage for line numbering. How to restart line number for every new paragraph? The only thing it can restart the numbering is for each new page. Is there any way in Latex that I can have the number of the line for each paragraph so that I know how many lines in each paragraph?

I'm using the lineno package with the pagewise option but I need a way to get the numbering restart every paragraph break. I need a general solution to pass to the latex command, e.g.:  latex "\AtBeginDocument{\RequirePackage[pagewise]{lineno}\linenumbers}\input{mydocument.tex}"   I read the lineno manual but the package does not provide this feature. Is there any trick to do that?


Is there a way to view the "newest questions" section with excluded tags? E.g.  Show all C#-tagged questions but not those which are also tagged with WPF

I'd like to be able to do the following in the search box:  shell [cmd] [-linux]   to search for "questions containing the 'shell' term AND having the 'cmd' tag AND NOT having the 'linux' tag"  Note that "shell" is not a TAG !


Let $x_{1},x_{2},\cdots,x_{n}$ be real numbers. Show that     $$\sum_{i,j=1}^{n}|x_{i}+x_{j}|\ge n\sum_{i=1}^{n}|x_{i}|.$$   I think this problem may be solved using nice methods, but I can't find them yet; I know this may be of use: $$|a|+|b|\ge |a+b|.$$ But I can't make it work. Thank you everyone.

I have been trying to prove (the left half of) the following inequality:  $$ \underbrace{\sum_i \sum_j |x_i| \le \sum_i \sum_j |x_i + x_j|}_\textrm{?} \le 2 \sum_i \sum_j |x_i|$$  (All $x_i$s are arbitrary reals and sums are over $1, 2, \dots, n$)  The right half follows by a simple application of the triangle inequality, but the left half isn't as simple.  I tried induction, and I could reduce the above problem to proving the following statement:  $$ \sum_i |x_i + x_{n+1}| + \sum_{i=1}^{n+1} |x_i + x_{n+1}| \ge \sum_{i=1}^{n+1} |x_i| + n|x_{n+1}|$$ or more simply (replacing $x_{n+1}$ by $y$), $$ 2\sum_i |x_i + y| \ge \sum_i |x_i| + (n-1)|y|$$  However, I don't know if the above "reduction" is any simpler than the original problem itself!  Can I continue the above line of thought, or is there an easier way to solve this problem? Any help is appreciated! :)


By using  bpy.data.objects['object1'].parent = bpy.data.objects['object2']    to parent one object to another the parented object gets a weird offset. Why does this happen and how can i fix this?

I have automated the task of parenting in Blender with Python. The code affects the relation parent according to the two last characters of the names of the objects. example:  obj1.name = Cube.01 obj2.name = Suzanne.01   If obj1 is in the group "children" and obj2 is not in the group "children" : obj2 is the parent of obj1. My code works, but without keeping children's transformation. How can I do to keep the children's transformation?  import bpy  for obj1 in bpy.context.selected_objects:         if obj1.name in  bpy.data.groups["Children"].objects:     a = obj1.name[-2:]      for obj2 in bpy.context.selected_objects:             if obj2.name not in  bpy.data.groups["Children"].objects:                 b = obj2.name[-2:]                 if a == b:                                           obj1.parent= obj2


Recently, I had installed Ubuntu 19.04 alongside Windows 10. For a couple of days, it was loading fine and then the PCIe Bus error as mentioned in the title started showing up and it was sending infinite messages. I tried several fixes but none of them worked out. Then I tried installed Ubuntu 18.04.2 LTS but started facing the same error after a couple of days. I then installed Linux Mint alongside Windows 10, but the same error comes up.  Hardware Details:  Asus X541U Ram:4+4GB Hard disk: 500 GB(250 for windows 10 & 215 GB for Ubuntu) 64-bit Architecture OS used: Windows 10 Single Language and Linux Ubuntu 19.04, 18.4.2 LTS and  Mint 19.2 Cinnamon   I have added the screenshot of the error. I am facing this error only on this system. On my other system, dual booting is working very well. Why is this happening?

I have Ubuntu 16.10 (although the same happened on 16.04) on a dual boot with Windows 10. I noticed some time ago that my kern.log file was getting pretty big (10GB or more) so I decided to check it. The same error seems to be repeating every second or less:  Dec 19 17:31:01 andrew kernel: [   99.027473] pcieport 0000:00:1c.5: PCIe Bus Error: severity=Corrected, type=Physical Layer, id=00e5(Receiver ID) Dec 19 17:31:01 andrew kernel: [   99.027474] pcieport 0000:00:1c.5:   device [8086:9d15] error status/mask=00000001/00002000 Dec 19 17:31:01 andrew kernel: [   99.027475] pcieport 0000:00:1c.5:    [ 0] Receiver Error         Dec 19 17:31:01 andrew kernel: [   99.027479] pcieport 0000:00:1c.5: AER: Corrected error received: id=00e5 Dec 19 17:31:01 andrew kernel: [   99.027826] pcieport 0000:00:1c.5: can't find device of ID00e5 Dec 19 17:31:01 andrew kernel: [   99.027887] pcieport 0000:00:1c.5: AER: Multiple Corrected error received: id=00e5   I have tried adding to the grub pci=nomsi and pci=noaer but it keeps popping up. I am using a ASUS Laptop with an Nvidia Geforce 920M. Maybe that's the reason?


I have a string like :  "\"[\"a\",\"b\", \"c\"]\""   How to convert this to a list of strings  Could you suggest me a nice way of doing it in Java?

In Java is there a way to check the condition:  "Does this single character appear at all in string x"  without using a loop?


I was following a tutorial on YouTube beginner, and when I added quick smoke and hit play, nothing showed up.  I tried a bunch of different things but still cannot see smoke. If its not showing do you think that means my laptop isn't able to support it, or is there something else going on that I'm not doing.

Whenever I add a Quick Smoke effect, I can't preview it on the viewport unless I bake it.   And Yes, I added the Smoke Domain on the object.   I've seen tutorials like this  and this  that clearly shows the possibility of previewing the smoke before baking it.   I'm using Blender on a Mac with AMD GPU. I would guess that this is something related to OpenGL, as thoroughly explained here -  but that's for Windows.   Does anyone have any idea how to fix this?


This is what I want to write:    Apparently, the following doesn't work  \sqrt[ \sqrt[\log n]{n} ]{x}  The error is that the argument of \sqrt has an extra }. This seems like a bug to me. Is there a way to write this symbol?

LaTeX is trying to add a missing $ that I don't want to the following code. Minimal working example:  \documentclass[letter,12pt]{article}  \newcommand{\monkeyBeans}[2][]{   \parbox{4in}{#1} }  \begin{document}  \parbox{4in}{$[a, b]$}   \monkeyBeans[$[a, b]$]{yo monkey}  \end{document}   If I try any of the following lines in my document instead of the call to monkeyBeans, there is no error:  \parbox{4in}{$[a, b]$}  \monkeyBeans[yo monkey]{$[a, b]$} \monkeyBeans[$(a, b)$]{yo monkey} \monkeyBeans{$[a, b]$}{yo monkey}   What is the deal with square brackets in optional arguments?


I'm trying to understand how many licenses I may need if we decide to pursue a SQL Server Developer license for our Testing environment.  We would have 5 actual developer and DBA's physically accessing the database to perform work.  The part where I get confused is our users will be testing our applications from a web server. This webserver will communicate with a 'logic' server that will perform all the database interaction.  At our highest level of testing we probably have 20 users on the system, but depending on the time of year they may be different users.  Example: During fiscal year end we may have 20 people from account on the system, but during benefit enrollment time of year we may have 20 HR/Payroll users testing on the system.  In reading different sets of documentation and speaking to our license reseller I still do not have a clear idea of how many licenses I need.    I think I can purchase 5 for the actual developers/DBA's and one license for each SQL accounts the services uses?  This is the how we are structured currently.  The servers have SQL Server accounts for authentication.

Do you use SQL Server Developer Edition on server-class machines in DEV and STAGING environments?  I am working on a large project where (if it passes the proof of concept stage) we will have several large geographically distributed enterprise class database servers running SQL Server 2012 Enterprise Edition.  We will have a production environment will initially have 3 servers, our Staging environment will have a minimum of 3 servers, and our Development environment will have 1 server (hosting three instances).  I was under the impression that we would only need to acquire Enterprise licences for the actual production servers, and we could get by with developer edition in our developer and staging environments because they are not "production".  Other sources have told me that we need to have an enterprise licence on all of the above mentioned machines, and that the developer edition is only meant for a single developer on their workstation.  Since developer edition has all the sexy features of Enterprise, I can't really see the value of it on a workstation class machine, especially for developing and testing the type of high availability system we are building.  If we have to fork out Enterprise licences for a dev server, that will just about kill our proof of concept stage, thus killing the project.  Forcing an enterprise licence on a staging environment will make management just want to skip staging altogether.


I can connect to my wifi fine, but when it is connected the led light to indicate if I am connected to the network keeps blinking. When I disconnect it stays solid. My network is hidden and has a MAC filter. I also want to add that I contacted my internet provider and ruled out them as a problem. Because my connection is 45 Mb/s wired but 16 Mb/s wireless. Where as when I had Windows 7 my average wireless speed was between 35 Mb/s and 40 Mb/s  Here is a summary of some of my specs on my hp pavilion dv6000  Processor  Processors Intel(R) Core(TM) i3-2310M CPU @ 2.10GHz 800.00MHz Intel(R) Core(TM) i3-2310M CPU @ 2.10GHz 800.00MHz Intel(R) Core(TM) i3-2310M CPU @ 2.10GHz 800.00MHz Intel(R) Core(TM) i3-2310M CPU @ 2.10GHz 800.00MHz   Network Interfaces Network Interfaces eth0 0.00MiB 0.00MiB lo 0.11MiB 0.11MiB virbr0 0.00MiB 0.00MiB wlan0 3.61MiB 0.69MiB -Computer- Processor : 4x Intel(R) Core(TM) i3-2310M CPU @ 2.10GHz Memory : 3994MB (1391MB used) Operating System : Ubuntu 14.04 LTS User Name : john (John Syzemore) Date/Time : Sun 20 Apr 2014 12:37:24 AM MST -Display- Resolution : 1366x768 pixels OpenGL Renderer : Mesa DRI Intel(R) Sandybridge Mobile X11 Vendor : The X.Org Foundation -Multimedia- Audio Adapter : HDA-Intel - HDA Intel PCH -  Input Devices- Lid Switch Power Button Power Button AT Translated Set 2 keyboard Razer Razer Naga Hex Razer Razer Naga Hex HP TrueVision HD SynPS/2 Synaptics TouchPad Video Bus HDA Intel PCH HDMI/DP,pcm : 3= HDA Intel PCH Front Headphone HDA Intel PCH Mic ST LIS3LV02DL Accelerometer HP WMI hotkeys -Printers (CUPS)- HP-Officejet-4620-series : Default -SCSI Disks- ATA Hitachi HTS54755 hp DVD-RAM UJ8B1

I have a Dell E6510 and after installing Ubuntu and connecting to a wireless network, my Wifi LED keeps blinking all the time, probably in response to traffic.   This is really annoying because it keeps drawing my attention away from the screen. Is there any way to turn this functionality off and just let the wifi light stay on all the time as long as it has a wifi connection?   Here is my lspci for the wifi:  Network controller: Intel Corporation Centrino Advanced-N 6200 (rev 35)


I have tryed to change the password with the information that jorge castro has put up. when i get to the UNIX password change it says (Authentication token manipulation error) then says password unchanged. is there another way to change it.

I am logging in to my Ubuntu Server using my username. Once I am logged in I am typing passwd command. Entering a new password but a second after getting following error messages:  passwd: Authentication token manipulation error passwd: password unchanged   What is wrong here? How can I change my password otherwise if I don't have access to that server physically, i.e. I am connecting remotely with ssh using terminal.


If $a\equiv 1 \pmod n$ and $d\mid n$, then  $a\equiv1 \pmod d$ is true. That is the question I am trying to understand so I have some understanding of the question but cant place my finger on exactly why it is true. $n = d \times k$ for $k\in\mathbb{Z}$ $a = k \times n +1$ and $a= k \times d +1$ $n \mid(a-1)$ and $d \mid(a-1)$

I noticed relation between modulo operation and number which is power of two  Example I have to calculate $ 3431242341 \mod 2^5 $, which is $ 5 $ but it is equivalent to  $ ( 3431242341 \mod 2^9 ) \mod 2^5 $   I tried many examples and it seems to be true in general, and I am not sure if it is a coincidence or true in general that I can use first modulo operation ( greater number) and the result will be the same.


New to Blender what is this black dotted line indicating?. No other objects have it when i select them. I tried setting origin to 3d cursor but th eline is still there?.

In Object Mode I sometimes see these black dotted lines starting at some of my objects and ending in some random spot in the space. What are they, how do I manipulate them, and why?


Let $f(z)=z+\sum_{n=2}^\infty a_nz^n$ have a positive radius of convergence. Does there exist a series $g(z)=z+\sum_{n=2}^\infty b_nz^n$, satisfying   $$ f(g(z))=z\text{?}\tag{49} $$   Does this series have a positive radius of convergence? Are the coefficients $\left\{b_n\right\}$ uniquely determined?   I don't think completely expand all the terms of f (g(z)) is a good idea, can you give me some other methods to solve it? Thank you so much.  .

Let $ f(z) = z + \sum\limits_{n=2}^{\infty}a_nz^n $ have a positive radius of convergence. Does there exist a series $ g(z) = z + \sum\limits_{n=2}^{\infty}b_nz^n $, satisfying \begin{equation} f(g(z))=z? \end{equation} Does this series have a positive radius of convergence? Are the coefficients $ \{b_n\} $ uniquely determined?


I'm still on 10.14. I would like to work with Xcode 12 now, which only supports 10.15+. Yet, no direct download for 10.15 can be found anymore. I do not want to make the move to macOS 11 Big Sur yet as it seems too unstable.

Sometimes it's hard to search for older versions of macOS & OS X  on the App Store.  This is an attempt to provide the canonical QA for this issue, as per the Meta QA -  I expect it to be modified over time to hopefully become a complete information resource.  How can I get any older version of a Mac OS to be able to run as a VM, or to reinstall on my Mac?


A question was asked:   The  basically says the following:   Create a local texmf tree, say at the folder ~/localtexmf, Add the folder to the search path, e.g. on a Mac running TeXLive  tlmgr conf texmf TEXMFHOME "~/Library/texmf:~/localtexmf"    Another  suggests to edit the .bashrc file and to add a line  TEXINPUTS="~/localtexmf:"   Question: What is the difference between TEXMFHOME and TEXINPUTS? Are the two solutions basically the same?

provides a nice explanation of how to manipulate TEXINPUTS or register a local texmf tree.   Q: When integrating local additions, is there a reason to prefer one approach over the other?  I'm guessing that TEXINPUTS is just regarded as the quick and dirty approach while registering a local texmf tree may be a better idea if you have a lot of files within a logical directory structure to which latex needs to be pointed.  If I'm missing something here I'd love to hear about it :)  This question is a follow-up to my post


Null Pointer Exception occurs at times randomly. Occurs mostly when pressed the backpressed from a particular fragment.   Exception occurs when tries to pass a param called "userregid" using Volley.   params.put("userregid", Utils.getString(((BaseActivity)getActivity()).get_hospital_userreg_id()));   I wrote a method in a BaseActivity to identify the hospital_userreg_id according to the conditions. This is the function ,   public int  get_hospital_userreg_id() {      int userreg_id = 0;      switch (AppConst.HOSPITAL_CURRENT_ID) {          case 36:             userreg_id = AppConst.HOSP_ONE_USERREG_ID;             break;         case 37:             userreg_id = AppConst.HOSP_TWO_USERREG_ID;             break;     }      return userreg_id; }   I feel that the issue is related to calling the function from the fragment. Any solutions ?

What are Null Pointer Exceptions (java.lang.NullPointerException) and what causes them?  What methods/tools can be used to determine the cause so that you stop the exception from causing the program to terminate prematurely?


I'm having issues with my ubuntu server version 12.04 installed on a HP550 laptop, when i try sudo apt-get install <programname>, e.g apache2 it will not work, saying E: Unable to locate package apache2.  I have tried to look/edit the sources. but they will not work either the gedit command is broken too, i am trying gedit /etc/apt/sources.list for those wondering, is this a case of the computer network not configured properly? it downloaded a language pack easily enough in the installation though. how do i fix this? a prompt reply would be appreciated.

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


I bought some frozen, boneless chicken breasts that I wanted to cook tonight. Should I leave in the package and immerse it in hot water, or should I thaw it in the microwave (in or out of the package)?

What is the safest, quick way to defrost chicken? Microwave? Running water over it?


I want to invalidate my password field if password strength is weak.  I am using "pstrength" method to calculate password strength.  Bar below password input box changes color as password strength increases.  I am using jQuery Validation plugin to validate rest of my form fields which is working fine.  I need to trigger error messages if password is weak , say if strength is less than 30 count(e.g. in fiddle) and strength bar color is yellow or green.  I have added fiddle for the same   addMethod will add new validation method but actually i need to trigger error from external functionality "pStrength" when passwordStrength is lower than expected  I tried to call it as for e.g.  if(passwordStrength < 30){              var $validator = jQuery("#registerForm").validate();             $validator.showErrors("password strength is low");          }   But no luck

How do you create a simple, custom rule using the jQuery Validate plugin (using ) that doesn't use a regex?  For example, what function would create a rule that validates only if at least one of a group of checkboxes is checked?


I have one complex object just like this;  Object A    Object B     Object C       Object D         property A         property B   So If I need to show the property A in my view, I need to     A.getB().getC().getD().getPropertyA();   but what if my user doesn`t send the object C?  so I need to create one If for every object  if(A.getB() != null){   if(A.getB().getC() != null){     if(A.getB().getC().getD() != null){       //here I can show the propertyA     }   }  }   now I have to show this property in 3 views  There is a better way to does this? a framework or something like this to solve this problem?

I use object != null a lot to avoid . What is an alternative to: if (someobject != null) {     someobject.doCalc(); }


If I have a player character that can move 8-directionally, I can set the rotation of the player to face the direction of movement. But if I want to smoothly rotate to a direction, sometimes the player will take the "long way around" (i.e., player is at -90 degrees, facing right; I press S and it will rotate 270 degrees to be at 180 degrees, facing down). How can I fix this? I tried adding 360 to the desired angle until it was within 90 degrees, but that didn't work (probably just because I'm too tired, though). Any help is appreciated!

I am working on some movement AI where there are no obstacles and movement is restricted to the XY plane. I am calculating two vectors, v, the facing direction of ship 1, and w, the vector pointing from the position of ship 1 to ship 2.  I am then calculating the angle between these two vectors using the formula  arccos((v · w) / (|v| · |w|))   The problem I'm having is that arccos only returns values between 0° and 180°.  This makes it impossible to determine whether I should turn left or right to face the other ship.  Is there a better way to do this?


Find the condition on a & b so that the two tangents drawn to the   parabola $y^2=4ax$ from a point are normals to the parabola $x^2=4by$   I tried finding the joint equation of tangents to the parabola $y^2=4ax$ like $SS_1=T^2$.Then I tried to apply the condition of normality to the joint pair of straight lines.But its becoming too huge.Please let me know if you can think of a shorter and more elegant method to prove $a^2>8b^2$.Thanks.

Find the condition on $a$ and $b$ so that the two tangents drawn to the parabola $y^2=4ax$ from a point are normals to the parabola $x^2=4by.$  The required condition is $a^2>8b^2$.I dont know how to prove it.I tried.  Let $(h,k)$ be the point from where tangents are drawn to the parabola $y^2=4ax$.Let $m_1,m_2$ be the slopes of the tangents.Equations of tangents are $y=m_1x+\frac{a}{m_1}$ and $y=m_2x+\frac{a}{m_2}$ and equations of normal to the parabola $x^2=4by$ is $y=m_1x-2bm_1-bm^3_1$ and $y=m_2x-2bm_2-bm^3_2$.  As $y=m_1x+\frac{a}{m_1}$ and $y=m_1x-2bm_1-bm^3_1$  are the same lines.Therefore,$\frac{a}{m_1}=-2bm_1-bm^3_1$  $bm^4+2bm^2+a=0$  And I am stuck.I cannot get the desired condition.Please help me.


At area51 are multiple proposals for sites that already exists, only in another language. Actually I've committed for the German unit of Stackoverflow. And that just because I want to provide some of the already collected knowledge to those that cannot speak English.  I'm aware that the automatic translation today will not gain the quality we're all striving for. But I think the sites would gain more quality if the users are able to translate every single post into English or their native language.  So I will explain my vision: The main language will be English, but everyone can post in native. The posts will drive a new queue where reviewers just have to decide if there is a translation into English needed. Answers in English have to pass a queue which only native speakers can review and translate it from English. If a post is available in another language than English, there will be an option to show it.   No matter how many non-English speakers would post questions in their native language, "normal" users will not be disturbed by post they cannot read. Nonetheless more users could participate, so it would help to grow the community and improve the quality, because forcing someone to use a specific language will reduce the amount of good questions.  Further the time to get an answer in cause of the queue-passing will encourage the users to post in English. Rewarding users for approved translations will boost the range of people which could gain knowledge.    After posting this, I've found the results in the related link list which I've searched for before, so myself flagged this one as duplicate...  More links:

Related to the question , I wonder if it wouldn't , to instead of re-creating Stack Overflow sites in other languages   with duplicate content of Stack Overflow in the best case, and original content that would be helpful at Stack Overflow but won't be posted there then in the worst case,  offer translations of Stack Overflow? My idea would be, you start off with a  result (which is probably not that great but enough to help) as a separate database and ask users to improve the translation by editing, maybe rewarding good translations as an incentive1. One important requirement would however be that new questions/answers were translated back to English so that the entire international Stack Overflow-conglomerate could still benefit from them without Secession.  1) Something more than the 2 rep for suggested edits might be adequate. I don't know if upvoting on translations made a nice option, the feature-request  is still open...


My website is hosted with Linode, I installed webmin on Ubuntu 14.04 to manage it. Recently my database server keeps shutting down, when I look at /var/log/mysql, there are several log files in there  -rw-r-----  1 mysql adm    14642 Jun 28 07:25 error.log -rw-r-----  1 mysql adm      264 Jun 27 05:48 error.log.1.gz -rw-r-----  1 mysql adm      256 Jun 26 02:23 error.log.2.gz -rw-r-----  1 mysql adm      426 Jun 24 20:19 error.log.3.gz -rw-r-----  1 mysql adm      295 Jun 24 03:18 error.log.4.gz -rw-r-----  1 mysql adm      141 Jun 22 15:07 error.log.5.gz -rw-r-----  1 mysql adm      215 Jun 22 03:38 error.log.6.gz -rw-r-----  1 mysql adm      345 Jun 21 01:28 error.log.7.gz   Most of the error_log contents are like   160621  8:34:52 [Warning] IP address '122.114.126.30' could not be resolved: Temporary failure in name resolution 160621 18:41:36 [Warning] IP address '58.221.71.35' could not be resolved: Name or service not known 160621 21:29:02 [Warning] IP address '58.221.42.196' could not be resolved: Name or service not known 160622  1:36:17 [Warning] IP address '121.41.74.27' could not be resolved: Name or service not known 160622  7:38:24 [Warning] IP address '118.192.162.95' could not be resolved: Name or service not known   I read this  but I am not sure whether I understand the answers correctly. Does this mean people from above IP address were trying to login to my database? If they are attacks, what can I do to deal with them or I can just rely on linode to fend off these attacks? And I notice the earliest of these errors were from 6/21, I wonder there are not any error_logs before that date? Or there are, but they are in somewhere else?  Thank you!

I'm running MySQL5.6.3 on a CentOS 6.1 virtual machine running on Windows XP in .  The network card is configured in bridge mode, so my physical & virtual machines share the same ethernet card.  On the virtual machine, everything works fine: internet access, DNS lookups. However, connections to the MySQL daemon take a while, and the logs keep showing this warning:     [Warning] IP address '192.168.1.201' could not be resolved: Temporary   failure in name resolution   192.168.1.201 is my host machine on which I'm runnning the MySQL client.  Looks like although DNS lookups work fine, reverse DNS lookups end up in a timeout.  Here is the virtual machine configuration:  # cat /etc/sysconfig/network-scripts/ifcfg-eth0 DEVICE="eth0" HWADDR="08:00:27:4B:3D:7C" NM_CONTROLLED="yes" ONBOOT="yes" NETMASK=255.255.255.0 IPADDR=192.168.1.200 GATEWAY=192.168.1.1 PEERDNS=yes  # cat /etc/resolv.conf nameserver 192.168.1.1   Is there something wrong in my network configuration?


When i run the following code,  import urllib.request, urllib.parse, urllib.error from bs4 import BeautifulSoup url= "http://couponmaths.com" htmltext = urllib.request.urlopen(url).read() soup = BeautifulSoup(htmltext) print(soup.get_text()) print(soup.prettify())   I get the Error:  UnicodeEncodeError: 'charmap' codec can't encode character '\u201c' in position 16975: character maps to <undefined>   Can anyone please help me with this?

When I try to print a Unicode string in a Windows console, I get an error . UnicodeEncodeError: 'charmap' codec can't encode character .... I assume this is because the Windows console does not accept Unicode-only characters. What's the best way around this? Is there any way I can make Python automatically print a ? instead of failing in this situation? Edit:  I'm using Python 2.5.  Note: @LasseV.Karlsen answer with the checkmark is sort of outdated (from 2008). Please use the solutions/answers/suggestions below with care!!  is more relevant as of today (6 Jan 2016).


Consider the simple linear regression model $y_i = \beta_0 + \beta_1x_1 + \text{error}, i = 1,2,\ldots,n$  $h_{ij}$ denotes the $[i,j]$ element of the hat matrix.  How can I show that $h_{ii} = 1/n + (x_i - \bar{x})^2/S_{xx}$  $h_{ii}$ is the leverage but what kind of observation of $x_i$ would have the lowest/highest leverage?

In     However I am unable to work this out myself. When I multiply things out I get $\frac{1}{nS_{xx}}(\sum_{j=1}^n x_j^2 -2n\bar{x}x_i+nx_i^2)$. For things to be true, the terms inside the parenthesis can be rearranged to be $S_{xx}+n(x_i-\bar{x})^2$. I tried rearranging the terms so $\sum_{j=1}^n x_j^2 -n\bar{x}x_i+nx_i^2-n\bar{x}x_i$, but I can't seem to get to the answer. There must be some form of $S_{xx}$ that I am not aware of that is buried in their somewhere. Any help would be appreciated.


This seems like a really silly question, but I haven't been able to find the answer (maybe because it's so obvious).  I commonly see that PVC piping should be run at a minimum slope of 1/4" per foot.  That's great and all, but the only connectors I know of come in 45 and 90 degrees.    If I have a pipe that is coming down vertically, how do I make the 90'ish degree turn to assure I maintain this minimum slope?  I saw this question  but it only had one un-accepted answer.  It seems a little odd that the answer would just be "bend it till it fits".  Why don't they make 110 degree fittings if this is a standard thing?  What if the end of your pipe is free open? How would you achive that angle?

A question on how to get the proper slope in a drain.  Let's say you have two section of drain line that must be plumb to each other. To connect these lines by code a 1/4" down slope is needed per foot.  The two section are 8' apart so they need to have a 2" slope end to end.   Fittings are made with the ports square to each other. The port on a 90 degrees elbow is 90 degrees apart. To me, that means the pipe has to exit or enter the fitting at 0 degrees difference to each other.  But, because of the slope there is no way the the connecting pipe can enter or exit the port square and bottom out. They don't make 95 or 100 degree fittings?


is there a difference between Const int dd{4}; & Int const dd{4};. The dd is non modifiable in both cases, so what is the difference?

Consider:  int testfunc1 (const int a) {   return a; }  int testfunc2 (int const a) {   return a; }   Are these two functions the same in every aspect or is there a difference?  I'm interested in an answer for the C language, but if there is something interesting in the C++ language, I'd like to know as well.


In Spanish, we have a phrase..     En casa de herrero, cuchillos de palo.   Literally,     In the house of the blacksmith, wooden knives.   The meaning is probably clear, but some examples:   A math teacher whose children cannot add. A software engineer who is still using Windows 95 at home. ...a country which supposedly leads the world in technology and industry,  yet is still incapable of providing the most basic of manufactured goods needed  to confront a major crisis and    Is there a comparable expression or phrase in English that describes this situation?

There's an idiom in a native language which literally means "The potter drinks from a broken jar".  i.e. a potter will not spend a lot of time making a beautiful jar for himself to drink from, he uses a poor quality one or one that's been broken for himself.  It means that someone who is good at a profession usually sells his high quality work instead of using them for himself and doesn't use them for his own benefit.  Is there an English idiom that conveys the same meaning?  UPDATE  FYI, I was interested in this idiom because  consisted of 1 page displaying my email address and saying "We'll have more soon!" during my many years of web development and making websites for others.


So someone in our past setup DKIM in the production system.  Now I have a sandbox and I'm testing emailing.  I need DKIM setup in the sandbox as well.  Can I just setup DKIM in the sandbox with the same values (selector, keysize, that stuff) as we have in production and will that be enough to get emails signed and not flagged as spam?

Cannot figure out this via SFDC documentation. Need someone who have setup this before to advise.  Basically we want to enable DKIM for our SFDC org. In testing Sandbox and production, the from email address is using the same email domain. For example, "test@abc.com" for sandbox and "contact@abc.com" in production.   Question: shall we setup DKIM in both sandbox and production or just need to setup in production since sandbox and production are actually using the same domain "abc.com"?


I'm working on making a simple-ish physics engine for my game, but I'm not sure how to do the math on part of it.  How I currently have my engine setup is as follows:  Every object affected by physics has a "velocity" which consists of it's angle and force.  Each object has an "push" function that takes a new velocity and affects the current velocity with it.  The angle of velocity is global. So moving towards the right of the screen will always have an angle of 90. For example, if an object's velocity has a force of 10 and an angle of 90 and I adjust said velocity by an angle of 180 with a force of 10 it'll get a new velocity. This velocity will have a force of 0, so it's angle is irrelevant. Or if I take that earlier velocity with an angle of 90 and a force of 10 and adjust it by a velocity with an angle of 180 and a force of 5, the resulting velocity will have the angle of 90 but the force of 10.  I'd provide more examples and test cases, but I don't know how to figure out the velocity of an object moving with a force of 13 and an angle of 32 when it's pushed by a velocity of 5 at an angle of 193.  TLDR;  I have objects with angular momentum. I want to be able to "push" them with a given force and angle and have them adjust accordingly(taking their current force and angle into account).

I'm looking for some good references for learning how to model 2d physics in games. I am not looking for a library to do it for me - I want to think and learn, not blindly use someone else's work.  I've done a good bit of Googling, and while I've found a few tutorials on GameDev, etc., I find their tutorials hard to understand because they are either written poorly, or assume a level of mathematical understanding that I don't yet possess.  For specifics - I'm looking for how to model a top-down 2d game, sort of like a tank combat game - and I want to accurately model (among other things) acceleration and speed, heat buildup of 'components,' collisions between models and level boundaries, and missile-type weapons.  Websites, recommended books, blogs, code examples - all are welcome if they will aid understanding. I'm considering using C# and F# to build my game, so code examples in either of those languages would be great - but don't let language stop you from posting a good link. =)  Edit: I don't mean that I don't understand math - it's more the case that I don't know what I need to know in order to understand the systems involved, and don't really know how to find the resources that will teach me in an understandable way.


I'm trying to remove the icon in svg tag in CSS i am trying to make height and width null:     #document
               <svg class="icon" viewBox="0 0 26 26"
                  in css : icon{ width=26; height=26}  now i want to change the icon{width=null; height=null}

I have a simple page that has some iframe sections (to display RSS links). How can I apply the same CSS format from the main page to the page displayed in the iframe?


This is my question. How to show that the column space of matrix A is just equal to the column space of AA'?.. A' represents the transpose of A. I know that the column space of AA' is a subset of the column space of A which is just trivial. But the other way around I still used inclusion  but it seemed that it is going nowhere. Maybe it can be done by some manipulation or the barbaric way of doing this. I just want to obtain a simple proof. Anyone?

How can I prove $\operatorname{rank}A^TA=\operatorname{rank}A$ for any $A\in M_{m \times n}$?   This is an exercise in my textbook associated with orthogonal projections and Gram-Schmidt process, but I am unsure how they are relevant.


I'm trying to start another program I've written with the program I'm currently writing. Right now I am trying to do so by starting the batch file I created for it, but that doesn't seem to work, but I don't know why.  Runtime.getRuntime().exec( "cmd F/AKS/Abgaben/Aufgabenblatt1/allesRichtig/runTest1.bat");   Am I doing something wrong with the command? Even though it does seem to find the bat file.

In my Java application, I want to run a batch file that calls "scons -Q implicit-deps-changed build\file_load_type export\file_load_type"  It seems that I can't even get my batch file to execute. I'm out of ideas.   This is what I have in Java:  Runtime.    getRuntime().    exec("build.bat", null, new File("."));   Previously, I had a Python Sconscript file that I wanted to run but since that didn't work I decided I would call the script via a batch file but that method has not been successful as of yet.


On Ubuntu 17.10, When try to switch layouts by clicking Super + Space, I get the current window losing focus for a moment, which -usually- make the first letters I try to type missing.  The reason -as I think- is the popup screen appears with Layouts Choices, which get completely visible, if I continued holding the Super key after hitting the Space.  Example:   So, Is there a way to disable that popup ?  Thanks.

Since I installed 17.10, when switching language with the assigned keyboard shortcut I get this switcher "window" that obstructs me from typing for a couple of seconds. And yes, a couple of seconds is a huge amount of time when switching languages a lot.      This happens both in X11 and Wayland but doesn't happen (the obstructive window will not appear) when I switch language by clicking on the lang indicator on top bar. Is there any way to tell this window "please go away"?


I used the bootstrap method to calculate the 95% CI of a rate ratio, but wonder how I could calculate a p-value to test the significance of the rate ratio by bootstrap?  Any help would be much appreciated!

I use "boot" package to compute an approximated 2-sided bootstrapped p-value but the result is too far away from p-value of using t.test. I can't figure out what I did wrong in my R code. Can someone please give me a hint for this  time = c(14,18,11,13,18,17,21,9,16,17,14,15,          12,12,14,13,6,18,14,16,10,7,15,10) group=c(rep(1:2, each=12)) sleep = data.frame(time, group)  require(boot) diff = function(d1,i){     d = d1[i,]     Mean= tapply(X=d$time, INDEX=d$group, mean)     Diff = Mean[1]-Mean[2]     Diff }  set.seed(1234) b3 = boot(data = sleep, statistic = diff, R = 5000, strata=sleep$group)  pvalue = mean(abs(b3$t) > abs(b3$t0)) pvalue    The 2-sided bootstrapped p-value (pvalue) = 0.4804 but the 2-sided p-value of t.test is 0.04342. Both p-values are around 11 times difference. How can this happen?


If $x,y,z>0.$ Then prove that $\displaystyle \frac{yz}{x}+\frac{zx}{y}+\frac{xy}{z}\geq x+y+z$   what i try  put $\displaystyle x=a/b,y=b/c,z=c/a$ and $xyz=1$  Then $\displaystyle \frac{b^2}{a^2}+\frac{c^2}{b^2}+\frac{a^2}{c^2}\geq \frac{(a+b+c)^2}{a^2+b^2+c^2}$ (Titu,s lima)  How do i solve it Help me please

Given that $ x, y, z \in \mathbb{R}^{+}$, prove or disprove the   inequality      $$ \dfrac{xy}{z} + \dfrac{yz}{x} + \dfrac{zx}{y} \ge x + y + z $$   I have rearranged the above to:  $$ x^2y(y - z) + y^2z(z - x) + z^2x(x - y) \ge 0 \\ \text{and, } \dfrac{1}{x^2} + \dfrac{1}{y^2} + \dfrac{1}{z^2} \ge \dfrac{1}{xy} + \dfrac{1}{xz} + \dfrac{1}{yz} $$ What now? I thought of making use of the arithmetic and geometric mean properties:  $$ \dfrac{x^2 + y^2 + z^2}{3} \ge \sqrt[3]{(xyz)^2} \\ \text{and, } \dfrac{x + y + z}{3} \ge \sqrt[3]{xyz} $$ but I am not sure how, or whether that'd help me at all.


I'm working on a site which had default link structure like domain/post-slug. The content team wanted me change it to domain/blog/post-slug so I added /blog/ in custom structure field in permalinks settings. The problem is that it added /blog/ to other custom post types as well for example domain/blog/case-studies/post-slug (case study is a custom post type we have). Now they want me to remove /blog/ from custom post types and only keep it for blog articles. There are other instances where they want me to add a certain words like services in the link structure of some pages. I've tried some plugins but so far none seem to fit this use case. How do I achieve this? I'm using wordpress 5.7

I have several custom post types, which are properly structured as /%post_type%/%postname%/, however I wish to have the same effect for regular blog entries: /blog/%postname%/  If I prepend the permalink structure with /blog/ it affects the custom post types as well, so currently my permalink structure is simply /%postname%/  Which is the recommended way of doing this? I had a solution involving some rewrites, but the permalink shown in the post editor area does not reflect it.


My 12 year old computer finally gave up the ghost. I just bought a new computer a month earlier, but that's a different story. Just say procrastination. The problem with the old computer was not the hard drive. After a recent power outage [dozens over the years] the BIOS system fizzled out. Basically 12 years of accumulated research and downloads is still intact on my old hard drive. I believe that I can add the old hard drive to my new computer. Haven't tried it yet. I'm not sure if I can read the Ubuntu ISO of my old hard drive or what to do. As far as locating files or even my old desktop. Yes, I have Ubuntu 18.04 on my new computer. Any help would be appreciated.

I have an NTFS external hard drive that contains only Windows XP data. How do I connect it to Ubuntu?


I have a schema for a store with multiple branches. I'm trying to get a list of branches and their one highest selling product category.    This is as far as I've gotten with the query:  select branch_name,prod_category,sum(p.prod_price*il.inv_line_qty) as  Category_Value from w_branches b  inner join w_products p on p.branch_id= b.branch_id  inner join w_inv_line il on il.prod_id= p.prod_id  inner join w_invoices i on i.inv_id=il.inv_id group by p.branch_id, b.branch_name,p.prod_category;   That returns a list of branch names, with each product category that the branch has and the total sales for the category.   BRANCH_NAME      PRODUCT CATEGORY        TOTAL SALES ---------------- ------------------------------------ BRANCHMALL       CPU                     41808 BRANCH_POS       Desktop                 62282 BRANCH_EAST      CPU                     51510 BRANCH_EAST      Networking              81600 BRANCH_POS       CPU                     22477 BRANCH_CENTRAL   Desktop                 126066 BRANCHMALL       SSD                     93154 BRANCH_NORTH     CPU                     217685   As you can see the branches are repeating. I'd like to get just the category with the maximum sales for the branch, as below.  BRANCH_NAME      PRODUCT CATEGORY        TOTAL SALES ---------------- ------------------------------------ BRANCH_POS       Desktop                 62282 BRANCH_EAST      Networking              81600 BRANCH_CENTRAL   Desktop                 126066 BRANCHMALL       SSD                     93154 BRANCH_NORTH     CPU                     217685   Thanks!

Table:   UserId, Value, Date.   I want to get the UserId, Value for the max(Date) for each UserId. That is, the Value for each UserId that has the latest date. Is there a way to do this simply in SQL? (Preferably Oracle)  Update: Apologies for any ambiguity: I need to get ALL the UserIds. But for each UserId, only that row where that user has the latest date.


I am an Iraqi holder passport, and I have EU residency in Poland. Also I have UAE residency. If I visit the UK as tourist for one month, do I need to apply for a visa?

I'm an Egyptian citizen, who holds Schengen visa and stay permit in Italy. Can I go to UK for some days with my stay permit and Schengen visa?


I'm running Ubuntu 12.04 and I'd like to know are there possibilities to clean folder leftovers of the apps that I don't use anymore and not planning to again. For example in /home when I press Ctrl+H folders appear and some of them belong to apps that I don't use anymore and I have to manually to search for them and delete each by one. So I wonder are there any commands I can use in Terminal to clean those leftovers, if they are?

Over the time there is an increasing number of hidden .configuration folders in my home folder.  Many of these come from applications I only installed for testing or from applications that I don't use any more. I would not mind really but these folders do clutter my home, and worse than that sum up to as much as 80 GBytes by now. As there are also applications I never heard of (at least I can't remember I had installed them) I hesitate to delete them.  Is there a way to find out which folders came from purged applications? May there even be a way to auto-remove a configuration folder when purging (not removing) the application that created it?


I found  the question:      Can a random variable have a density function whose variance  is $0$ ?   I understood as a random variable which has a density.  What is your opinion on what I understood and if that is the case on the answer that was given

I am a probability theory beginner. The expression for the variance of a random variable $x$ (of a random process is   $$\sigma^2 = E(x^2) - (\mu_{x})^2$$  If $E(x^2) = (\mu_{x})^2$, then $\sigma^2 = 0$. Can this happen ? Can a random variable have a density function whose variance (the second central moment alone) is $0$ (other than the dirac delta function).


We have a use case where we'd like to provide an SSL certificate for:  auth.SOME_ID.example.com   However, there will be multiple values of SOME_ID.   Is an SSL wildcard certificate for auth.*.example.com permitted, or does the wildcard have to be the highest-level subdomain?

I am wondering if it's possible to create a wildcard certificate with a prefix.  I know that *.example.com will cover anything at the first level (eg. one.example.com, two.example.com, three-four.example.com, etc), but will not cover another.one.example.com because that's 2 levels.  I need to have a wildcard certificate that recognizes a prefix; so it would be www.*.example.com.  That means, www.one.example.com, www.two.example.com, www.three.example.com, etc would all work correctly.  Is this possible, and is there a certificate provider that can do this?


Why is gravity reduced if you go below earth surface? Asked and answered before but I do not agree with the concepts followed in several answers. The concept of calculating the gravity attraction force using the mass and the distance to its center is limited to point masses and the error in using it will increase with the ratio of size of the mass to the distance to its center. With large close bodies we need integration (not my best suit) but to illustrate try this exercise.  Consider three masses A, B & C of one mass unit each. Locate them in space one unit distance apart from left to right. Calculate the gravity attraction on the mass A due to masses B & C to its right. Force AB = 1x1/1 (one unit mass each and one unit distance apart) Force AC = 1x1/4 (one unit mass each and two units distance apart) Then Forces (AB + AC) = 1.25  Now consider masses B & C as two halves of a combined mass D (2 units with a CG at 1.5 distance units from A). Force AD = 1x2/(1.5squ) = 0.8'  An obvious disagreement, but the las calculation is in error. The principal error is that the location of center of combined masses is calculated by averaging distances. While gravity forces are calculated using squared distances. We cannot add them using a combined mass at an arithmetically averaged distance. I think a math teacher can name the discrepancy.  Now rearrange the masses to have A-B two units and B-C one unit distance apart. Repeat the calculation. You get  Force (AB + AC) = 0.36 Force AD = 0.32  The error is reduced the lower the ratio of size of mass D to distance to A.  About going down in a mine shaft towards the center of earth, thanks to the comment on this answer using integration proves the gravity effect is zero inside an even spherical, because it is zero for every element before integration.   The simplified example of masses ABC points to the error in calculating gravity outside a large mass if we use the distance to the geometric center of the mass.

Would the effect of gravity on me change if I were to dig a very deep hole and stand in it? If so, how would it change? Am I more likely to be pulled downwards, or pulled towards the edges of the hole? If there would be no change, why not?


I have been searching this stuff but could not find anywhere. when i search about button name and value, everywhere its mentioned about input type=button  But i am looking for button type=submit instead of input type=button i want to allow users to remove their comments. So, the delete button is just showing like a link  The Html is  <button class="likeslink" type="submit" name="delcom" value="<?php echo $comid ?>"><small>Delete</small></button>   I am not getting how can i check if this button is clicked or not not using php as i tried   <?php if(isset('delcom')) { $sql = "DELETE FROM comments WHERE id = :id"; $stmt = $DB->prepare($sql); $stmt->bindValue(":id", $comid); $stmt->execute(); } ?>   But its not working.  Meanwhile, i want a popup alert message that confirms Delete Query includings Delete or Cancel buttons on it  I don't want that simple javascript alert on the top of the page. I want some popup window in the middle of the screen with my own Color scheme  Please help

When looking at most sites (including SO), most of them use:  <input type="button" />   instead of:  <button></button>    What are the main differences between the two, if any? Are there valid reasons to use one instead of the other? Are there valid reasons to use combine them? Does using <button> come with compatibility issues, seeing it is not very widely used?


Please help guys..  I have to calculate inverse laplace of f(s)=$\frac{1}{s\sinh^2{c\sqrt{s}}}$, where s is Laplacian variable. By residue theorem, the function has one residue at s=0 (solving this is easy) and infinitely many at $c\sqrt{s} = n\pi i$ which I have some problems because it is order of 2! How can I solve the second part of the problem?  Thanks in advance.

I have some questions.  I have to take the inverse Laplace transform of the given function below by residue theorem:   $\frac{1}{s\sinh{c\sqrt{s}}}$   where s is Laplacian variable and c is a real constant. Actually it has a very crowded numerator which I do not need to define. So far I know that it has a simple pole at s = zero and infinitely many poles at c√s = nπi  Questions:  1- What is the order of the poles at nπi? Is it 1/2?  2- At zero, what is the order? (Because to residue at zero, s also contributes)  3- What is the way of solving this question at nπi by residue theorem (without defining sinh function as exponential function)?  Thanks for any help.


I have a prechat form that is developed as visualforce page. Everything is working fine but when prechat form is shown, it has limited size. Is it possible to change the size of the prechat form ? I came across way to change the size of actual chat window but don't see anything related to prechat form.

We're about to go live with Live Agent (the version that built into your Salesforce instance).  We're using some a prechat form which appears as a popup window when the user clicks the "Chat" button.  When the window pops up, our form doesn't fit fully inside. I'm trying to find where to define the size of that pop-up window.  I can't find it in any setting, and changing the Visualforce page that represents the Pre Chat form doesn't make a difference.  Does anyone know where the Size of the pop up window is referenced?   Update**  ***Per the comment below - I also thought it would be in the code for the button. Nearest I can tell it calls a method onclick called "Liveagent.startChat()" but I don't see that javascript anywhere.


I am  an Indian passport holder and will be flying from there.The flight I am looking at has 1 stop at Munich International Airport and has a 3h 55m layover there.I will need to switch flight there Do I require Germany airport transit visa to do that if I hold an UK D-tier 4 General entry clearance Visa?

I found many related questions on this site but I am still not sure about the rules. How can I decide if I need a visa to transit? Schengen members as of May 2021 are as follows:  Austria Belgium Czech Republic Denmark (excluding Greenland and the Faroe Islands - but an open border with the Schengen Area is maintained) Estonia Finland France (excluding overseas departments and collectivities) Germany Greece Hungary Iceland Italy Latvia Liechtenstein Lithuania Luxembourg Malta Netherlands (excluding Aruba, Curaçao, Sint Maarten and the Caribbean Netherlands) Norway (excluding Svalbard) Poland Portugal Slovakia Slovenia Spain (except Ceuta and Melilla) Sweden Switzerland


There are 25 stones in a heap. The heap is divided into two parts, then one of the parts is divided in two again, et cetera, until we have 25 separate stones. After each division of one of the heaps into two smaller heaps we write the product of the numbers of stones in these two heaps on a blackboard. Prove that at the end the sum of all the numbers on the blackboard is 300.

Consider the following one-person game:  A player starts with score $0$ and writes the number $20$ on an empty whiteboard. At each step, she may erase any one integer (call it $a$) and writes two positive integers (call them $b$ and $c$) such that $b + c = a$. The player then adds $b × c$ to her score. She repeats the step several times until she ends up with all $1$s on the whiteboard. Then the game is over, and the final score is calculated.  Example: At the first step, a player erases $20$ and writes $14$ and $6$, and gets a score of $14 × 6 = 84$. In the next step, she erases $14$, writes $9$ and $5$, and adds $9 × 5 = 45$ to her score. Her score is now $84 + 45 = 129$. In the next step, she may erase any of the remaining numbers on the whiteboard: $5$, $6$ or $9$. She continues until the game is over. Alya and Bob play the game separately. Alya manages to get the highest possible final score. Bob, however, manages to get the lowest possible final score. What is the difference between Alya’s and Bob’s final scores? I tried to "decompose" into a few numbers and I get the same scores. I am not sure how to prove the conjecture that any numbers will yield the same score no matter which path is taken.


Consider Alice approaching a black hole while Bob observes her journey from a distance. Due to the large gravitational field surrounding the black hole, Bob observes Alice her clock to slow down as she approaches the event horizon. Alice, on the other hand, sees Bob's clock speeding up as she approaches the horizon.  Once Alice reaches the horizon, her clock stops according to Bob's observation, while she notices no change of rate on her clock (proper time). On the other hand, when she looks at Bob, she observes time progressing at an incredibly high rate on his clock.  Now, in a heat death scenario for our universe, the black hole is bound to evaporate by Hawking radiation eventually. From Alice her perspective, 'eventually' might be very soon on her world line. I would therefore hypothesize that she will witness the evaporation just as she remains about to cross the event horizon. I would imagine the black hole to shrink before her very eyes; leaving Alice in a distant future where the black hole has evaporated.  By that time however, Alice would have been bombarded with a large, and probably lethal, dose of Hawking radiation. Is my analysis of the situation correct? If so, why are we told a different story by physicists? If not, where is the error in my reasoning? For instance, could it be that Alice does not observe time to progress infinitely fast in the rest of the universe, if she were to cross the event horizon?

I am not a professional physicist, so I may say something rubbish in here, but this question has always popped in my mind every time I read or hear anyone speak of particles hitting singularities and "weird things happen".   Now to the question at hand, please follow my slow reasoning... As far as I've learned, to reach a black hole singularity, you must first cross an event horizon. The event horizon has this particular property of putting the external universe on an infinite speed to the falling observer. Now due to the Hawking radiation, and knowing that the cosmic background radiation is slowly dimming, sooner or later every black hole in this particular instance of inflation we are living in will evaporate, according to an external observer of said black holes.  This means that every black hole has a finite timespan, as long as this universe survives that long. Now if we go back to the falling observer, we had already established that such an observer would see the outside universe "speed up" infinitely. This means that when the falling observer "hits" the event horizon, he will (or it if we speak about particles, which is clearer in this case), be immediately transported in time towards the final evaporation moment of the black hole. Either this or the particle gets some weird treatment. My point is, such a particle never gets to the singularity, because it has no time to get to it. The moment it crosses the event horizon, the black hole itself evaporates.  Where am I wrong here?


I was thinking about this for some time and I wanted to clarify my question. Can the Euler-Lagrange equation be somehow derived from Newton's second law? Here's a possible way to do it: We start with Newton's second law for a non-relativistic point particle of mass $m$ under a conservative force, $m \frac{\mathrm{d}^2 \vec{r}}{\mathrm{d} t^2}=-\nabla U$. Converting this to index notation and choosing a Cartesian coordinate system, we have $$m \frac{\mathrm{d}^2 x^i}{\mathrm{d} t^2}=-\frac{\partial U}{\partial x_i}=\frac{\mathrm{d} p^i}{\mathrm{d} t},$$ where $i \in \{1,2,3\}$ and $p^i=m\dot{x}^i$. Now define the quantity $T=\frac{1}{2}m\dot{x}^j\dot{x}_j$ (kinetic energy), and Einstein summation convention is used here. It is easy to see that $$p^i=\frac{\partial T}{\partial \dot{x}_i}=m\dot{x}^i.$$ Substituting this result into Newton's second law we obtain the relation $$\frac{\mathrm{d}}{\mathrm{d} t} \frac{\partial T}{\partial \dot{x}^i}=-\frac{\partial U}{\partial x^i}.$$ Now, defining the function $L=T-U$, and since $\frac{\partial U}{\partial \dot{x}^i}=0$ and $\frac{\partial T}{\partial x^i}=0$, we arrive at the celebrated equation $$\frac{\mathrm{d}}{\mathrm{d} t} \frac{\partial L}{\partial \dot{x}^i}=\frac{\partial L}{\partial x^i}.$$ Now, is this derivation valid? Can it be shown from this to be valid for all holonomic systems?

Is there a proof from the first principle that for the Lagrangian $L$,    $$L = T\text{(kinetic energy)} - V\text{(potential energy)}$$  in classical mechanics? Assume that Cartesian coordinates are used. Among the combinations, $L = T - nV$, only $n=1$ works. Is there a fundamental reason for it?  On the other hand, the variational principle used in deriving the equations of motion, Euler-Lagrange equation, is general enough (can be used to to find the optimum of any parametrized integral) and does not specify the form of Lagrangian. I appreciate for anyone who gives the  answer, and if possible, the primary source (who published the answer first in the literature).      Notes added on Sept 22: - Both answers are correct as far as I can find. Both answerers were not sure about what I meant by the term I used: 'first principle'. I like to elaborate what I was thinking, not meant to be condescending or anything near to that. Please have a little understanding if the words I use are not well-thought of. - We do science by collecting facts, forming empirical laws, building a theory which generalizes the laws, then we go back to the lab and find if the generalization part can stand up to the verification. Newton's laws are close to the end of empirical laws, meaning that they are easily verified in the lab. These laws are not limited to gravity, but are used mostly under the condition of gravity. When we generalize and express them in Lagrangian or Hamiltonian, they can be used where Newton's laws cannot, for example, on electromagnetism, or any other forces unknown to us. Lagrangian or Hamiltonian and the derived equations of motion are generalizations and more on the theory side, relatively speaking; at least those are a little more theoretical than Newton's laws. We still go to lab to verify these generalizations, but it's somewhat harder to do so, like we have to use Large Hadron Collider. - But here is a new problem, as @Jerry Schirmer pointed out in his comment and I agreed. Lagrangian is great tool if we know its expression. If we don't, then we are at lost. Lagrangian is almost as useless as Newton's laws for a new mysterious force. It's almost as useless but not quite, because we can try and error. We have much better luck to try and error on Lagrangian than on equations of motion. - Oh, variational principle is a 'first principle' in my mind and is used to derive Euler-Lagrange equation. But variational principle does not give a clue about the explicit expression of Lagrangian. This is the point I'm driving at. This is why I'm looking for help, say, in Physics SE. If someone knew the reason why n=1 in L=T-nV, then we could use this reasoning to find out about a mysterious force. It looks like that someone is in the future.


If $w = \frac {\sqrt2+\sqrt3}{\sqrt5-\sqrt3} $  Express the following in the simplest form (with a rational denominator)  i) $w$  ii) $\frac1w$  I'm confused about (ii) question :/ pls help me.

If w = $\frac {\sqrt2+\sqrt3}{\sqrt5-\sqrt3} $  Express the following in the simplest form (with a rational denominator)  i) w  ii) $\frac {1}{w} $  It must be like this right ?  w = $\frac {\sqrt2+\sqrt3}{\sqrt5-\sqrt3} $ x $\frac {\sqrt5+\sqrt3}{\sqrt5+\sqrt3} $  Please help me with this question coz I don't get it at all :/


I have a PC with a brand new hard drive with no existing operating system. Is it possible to install Ubuntu without installing another OS first?

I would like to see a full how-to guide on how to install Ubuntu.


I'm making a colored table for a time planning exercise. I made a specialrule since \midrule were too close to the activities. Spacing is now functional but the cells are not getting colored wholly. How can I color the entire cell?  \documentclass[12pt]{article}  \usepackage[table]{xcolor} \usepackage{booktabs}  \newcommand{\thinrule}{\specialrule{0.045 ex}{0.07 ex}{0.19 ex}} \colorlet{mark}{black!25} \newcommand*{\z}{\cellcolor{mark}} \newcommand*{\mc}[2]{\multicolumn{#1}{c}{#2}} \newcommand*{\y}[1]{\multicolumn{1}{c}{#1}}   \begin{document} \begin{tabular}{p{0.55\textwidth}*{4}{p{3em}}} \toprule & \mc{4}{Month} \\ \cmidrule{2-5} \mc{1}{Activity}         &\y{1}  &\y{2}&\y{3}&\y{4}             \\ \midrule Foo1                     & \z    &     &       &                  \\ \thinrule Foo2                     & \z    &     &       &                  \\ \thinrule Foo3                     & \z    &  \z &       &                  \\ \bottomrule \end{tabular} \end{document}

I have created a rather complicated table with some columns that I want to color. For the table, I chose the booktabs and tabularx packages. For coloring the columns, I use colortbl.  The problem that I have is that \midrules show a white space, and the result does not please me at all. Here is a MWE:  \documentclass[a5paper]{article} \usepackage{xcolor} \usepackage{booktabs,colortbl,tabularx} \begin{document} \pagestyle{empty} \begin{table*}[!htb]   \centering   \begin{tabularx}{4cm}{>{\columncolor{gray}}cX>{\columncolor{gray}}c}     \toprule     1&2&3\\     \midrule     one&two&three\\     one&two&three\\     \cmidrule{2-3}     one&two&three\\     \midrule     un&deux&trois\\     \bottomrule   \end{tabularx}   \caption{caption} \end{table*} \end{document}     Looking around I found that booktabs supports colortbl in its latest version. However, it seems that it only supports colored horizontal lines.  I tried not using booktabs and replacing midrules for hlines. My huge table looks too crowded (once you booktab, you never go back, I guess).  My question is: is it possible to achieve a correct coloring in midrules ? Since I fear that the response is no: what low-cost recommendation do you have in order to color the columns of my table?  (When I say low-cost, I mean that I do not want to re-write my table contents)


I follow this XDA tutorial to . However, after flashing TWRP via Odin, the phone only boots into recovery, not system. Even factory reset or  cannot help. I have to reflash its . This erases TWRP and replace with the stock recovery. This is what the tutorial says, which I follow exactly:  Flash with ODIN in the AP slot. Put your device in DOWNLOAD mode. Uncheck Auto reboot. Load the respective file below into the AP slot and hit start. After flashing and ODIN reports PASS immediately reboot to recovery by holding POWER + HOME + VOL DOWN. As soon as the screen goes blank change to VOL UP whilst still holding POWER + HOME. You should now see TWRP recovery.  Yes I see TWRP recovery, but now the system cannot be booted.

I am trying to root my Lenovo K8 Plus after unlocking bootloader. I try to install TWRP and somehow the TWRP recovery doesn't open and the phone is struck in the bootloop. I then fastboot the device and connect to PC and open minimal fastboot cmd. The phone wasn't listed in adb device, but listed in fastboot devices. I think usb debugging is not turned on because the system doesn't restart (maybe there is no ROM). What should I do?


I would like to save the site template as .wsp file locally programmatically by CSOM C#.  I know how to save it as a .wsp file from SharePoint online, but does anyone who has any idea how to do the process programmatically? I prefer using CSOM C#.   Thanks

I would like to reproduce the "Save site as template" action with the client object model. Can someone give me a hint how to do this?


I enabled 2fa for my apple account, and now iCloud keeps asking me my password a lot of times every time I login. I think it doesn't even bother to check it, since as soon as I enter it, it pops the window again immediatly after I hit either login or cancel (it gives up after a few tries).  I've created an application-specific password and I'm using that one, to no avail.

I keep receiving an iCloud pop-up message to insert my iCloud password every time i switch on my iPad and I'm unable to do anything on it, inserting the password doesn't help. What should I do?


I use gedit to modify/create files in my system, and sometimes I see that after editing, a duplicate file is created by the name of samename~  Just that ~ is extra. Why does this happen? Is there any significance of this file or is it okay if I delete it (I usually do)?

When ever I save a gedit file in a directory, two copies of it get saved with identical content. Ex: If the gedit file is named as file_name and saved in Home directory then when u ls the Home directory you get file_name and file_name~ in the list. When the file command is run against them I get ASCII text, with very long lines for both of them when I view their contents using the less command they seem to largely contain identical content. The ~ file is a copy of the file when it was saved for the penultimate time. Can someone please help me in understanding as to why such a file (the file with a trailing ~ mark in its name ) is created?


The errors are with the writeToFile() method. I can comment it out and it runs perfectly without the Exception error. So basically, I'm trying to get those Nutrition facts to print on a text file. The error looks like this      "Exception in thread "main" java.lang.NullPointerException     at   Environment.writeToFile(Java1001.java:71)      at   Environment.(Java1001.java:54)   at   Java1001.main(Java1001.java:43)"    import static java.lang.System.*;     import java.io.*;      public class Java1001     {         public static void main(String[] args) throws IOException         {             new Environment();         }      }      class Environment     {         private PrintStream outFile;          public Environment()         {             createOutputStream();             writeToFile();         }          public void createOutputStream()         {             // create outFile stream here             File outFile = null;             try             {                 outFile = new File("Nutrition.txt");                 outFile.createNewFile();             }             catch (Exception e){}         }          public void writeToFile()         {             outFile.println("NUTRITION FACTS");             outFile.println("======================================");             outFile.println("Serving Size 1 tbsp (6g)");             outFile.println("Servings Per Container about 4");             outFile.println("======================================");             outFile.println("Amount Per Serving");             outFile.println("Calories           20");             outFile.println("Calories from Fat  5");             outFile.println("======================================");             outFile.println("Total Fat 0.5g");             outFile.println("Sodium 280mg");             outFile.println("Total Carbohydrate 4g");             outFile.println("Sugars 0g");             outFile.println("Protein less than 1 g");             outFile.println("======================================");         }     }

What are Null Pointer Exceptions (java.lang.NullPointerException) and what causes them?  What methods/tools can be used to determine the cause so that you stop the exception from causing the program to terminate prematurely?


I am facing a problem with Firefox when logging onto my Stack Overflow account.  I click on "log in," then I choose "connect with Facebook."  But after that, nothing happens, except for the redirection to the main page.  If I try to log in again, a message displays on the top of the page telling me that I am already connected.  Notice: this problem did not exist on Chrome in my case.  This is the picture of my case:

Here's what is happening; everytime I go to Stack Overflow (stackoverflow.com, NOT meta) with Firefox, it gives me the "Welcome back" tab that pops up from the top. Whenever I click in the "click here to refresh the page" link, all it does is refresh the page without logging me back in.  Even if I try to log in using the "log in" button at the top, all it does is pop up the tab that says "Welcome name here, you're being redirected." The problem is I'm not being logged in, not to mention that it keeps refreshing the page over and over again without giving me a choice to log in with Facebook.  For some reason, I was capable of logging in to Meta Stack Overflow using Firefox. I am still unable to log in to Stack Overflow. Any ideas?


I recently install ubuntu in my computer.Every thing is working well except my usb wifi adapter it work on window very well but not on Ubuntu 20.04LTS.I tried every thing that ubuntu wifi troubleshoot say. But it is  still showing no wifi adapter found.I  reinstall whole Ubuntu but it is still not working. please help me. Output of lsusb:- Bus 002 Device 001: ID 1d6b:0003 Linux Foundation 3.0 root hub Bus 001 Device 003: ID 0bda:f179 Realtek Semiconductor Corp. 802.11n Bus 001 Device 006: ID 1c4f:0034 SiGma Micro Usb Mouse Bus 001 Device 004: ID 22d9:276a realme SDM712-MTP _SN:DA06B20A Bus 001 Device 001: ID 1d6b:0002 Linux Foundation 2.0 root hub

I'm trying to install wifi drivers for a particular mini wifi card i bought. The output of lsusb is:  0bda:f179 Realtek Semiconductor Corp   I've searched everywhere for drivers, but could not find anything. Any help?  Thanks


I've run accross a strange behaviour of the click event I can (more or less) figure out but I can't find documentation about.  Is it possibile to click a button using method click() from within a promise then or using a setTimeout function?  Here's an example to show what I mean:  document.getElementById("mioBottone").addEventListener("click", function () {     callAPI().then(function (data) {         document.getElementById("inputFile").click();     }); });  function callAPI () {     return new Promise (function (resolve, reject) {         $.get( "https://swapi.co/api/people/1/", function( data ) {             resolve(data);         });     }); }   From my tests it looks like click can be only executed in click event listener context and not delayed using promises or setTimeout, but I haven't found any documentation about it.  And here's a simple fiddle:

I'd like to make a click event fire on an <input type="file"> tag programmatically.  Just calling click() doesn't seem to do anything or at least it doesn't pop up a file selection dialog.  I've been experimenting with capturing events using listeners and redirecting the event, but I haven't been able to get that to actually perform the event like someone clicked on it.


I got logged out on Pokemon Go, but my mom sighned me up so I don't know the username password or email. I don't know if it is a pokemon trainer club account or google. All I know is the Nickname which is JewelsPanda. Is it possible to get my accout back?

So I had 20+ Pokemon on my account and today when I tapped on the app, it brought me back to the original screen when you first start playing. My friend who signed up tested using my username when she first started and my username was unavailable, meaning the account still exists. I don't have the password for the account, but I do have the email. So I wanted to know if it was possible to log back into an account?


Thanks for suggesting this question:  I read the reference and realize that for a short exact sequence of Banach algebra: $0 \to J \to A \to A/J \to 0$ only makes sense if $J \to A$ has closed image. So in general $D \otimes_\pi$ will not preserve that.  So my new question is: It seems to me that it is hard enough to be a closed subspace. Is there any reference on the ideals of projective tensor product of Banach algebras? Better if examples of computation is available. Thanks!

Let $f:A\to C$ and $g:B\to D$ be bounded linear maps of Banach spaces with closed image. Will $f\widehat{\otimes}g:A\widehat{\otimes}_\pi B\to C\widehat{\otimes}_\pi D$ also have closed image? What about injective tensor products?


So, I am new at coding. I was trying to make a very basic static webpage of a calculator using html and css and js. This is the html   #input {     margin: 0 auto; }  #num {     border-radius: 25px;     background: #73AD21;     display: inline-block;     padding: 15px;     width: 200px;     height: 100px; }

       Enter the first number       <input type="number" name="num1" id="num1">

       Enter the second number       <input type="number" name="num2" id="num1">

<input type="submit" name="add" class="add" value="Add" onclick="add()">

<input type="submit" name="subtract" class="sbtrct" value="Subtract" onclick="sbtrct()">

<input type="submit" name="multiply" class="mult" value="Multiply" onclick="mult()">

<input type="submit" name="divide" class="add" value="Divide" onclick="dvde()">

     I want that the #num be centered horizontally. I tried using margin: auto;  and margin: 0 auto;  but nothing works. Please help. I've been at it for hours.

How can I horizontally center a
 within another
 using CSS?

Foo foo


I am using Fire bug in firefox browser to identify a unique id in the web pages using the Xpath feature.  Sometimes the Xpaths are not unique, ie: the xpath id is dynamic and keeps changing as the result my script fails. Can anyone let me know how to customize the Xpath so that I can still use it to uniquely identify an object?

I've got not very common task to take care of.  We need to create several test suites for some forms in one complex web application. I'm a rookie in this field and Selenium was the first (and pretty much advertised all around) tool I've tried. The problem is that all of form elements' ids/names/css path used on aforementioned pages contain random fragments which will change each and every time corresponding page is refreshed (they still contain enough of unique characters to distinguish between with certainty, with, for example, regular expressions).  When I'm telling "random with enough unique characters ", I mean something similar to that:  constant_part_1_random-fragment-new-each-time_constant_part2  Those constant parts by itself unique enough to discern different elements by them, but you can't use exact matching as the whole string changes every time. So Selenium creates test suites in full-auto mode OK, but when I try to run it - BLAM! - it doesn't work because all element locators in each step of newly composed test suite now contain already stale path/names/ids, so no element can be found.   Of course, regular expressions was the first solution that came to my mind, but I failed to comprehend can they be used in Selenium at all, and if they can, than can they be used in locators? Some people around the net tell they can't, others say they can..  Or may be it's Selenium who is flawed? May be there are better solutions of this sort which will allow me to quickly compose those test suites? Or at least will be able to use regexps to their fullest?


For how many primes $p$ is  $p^2 + 2$ also prime?     I'm not sure but I think you can consider every prime number as $(3k+1)$ or $(3k+2)$

My problem in my solution is that I don't know if the operations I apply on congruence modulo n are admissible. I could really use some guiding:  Attempt: Let there be $p\ne 3$ fulfilling the requirements aforementioned. Every prime number $p\ne 2,3$ satisfies: $p\equiv1 \mod6$ or $p\equiv5 \mod6$. If $p\equiv1 \mod6$ then $p^2\equiv1 \mod6$ which means  $p^2+2\equiv3 \mod6$ which is a clear contradiction. Here's the tricky part(of which I am not sure): $p\equiv5 \mod6$ $\Rightarrow p^2\equiv5 \mod6$ $\Rightarrow p^2+2\equiv1 \mod6$.  That means by definition: $6|(p^2+2)-1$ and $6|p^2-5$ and therefore(?): $6|p^2-4$ deriving $2p^2\equiv 4 \mod 6$ $\Rightarrow p^2\equiv 2 \mod 6$ which is a contradiction.


In my program, a Java8 application library, written on NetBeans, when I go to the dist folder and run Project.jar using the command:  java -jar Project.jar   I get the following error:  Sorry, unable to find config.properties Exception in thread "main" java.lang.NullPointerException   It seems it cannot create the input stream necessary to read the properties file.  Here is the class I use to read the properties:  public class PropertyAccess {      public static String getPropertyFromFile(String propertyName){         String ret = "";         //System.out.println(propertyName);         InputStream input = null;         Properties prop  = new Properties();          try {             String filename = "config.properties";             input = PropertyAccess.class.getResourceAsStream(filename);             if(input == null) {                     System.out.println("Sorry, unable to find " + filename);             }              //input = PropertyAccess.class.getResourceAsStream("/config/config.properties");             //input = new FileInputStream("config/config.properties");              input = PropertyAccess.class.getClassLoader().getResourceAsStream("config/config.properties");              prop.load(input);             ret =  prop.getProperty(propertyName);         } catch (IOException ex) {             ex.printStackTrace();         } finally {             if (input != null) {                 try {                     input.close();                 } catch (IOException e) {                     e.printStackTrace();                 }             }         }          return ret;     } }   There is a bad design/implementation where I load the prop file every time I need to read a property from file, this will be corrected before the main release, but this is not what is causing the issue.  Can someone explain how to fix this?  I've tried to add the file to the classpath, but  it also doesnt work.

I need to read a properties files that's buried in my package structure in com.al.common.email.templates.  I've tried everything and I can't figure it out.  In the end, my code will be running in a servlet container, but I don't want to depend on the container for anything. I write JUnit test cases and it needs to work in both.


So I was working on a project and I needed a neon light effect asap so I used this asset. (It was in .eps format.)  When I collected it for export it did not look what it looked like in the picture. It has some sort of clipping mask which is used and it makes the black go away but it doesn't go away when being exported.  Still I exported it and this is what I got  I am new to editing and stuff so I don't exactly know what's happening and why it's happening. Please help to gain some knowledge about the stuff that's going on here. Thank you so much.

As a beginner I am having hard time and sorry for this basic question. I have bought some vector from ShutterStock and while removing the background layer, I get some black gradient in the edges of the sparkles!  For easier understanding, please see the image below.  How do I get a fully transparent image of the shining frame. [I have the layered vector file of the image]


After I updated Pokemon Go, I tried to login again with my gmail account. Every time I type in my account name and then my password, but after I hit the sign in button it sends me right back to the account name screen. Is there anything I can do to fix this?

I downloaded the July 30th update for Pokemon Go and when I open the app I'm prompted to login, But once I login, it redirects me to this page on Cookies::     If I click "Done" in the top left, it prompts me to login again! I've tried reinstalling the game, restarting my phone, etc. I can't much enable Cookies on the inline Safari browser. It doesn't make sense, and cookies are on in Safari (because I don't use Safari and they're enabled by default).  How can I fix this?


I've been having some trouble with a little math i've been doing in Java. Long story short, when I do:  double totalS = 1146.35; double down = 114.63;  result = totalS - down;   And the result for this comes out as 1031.7199999999998, when doing this easy equation on a calculator produces 1031.72. Any idea?

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


I'm wondering how to add a new box underneath the Post Box (Publish Box) in the admin section of WordPress?  Am hoping to add a few custom field text inputs there.

I was wondering if there were any cut and dry  rules to placing meta boxes? I have a meta box for a custom post type for a TV series that holds extra information for said series: when it began airing, genre, etc and I'm debating whether to place it under the editor or on the side.    Are there any unofficial rules to what kind of meta box goes where or is it up to the developer's discretion?


Whenever I click the steam app it won't start and when I try from the terminal it says:  Running Steam on ubuntu 15.10 64-bit STEAM_RUNTIME is enabled automatically Installing breakpad exception handler for appid(steam)/version(0) libGL error: unable to load driver: r600_dri.so libGL error: driver pointer missing libGL error: failed to load driver: r600 libGL error: unable to load driver: swrast_dri.so libGL error: failed to load driver: swrast   What do I do?

I have never used Ubuntu or any other Linux OS before last Friday. For all I know, I might have installed Ubuntu wrong and be missing a component. I would prefer if you use simplest terminology possible, but I'm OK with doing a bit of googling if need be. I just installed Steam for Ubuntu 16.04 but it won't open when I click on it in the launcher. The icon flashes for a few seconds, stops and then nothing happens. I looked in the system monitor and steam shows up there but ending the process and trying again does nothing. I heard trying to open apps that aren't working through the terminal tells you what the error is so I tried that and I got this:  Running Steam on ubuntu 16.04 64-bit STEAM_RUNTIME is enabled automatically Installing breakpad exception handler for appid(steam)/version(0) libGL error: unable to load driver: radeonsi_dri.so libGL error: driver pointer missing libGL error: failed to load driver: radeonsi libGL error: unable to load driver: swrast_dri.so libGL error: failed to load driver: swrast   Please help I just want to play CS:GO again.


I've succeeded in mapping ctrl+alt+z to a custom binding (gnome-system-monitor).  When I change it to ctrl+esc, or  ctrl+alt+esc, it does nothing. I looked through the other bindings mapped in keyboard preferences,and don't see any conflicting bindings.  Does anyone have any ideas about why this wouldn't work?     Edit:  Thanks to @Redbob's suggestion, I found the existing binding for ctrl+alt+esc in the dconf-editor. No such luck with the plain ctrl+esc binding: I also failed to find the ctrl+esc binding in the dconf settings on terminal (gsettings list-recursively | grep "Escape" as suggested by ).  The conflict for ctrl+alt+esc came from this dconf entry: org.gnome.desktop.wm.keybindings cycle-panels ['<Control><Alt>Escape']

For some reason my custom shortcut for the System Monitor that I created according to this instruction does not work.   When I press it, it just does nothing. Any ideas?  My shortcut is ctrl+shift+esc.  Here is a screenshot:


I want to add options to a custom command. I create my commands by putting a .sh document in /bin. Is it possible to add a "-x" option to my code? (i.e. customcommand -c)

I have the shell script  CONTROLLER_IP="" if [ "$#" -eq 1 ] then     CONTROLLER_IP=$1 else     echo "Usage : create_endpoint.sh --controller-ip <Controller IP>"     exit 1 fi   but its executing like this ./create_endpoint.sh 10.10.10.1   I want to execute like this /create_endpoint.sh --controller-ip 10.10.10.1


$n-m+l=2$, where n=#vertices, m=#edges, l=#faces. I've been asked to demonstrate an intuitive, inductive proof (whatever the hell that means). Anyway so I've shown it's true for a tree, where necessarily $m \leq n-1$, and also for when $m=n$. Am I done, or do I need to show it also for when $m \geq n+1$?

I'm just studying for finals here.  My professor told me that there would be an inductive proof on the final, and I've never done one before.  He told me a good sample problem was to prove Euler's formula $v-e+r=2$ inductively.  I've submitted my proof below.  I'm just looking for criticism / corrections!  Is it a proper inductive proof?  If not, could you show me one / make corrections?


Am I the only one whose athletic career bared fruit?   While this sentence doesn’t make logical sense, seeing as it should be "bore fruit", is it still grammatically correct? Can a sentence that makes no logical sense at all still be considered ‘correct’ or ‘grammatical’?  And if the answer to that is yes, then how does one distinguish between something that is grammatical and something that is not, if the meaning is not relevant?    Note: This question is different from the previous question (which it has been marked as a duplicate of) in that it asks specifically whether a sentence that makes no logical sense can still be considered grammatical, despite its not making sense.

Am I the only one whos athletic career bared fruit?    Is this sentence correct grammatically?


So I am trying to sort an array using compareTo.  This is what i have now:  @Override public int compareTo(Episode other) {     return Integer.compare(episodeNummer, other.episodeNummer); }   I am now sorting only by episodenumber, but I am trying to also sort the list by season.

Assume you have some objects which have several fields they can be compared by:  public class Person {      private String firstName;     private String lastName;     private String age;      /* Constructors */      /* Methods */  }   So in this example, when you ask if:  a.compareTo(b) > 0   you might be asking if a's last name comes before b's, or if a is older than b, etc...  What is the cleanest way to enable multiple comparison between these kinds of objects without adding unnecessary clutter or overhead?   java.lang.Comparable interface allows comparison by one field only Adding numerous compare methods (i.e. compareByFirstName(), compareByAge(), etc...) is cluttered in my opinion.   So what is the best way to go about this?


I have heard that when the speed of the object increase, the mass of the object also increase. ()  So inertia which is related to mass, increase with speed?  So, if I accelerate on a bus, my mass will increase and my inertia will increase for a while on the bus, until the bus stops?

Some people say that mass increases with speed, some people say that the mass of an object is independent of its speed.  I understand how some (though not many) things in physics are a matter of interpretation based on one's definitions. But I can't get my head around how both can be 'true' is any sense of the word.  Either mass increases or it doesn't, right?  Can't we just measure it, and find out which 'interpretation' is right? e.g.: (in some sophisticated way) heat up some particles in a box and measure their weight?  ------------------------------  UPDATE  Right, so I've got two identical containers, each with identical amounts of water, each on identical weighing scales, and each in the same g field. If one container has hotter water, will the reading on its scale be larger than the other? If the answer is yes, and g is constant, does this mean that the m in w=mg has got bigger?


so I am developing an RTS and I am a little stuck at this. I am not talking about pathfinding algorithms like A*. The problem is moving units in bulk and their collision along the way. Can anyone give me some pointers or tips on how to start working on this. Older RTSs have a lot of problems in this. Warcraft 3 for example. When playing it now after some SC2 it is excruciating when units collide and block each others path and so on. I really want to avoid that. Thanks.

How can we refine this path search method to make group movement more elegant? I'm trying to make a RTS-style game, using a 2d tiled gameworld. I have implemented an A* pathfinding algorithm which works well enough for single units. I've also make some functionality to make agents walk around other agents they stumble across on their way.  Here is some of my code:  def move(self, agent, clickbox, nogolist):     impassable = []                                   impassable.extend(nogolist)     mapinfo1 = MapInfo(self.map_layout.finalsize,self.map_layout.finalsize,impassable)     graph, self.nodes = self.make_graph(mapinfo1)     paths = AStarGrid(graph)     for c in self.map_layout.all_map_objects:          if clickbox.box.collidepoint(c.checkpoint):             path = []             if len(agent.travel_list) > 1:                 v = agent.travel_list[1]                 start = self.nodes[v[0]][v[1]]             elif len(agent.travel_list) == 1:                 start = self.nodes[agent.grid_pos[0]][agent.grid_pos[1]]              end = self.nodes[c.gridnumber[0]][c.gridnumber[1]]                                  path = paths.search(start, end)             try:                 agent.target = self.convert_path(path)                                             agent.travel_list = self.waypoints((agent.grid_pos[0],agent.grid_pos[1]), path)             except:                 print 'road error'   When one or more agents are selected and the player right-clicks somewhere, self.move gets called on each agent individually, they are at this point still ignorant of other agents positions. The next part is where I try to have agents not walk over each other, or just stop if 'travel_list' only contains one more step, and another agent occupies it.  if not len(self.traveling_agents) == 0:     for a, b in combinations(self.agent_list, 2):                                 self.resolve(a, b, self.nogolist)                 self.resolve(b, a, self.nogolist)  def resolve(self, a, b, nogolist):     try:         if len(a.travel_list) > 1 and b.travel_list[0] == a.travel_list[-1]:             a.travel_list = a.travel_list[:-1]             a.target = a.target[:-1]             if a.travel_list[1] == b.travel_list[0]:                 self.traveling_agents.remove(a)         elif len(a.travel_list) > 1 and b.travel_list[0] == a.travel_list[1]:             path = []                         go = a.travel_list[0]             goal = a.travel_list[-1]             impassable = []             impassable.append(b.travel_list[0])                 impassable.extend(nogolist)             mapinfo1 = MapInfo(self.map_layout.finalsize,self.map_layout.finalsize,impassable)             graph, self.nodes = self.make_graph(mapinfo1)             paths = AStarGrid(graph)              start = self.nodes[go[0]][go[1]]              end = self.nodes[goal[0]][goal[1]]                             path = paths.search(start, end)             a.target = self.convert_path(path)             a.travel_list = self.waypoints((go[0],go[1]), path)             del impassable     except: a.stop()   This works reasonably well for solo agents encountering other stationary solo agents. But when moving in a group towards a common target, this method falls way short of what would be desired. What can we do to achieve smoother group movement like what is seen in some of those old school RTS games?  For some additional insight on my code, check my previous entry on implementing the A-star search algorithm: