I have to prove the following statement, but I can't. If $\limsup x_{ n }=\, x,\lim y_{ n }=\, y, \, x_{ n },y_{ n }>0$, then $\limsup (x_{n}y_{n})=xy$.  Will you give me some hint or solution?

Suppose lim sup $a_n$ is finite, and $c_n \to c$  Prove that if $c \geq 0$ lim sup $a_n c_n$ = c lim sum $a_n$  and find a counterexample to this if $c <0$.  Is there a rule that the product of lim sups is equal to the lim sup of the product? Also, what counterexample will work here?


what is the greatest integer that divides $p^4-1$ for every prime number p greater than 5(this is a gre subject math problem)  I think that $p^4-1=(p^2+1)(p-1)(p+1)$,so  8 must divide all the $p^4-1$ for p>5,then I am stuck in how to continue analyze the question. can someone tell me how to find that greatest integer?  the choice is (A)12   (B)30   (c) 48   (d)120   (E) 240

What is the greatest integer that divides $p^4-1$ for every prime number $p > 5$?  This was on a practice math GRE so it's probably really easy.


Recently I have buffer issue for my SSIS package. When i started to monitor metrics in perfmon i noticed the PLE is nearly 500000. Is it ok to have this huge PLE.

I've read several articles about SQL Server's Page Life Expectancy and what it means and what kind of information you can glean from it. In most of these articles that I've read, a common, healthy PLE value is somewhere around 1000-2000 seconds. I've read that getting down to around 300 seconds can mean you're likely low on RAM.  I recently just upgraded our hardware to have 64GB of RAM, up from 14GB. On the 14GB my PLE was around 300 seconds, and I was having a lot of 5-6 memory grants pending per second. So, that was bad and I increased the RAM. Now, my PLE is much, much higher around 5000 seconds, and no more pending memory grants. I've seen it 7000 seconds, if I recall. This is much higher than anything I've read.  Can a high PLE be a bad thing? Or is it the higher the better?  EDIT: I'm sorry, my PLE wasn't 7000 seconds, it was 70,000 seconds! Although, at the moment it is down to around 7000.     The database size is around 160GB. A few tables have 5+ million rows. max_server_memory is set to 2147483647.


Consider the algebra $C(X)$ of continuous complex functions over a compact space $X$. On what conditions this algebra is separable?   What if $X$ is a compact subset of $\mathbb{R}^n$?

$X$ is a compact metric space, $C(X)$ is separable when $X$  is compact where $C(X)$ denotes the space of continuous functions on $X$. How to prove it?  And if $X$ is just a compact Hausdorff space, then $C(X)$ is still separable? Or if $X$ is just a compact (not necessarily Hausdorff) space, then $C(X)$ is still separable?  Please help me. Thanks in advance.


I have a Lenovo+Ryzen-4500 laptop running 20.04 that needs a later Kernel for external monitors. I installed 5.8.0 some weeks back and it has been working fine for me. I just read about an FBI report on a rogue Kernel thing and thought I'd update the kernel. Kernel 5.8.3 is now available and I have downloaded all 4 .deb files from here  But cannot figure out how to use the SHA256 checksum on the .deb files. That link gives a checksum for a single file/bundle and not the .deb ones. Could someone please give me some steps on achieving this verification before installing this update for the current 5.8.0.

I want to test a new kernel for my ubuntu. I want the most recent stable kernel available. How can I do it securely? That is, no http downloads.


I asked about this in  but dead silent. So how can I align an equation without getting the equation index number?

I am trying to have a multiline equation without any numbering, even not in the last one.  \begin{align} a = x \nonumber \\ b = y \end{align}   However, this is producing a line number in the last line, which would like not to happen.  I have also tried the equation and equation* environments with no luck.  Thanks.  P.S. What' the markup for rendering LaTeX code. Can't seem to be able to find it in the help page?


I'm using Ubuntu 14.04 LTS. Is there any simple way to install newer version of package from newer version repository?  I tried this:   But this method seems to be able make mess in system when used wrong and it doesn’t work for me.  PS: It's this package

I need these packages with the latest upstream version backported for ubuntu/natty   libccid_1.4.5-0ubuntu1_amd64.deb libpcsclite1_1.8.1-0ubuntu1_amd64.deb libpcsclite-dev_1.8.1-0ubuntu1_amd64.deb libusb-1.0-0_1.0.9-0ubuntu1_amd64.deb libusb-1.0-0-dev_1.0.9-0ubuntu1_amd64.deb opensc_0.12.2-1ubuntu1ppa1~natty1_amd64.deb pcscd_1.8.1-0ubuntu1_amd64.deb pcsc-tools_1.4.18-0ubuntu1_amd64.deb   I tried to build them from source with update but it failed. I am not an expert at packaging and there are so many tutorials and recipes out there.  Do you know a good and up to date tutorial for backporting Ubuntu packages?  How do I get packages from other releases without having to build them myself?


I have an ubuntu server which I need to run a lot of commands after the system loaded, for example, I have to run the following commands:  cd /opt/tomcat/bin ./catalina.sh run  cd /.../app node index.js  cd ../another_app node start.js   And I want terminal window opened for some of the commands, for example, I would like to see the logs of the application.  Is this possible in Ubuntu 12.04?

How can I run scripts automatically when Ubuntu starts up so I don't have to run them manually after startup?


I have an code which read from mysql and if I use special characters i get back this �, I am using UTF-8 on PHP file and on MYSQL. If I change PHP file to UTF-8 wihtout BOM it shows me but it wont show special characters from html in this PHP.  This is a problem which has to be solved and i tryed many solutions none wont work. (I'm using mysqli)  $sql1 = " SELECT * FROM news ORDER BY id DESC ";  if ($result1 = $mysqli->query($sql1)) { while($row = mysqli_fetch_array($result1)) { echo "
 {$row['name']}
"; echo "{$row['text']}
"; echo " {$row['date']}
"; }   }

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


I have large buffer allocated and then split into chunks of multiple sizes. Those sizes start with 32 and then multiplying that by 2 with each increase.  struct Node {     Node*           Next;     void*           Data;     const unsigned  Size; };  Node* m_Buffers[16];   Which means that the buffers at m_Buffers[0] will be of size 32 and the buffers at m_Buffers[1] will be of size 64 and so on.  And a function that takes a number and returns a buffer of the size that the specified number can round up to.  void * GetBuffer(unsigned size) {     // ... }   For example, if I request a a buffer of 384 then I need to be able to round that at 512 and return a buffer from m_Buffers[4].  So far I'm using a loop to round up:  void * GetBuffer(unsigned size) {     unsigned buffer_size = 32;      while (buffer_size < size)     {         buffer_size *= 2;     }      // ... }   But I'm curious if there's a better way of rounding up that doesn't involve a loop. And also if there's a way to convert the rounded number to an index in the array without using a switch statement.  And to be honest, I'm not even sure the title is correct. So I apologize for that.

I want to write a function that returns the nearest next power of 2 number. For example if my input is 789, the output should be 1024. Is there any way of achieving this without using any loops but just using some bitwise operators?


I'm having a hard time figuring out how to model a database with a Many-to-Many relationship between a concept of Markets & regions of the world.  The issue I'm running into is that a Market is just a region for doing business. It could be North America, and include multiple cities, provinces, and countries, or it could be the city of Ottawa, Ontario, Canada. Meaning, a Market can contain many regions, or regions can contain many Markets.  I've seen some structures for this concept with a separation between a Global Market which would be ones that include more than one country, and a Regional Market which would be only within one country. But this is treating them as two different entities when, by nature, they're the same.  Is there a standard model for structuring data that could efficiently convey the parent in the relationship? To easily be able to say The North American Market contains these countries, which would enable deriving provinces & cities, but also say The USA contains these Markets or Texas contains these Markets.

I’m having some trouble in recreating a database with a one-to-many (1:M) relationship between Users and Items. This is pretty straightforward, yes; however, each Item belongs to a certain Category (e.g., a Car, a Boat or a Plane), and each Category has a particular number of attributes, e.g.: Car structure: +----+--------------+--------------+ | PK | Attribute #1 | Attribute #2 | +----+--------------+--------------+  Boat structure: +----+--------------+--------------+--------------+ | PK | Attribute #1 | Attribute #2 | Attribute #3 | +----+--------------+--------------+--------------+  Plane structure: +----+--------------+--------------+--------------+--------------+ | PK | Attribute #1 | Attribute #2 | Attribute #3 | Attribute #4 | +----+--------------+--------------+--------------+--------------+  Because of this diversity in the number of attributes (columns), I initially thought it would be a good idea to create one separate table for each Category, so I would avoid several NULLs and thus making a better use of the indexing. Although it looked great at first, I couldn’t find a way to create the relationship between the Items and the Categories through the database because, at least in my modest experience as a database administrator, when creating Foreign Keys, I inform explicitly a database the table name and column. In the end, I would like a solid structure to store all data, while having all the means to list all attributes of all Items a User may have with one query. I could hardcode dynamic queries with the server-side language, but I feel this is wrong and not very optimal. Additional information These are my responses to MDCCL comments:  1. How many Item Categories of interest are there in your business context, three (i.e., Cars, Boats and Planes) or more?  In fact, it’s very simple: There are only five Categories in total.  2. Will the same Item always belong to the same User (that is, once a given Item has been “assigned” to a certain User it cannot be changed)?  No, they could change. In the fictional scenario of the question, it would be like User A sells Item #1 for User B, so the ownership must be reflected.  3. Are there attributes that are shared by some or all of the Categories?  Not shared but, from memory, I can tell that at least three attributes are present in all Categories.  4. Is there a chance that the cardinality of the relationship between User and Item is many-to-many (M:N) instead of one-to-many (1:M)? For example, in the case of following business rules: A User owns zero-one-or-many Items and An Item is owned by one-to-many Users  No, because Items would describe a physical object. Users will have a virtual copy of them, each one identified by a unique   5. Regarding your following response to one of the question comments:  “In the fictional scenario of the question, it would be like User A sells Item #1 for User B, so the ownership must be reflected.”  It seems that you are planning to keep track of the item ownership evolution, so to speak. In this way, which attributes would you like to store about such phenomenon? Only the modification of the attribute that indicates the specific User who is the Owner of a specific Item?  No, not really. The ownership may change, but I don’t need to keep track of the previous Owner.


I have a little problem in service (android).              In my code what i am doing exactly...first i send data through intent to service.  Intent i = new Intent(getApplicationContext(), External.class); i.putExtra("data",data); i.setAction(External.ACTION_PLAY); getApplicationContext().startService(i);   Then in method onStartCommand() i receive that data.  Bundle b=i.getExtras(); data=i.getStringExtra("data");   So in notificationbar with action_play by onPlay() method we get actual data.  Toast.makeText(getApplicationContext(),"I get your message"+ data,Toast.LENGTH_LONG).show();   Then, when i again try to receive that data by with acton_pause by onPause() method i get null, i mean" I get your message null." every time i get that, i initialize every thing make them all static one by one and together but i got null.i am putting my initialization code here ,check that and help me to solve it......  In activity  private static  String data="music is mine";   In External service  private static String data="";   Thanks in advance.

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 page named "calientes" with a complex loop that's working perfectly. This page is located at domain.com/calientes/. Now I need to use this page as the home page, so I went to "Settings -> Reading" and chose that page as static page.  The problem now is that the pagination no longer works. On the actual page it shows like domain.com/calientes/page/2 and it work perfectly! but now it shows as domain.com/page/2/ when i really want to go to domain.com/calientes/page/2  I didn't do any other changes, just chose that page as front page basically.   What can i do to made my pagination call domain.com/calientes/page/2?  This is my query on my page "Calientes" :   $paged = ( get_query_var('paged') ) ? get_query_var('paged') : 1;  $args = array(   'posts_per_page' => 9,   'paged' => $paged,   'meta_query' => array(      array(        'key' => '_wti_like_count',        'value' => 10,        'compare' => '>=',        'type' => 'numeric'      )   ) );  $wp_query = new WP_Query(); $wp_query->query( $args );  if( have_posts() ) : ?>  <?php while ($wp_query->have_posts()) : $wp_query->the_post(); ?>  <?php get_template_part( 'content', get_post_format() ); ?> <?php comments_template( '', true ); ?> <?php endwhile; // end of the loop. ?>  <?php twentytwelve_content_nav( 'nav-below' ); ?>

I've got a custom loop that I'm using to display some Real Estate listings that will be available within 60 days. I'm calling it with the following function:   <?php  $sixtydays = date('Y/m/d', strtotime('+60 days')); $paged = (get_query_var('paged')) ? get_query_var('paged') : 1; $query = new PostsOrderedByMetaQuery(array(   'post_type' => array('post', 'real-estate'),   'meta_key' => 'Time Available',   'meta_compare' => '<=',   'meta_value' => $sixtydays,   'paged' => $paged,   'orderby_meta_key' => 'Price',   'orderby_order'    => 'ASC' )); ?> <?php while ($query->have_posts()) : $query->the_post(); ?>   While the loop works great, I can't get it to paginate. It shows the first 10 (my default) posts but doesn't show the pagination. The only way to display all posts is to show them on one page by adding 'posts_per_page' => -1, I have similar loops on other pages that have no problem paginating. The only difference with this one is that there are two meta keys that are filtering the posts.   I'm using WP Page Navi for this and the rest of my pages. I'm closing the loop and adding the pagination using the following code:   <?php endwhile; // End the loop. Whew. ?> <?php wp_pagenavi(); ?> <?php wp_reset_query(); ?>   How can I go about fixing this?


I am a new user of Ubuntu, and I installed Ubuntu 15.10 but the Urdu language pack is not installed in my Ubuntu 15.10. I tried many ways to get help by forum, but I have still found no solution. How can I easily add the Urdu language pack in Ubuntu 15.10?

I am a new user of Ubuntu 16.04 LTS. To my surprise it does not have Urdu Language in language support widow. Kindly help.   The given answer to  is not helping me.


How can I use only a few of the areas outlined in a shapefile? In this case, my shapefile has all of the ZIP codes for a U.S. state, and I would only like to display the ZIP codes for a particular city. Is there any way to do this?  Also, some of the ZIP codes are partially in the city, and partially out of it. How would I go about editing the boundaries of the outlined areas?

Not sure if this option ever existed, but the new QGIS version hides a lot of things somewhere else and this seems so simple that I'm kind of convinced it was possible to do this before. I have quite a large data set with ship tracks. I now want to analyse individual ship tracks (made from point layer with  Plugin). However, it is so crowded that it is hard to look at individual tracks. I don't want to save each single track as a new layer, so I wonder if it is possible to select one track in the Attribute table and display only that one on the map/hide the others?


It is not easy form me to understand the . I think it needs  a separator (border or underline) to differentiate the total number and breakdown of that total.        As suggested by Stijn it should be something like this

Right now the flagging history stats are kind of lumped together visually. I'd like to suggest an easy to implement enhancement that would make reading the flagging history stats easier.  By adding some basic visual cues like borders, and placing the percentage statistic after the particular flag type, your history becomes much easier to read at a glance.


This is an advanced high-school problem.     Find all natural $x,y$, and $z$ such that    $3^x + 4^y = 5^z$.   The only obvious solution I can see is $x=y=z=2$. Are there any other solutions?

Are there more integral solutions for $3^x+4^y=5^z$, than $x=y=z=2$ ?   If not, how do I show that? I could show that for $3^x+4^x=5^x$, but I'm stuck at the general case? Any ideas, maybe graphs, logarithms or infinite descent?


If I have a screen that looks like this.  and I eventually end up with a screen that looks like this.  How can I get back to the screen first shown above with out starting all over?  Thanks

I cannot find any menu or keys that return blender to the view that you see when you start blender. Using save close and then open again but it must be easier than that?  How do you change the view from side or front, or back to the view that is enabled by default at start?


Let $V$ be a separable infinite dimensional Hilbert space over $\mathbb{C}$  Let $\{A_{i,j}\}_{i,j \in \mathbb{N}} \subset V$ be a matrix of linearly independent vectors of $V$  My question is if is it possible to orthonormalise matrix $A$, getting the matrix $B$  such that $$ \langle B_{i_1,j_1} , B_{i_2,j_2} \rangle = 0 $$ and such that $$ \forall i \in \mathbb{N}: \operatorname{Span}(\operatorname{Row}_i(A))=\operatorname{Span}(\operatorname{Row}_i(B)) $$  I have to orthonormalise a matrix and not a sequence so the question is very different from  mainly for the second condition. I cannot see no one anything in common. thanks.

EDIT:  After some contemplation I decided to phrase the question better to avoid trivial answers.  Consider a Hilbert space with a basis $\{v_{i}\}$ where $i\in I$ an index set, which could be uncountably infinite.  We define a "Gram-Schmidt for infinite dimension" to consist of a total ordering $\leq$ on the index set $I$ and a set of orthonormal basis $\{b_{i}\}$ where $i\in I$, and the following condition is satisfied: for any $i\in I$, then $b_{i}$ can be written as a finite linear combination of $v_{i}$ and $b_{j}$ where $j<i$.  We define a "Gram-Schmidt for infinite dimension with series allowed" to be just like above, except that $b_{i}$ is allowed to be written as series instead of just finite linear combination.  So the question is, can "Gram-Schmidt for infinite dimension" be done in a general Hilbert space starting with an arbitrary basis $\{v_{i}\}$? What about "Gram-Schmidt for infinite dimension with series allowed"?  Clearly, if $I$ is countable, the answer is trivial. The interesting case is when $I$ is uncountable.  Thank you for your answer.  ===========  Original question:  In Real Analysis for Graduate Student (Bass) chapter 19 (Hilbert space) page 188, wrote was "The Gram-Schmidt procedure from linear algebra also works in infinitely many dimensions".  So how exactly would such process get carried out?  Thank you for your answer.


I have a file with hundreds of paragraphs of around 15 lines each. I need to search for a pattern, say Occurrence: 1. If this pattern is found in the para, I need to print the entire paragraph. Note that the paragraphs are separated by 2 new line characters.  I have tried the below line of code and this obviously prints the first occurrence in the file. I am somehow unable to use a loop and print all such occurrences.  sed -n '1,/Occurrence: 1/p' ystdef.txt | tail -9 > ystalarm.txt   Can I use the g (global) flag with sed to make this work? If yes, how?  Note that I am aware of the grep -A/B/C commands but they wont work on my Cygwin terminal.

Below is the text in the file:  Pseudo name=Apple Code=42B state=fault  Pseudo name=Prance Code=43B state=good   I need to grep for "42B" and get the output from the above text like:   Pseudo name=Apple Code=42B state=fault   Does anyone have idea on how to achieve this using grep/awk/sed?


I'm only just beginning to read about diodes. I'm looking at the 1N400x series, where all specs are the same except the reverse voltage (link:  for example). The reverse voltage increases as x increases, all else is the same (even price).  From what I understand, the reverse voltage is the maximum voltage drop the diode can have (in reverse) before it fails. My question is, is there a reason I shouldn't just buy the highest reverse voltage I can find? Is the N4001 not the same in every way as the N4003 except that the N4003 can work with higher voltages without failing?

I compared 1N400x diodes . As far as I see, all of their properties are same other than their maximum reverse voltages.  Their   maximum current recovery time reverse leakage current capacitance   are the same.  It looks like 1N4007 is the super version of all other 1N400x diodes. So, why would one produce 1N4001...1N4006 diodes, and why would one buy them? If 1N4007 does the job alone, then why are the other versions still in the market?


How can I find asymptotic for $\chi(n)$, if $\chi^{\chi^\chi} = n$. Is here self-qualification estimation? I tried to take the logarithm of both sides, but to nothing has come.

How find the asymptotic behavior for $x(n)$  if $x^{x^x} = n$?  I supposed that $x = O(\log\log{n})$ and took logarithm two times.  So I get $x = O(\frac{\log\log{n}}{\log\log\log{n}})$  Is it right? How to improve this estimate?


I have been  and I think I understand the idea of virtual particles being created and destroyed but what I don't understand is how this is different from just shining a light and moving due to momentum from the light in the opposite direction.  Just to make sure I am understanding the concept correctly, here is a summary of what I think is going on:   Particles and antiparticles are continuously being created and destroyed in the quantum vacuum.   The thruster uses energy to exert a force on these particles.   An equal and opposite force pushes the thruster forward.   The particles annihilate each other.   If any of this is wrong please correct me.  It seems to me that in the end, only energy in the form of electromagnetic radiation exits the thruster. If momentum is conserved then the momentum imparted on the thruster must be due to the momentum of the electromagnetic radiation. How then, is this different from just creating this electromagnetic radiation in a more traditional way and using its momentum for thrust?  Thanks for the explanation

The  is a proposed propulsion mechanism for spacecraft in which some form of microwave device provides the propulsion. The consensus from the physics community, including many voices on this site, is that the proposed device would violate conservation of momentum.   Several experiments have been conducted, by three main groups: (i) , from Satellite Propulsion Research Ltd, (ii) a research group at the Northwestern Polytechnical University in Xi'an, China, and (iii) Eagleworks Laboratories at NASA's Lyndon B. Johnson Space Center in Houston, Texas. However, few of these experiments have been performed in vacuum (and none of the vacuum tests has been published in a peer-reviewed journal), which means the effect of air currents around the device cannot be ruled out.  This device has been the subject of many questions on this site, including          and their many closed duplicates.  Many of these questions ask what the proposed explanations are, but then veer off into territory of the form "assuming it is true, how does it work?", so they have been (rightfully) closed as counterfactual physics. I feel this sort of bundling does a lot of harm to the discussion, and there is some scope to ask what exactly is being proposed as an explanation. So:     What do the proponents of EmDrive claim is the theoretical justification of the device's function?   Please limit answers exclusively to references, and indicate whether they are peer-reviewed or not. Please limit answers to serious attempts at explanations, as opposed to vague claims about the 'quantum vacuum' - or indicate if an experimental paper does not have any such theoretical explanation or reference.  To be clear, this is not the place to discuss whether the explanations are correct or not. If you have specific questions about any of these sources, ask it separately. (However, if your question starts with "assuming that this works", be prepared for it to be closed.) If you feel there are not enough resources on this thread, you can  but please do not post another question asking people to look for more references.


I have a CentOS 7.2 (minimal) VM running in a vSphere cluster, which has a 16G drive formatted as XFS under the default full-disk usage partitioning scheme from the CentOS installer. The system is running a test httpd service (all software from the default centos repos), but its space usage on disk is growing. This is in part from problematic apache error/access logs (2+GB in size), and removing these longs frees up some space. What is eating the drive space isn't so much a concern for me (I'll just nuke and pave this eventually). However, when I run df an du to check file sizes, I get a discrepancy and this is what's confusing.  First I run df -h to view filesystem usage:  [root@svrhttp03 httpd]# df -h Filesystem                         Size  Used Avail Use% Mounted on /dev/mapper/centos_svrhttp03-root   14G  4.8G  9.1G  35% / devtmpfs                           902M     0  902M   0% /dev tmpfs                              912M     0  912M   0% /dev/shm tmpfs                              912M   97M  816M  11% /run tmpfs                              912M     0  912M   0% /sys/fs/cgroup /dev/sda1                          497M  169M  329M  34% /boot tmpfs                              183M     0  183M   0% /run/user/0   This is showing 4.8G used on the root FS.  I then run the following to view the size of all items at the root of the filesystem:  [root@svrhttp03 httpd]# du -a -h -t 10K / 2> /dev/null | grep -v -E "[A-Z,a-z,0-9]/." | sort -h 16K /home 7.4M    /root 31M /etc 97M /run 143M    /boot 324M    /var 1.3G    /usr 1.9G    /   This shows only 1.9G in use, and the reported size of all directories add up to ~1.9G, as expected.  So how can I find that ~2.9G discrepancy between what df and du are claiming for data on disk?

Possible Duplicates:             df -h says that I have 494G used on /var:  Filesystem            Size  Used Avail Use% Mounted on /dev/sda3             564G  494G   41G  93% /var   But du -sh /var says it's 350G  What makes them different?


Trying to install Ubuntu 18.04 on an Asus UX305C.  I Downloaded Ubuntu Desktop ISO on 21/06/2018 about 16:00H  I used Unetbootin from a ThinkPad running 18.04 to install the iso files onto a USB2 SanDisk USB.   I boot the laptop from the USB. I chose Install.   Instead of Installing it takes me to the "try Ubuntu" live session. I click install disk icon nothing happens.   I tried to manually run Ubiquity. It produces a crash report that says Ubiquity is not installed.   I go to that location and the BIN directory is there.  I run it again (with the bug report open) to be sure that it's currently running.   Close bug report, run again. Nothing. Wait a bit, get same bug crash report.   What am I doing wrong?

I'm absolutely new to Linux. I would like to know how to install Ubuntu alongside the pre-installed Windows 8+ OS.  Should I do it with Wubi, or through the Live USB/DVD?  What steps do I need to take to correctly install Ubuntu?


Does anyone know how to draw a simple process flow diagram like this?

So far I have this, which half gets the job done, but I really wanted a slightly better looking and more descriptive timeline. Really I wanted to be able to write more than one line for each new addition to the timeline.  \documentclass[a4paper, twoside, 11pt]{report}  \usepackage[pdftex]{graphicx}  \newcommand{\foo}{\hspace{-2.3pt}$\bullet$ \hspace{5pt}}  \begin{document}  \scalebox{1}{ \begin{tabular}{r |@{\foo} l}  1947 & AT and T Bell Labs develop the idea of cellular phones\\ 1968 & Xerox Palo Alto Research Centre envisage the 'Dynabook\\ 1971 & Busicom 'Handy-LE' Calculator\\ 1973 & First mobile handset invented by Martin Cooper\\ 1978 & Parker Bros. Merlin Computer Toy\\ 1981 & Osborne 1 Portable Computer\\ 1982 & Grid Compass 1100 Clamshell Laptop\\ 1983 & TRS-80 Model 100 Portable PC\\ 1984 & Psion Organiser Handheld Computer\\ 1991 & Psion Series 3 Minicomputer\\  \end{tabular} }  \end{document}   This code produces:    I really need something that works in the same way the horizontal timeline does when using the chronology package.  Any help would be appreciated!


There is a proverb or saying in Arabic and the exact translation is...      "When whores talk about honor"   ...this is said when someone points out other people's mistakes while he/she makes the same mistakes or something even worse.  is there anything similar or equivalent in English?

Say person A and person B are having a discussion/argument.   Person A tells person B that his views are arrogant, or closed-minded, or some other derogatory adjective. But in fact it is person A's views that are arrogant, closed-minded, etc. Person B's views are usually the exact opposite of what person A is accusing him of.  This sort of situation happens a lot when discussing politics or religion, for example.  What do you call person A, for calling person B something that he himself is?  I guess, for the most part, person A doesn't actually realize that he is the one that the adjective applies to, and not person B. Maybe there is a different name if person A knows the adjective also applies to him.


How to simplify below expression or convert it to something simpler like $k^{n-1}$?  $$ k^0+k^1+k^2 + k^3+...+ k^{n-1} $$

Why does the following hold:  \begin{equation*} \displaystyle \sum\limits_{n=0}^{\infty} 0.7^n=\frac{1}{1-0.7} = 10/3\quad ? \end{equation*}  Can we generalize the above to      $\displaystyle \sum_{n=0}^{\infty} x^n = \frac{1}{1-x}$ ?   Are there some values of $x$ for which the above formula is invalid?  What about if we take only a finite number of terms? Is there a simpler formula?     $\displaystyle \sum_{n=0}^{N} x^n$   Is there a name for such a sequence?    This is being repurposed in an effort to cut down on duplicates, see here: Coping with  duplicate questions.  and here: .


I am new to python and suddenly was surprised seeing that a variable is still visible outside the block in which it's declared and assigned. The code is below:  with open('data.txt', 'r') as file:     text = file.readlines()     # and when do I close the file?  for i in range(len(text)):  # still can access the text even after the block.     print(text[i])   How is this possible for the variable to be seen from outside the block? Thanks in advance.

What exactly are the Python scoping rules?  If I have some code:  code1 class Foo:    code2    def spam.....       code3       for code4..:        code5        x()   Where is x found?  Some possible choices include the list below:   In the enclosing source file In the class namespace In the function definition In the for loop index variable Inside the for loop   Also there is the context during execution, when the function spam is passed somewhere else. And maybe  pass a bit differently?  There must be a simple reference or algorithm somewhere.  It's a confusing world for intermediate Python programmers.


I want the system to accept the characters M or S both upper and lowercase but it keeps looping endlessly. Where did i go wrong?      MS1 = JOptionPane.showInputDialog("Please enter Marital Status M or S. ");     while(MS1.substring(0) != "S" && MS1.substring(0) != "s" && MS1.substring(0) != "M" && MS1.substring(0) != "m"){         JOptionPane.showMessageDialog(frame, "Please enter S or M.only");         MS1 = JOptionPane.showInputDialog("Please enter Marital Status M or S. ");     }

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


I'm importing multiple identical linked objects into a game asset.  I want the objects chrome.  I found this thread on "making a chrome texture in eevee:"  Following the thread, I created a new material called "chrome" and used the settings as indicated.  I used the shader tab to create the node layout as pictured in the thread.  The objects appear chrome-like. I did not UV unwrap the (parent) object as I'm happy with the chrome appearance on the objects.  I wouldn't know where/how to unwrap the object UV islands as I don't have an 2D image, just the chrome appearance generated by "chrome" settings as indicated. When I import this modified asset into the game dev editor it shows the new material "chrome", but it gives an error message "TxDiffuse is null", i.e. that the material has no assigned texture. I'm very new to this and clearly don't yet understand materials versus shaders versus textures. Thank you for your help.

I have been experiencing an issue that once I have a material created and looking the way I want it, I cannot seem to export it correctly with the textures mixed.  I don't know the correct words to use, but in blender I have the material created using the nodes editor, and I have placed two textures inside of there (one for the rock texture and one for moss, my object is a rock). When I export this model and import to Unity (the game engine I am using), I find a materials folder but the material inside of it does not have the textures assigned, it's just a plain white material?  How can I export my material from blender in a way that it will allow me to import it WITH TEXTURES into Unity?


One of my colleague asked me that "What time can I call you". I need to answer him.  Is this correct? If not please suggest the correction(s).

Call me when you are available to talk   Is that correct? Can I use it that way?


StackOverflow has been awesome for code related questions for me as well as my team. However, in the real world, software doesn't exist in isolation or in the context of only code - it's within the context of either a business or a higher purpose (eg: simplifying user Q&A paradigm). For many of those decisions, the question is more 'meta' than just code-questions "float or real?" but more high level; the kind of data more experienced dev / mature projects could very well share with others, in a Q&A format.   So where can one ask questions tightly coupled with software code itself? Real world, high level, software development questions that are as important (if not more) to any software project as specific questions about a few lines of code?   IMHO, StackOverflow is a great place because   its "of programmers, by programmers and for programmers" approach is great for such related questions questions are tightly coupled, software development related (versus related-but-distant like "which software engineering role pays best?" or something) avoids too much fragmentation of software experts, developers and problems    However, that's my $0.02. I wanted to hear from others on what they feel is appropriate for the future.

There seems to be more than a few computer science/programming Stack Exchange networks (is that the correct term?). Stack Overflow, being the first, has by far the most users, questions, and answers.  What is the reasoning for creating the others, and are there clear guidelines for which kinds of questions should be posted? I can see a large amount of potential overflow, many cases of people not getting a good answer to their question, because the person who has the answer isn't browsing that particular network at the moment.  I understand that they were probably created for organizational purposes, but wouldn't it almost make more sense to just have them as categories under Stack Overflow, keep them separated but still connected, instead of making people have to create multiple 'account's, one for each network?  I am sure there was a very good reason to break them up, but as someone that is new to SE, it can be somewhat intimidating to decide which one to post in to ensure you get a good answer. For example, if I am a computer science student, my first instinct might to be to post in the computer science network, until I see that it literally has 1% of the users as the Stack Overflow network, which still seems to be for programming/computer science related questions.  So my second instinct would then to be to post it into the Stack Overflow site on the basis that I have a significantly higher chance of my question being seen and getting a good answer. Then I notice that there is also a 'programmers' network, and I don't even begin to know where that fits in. I, and I am assuming most people, will probably just post on Stack Overflow to be safe.  My question is, other than the short little description blurb of each one, is there a clear cut set of guidelines which what each network is intended for, what kinds of questions should go to each one, and is anything being done to encourage people to post in these newer, smaller (more specialized?) networks as opposed to just posting in big daddy Stack Overflow?  Now again, this is for computer science/programming/"why isn't this code doing what I want?" related questions, I am not saying that if I had a question about Linux or WordPress or something I would have the same confusion.


I am trying to prove the following via the direct definition of Ito integrals (i.e. without the use of the Ito formula).     $$ \int^{t}_{0}B^{2}_{s}dB_{s}=\frac{1}{3}B^{3}_{t} - \int^{t}_{0}B_{s}ds$$   Progress so far     So Using the Definition of the Ito integral we can write    $$\int^{t}_{0}B^{2}_{S}dB_{s}=\lim_\limits{\Delta t_{j} \ \to 0}\sum_\limits{j}B^{2}_{j}\Delta B_{j}$$    Where $\Delta B_{j}=[B_{j+1}-B_{j}]. $      From here i then started by trying to calculate $\Delta(B^{3}_{j})$ which i got       $$ \Delta(B^{3}_{j}) = B^{3}_{j+1}-B^{3}_{j} = (B_{j+1}-B_{j})^{3}+3B_{j}B_{j+1}\Delta B_{j}$$   However this doesn't really get the desired result i'm not sure how to proceed i assume i have calculated $\Delta (B^{3}_{j})$ incorrectly?

I am trying to solve the exercises from the book Stochastic differential equations -An Introduction with applications by Bernt Oksendal and I am stuck on 1 question.  Prove directly from the definition of Ito's integral that   $$\int_0^t B_s^2 dB_s=\frac{1}{3}B_t^3-\int_0^t B_s ds$$  I have tried for a couple of hours but I simply cannot prove it . I would be grateful if somebody could help me out , even a hint would be very helpful


The problem is, when the program steps to the line: stosb, it will display an error: "Program received signal SIGSEGV, Segmentation fault." I don't know why, any ideas?  Under ubuntu x86_64, using "gcc -o test test.c" to compile and link.  #include <stdio.h>  static inline char * strcpy(char * dest,const char *src) {     int d0, d1, d2;     __asm__ __volatile__("1:\tlodsb\n\t"                          "stosb\n\t"                          "testb %%al,%%al\n\t"                          "jne 1b"                          : "=&S" (d0), "=&D" (d1), "=&a" (d2)                          : "0" (src),"1" (dest)                          : "memory");     return dest; }  int main(void) {     char* src_main = "Hello_src";     char* dest_main = "Hello_des";     strcpy(dest_main, src_main);     puts(src_main);     puts(dest_main);     return 0; }

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


I'm needing to detect when a login failure happens in Drupal and am finding it to be exceedingly difficult even after searching Google.  I have to believe this exists somewhere.  I found this post back from 2007 which seems like an entirely reasonable request for a "failed login" hook:  Is there something that allows this?  Thanks in advance.  AG3

I want to show a custom block, only when log in has failed. So from visibility settings I have to put a PHP code that returns TRUE only when the login has failed.  But how could I "catch" that event? Do I have to use variable_get(..)? And if yes, how could I use that?with what attributes?  Thank you.


I have a class that have value types and some List<Object> members. The class implements IClonable interface and Clone() and GetHashCode() are implemented. In Clone() method I used MemberwiseClone() method for cloning value types.   I also did same coding in Object (lets call it Person) class. I want to call that class's Clone() method in the referrer class's Clone() method. But because of the type of the class here is Object I can't call Clone() method of it.  I can't make Object to Person here because the type of Object changes at runtime. Sometimes it is 'Person' sometimes 'Order' for example.  Here is example code:  public class Person : IClonable {     public string name = "Name";     public string surname = "Surname";      public override Person Clone()     {         Person p = this.MemberwiseClone();     } }  public class Order : IClonable {     public string name = "OrderName";     public int orderId = 1;      public override Order Clone()     {         Person p = this.MemberwiseClone();     } }  public class List : IClonable {     public string listname = "ListName";     List<object> objectList = new List<object>();      public override List Clone()     {         List l = this.MemberwiseClone(); //This clones value types          List<object> copyObjectList = new List(object);          foreach(Object o in objectList)         {             Object co = o.Clone(); //I want something like this             copyObjectList.Add(co);         }          l.objectList = copyObjectList;          return l;     } }

I want to do something like:  MyObject myObj = GetMyObj(); // Create and fill a new object MyObject newObj = myObj.Clone();   And then make changes to the new object that are not reflected in the original object.  I don't often need this functionality, so when it's been necessary, I've resorted to creating a new object and then copying each property individually, but it always leaves me with the feeling that there is a better or more elegant way of handling the situation.  How can I clone or deep copy an object so that the cloned object can be modified without any changes being reflected in the original object?


Quick question about how ISPs and personal routers. So, I have a personal router and have about 13 devices currently connected to the router. Is there anyway that my ISP would know how many devices are currently connected to the line via my personal router? Basically, if I used my personal router, what kind of information does the ISP have access to?

I installed a new router today and saw my IP address change because the new router has a different MAC address and I am just curious on what information my ISP can see from my network.  I know they log the WAN MAC address and can figure out the manufacturer with the OUI, what about the router host name and other MAC addresses like the LAN and wireless MAC?


I am a beginner in Latex and I have a problem such as: I was able to make the first and third pages of the bibliographer empty, but I cannot make the second page empty. An idea please. This is the tex code \documentclass[a4paper,12pt,openany]{book} \usepackage{etex} \usepackage[utf8]{inputenc} \usepackage{chngcntr}    \usepackage{fontenc} \usepackage[french]{babel}   \usepackage{amsthm} \usepackage{amsmath} \usepackage{amssymb} \usepackage{amsfonts} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \usepackage{titletoc} \usepackage{tikz} \usepackage{titletoc} \usepackage{lipsum} \usepackage{calc} \usetikzlibrary{shadows.blur} \newcommand{\printmyminitoc}{ \noindent\hspace{0cm}\begin{tikzpicture} \node[rounded corners,align=left,fill=white,blur shadow={shadow blur steps=5},inner sep=5mm]{% \color{black}% \begin{minipage}{15cm}%minipage trick \textbf{\Large Contents}\\ \rule{\textwidth}{1.5pt} \printcontents[chapters]{}{1}{} \end{minipage} }; \end{tikzpicture} \ \vspace{1cm} \\} \usepackage[colorlinks=true,urlcolor=green, citecolor=red, linkcolor=blue]{hyperref} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \usepackage{titleps} \newpagestyle{mine}{ \headrule \sethead{\itshape\chaptername\thechapter}{}{\itshape\chaptertitle} \footrule \setfoot{}{\thepage}{} } \renewpagestyle{plain}{ \setfoot{}{}{\thepage}} \pagestyle{mine} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \usepackage{footnote} \usepackage{etoolbox} \usepackage{mathrsfs} \usepackage{graphicx}            \usepackage{hyperref} \usepackage{indentfirst}             \usepackage{xcolor} \usepackage[final]{pdfpages}  \usepackage{fancybox} %\usepackage{biblatex} \usepackage[   backend=biber, % bibtex  % bibtex or biber (prefered)   natbib=true,   style=numeric,   sorting=nty  % none, nty % no sorting or standard sorting ]{biblatex} \addbibresource{bibliogra.bib} \usepackage{color} \usepackage{dsfont}  \usepackage{lastpage}  \usepackage{sectsty} \usepackage[left=2cm,right=2cm,top=2.75cm,bottom=3cm]{geometry} \usepackage[Bjornstrup]{fncychap} \usepackage{hyperref}   \definecolor{9ahwi}{rgb}{0.5, 0.1, 0.005} \definecolor{khdar}{rgb}{0.0, 0.5, 0.8} \definecolor{ocre}{RGB}{243,102,25} \usepackage{newunicodechar}  \begin{document} \tableofcontents \thispagestyle{plain} \chapter{Bib} \cite{Bal89}\cite{DeB86}\cite{Dil93}\cite{Gue97}\cite{Kru00}\cite{Bal90}\cite{Kom67}\cite{Bal96}\cite{Amr92}\\\cite{Ord66}\cite{Hes90}\cite{Hes02}\cite{Hes00}\cite{Hes91}\cite{Lev76}\cite{Mol05}\cite{Ion69}\cite{Val07}\\\cite{Rud91}\cite{Les16}\cite{Bre10}\cite{Sho97}\cite{Die77}\cite{Gio13}\cite{Ric75}\cite{Cha77}\cite{Dan13}\\\cite{Mau75}\cite{Pap02}\cite{Cha99}\cite{Sch70}\cite{Sch86}\cite{Ben15}\cite{Gar79}\cite{Bae72}\cite{Kak39}\cite{Nis63} \newpage \addcontentsline{toc}{chapter}{Bibliographie} \newpage \printbibliography \thispagestyle{plain}\thispagestyle{plain} \end{document}

I would like the entire bibliography to have an empty page style in my document (which means remove the headers and page numbers).  I used the command \renewcommand{\bibsetup}{\thispagestyle{empty}\pagestyle{empty}} from  which successfully removes the style from the first and all subsequent pages of the bibliography except for the last page.   I created a minimal working example that produces the following output:    As you can see, the first page of the references has no style. However, the second page (which in this case is the last one) has the page number at the bottom.  Note that this happens also i) if I have more than just two bibliography pages, and ii) for the intermediate bibliographies at the end of each of my chapters.  I am writing a thesis (memoir class) and am using the fancyhdr package, in case this is relevant.  Any suggestion on what might be going on? Thanks a lot!  \documentclass{article} \usepackage[utf8]{inputenc} \usepackage[     backend=biber,     style=ieee,     citestyle=numeric-comp,     backrefstyle = none ]{biblatex}  \renewcommand{\bibsetup}{\thispagestyle{empty}\pagestyle{empty}}  \addbibresource{bibli.bib}  \title{Minimal working example}  \begin{document}  \section{Introduction} coordinates~\cite{li20143d,pavllo20193d}, predictions~\cite{pavlakos2016coarse,varol2018bodynet}, models~\cite{tome2017lifting} encoding~\cite{kanazawa2018end,bogo2016keep} information~\cite{zhou2017towards,habibie2019wild} training~\cite{rhodin2018learning,qiu2019cross}  a \cite{andriluka20142d,lin2014microsoft} markers \cite{sigal2010humaneva,h36m_pami} multi \cite{Joo_2015_ICCV,mehta2017monocular} cameras~\cite{shu2016learning} free~\cite{chen2016synthesizing,varol2017learning,tome2019xr} camera~\cite{taylor2000reconstruction,bourdev2009poselets,pavlakos2018ordinal,ronchi2018s} camera \cite{rhodin2018unsupervised} point \cite{sermanet2017time,mitra2019multiview}   \newpage \printbibliography[heading=bibintoc]  \end{document}


Recently, I have submitted a mathematical paper to a journal published by Taylor & Francis. After some days, the status of the paper was changed from Submitted to Journal to AWAITING REFEREE SELECTION. Up to now,  11 weeks passed but the status is still AWAITING REFEREE SELECTION. I have contacted to Editorial Office several but the result is not changed. How should we respond to them in this case?

I submitted a paper to an internationally reputed journal. Two months after submission I was asked to suggest possible reviewers, which I did after a couple of days reflection. Since then it has been 4 months and the paper is still "awaiting reviewer invitation." I sent an email to the editor-in-chief as this was the only contact information given for queries. It has been almost two weeks without any reply. The day before yesterday I emailed the managing editor to know if the paper is under review or still awaiting reviewer invitation, but still I have received no reply from either editor.   How should I get in contact with the journal regarding my paper's review status?


Wonder if there's any way to check if elements with the same class exists in a document.  For example:
panel 1

panel 2

panel 3
   JS:  if ( $('.panel')[0] ) {     console.log('exists') }   .. but I want to check if MORE THAN ONE panel element exists, alteast 2.

How can I check the existence of an element in jQuery?  The current code that I have is this:  if ($(selector).length > 0) {     // Do something }   Is there a more elegant way to approach this? Perhaps a plugin or a function?


I want to know how I can time the execution of a module with greater precision than what is provided by the time module i.e. with greater than 0.1 second resolution  Here is my code:   >>>import eosClass_steff_test2 as mod;  >>>import srk as typeEOS  >>>import benzene as typeMolecule  >>>import time  >>>benzsrk=mod.EOS(typeEOS,typeMolecule)  >>>start = time.time()  >>>benzsrk.Z(300,20)  >>>print ('It took', time.time()-start , 'seconds.')`

Which is better to use for timing in Python? time.clock() or time.time()? Which one provides more accuracy?  for example:  start = time.clock() ... do something elapsed = (time.clock() - start)   vs.  start = time.time() ... do something elapsed = (time.time() - start)


I have a RPM spec file. How can I make it so that after the RPM installs, a random string is injected into one of the configuration files?   For example:   The RPM installs the binaries and config file to   /opt/bin/foo /opt/bar.cfg   Inside the bar.cfg, I have the following configuration.   foo.bar = [         [                 clientId:"herp-derp",                 clientSecret:"<ENTER-CLIENTSECRET-HERE>",                 authorizedGrantTypes:["password"]         ] ]   I want the RPM's that are distributed to replace "<ENTER-CLIENTSECRET-HERE>" with an actual random string.    Here is how I am generating the random string  echo cat /dev/urandom | base64 | tr -dc "[:alnum:]" | head -c32  Since I have never worked much with RPM or spec files in the past, I'm not sure the appropriate way to go about this. Can I just add something like this to the spec file?   %post RANDOM_STRING=`cat /dev/urandom | base64 | tr -dc "[:alnum:]" | head -c32` sed -i.bak "s/clientSecret:\"<ENTER-CLIENTSECRET-HERE>\",/clientSecret:\"$RANDOM_STRING\",/g" /opt/bar.cfg

I try to build rpm package. I follow .   I want to run a script (bash or python) when run command as "rpm -Uvh mytest-1.0-1.el6.noarch.rpm" .   Could run a script when install a rpm package? How?


I'm replacing the faucet handle (below). But  I can't figure out how to remove the stem  (in photo above the red outlined area). So I'm thinking I need to remove the stem as well. But I can't see inside to see how to do that.  This  explains what the stem is, but not how it connects to the water source, or how to remove/replace it.  I'm also a little worried that if I get it disconnected I won't be able to reconnect it. (Right now the faucet works, it's just hard to close. If I break the stem, I'll have to leave the water off til a plumber visits!)  Photo taken from above. The water source is at top of photo (wall). Faucet handle is at bottom of photo.

I've tried unscrewing the part outlined in red below. No dice. Do I just need to remove the whole rod (above the red outline) and replace it?) If so, can anyone point me to instructions for them.  I can't see in there. Worried that I'll pull it out and not be able to put it back in.  (The deeper I go in the plumbing the more things I find that there is no modern fitting-part :)  My new assembly  replaces the parts outlined in red. the new assembly has a female thread. I am HOPING that the thicker part of the pipe (just above the black "collar" stopper)  is screwed onto the pipe above.  However, I cannot unscrew it. There is nothing to get a hold of. It's perfectly round. I've tried dw40, and let it sit for 20 minutes. No love.  I'll try wacking it with a board in the direction along which it moves in when it screws (perpendicular to the threads per [this answer][2])


is there a why to make this thing solid? It has many holes and it's hollow inside.    Many thanks!  It has thickness, but I just want to make it a solid piece.

I have this weird object (vascular tree) which is empty inside, but closed from the top and the bottom:  However, it is empty inside, which makes me unable to use boolean on a bigger object (I want to make a hole in an object through which this object will go through). So I thought I should fill it and then try to boolean. But, how do I fill it?  Thank you sincerely.


I want to put a picture in a beamer slide and make it use all the available height of the frame. So I tried:  \documentclass{beamer} \usepackage[utf8]{inputenc} \usepackage{graphicx}  \begin{document}  \begin{frame}{FRAMETITLE}    \centering     \includegraphics[height=\paperheight,draft]{figure} \end{frame}  \end{document}   but this makes my figure exceed the slide:    I guess \paperheight includes the frame title, hence it is too large. Is there something like a \frameheight length which corresponds to the exact height available for the frame's content?

I would like to add two figures figures to a beamer slide, one on top of the other.  Is there a simple command, similar to \linewidth or \textwidth for the height?  The figures have dimensions roughly twice as wide as they are tall.  I would like them to use the full vertical space without encroaching on the title/controls.  If their dimensions were reverse, I would put them side by side using width=0.5\linewidth. I am not sure the height analog.    Here is what I am using now.  As an alternative, I use the \paperhieght but then have to visually check that the chosen scale factor left enough room for the title and controls at the bottom.   \begin{frame}{4$\times$167 gH5 in 10 mM K$^{+}$: Comparison}   \begin{center}     \includegraphics[height=0.4\paperheight]{figures/array_models/i1_r_c000_4x167_h5_k010_33_fit}\\     \onslide<2>{       \includegraphics[height=0.4\paperheight]{figures/array_models/i1_r_best1000_c000_4x167_h5_k010_33_fit}     }   \end{center} \end{frame}   In addition to having to check the scale factor, this also has the disadvantage that it must be changed if I add/remove the frame title or switch to a different theme.  If there I instead used the available slide height, it may not need to be updated.


Within a programming language, i execute a simple shell command  cd var; echo > create_a_file_here   with var being a variable that contains a string of (hopefully) a directory to the place where i want to create the file "create_a_file_here". Now if someone sees this line of code, it is possible to exploit it by assigning for instance:  var = "; rm -rf /"   Things can get pretty ugly. One way to avoid the above case would be maybe to search the string in var for some special characters like ';' before executing the shell command, but i doubt this covers all possibly exploits.  Does anyone know a good way to ensure that "cd var" only changes a directory and nothing else?

If you've been following unix.stackexchange.com for a while, you should hopefully know by now that leaving a variable unquoted in list context (as in echo $var) in Bourne/POSIX shells (zsh being the exception) has a very special meaning and shouldn't be done unless you have a very good reason to.  It's discussed at length in a number of Q&A here (Examples: , , , )  That has been the case since the initial release of the Bourne shell in the late 70s and hasn't been changed by the Korn shell (one of ) or bash which mostly copied the Korn shell, and that's how that has been specified by POSIX/Unix.  Now, we're still seeing a number of answers here and even occasionally publicly released shell code where variables are not quoted. You'd have thought people would have learnt by now.  In my experience, there are mainly 3 types of people who omit to quote their variables:   beginners. Those can be excused as admittedly it's a completely unintuitive syntax. And it's our role on this site to educate them. forgetful people. people who are not convinced even after repeated hammering, who think that surely the Bourne shell author did not intend us to quote all our variables.   Maybe we can convince them if we expose the risk associated with this kind of behaviours.  What's the worst thing than can possibly happen if you forget to quote your variables. Is it really that bad?  What kind of vulnerability are we talking of here?  In what contexts can it be a problem?


I'm posed with the following question:    I've attempted to deconstruct it:    Throw me a bone or give me a clue as to how I may solve it.

I got $x + CBD = 110^{o}$. I think I should find measurements of angle CBD, so how to find it?  Do you have any ideas? Please help me!


When creating a "child" object class in OOJS, I see two different ways of execution.   First,  function Person(name) {   this.name = name;   this.sayHi = function(){     alert("Hi");   } }  function Teacher(name) {   Person.call(call, name);   } }  var teacher1 = new Teacher("Tom");   Second,  function Person(name) {   this.name = name; }  Person.prototype.sayHi = function() {   alert("Hi"); }  function Teacher(name) {    //same as the first example }  Teacher.prototype = Object.create(Person.prototype); Object.defineProperty(Teacher.prototype, 'constructor', {    value: Teacher,    enumerable: false, // so that it does not appear in 'for in' loop   writable: true  });   The second method seems unnecessarily complicated.  I am still able to access Teacher.prototype through both methods.  What's the reasoning behind the second method?

What's the difference between  var A = function () {     this.x = function () {         //do something     }; };   and  var A = function () { }; A.prototype.x = function () {     //do something };


I was about to ask a question, here on Meta SE, when I was slapped with the above warning. I went into a state of shock and "before I knew it" I had posted a completely different and obviously self-defeating question.  I thought -- and have only just realized, incorrectly so -- that I was being black-listed system-wide. (I just now went to various "main" sites to which I belong and, even on a site at which one of my few questions was ill-received, I am not given any such warning/slap.)  Thus, I ask:   Can you make the warning a little less confrontational, so it has the desired effect yet in a kinder, gentler manner? Can you make the warning point to, or somehow list, the questions which were poorly judged -- as Shog has done below? Can you make it clear that the warning only applies to this (or whichever) site and in no way is a reflection on contributions made on other sites?   I sincerely believe this "feature" needs some tempering.

When I  question, It says following:     Wait! Some of your past questions have not been well-received, and   you're in danger of being blocked from asking any more.      For help formulating a clear, useful question, see: How do I ask a   good question?      Also, edit your previous questions to improve formatting and clarity.   Here is screen-shot:   So, What should I do? (How long to wait?)


I need to check the U.K postcode against a list.  The U.K postcode is of a standard format but the list only contains the outward section that I need to check against.  The list contains a series of outward postcode with also some data relating to this outward postcode, so for example  AL     St Albans B      Birmingham BT     Belfast TR     Taunton TR21    Taunton X TR22    Taunton Y   My aim is that when I get a postcode, for example B20 7TP, I can search and find Birmingham.  Any ideas??  The question is different to the ones referred to as possible answers, but in my case I need to check a full postcode against just the outward postcode.

I'm after a regex that will validate a full complex UK postcode only within an input string. All of the uncommon postcode forms must be covered as well as the usual. For instance:  Matches   CW3 9SS SE5 0EG SE50EG se5 0eg WC2H 7LT   No Match   aWC2H 7LT WC2H 7LTa WC2H   How do I solve this problem?


“” on Stack Overflow seems (to me) to be asking much the same question as “” on Super User. That second question , but of course that’s not on Stack Overflow, and I’m not sure that such a question doesn’t belong on Stack Overflow (nor even that it instead doesn’t belong on Super User).  I don’t necessarily like the idea of an answer simply saying “See the answer to this question on Super User” (and indeed, although I did attempt to post such an answer, it was deemed Trivial and converted to a comment), but in the case of a user coming across this question (say) by means of searching, I’d like there to at least be a link to the answer on Super User so that the question isn’t a dead end. What’s generally supposed to be done in this sort of case?

What's the right course of action for cross-site duplicates?  There are two flavors:   A question is posted which belongs on another site and ends up already having been asked there. I can't find an example right now, but it's bound to happen soon if it hasn't already. The same question is posted in two places at the same time. Take  for example, which is a duplicate of , posted within a half hour of each other by the same user.   Possible actions:   Move it to the proper site and close it once it gets there as a duplicate. Provide a way to close it right away as a cross-site duplicate, without moving it first. Flag it and let a moderator merge them. Close it as "no longer relevant" or something else.   Additionally, flavor 2 is a bit of a special case; perhaps the question really spans both sites in terms of content and intended audience. Should multiple-postings in this case be allowed? If so, should they somehow be linked to each other? If not, how do we avoid a migration war?


I just have a question about rational numbers and their decimal expansion. I have x, which is an rational number and that $x=\frac{a}{b}$, where $a$ and $b$ are integers and $b$ is not equal $0$. How can I show that the decimal expansion of $x$ repeats?

I am trying to figure out how to prove that all rational numbers are either terminating decimal or repeating decimal numerals, but I am having a great difficulty in doing so. Any help will be greatly appreciated.


So when I export my models as FBX, their materials don’t seem to have colors in them even though I applied it in Blender. What’s the solution to this?

I used node textures in a mesh I exported to .FBX.  I then imported it into Unreal Engine 4 and it didn't import any textures; I clicked the Upload Textures option in Unreal Engine.  Is there something I'm doing wrong or is it Blender?


I think this might be a trick question, even if it is I am still not sure how to write it.  Let G be a group  Let H be a subgroup of G  I wish to show that if $|G:H|=n$ with $n>1$ then G has a quotient (or factor to some) group $G/N$ which is isomorphic to a subgroup $I$ of the Symmetric group $S_n$ with $|I|>1$  I'm not actually sure what N is, I think it is a typo for H. If it is supposed to be H then (this is the bit I am not sure how to write)  I want to say something like $|G:H|$ is the number of left cosets of H in G, and the quotient group is just the group of them, if that group is of order N then of course it is isomorphic to a subgroup of the symmetric group on n items, the symmetric group contains every group as a subgroup we could have on n things.  If $N$ is intended, this usually denotes a normal subgroup, I am not sure how to interpret the question.  If you can interpret this correctly please do say how you interpreted it, hints are great when you are stuck on the question, not reading the question.  I don't think my "of course it is isomorphic to a subgroup" is the answer, it is from the wrong chapter's part (Rings Fields and Groups) to be so trivial.

If H is a subgroup of G ( | G:H |=n, n > 1), then how can you show that G has a factor group G/N which is isomorphic to a subgroup D of the symmetric group Sn with |D| > 1.  I've been looking at Cayley's Theorem but it's not specific to the factor groups.


Consider a circuit with a generator and an inductor as shown -     Now, the e.m.f. that both the generator and the inductor create are due to changing magnetic fields. So, the electric field in the wires is non-conservative.   So, is Kirchoff's Voltage Law or Loop rule valid here? What is the meaning of "potential difference" across A and B or $v_\mathrm{L}$? Is it the work done to move from A to B through the wire? Is $\mathcal{E} = v_\mathrm{L}$ true or not?  For the difference between e.m.f. and electric potential, see .  EDIT-  (From comments) I'm trying to understand the $\nabla$ operator but an explanation not involving it would be highly appreciated. There are many students at high-school level(like me) who do not understand $\nabla$ as it is not taught at that level but Kirchoff's law and inductance are taught. It would be of great help if someone gives an explanation at a lower mathematics level(which I believe can be done). The answer can include integration.

As we know, the  are applicable for conservative electric fields. Now it is applicable for circuits where inductors are present but the field there is not .  So how are the  Kirchhoff's laws  applicable there?


When a question on meta has been asked before, it is closed as a duplicate.  This is true even if the original:   does not have an answer at all; or, does not have an answer that fully addresses the problem (anybody can "answer" a question about why a feature exists or doesn't exist or works the way it does, for example, but that doesn't mean the asker's problem has been "solved").   When the question is closed, it inherits this text in the body:     This question is an exact duplicate of:   However after the question (and any comments), with my emphasis on the points I don't like:     This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.   I think it is more likely on meta than anywhere else that the question has been asked before but does not have an answer (), and happens often when people think a question is so old that it is being ignored, and a "new" question might breathe some life into the issue.  What I don't like about the current wording is that (a) it is logically and factually incorrect in cases like this, and (b) it encourages the asker to ask the same question a third time - not only if no answers exist on the original, but also if they don't think the answers there address their concern(s).  The point of closing as a duplicate is because the question has been asked before - not that it has been answered before (or answered to the satisfaction of the new asker). My suggestion is to change the wording so that it's clear that a question shouldn't be asked again even if the original hasn't been answered (or answered to the asker's satisfaction). Since the asker only sees this text after 5 community members (or < 5 + a moderator) have deemed that the question is, in fact, a duplicate, perhaps as simple as:     This question has been asked before.   Or if we want to encourage the edit and reopen path:     This question has been asked before. If you feel there are aspects of the issue not covered by the original, please edit those details into your question.

This request was sparked . The vote to close as a duplicate on meta, in contrast to the main site, does not require for the duplicate to have an answer. Yet, the closure message still says:     This question has been asked before and already has an answer.    ...even when this is not the case. Perhaps we should either only show this particular sentence if there is indeed an answer, or remove this altogether for meta.   Note: I fear this might be a duplicate request, but I was unable to find one. (Not even one without an answer :) )


My table is:     id home datetime player resource     1 10 04/03/2009 john 399   2 11 04/03/2009 juliet 244   5 12 04/03/2009 borat 555   3 10 03/03/2009 john 300   4 11 03/03/2009 juliet 200   6 12 03/03/2009 borat 500   7 13 24/12/2008 borat 600   8 13 01/01/2009 borat 700     I need to select each distinct home holding the maximum value of datetime. Result would be:     id home datetime player resource     1 10 04/03/2009 john 399   2 11 04/03/2009 juliet 244   5 12 04/03/2009 borat 555   8 13 01/01/2009 borat 700     I have tried: -- 1 ..by the MySQL manual:   SELECT DISTINCT   home,   id,   datetime AS dt,   player,   resource FROM topten t1 WHERE datetime = (SELECT   MAX(t2.datetime) FROM topten t2 GROUP BY home) GROUP BY datetime ORDER BY datetime DESC  Doesn't work. Result-set has 130 rows although database holds 187. Result includes some duplicates of home. -- 2 ..join  SELECT   s1.id,   s1.home,   s1.datetime,   s1.player,   s1.resource FROM topten s1 JOIN (SELECT   id,   MAX(datetime) AS dt FROM topten GROUP BY id) AS s2   ON s1.id = s2.id ORDER BY datetime   Nope. Gives all the records. -- 3 ..something exotic:   With various results.


Is it possible to create an extension method that takes no parameters? I am new to using extension methods and have only seen them using parameters.  From :  public static class StringExtensions {     private static Random random = new Random();      public static string ToRandomCase(this string text)     {         string result = "";          for (int index = 0; index < text.Length; index++)         {             if (random.Next(2) == 0)             {                 result += text.Substring(index, 1).ToUpper();             }             else             {                 result += text.Substring(index, 1).ToLower();             }                         }          return result;     } }   And also from :     "Their first parameter specifies which type the method operates on, and the parameter is preceded by the this modifier."   Both of these, and especially the code examples on each site (only one posted here), seem to indicate that extension methods must have at least one parameter, because that parameter is used to attach the this keyword to, allowing the method to register as an extension to the class or type which follows it. For example,  public static StringExtension(this String a) {/*stuff*/}   (If this is the case, then that also means that the first parameter in an extension method must accept an instance of the class it's extending, so I am probably wrong.)

I'm a fan of extension methods in C#, but haven't had any success adding an extension method to a static class, such as Console.  For example, if I want to add an extension to Console, called 'WriteBlueLine', so that I can go:  Console.WriteBlueLine("This text is blue");   I tried this by adding a local, public static method, with Console as a 'this' parameter... but no dice!      public static class Helpers {     public static void WriteBlueLine(this Console c, string text)     {         Console.ForegroundColor = ConsoleColor.Blue;         Console.WriteLine(text);         Console.ResetColor();     } }   This didn't add a 'WriteBlueLine' method to Console... am I doing it wrong? Or asking for the impossible?


How can I make Guake start on boot?  Guake is installed and works fine via manual startup (typing guake in a terminal works e.g).  When I press Super and type "Startup Applications" Guake is there, using the command "guake" (simple one should think. But no). It doesn't work. I can not open Guake via the keyboard shortcut and top in terminal does not show anything that says "guake", that is until I open it manually.  I have also tried sudo cp /usr/share/applications/guake.desktop /etc/xdg/autostart/ but with no result.  Any ideas?  I am using , but don't think it is related to my specific system since I have encountered the problem on my previous systems (also Ubuntu based however), but haven't bothered researching it till now.

I've Ubuntu 12.04 installed.  I've added guake to startup applications but it doesn't work. All programs listed in startup application are working except guake. What should I do?


When using the "non-informative" prior $\pi(\mu,\sigma)\propto\frac{1}{\sigma^2}$ where $\pi(\mu)\propto1$ and $\pi(\sigma^2)\propto\frac{1}{\sigma^2}$ Where is the no information for the parameter? and if would be informative prior, Where one would see the 'information' given?  I saw the definition on Wikipedia  and there mentions 'An informative prior expresses specific, definite $\color{blue}{\text{information}}$ about a variable.' My question is where is this $\color{blue}{\text{information}}$ given in my particular example for instance? Could you help please?

Inspired by a comment from :  What do we consider "uninformative" in a prior - and what information is still contained in a supposedly uninformative prior?  I generally see the prior in an analysis where it's either a frequentist-type analysis trying to borrow some nice parts from Bayesian analysis (be it some easier interpretation all the way to 'its the hot thing to do'), the specified prior is a uniform distribution across the bounds of the effect measure, centered on 0. But even that asserts a shape to the prior - it just happens to be flat.  Is there a better uninformative prior to use?


I have recently created portfolio website for myself, using WordPress. However after adding it to google console. It says that my website isn't mobile friendly. However, clearly when you go to the website on a mobile device, it works perfectly.  I'm a beginner in terms of web dev. I hope there is an east fix. Thank you all for your help. Website: Danielgola.com GSC screenshot.

In search results google reports "this page is not mobile-friendly". I want to fix this.   when I test my website in the mobile-friendly test, it reports:   Content wider than screen. Clickable elements too close together.   How can I find the items/content that are creating these problems?  Any help would be appreciated.


I'm trying to write a report, and I've defined that it defines 3 numbered levels (section, subsection & subsusection) using \setcounter{secnumdepth}{3}. But how can I make these subsubsections visible in the TOC, please ? I can't find a solution to deal that.  Thanks in advance !

So we have something like:  \documentclass{article} \setcounter{secnumdepth}{2} \setcounter{tocdepth}{2} \usepackage{amsmath}  \begin{document}  \tableofcontents  \section{Brushless Motor Fundamentals} \subsection{Brushless Motor Operation} \subsubsection{DC Motor Operation} Torque is generated in DC motors from the magnetic force, also known as the Lorentz force, which is produced when an electric current is passed through a coil in a magnetic field. This force is given by $F=q[E+(v\times B)]$, where $F$ is the force perpendicular to the coil, $E$ is the electric field in the coil, $B$ is the magnetic field, and $v$ is the velocity of the charged particles in the coil. From mechanics, torque is $\tau=F\times r$.  \section{Brushless Motor Fundamentals 2} \subsection{Brushless Motor Operation} \subsubsection{DC Motor Operation 2} If the electrical force is ignored and the remaining magnetic force is used, with the assumption that $v$ is perpendicular to $B$, we find that $\tau=qvBrsin\theta$.  \end{document}   How to show subsubsections and paragraphs in TOC?


I have problem in referencing number for main figure label. I have this code :  \begin{figure}[t] \centering  \subfigure[11a's signal strength]{     \includegraphics[scale =0.25] {fig/cdf_sig11a.eps}     \label{cdf_sig11a} } \hspace{0.2cm} \subfigure[11n's signal strength]{     \includegraphics[scale =0.25] {fig/cdf_sig11n.eps}     \label{cdf_sig11n} }  \label{coverage_comparison} \caption{Coverage comparison in various location} \end{figure}   When I use Fig. \ref{coverage_comparison}, it shows Fig. II-C. It should be Fig. 4.   This only happens when I use subfigure and use main figure label but if I use Fig. \ref{cdf_sig11n}, it shows correct reference number Fig. 4(b).  How to solve this problem?

I'm trying to understand why I cannot effectively reference figures or equations that I have defined with labels.  For example:  \begin{figure}   \label{fig:area_Treasuries}   \caption{Treasuries as a portion of total financial flows.}   \centering   \includegraphics[width=0.75\textwidth]{graphs/Area_Treasuries.png} \end{figure}  \paragraph{} Figure~\ref{fig:area_Treasuries} presents Treasuries (both flowing into and out of the United States) as a share of total financial flows.  From 1985 to 2010, Treasuries account for, on average, 53.2\% of total financial flows.   With the above code, I get this warning:      LaTeX Warning: Reference `fig:area_Treasuries' on page 37 undefined on   input line 477.   The result is "Figure ?? presents Treasuries..."  Why is this happening?  Related, I don't understand why I can't reference, say, an equation before (I mean physically above in the text) the actual equation.  Isn't this what compiling multiple times and cross references is supposed to take care of?


The idea of a group as a category with one element confuses me. Let us take the set of natural numbers. This set is a group under the operation of multiplication. Now if we consider the set of natural numbers as a group what is the one element that it will have?   I also need clarification on how the composition becomes the product.

Is it possible to define a group as a category?  What exactly will be objects of this category and how will we say that every element should have an inverse?


As I understand I can define new commands using  \newcommand{name}[num]{definition}   An example is   \newcommand{\E}[1]{\mathbf{E}_{#1}}   Now I can use this in my text as follows  \E{\theta}   to print \mathbf{E}_\theta  Is it possible to pass the argument as a subscript instead of coding it between braces?   I would like to code it as  \E_\theta   which is more natural for me. I would also like to add a second argument so that I get  \mathbf{E}_\theta[X]   by coding it with  \E_\theta{X}

Accoring to Joseph Wright's answer at   The k-type argument has recently been adjusted: you now want e-type  Questions:  What is the functionality of the new e-type argument and how does it differ from the previous k-type argument?  The 2016-11-21 version of the xparse documentation does not mention the k-type argument at all. Is the plan to leave the earlier k functionality intact (but deprecated so no documentation) or will it eventually be removed and any usage of that should eliminated? If the plan is for it to be removed, how long will the older k-type argument functionality be kept in xparse.   Code: Example of the k-type argument from . Would be useful to see how this would be modified to use the new e-type argument. \documentclass{article}  \usepackage{amsmath} \usepackage{xparse} \usepackage{xcolor}  \NewDocumentCommand\MyMacro{k_}{%     \IfNoValueTF{#1}{%         \mathbf{A}     }{%         A_{\textcolor{red}{#1}}     }% }  \begin{document}  With a subscript: $\MyMacro_{\pi}$   Without any subscript: $\MyMacro$   \end{document}


I already have a Sentinel-2 tile imported in QGIS and a shapefile corresponding to the area I want. How do I cut the Sentinel 2 file?

In QGIS I would like to clip a raster precipitation layer using an admin boundary layer that is vector data. However the Geoprocessing tools seem to be usable only for vector data. How can I clip this precipitation layer?


I managed to delete all of my initrd images in order to make space for new updates (I know - stupid)- is there a way to upload them back or do I have to reinstall my OS completely? I don't have the live cd, but I could download it onto a usb drive I suppose. And when I start my computer I can only access the grub of course.  I am fairly new to linux so please keep that in mind.  Thank you for your help, I really appreciate it, I'm going crazy without my computer.

I accidentally deleted the initrd image on my system.  How do I restore it?


How can I create a lot of spheres? I have a csv file with x,y,z,r (radius) coordinates. I saw some topics but nothing worked to me. I tried ask a question, but this was classified as "Your post has been associated with a similar question. If this question doesn’t resolve your question, ask a new one." I read some topics but nothing worked to me, so that I opened a new topic. I have this code: import bpy  text_file = open("C:\\Users\\nabuc\\Desktop\\1700txt - copia.txt", "r") lines = []  #Read in contents to a list for line in text_file:     lines.append(line.strip())  #create spheres for e in lines: temp=e.split(',') bpy.ops.mesh.primitive_uv_sphere_add(segments = 64, ring_count = 32, location=(float(temp[0]),float(temp[1]),float(temp[2])),size = float(temp[3])) bpy.ops.object.shade_smooth() text_file.close()  but: Python:   File "C:\Users\nabuc\Documents\untitled.blend\Text", line 12 temp=e.split(',') ^ IndentationError: expected an indented block location: :-1 thanks for your help EDIT 2 (I can't edit code on answer) To avoid this indentation error, I edit as: import bpy  text_file = open("C:\\Users\\nabuc\\Desktop\\1700txt - copia.txt", "r") lines = []  #Read in contents to a list for line in text_file:     lines.append(line.strip())  #create spheres for e in lines:     temp=e.split(',')     bpy.ops.mesh.primitive_uv_sphere_add(segments = 64, ring_count = 32, location=(float(temp[0]),float(temp[1]),float(temp[2])),size =         float(temp[3]))     bpy.ops.object.shade_smooth()     text_file.close()  but this return: Python script failed, check the message in the system console

Is it hard to do a script where I can create a lot of spheres? I have a csv file with x,y,z,r (radius) coordinates. I saw some topics but nothing worked to me.


As far as I'm informed, some amount of schooling is mandatory for children in the UK and many other civilized countries, and their parents could get into a lot of trouble, if the children did not attend the school.  How is it ensured that parents of children attending Hogwarts or other wizarding schools don't get into the same king of trouble, since their kids do not attend a regular "muggle" school?

So a bunch of kids all of a sudden "go missing" from school.  Harry Potter having attended school for a couple of years before starting at Hogwarts, one semester just doesn't show up.  How is this solved? What do parents say when a school teacher calls and wonders where their pupil is?  I assume that Hogwarts isn't an officially recognized school (though perhaps it is?), and due to education being compulsory, someone would do the math and find that low-hundreds of kids go missing in the transition from primary to secondary school every year.


I was wondering if there could be a a little difference (for performance issues) between multiplication and division in a simple compute like in:   float thing = Mouse.getDY() * 0.1f; float otherThing = Mouse.getDY() / 10f;   when this kind of things happens a lot, of course, for example in camera position calculation in a 3D game (lwjgl).  Thanks !

Here's a silly fun question:  Let's say we have to perform a simple operation where we need half of the value of a variable. There are typically two ways of doing this:  y = x / 2.0; // or... y = x * 0.5;   Assuming we're using the standard operators provided with the language, which one has better performance?  I'm guessing multiplication is typically better so I try to stick to that when I code, but I would like to confirm this.   Although personally I'm interested in the answer for Python 2.4-2.5, feel free to also post an answer for other languages! And if you'd like, feel free to post other fancier ways (like using bitwise shift operators) as well.


I'm having trouble figuring out how to link one value to another via a driver. Here's what I'm trying to do:    I'm making my own node group and I want to bypass having to tab into the group to change the value of XYZ rotation, but for reasons unknown to me I can't just connect the X rotation to my x_rotation value via a driver. This is the driver set up on the X rotation:    Is it just a matter of an incorrect path or am I doing something entirely wrong? Is there a different way to accomplish what I want?

Sometimes I create Material Groups to be used as appendable reusable assets. Unfortunately sometimes parameters I want to control using a Group Node's slider are not available for routing to a Group Node's input socket. Some examples of these are the Color Ramp and the Mapping Node.  So here's what I want to do:    Can this be done? If so, how?  Thanks!


Hi experienced colleagues,  I have this challenge with my drupal site which is still under development. Now i can not even log in to my site.  Below is the message displayed to me  PDOException: SQLSTATE[42S02]: Base table or view not found: 1146 Table 'connect_health.trigger_assignments' doesn't exist: SELECT ta.aid, a.type, a.label FROM {trigger_assignments} ta LEFT JOIN {actions} a ON ta.aid = a.aid WHERE ta.hook = :hook ORDER BY ta.weight; Array ( [:hook] => node_view ) in trigger_get_assigned_actions() (line 169 of C:\wamp\www\ConnectHealth\modules\trigger\trigger.module).  Please help me out.

I have Drupal running on MariaDB 5.5.33. When I run update.php (after upgrade to Drupal 7.28 from Drupal 6) I get an error:     Failed: PDOException: SQLSTATE[42S02]: Base table or view not found: 1146 Table 'webdb.location_country' doesn't exist: CREATE TABLE {location_country} ( code CHAR(2) NOT NULL COMMENT 'Primary Key: Two letter ISO Country Code', name VARCHAR(255) NOT NULL DEFAULT '' COMMENT 'Full Country Name ', PRIMARY KEY (code) ) ENGINE = InnoDB DEFAULT CHARACTER SET utf8 COMMENT 'Country data managed by location.module.'; Array ( ) indb_create_table() (line 2720 of /home/web/public_html/includes/database/database.inc).   When I try to run command     CREATE TABLE {location_country} ( code CHAR(2) NOT NULL COMMENT 'Primary Key: Two letter ISO Country Code', name VARCHAR(255) NOT NULL DEFAULT '' COMMENT 'Full Country Name ', PRIMARY KEY (code) ) ENGINE = InnoDB DEFAULT CHARACTER SET utf8 COMMENT 'Country data managed by location.module.';   in phpMyAdmin I get an error     #1064 - You have an error in your SQL syntax; check the manual that corresponds to your MariaDB server version for the right syntax to use near '{location_country} ( code CHAR(2) NOT NULL COMMENT 'Primary Key: Two letter IS' at line 1   But I wasn't able to find out where is the problem.


I'm writing a program that needs a folder to be created in the user's Documents folder. It runs perfectly the first time it is executed but fails if it is executed more than once. I'm using the os.makedirs function and it fails because the folder already exists after the first execution. How do I skip the os.makedirs function if the folder already exists?  path = "/home/" + username + "/Documents/Keys"     try:         os.makedirs(path)         filename = "file%s.txt" % random         with open("/home/" + str(username) + "/Documents/Keys/" + filename, 'w') as f:             f.write(str(createkey) + " " + random + " " +  d)             sys.exit()     except OSError:         print "There was a problem generating the key"   Expected Result: If the folder has already been created; it should skip over the os.makedirs function, and execute the rest of the code.

What is the most elegant way to check if the directory a file is going to be written to exists, and if not, create the directory using Python? Here is what I tried:  import os  file_path = "/my/directory/filename.txt" directory = os.path.dirname(file_path)  try:     os.stat(directory) except:     os.mkdir(directory)         f = file(filename)   Somehow, I missed os.path.exists (thanks kanja, Blair, and Douglas). This is what I have now:  def ensure_dir(file_path):     directory = os.path.dirname(file_path)     if not os.path.exists(directory):         os.makedirs(directory)   Is there a flag for "open", that makes this happen automatically?


How can I program a command \mycommand such, that a white space is set printed behind it if a white space is used after it and no white space is printed if no white space is used (e.g. when punctuation is used) without using {} after the command usage. I understand that this is kind of against how the LaTeX syntax works, but maybe there is a way around it.  With  \documentclass[a4paper,10pt]{article} \usepackage[utf8]{inputenc} \newcommand{\mycommand}[1][i]{\ensuremath{\frac{#1}{2}}} \begin{document} This \mycommand[1] is \mycommand, \mycommand and \mycommand. \end{document}   I get    but I would like to get    without having to add {} behind the third \mycommand.

I have a definition:  \newcommand{\arnold}{Arnold Schwarzenegger}   When I refer to it by:  \arnold is a   it is rendered as:   Arnold Schwarzeneggeris a    In order to have a space in front of "is" I would need to write  \arnold\ is a   Is there some other shorter way?


the print statement     for(i = 0; i<n; i++) //printing     {printf("Name: %s\nAddress: %s\nOccupation: %s\nAge: %d", p[i].name, p[i].add, p[i].occ, p[i].age);}

Is there any good example to give the difference between a struct and a union? Basically I know that struct uses all the memory of its member and union uses the largest members memory space. Is there any other OS level difference?


I have installed the kde-full package on Ubuntu 12.04 in order to switch to the KDE plasma workspace as well as install the other applications. It works well with just one problem that I can't understand.  Whenever I start a new session nautilus opens up my home folder and I have to manually close it.  It's pretty annoying, but I don't want to uninstall nautilus just to stop this behavior.  I have already looked into my ~/.bashrc and I haven't seen any additions which would make nautilus do this.  I've found the answer in a similar question , I verified it and it works for me, so I will close this question.

Recentlly every time that laptop turns on and  kde loads, nautilus will opened automatically. why ?  I installed kde on ubuntu 11.10.


I have a list of numbers: L = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12]  I found how to create a list of lists: new_L = [[1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11], [12]]  But that is not what I need. I need to create (x) times (y) list of lists. For example, as a 3 times 4 list of lists: new_L_2 = [[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12]]  Or a 2*6 list of lists: new_L_3 = [[1, 2, 3, 4, 5, 6], [7, 8, 9, 10, 11, 12]]  How can I make it? Thanks in advance.

I have a list of arbitrary length, and I need to split it up into equal size chunks and operate on it. There are some obvious ways to do this, like keeping a counter and two lists, and when the second list fills up, add it to the first list and empty the second list for the next round of data, but this is potentially extremely expensive.  I was wondering if anyone had a good solution to this for lists of any length, e.g. using generators.  I was looking for something useful in itertools but I couldn't find anything obviously useful. Might've missed it, though.  Related question:


I need shapefiles of Indian states that of 2011 which has almost 671 districts of India. Can anyone please help me?

I need a shapefile for India which is up-to-date to display the regional borders. By up-to-date (in 2014), I mean that it includes Telangana as a state. Many shapefiles that I downloaded do not have Telangana as a state as it was partitioned a month ago, it is displayed as part of Andhrapradesh.  So I need the latest shapefile.


a. He likes me because I am funny, not good-looking. b. He likes me because I am funny, not because I am good-looking.  In which case am I good-looking? In which case is it possible that I am good-looking? (One can't tell for sure)  Is there any ambiguity in those sentences?  Many thanks

John did not come because of the rain.   This sentence seems to allow the following two completely different interpretations.   John did not come. And the reason was the rain. John came. But the reason was not the rain.    Questions  A.  How does this ambiguity arise? Is it because of negation?  B.  What is the easiest way to avoid this ambiguity?


I am a British citizen living in the UK but have a fiancee living outside the country. She was banned in 2009 when she applied to come to study in the UK. Her agent included a fake bank statement which led to the 10 year ban.  We are planning to marry sometime in 2019 which makes 10 years after the ban, can you please advice us if she might have difficulty gaining entrance to the UK or will this be a straight forward application as long as she mentions that she was banned and refused entry 10 years ago and now all current documents are genuine?

I am an Indian national and was refused a UK visa in 2009 in NYC and given a 10 year ban, but now I'm a US citizen.    Would the ban still apply if I wanted to visit the UK?


Let $A_1$, $B_1$, $C_1$, and $D_1$ - midpoints of the sides $AB$, $BC$, $CD$ and $DA$ convex quadrilateral $AВСD$. Directs $AC_1$, $ВD_1$, $CA_1$ and $DВ_1$ - divide it by $5$ quadrilaterals and $4$ triangles. Prove that the area of the central quadrilateral is the sum of squares of $4$ triangles.    I think, it should be proved in such a way: the square of quadrilateral is finding out by such formula: $S=(p-a)(p-b)(p-c)-abcd\cos^2\left(\frac{A+B}{2}\right)$. If we will prove that the sum of big triangles are the same as the square of $ABCD$, it will be automatically proved area of the central quadrilateral is the sum of areas of small triangles.

In the quadrangle $ABCD$, the points $E,F,G,H$ are the midpoints  of respectively $AB, BC, CD, DA$. We know that area $\triangle AHL=a$, $\triangle DIG=b$, $\triangle FJC=c$, $\triangle EBK=d$. Prove that area $IJKL=a+b+c+d$.


Explanation for the questions in the title: According to the the (special theory of) Relativity, if an observer is stationary and sees a fast moving object then time runs faster for the observer compared to the mover.  For example, persons 'A' & 'B' are somewhere far away in universe standing on a platform. There is nothing nearby for several light years. Hypothetically assume that 'A' is standing on the platform and 'B' boards the rocket and flies away with a significant % of light speed. Due to which the time runs 1.67 faster for 'A' compared to 'B'. When 'B' returns to see 'A' after 10 years, 'A' has already passed 16.7 years. This is the premises of Relativity.      Now, my confusion starts here. Why only 'A' is considered "stationary" and 'B' as "moving"? Simulate the situation in other way for the same event. With respect to 'B', rocket is stationary and 'A' moves away with platform. And finally 'A' "returns" to see 'B'. In such case, 'B' should have grown older by 1.67 times.  But neither that happens nor both 'A' & 'B' age equally. It's just that 'B' remains younger. On the funny note, the premises of relativity here should be who travels relative to other and not who burns the fuel! :-) I have referred few questions in this forum, but couldn't get the answer.

I read a lot about the classical twin paradox recently. What confuses me is that some authors claim that it can be resolved within , others say that you need . Now, what is true (and why)?


I cannot accept that $\sum_{n=1}^\infty n = -\frac{1}{12}$.  It should be that such a sum is divergent.  That it is divergent is useful for the Test for Divergence in many such problems.  I feel like the sum of -1/12 does something wrong.  What is actually happening?

$\displaystyle\sum_{n=1}^\infty \frac{1}{n^s}$ only converges to $\zeta(s)$ if $\text{Re}(s) > 1$.  Why should analytically continuing to $\zeta(-1)$ give the right answer?