I had made a project manager for maya in python with Qtdesingner, in the UI, a QLineEdit authorize the user to fill a path of a script to run (the variable is: BatchRunScript) but it seems to not be possible to import a module if it's a variable (str):  import maya.utils BatchRunScript = 'X:\PathOfTheScript\NameOfScriptToRun.ScriptToRun()' BatchRunScriptName = BatchRunScript.replace('\\', '/').split('/')[-1] BatchRunScriptPath = BatchRunScript.replace('\\', '/').split(BatchRunScriptName)[0] BatchRunModuleName = BatchRunScriptName.split('.')[0]        print 'BatchRunScriptPath: ', BatchRunScriptPath    # X:/PathOfTheScript/ print 'BatchRunScriptName: ', BatchRunScriptName    # NameOfScriptToRun.ScriptToRun() print 'BatchRunModuleName: ', BatchRunModuleName    # NameOfScriptToRun  sys.path.append(BatchRunScriptPath) import BatchRunModuleName maya.utils.executeDeferred(BatchRunScriptName)    It gives me this error:  Error: ImportError: file <maya console> line 13: No module named BatchRunModuleName   Is there another way to do run a python script from inside another?

I'm writing a Python application that takes as a command as an argument, for example:  $ python myapp.py command1   I want the application to be extensible, that is, to be able to add new modules that implement new commands without having to change the main application source. The tree looks something like:  myapp/     __init__.py     commands/         __init__.py         command1.py         command2.py     foo.py     bar.py   So I want the application to find the available command modules at runtime and execute the appropriate one.  Python defines an __import__ function, which takes a string for a module name:     __import__(name, globals=None, locals=None, fromlist=(), level=0)      The function imports the module name, potentially using the given globals and locals to determine how to interpret the name in a package context. The fromlist gives the names of objects or submodules that should be imported from the module given by name.       Source:    So currently I have something like:  command = sys.argv[1] try:     command_module = __import__("myapp.commands.%s" % command, fromlist=["myapp.commands"]) except ImportError:     # Display error message  command_module.run()   This works just fine, I'm just wondering if there is possibly a more idiomatic way to accomplish what we are doing with this code.  Note that I specifically don't want to get in to using eggs or extension points. This is not an open-source project and I don't expect there to be "plugins". The point is to simplify the main application code and remove the need to modify it each time a new command module is added.


I want to copy a specific folder from one point to another and I have more the 300 destination folder where I want to copy that specific folder. Can anybody assist me with a proper solution?  shell script suggestion would be great.

The command touch {jan,feb,mar}-{Rep.xls,graph.xls} creates files I can't open:  feb-graph.xls jan-Rep.xls feb-Rep.xls mar-graph.xls jan-graph.xls mar-Rep.xls  So I created one template file 1.ods, saved with OO-Calc. Then I tried to copy this file using cp again in the same fashion as cp:  cp 1.ods {jan,feb,mar}{Rep.ods,graph.ods}     but that doesnt work:     cp: target `margraph.ods' is not a directory   How do I copy a single file to multiple files?


I have written my CV's with a template i made in 2013 and it has worked since then. Now since I reinstalled Windows 7 and everything some months ago i can't compile those CV's anymore. I can compile other documents such as scrartcl or scrrprt. with trial and error I found out that the problems are the lines  \makecvtitle   and  \section{Hobbies}     \cvlistitem{Watching the Grass grow}   When one of these two is included, it won't produce a PDF. It will produce the file CV.synctex.(busy). But it is not actually busy - there is no process in the task manager and I can delete this file. There is no error notification, but there is the followeing warning, which as I remember I always had and it still produced a proper PDF:   You have requested package `moderncvheadi',but the package provides `moderncvheadi'.   I am using Texmaker 5.0.2, MikTeX 2.9 and moderncv 2.0.0.  In the settings of Texmaker I have in the field for pdflatex (which was there by default):  pdflatex -synctex=1 -interaction=nonstopmode %.tex   Thanks a hell lot for telling me what I need to change about installation or settings or whatever so I can compile my CV without changing to another class.  MWE:  \documentclass[11pt,a4paper]{moderncv} \usepackage[british,ngerman]{babel} \usepackage[utf8]{inputenc} \usepackage[T1]{fontenc}  \moderncvstyle{classic} \moderncvcolor{blue}  \firstname{John} \familyname{Smith} \address{Avocado Avenue}{1234 Longyearbyen} \mobile{+99 (0)12 345 67 89} \email{john.smith@gmail.com}  \title{CV}  \begin{document} %\makecvtitle    %This line causes the compiler to fail  \section{Personal Data}     \cvitem{Date of birth}{1st January 1980}  \section{Experience}     \cventry{1998 -- 2005}{Researcher}{Umbrealla Corporation}{Longyearbyen}{}{Researching Stuff}  \section{Hobbies} %   \cvlistitem{Watching the Grass grow}    %This line causes the compiler to fail  \end{document}

I'm a real novice on LaTex, having only used it previously a small amount at University but not for a while. I've decided I'd quite like to transfer my CV to the LaTex moderncv style. I downloaded the package here  I use TexWorks, and I was hoping I'd just be able to open the template file from the moderncv download, compile it and edit the text to produce a nice CV. Unfortunately, when I try to do this I get the following error:  Running ttf2pk.exe... miktex-makepk: PK font umvs could not be created. !pdfTeX error: pdflatex.EXE (file umvs): Font umvs at 864 not found ==> Fatal error occurred, no output PDF file produced! texify: pdflatex failed for some reason (see log file).  So it seems to be a problem with not having a font package installed or something?! Do you know which package this is? And how do I actually download a font package so that TexWorks knows it's installed and thus compiles the file? I've heard people talk about Miktex package installer, but I don't think I have that available, but I set up all my LaTex stuff quite a while ago, so I'm not sure... Sorry for my very poor understanding of LaTex, I'd just like to find a way to get this moderncv package working asap. Any help would be much appreciated. Added MWE: \documentclass[11pt,a4paper,sans]{moderncv}          \usepackage[T1]{fontenc} \usepackage[utf8]{inputenc}  \moderncvstyle{casual}                            \moderncvcolor{blue}     \usepackage[scale=0.75]{geometry}  \name{John}{Doe} \title{Resumé title}                                \address{street and number}{postcode city}{country} \phone[mobile]{+1~(234)~567~890}                    \email{john@doe.org}                                 \begin{document} \makecvtitle  \section{Education}  \end{document}  still does not compile and produces the error:  !pdfTeX error: pdflatex.EXE (file umvs): Font umvs at 657 not found ==> Fatal error occurred, no output PDF file produced! texify: pdflatex failed for some reason (see log file).


first of all I am Karthik and I am new to Linux. I heared about Ubuntu and I switched to it from Windows 10. I liked the style and efficiency of Ubuntu. I am using Ubuntu 12.10.... I need to know more about Ubuntu. First of all my firefox web browser is outdated. How can I update it? and how can i install any other softwares? Any help will be thankful.

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


I see a ton of references as to how to UPGRADE your Mesa drivers using PPAs. However, is there a way to DOWNGRADE easily? For example, I currently have Mesa 17.1.3 installed but would like the ability to revert to Mesa 11.2 and back if necessary.  I'll notice games on Steam have specific Mesa versions in their requirements page and would like to be able to install different versions of the driver to accommodate for stability while playing that game. I'm stumbling across multiple bugs and the feedback I get from the support team is "Try Mesa x.x.x" (helpful, right?).

How can I downgrade a package to an older version via apt-get?  Other tools are also acceptable but apt-get is preferred.


i am getting an dpkg error while installing eclipse...  sanju@sanju-HP-000-Notebook-PC:~$ sudo apt-get install eclipse E: dpkg was interrupted, you must manually run 'sudo dpkg --configure -a' to correct the problem.    how i fix this error.. plz guys help me..

I was running an upgrade with the apt-get command, and it was taking an exceptionally long time because half way through my ISP hit me in the face with their fair usage policy.   After sitting outside & watching the rain for awhile my electronics regained consciousness, so I went back to complete the upgrade and my terminal scolds me with   "E: dpkg was interrupted, you must manually run 'sudo dpkg --configure -a' to correct the problem."   The last bit of legible info was all this:  Installing (ri/RDoc) documention for (stuff and such) ERROR:  Could not find a valid gem 'watobo-0.9.8.724.gem' (>= 0) in any repository rm: cannot remove `watobo-0.9.8.724.gem': No such file or directory  Setting up metasploit (4.3.0-bt1) ... Upgrading Pre-Existing Installation... /opt/metasploit/postgresql/scripts/ctl.sh : postgresql  (pid 1191) already running prosvc is running metasploit is running [*] [*] Attempting to update the Metasploit Framework... [*]   So on it goes for miles, talking about gem caches, rubies, & stuff I wish I had. All up until:  A    lib/gemcache/ruby/1.9.1/gems/state_machine-1.1.2/gemfiles/active_record-2.1.2.gemfile.lock   ...and there it has sat, all night.    If I stop it, will I still get the dpkg error (on the off chance that I won't), or if so what do I need to to resume using apt-get commands and its Super Cow Powers?


I only see tutorials for installing Ubuntu on a Chromebook with crouton, but I want fully working Ubuntu! Is it possible to Install Ubuntu on a Chromebook without crouton?

I have installed Ubuntu 13.04 on my desktop (runs like a charm). Then I used Crouton to install Ubuntu 12. 04 on my chromebook samsung (ARM). It also works quite well.  Here comes my question. Can we have a true Ubuntu (preferably 13.04) on my ARM chromebook?  It seems that the Crouton/Ubuntu is not 100% the real thing.  The best option would be to have the full Ubuntu 13.04 and remove the Chrome OS.


I tried everything I found online, but none of the methods I found worked. The buttons don't work, and there's no such thing as Brightness in Monitor Settings. I tried   xbacklight -set   but it didn't do anything. (Theoretically it should have worked, I have everything installed and it actually ran, but no effect was shown.) I also tried   xrandr --output VG1 --brightness   but it had some error.  My eyes are pleading for help :3

I faced this problem when I bought a new HP Laptop, hoping to install Ubuntu, but when I booted from a Live DVD the brightness was set at max and couldn't be changed with the function keys or from the brightness settings bar, and it was the same after installation.   HP Probook 4440s Intel core i5 3210m  Intel HD 4000 graphics  6gb ram Motherboard-HP


I have searched everywhere on the web for a way to do this, but I can’t find anything. Someone have any ideas for doing this without using physical simulations? The operation should be this: the red wire passes through the blue object (which is static) and is anchored to the yellow object, which can rotate When the yellow object rotates, the wire wraps around the cylinder in a similar way to a fishing rod.

Actually, it's not so simple as the title suggests... :)  I might be asked to animate something like this -   Here's a still from that video:    It's the process of doing helical wrapping of carbon fiber a ribbon around a pressure vessel. And  you'll see a simpler activity of hoop wrapping, which I'd also need to animate.  I've got some basic experience with Blender (e.g. ), but I have no idea where to start with this kind of animation! At this point I haven't spoken to my client, so I don't know whether this will be requested; but I'd value input from Blenderheads here so that if I'm asked for it, I'll be able to respond with "sure!", or "can't be done", or "sure, but it'll cost ya!". :)  Pointers, anyone? Thanks!


I recently am working on a scene in Blender Cycles which has a relatively great number of objects. Some are more detailed and need more subdivide but the small objects are all just subdivided once.  So the problem is that my blender gets slow when I move the camera in the viewport.  In 3ds Max you can choose objects that you dont need to look at right now and select "Show them as box", which will let them be displayed as a wireframe box and therefore wont stress the scene that much.   My question is if there is a function like that in Blender? (exept hiding objects)  And do you have tips on working on bigger scenes in blender too keep it fast? For example I have a lot of chopsticks in my scene. Should I merge them together to 1 object instead of individual objects and then just give them different materials?   thanks in advance :)

I'm currently working on a scene containing 1000+ objects which all need to be set to a different draw type to save on computationally expenses in the viewport. But doing this for every object separately is really tedious. Therefor I'm wondering if there's a way to change the maximum draw type of multiple objects simultaneously. Preferably only the selected objects.


So I have this component where I want to create a @api accesible variable containing Cases instead of Strings I was using, to be accessed from a visual Flow.   The whole thing was running smooth with another variable  <property name="selectedIds" type="String[]"/>  <property name="ticketsReturned" type="@salesforce/schema/Case[]"/>   The js is able to populate the values correctly but once i'm back in the flow and moving forward and pass this variable to a Apex method it's always null. So I assume the javascript is able to operate with the list but it cannot assign correctly the Case[] type to be accessed as such from the flow?   Is my syntax correct?

I've got a custom built LWC to be used within a screen component in a flow. My component basically renders a collection of SObjects in a distinct way. It can also deal with different types of sObjects.  The only thing I cannot get working is my design time configuration file. I want to register the property to allow the user to bind any kind of sObject collection (Account, Contact, Custom Object, etc.) to that property in the Flow Builder.  This is my configuration:  <targetConfigs>   <targetConfig targets="lightning__FlowScreen">     <property name="records" label="Record collection" type="@salesforce/schema/Account[]" role="inputOnly"/>   </targetConfig> </targetConfigs>   This works - but limits the user to provide an Account collection.  I've tried all of the following - without success:  type="@salesforce/schema/SObject[]"  Result: Invalid reference SObject of type sobjectClass in file recordPicklist.js-meta.xml  type="@salesforce/schema/Object[]"  Result: Invalid reference Object of type sobjectClass in file recordPicklist.js-meta.xml  type="Object[]"  Result: Type 'Object[]' is either not supported by 'lightning__FlowScreen' or does not exist.  Can anybody tell me how to achieve this?  Thanks!


In PCA,why is finding the eigenvectors and eigenvalues of the covariance matrix of the data equivalent of fitting  principal-component lines to the variance of the data?  I have understood eigen vectors in terms of matrix transformation.But why do eigen vectors of the co-variance matrix of the data give us the lines which express maximum variance?

I've read a lot about PCA, including various tutorials and questions (such as , , , and ).   The geometric problem that PCA is trying to optimize is clear to me: PCA tries to find the first principal component by minimizing the reconstruction (projection) error, which simultaneously maximizes the variance of the projected data.    When I first read that, I immediately thought of something like linear regression; maybe you can solve it using gradient descent if needed.  However, then my mind was blown when I read that the optimization problem is solved by using linear algebra and finding eigenvectors and eigenvalues. I simply do not understand how this use of linear algebra comes into play.  So my question is: How can PCA turn from a geometric optimization problem to a linear algebra problem? Can someone provide an intuitive explanation?  I am not looking for an answer like  that says "When you solve the mathematical problem of PCA, it ends up being equivalent to finding the eigenvalues and eigenvectors of the covariance matrix." Please explain why eigenvectors come out to be the principal components and why the eigenvalues come out to be variance of the data projected onto them  I am a software engineer and not a mathematician, by the way.  Note: the figure above was taken and modified from .


So I am looking to completely redesign a site, keep the domain name, but change the host. Every damn article / tutorial for successful website migration I was looking at is assuming that the old site/domain will still be live - to host the .htaccess file.  In my case, the client has a site with some company (one of those cheap site-builder companies for beginners). I need to completely redesign the layout and content of the site, move it to a new host and keep the domain and SEO juice - surprisingly, the site has a very good ranking.  What is the best way to go about this ? Thank you.

I'm refactoring my ASP.net application from ASP.net 3.5 to 4.0. Also I'm changing the URLs to user friendly URLs /product.aspx?id=100 to /product-name/100.  All my pages are indexed by search engines and the site has already been online for 6 years. I'm planning to do 301 redirect from the old pages to the new one.  I want to make sure I won't lose the rankings and traffic.  Any suggestion how to do it properly?


What are the advantages of using a  instead using ?  I usually get the elapsed time using the following mechanism:  int ini = Environment.TickCount // perform some operations int elapsedMilliseconds = Environment.TickCount - ini;   But some SO experts recommended using an StopWatch:  StopWatch sw = new StopWatch(); sw.Start(); // perform some operations sw.Stop(); int elapsedMilliseconds = sw.EllpasedMillseconds;   Is just a OOP thing, or maybe I'm measuring the elapsed time in a wrong way?

Is it ever OK to use Environment.TickCountto calculate time spans?  int start = Environment.TickCount; // Do stuff int duration = Environment.TickCount - start; Console.WriteLine("That took " + duration " ms");   Because TickCount is signed and will rollover after 25 days (it takes 50 days to hit all 32 bits, but you have to scrap the signed bit if you want to make any sense of the math), it seems like it's too risky to be useful.   I'm using DateTime.Now instead. Is this the best way to do this?  DateTime start = DateTime.Now; // Do stuff TimeSpan duration = DateTime.Now - start; Console.WriteLine("That took " + duration.TotalMilliseconds + " ms");


If we use the Lorentz equation for the length contraction, and the Schwarzschild equation for the lightlike sphere, we can calculate the velocity for the object to form a black hole:  $ \Delta x^{'}=\Delta x\,\sqrt{1-\dfrac{v^2}{c^2}}\,\, $ --> Lorentz formula  $ r_{\text{s}}=\dfrac{2Gm}{c^2}\,\, $ --> Schwarzchild formula  $ 2r_{\text{s}}=\Delta x^{'}\,\, $ --> to a sphere  $ 2\left(\dfrac{2Gm}{c^2}\right)=\Delta x\,\sqrt{1-\dfrac{v^2}{c^2}} $  $ v=c\,\sqrt{1-\left(\dfrac{4Gm}{\Delta xc^2}\right)^2} $  Is this correct? Is this the speed that the object, in the spherical case, would have to attain to become a black hole?  Sorry for my English and little knowledge of physics, I am a freshman student in a university in Brazil.

I'm a big fan of the podcast Astronomy Cast and a while back I was listening to a Q&A episode they did. A listener sent in a question that I found fascinating and have been wondering about ever since.   From the show :      Arunus Gidgowdusk from Lithuania asks: "If you took a one kilogram mass and accelerated it close to the speed of light would it form into a black hole? Would it stay a black hole if you then decreased the speed?"   Dr. Gay, an astrophysicist and one of the hosts, explained that she'd asked a number of her colleagues and that none of them could provide a satisfactory answer. I asked her more recently on Facebook if anyone had come forward with one and she said they had not.  So I thought maybe this would be a good place to ask.


I installed a trial software, NTFS for Mac, and then uninstalled it (via AppZapper). However, I am still getting occasional desktop notifications and I don't know how to get rid of these. Any suggestions?  Thanks Oren

I used paragon NTFS for a while and then deleted it from applications folder. I also removed the dmg file(I know it would not stop notifications).   But I keep getting notifications like this everyday.  .  Clicking on it is useless. Safari would open(if not already) but no new window, no webpage, nothing.  I searched the Library folder for NTFS and paragon and deleted files and folders for e.g. from application support, from caches. One folder in its name had "notification". I deleted that too. Unhid hidden files by CMD + Shift + . For a temporary fix, I turned off notification from System Preferences. But I need a permanent fix.


The following inequality is valid for all positive real $x$, $$ x - (1+x)\log(1+x) \leq \frac{-x^2}{2(1+x)}. $$ It is possible to show that this is true by considering the function $$ f(x) := x - (1+x)\log(1+x)+ \frac{x^2}{2(1+x)}. $$ By differentiation it is possible to check that $f(x)$ attains it maximum on the nonnegative reals at $x = 0$. However, is there a cleaner, more obvious way to see that this is true? Specifically, I would like a solution that does not require me to analyze the monotonicity of $f$ via differentiation if possible. I tried Taylor expansion, but do not get this inequality.

This is used to go from Bennett's inequality to Bernstein's inequality. Yet I don't understand how to prove the inequality.  Assume that $u > 0$, define $$ h(u) = (1+u) \log (1+u) - u $$ show that $$ h(u) \ge \frac{u^2}{2(1+u/3)} $$    My research :  Decomposing the function $h$ as a power series show that it is equivalent to $$ \sum_{n=1}^\infty (-1)^n \frac{u^n}{n+1} \frac{n-1}{n (n+2)} \ge 0 $$ Sadly, I see no reason for this series to be positive.    SOLUTION  The twice differenciation technique given below works. However, I don't agree with the calculus, only on small things that don't change the result. Define $$ g(u) = (1+u)\log (1+u) - u - \frac{3u^2}{2(3+u)} $$ $$ g'(u) = \log (1+u) + 1 - 1 - \frac{3}{2} \frac{2u (3+u) - u^2}{(3+u)^2}\\ $$ Simplifying, $$ g'(u) = \log (1+u) - \frac{3}{2} \frac{u(u+6 )}{(3+u)^2}   $$ $$ g''(u) = \frac{1}{1+u} - \frac{3}{2} \frac{(2u +6)(3+u)^2 -  2 (u+3)(u^2 + 6u) }{(3+u)^4}   $$ Simplifying,  $$ g''(u) = \frac{1}{1+u} - \frac{3}{2} \frac{2u^2 +6u + 6u + 18 -  2u^2 - 12u }{(3+u)^3}   =  \frac{1}{1+u} - \frac{ 27  }{(3+u)^3}  $$  Simplifying again,  $$ g''(u)= \frac{ u^3 + 3\times 3u^2 + 3 \times 9u + 27 - 27(1+u)}{(1+u)(3+u)^3}  = \frac{ u^2(u+9)}{(1+u)(3+u)^3} > 0 $$ And the result is given by the reasoning of Clement.


I have to write a function that takes as input two numbers n and k and prints on the screen all the k-length subsets of a set created by n (order is not important), so basically a function that prints all the k-combinations of n.  For example: If n = 4 and k = 2 the initial set becomes (1,2,3,4) and it prints the following subsets:  (1,2),(1,3),(1,4),(2,3),(2,4),(3,4)  I know that there is already a function that does that, but I have to create the function from scratch, so the use of the itertools or any other module is prohibited, and no, I can't copy the combinations function from the documentation and paste it on my code. As you may have understood, this is an assignement from my university, so I am not asking you to solve it for me and give me a code, I would like someone to explain to me how can I do it.  I know that it has to be done with a recursive function, because the number k is not known. I've also thought of 2 different solutions of how can I do this and I'm not sure if they're correct:  1st solution:  Create the powerset of the given set, and then remove all the subsets whose length is different than k.  2nd solution:  Populate a list with numbers from 1 to n^k, and then remove all the numbers that have duplicates in them. Then transform the numbers to strings and print them as sub-sets.

I have a list with 15 numbers in, and I need to write some code that produces all 32,768 combinations of those numbers.   I've found  (by Googling) that apparently does what I'm looking for, but I found the code fairly opaque and am wary of using it. Plus I have a feeling there must be a more elegant solution.  The only thing that occurs to me would be to just loop through the decimal integers 1–32768 and convert those to binary, and use the binary representation as a filter to pick out the appropriate numbers.   Does anyone know of a better way? Using map(), maybe?


In the double-slit experiment, the "observer" is the one actually firing one photon. How does the observer fire one photon? Does not one have to "observe and "measure out" a single photon? How does one isolate one photon without collapsing it to begin with?

Many documentaries regarding the double slit experiment state that they only send a single photon through the slit. How is that achieved and can it really be ensured that it is a single photon?


I am experiencing anissue when installing Windows 7 64-bit on a clean 240GB SSD. My motherboard is a GA-MA785GMT-UD2H, BIOS detects the SATA drive and Windows 7 does detect the drive when booting off my old HDD.  I know the drive is good.  Updated the Firmware on the SSD  Updated the motherboard BIOS firmware  I have enabled SATA and using AHCI  Connected my SSD to sata port 0 on the mortherboard  Disconnected all other HDD  Downloaded the Windows 7 64-bite Sata AHCI drivers from Gigabyte website and installed on thumb drive  I click on load drivers, browse to the thumb drive, select the drive and click OK.  Windows 7 still does not find the SSD drive.

I just bought a SATA SSD, and wish to install Windows 7 directly on it, but when Windows asks me where do I want to install it, it doesn't recognize any drives.   I have disconnected all my other HDDs My BIOS recognizes the SSD. I went back to my original installation of Windows and my SSD is recognized


How can I prove that $AB-BA=I_2$ cannot hold whatever the real $2\times 2$ matries $A, B$.    Suppose $A=\pmatrix{ a_{11} & a_{12}\\ a_{21} & a_{22}}$ and $B=\pmatrix{b_{11} & b_{12} \\ b_{21}& b_{22}}$.    Then $AB=(c_{ij})$, where $c_{ij}=\displaystyle\sum_{r=1}^2a_{ir}b_{rj}, i,j=1,2$ and $BA=(d_{ij})$, where $d_{ij}=\displaystyle\sum_{s=1}^2b_{it}a_{tj}, i,j=1,2.$    Now $AB-BA=I_2\implies c_{ij}-d_{ij}=\displaystyle\sum_{r=1}^2a_{ir}b_{rj}-\displaystyle\sum_{s=1}^2b_{it}a_{tj}$. $\implies a_{12}b_{21}-b_{12}a_{21}=1, a_{21}b_{12}-a_{12}b_{21}=1,$    $b_{12}(a_{11}-a_{22})+a_{12}(b_{22}-b_{11})=0,$    $a_{21}(b_{11}-b_{22})+b_{21}(a_{22}-a_{11})=0$.     From the first two, $a_{12}b_{21}=b_{12}a_{21}$ is ambiguous. Hence the result follows.  I am looking alternative method to show the result. Is there any other way to show this result?

The following question is from Artin's Algebra.      If $A$ and $B$ are two square matrices with real entries, show that $AB-BA=I$ has no solutions.    I have no idea on how to tackle this question. I tried block multiplication, but it didn't appear to work.


I want to be able to make a program for example in Python and then execute it in the terminal no matter where I am located. I mean, if I have an executable python file AND I'm in the same folder of the file I can directly execute it but if I'm in other folders I can't.  I want to be able to execute it from anywhere as I do with all the terminal commands. I think it has to do with te PATH but i'm pretty new to Linux so I'd thank any help with this. Thanks!

Is it possible to run my scripts located in ~/scripts from anywhere?  Say i want to run ./scriptname regardless of my current working directory.


The set $\mathcal{B}=\{(a,b) : a < b, a,b\in\mathbb{R}\}$ is a base for the usual topology. Hence every open set in $\mathbb{R}$ can be written as a union of elements of $\mathcal{B}$.   What I don't know is how does that definitions work here with the empty set. I don't see the way you can write the empty set as a union of elements of $\mathcal{B}$

What is the definition of an interval and why is the empty set an interval by that definition?


What is the difference between the neutrinos of electron, muon and tau leptons.? They all same to be neutral and carry a very small mass. Similarly what is the difference bewteen anti neutrinos of electron, muon and tau leptons

Moreover, how-come scientist know that muon-neutrino are different from electron-neutrino when they didn't even know what the difference was? Did they interact differently with other particles?


I have a question about any kind of.  Results can be applied to any kinds of drawing or texturing applications   In the sentence above, should I use any kind of applications or any kinds of applications?  I checked the Internet and everyone on the web goes for any kind of; however, all the examples include uncountable words. But, in my case, because of referring a computer software, application is countable and because of using any, it should be plural, I guess.  So, basically, is it always any kind of or if the word is countable and plural, can I use any kinds of?  Thank you in advance!

This question has troubled me for ages despite my several attempts of looking it up in dictionaries or usage books. Do we say, "Do you have any ideas" or "Do you have any idea"? I do see an example where "any" means "it doesn't matter who/which/what", therefore "You can borrow any book you like." Also, does it matter between using it in questions and negatives?


I have the following snippet   $( "#diner_option" ).click(function( event ) {   event.preventDefault();   console.log('ok') });            $( "#change" ).click(function( event ) {     var add_html = "

salade tiede de courgettes

"     $("#diner_div").replaceWith(add_html)     console.log('changed'); });  .recipe_option{         position: absolute;         padding: 15px;         top: 0;         right: 0;         background: #353b43;         border-bottom-left-radius: 10px;     }  <link rel="stylesheet" href="https://maxcdn.bootstrapcdn.com/bootstrap/4.0.0/css/bootstrap.min.css" integrity="sha384-Gn5384xqQ1aoWXA+058RXPxPg6fy4IWvTNh0E263XmFcJlSAwiGgFAW/dAiS6JXm" crossorigin="anonymous"> <link rel="stylesheet" href="https://pro.fontawesome.com/releases/v5.10.0/css/all.css" integrity="sha384-AYmEC3Yw5cVb3ZcuHtOA93w35dYTsvhLPVnYs9eStHfGJvOvKxVfELGroGkvsg+p" crossorigin="anonymous"/>  <button id="change">Change</button>

salade tiede de courgettes

    When I click on cog icon, I get in the console the message ok which means it worked as intended. But when I click on the change button to refresh the dom and click on the cog, the event.preventDefault(); function doesn't work. The cog works like a link then. I would like to be able to reload the dom and the cog icon still work (which means, shows the ok message)

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


I am conducting a descriptive study, and I am  using the entire population in my study and not a sample. I understand that everything I am reporting is a population parameter at this point. However, how do I  report the relationships I might find between variables. For example, if I were to set up a contingency table, how will what I find be demonstrated as being significant. Should I use chi square?

Imagine you have to do reporting on the numbers of candidates who yearly take a given test. It seems rather difficult to infer the observed % of success, for instance, on a wider population due to the specifity of the target population. So you may consider that these data represent the whole population.   Are results of tests indicating that the proportions of males and females are different really correct? Does a test comparing observed and theoretical proportions appear to be a correct one, since you consider a whole population (and not a sample)?


If $a_n$ and $b_n$ are sequences of non-negative numbers and both converge, how do I argue that $\sum a_n b_n$ also converges? My attempt: I tried to argue that $a_n b_n\le(a_n+b_n)^2=a_n^2+2a_nb_n+b_n^2$, but I am stuck on how to proceed from here.. I have a feeling that I should use the comparison test, but I am not too sure.

Let ${a_n}$ and ${b_n}$ sequences with positive terms, such that $\sum a_n$ and $\sum b_n$ converges. Prove that $\sum a_nb_n$ converges as well.  What I did: $\sum a_nb_n \le \left(\sum a_n\right) \left(\sum b_n\right)$ and by comparison test we are done.  However, when I asked my teacher regarding that solution, he told me that I can assume that inequality for finite numbers but for infinite numbers, it is not valid. It seems to me that $\left(\sum a_n\right) \left(\sum b_n\right)$ is absolute converges so that are no Riemann issues with this.  Can any one enlighten me and explain why is this invalid?


Because the input to  must be sorted, often the command is called similarly to:  join <(sort file1) <(sort file2)   This is not portable as it uses process substitution, which is not specified by POSIX.  join can also use the standard input by specifying - as one of the file arguments.  However, this only allows for sorting one of the files through a pipeline:  sort file1 | join - <(sort file2)   It seems there should be a simple way to accomplish sorting of both files and then joining the results using POSIX-specified features only.  Perhaps something using redirection to a third file descriptor, or perhaps it will require created a FIFO.  However, I'm having trouble visualizing it.  How can join be used POSIXly on unsorted files?

Some shells, like bash, support  which is a way to present process output as a file, like this: $ diff <(sort file1) <(sort file2)  However, this construct isn't  and, therefore, not portable. How can process substitution be achieved in a -friendly manner (i.e. one which works in /bin/sh) ? note: the question isn't asking how to diff two sorted files - that is only a contrived example to demonstrate !


i have problem with my android studio i want to passing data with parcel but it cant cause i get this message if i click my list view always get force close, how to fix it?  error          package com.example.moviee;  import androidx.appcompat.app.AppCompatActivity;  import android.os.Bundle; import android.widget.ImageView; import android.widget.TextView;  import java.util.ArrayList;  public class MovieDetail extends AppCompatActivity {      String txt_name;     String txt_deskripsi;     int foto;      public static final String EXTRA_MOVIE = "text_extra_movie";      TextView tvName, txt_detail;     ImageView imgposter;     @Override     protected void onCreate(Bundle savedInstanceState) {         super.onCreate(savedInstanceState);         setContentView(R.layout.activity_movie_detail);          tvName = findViewById(R.id.text_ph);         txt_detail = findViewById(R.id.txt_deksrip);         imgposter = findViewById(R.id.img_poster);          ArrayList<Film> film = new ArrayList<>();         film = this.getIntent().getParcelableArrayListExtra(EXTRA_MOVIE);          txt_name = film.get(0).getNama();         tvName.setText(txt_name);          txt_deskripsi = film.get(0).getDeskripsi();         txt_detail.setText(txt_deskripsi);          foto = film.get(0).getFilm();         imgposter.setImageResource(foto);     } }   movieDetail.java      package com.example.moviee;  import androidx.appcompat.app.AppCompatActivity;  import android.content.Intent; import android.content.res.TypedArray; import android.os.Bundle; import android.view.View; import android.widget.AdapterView; import android.widget.ListView; import java.util.ArrayList;   public class MainActivity extends AppCompatActivity implements View.OnClickListener {     private FilmAdapter adapter;     private String[] dataNama;     private String[] dataDeskrip;     private TypedArray dataPhoto;     private ArrayList<Film> filmed;      @Override     protected void onCreate(Bundle savedInstanceState) {         super.onCreate(savedInstanceState);         setContentView(R.layout.activity_main);           adapter = new FilmAdapter(this);         ListView listView = findViewById(R.id.lv_list);         listView.setAdapter(adapter);          prepare();         addItem();          listView.setOnItemClickListener(new AdapterView.OnItemClickListener() {             @Override             public void onItemClick(AdapterView<?> adapterView, View view, int i, long l) {                 Intent intent = new Intent(MainActivity.this, MovieDetail.class);                 ArrayList<Film> movies = new ArrayList<Film>();                  Film movie = new Film();                 movie.setFilm(dataPhoto.getResourceId(i, -1));                 movie.setNama(dataNama[i]);                 movie.setDeskripsi(dataDeskrip[i]);                   movies.add(movie);                 intent.putParcelableArrayListExtra(MovieDetail.EXTRA_MOVIE, movies);                 startActivity(intent);             }         });     }      @Override     public void onClick(View v) {     }     private void addItem(){         ArrayList<Film> films = new ArrayList<>();          for (int i = 0; i < dataNama.length; i++){             Film film = new Film();             film.setFilm(dataPhoto.getResourceId(i, -1));             film.setNama(dataNama[i]);             film.setDeskripsi(dataDeskrip[i]);             films.add(film);         }         adapter.setFilms(films);     }       private void prepare(){         dataNama = getResources().getStringArray(R.array.data_film);         dataDeskrip = getResources().getStringArray(R.array.data_deskripsi);         dataPhoto = getResources().obtainTypedArray(R.array.data_foto);     } }   mainactivity.java

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 have a 1 TB hardisk which is lmv2 and I want to make two partitions of it.  one to normally store stuff.  and one ntfs where i can store windows  BUT I get error when i use gpart and this is what it looks like    When I try to resize the 930 gb drive, it says it's busy as Ubuntu is using it:

These are my current disk partitions. /yedek is for some personal backup files. As you can see there is only Ubuntu on my PC. I will install Windows, too. Because of this I want to shrink /dev/sda3 . It currently 546GB and I want to split it: 300GB for / and 246GB for Windows (NTFS) is OK for me.  I'm using GParted for the first time. How can I shrink /?  I don't want to lose any datas from Ubuntu.


somebody through a dell Inspiron 1150 laptop(2004) with Ubuntu 10.10 on it but it needs a password which i don't have i tried to install 13.04 but i got an internal error message saying  executablepath /usr/lib/nux/unity_support_test   than i tried to download the 10.10 version but when i turned on with the burned cd inside  it didn't work  I'll be happy if someone could help and would like to help me.

For a given hardware configuration, how do I find out if Ubuntu will run on it? What considerations should I take into account when choosing an Ubuntu version and  such as:    with a lighter desktop than the usual Gnome and Unity  with the even lighter LXDE desktop   Obviously Ubuntu does not run on some processor architectures. So how do I go about choosing the right version and derivate. How can I find out the minmal system requirements?


Command \frac works in strange way:    Any suggestions?  \documentclass{report} \usepackage{polski} \usepackage[cp1250]{inputenc} \usepackage{graphicx}  \begin{document} \setcounter{secnumdepth}{3} \setlength{\textheight}{24.4cm} \setlength{\parindent}{0mm}  \frac{1}{2}  \end{document}

I want to write as a math fraction 1/4 " ( a quarter of inch). I want to write this fraction out of an equation because is a characteristic of an element.


I have made a program that tells me if I am connected to the internet or not. Now I want it to ping www.google.com and show me the ping time in ms. I don't want to use any 3rd party software or download anything.  Edit: My code is:  def is_connected():   try:     # see if we can resolve the host name -- tells us if there is     # a DNS listening     host = socket.gethostbyname(REMOTE_SERVER)     # connect to the host -- tells us if the host is actually     # reachable     s = socket.create_connection((host, 80), 2)     return True   except:       pass   return False   The above code just tells me if I am connected to the internet. What I want is a simple way to show the ping of a website. This is not a duplicate as it doesn't answer my question.

How do I ping a website or IP address with Python?


I often hear that gravitational force is much "weaker" than electroweak and strong forces. But how can you compare the strength of interactions without the parameters like mass, charge on which it depends? Surely the gravitational force can be made as (practically) strong as one wants by increasing the mass?

I can understand that on small scales (within an atom/molecule), the other forces are much stronger, but on larger scales, it seems that gravity is a far stronger force; e.g. planets are held to the sun by gravity. So what does it mean to say that "gravity is the weakest of the forces" when in some cases, it seems far stronger?


Finding value of $\displaystyle \int^\infty_{-\infty}\frac{e^{2x}-e^x}{x(e^{2x}+1)(e^x+1)} \, dx$  Attempt: Let $\displaystyle I = \int^\infty_{-\infty}\frac{e^{2x}-e^x}{x(e^{2x}+1)(e^x+1)} \, dx = 2\int^\infty_0 \frac{e^{2x}-e^x}{x(e^{2x}+1)(e^x+1)} \, dx$  So $$I = 2\int^\infty_0 \bigg(\frac{1}{e^x+1}-\frac 1 {e^{2x}+1}\bigg)\frac 1 x \, dx = 2\int_0^\infty \frac 1 {(e^x+1)x} \, dx - 2\int_0^\infty \frac{1}{(e^{2x}+1)x} \, dx$$  Could some help me how to solve it, thanks.

This integral popped up recently  $$\int_{-\infty}^{\infty} \frac{e^{2x}-e^x}{x (1+e^{2x})(1+e^{x})}\mathrm{d}x = \log 2$$  A solution using both real and complex analysis is welcome. I tried rewriting it using symmetry, and then the series expansion of $1/(1+e^{nx})$, however this did not quite make it.   \begin{align*} I & = 2\int_{0}^{\infty} \frac{e^{2x}-e^x}{x e^{3x}(1+e^{-2x})(1+e^{-x})}\mathrm{d}x \\ & = 2 \int_{0}^{\infty}\frac{e^{-2x} -e^{-x}}{x} \left(\sum_{n=0}^\infty  (-1)^n e^{-n x}\right)\left(\sum_{m=0}^\infty (-1)^me^{-2mx}\right) \mathrm{d}x  \end{align*} The first part reminds me of a Frullani integral (it evaluates to $\log 2$). However I am unsure if this is the correct path, any help would be appreciated. =)


How do I add values to the app.config or web.config's appSettings section in C#?

What I want to achieve is very simple: I have a Windows Forms (.NET 3.5) application that uses a path for reading information. This path can be modified by the user, by using the options form I provide.  Now, I want to save the path value to a file for later use. This would be one of the many settings saved to this file. This file would sit directly in the application folder.  I understand three options are available:   ConfigurationSettings file (appname.exe.config) Registry Custom XML file   I read that the .NET configuration file is not foreseen for saving values back to it. As for the registry, I would like to get as far away from it as possible.  Does this mean that I should use a custom XML file to save configuration settings?  If so, I would like to see code example of that (C#).  I have seen other discussions on this subject, but it is still not clear to me.


… although I have more than enough on Stack Overflow. The question I'm trying to answer is:  This problem has annoyed me for awhile. I found the solution by chance - naturally - but only after I started to analyze everything in depth. I am pretty sure that my answer could help many developers. So - how do I get the missing 4 reputation points? I could ask and self-answer the same question, but it would be closed as a duplicate and/or possibly deleted. Edit - So not - I know the solution for that question. I tried to help On the other hand - rules are rules. Edit II: I never asked about a bonus - I don't even care.

Questions can be protected (i.e. marked "highly active").   What does it mean for a question to be protected? Why are some questions protected? Who can protect and unprotect questions? Who can answer a protected question? How are protected questions displayed? When should I protect or unprotect a question? When does the Community user protect a question?


I'd like to add a custom page template to the drop down menu shown in the picture.    Had a good google at this but couldn't find anything, was too hard to form a concise query.   Thanks for reading

I am developing a WP theme with MVC approach. It only have index.php, functions.php and styles.css on the parent directory. So, I do not want to place page templates on it rather then I want to programmatically provide them from View classes while functionality from edit screen stays the same.   Users need to have page templates select option on the edit screen. How do I successfully add Items to the template dropdown?  I tried to hook into  filter.   Example code:  add_filter( 'theme_page_templates', function($templates){      $templates['my-page-template.php'] = "My Page Template";      return $templates;  });   This does not work because of the use of  on the filtered array, which removes the added page template item. I don't understand why this function is used. It seems you can only remove page template from the list but can not add a new one using the given filter.  Is there any other way around?


Let $X$ be a $T_1$-space and $A\subset X$.   Claim: $A'$ is closed, where $A'=\{x\in X|(U\setminus\{x\})\cap A\ne\emptyset$ for all open neighbourhoods of $x\}$.  Proof: Let $x\in (A')^c$ be arbitrary.   Then $x\notin A'$ so there is an open set $U$ containing $x$ such that $U\setminus\{x\}\cap A=\emptyset.$  Since $X$ is $T_1,$ it follows that $\{x\}$ is closed and so $U\setminus\{x\}$ is open.   Thus, using the facts that $U\setminus\{x\}\cap A=\emptyset$ and $U\setminus\{x\}$ is open, we have $U\setminus\{x\}\subset (A')^c.$   And since $x\in (A')^c$ it follows that $U\subset (A')^c.$   So we have shown that for any $x\in (A')^c,$ there is an open set $U$ containing $x$ such that $U\subset (A')^c,$ and so $(A')^c$ is open.  Does this prove the claim?  EDIT: I know the claim is true. I just wanted to verify whether my reasoning was correct.

Let $E$ be a $T_1$ space, and $A\subset E$ , I need to prove that $A'$ is closed, so my idea is to prove that $C_{E}A'$ is open i.e a neighborhood of all it's point.  But how to do this ?


Some background  I am developing a small DI Container based on Lambda expressions.  I have the interface representing the lambda:  @FunctionalInterface public interface LambdaOp<T> {     T resolve(); }   And this is the (very simplified) Container:  public class Container {     private final Map<Class<?>, LambdaOp<?>> bindings;      public <T> void bind(Class<T> clazz, LambdaOp<? extends T> lambda) {         bindingd.put(clazz, lambda);     }      public <T> T resolve (Class<T> clazz) {         LambdaOp<?> lambda = bindings.get(clazz);         return (T) lambda.resolve();      }   }   With this implementation I can do something like that:  container.bind(     FooInterface.class,     () -> {         FooImplementation foo = new FooImplementation();         foo.setParameterA(paramA);         //do whatever needed to configure it         return foo;       } );  FooInterface foo2 = container.resolve(FooInterface.class);   It is working ok and it is nice because the compiler won't let me do something like this:  container.bind(     FooInterface.class,     () -> new BarImplementation() //compiler error; Bar does not implement Foo );   The problem  The bindings Map itself does not guarantee that LambdaOp will have a generic type which extends the Class used as key.  private final Map<Class<?>, LambdaOp<?>> bindings;   As a result I receive an unchecked warning at the line:  return (T) lambda.resolve();   I suppose that the bind method signature is enough to guarantee the cohesion (is it?) but still feel some bad smell.  Is there any way to implement it on a more cohesive way?  EDIT:  The complete code is at . I have made a lot of changes recently and README.md is very a little bit outdated.

Is there a way in Java to have a map where the type parameter of a value is tied to the type parameter of a key? What I want to write is something like the following:  public class Foo {     // This declaration won't compile - what should it be?     private static Map<Class<T>, T> defaultValues;      // These two methods are just fine     public static <T> void setDefaultValue(Class<T> clazz, T value) {         defaultValues.put(clazz, value);     }      public static <T> T getDefaultValue(Class<T> clazz) {         return defaultValues.get(clazz);     } }   That is, I can store any default value against a Class object, provided the value's type matches that of the Class object. I don't see why this shouldn't be allowed since I can ensure when setting/getting values that the types are correct.  EDIT: Thanks to cletus for his answer. I don't actually need the type parameters on the map itself since I can ensure consistency in the methods which get/set values, even if it means using some slightly ugly casts.


I have a somewhat unusual setup for my computer at my desk:  I use an HP Spectre x360, which I connect to an external monitor, which allows me to have two screens to use. Due to space limitations I actually have my laptop's screen flipped upside down next to my external monitor. On Windows, my laptop's screen maintains the orientation it was in before being connected to the external monitor so it shows as being the right orientation.   On Ubuntu, however, the screen automatically flips to its default orientation when plugged into the monitor, which, to my view, shows the laptop's screen as being upside down.  When in display settings, I can change my external monitor's orientation, as shown here    However, when I go to my laptop's built-in display, this option disappears.     How can I change the orientation of my laptop's built-in display while connected to an external monitor?

I am starting to work with 2 displays on Ubuntu. One of them is rotateable, so I can use it easily in both landscape and portrait mode. But I world prefer to have ability to change orientation setting (which could be found in System Settings->Desktop) from terminal or script on one display but don't rotate other one.  I am pretty sure it is possible via xrandr!


I want to select multiple rows of data from a table and add it onto another one.  For example:  Select * from Table1   which would return  id | name  1 | Chad  2 | Mary  3 | Denise   I want to add these rows of data to Table 2  Insert(id, name) values(@id, @name)   Thank you!

I am trying to INSERT INTO a table using the input from another table. Although this is entirely feasible for many database engines, I always seem to struggle to remember the correct syntax for the SQL engine of the day (, , , , and ).  Is there a silver-bullet syntax coming from an SQL standard (for example, ) that would allow me to insert the values without worrying about the underlying database?


I have a problem importing OpenWeatherMap to QGIS. I am new to this type of importing. I have searched old topics, but it seems that things have changed now.   Basically, I have a map in QGIS, and I want to overlay the existing map with a real-time weather data.

I would like to add in QGIS real time weather data.  I found this  and this  and I tried to follow the example, but without any success.  I've added a WMS weather data layer for precipitation to the QGIS map, as follows:  First, the parameters for the service:  service = 'crs=EPSG:900913&dpiMode=7&featureCount=10&format=image/png&layers=precipitation&styles=&url=http://wms.openweathermap.org/service'   Next, create the raster layer, specifying WMS as the type:  rlayer = QgsRasterLayer(service, "precip", "wms")   Finally, add the precipitation layer to the map:  QgsMapLayerRegistry.instance().addMapLayers([rlayer])   the example didn't show any error in the code and no data was added to the weather layer either, I'm not sure why?


How can I distribute $9$ people in $3$ groups of $3$ people? (The order of the groups and the order of the people doesn't matter).  I would like to know the procedure to solve it (the solution is 280).

How can I distribute $9$ people in $3$ groups of $3$ people? The order of the groups and the order of the people doesn't matter.  I would like to know the procedure to solve it. The solution is $280$.


This is the first time I'm using Ubuntu 19.10. Earlier I was a macOS user and Windows is something that everyone operates. I installed Ubuntu along side Win10 today through a USB stick and although there were some problems regarding the dpkg utility during installation, I seem to have solved it by re-configuring the package manager post install. So far the OS is running smoothly but there seem to be issues regarding the /boot directory. At every boot, I get these warnings:  # Warning 1 Could not scan some of the folders contained in "/boot" Error opening directory '/boot/lost+found': Permission denied   # Warning 2 The volume "boot" has only 9.2 mb disk space remaining.   So I have three questions:   What is the significance of lost+found directory? How do I allow access to this directory? Can I resize the /boot directory through the Disks utility?   Regarding the third question, I followed some of the advice provided at the official documentation and set the size for /boot to ~250 mb but that seems to be a bit smaller than expected. I have tried this:  sudo apt autoremove --purge  Reading package lists... Done Building dependency tree        Reading state information... Done 0 upgraded, 0 newly installed, 0 to remove and 7 not upgraded.   And currently I have these kernels running:  sudo dpkg --list 'linux-image*'  Desired=Unknown/Install/Remove/Purge/Hold | Status=Not/Inst/Conf-files/Unpacked/halF-conf/Half-inst/trig-aWait/Trig-pend |/ Err?=(none)/Reinst-required (Status,Err: uppercase=bad) ||/ Name                                  Version       Architecture Description +++-=====================================-=============-============-=========== un  linux-image                           <none>        <none>       (no descrip ii  linux-image-5.3.0-18-generic          5.3.0-18.19+1 amd64        Signed kern ii  linux-image-5.3.0-19-generic          5.3.0-19.20   amd64        Signed kern ii  linux-image-generic                   5.3.0.19.22   amd64        Generic Lin un  linux-image-unsigned-5.3.0-18-generic <none>        <none>       (no descrip un  linux-image-unsigned-5.3.0-19-generic <none>        <none>       (no descrip   Which actually refer to some recovery kernels as well so I would prefer not to mess with them. Is there a way I could resize or fix the the /boot directory?  EDIT: This is the output while running df -h  Filesystem      Size  Used Avail Use% Mounted on udev            3.8G     0  3.8G   0% /dev tmpfs           785M  1.8M  783M   1% /run /dev/sda9        24G  5.4G   17G  25% / tmpfs           3.9G   58M  3.8G   2% /dev/shm tmpfs           5.0M  4.0K  5.0M   1% /run/lock tmpfs           3.9G     0  3.9G   0% /sys/fs/cgroup /dev/loop0       45M   45M     0 100% /snap/gtk-common-themes/1353 /dev/loop1      4.3M  4.3M     0 100% /snap/gnome-calculator/501 /dev/loop2      1.0M  1.0M     0 100% /snap/gnome-logs/81 /dev/loop4      150M  150M     0 100% /snap/gnome-3-28-1804/71 /dev/loop5       55M   55M     0 100% /snap/core18/1223 /dev/loop6       15M   15M     0 100% /snap/gnome-characters/317 /dev/loop3       90M   90M     0 100% /snap/core/7917 /dev/sda8       215M  190M  8.8M  96% /boot /dev/sda1       256M   33M  224M  13% /boot/efi /dev/loop7       15M   15M     0 100% /snap/gnome-characters/359 /dev/loop8      4.3M  4.3M     0 100% /snap/gnome-calculator/544 tmpfs           785M   32K  784M   1% /run/user/1000 /dev/loop9      157M  157M     0 100% /snap/gnome-3-28-1804/91

please help me here  i am always getting messages saying no free space available in boot partition.    output of ls -alh /boot  total 79M drwxr-xr-x 4 root root 1.0K Sep 7 20:53 . drwxr-xr-x 23 root root 4.0K Sep 5 18:38 .. -rw-r--r-- 1 root root 1.2M May 8 16:14 abi-3.16.0-38-generic -rw-r--r-- 1 root root 1.3M Aug 17 12:10 abi-4.1.6-040106-generic -rw-r--r-- 1 root root 168K May 8 16:14 config-3.16.0-38-generic -rw-r--r-- 1 root root 177K Aug 17 12:10 config-4.1.6-040106-generic drwxr-xr-x 5 root root 1.0K Sep 5 14:23 grub -rw-r--r-- 1 root root 28M Aug 22 22:49 initrd.img-3.16.0-38-generic -rw-r--r-- 1 root root 28M Aug 24 00:35 initrd.img-4.1.6-040106-generic drwx------ 2 root root 12K Aug 12 12:52 lost+found -rw-r--r-- 1 root root 173K Mar 12 2014 memtest86+.bin -rw-r--r-- 1 root root 174K Mar 12 2014 memtest86+.elf -rw-r--r-- 1 root root 175K Mar 12 2014 memtest86+_multiboot.bin -rw------- 1 root root 3.4M May 8 16:14 System.map-3.16.0-38-generic -rw------- 1 root root 3.6M Aug 17 12:10 System.map-4.1.6-040106-generic -rw-r--r-- 1 root root 6.1M Jun 28 01:15 vmlinuz-3.16.0-38-generic -rw------- 1 root root 6.4M Aug 17 12:10 vmlinuz-4.1.6-040106-generic   output of   sudo parted -l  Model: ATA ST9500325AS (scsi) Disk /dev/sda: 500GB Sector size (logical/physical): 512B/512B Partition Table: msdos  Number  Start   End    Size    Type      File system     Flags  1      1049kB  106MB  105MB   primary   ntfs            hidden  2      106MB   140GB  140GB   primary   ntfs            boot  3      140GB   471GB  331GB   primary   ntfs  4      471GB   500GB  29.5GB  extended                  lba  5      471GB   493GB  22.0GB  logical   ext4  6      493GB   499GB  6536MB  logical   linux-swap(v1)  7      499GB   500GB  910MB   logical   ext4   @Pilot6


After reading the wikipedia article about LMDE1 and also being about to refurbish a friend's laptop, I'm still wondering what the exact (major) difference between installing Debian with Cinnamon and installing LMDE would be.   In both cases one would have access to Debian's repositories and some additional Linux Mint packages (through LM's Software Manager). The latter includes proprietary software, artwork and the MintTools (I suppose).  Are there any other substantial differences e.g. with respect to performance, dependencies, proprietary software packages, release cycles... More specific:   LMDE won't be a rolling release any more as of 1/2016 but how would that affect me when using apt-get and the Software Manager alongside each other i.e. would apt-get get me only access to Debian's repositories in both cases? w.r.t. performance - are there different init daemons2? ..   If there are no differences - why is LM promoting it then as something different than Debian + LM desktop environment? Similar to the KDE project promoting a "KDEDE" distribution - which they're not.  DISCLAIMER: It might be that I haven't yet fully grasped what exactly is set up when installing a desktop environment.    1 .. Linux Mint does not seem to provide much information .  2 .. I've read for instance that Ubuntu is using a  compared to Debian resulting in slightly different boot times.

What is the main difference between Debian 7.1 and Linux Mint 15 Debian besides look and Desktop Environment. Basically with a special reference to security stability, and updates if you are going to use the machine as as server.  Themes, colors, desktop environments, ease of use do not have anything to do with the answers.


I'm making my own imageviewer and want to limit to one instance and also be able to tell the instance already running to open the files attempted opened by the new instance.  I found code on this site to limit the program to one instance, but I haven't been able to find a solution for communication.

Using C# and WPF under .NET (rather than  or console), what is the correct way to create an application that can only be run as a single instance?  I know it has something to do with some mythical thing called a mutex, rarely can I find someone that bothers to stop and explain what one of these are.  The code needs to also inform the already-running instance that the user tried to start a second one, and maybe also pass any command-line arguments if any existed.


Given the following class forward declaration in a header file:  template <typename T, std::enable_if_t<std::is_integral_v<T>, int> = 0> class context { public:     context(); // .... private: // ....     T data; }   How can I define the constructor (or any other member function) in the cpp file? Tried everything I can think of but nothing matched....  This other question was brought to my attention  and I have successfully used the methodology suggested in the accepted answer in multiple places in my project, however I can not find a way to represent the second template parameter in any way... that question does not provide enough information to do that. The problem is here the second template parameter makes that either incompatible with the suggested way there or I just could not find the appropriate syntax to represent it, if my class would have just the first parameter it would answer it...   P.S. Sorry if this is a duplicate, I really tried to find a similar question just could not find the appropriate terminology to find a match.

Quote from :     The only portable way of using templates at the moment is to implement them in header files by using inline functions.   Why is this?  (Clarification: header files are not the only portable solution. But they are the most convenient portable solution.)


I have been reading through Dummit and Foote, and they note the following result on page 477:     Corollary.  Let $K/F$ be an extension of the field $F$.  Let $A \in M_{n \times n}(F)$.  Then the rational canonical form for $A$, the minimal polynomial for $A$ and the characteristic polynomial for $A$ are the same whether these objects are computed over $F$ or over $K$.   [Note: I am not asking for a proof of this result.]  Later in this section (p. 487), they present an example where they try to find all similarity classes of matrices $A$ with entries from $\mathbb{Q}$ satisfying $A^6 = I$.  It is noted that the minimal polynomial $m(x)$ must divide $x^6 - 1$, and that the factorization of $x^6 - 1$ over $\mathbb{Q}[x]$ is: \begin{equation*} x^6 - 1 = (x - 1)(x + 1) (x^2 + x + 1)(x^2 - x + 1) \end{equation*} They note that $m(x)$ must be of degree less than or equal to 3 (by Cayley-Hamilton), and then proceed to make a list of possible minimal polynomials under these constraints.  The list they produce is:  (1) $x-1$  (2) $x + 1$  (3) $x^2 + x  +1$  (4) $x^2 - x + 1$  (5) $(x - 1)(x + 1)$  (6) $(x - 1)(x^2 - x  +1)$  (7) $(x - 1)(x^2 + x + 1)$  (8) $(x + 1)(x^2 - x  +1)$  (9) $(x + 1)(x^2 + x + 1)$  However, I was thinking about the corollary when I was reading this example.  If I am interpreting this corollary correctly, there should also only be 9 options for the minimal polynomial if we think of $A$ being in $M_{n \times n}(\mathbb{C})$.  But in $\mathbb{C}[x]$, the factorization of $x^6 - 1$ is \begin{equation*} x^6 - 1 = (x-1)(x+1)(x- \zeta_3)(x - \zeta_3^2)(x - \zeta_6)(x - \zeta_6^5) \end{equation*} where $\zeta_3 = e^{2\pi i(\frac{1}{3})}$ and $\zeta_6 = e^{2 \pi i(\frac{1}{6})}$.  From this factorization, it would seem that the polynomial \begin{equation*} (x - 1)(x - \zeta_3) \end{equation*} could be one option for the minimal polynomial.       But this polynomial does not appear in (1) - (9).  Doesn't the above corollary state that it should be there?

I saw it's been answered before but I could not understand the answers as it delved into material that I did not study yet.  My question is as follows:  Suppose $p \in F[x]$ is the minimal polynomial of some matrix $A \in M_n(F)$ and $F \subseteq K$  I need to show that $p$ is also the minimal polynomial of $A$ over the field $K$. In other words: Show that the minimal polynomial remains the same when we move to a bigger field.  What I thought of:  Obviously $p$ is irreducible in $F$, suppose it is reducible in $K$, which means there are $q,t \in K, q,t \notin F$ such that $p=qt$, now we just need to show that $q(A) \neq 0$ and $t(A) \neq 0$...But why is that so?  Edit: Another way of presenting this question is "Show that if $p$ is the minimal polynomial of $A$ over the field $K$ while the entries of$~A$ are contained in a subfield $F \subseteq K$, then all the coefficients of $p$ are elements of $F$".


In the review queue, I saw  that is not in English     Si estás intentando conectarte a una base de datos Oracle a través de un WCF, reinicia el IIS , para esto, abrir el cmd y ejecutar la sentencia iisreset.   Using , the answer in English is     If you are trying to connect to an Oracle database through a WCF restart the IIS for this, open the cmd and run the iisreset judgment.   This answer might be useful for the OP an other users so what should I do with it.  Should I edit the answer and change to English or leave it?  Update : I already flagged the answer. Is that enough?

When reviewing suggested edits, I ran across . It took a post originally in French and Google Translated it to English. I approved it, as it gave the post a chance to survive, and it properly attributed that the post had been translated. It appears that two others did the same.  But should have I? It probably falls under a 'radical change', right?


Suppose, I have two boxes. A host is telling me to pick one. I see the money inside of this one - say 100 \$. Now, I need to decide if I want to swap, given the information that the other box has twice less or more money - say 50\$ or 200\$. Thereofre, expected value of the second box is clearly 125 \$. Question 1: Does this apply that I need to always swap? Question 2: If I repeat the experiment 1000 times, where the money inside of the boxes is some random $N>0$, does it matter if I swap? Does it have to do something with the law of large numbers?

I was thinking of this problem.  I believe the solution and I think I understand it, but if I take the following approach I'm completely confused. Problem 1:  I will offer you the following game. You pay me \$10 and I will flip a fair coin. Heads I give you \$5 and Tails I give you \$20. The expectation is \$12.5 so you will always play the game.  Problem 2:  I will give you an envelope with \$10, the envelope is open and you can check. I then show you another envelope, closed this time and tell you: This envelope either has \$5 or $20 in it with equal probability. Do you want to swap? I feel this is exactly the same as problem 1, you forgo \$10 for a \$5 or a \$20, so again you will always switch.  Problem 3:  I do the same as above but close the envelopes. So you don't know there are $10 but some amount X. I tell you the other envelope has double or half. Now if you follow the same logic you want  to switch. This is the envelope paradox.  What changed when I closed the envelope?? EDIT: Some have argued that problem 3 is not the envelope problem and I'm going to try and provide below why I think it is by analysing how each views the game. Also, it gives a better set up for the game. Providing some clarification for Problem 3: From the perspective of the person organising the game:  I hold 2 envelopes. In one I put \$10 close it and give it to the player. I then tell him, I have one more envelope that has either double or half the amount of the envelope I just gave you. Do you want to switch? I then proceed to flip a fair coin and Heads I put \$5 in and Tails I put \$20. And hand him the envelope. I then ask him. The envelope you just gave me has twice or half the amount of the envelope you are holding. Do you want to switch?  From the perspective of the player:  I am given an envelope and told there is another envelope that has double or half the amount with equal probability. Do I want to switch. I think sure I have $X$, hence $\frac{1}{2}(\frac{1}{2}X + 2X) > X$ so I want to switch. I get the envelope and all of a sudden I am facing the exact same situation. I want to switch again as the other envelope has either double or half the amount.


I am running this on Linux:  $ number=4 $ test $number -eq 4 $ echo $? 0 $ test $number -lt 2 $ echo $? 1   Are the results (0 and 1) true ?

Is there a way I can do what stated in the title from the terminal commands, or will I have to look into the codes?


My tags are follows:  \documentclass{book} \usepackage{amsmath,amssymb}  \begin{document}  $\boldsymbol{\subsetneq}$  \end{document}   I got the symbol in roman only but I need in bold face, any suggestions...

To make Latin-letter variables bold I can use e.g. \mathbf{a}, but while putting Greek letters or symbols such as \nabla inside \mathbf doesn't cause any errors or warnings, it also doesn't do anything else.  What is the best way to make bold math symbols, in particular Greek letters and \nabla?


From nosklo's answer in  what is the return line doing:  def chunker(seq, size):     return (seq[pos:pos + size] for pos in range(0, len(seq), size))   I understand what the output will be, I'd just like to know how this works.  EDIT: Adding use case to hopefully clear up confusion.  I am using the defined function to read in a list of unknown size and grab 8 objects from it, run those 8 through something, and then grab the next 8 and so forth until the list is completed. Use case from nosklo's post:  animals = ['cat', 'dog', 'rabbit', 'duck', 'bird', 'cow', 'gnu', 'fish']  for group in chunker(animals, 3):     print group # ['cat', 'dog', 'rabbit'] # ['duck', 'bird', 'cow'] # ['gnu', 'fish']

I need a good explanation (references are a plus) on Python's slice notation.   To me, this notation needs a bit of picking up.   It looks extremely powerful, but I haven't quite got my head around it.


Is there a way to check the visibility of a label in QGIS by feature?   Could the pyqgis library help?  I need to search for points where no label is shown:

Is there a chance to define a QGIS style rule to just show point markers when their label is shown?   My aim is to exclude all points which are not labeled because of collision between labels.  Example:


Is there a way to change the length of the displayed cyrve normal arrows when working with the Bezier curve? I'm using metric for my scene and I'm doing a small cable and this "centipede legs" are just disturbing. Is there a way to change the length?

In this example I use Nurbs curves to create shoe laces and it becomes quite hard to operate curves in the regions of loops and knots because of the curves' tilt/scale guides (not sure how to call them). I would really like to hide these guides when I edit curves. Is it possible?


Does nature have more than four spacetime dimensions?  If so, what is their size?  Are dimensions a fundamental property of the universe or an emergent result of other physical laws?  Can we experimentally observe evidence of higher spatial dimensions?

As human beings, we observe the world in which we live in three dimensions. However, it is certainly theoretically possible that more dimensions exist.  Is there any direct or indirect evidence supporting a fourth dimension?


Is there a way to give domain based accounts local admin access on specific machines and not others?  I can control access and rights to which machines a user can log in to and what their privileges are on a global scale but is there a way to control them on individual machines?  What we have now is an Active Directory group called Sec.LocalAdmin, we deployed this group 'Restricted Groups'. So every user that is a member of this group is local admin on every machine where this group is added to the Local Admin group. What we want is that every user is local admin on their own machine, is it possible to do this by a GPO?

In our AD 2003 domain each user gets local admin permissions on their computer.  Everyone else can login with their domain account as normal user.  Right now this means going to the desktop and manually adding the user as a local administrator.  Is there any way to automate this process through logon scripts or GPOs?  I have found ways to use a gpo to make everyone who logs in to a computer a local admin, but really only want to give it to the primary user (or in some cases users) of the computer.  I've also seen methods that required adding a group for each computer...but really dont want to clutter AD like that.  I do have a list mapping each user to each computer name.  If it matters the desktops are a mix of xp and win7.


I understand that under central limit theorem, when certain conditions are met, the distribution of sample mean follows:  Normal distribution Mean: population mean SE: population std / square root of sample size  So 95% of the observed sample means will be  within 1.96 SE of the  actual population mean (When z-statistics is used). But how does it leads to: There is 95% chance that the actual population mean is  within 1.96 SE (The range of confidence interval) of the observed sample mean? How does this statement holds true when the position of population mean and sample mean is exchanged?

It seems that through various related questions here, there is consensus that the "95%" part of what we call a "95% confidence interval" refers to the fact that if we were to exactly replicate our sampling and CI-computation procedures  many times, 95% of thusly computed CIs would contain the population mean. It also seems to be the consensus that this definition does not permit one to conclude from a single 95%CI that there is a 95% chance that the mean falls somewhere within the CI. However, I don't understand how the former doesn't imply the latter insofar as, having imagined many CIs 95% of which contain the population mean, shouldn't our uncertainty (with regards to whether our actually-computed CI contains the population mean or not) force us to use the base-rate of the imagined cases (95%) as our estimate of the probability that our actual case contains the CI?   I've seen posts argue along the lines of "the actually-computed CI either contains the population mean or it doesn't, so its probability is either 1 or 0", but this seems to imply a strange definition of probability that is dependent on unknown states (i.e. a friend flips fair coin, hides the result, and I am disallowed from saying there is a 50% chance that it's heads).  Surely I'm wrong, but I don't see where my logic has gone awry...


In a server, with Debian 10 and Samba 4.9, there are 2 HDs with this mount points:  /hd1 /hd2   In /hd1 there is a folder that is Samba shared.  /hd1/share   Inside the share I decide to move a folder to /hd2  /hd2/afolder   and create a symlink to it  ln -s /hd2/bigfolder /hd1/share/bigfolder   At server  ls /hd1/share/bigfolder   shows  file1 file2   Accessing the share from a client (Ubuntu 18.04)  smb://server/share/bigfolder   it seams like an empty folder.  I need to see and work in the files (file1 and file2)

This is Ubuntu server 10.04 64 and samba 3.4.7.  I have a shared directory /home/mit/share and another one /home/temp that I link into the shared one:  ln -s /home/temp /home/mit/share/temp   But on windows, after using internet, I cannot open S:/temp, but on Linux it is possible to access /home/mit/share/temp like expected.   This works if I link directories inside /home/mit/share/temp, so I guess samba is restricting to jump with a link outside/above the shared directory.   EDIT:  See also this question titled .  It seems best to put unix extensions = no into the global section and follow symlinks = yes and wide links = yes only into the shares section, where you really need it.  The unix extension flag has to live in the global section and not in the individual shares sections. But for security reasons it is better to use the other options only where you need it, and not globally.


A secretary writes letters to 8 different people and addresses 8 envelopes with the people's addresses. He randomly puts the letters in the envelopes. What is the probability that he gets exactly 6 letters in the correct envelopes?  I made a start by finding the total outcomes, and then subtracting the probability that he got two letters wrong, but then hit a dead end.   Could someone please give me a solution to this problem, or maybe a hint?  Thanks.

What are the total number of ways to arrange $N$ objects such that first $K$ are deranged? That is, how many permutations of $N$ objects do not fix the first $K$?  I know the general formula for the derangement of $N$ objects. Is there any way the above problem be reduced to this one?


I'm pretty sure that when I posted , the question was very different and fairly recent, which makes me suspect a .  However, I just got  for that answer.  Is the Necromancer badge supposed to be given when an answer "with score of 5 or more"  gets merged from a recent question to a question that is "more than 60 days" old?

The system awarded me Necromancer, attributing it to the fresh printed new question instead of the older decrepit master question it was merged into.  I earned the "Necromancer" badge because I "Answered a question more than 60 days later with a score of 5 or more."  I did not actually answer a question more than 60 days after it was asked. I just won the badge because the question had been merged with a previous one.   Shouldn't the system have this premise in consideration and not award badges like that?


How do I capture the output of the strings command into a .txt file from the command line?

I have a command that I run in a folder that outputs MD5 hashes and filenames on the terminal:  ls |sort -nr | xargs md5sum   I need this output in a text file that I can download and compare to another folder on another customer's machine. How can I modify the command such that its output is stored in a file in say /tmp? I'm using Redhat 5.


I'm sure we'd all rather I became a bit more self-sufficient.   Using became feels right, but I would appreciate anyone who could explain what's going on grammatically here. I think become is in the subjunctive, so maybe most correctly I should say     I'm sure we'd all rather that I become a bit more self-sufficient.   Is that strictly necessary? And regarding my original construction: am I wrong to feel so right?

What is the difference between:   The company would rather each employee be provided with ID card.  The company would rather each employee were provided with ID card.


I want to reset my phone. I want to preserve some apps state across the reset. I don't want to use third party software. Which folders do I have to copy?

Could you list all possible directories where Android apps may store data, providing description what kind of data are stored in each directory?


I'm trying to transfer all my files over from my laptop, which is slow and laggy, to my newer desktop, which is nice and fast. I want to be able to play Skyrim on it. I've been looking into how to transfer the game over to it, but all the answers I find are how to move the save files and access them after, etc. That's good, but my current question is how to get the game on my new computer? I saw one reply to someone that you have to install it. Ok, that makes sense. But do I have to pay for a whole new version of Skyrim? Or how would I just install the one I already bought a couple years ago? I don't have it on Steam, though I'm not sure why since I thought I remembered buying it on there. A little confused about that cause I have Skyrim Script Extender on there. Is this what I'm looking for?  The desktop is running Ubuntu, I've installed WINE already, and I'm not sure if I need to get anything else. My laptop is running Windows 10 and it's messed up so I can't use it, but I refuse to lose my Skyrim saves!  Not moving it to a different folder within the computer, but moving it from an entirely different computer using an entirely different OS.

How can I tell Steam to put games on another disk?  They are currently on C: but I'm getting a little short on space.


A few questions on $\mathrm{Aut}(G)$ when $G$ is finite.  1) $\mathrm{Aut}(G)$ is not cyclic when $G$ is not abelian  I proved this by showing the contra-positive, that if $\mathrm{Aut}(G)$ is cyclic then $G$ is abelian. I'm trying to show it directly now.  Since $G$ is not abelian, there exists a nontrivial inner automorphism of finite order. This inner autmorphism will generate a cyclic subgroup of $\mathrm{Inn}(G) \leq \mathrm{Aut}(G)$ If I can show that $\mathrm{Inn}(G)$ is a proper subgroup of $\mathrm{Aut}(G)$ I will be done.  2) $\mathrm{Aut}(G)$ is never cyclic of odd order $> 1$  I need help with this one.  Thanks!

In Rotman's introduction to the theory of groups, there is an exercise (7.9) where one has to prove that the following facts for a finite group $G$.    If $G$ is abelian and $|G|>2$ then $\text{Aut}(G)$ has even order $\text{Aut}(G)$ is not cyclic when $G$ is not abelian $\text{Aut}(G)$ is never cyclic of odd order >1.    This is all fairly easy, but I was wondering if there even exists a group $G$ with $|G|>2$ which has automorphism group of odd order. Anyone has an example or reference (couldn't find it by simple internet search)?  Clearly $G$ can't be abelian, symmetric, alternating, dihedral, ... so the most obvious counterexamples don't work.  Thanks in advance!


I have two sqlite tables:  user:  ID  city --  ---- 1   ankara 2   istanbul 3   ankara   action  userID  isFree ------  ------   and a query like this:  INSERT INTO action (userID, isFree)  VALUES ( (SELECT ID FROM user WHERE city = 'ankara'), true);    This query inserts just the first user to the action table, but I want to insert first and third users into the action table.  Are there any way to do this in a single query?

I am trying to INSERT INTO a table using the input from another table. Although this is entirely feasible for many database engines, I always seem to struggle to remember the correct syntax for the SQL engine of the day (, , , , and ).  Is there a silver-bullet syntax coming from an SQL standard (for example, ) that would allow me to insert the values without worrying about the underlying database?


I use a banking app in my Android 8.1.0. All receipts are saved in /storage/emulated/0/APPNAME.  I can see the APPNAME folder and the receipts on Android if I use an explorer app like Google Files. But if I connect my Android on PC, the folder doesn't show up. I can see the other folders with no problem. Only that specific folder is missing.  What's going on?  (I suspect the devs marked the folder as not accessible through PC)

I have LG L5 (e610 model) device with Cyanogenmod 10. When I connect the phone to a computer with Linux (I have mtpfs installed), I can see both internal storage and the SD card.  However when I navigate inside them, I can't see some of the files.  For example, if I open file manager app on the phone, I can see several files in the Internal storage/Notifications directory, however the directory on the computer only shows one of those files.  If I switch USB connection type to PTP (camera) - as OS X doesn't support MTP natively - Image Capture sees the phone as a camera, however it can only see about a third of all the images present on the phone.  I don't have a Windows machine to try, but I suspect the results would be similar.  I tried upgrading Cyanogenmod to the latest nightly, clearing and reinstalling it - same results.  Any idea as to what is going on?  How can I make all files appear on the host computer?


I am using Stack Overflow from past couple of years but from few month I noticed a issue like when someone give +1 in my question I got 9 points and my score increase by +9 points. Let us suppose right-now I have 101 points and someone give +1 to my question its increase by +9 point while it should increase by +5 and when I will refresh the page it subtract 4 points. Is this bug in point calculation or only I am getting this issue. Same issue when I got point to edit question or accept answer.

Whenever I gain reputation, I get 4 additional reputation. See this picture:      This picture is captured when I gained reputation by +5 (for upvote on my question.). Before I gain +5 reputation, my reputation was 2,211. And after I gained +5 reputation, my reputation became 2,220 (as shown in the above picture). But when I refresh my page the real reputation is shown like this:     So the problem is minor. But why do this happen? I suspect this issue might be related with .  EDIT: I do not face this issue in the case of downvotes.


I have this mysql query in php:  $sql2 = "SELECT id, nazev, poradi FROM system WHERE id IN($idIs) ORDER BY poradi"; $result2 = mysqli_query($conn, $sql2);   The variable $idIs is a string '2,3' (two ids of system). When I try to fill array $nazevSystemu, there are two values (beacause of the two ids from $idIs)  $i = 0; $nazevSystemu = []; while($row2 = mysqli_fetch_assoc($result2)) {   $nazevSystemu[$i] = $row2['nazev'];   echo $row2['nazev'];   $i++; }   Result of echo $row2['nazev'];: Value1Value2  I want to make it safe, avert SQl inj., so I use prepared statement like this (instead of the first two rows of code on this page):  $stmt2 = $conn->prepare("SELECT id, nazev, poradi FROM system WHERE id IN(?) ORDER BY poradi"); $stmt2->bind_param("s", $idIs); $stmt2->execute(); $result2 = $stmt2->get_result();   But now I get only this as result of echo $row2['nazev']; - just one value: Value1  What did I do wrong in prepared statement?

I have an array full of random content item ids. I need to run a mysql query (id in the array goes in the WHERE clause), using each ID that's in the array, in the order that they appear in the said array. How would I do this?   This will be an UPDATE query, for each individual ID in the array.


There's also an answer here:      I have a big dispute with an electrician if the oven he supposedly fixed works or not. Problem is I think it reaches only about 150 C (300F) degrees when it indicates it has reached 250 C. So at 250 C (480F), I'm still able to hold my hand in the middle of the oven for 1 minute, or probably more.    When you cook next time, may you please try to see if this is possible at such temperature?  I will try to get hand of a thermometer, but have nothing now, so would appreciate someone testing it.   Rephrased: Is it possible to hold a hand in the oven at 250C for 1 minute, or is it too hot?

I suspect that my - fairly new - oven gets too hot, so I bought an oven thermometer, which confirmed this.  So I called the supplier.  They say that in order to obtain the correct actual  oven temperature, for any setting, you take the highest reading on the thermometer, and the lowest, and then divide both readings.   Is this correct?


I am trying to show that that the the cantor set is homeomorphic to cantor space and here is the function defined from $C$ cantor set to $\mathcal{C}$ Cantor space, let $a_{n}$ be $0$ or $2$ And for all $x\in C$, $x=\sum_{i=1}^{\infty}\frac{a_{n}}{3^{n}}$, the function $f(x)=(\frac{a_{1}}{2},\frac{a_{2}}{2},...)$ it is easy to check that $f$ is bijective, but How can I show that $f$ is continuous ? If I can show that’s $f$ is continuos, $f^{-1}$ is easily continuos because the function is Fromm compact space to Hausdorff space. Any help about the continuity will be greatly appreciated

I've been trying to find a homeomorphism $$\Phi:\prod_{i=1}^\infty X_i \to \{ 0, 1\}^\mathbb{N},$$ where each $X_i$ is a finite set with at least two elements, but have been unable to.  Things I've tried have generally not been surjective, as it is fairly easy to come up with an injective map between the spaces that may or may not be continuous.  For example, if each $X_i$ has cardinality $n_i$, we could determine the first $n_1$ terms of a sequence in the Cantor space by putting $1$ in the index of the value of the element of $X_1$ that is the first coordinate of a sequence $\prod X_i$.  This map would be continuous, since a cylinder set in the Cantor space would have an inverse image that is a cylinder set, but it is not surjective.  Any help would be appreciated!


I've a basic (and maybe obvious even if I don't see it) question on the decomposition of a vector in physics.  An example of situation I'm confused about is the inclined plane with an object on it. There is only the weight force acting on it. Weight is vertical but it is usually decomposed in parallel and normal components to the inclined plane.  Referring to the first picture (on the left) the blue vector is wheight and the red ones are its decomposition. My question is about what I did in the second picture on the right. There I considered only one of the components of weight (the red normal one) and I decomposed it in vertical and orizontal components (the green ones). The question is: does this make any kind of sense or is it a total absurdity?    It seems impossible to me for a vertical vector to end up to have an horizontal component, perpendicular to it. Nevertheless in some situations I ended up with this doubt, that I cannot solve by myself.  Am I missing something important here?

Suppose there's a force $F$ of magnitude 10 newtons in the direction of positive y-axis acting on a particle A. I know that the particle would not experience any force in the positive x-direction because,  component of force $F$ in the positive x-direction $=|F|cos90°=0$.   But if we first take the component of $F$ at an angle of 45° to the positive y-axis, it is,   $|F|cos45°=\frac{10}{\sqrt2}\text N$.   If we now consider this a vector (can we? that is the main question), we can find its component in the positive x-direction (it makes an angle of 45° with the positive x-axis) ,   $\frac{10}{\sqrt2}\times cos45°=5\text N$. According to this result, the particle should experience a force of 5 newtons in the positive x-direction, which is impossible. I want to know what all is wrong in the above reasoning. Thanks!


So far I know of two strategies.   Pick carries, beat him to death with damage items. Pick people with burst damage (Lion, Lina) and use an etheral blade and lots of maxed out Dagons   Does anyone know which is better?  Or if there's a different better one?  Note: Better can be defined as doing more damage per second, thus killing him faster (therefor this isn't a subjective question)  EDIT:  After searching some more I noticed  but I'm hoping for a more exact answer with some numbers backing it up (I know it's lots of work, but maybe I'll be the one to do it and post it)

Toward the end of "Diretide" games of Dota 2, both teams have to call a truce to battle Roshan, who is massively more powerful than in normal games, and is invincible-merely leveling up, on death.  What combination of heroes, items and abilities should me and my team use to kill Roshan as many times as possible before the timer expires?


Let $X_1,X_2,...,X_3$ follows iid Negative Exponential distribution with pdf $$ f(x)= \frac{1}{\sigma} e^{-\frac{(x-\mu)}{\sigma}} \: \: I_{(x>\mu)} $$where $\mu$ and $\sigma$ are both unknown. I have to find the MLE for $\mu$ and $\sigma$. I have found the MLE for $\sigma$ which is $\frac{\sum_{i=1}^{n} (X_i - \mu)}{n}$. But since for $\mu$ I don't get a function of X while derivating the Log-Likelihood function and equating it at zero, I can't find the MLE for $\mu$. The likelihood function is given by $$ L= \frac{1}{\sigma^n}\: e^{-\left\{\frac{\sum_{i=1}^{n}(x_i-\mu)}{\sigma}\right\}} \: \prod_{i=1}^{n}I_{(x_i>\mu)} $$ And the log-likelihood function is $$ l= -n \:log\sigma -\frac{\sum_{i=1}^{n}(x_i-\mu)}{\sigma} $$ By derivating it with respect to $\mu$ and equating at zero I get, $$ -\frac{n}{\sigma}=0 $$ Please help me to find the MLE for $\mu$.

Consider a random sample $X_1, X_2, \dots, X_n$ from the shifted exponential PDF $$f(x; \lambda, \theta) = \begin{cases}\lambda e^{-\lambda(x-\theta)} ;& x \geq \theta\\                     \theta ; &\text{Otherwise}\end{cases}$$ Taking $\theta = 0$ gives the pdf of the exponential distribution considered previously (with positive density to the right of zero). a. Obtain the maximum likelihood estimators of $\theta$ and $\lambda$. I followed the basic rules for the MLE and came up with: $$\lambda = \frac{n}{\sum_{i=1}^n(x_i - \theta)}$$ Should I take $\theta$ out and write it as $-n\theta$ and find $\theta$ in terms of $\lambda$?


Let $f \in \mathcal{C}[a,b]$. Assume that $\min_{x \in [a,b]} f(x)=m>0$ and let $M=\max_{ x \in [a,b]}f(x)$. Which of the following inequalities are true? $(A)$ $\frac{1}{M} \int\limits_a^b f(x) \ dx + m \int\limits_a^b \frac{1}{f(x)} \ dx \geq 2 \sqrt{\frac{m}{M}}(b-a)$ $(B)$ $\int\limits_a^b f(x) \ dx \int\limits_a^b \frac{1}{f(x)} \ dx \geq (b-a)^2$ $(C)$ $ \int\limits_a^b f(x) \ dx \int\limits_a^b \frac{1}{f(x)} \ dx \leq (b-a)^2$  So according to answer at the back $A \& B$ are the correct options. $B$ is clear to me you replace $f$ and $1/f$ on the $LHS$ by its appropriate bounds to attain the inequality. I am not sure how to attack $A$. Any help?

Let $f\in C[a,b]$. Assume that $\min_{[a,b]}f=m>0$ and $M=\max_{[a,b]}f$. Which one is true?  a. $$\frac{1}{M}\int_a^bf(x)dx+m\int_a^b\frac{1}{f(x)}dx\geq 2\sqrt{\frac{m}{M}}(b-a)$$  b. $$\int_a^bf(x)dx\int\frac{1}{f(x)}dx\geq (b-a)^2$$  c. $$\int f(x)dx\int_a^b\frac{1}{f(x)}dx\leq (b-a)^2$$  For the first one  $$\frac{1}{M}\int _a^bf(x)+m\int _a^b\frac{1}{f(x)}dx\geq {\frac{m}{M}}(b-a)+{\frac{m}{M}}(b-a)$$  and the last two I am not getting. How to find these?


How to Install  from the terminal in Ubuntu 16.04?

I wish to develop some games on Unity 3D game engine. I was unable to find the link to download the application. Can someone post the download link for Unity 3D game engine for Ubuntu and/or explain how to install it?


So I finished making the bottle, and added a simple red liquid to it. On the render preview, it looked great, but when I hit actual render, it became weird like this:   If I add smooth shading then it looks like this:   How do I fix the reflections and the little stripes around the liquid? I rendered it in these settings: Samples: 300 render, 300 preview...Resolution: 800x800px (80%)

Im rendering varous objects with a Sharp glossy effect but the reflections are quad dependent on the object (image below), meaning they behave separately within every quad making it look 8bit-like. Can anyone tell me why this happens?. (Im pretty sure subdividing would fix it but I want to know why I cant have a low poly object reflecting normaly.  The object has 2 modifiers: Subdiv Surface and Solidify. (Perhaps the Subdiv is causing it?). Help me you Blender savys I dont have a powerful CPU to test and test within every render would take me hours and hours.  Image:


Problem  How many trailing zeroes are there in $52!$ ?  My thoughts  I believe I correctly solved it, but I'm not happy with the scalability of my method.  I figure the number of trailing zeroes is equal to the number of times $52!$ is divisible by 10. I wrote out every integer from 1-52 that is divisible by 2 or 5. The idea being that the number of 2 AND 5-factors equals the number of 10-factors.  I quickly noted that the number of 2-factors is greater than the number of 5-factors, so I figured finding the number of 5-factors will do. There were 12.  I'm not very happy with this, because if they now ask me to do the same for $152!$, I'll have to tell them to shove it. I'm not doing this again.  Question  Is there a better way to do this? Perhaps a method that scales better?

Possible Duplicate:          I know that I have to find the number of factors of $5$'s, $25$'s, $125$'s etc. in order to do this. But how can you derive such a formula for any number $n$?


Where does the $6.24 \times 10^{18}$ number come from? How was it historically derived?  I know that $1$ C $=$ $1$ A s but that just pushes the question down another step, and another and another, at some point where do these numbers actually originate and bubble up from?

On  it says:      This force is used in the formal definition of the ampere, which states that it is "the constant current that will produce an attractive force of $2 × 10^{-7}$ newton per metre of length between two straight, parallel conductors of infinite length and negligible circular cross section placed one metre apart in a vacuum."   In reference to the definition of an Ampere, why was $2 × 10^{–7}$ chosen?


i want to open whats app in browser . but i have to scan the QR code produced in the browser through camera.  is there any way to get my whats in browser.  problem is my camera is not working it is not even opening .so i cant scan it . is there any way to open it?  which tells how QR code works.  how do i permit whats app in browser?

My camera doesn't work. I already tried downloading different camera applications but none of them worked. Problem is physical not software-related. How can I login to Whatsapp Web without scanning the QR code?