I have two PCs running Win7 sitting next to each other. They both have identical TP-Link WiFi PCI cards and are connected to an Enkom router which is in the same room as the computers (which claims to have 802.11g WiFi).   I've set file sharing between the computers (not Homegroup), set "Enable file sharing for devices that use 40- or 56-bit encryption" in Advanced file sharing settings, disabled TCP autotuning and turned off Remote Differential Compression.   Regardless of the changes I made, I can't get the transfer rate between the computers to go above 350KBps either way (when a copy dialog is initially opened, it starts at 512KBps but that immediately drops below 400KBps).  Is there anything else I can try doing? My Internet download speeds are literally faster (over Wifi) so this makes no sense.

I have a router with ADSL Pentagram Cerberus 6331-42. Is it normal to have transfer speeds between two computers of max 1MB/s (not 1 Mbit)? How can I set my router up to make it faster at transferring data in my local WiFi network?  I have a PC and a laptop. Both are running Windows 7. I don't use a firewall. I've set the network area up correctly; I can see other computers.  Is it possible to make the router faster by changing its values? I don't use secure encryption such as WPA or WEP; only MAC filtering.  My values in Interface Setup > Wireless are:       Here are my thoughts after few years I've published this topic:    use 5Ghz bandwidth if possible  use range extender if Your router is too far  try wifi analyzer app for mobile phone to check what channel is the less used


I want to prevent all users (including root) from mounting anything under a specific destination (e.g. /tmp) by SELinux or any other Linux tool, is this possible? And how would it be done?  Regarding the proposed duplicate:  -- this is not what I want.   First of all it completely ignores SELinux when talking about the root user. Second it talks about removing "mounting permissions". That isn't what I try to achieve. I am actually talking more about "denying folder permissions" than mounting permissions. The closest to what I'm trying is  which just does not talk about folder access, and specifically about denying "mounting" to that folder.  If I would go with an possible solution instead of a question I would ask: "Is there a SELinux Domain to restrict mounting?"

Consider the following situation:  /dev/sda1, /dev/sda2, /dev/sda3 are 3 partitions of the /dev/sda disk.  Ubuntu is installed on sda1 and /home mounted on sda2.  Only one user foo on Ubuntu system so its home folder is /home/foo on /dev/sda2.  I'm going (and I know how) to install another distro (e.g. a Lubuntu) on /dev/sda3 with only one user blah.  My question is:  How to do that in such a way that the user blah can not access neither mount the partitions /dev/sda1 and /dev/sda2?  Is it enough to remove any entry referencing it on fdisk?  I'd like to make those 2 partitions only available for the user foo on Ubuntu.  I'd like that user blah wouldn't have access even using sudo.  My idea is, while installing the new distro on sda3 just don't ask to mount the other partitions so that the disk for the new distro is only sda3.


So when you're looking for questions, you can filter questions based on a certain tag, by simply writing that tag in the search.  However, can you do the exact opposite of that, i.e, certain tags filtered out? That would be very helpful for me, as I have to scroll pages after pages of the same tag before I can find an answerable question.  Remember, this is different from looking up a certain tag. I can answer questions with every tag but a certain one.

I know you can select a tag and then click on unanswered to view the unanswered questions for that tag.  But is there a way to view questions only for a certain set of tags > 1 tag?  Mainly I'd like the union of tag1 with tag2 with tag3 with tag4. But also the intersection of tags would be nice as well.


I recently installed Ubuntu 18.04 on my home desktop and went to upgrade my copy of Firefox to the new Quantum version.  My computer is set up with two internal hard drives; and SSD for the OS and a 1tb WD hard drive for storage. The 'old' version of Firefox could see or navigate to the internal storage drive... the Quantum version can't see/find that drive OR any external drives attached to my computer. Google Chrome has no issues with the internal drive, and I don't think the drive is at fault since Chrome can find and save to it, and the old version of Firefox (now re-installed) can find and save to the internal drive... so what's going on with Firefox Quantum?  Mount at system startup is checked Show in use interface is checked Require additional authorization is NOT checked NO Display Name NO Icon Name NO Symbolic Icon Name unamed field has these properties: nosuid,nodev,nofail,x-gvfs-show Mount Point = /mnt/Storage_Disc_01 Identify As = /dev/disk/by-label/Storage_Disc_01 Fiesystem Type = auto  What am I doing wrong, or can Firefox Quantum only see the drive it's installed on?

I have Ubuntu 18.04 LTS installed. I inserted USB-flash to my laptop. It was automounted to /media/username/DISKLABEL and opened in Nautilus. I can read and write objects to it. How can I access it from the application, which is installed as Snap? I tried snaps of the following applications such as gedit, arduino-mhall119, organize-my-files. All them show me errors if I navigate to /media folder:    Could not read the contents of Media Error opening the directory of '/media': permission denied  Output of active Snap  is below: $ snap interfaces  | grep -v ".*-$" Slot                             Plug :browser-support                 organize-my-files :core-support                    core:core-support-plug :cups-control                    gedit :desktop                         gedit,organize-my-files :desktop-legacy                  gedit,organize-my-files :gsettings                       gedit,organize-my-files :home                            arduino-mhall119,gedit,organize-my-files :network                         arduino-mhall119,gedit,organize-my-files,pulsemixer :opengl                          organize-my-files :pulseaudio                      organize-my-files,pulsemixer :unity7                          arduino-mhall119,gedit,organize-my-files :wayland                         gedit :x11                             arduino-mhall119,organize-my-files,pulsemixer gnome-3-26-1604:gnome-3-26-1604  gedit gtk-common-themes:gtk3-themes    gedit gtk-common-themes:icon-themes    gedit gtk-common-themes:sound-themes   gedit -                                arduino-mhall119:serial-port -                                gedit:avahi-observe -                                gedit:mount-observe  Updates:  connecting mount-observe to Gedit with snap connect gedit:mount-observe does not help. it seems that we need special Snap with support of  interface.


As the attached picture describe, this is what I am trying to replicate. Now the text does not need to be the same, since I am going to write different content inside but I really like the way this Figure is presented, with a title in between two lines.    Are they using a package I am missing or a strategy I am not aware of ?

I'd like to style a caption in a specific way, but I can't seem to figure out the proper settings to do so.  First off, I'd like to change the label from "Listing" to "Algorithm" when I use \captionof{lstlisting}{foo}  Secondly, I'd like to make the "Algorithm 1" part be bold with the rest of the label non boldface  Thirdly, I'd like to have a line above the caption.  Here's an image of something akin to what I'd like to achieve, and following is my code.    And this is what I have:    \documentclass{article}  \usepackage{listings} \usepackage{caption} \usepackage{geometry} \usepackage{DejaVuSans} \usepackage{DejaVuSansMono} \renewcommand*\familydefault{\ttdefault}  \geometry{left=1.0in,right=1.0in,top=1.0in,bottom=1.0in }  \lstset{   frame=top,frame=bottom,   basicstyle=\small\normalfont\sffamily,    % the size of the fonts that are used for the code   stepnumber=1,                           % the step between two line-numbers. If it is 1 each line will be numbered   numbersep=10pt,                         % how far the line-numbers are from the code   tabsize=2,                              % tab size in blank spaces   extendedchars=true,                     %   breaklines=true,                        % sets automatic line breaking   captionpos=t,                           % sets the caption-position to top   mathescape=true,   stringstyle=\color{white}\ttfamily, % Farbe der String   showspaces=false,           % Leerzeichen anzeigen ?   showtabs=false,             % Tabs anzeigen ?   xleftmargin=17pt,   framexleftmargin=17pt,   framexrightmargin=17pt,   framexbottommargin=5pt,   framextopmargin=5pt,   showstringspaces=false      % Leerzeichen in Strings anzeigen ?  }  \DeclareCaptionFormat{listing}{#1#2#3} \captionsetup[lstlisting]{format=listing,singlelinecheck=false, margin=0pt, font={sf}}  \DeclareMathVersion{sans} \SetSymbolFont{operators}{sans}{OT1}{cmbr}{m}{n} \SetSymbolFont{letters}  {sans}{OML}{cmbrm}{m}{it} \SetSymbolFont{symbols}  {sans}{OMS}{cmbrs}{m}{n}  \lstnewenvironment{sflisting}[1][]   {\lstset{#1}\mathversion{sans}}{}   \begin{document}  \begin{sflisting}[caption=Spanning tree broadcast algorithm.] Initially $\langle M\rangle$ is in transit from $p_{r}$ to all its children in the spanning tree.  Code for $p_{r}$: 1:  upon receiving no message:                                          // first computation event by $p_{r}$ 2:      terminate  Code for $p_{i},\ 0\leq i\leq n-1,\ i\neq r$: 3:  upon receiving $\langle M\rangle$ from parent: 4:      send $\langle M\rangle$ to all children 5:      terminate \end{sflisting} \end{document}


I have been looking on the net for a textbook that only is about "Generating Functions" but did not found much. Is there any textbook just about "Generating Functions"?

I'm currently doing a research on generating functions, but I have only found few books on this topic. Can anyone provide references (if possible, trying to assess the level of math competence required) on generating functions?   Ideally, what is the context of the referenced book and further details to help to put the book itself in context would be much appreciated.


I'm studying Galois theory and I'm stuck in the following problem.  Let $L=K(x)$ the field of rational expresions over a field $K$ with $char(K)=p>0$. Let $\sigma\in Aut(L/K)$ the automorphism determinated by $\sigma(x)=x+1$. Show that $H:=\langle\sigma\rangle$ is a finite subgroup of $G=Aut(L/K)$, and find $\alpha\in L^H$ such that $L^G=K(\alpha)$.  For the first part, I need to write explicitly what is H?.   Any help will be appreciated !

Let $L = K(X)$ be the field of rational functions over a field $K$ with characteristic $p > 0$, and let $\sigma \in \operatorname{Aut}_K(L)$ with $\sigma(X) = X + 1$.   Show that $G = \left<\sigma\right>$ is finite, and determine a generator of $L^G = \{ f \in L: \rho(f) = f$ for all $\rho \in G \}$ over $K$.    My solution so far: $G = \left<\sigma\right>$ is finite because char $(K) = p > 0$ and therefore $\sigma^p (X) = X + p = X $.  A rational function unchanged under $\sigma$ will also be unchanged under any $\sigma^n$, so we don't have to worry about powers of $\sigma$ I think.   Any ideas for finding a generator? Thanks.


I left academia, but occasionally I am coauthor of a paper. These papers are in the area of research I did at university, but now I am working in a different industry.   Asked for affiliation, I am not sure whether I should state my company's name (although the company does not take part in the research and it is not done during work time) or if I should say "affiliation: none", which also seems strange.   My company has no policy (at least: as far as I know) that forbids to mention its name, nevertheless working there is not related to my research.

Recently my paper is reviewed (by a professor from independent third party) and accepted by a journal. But, my employer allows me to publish this paper only without its name there.  Publishing house is expecting affiliation for each author, i.e. I can not leave affiliation as blank.   What should I write as the affiliation?


A spring is a mechanical flexible element and has to absorb energy from outside gradually. We are manufacturing springs in helical shapes on a large scale. What is the reason behind this?

Cylindrical compression springs are everywhere and then some applications choose other forms like rectangular or unique polygonal form. What impact does the form of a compression spring have and how do you calculate an optimal solution?


Wolverine's claws are clearly longer than his hands. That being the case, shouldn't they retract into his forearms and prevent his wrists from bending?

In answering this question  I couldn't find anything that actually described what caused Wolverines claws to pop out. I've seen pictures of x-rays and there doesn't seem to be extra bones to help. I would assume that there are extra muscles involved but this is never mentioned. His claws are a part of his mutation not surgically inserted like it was previously believed. So what makes them work?


Prove that you can choose  $ 2 ^ {k-1} $ numbers  from $2^k -1 $ integers so that the sum of them is divisible by $2^{k-1}$  . The work I have done : I wanted to use strong induction , I presumed the theorem is correct for all numbers less than  $2^k -1 $ in the form of  $2^n -1 $ from there I concluded  you can choose  $2^{k-1} $ numbers from our  $2^k -1 $ numbers and you can write them in the form of $ 2 ^ {k-1} . m $ , the remaining numbers will be $ 2 ^ {k} $- $ 2 ^ {k-1} : { 2 ^ {k-1}  }$ we can write that in the form of $ 2 ^ {k-1} $ too , but at this point I realized I was way off the solution and appreciate any other ideas (even not involving induction)

Show that, of any set of $2^{n+1}-1$ positive integers numbers is possible choose $2^{n}$ elements such that their sum is divisible by $2^{n}$.   My approach: Let $a_1,a_2,\ldots,a_{2^{n+1}-1}$ positive integers numbers. Define, $s_j=a_1+a_2+a_3+\ldots+a_{2^{j+1}-1}$, $j\in\{1,\ldots,n\}$.   If any of the $2^{n+1}-1$, $s_j$, are divisible by $2^n$, we are done.   In case contrary, $s_j$ have a remainder $1,2,3,\ldots,2^{n}-1\mod(2^n)$. And, we know that $2^{n+1}-1>2^n-1$, so by Pigeonhole Principle, there exist a tleast two $s_j$ such that has a same remainder ($\mod(2^n)$), i.e., if $p<q$, then $$s_q-s_p=a_{2^{p+1}}+a_{2^{p+1}+1}+\ldots+a_{2^{q+1}-2}+a_{2^{q+1}-1}\equiv 0\mod(2^{n})$$  So, the set $\{a_{2^{p+1}},a_{2^{p+1}+1},\ldots,a_{2^{q+1}-2},a_{2^{q+1}-1}\}$ is the set we need. I know, this answer doesn't be right, but is the idea I have to occupy Pigeonhole.  EDIT: Both answers were very good, but, how I could occupy the pigeonhole principle in this problem?


Han Solo is not the only one who does not believe the Force is real, or that the Jedi never existed in history. However, why do such beliefs appear to be so widespread?  My question has two interlinked parts:   Have there always been non-believers in the existence of the Force and its wielders? How/why is Palpatine so successful in suppressing galactic history of the Jedi, effectively converting them from a publicly well-known galactic institution to mythical superstition?   If you think about it, a common human who experienced the Clone Wars in his 10s or 20s would only be in his 30-40s by the time of the original trilogy, and 50-70s by Ep VII. The Jedi of the Galactic Republic would still be in living memory, not to mention so many long-lived species who have personally known individual Jedi for centuries before Palpatine was even born.  These people who know the Jedi are no myth pose a major problem to Palpatine’s campaign to rewrite history. So how is Palpatine so successful? Persuading the public to hate the Jedi helps make purging them popular, but doesn’t do much on its own towards stopping people from talking about them to their kids as though they actually existed in the past.  Palpatine can’t shut everyone up for sure, but the Jedi has also existed too recently in history for the notion of people believing they were never real to start overnight. Is it possible that there were such beliefs already in existence?

I always wondered why Admiral Motti and Governor Tarkin in the movie  insinuate that the Force is an old, dead religion?  :     The Jedi are extinct, their fire has gone out of the universe. You, my friend, are all that's left of their religion.   :     Don't try to frighten us with your sorcerous ways, Lord Vader. Your sad devotion to that ancient religion has not helped you conjure up the stolen data tapes, or given you clairvoyance enough to find the rebels' hidden fortress...   Tarkin, as human, must be around age 50, so, if in Episode IV Luke is about 20, when he was just born at the end of Episode III, Tarkin must have been around 30, so a perfect young man in a Galaxy that used to know Jedis, Jedi Council, Force etc..  Why, 20 years later, he just looks like someone who never saw a Jedi/Sith? Also, besides from Force sensitives (Obi-Wan, Yoda, Vader, the Emperor), nobody else looks like they ever heard of the Force ... that's really weird, isn't it?


Hey guys, like the question states, I am trying to slide in a UIDatePicker without using presentModalViewController or pushViewController and subsequently hide the main UITabBar of the application. Right now, I am adding the UIDatePicker subview with a couple buttons on a Navigation Bar to a temporary UIViewController, and initializing a UINavigationController with that temporary controller as the root. I am adding this Navigation Controller as a subview to self.navigationController.tabBarController in an attempt to overlay the UITabBar, but when I set the UITabBar to hidden, all I see is white beneath it, with no UIDatePicker visible. Any suggestions?  Note: My reasoning for this is that I can't figure out a way to use presentModalViewController with a view smaller than the screen.

I'm trying to get a UIDatePicker with a UIButton to show up in a UIActionSheet. Unfortunately it gets cropped off and the entire Date Picker is not visible. I have not even attempted to add the UIButton yet. Can anyone suggest on getting the entire view to fit properly? I'm not sure how to add the proper dimensions as UIActionSheet seems to lack an -initWithFrame: type constructor.  UIActionSheet *menu = [[UIActionSheet alloc] initWithTitle:@"Date Picker"                                                    delegate:self                                          cancelButtonTitle:@"Cancel"                                     destructiveButtonTitle:nil                                          otherButtonTitles:nil];  // Add the picker UIDatePicker *pickerView = [[UIDatePicker alloc] init]; pickerView.datePickerMode = UIDatePickerModeDate; [menu addSubview:pickerView]; [menu showInView:self.view];  [pickerView release]; [menu release];   I've also tried with something similar to:  UIActionSheet *menu = [[UIActionSheet alloc] initWithFrame:CGRectMake(200.0, 200.0, 100.0f, 100.0f)];   The coords are ofcourse not realistic, but they don't seem to affect the position/size of the UIActionSheet.


I already followed .  In the template file I have this code.  {{ 'About Us'|t }}   I am using multiple languages, so it should work fine with /th/about-us.  I want to achieve it directly in the template file. How can I do it?

I create a about-us with Basic Page content type, and with path alias aliased it to \about-us( nid = 2),Now in template file I want to get path alias
{{ 'About Us'|t }}
   in Drupal 7 I got it with  url("node/2") but what is equivalent in Drupal 8?  what snippet  I have to use to get path alias of nid 2 in template  file ?


From the below code snipped, need to access member function of class A::B. Since class B is private unable to create object for it from non-member function. Kindly help me in getting resolve out of this without moving Class B into public Code below for reference A.h #include <iostream>  class A { public:   A();   void Func(); private:   class B;   B *b; };  A.cpp #include "A.h" #include "AB.h"  A::A() {     b = new B(this); } void A::Func() {     b->Func(); }  AB.h #include "A.h"  class A::B { public:   B(A* a);   void Func(); private:   A* ptr;  };  AB.cpp #include "AB.h"  A::B::B(A* a):ptr(a) {  }  void A::B::Func() {     std::cout<<"Do nothing "; } static void call_sample() {     A::B* tmp;     //access member function of class A::B }  Error below for reference: In file included from AB.cpp:2:0: AB.h: In function ‘void call_sample()’: AB.h:3:10: error: ‘class A::B’ is private  class A::B           ^ AB.cpp:15:4: error: within this context  A::B* tmp;

I have been reading through the  and was curious about the  declaration. I personally have never used it, however I am interested in exploring the language.   What is a good example of using friend?    Reading the FAQ a bit longer I like the idea of the << >> operator overloading and adding as a friend of those classes. However I am not sure how this doesn't break encapsulation. When can these exceptions stay within the strictness that is OOP?


I want to know the series $\sum_2^\infty\cos( \log n)/n\log n$ converges or diverges. The log n in the bottom makes every my effort futile....Could anyone please help?

$$\sum_2 \frac{\cos(\log{n})}{n\log{n}}$$  The naive attempt is to use dirichlet's test to falsely claim that $\cos(\log{n})$ has bounded partial sums, but I don't think it works.  I am also trying a difference of sum and integral type of strategy but am not sure where to go from it.    Finally, as A.S pointed out below in the comments, the integral test does not apply, since cos(logn) does not behave monotonically...   Any ideas are welcome.  Thanks,


I've only just started to study a degree in Mathematics and I find it extremely satisfying to have a seemingly easy question that is incredibly difficulty or tricky to work out. I've looked into heaps of competition exams (although they aren't really what I'm looking for - seeing that they don't usually seem easy). A good example are the so called 'Coffin Problems' (you can find some ). I'm reaching out here to hear any original problems that fit into this category. Here's an example of mine:  If $\sin \theta + \cos \theta + \tan \theta = -1$, find the values of $\sin \theta + \cos \theta - \tan \theta$ for $\theta$ not being a multiple of $\pi$.  From memory, one of the answers I got for that problem was $\sqrt{2}-1$, although I know that there are plenty of other answers. Also, I appologise if this question does not belong on this site. This was the only site I thought of to ask a question like this. Thanks!

In , I asked about proof of statements which are simple but incorrect.   Here, I ask about statements which seems, at a first glance, straightforward, but if we try to write a proof, we can see it's much harder than it looked. So I expect the answers to contain:   the statement; why it looks easy to prove; why actually it isn't.


I have the following sentence, and I am wondering which preposition(s) should I use to make this sentence grammatically correct.     This will be elaborated on in the following section.   There are two more variations of usages of on in as follows:     This will be elaborated on the following section.   and     This will be elaborated in the following section.   I obviously can see many examples as in the following section, but still I also can see some of on in the following section usage.  Thanks in advance!

I'm writing a paper, please can you tell me which sentence is the right?   The Pseudo-code is outlined in Fig 2 and we elaborate it in the following section.  The Pseudo-code is outlined in Fig 2 and we elaborate on it in the following section.


Motivation:  In Biology, when, for example, biologists try to model the population dynamics of a population, they say:     Let $N: \mathbb{R}^{nn} \to \mathbb{R}^{nn}$ be a function that   represents the number of individuals in a given population.   And with that they construct some differential equations, which models the interactions of the population with the environment, other populations, etc..However, for a given time $t$, if $N(t)$ is not an integer, say 1.5, it does not mean anything physically - we cannot have 1.5 member in a population. For that reason, even though this model have lots of successes, it is clear that we can make improvements. In fact, it has been already done. They define $N: \mathbb{N} \to \mathbb{N} $, and they use difference equations for describing the changes in the number members in population. Turns out, in this way, we can explain real phenomenas much better (citation needed, but a quick google research can reveal this).  Similarly, in Newton's time, they thought they could move as fast as they can, but it turned out, we cannot have a velocity bigger than $c$, which changed everything.  Explanation:  We always model time with $\mathbb{R}$, which is a dense set; meaning given any two different real numbers $a$ and $b$, we can always find a third real number $c$ s.t $$a<c<b.$$  Now, as far as our measurements imply, we can always measure and look at smaller time intervals - or at least this is what I know. However, as the history of physics have shown, this is not the case with distance, when we look smaller distances - or objects with smaller sizes - the physics get weird, and I'm not sure that quantum physics suggest that we cannot see smaller sizes after at some point.  The actual question:  So, my question is that, is there any argument why modelling time as a real number in any physical theory is sensible?  Note the relation of this question to the motivation given in the beginning .  Edit:  I'm directly going to quote what I have written in the comments:     I do not ask whether time is something or else, but rather, is there   any motivation why we use a dense field to model it, and is there any   counter experimental observations, or any other models who use discreet    time intervals in Physics.   Moreover, I'm talking about Physics in here, not about Biology.

I was coding a physics simulation, and noticed that I was using discrete time. That is, there was an update mechanism advancing the simulation for a fixed amount of time repeatedly, emulating a changing system.  I though that was interesting, and now believe the real world must behave just like my program does. It is actually advancing forward in tiny but discrete time intervals?


I have a client that wants to create a custom report that shows the scheduled time based workflow queue.  We are aware of the Time-Based workflow Monitor but we need to see more information than what is provided in the monitor.  Is it possible to query the time-based workflow queue directly via custom apex classes?

Is it possible to query the content of the Time-based Workflow Queue from an Apex unit test to assess that a specific Workflow Rule has been executed and added a new item to the queue? I didn't see anything alike in the documentation, but wish it could be possible to improve testing and stability overtime.  Thanks


MWE code    \documentclass[twoside=semi, a4paper, 11pt, open=any, chapterprefix=false, toc=graduated]{scrbook}  \usepackage{blindtext} \usepackage{fontspec}  \usepackage{libertine} %uncomment \usepackage[libertine]{newtxmath} %uncomment  \begin{document} \chapter{Chapter One} \blindtext[3]  \blindtext[1] \section{Section One} \blindtext[2]  \blindtext[3] \chapter{Chapter Two} \blindtext[4]  \blindtext[3] \end{document}   Output -- unwanted spaces     Output -- desired effect        Question How to fix this inconsistency in the same document? I noticed that by uncommenting the libertine lines of code the problem disappears.  Note - compilation with XeLaTeX This is XeTeX, Version 3.14159265-2.6-0.99991 (TeX Live 2014/W32TeX) (preloaded format=xelatex 2014.9.2)

I'm writing my bachelor-thesis and have a couple of small sub-sub-sections explaining conversions, like in the following  \subsubsection*{Assignment}  This document only explains non-compound assignments. The other kind, i.e \texttt{a += b}, is supported by the language too, but is not yet implemented.   \begin{itemize} \item If the first is an \texttt{auto} variable, no conversion takes place when assigning       the right hand side to the variable designated by the left hand side.  \item Otherwise, an assignment conversion takes place converting the given value to the type       of the designated variable.  \item Assignment requires an lvalue as the left hand side, and yields an lvalue result.  \end{itemize}  \subsubsection*{Multiplication} % ...   But latex renders it quite ugly with much space in between the items. I think it does so to fit the whole page. How can I tell it not to do so? Is what I'm doing right at all?


Let K be a field with char(K)>0.  How do I prove that every algebraic extension of K is a separable extension if and only if $\phi:x \rightarrow x^p$ is surjective ?

I'm trying to prove the following statement:     Let $F$ be a finite field of prime characteristic $p$ and let $E$ be   the field generated by $F$ and the elements $\{t^{1/p},n \geq 1\}$,   where $t$ is an indeterminate. Then, any algebraic extension of $E$ is   separable.   I've already proved that the Frobenius Endomorphism on $E$ is surjective. I'm trying to use the following fact:     Given $\alpha$ an element of an algebraic extension of $E$, then $\alpha$   is separable if, and only if, the derivate of $Irr(\alpha,E)$ is not zero.   Then, I know that the irreducible polynomial can be expressed function of $x^p$,  $$Irr(\alpha, E) = p(x^p)\in F[x].$$  However, I got stuck here and I don't know what else to do. Could someone give me and advice?


I want to check the file is executable or not through the command prompt so that I cannot open the file whether it is executable or not.

I need to know how to mark a file as executable but the check box is not there.


My husband and I have co-signed for our son's car loan, and also he is listed on our car insurance coverage. If he gets in an accident, can we be sued?

I co signed on a bank loan to finance the purchase of a car for my brother in Florida.  Only his name is on title, registration and insurance policy. Would I be liable and can I be sued by another person if he were in an accident?


My desktop is pretty blank and I'd much rather have the useful Dash come up on start-up, is this possible? Surely there is a command that is executed internally when I press the Dash Home button? What is this?

How do you start ubuntu unity 3D with the dash open? This is so that I can get things done fast. I would like to log in to my desktop with a full-screen dash without having to click the Ubuntu dash button.


The continued fraction of $\pi$ has not yet be known.  I could not see the distribution of the $\{\frac{n!}{2\pi}\}$ where $\{x\}=x-\lfloor x \rfloor$.  Is there any idea how to find two convergent subsequences with different limits?

I encountered a problem today to prove that $(X_n)$ with $X_n = \cos(n!)$ does not have a limit (when $n$ approaches infinity). I have no idea how to do it formally. Could someone help? The simpler the proof (by that I mean less complex theorems are used) the better. Thanks


Many of my downvotes are on spam and low quality posts, and these quite often end up deleted.  So when I downvote and the post is deleted shortly after, is the downvote still counted in this number?

Currently, the number of "votes cast" excludes votes on deleted content. Once something gets deleted that you voted on, that vote vanishes from your stats. This of course happens frequently especially with down-votes - if you're a good voter, stuff you downvote often ends up getting deleted.  Seeing as the idea behind the public display of total votes you've cast is to encourage voting, is this really fair?   Also, doesn't it distort greatly all voting stats, especially when looking at candidates for moderator elections and such?


i want to migrate the following code in c++ to c#    My problem its here,  How can I do this in c#   uint64_t matchid = *reinterpret_cast<uint64_t*>(result.data()); uint64_t outcomeId = *reinterpret_cast<uint64_t*>(result.data() + 8); uint16_t tokenId = *reinterpret_cast<uint16_t*>(result.data() + 16);   And the result must be this  matchId: 3203527750019186923, outcomeId: 3203531838828052697, tokenId: 13431   thanks

I'm looking for a way to reinterpret an array of type byte[] as a different type, say short[]. In C++ this would be achieved by a simple cast but in C# I haven't found a way to achieve this without resorting to duplicating the entire buffer.  Any ideas?


Show that if $f$ and $g$ are uniformly continuous on $A \subseteq\mathbb{R}$, then $f + g$ is uniformly continuous on $A$.  How do I approach this question?

Suppose $f:\mathbb{R} \supset E \rightarrow \mathbb{R}$ and $g: \mathbb{R} \supset E \rightarrow \mathbb{R}$ are uniformly continuous. Show that $f+g$ is uniformly continuous. What about $fg$ and $\dfrac{f}{g}$?  My Attempt Firstly let's state the definition; a function is uniformly continuous if $$\forall \varepsilon >0\ \ \exists \ \ \delta >0 \ \ \text{such that} \ \ |f(x)-f(y)|< \varepsilon \ \ \forall \ \ x,y \in \mathbb{R} \ \ \text{such  that} \ \ |x-y|<\delta$$ Sum $f+g$ Now to to prove $f+g$ is uniformly continuous; $\bullet$ Choose $\delta_1 >0$ such that $\forall$ $x,y \in \mathbb{R}$ $|x-y|<\delta_1$ $\implies$ $|f(x)-f(y)|< \dfrac{\epsilon}{2}$ $\bullet$ Choose $\delta_2 >0$ such that $\forall$ $x,y \in \mathbb{R}$ $|x-y|<\delta_2$ $\implies$ $|g(x)-g(y)|< \dfrac{\varepsilon}{2}$ $\bullet$ Now take $\delta := min\{ \delta_1, \delta_2\}$ Then we obtain for all $x,y \in \mathbb{R}$ $$ |x-y|<\delta \implies |f(x)+g(x)-f(y)+g(y)| < |f(x)-f(y)| + |g(x)-g(y)| < \dfrac{\varepsilon}{2}+\dfrac{\varepsilon}{2}= \varepsilon$$  Product $fg$ Now for $fg$ for this to hold both $f:E \rightarrow \mathbb{R}$ and $g:E \rightarrow \mathbb{R}$ must be bounded , if not it doesn't hold. $\bullet$ $\exists \ \ M>0 \ \  such \ that \ \ |f(x)|<M \ \ and \ \ |g(x)|<M \ \ \forall \ x \in E$ $\bullet$ Choose $\delta_1 >0$ such that $\forall$ $x,y \in \mathbb{R}$ $|x-y|<\delta_1$ $\implies$ $|f(x)-f(y)|< \dfrac{\epsilon}{2M}$ $\bullet$ Choose $\delta_2 >0$ such that $\forall$ $x,y \in \mathbb{R}$ $|x-y|<\delta_2$ $\implies$ $|g(x)-g(y)|< \dfrac{\epsilon}{2M}$ $\bullet$ Now take $\delta := min\{ \delta_1, \delta_2\}$. Then, $|x-y|<\delta$  implies for all $x,y \in \mathbb{R}$, that $$|f(x)g(x)-f(y)g(y)| \leq |g(x)||f(x)+f(y)|+|f(y)||g(x)+g(y)| \leq $$ $$ M|f(x)+f(y)| + M|g(x)+g(y)| < M \dfrac{\epsilon}{2M} + M \dfrac{\epsilon}{2M} = \epsilon$$ Are these proofs correct? I am not sure how to approach the $\dfrac{f}{g}$ case.


i've been having troubles importing CA certificates using the terminal, so I pulled an idiot move and did sudo chown user /usr/ in order to copypaste the CA cert into the desired folder, now sudo doesn't work in terminal, and I can't figure out how to reset user permissions to root. Am I SOL/FUBAR/SNAFU?

I accidently ran  sudo chmod 755 -R /   instead of  sudo chmod 755 -R ./   I stopped it after few seconds, but now there is some problems such as  sudo: must be setuid root   How can I revert permissions back?


With respect to least runtime on web app, what is the ideal place to keep my imports in views.py  Say I want to validate and process some form entries with external modules. My current code:  from django.shortcuts import render  from .forms import *  import re import module1 import module2  def index(request):     form = MyForm()     if request.method == 'POST':         form = MyForm(request.POST)          if form.is_valid():             #             #Process my stuff here using re, module1, module2             #  return render(request, 'index.html', context)   But what good is it doing by importing module re, module1, module 2 before hand if condition if form.is_valid(): failed? Or condition if request.method == 'POST': fails? That is when the form was never submitted.  Would importing these modules after these conditions are passed (because thats when they are actually needed) cause any less runtime overhead on program or webapp when these conditions fail? avoiding unnecessary imports when they are not needed?  Psuedo code of my idea:  if form.is_valid():     import re     #Perform some regex matches and stuff     if (above re matches succeed):         import module1         #Process my stuff here using module1 here         #and so on importing modules only when they are required   Which one of these is recommended and would have best performance on the website?

states:  Imports are always put at the top of the file, just after any module comments and docstrings, and before module globals and constants.  However if the class/method/function that I am importing is only used in rare cases, surely it is more efficient to do the import when it is needed? Isn't this: class SomeClass(object):      def not_often_called(self)         from datetime import datetime         self.datetime = datetime.now()  more efficient than this? from datetime import datetime  class SomeClass(object):      def not_often_called(self)         self.datetime = datetime.now()


What would be the code for moving onto a new screen after a user presses a key. For example I have coded a blank screen that says press any key to begin.   I have been looking all over the web, but I am unable to find such a code that does not involve jQuery etc.   Thank you in advance.

How can I redirect the user from one page to another using jQuery or pure JavaScript?


This question, , asks whether units of a continuous quantity should be spoken of as discrete or continuous. The top answer states  The rule is simple, and you obviously know it: discrete quantities require the use of "fewer" and continuous quantities require the use of "less". Calorie, as a unit, requires the use of "fewer". Energy, as a continuum, requires the use of "less". "Fewer calories means less energy."  I do not understand the logic here though.  Calorie is a unit, yes, but it is a continuous unit (it is possible to have half a calorie, or 4.582394 calories).  Since a calorie is such a small unit of energy compared to what it is usually used for (food energy and human metabolism), it is very seldom expressed in a fractional form and instead is rounded (usually to the nearest 10 or higher). Why then should "fewer" be used with calorie instead of "less"?  Is there another relevant rule than just "continuous quantities use "less" and discrete quantities use "fewer"?

I've just received a memo which says (effectively)      As more people leave, there will be less people available.   I want that word to be fewer. Are there guidelines for which word ought to be used when?


I can do logout but at that time localhost cookies folder are not clear that's why my site user is not logout properly.  <li>        <button id="btnLogoff" onclick="deleteAllCookies()">LOGOFF / logout</button>   </li>  <script>                             function deleteAllCookies() {                                 var cookies = document.cookie.split(";");                                  for (var i = 0; i < cookies.length; i++) {                                     var cookie = cookies[i];                                     var eqPos = cookie.indexOf("=");                                     var name = eqPos > -1 ? cookie.substr(0, eqPos) : cookie;                                     document.cookie = name + "=;expires=Thu, 01 Jan 1970 00:00:00 GMT";                                 }                             }                         </script>

How do you delete all the cookies for the current domain using JavaScript?


I broke my laptop and had to buy a new one with a new keyboard that I am struggling to get familiar with, especially with the keys like home, page-up, page-down and end, which aren't standardized at all.  I found myself doing this for like the 5th time in the last several years, and I think it is really annoying.   Is there an app that can reliably map one key to another?  By reliably I mean that key mapping works with Shift, Alt, and other modifiers.  UPDATE  Windows 7, Samsung Chronos 7

One of my laptop's keys has fallen off. Is there any way I can remap another key to serve as that key?  I'll 'sacrifice' the other key because I never use it.


I want to know if I can get some help with this proof. I tried, but I just cannot seem to get $2^{k}$. It states that,     For $k \in \mathbb{Z}_{\ge 0}$, $$\sum^{k}_{m=0}\binom{k}{m} = 2^k$$   Thank You.

I'm well aware of the combinatorial variant of the proof, i.e. noting that each formula is a different representation for the number of subsets of a set of $n$ elements. I'm curious if there's a series of algebraic manipulations that can lead from $\sum\limits_{i=0}^n \binom{n}{i}$ to $2^n$.


I have a level 2 Oathbreaker paladin with a javelin and a halberd, and I'm not sure how to calculate my attack bonuses. Can anyone explain it to me?

Completely new to D&D; myself and some similarly inexperienced players jumped in with D&D 5e, using the premade characters for the starter set that was released. We searched around but couldn't find an answer to something:  What exactly is the Attack Bonus listed on the weapons? Is it a modifier you add to your attack roll or your damage roll?


Preconfiguring packages ... (Reading database ... 238478 files and directories currently installed.) Removing systemd-shim (9-1bzr4ubuntu1) ... Removing 'diversion of /usr/share/dbus-1/system-services/org.freedesktop.systemd1.service to /usr/share/dbus-1/system-services/org.freedesktop.systemd1.service.systemd by systemd-shim' dpkg-divert: error: rename involves overwriting '/usr/share/dbus-1/system-services/org.freedesktop.systemd1.service' with   different file '/usr/share/dbus-1/system-services/org.freedesktop.systemd1.service.systemd', not allowed dpkg: error processing package systemd-shim (--remove):  subprocess installed post-removal script returned error exit status 2 Errors were encountered while processing:  systemd-shim E: Sub-process /usr/bin/dpkg returned an error code (1)

I got a strange error after upgrading Ubuntu 16.04 to 16.10.  The Software Updater suggests a partial update:     Could not install 'systemd-shim'      The upgrade will continue but the 'systemd-shim' package may not be in a working state. Please consider submitting a bug report about it.  subprocess installed post-removal script returned error exit status 2    sudo apt-get update finishes without any error.  sudo apt-get remove outputs this  The following packages will be REMOVED:   systemd-shim 0 to upgrade, 0 to newly install, 1 to remove and 0 not to upgrade. 1 not fully installed or removed. After this operation, 71.7 kB disk space will be freed. Do you want to continue? [Y/n] y (Reading database ... 1451244 files and directories currently installed.) Removing systemd-shim (9-1bzr4ubuntu1) ... Removing 'diversion of /usr/share/dbus-1/system-services/org.freedesktop.systemd1.service to /usr/share/dbus-1/system-services/org.freedesktop.systemd1.service.systemd by systemd-shim' dpkg-divert: error: rename involves overwriting '/usr/share/dbus-1/system-services/org.freedesktop.systemd1.service' with   different file '/usr/share/dbus-1/system-services/org.freedesktop.systemd1.service.systemd', not allowed dpkg: error processing package systemd-shim (--remove):  subprocess installed post-removal script returned error exit status 2 Errors were encountered while processing:  systemd-shim E: Sub-process /usr/bin/dpkg returned an error code (1)   Please help me to fix this error. Thank you.


The error is shown as,  Exception in thread "AWT-EventQueue-0" java.lang.NullPointerException     at org.knowm.xchart.internal.chartpart.Legend_AxesChart.paint(Legend_AxesChart.java:195)     at org.knowm.xchart.XYChart.paint(XYChart.java:254)     at org.knowm.xchart.XYChart.paint(XYChart.java:225)     at org.knowm.xchart.XChartPanel.paintComponent(XChartPanel.java:95)     at javax.swing.JComponent.paint(JComponent.java:1056)     at javax.swing.JComponent.paintChildren(JComponent.java:889)     at javax.swing.JComponent.paint(JComponent.java:1065)     at javax.swing.JComponent.paintChildren(JComponent.java:889)     at javax.swing.JComponent.paint(JComponent.java:1065)     at javax.swing.JComponent.paintChildren(JComponent.java:889)     at javax.swing.JComponent.paint(JComponent.java:1065)     at javax.swing.JComponent.paintToOffscreen(JComponent.java:5219)     at javax.swing.RepaintManager$PaintManager.paintDoubleBuffered(RepaintManager.java:1572)     at javax.swing.RepaintManager$PaintManager.paint(RepaintManager.java:1495)   Here is my code, where xyChart is declared as a field. I am convinced that it is the constructor part for XChartPanel gets wrong, but I simply don't know where to start.  /**      * Initialize the XYChart      */     private void initXYChart() {         // Create Chart         xyChart = new XYChartBuilder().width(800).height(800).title(getClass().getSimpleName())                 .xAxisTitle(xColName)                 .yAxisTitle("Y").build();          // Customize Chart         xyChart.getStyler().setLegendPosition(LegendPosition.InsideNE);         xyChart.getStyler().setAxisTitlesVisible(true);         xyChart.getStyler().setDefaultSeriesRenderStyle(XYSeriesRenderStyle.Line);          double[] yCoordArray = new double[xCoordArray.length];         // Loop through the series         if (!seriesList.isEmpty()) {             for (int i = 0; i < yCoordinates.size(); i++) {                 List<Double> yCoordOneSeries = yCoordinates.get(i);                 // Convert list to array                 for (int j = 0; j < yCoordArray.length; j++) {                     yCoordArray[j] = yCoordOneSeries.get(j);                 }                 xyChart.addSeries(yColNames.get(i), xCoordArray, yCoordArray);             }         }          xyChartPanel = new XChartPanel<>(xyChart);          add(xyChartPanel, BorderLayout.CENTER);     }

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?


The recursive sequence given by  $ s_1 = \sqrt{2} $  $ s_{n+1} = \sqrt{2 + s_n} $  seems to converge to $ 2 $  It's easy to prove that this sequence indeed converges and that $ 2 $ is a upper bound for that sequence, but how to prove that it really does converge to 2?  thanks in advance.

(Fitzpatrick Advanced Calculus 2e, Sec. 2.4 #12)  For $c \gt 0$, consider the quadratic equation $x^2 - x - c = 0, x > 0$.  Define the sequence $\{x_n\}$ recursively by fixing $|x_1| \lt c$ and then, if $n$ is an index for which $x_n$ has been defined, defining  $$x_{n+1} = \sqrt{c+x_n}$$  Prove that the sequence $\{x_n\}$ converges monotonically to the solution of the above equation.  Note: The answers below might assume $x_1 \gt 0$, but they still work, as we have $x_3 \gt 0$.    This is being repurposed in an effort to cut down on duplicates, see here: .  and here: .


Hello I have problems with this exercise Consider the metric space $\mathbb{Q}$ of rational numbers with the Euclidean distance. Prove that: $K= \{ x\in \mathbb{Q} |  0 \leq{x} \leq{\sqrt[ ]{2}} \}$ is closed and bounded, yet not compact. My attempt: It is clear that it is closed and bounded To prove that is not compact, I have to prove there exists an open coating from which you cannot extract a finite subcoating. For example $U_n= \{ x\in \mathbb{Q} |  0 <x< \sqrt[ ]{2}-\dfrac{1}{n} \}$ I have to prove that they are open and cover $K$ How do I prove that they cover K?

Consider the metric space $Q$ of rational numbers with the Euclidean metric of $R$. Let $S$ consist of all rational numbers in the open interval ($a, b$), where $a$ and $b$ are irrational. Then $S$ is a closed and bounded subset of $Q$ which is not compact.  I am trying to prove this statement. It's easy to show that $S$ is closed and bounded but I'm having trouble showing that it is not compact. I think I need to find an example of an open covering of $S$ which doesn't have any finite subcover, but I can't think of such an example. Any help? Thanks.


I want to reorder the data of a table by a field. The only way I know is creating a new table and passing all data (except the primary key id) from the old table to the new one ordering by id_temp: INSERT INTO db1.ticket id_temp, text, answer_timestamp, mileage , distance_unit,  troubles, error_codes, controls, answer_text, answer_pdf, answer_pdf_link,  estimated_duration, real_duration, delete_operator_id, request_type_id,  request_properties_id, category_id, operator_id, language_id, deleted_at,  created_at, updated_at SELECT (id_temp, text, answer_timestamp, mileage, distance_unit, troubles,  error_codes, controls, answer_text, answer_pdf, answer_pdf_link,  estimated_duration, real_duration, delete_operator_id, request_type_id,   request_properties_id, category_id, operator_id, language_id, deleted_at,   created_at, updated_at)  FROM db1.ticket_temp order by id_temp;  However this method looks to me very heavy. Is it another way to reorder the data in a table without creating a new one?

I tried running the following statement:  INSERT INTO VOUCHER (VOUCHER_NUMBER, BOOK_ID, DENOMINATION) SELECT (a.number, b.ID, b.DENOMINATION)  FROM temp_cheques a, BOOK b WHERE a.number BETWEEN b.START_NUMBER AND b.START_NUMBER+b.UNITS-1;   which, as I understand it, should insert into VOUCHER each record from temp_cheques with the ID and DENOMINATION fields corresponding to entries in the BOOK table (temp_cheques comes from a database backup, which I'm trying to recreate in a different format). However, when I run it, I get an error:  Error: Operand should contain 1 column(s) SQLState:  21000 ErrorCode: 1241   I'm running this in SQuirrel and have not had issues with any other queries. Is there something wrong with the syntax of my query?  EDIT:  The structure of BOOK is:  ID  int(11) START_NUMBER    int(11) UNITS   int(11) DENOMINATION    double(5,2)   The structure of temp_cheques is:  ID  int(11) number  varchar(20)


We have an orthonormalsystem in $L^2(0, 2\pi)$: $\{e^{ikx} : k \in \mathbb{Z}\}$. Now I want to show that it's also an orthonormalbasis.   I thought the easiest way to do that would be to show that for every $v \in L^2(0, 2\pi)$ with $(v,\phi_k) = 0, \phi_k(x) = e^{ikx}$ for all $k \in \mathbb{Z}$, $v(x) = 0$ for all $x$. But I'm stuck showing that if $\int_0^{2\pi} v(x)e^{ikx} dx = 0$ for all $k \in \mathbb{Z}$, then $v=0$.  How do I proceed? Is there an easier way?

Let $H$ be the inner product space = $\{f: \mathbb{R} \to \mathbb{C} \mid f \text{ is continuous and has period }2 \pi\}$ where the inner product is: $$\langle f,g \rangle = \int_{0}^{2\pi}f(t)\overline{g(t)} dt $$  How do I prove that for $n \in \mathbb{Z}$ and $e_n(t)=\dfrac{1}{\sqrt{2\cdot\pi}} e^{i n  t}$, $(e_n)_{n \in N}$ is a basis of $H$ (that it is orthonormal is easy).


If a portable windows program has malware and I open it by wine, just close it to do away with the malware? Sorry for my grammar. I'm not fluent in English  Thank you

I heard Linux can get viruses through Wine,and I was curious if the viruses work only while Wine is running.  In other words, could I stop a virus from doing it's thing by just quitting Wine?


I , since the duplicated question was automatically deleted. Once re-opened, the question still shows the link to the duplicate question, as you can see on         Since the question was re-opened, the link to the duplicated question should be removed, as it always happens.

I just , which had been closed as  a duplicate of another.  I navigated away and went to visit the page later, it turns out, the Possible Duplicate banner wasn't removed automatically.        How come?


I'm working on a ranking problem where I want to measure the distance between a collection of query points (as a group) and each target point in my database. Each query point is part of the set of target points. I started with the Euclidean distance and cosine similarity by using the mean vector of the query points. However, the results were not satisfactory possibly because both of these measures don't take into account the variance and covariance of the query points. I stumbled across the  which seems to be exactly what I want to try: Measuring how many standard deviations a point is away from the mean of the subsample.  The problem is that I work in a 256-dimensional space while the number of query points is usually much lower than that. Therefore, I cannot calculate the Mahalanobis distance which relies on the covariance matrix. In order to calculate it, I need more observations n than dimensions p.  1) Is this assumption correct?  The past days I've been thinking about how I could still do "better" than the Euclidean distance without having enough data to calculate the Mahalanobis distance.  I thought about switching out the covariance matrix for the diagonal matrix of variances. As long as none of the variances is zero an inverse can be calculated.   2) Does this idea have a flaw?  Since the 256-dimensional vectors are the result of PCA over all target points, I could use n points to create a covariance matrix over the first n-1 dimensions and then fill the rest of the needed 256-dim covariance matrix with the diagonal of variances from before.  3) Would that make any sense?  4) Any other ideas that might help me to measure a more meaningful distance between a point and a subsample of points?  Please note: A very similar question has been asked  but I believe my problem is still different. There, OP wanted to measure pairwise distances between points given all points. I want to measure the distance between the distribution of a subsample to all other points. I believe, the reasoning of the accepted answer does not apply to my problem since the distribution of the subsample is likely to be different.

I have an issue which I could not solve, although I tried and I got some help on R forum.  I am trying to calculate Mahalanobis distances on a data.frame, where I have several hundreds of groups and several hundreds of variables. Whatever I do, I get the system is computationally singular: reciprocal condition number error.   It is clear that it is singular, but is there any way to get rid of it and run Mahalanobis? Should I forget solve this using another approach? If yes, then what else to use?  I have uploaded the data file to my :  It is a tab delimited txt file with no headers.  I was working with the R StatMatch Mahalanobis (also tried stats Mahalanobis) function. I have a deadline for this project (not a homework!), and I could always use this function, so I thought I will be able to keep the calculations short, but now I am lost.  Migrated .


Don't get me wrong, I like Lion, though I do miss many things from Snow Leopard and wish to express this to the OSX team via some sort of suggestion forum.  I'm visually impaired and the OS is seemingly becoming more and more visual.  One thing that seems to be missing which I can barely live without is the CTRL+WHEEL to zoom in/out, the options seem to be there but don't work, or somehow work differently than they used to?

Inspired by  I became curious about what is the current preferred mechanism for submitting bug reports and feature requests to Apple. I'm aware that they have the internal RDAR bug tracking system, and that there is an  project to crowdsource the tracking of issues, but I'm at a loss as to the preferred channel to submit something.    Is there a public-facing portal for submitting issues?


How to find out value of product   $$\cos{\theta}\cos{2\theta}\cos{3\theta}...\cos{999\theta}$$ where   $\theta=\frac{2\pi}{1999}$  i tried to multiply and divide by sin\theta to convert to sin2A, but couldnot do it. i would like to know many methods, if possible, to do this question  thanks

Given $x=\frac {2\pi}{1999}$  Find the value of $$\cos x \cos 2x \cos 3x ...\cos 999x$$  So I tried expanding $\sin {2000x}=2\sin 1000x \cos 1000x$  Then rewriting  $\cos 1000x= \cos {(999x+x)}$   No luck so far.


I want to do some changes here, I want to convert this application to winforms. And i want to store these output into a text file, How can I do it? please help  using System; using System.Threading; public static class Program { public static void Main() {      // Create a Timer object that knows to call our TimerCallback   // method once every 2000 milliseconds.   Timer t = new Timer(TimerCallback, null, 0, 1000);   // Wait for the user to hit <Enter>    Console.ReadLine(); }  private static void TimerCallback(Object o)  {    // Display the date/time when this method got called.   Console.WriteLine(DateTime.Now);   // Force a garbage collection to occur for this demo.   GC.Collect();  } }   Output of this application.   Source

I frequently start with a simple console application to try out an idea, then create a new GUI based project and copy the code in. Is there a better way? Can I convert my existing console application easily?


The largest number of cows are running for the hills.      The largest number of cows is running for the hills.   According to various free online grammar checkers both forms are correct.  My interpretation is that the "are" version refers to the cows, whereas the "is" version refers to the number or quantity.      "Cows are running for the hills" vs. "The largest number is running for the hills".   Is this too subtle a distinction?

Does a percentage require a singular or plural verb, for example, do we say ten percent "go" or "goes"?


Is there a specific word for people who like to purchase lots of things? For instance, let's say someone has an Iphone 7, but as soon as the Iphone 8 is released, he buys it, even if he doesn't need it at all. In fact, I am looking for a word with a financial perspective, like people who really enjoy spending money.  In my native language, which is Portuguese, we have a specific word for that, which is "consumista", but when I translated it into English, I got "consumerist". However, when I checked this word on Cambridge dictionary, I saw it is mostly used to describe societies, but I am not sure about specific individuals.  Thanks in advance.

What is a single word for someone who spends their wealth very foolishly?  For example: A person is obligated to take care of their children but instead spends their money on unnecessary things leaving no money to provide the necessary things for their children like food and clothes.


I have purchased some Melexis mlx90616 IR temperature sensors. The data sheet states that a calibration “by the customer” is required. By contacting my purchaser I got the answer: "The supplier has gotten back to us saying that they have limited resources available for technical support regarding the MLX90616".  It turns out that Melexis is not interested to offer support regarding the calibration procedure for the mlx90616 for those not buying high number of units.    Does anyone know how to calibrate the mlx90616, or at least the sequence of how to update the “read only” calibration coefficient registers? By having the information of how to, it would be an easy task to write the needed software.  Background info:  The returned object temperature readings (I2C/SMBus) are very slow changing and always close to the on-chip ambient temperature. Reading the raw IR channels shows rapid change when pointing to objects with different temperatures.   Reading the writable eeprom calibration coefficient register 0x2F returns 0x0020. The other eeprom read-only calibration registers (e.g. 0x26 to 0x2D) returns 0x00, which indicates that a calibration is needed. The equvialent regsisters on the comparable unit mlx90614, which is factory calibrated, is different from zero.   However, the procedure of how to calibrate the mlx90616 seems hard to find. There is no info in the datasheet regarding how to update the calibration registers, nor how to determine the values.

Recently I have been trying to interface with the MLX90616 an infra red temperature sensor by Melexis. After reading the datasheet I have I have written a program to take the object temperature readings via the on board SMBus. Everything on my end seems to be working however the the temperature readings are taking extremely long (greater then 10 minutes) to reach the object temperature. Based on the datasheet the temperature should settle within seconds thanks to the inbuilt thermal gradient compensation. Is there some EPROM setting I have missed to turn on the thermal gradient compensation to acquire fast stable readings?  Further more has anybody had a similar experience with this sensor? I am unable to find any details of others who have used this particular sensor in the past so some details would be greatly appreciated.  I have attached the main body of my code for your reference:   I2C1_Init(50000);                   //I2C clock must be in the range of 10kHz to 100kHz for operation according to the SMBus specifications   //delay_ms(100);                      //Allow time for the SSP module to initialise    I2C1_Start();   //Sometimes if I2C read is peformed without an acknologment it can hang the I2C BUS error check on each operation is therefore necessary   if(I2C1_Wr(0xB4) == 0)           //Address for a write operation to 0x5A   {     if(I2C1_Wr(0x07) == 0)         //Address for RAM command to 0x7     {       I2C1_Repeated_Start();       if(I2C1_Wr(0xB5)== 0)        //Address for read operation to 0x5A       {         lowerByte = I2C1_Rd(1);         upperByte = I2C1_Rd(1);       }     }   }   I2C1_Stop();


I recently bought a new domain from namecheap and decided to delegate it to Yandex.Connect services, so I changed namecheap's DNS to custom, added Yandex' nameservers (dns1.yandex.net and dns2.yandex.net) in the control panel, added the proof and within a couple hours my domain was being managed by Yandex.  Since I am hosting a personal site in my own premises and since my ISP doesn't sell any static IPs I decided to use DDNS. But when I tried to add a CNAME for @ that points to my-domain.example-ddns.org I found out it does... nothing. The record just isn't being created. I tried adding another one for a subdomain and it works perfectly fine.  After reading  I read this:     CNAME. Remember that a CNAME record can't be set up for the domain root, because this is prohibited by the RFC.   Imagine my shock when I read such a thing, when at the same time I have another domain registered with namecheap, but using namecheap's basic DNS instead, where I set up a CNAME record for @ that points to my-other-domain.example-ddns.org and it works perfectly fine!   How do I work around this? Using an A record is a no-go since I can't get an static IP.

This is a  about CNAMEs at the apices (or roots) of zones   It's relatively common knowledge that CNAME records at the apex of a domain are a taboo practice.  Example: example.com. IN CNAME ithurts.example.net.  In a best case scenario nameserver software might refuse to load the configuration, and in the worst case it might accept this configuration and invalidate the configuration for example.com.  Recently I had a webhosting company pass instructions to a business unit that we needed to CNAME the apex of our domain to a new record. Knowing that this would be a suicide config when fed to BIND, I advised them that we would not be able to comply and that this was bunk advice in general. The webhosting company took the stance that it is not outright forbidden by standard defining RFCs and that their software supports it. If we could not CNAME the apex, their advice was to have no apex record at all and they would not provide a redirecting webserver. ...What?  Most of us know that  insists that A CNAME record is not allowed to coexist with any other data., but let's be honest with ourselves here, that RFC is only Informational. The closest I know to verbiage that forbids the practice is from :     If a CNAME RR is present at a node, no other data should be   present; this ensures that the data for a canonical name and its aliases   cannot be different.   Unfortunately I've been in the industry long enough to know that "should not" is not the same as "must not", and that's enough rope for most software designers to hang themselves with. Knowing that anything short of a concise link to a slam dunk would be a waste of my time, I ended up letting the company get away with a scolding for recommending configurations that could break commonly used software without proper disclosure.  This brings us to the Q&A. For once I'd like us to get really technical about the insanity of apex CNAMEs, and not skirt around the issue like we usually do when someone posts on the subject.  is off limits, as are any other Informational RFC applicable here that I didn't think of. Let's shut this baby down.


I'd like to nest load one document inside another, skipping the preamble and \begin{document} and \end{document} of the nested document.    So  \documentclass{article} % load some packages here \begin{document} \loaddocument{otherdocument} text \end{document}   should be the same as if \loaddocument were replaced with \input except that only the bits between \begin{document} and \end{document} of otherdocument.tex are loaded.    I could probably achieve this using LuaLaTeX but I can't be the first to be looking for this functionality yet I can't find a solution on this forum.  Is there an existing solution?  ****** EDIT ******  I thank Sam Carter for pointing out subfiles but that package doesn't allow packages to be loaded in the preamble.  If the nested file is like this  \documentclass{article}  \usepackage{amsmath}  \begin{document} \begin{equation} x=\quad y. \end{equation} \end{document}   then compilation stops, so the subfiles package won't do.  The closest to what I have in mind, judging by its documentation, is newclude but that package is old and the documentation claims it provides an \includeenv command, which LaTeX doesn't recognize.  But, unless something changes, I'll accept that answer and write my own LuaLaTeX routine.  * SECOND EDIT *  fwiw, I have written a simple LuaLaTeX routine that takes care of the problem.

My goal is to combine several documents into one, so maybe someone can recommend a different solution. More specifically, I need to input about 20 files in a master file, all from line 4 to the second-to-last line, inclusive (I am excluding the \documentclass tag, an \input{header} tag, and \begin and \end{document} tags).  I would like to have a command, very similar to @mpg's , except where the second number is relative to the number of lines in the file. For instance, something like   \partialinput{4}{-1}{pitest}   would be great. Or maybe  \partialinput{4}{\linenumber{pitest}-1}{pitest}    or similar (where \linenumber could be some command that gets the number of lines in the argument file). I would prefer not to use `subfiles', as that would require changing all the headers of the individual files. So, my questions are,   Is there a command that gives back the number of lines in another file, or Can the \partialinput command be modified to include all but the last line in a document?   I'm not very proficient at TeX or e-TeX, so the structure of the \partialinput command is not clear to me. I initially thought that making the counter look one line ahead and stop when it reaches the end would do it, but again, I don't know enough TeX to make that happen.


I haven't found out a good contour to evaluate the following integral.  $\displaystyle\int_{0}^{\infty}\dfrac{x\cos ax}{\sinh x}dx$. Well, a natural way should consider the complex integral  $\displaystyle\int_{\Gamma}\dfrac{ze^{iaz}}{\sinh z}dz$.   However, I don't know how to find a suitable contour $\Gamma$ to surround the zeros of $\sinh z$ which are $z=\pi ni $ for $n \in \mathbb{Z}$.  I'd really appreciate any help.  Best regards.

Show that $$\int_{0}^{\infty}\frac{x\cos ax}{\sinh x}dx=\frac{\pi^2}{4} \operatorname{sech}^2\left(\frac{a\pi}{2}\right) $$   I think we can solve it by contour integration, but how? and it would be better if there were two ways, the first with real analysis and the second with complex analysis.


Following illness when Ubuntu part installed on 64 bit AMD system I now do not know my Log In, can this be recovered/changed, or shall I wipe the hard drive and start again?  I have reset the Password, but cannot get past Log In as it always says it is 'Incorrect' - this is meant to be the latest Ubuntu, 14.04 I believe  I am not asking about Password but Log In

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


I have a memory of a short story in which a plucky group of scientists and researchers (and maybe students?) invent a machine that allows you to view any place and period in history.  It will revolutionize historical studies, but almost immediately the evil G-men of the oppressive government are after them, trying to seize and destroy their machine, muzzle the scientists, etc. etc.    Finally one of the G-Men catches the scrappy group of heroes.  And in a trope-breaking moment, we realize the evil government isn't really evil at all, but has realized what the scientists didn't - that being able to view any point of history anywhere on the planet will include "history" that happened just a second ago.  All privacy will be lost forever.  The scientists realize the implications of their discovery and agree to get rid of the device, but one ashen-faced scientist (or student) reveals that he had just mailed the plans for the device in the mail to a journalist, so they would be distributed to the world even if the scientists were caught.  The story ends with the G-man grimly welcoming the scientists to a new world of no privacy.    UPDATED: The story is "" (thank you, user14111!)  I can't think of any other stories that have explored this idea - the scrappy heroic underdogs fighting a faceless, repressive government... who turns out to have a very good reason for trying to suppress what the heroes are trying to do.  Are there any other stories that have explored this interesting twist on a common trope?

I read a story a long time ago, I think in a short story collection.  The main idea was that a TV had been invented that could be set to any place and time in the past, and you could see what happened there and then.  Anybody know what it was?


$f:\mathbb R \to \mathbb R$  is an infinitely differentiable function on the whole real line and $f(x)>0$ for all $x≠0$ and $f(0)=0$ and $f^{(n)}(0)=0$ for all $n \in \mathbb N$ (where $f^{(n)}$ denotes the $n$-th derivative of $f$), and let $g:\mathbb R \to \mathbb R$ defined by $g(x)=\sqrt {f(x)}$ for all $x \in \mathbb R$.  Is $g$ infinitely differentiable?  Actually, I did try out some examples and it is obvious that polynomials or any ordinary combinations of trigonometric functions is not going to make for a counterexample, if exists. I think counterexamples such that $g \not \in C^{\infty}(\mathbb R)$, exist.

Let $f: \mathbb R \to \mathbb R$ be an infinitely differentiable function such that $f(0)=0$ , $f(x)>0 , \forall x \ne 0$ and   $f^{(n)}(0)=0$ ( the $n$-th derivative ) $,  \forall n \in \mathbb N$ , then is the function $g(x):=\sqrt{f(x)}$ infinitely   differentiable ? I am having difficulty checking whether any $n$-th derivative exist at $0$ . Please help . Thanks in advance


I have both pages, but the $_SESSION["1"] is not received in the 2nd one.  UPDATE: Turns out, that if I type a number in the session, it won't work. I typed a normal string and worked.. I never saw this happening  1st  <?php session_start(); $_SESSION["1"] = "LOGGED"; ?>   2nd  <?php session_start();  echo $_SESSION["1"]; ?>   Why isn't this working?

I have one of those "I swear I didn't touch the server" situations. I honestly didn't touch any of the php scripts. The problem I am having is that php data is not being saved across different pages or page refreshes. I know a new session is being created correctly because I can set a session variable (e.g. $_SESSION['foo'] = "foo" and print it back out on the same page just fine. But when I try to use that same variable on another page it is not set! Is there any php functions or information I can use on my hosts server to see what is going on?  Here is an example script that does not work on my hosts' server as of right now:  <?php session_start(); if(isset($_SESSION['views']))     $_SESSION['views'] = $_SESSION['views']+ 1; else     $_SESSION['views'] = 1;  echo "views = ". $_SESSION['views']; echo '
Refresh
'; ?>   The 'views' variable never gets incremented after doing a page refresh. I'm thinking this is a  problem on their side, but I wanted to make sure I'm not a complete idiot first.  Here is the phpinfo() for my hosts' server (PHP Version 4.4.7):


I am not using the GUI to work in Ubuntu but rather I am using command line interface but the problem is that the font size in command line interface is very small. How can I increase the font size?

I am able to change the font in TTY by adding this script to ~/.profile:  if [ "$TERM" == "linux" ]; then      setfont /usr/share/consolefonts/Uni3-Terminus32x16.psf.gz fi   However this script is executed after login. The login prompt message is still tiny. How do I change the font size before login?


I have a map to which I added a zip code layer and another layer which contains values assigned to every square kilometer within each zip code. I'm trying to find out how many different values there are in each zip code and what they are.   So for example, if a zip code has 10 values assigned to it in total, 5 of them being 1.5, 3 of them being 2.1 and the remaining two being 6.4, this zip code basically has 3 different values, namely 1.5, 2.1 and 6.4. That is what I want to know. Is there a way to do this without manually checking all the values in every zip code?    This is a screenshot of my data. The value that I'm working with is under the column BI. I need a table which gives me a list of the long/lat in every zip code and the corresponding values. I can't do anything on excel yet since I don't know which lat/long goes with which zip code.

I'm new to ArcGIS Desktop. I have created a layer representing zip codes and overlayed it with a layer containing some data points. I want to find the min and max value of the data points in each zip code. Currently, I am manually checking the values if all the data points in each zip code but this is becoming very time-consuming and cumbersome.   Is there a faster way to do this?


I have been reading some tutorials and documentation on Rawtherapee software, specifically its exposure compensation.  I am curious how exposure is correctable after the RAW image is captured?  For example, if I take a photo of clouds that is overexposed and there is a white clipped area, how can rawtherepee correct that clipped area if all it know is that there is a bunch of white pixels. How can it restore the white pixels to non-white?  Is exposure  just a post process value that is contain in the raw file, but not a characteristic of the actual raw sensor data? If this is the case, why even apply exposure in a RAW image and not just always after the fact?  If my question seems unclear it is probably because my conceptions are unclear to begin with.

I've found that my camera (Sony A99) is very forgiving in terms of overexposure when shooting in RAW. By that I mean, I can overexposure by a stop or so and when I get home for the post processing I can underexpose it back and get all the details back.  Of course this wouldn't work in jpeg. There's no data beyond the right most area of the histogram. But not the same with RAW, data magically come back into the histogram. Why? Does the camera reserve an area of the histogram from me in case I make mistaken? If so, doesn't this mean some latitude is lost if I were to shoot correctly (perfectly exposed)?  Also, why is this only available for overexposure? But not underexposure? I don't think I'll be able to pull details out of crushed black areas.


class C():     def print_once(self):         print(self)  def print_twice(self):     print(self, self)  c = C() setattr(c, 'print_twice', print_twice) c.print_once() c.print_twice()  >>> <__main__.C object at 0x0000028116795108> >>> TypeError: print_twice() missing 1 required positional argument: 'self'  I'm aware setattr(C, ..) does the trick, but this affects future and concurrent instances of C and is undesired. Can print_twice be set only to c, such that self is passed automatically just like to print_once?

I've read that it is possible to add a method to an existing object (i.e., not in the class definition) in Python.   I understand that it's not always good to do so. But how might one do this?


I am working with a \documentclass{book} document. It contains several chapters which have very few references, so that I choose to provide them as \foonote(s). But I have a single chapter with many references. I am wondering if I can construct a subsection (or section), in the end of the chapter, which containst the references of this one. E.g.  \documentclass{book}  \usepackage[utf8]{inputenc} \usepackage{lipsum} \usepackage[french]{babel} \usepackage[Lenny]{fncychap}  \usepackage{caption}   \frenchbsetup{StandardLayout=true}   \usepackage{paralist}   \usepackage{geometry}   \usepackage[pdftex]{graphicx}  \usepackage{fancyhdr}  \renewcommand\contentsname{Table des mati\`eres}  \usepackage[colorlinks=true,    linkcolor=red,    urlcolor=blue,    pdftitle={Dossier de Candidature},    pdfauthor={Dimitrios S. Anagnostou}]{hyperref}  \fancypagestyle{mainmatter-pages}{%   \fancyhf{}% Clear header/footer   \renewcommand{\headrulewidth}{0pt}% Remove header rule   \renewcommand{\footrulewidth}{0pt}% Remove footer rule   \fancyfoot[L]{\hyperref[ToC-first-page]{Jump to Contents}}  \fancyfoot[C]{\thepage} } \let\oldtableofcontents\tableofcontents \renewcommand{\tableofcontents}{%   \clearpage   \phantomsection% Place hyperlink marker   \label{ToC-first-page}% Set \label for hyperlink   \oldtableofcontents } \let\oldmainmatter\mainmatter \renewcommand{\mainmatter}{%   \clearpage   \oldmainmatter   \pagestyle{mainmatter-pages}% }  \usepackage[affil-it]{authblk}   \usepackage{pdfpages} \setlength{\oddsidemargin}{.5cm} \setlength{\evensidemargin}{.5cm} \setlength{\textwidth}{15cm} \setlength{\textheight}{21.0cm} \setlength{\topmargin}{0in}  \newcommand{\M}{{\it Mathematica}} \providecommand\Matlab{\textsc{Matlab}}  \newcommand{\FIG}[2] { \begin{figure}[!hbt] \begin{center} \begin{minipage}{0.85\textwidth} \centering{\includegraphics[]{#1}} \caption{\label{#1}\small{#2}} \end{minipage} \end{center} \end{figure} }  \parindent0pt  \parskip10pt      \begin{document}      \title{DOSSIER DE CANDIDATURE}     \author{Dimitrios Papas\thanks{vbkvbkvbdkvbd}}      \affil{     Université\ldots}      \date{\begin{center}     Docteur en Mécanique     \end{center}}      \maketitle \thispagestyle{empty}      \frontmatter        \tableofcontents      \mainmatter        \chapter{First}      \section{First section}      \section{Expérience professionnelle}      \begin{description}      \item Depuis 09/2016     \begin{compactitem}     \item foo     \begin{compactitem}     \item foo     \end{compactitem}     \end{compactitem}      \end{description}      \chapter{Second}     \section{First}     \section{Second}     \subsection{Références bibliographiques}       \begin{thebibliography}{9}     \bibitem{latexcompanion}      Michel Goossens, Frank Mittelbach, and Alexander Samarin.      \textit{The \LaTeX\ Companion}.      Addison-Wesley, Reading, Massachusetts, 1993.      \bibitem{einstein}      Albert Einstein.      \textit{Zur Elektrodynamik bewegter K{\"o}rper}. (German)      [\textit{On the electrodynamics of moving bodies}].      Annalen der Physik, 322(10):891–921, 1905.      \bibitem{knuthwebsite}      Knuth: Computers and Typesetting,     \\\texttt{http://www-cs-faculty.stanford.edu/\~{}uno/abcde.html}     \end{thebibliography}      \end{document}   How can I include the elements of bibliography inside the subsection called "Références bibliographiques"?  Thanks in advance.

I need to add some more publications. I do not want to change the previous reference numbers, so I need to create new citations with difference reference numbering like [p1], [p2], etc. Can LaTeX do that?


I go to poke stops now and i cant get any items but can catch pokemon. I Loged into a diffrent accout and could get tose same pokestops. Did i get a soft ban? I did some soft gps hacking. That is all that happened

I'm level 10 on Pokemon Go. I've caught at least 150 Pokemon, and had no problems. Now, every time I try to catch a Pokemon, no matter the level, it just rolls twice in the pokeball, breaks free, then runs away. Can anyone provide some insight on how to fix this problem?


If ls [ab]* lists all files with names that start with a or b, Then ls [*a]* will list all files with names that start with * (everything) or a.  So why does it only list file with names starting with a?

pwd : ../bin under bin I have a directory called datafiles.  Use meta characters and the ls -lL command (with lower and upper case L) to list all filenames under the datafiles directory that contain a dot . with the letter 'f' or 'u' anywhere after the dot.  I tried: ls -lL datafiles *.*f*u  ls -lL datafiles .[f*u]     Thank you for answering. Unfortunately, none of the solutions worked the way I wanted it.  By clarifying the question, /bin/datafiles/file.backup is the root to the directory. From the /bin directory, the command I used is ls -lL datafiles followed by meta characters.  I'm looking for file.backup that has a dot and followed by f or u, not directly followed by f or u (anywhere after the dot), and not ending by f or u.


I'm unable to login with my Minecraft account. I keep on getting an invalid username/password error. I tried changing my username twice and so far it still hasn't worked.  What do I do?

I am using a premium legit version of Minecraft that I purchased. I can log into minecraft.net as well as mojang.com but I am unable to login to Minecraft the game through the minecraft.exe or the Technic launcher. The Minecraft servers are up and running fine. My internet connection is also fine. I double checked my credentials and even tried changing my password. I tried using both my username and my email. I tried all of this on two separate accounts that I own. I tried deleting my login, launcher, launcher.pack.lzma, and launcher_profiles.json and then reopening Minecraft. I tried re-downloading minecraft.exe.   Nothing has worked and I seem to have run out of options. I sent a help request to Mojang but in the meantime I was hoping that maybe you guys could offer some advice.


Think the question says it all..  I am wondering when the shadows can't be seen but are present do they still have substance and can be touched?  or are they in a different phase or something?

The few times we see Mr. Morden's invisible Shadow handlers, they are always right next to him. Such as this scene where Prime Minister Londo Mollari says goodbye to Morden's Shadow handlers.                                  Do they follow Mr. Morden even in public when there are crowds around him?  In this scene, Mr. Morden is at the Zocalo Cafe during a conversation with Vir Cotto. There are people around, so it might be awkward for the invisible Shadows to stand nearby. It would be strange if some random person tripped over the leg of an invisible Shadow.                                  Does he ever get some "alone time" such as when he sleeps or goes to the men's room?


I unintentionally left a whole cryovac tenderloin roast in the trunk of my car for 36 hours, big mistake I know!  The temperature range during that time was between 25 - 55 degress, mostly in the 35 - 45 degree range. Is it safe to eat?

I accidentally left meat in the trunk of my car, it's so cold outside it froze, can I still use it?


The density function for a random variable X is given in terms of a constant c.  Find the value of c.  What is the corresponding distribution function?  Sketch both the density and the distribution functions. Finally, find the probabilities.  5.1 $f(x)=0$ for $x<0$ and $f(x)=\frac{c}{(x+1)^4}$ for $0<x$  $P(X>4)$ $P(X<2)$ $P(1\le\ X<3)$  I get c=3 by taking the integral, and then I am a little confused as to why  $F(x)=1-\frac{1}{(x+1)^3}$  Is that because in solving for c, I ended up with $1=\frac{c}{3(x+1)^3}$, so substituting c in I get $1=\frac{1}{(x+1)^3}$?  And, then  $P(X>4)=1-P(X\le\ 4)$ $=1-(1-{1}{(1+4)^3})$ $=1/125$  $P(X<2)=1-{1}{(1+2)^3}$ $=26/27$  I guess I am a little confused about what F(x) and f(x) actually MEAN? And thus that leads to my confusion about what the differences between > and < and greater than or equal to are, etc etc in terms of the equations. The ones above I solved by comparing to the book but I still don't understand what they mean really.  So as a result, I don't really get how to solve $P(1\le\ X<3)$.

The density function for a random variable X is given in terms of a constant $c$.  Find the value of $c$.  What is the corresponding distribution function?  Sketch both the density and the distribution functions. Finally, find the probabilities.  5.1 $f(x)=0$ for $x<0$ and $f(x)=\frac{c}{(x+1)^4}$ for $0>x$   $P(X>4)$  $P(X<2)$  $P(1\le\ X<3)$   I get $c=3$ by taking the integral, and then I am a little confused as to why  $F(x)=1-\frac{1}{(x+1)^3}$  Is that because in solving for $c$, I ended up with $1=\frac{c}{3(x+1)^3}$, so substituting c in I get $1=\frac{1}{(x+1)^3}$?  And, then  $P(X>4)=1-P(X\le\ 4)$ $=1-(1-{1}{(1+4)^3})$ $=1/125$  $P(X<2)=1-{1}{(1+2)^3}$ $=26/27$  I guess I am a little confused about what $F(x)$ and $f(x)$ actually MEAN? And thus that leads to my confusion about what the differences between $>$ and $<$ and greater than or equal to are, etc etc in terms of the equations. The ones above I solved by comparing to the book but I still don't understand what they mean really.  So as a result, I don't really get how to solve $P(1\le\ X<3)$.  5.2 $f(x)=ce^x$ for $x<0$ and $f(x)=ce^{-x}$ for $0>x$  5.3 $f(x)=0$ for $x<-1$ or $x>2$ and $f(x)=cx^2$ for $-1<x<2$


First tie a stone with a string and fix it on a stick. At rest,the angle between the stick and the stone will be zero. When we start rotating the stone slowly the angle between the stick and the string (or the stone tied to it) becomes 90 degrees (at extreme). Why doesn't the gravitational force pull the stone in downwards direction? Please explain in simple way,I'm just in highschool.  Edit:Why doesn't the gravity pull back the stone?

Suppose we are given a stick and a stone tied to the stick by a string. Now if we rotate the stone around the stick the stone rises in height (see picture below). My question is which force accounts for this rise in height?     According to me (please correct me if I am wrong) this happens due to centrifugal force. The centrifugal force is directed along the string outwards, so we can resolve it into two components, one is the horizontal component and the other is the vertical component. If the mass of the stone is m, its velocity is v, the length of the string is r, and the angle the string makes with the horizontal is θ, then the total centrifugal force is mv^2/r, the horizontal component of the centrifugal force is mv^2/r * cos(θ), and its vertical component is mv^2/r * sin(θ) (see picture below). Can anyone tell me if I am correct? The directions of the forces are given in the picture, but I am not sure whether the directions are right or not. Also note that in the second picture for sake of clarity I have not drawn the direction of rotation of the stone.


Let's say I have a text file called index.html.slim that looks like this:  - if post.published?     section.post     h1 = post.title     p = post.description     a = link_to 'Read more', post   What I'd like to do is indent the last 3 lines so that the file looks like this:  - if post.published?     section.post       h1 = post.title       p = post.description       a = link_to 'Read more', post   What's the most efficient way to do this in Vim?   Right now to do this I would go to line 3 with 3  return, i to enter insert mode, spacebar twice to indent two characters and then esc to exit insert mode. To do this on line 4 and 5 I would move down with j and press . followed and then wq to save.  That's a total of 10 keystrokes. I'm sure there's a better way to accomplish this; however, I'm not sure what the best method is.

It should be trivial, and it might even be in the help, but I can't figure out how to navigate it. How do I indent multiple lines quickly in vi?


Does anyone know a how to increase the speed of the accent pop up when typing on Mac?    I am learning a new language which involves using a lot of accents, and am finding myself wishing the popup would activate quicker.   I'm sure there's a terminal command for it somewhere, but I've been searching online and can't find anything!  (Image stolen from another post)

Does anyone know how to make the character picker appear more quickly?   I use it enough now in my German language studies that it has become second nature for the critical marks and much faster than using the alt+keypress shortcuts.   Only problem is that it's so second nature that sometimes it doesn't pop up quickly enough so I end up typing the character and the number shortcut sometimes (IE u2 instead of ü). Anyone know how to make it appear with less delay? Ideally, I'd love if I could just hold the character and press the number but it appears that OSX insists on waiting for the menu to pop up.


in C#  I am trying to get both the URLs and the InnerTexts from a text file, I don't have access to a DOM object on the device (only a text file) I am using so have only RegEx to use.  I want this text   I would need all these sets throughout the text file:  URL = /LinkClick.aspx?fileticket=a random text string TITLE = I want this text

Im trying to craft a regex that only returns <link> tag hrefs  Why does this regex return all hrefs including <a hrefs?       (?<=<link\s+.*?)href\s*=\s*[\'\"][^\'\"]+        <link rel="stylesheet" rev="stylesheet"      href="idlecore-tidied.css?T_2_5_0_228" media="screen">     Slash Boxes   thank you


I recently learned an amazing fact via .     "A good forensic examiner can recover the original data from a hard disk that’s been erased as many as nine times"   Curious to understand how this is possible, I looked into how erasing works.  At first sight, the fact above can be explained by the fact that "Most file systems only remove the link to data" (). However, what I found most mystifying, is the following sentence: "But even overwriting parts of the disk with something else or formatting it may not guarantee that the sensitive data is completely unrecoverable". How can that be?

I deleted lots of files & folders on my laptop and then I put a new files in the same folders. I need to recover the deleted files. I tried a lot of recovery software and I couldn't recover my old files.   I read that if you refill the folders with new files after deleting old ones then I can't recover them again. Is that true?   What should I do?


The next week I have a test over Improper Integrals and yesterday started to solve some problems that I've found on th Internet. Everything was fine until I stuck on this example:     Determine if the following integral is convergent or divergent.  If it is convergent find its value - $$\int^{\pi/2}_{0} \ln(\cos x)dx$$   Any ideas how to test the integral is convergent or divergent?

Evaluate: $ \displaystyle \int_0^{\pi} \ln \left( \sin \theta \right) d\theta$ using . Given hint: consider $f(z) = \ln ( 1 +z)$. EDIT:: I know how to evaluate it, but I am looking if I can evaluate it using Gauss MVT. ADDED:: Here is what I have got so far!! $$\ln 2 = \frac{1}{2 \pi } \int_0^{2\pi } \log(2+e^{i \theta}) d\theta = \frac{1}{2 \pi } \int_0^{2\pi } \log(2+e^{-i \theta}) d\theta$$ Hence, $ \displaystyle 2 \ln 2 = \frac{1}{2 \pi } \int_{0}^{2 \pi} \log(5 + 4 \cos \theta )d \theta  = \frac{1}{\pi} \int_0^{\pi} \log(1 + 8 \cos^2 \theta) d \theta$,  now to problem is how to reduce it to the above form?


My requirement is to create folder with year ("Y" + yyyy, for example Y2019) and a sub folder inside that folder with month and year (yyyymm, for example 201904) and then I need to move my file inside that folder.  I have analyzed and found code to get year and month from current date only.  %DATE%   I have successfully retrieved the file created date using the following command, but could not able to found a way to get only year and month from this.  dir /T:C filename     Please provide a way to get year and month from a date retrieved from a file.

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


I prepared a pumpkin soup with the secondary ingredients being onions, ginger, garlic, cream, chilli, nutmeg, pumpkin seed oil, and sage. I accidentally added too much of the latter. I wish to neutralise this.  I found and tried the following so far:   General counteracting advice like diluting and adding more of (almost) everything else, both of which I do not wish to do. Physically removing the sage, which are not applicable in my case since the sage was ground.     Adding sugar (or sweet ingredients). I did this to some extent, but perceived no effect. While the sweetness hasn’t spoiled the soup yet, I am afraid that adding more of it might.  recommends to add potatoes, which are claimed to soak up excess spices (in general). I am skeptical about this claim since I cannot find any other source corroborating this. Said source uses a very distancing language in this section. Moreover, if potatoes really suck up flavours in general, they may be of little use for me due to sucking up everything else. By chance, I found that adding salt (or salty ingredients) reduces the effect, but only to a certain extent. Also, this comes with the downside of the soup being overly salty.   Are there any other ways or reasons to assume that my assessment of the above options is too pessimistic?

This happens to all of us - be it because we misread the recipe and threw in a tablespoon of sage when it said a teaspoon of sage, or because we were bravely experimenting with new tastes and suddenly noticed something amiss. The question also covers cases where the food is normally seasoned for the average person, but an eater hates a certain aroma and perceives it as strongly unpleasant, and cases where the unwanted aroma does not come from seasoning, but e.g. from burning the food.   In the end, we have a batch of smelly food and wonder where the Undo button is. How do we save it and make it tasty again?


I am writing a two column document. I am trying to fit following equation in one column.  I read following thread and tried to fit my equation to the given solution but it didn't work    \documentclass[conference]{IEEEtran} \usepackage{amsmath,graphicx,amssymb,mathtools,mathdots,bm,fixltx2e} \usepackage[ansinew]{inputenc}  \begin{align*} \mathbf{x}^{(m,n)}_{ITI}&= \left[xxxxx \cdots xxxxx xxxxx  \cdots  \\                          &  \hphantom{{}=1 }  xxxxx \right]^T  \notag\\ \end{align*}  \end{document}     %-----------error--------------------  ! Extra }, or forgotten \right. <template> }             $}\ifmeasuring@ \savefieldlength@ \fi \set@field \hfil \endtempl... l.68 \end{align*}  %-------------------------------------

I want to align equations (using the align environment from the amsmath package) inside matching \left( and \right) commands. For example:  \documentclass[a4paper,12pt]{article}  \usepackage{amsmath}  \begin{document}  \begin{align}     a \left( b &= c \right)\\     d \left( e &= f \right) \end{align}  \end{document}   But that code gives this error:     Extra }, or forgotten \right.   The error disappears when I remove the delimiters. Is there a workaround for this?


I just got charged $88 for an ESTA using a non-standard site.   Has anyone got any ideas as to whether I can get a refund?

A quick search for ESTA application returned many results. According to , the official site to apply for an ESTA is .  Are the others scams, legitimate third party resellers or "added value" services?    (defunct - domain is for sale circa 2020)     Can anyone confirm either way?  Updated 2020: The above have better "not affiliated with the U.S. Government" warnings now, but beware there are newer more sneaky sites starting all the time:        And fortunately more official guidance about this issue: