$f(n) = n + (\log n)^{2}, \quad g(n) = n + \log(n^{2})$.  Log is assumed to be base 2.  Now I put this in the as $f(n)/g(n)$ which is of the form $\frac \infty{\infty}$.  So then I applied L'hopital's rule giving me  $f(n) = 1 \ + \ 2 log(n) \frac1{n(ln(2))}$   $g(n) = 1 + 2\ \frac1{n(ln(2))}$ now if I do $f(n)/g(n)$ I  get  $\frac {1 \ + \ 2 log(n) \frac1{n(ln(2))}} { 1 + 2\frac1{n(ln(2))}}$  Now since the $\frac1{n(ln(2))}$ part in both equations tends to 0, I'm left with 1/1 and thus $f(n) = \Theta g(n)$  Is this correct?

$f(n) = n + (\log n)^{2} , g(n) = n + \log(n^{2} ).$  Now so far I've done $g(n) = n+ 2\log(n)$  and then I think since its the same change to both, I can remove $n$.  leaving me with $f(n) = (\log n)^{2}$ and $g(n) = 2\log(n)$ now if I do $f(n)/g(n)$ I  get  $((\log n)^{2}) / (2\log n)$   and since the numerator is growing exponentially and the bottom is growing linearly? As we approach positive infinity the function approaches positive infinity. Thus $f(n)$ is $\omega$ of $g(n)$?  I don't know if this proof is done right, if its what is a better alternative? I am still new to this and learning!


It seems there are many negative terms for people who live in the country and lack urban experiences: hick, bumpkin, hillbilly, yokel, okie, hayseed, etc.   What about the opposite scenario where a person from the city lacks practical experience in a rural environment?   The closest I can come is 'city slicker' but that is a bit clumsy and doesn't quite capture the essence of naïveté I'm looking for. I'm open to non-English terms as well.

I'm looking for something people from rural area would use, especially when they refer to that person's inability to adapt to the country life.


Unclear how to use this forum correctly, but my question is simple. That said, I can't find the info anywhere. What time did TOM4656 land on 18 Jan 2020? Could someone find the info and give me a link or screen grab so that I can prove to my travel insurance that this flight was delayed about 7 hours and 20 minutes. WHen we finally landed I turned on my phone and of course received a message from Vodfone, and that was at 18:04 (instead of the planned arrival of 10:40). tx.

The question  only deals with flights in the US sourced from the  . Is there some similar source for EU, Asia etc?


I've been afraid to care very much for the "reboot".   Does the Star Trek Movie reboot mean that Star Trek TNG (et. al.) never happened?  If so, the implications of liking it are that I put aside my beloved series. (Although the pacing on Voyager's final episode was so wrong that I felt betrayed.)  What does it mean? What are the implications that I haven't thought of? Thanks!

Usually, in Star Trek, when there's a timeline change, the indication is that the original timeline is gone and replaced with the new one.  In City on the Edge of Forever, Kirk makes a comment that if they don't get the timeline straight, that millions of people who never died before will die.  Much of the time travel in Trek created suspense by declaring a need to restore the original timeline.  It's already been discussed in other questions about how, in the new movie (simply titled Star Trek with no subtitle or series number) they were unable to restore the original timeline.  While some of this is open to interpretation, it seemed like in this instance, for the first time, in Trek, there was an alternate timeline that was seen as an alternate possibility - no reference was made to it replacing the original timeline.  In this movie, was there any reference to the original timeline still existing?  In this movie, was the original timeline still considered to be intact?


Suppose $V$ is a finite dimensional vector space over the field $\mathbb C$, and $T \in \mathcal{L}(V)$ is an arbitrary operator operating on $V$. Then $T$ is diagonalizable iff $V=\operatorname{null} (T-\lambda I)\oplus \operatorname{range} (T-\lambda I)$ for all $\lambda \in \mathbb C$. The first implication is obvious. It is well known that for any operator $T$, $V=\operatorname{null} T \oplus \operatorname{range} T$, so one implication immedaitely follows. For the secodn implication, i dont know where to start any help is appreciated

If $\textsf{V}$ is a finite-dimensional complex vector space, $\textsf{T}\in\mathcal{L}(\textsf{V})^1$, $\lambda$ is arbitrary in $\mathbb{C}$ and if    $$\textsf{V} = \text{null}(\textsf{T}-\lambda\textsf{I})  \oplus \text{range}(\textsf{T}-\lambda\textsf{I})$$   then prove that $\textsf{T}$ is diagonalizable.   Attempt : I am solving Axler's 3 edition book in Exercise $5c.$ The book hasn't introduced the Jordan normal form or the generalized eigenvectors. Could someone please give a direction to move ahead.  Thanks a lot for your help.    $^1$ $\mathcal{L}(\textsf{V})$ is the set of all linear maps from $\textsf{V}$ to itself.


I need a desktop database that will have a need for extensive 1-many, many-1, and many to many relationships.   I've built this kind of app with Microsoft Access, which I don't love, but does combine the database and a useful GUI.  Relational Database apps for Mac seem pretty thin. Filemaker's "relational" features are not much like anything I've used before.   Panorama is interesting, but also not really relational, no SQL, etc.   Is there a database system for Mac that functions similar to Microsoft Access?  UPDATE: While I am quite happy to use most of the tools suggested so far, I am looking for something which has an interface that non-technical types can use. It doesn't have to be as sophisticated as Access (which isn't all that sophisticated, I guess), but something more than a management tool. I should have been clearer; I thought the parallel to Access would speak for itself.  As far as I can tell, Filemaker is not an SQL database, though I guess it can speak to SQL databases in some way, so maybe I could kludge something together there. I'll try out the MySQL and SQLite tools as well, though they appear to be management tools...

Is there a database program for the Mac that makes it easy to import a CSV file into a table and then query and manipulate the data using ad-hoc SQL queries?  (A Windows example of a similar product would be Microsoft Access ... it also has forms and reports, which are not as important, but I would not mind a Mac solution that has those too.)


I have a Script called "test.sh" in my Home Directory  I want to be able to run it in crontab.  I have added  * * * * * /home/tom/test.sh   to the crontab however it doesn't seem to be excecuting.  I can excecute ./test.sh fine normally in a Terminal Window.  Edit:   This is the content of my script "test.sh"  #!/bin/sh gnome-terminal -- sh -c 'cd Server && ./start.sh'   It creates a new terminal window, changes directory to Server and runs another executable script.  I do not know if this has something to do with the script not working in Cron.  The error I get in /var/log/syslog is:  CRON[18694]: (tom) CMD (sh /home/tom/test.sh) CRON[18693]: (CRON) info (No MTA installed, discarding output)

I really read many tutorials, but crontab doesn't start notify send.  What I've tried:   etc/crontab  added at the end:  15 * * * * notify-send 'crontab' 'test'  with crontab interface:  crontab -e   added at the end:  15 * * * * notify-send 'crontab' 'test'


I can't figure out who made this or what brand maker it is. It has the serial number and on top of it it has a different number.  G0Q230-2 Wbdo26l0431p

I have a bike I'm trying to sell because it's just been sitting in my basement. It looks as if someone primered it and the only thing I found was a serial number. Is there like a website I can look up more info on the bike using just that number?


. I can't award a bounty to this question. But I need an answer to this question. Is it possible to award a bounty to questions ?   Note: I'm not fully familiar with the bounty system.

It's possible to offer and award bounties of reputation on questions.   What is a bounty? How can I find questions that have a bounty attached? How do I start a bounty? When can I start a bounty? Why is the system requiring me to choose a bounty amount that's higher than the minimum? Can I use Markdown formatting in the bounty remarks? Can I edit the remark? How long is the bounty period? How do I award a bounty? Can I award a bounty to my own answer? Can I award a bounty to an old answer? If I offer a bounty on someone else's question, can I award the bounty to their answer? After awarding the bounty, can I remove it or move it to another answer at a later time? What happens if there's no answer after the bounty period? What happens if I feel my question is still unanswered? What is automatic awarding? Are bounty awards exempt from the 200 points/day reputation limit? How does Community Wiki mode affect bounties? How does user deletion or post dissociation affect bounties? Can I award a bounty to an answer from a deleted user or one where the author was dissociated? Can I offer a second bounty after the first one has expired? Can I raise my bounty? What happens if a bounty question is closed or deleted? Why can't I vote to close or migrate a bounty question? What happens if I delete my account while I have an active bounty? Do I keep an awarded bounty when I delete my answer? What happens if a question where I awarded a bounty later gets deleted or migrated? Can I cancel my bounty? Can I affect / divide / share part of my bounty to two (or more) users? How many outstanding bounties can a single user have?      See also:  in the Help Center


I'm trying to create multiple instances of an object and store it in an array. However, the last instance of it overwrites the previous ones. Is their a way I can create each individual object?  I've tried creating an array and filling each individual object separately. I've also tried creating new instances of it.  class Card {  private static String name;   public Card(String name) {   this.name = name;  }   public String getName() {   return name;  } }  public class Main {  static Card[] deck = new Card[5];  public static void main(String args[]) {   deck[0] = new Card("Ace");   deck[1] = new Card("Club");    System.out.println(deck[0].getName());   System.out.println(deck[1].getName());  } }   The output of deck[0] should be "Ace" while deck[1] should be "Club".  What is outputting is "Club" twice. How can I fix this?

To be specific, I was trying this code:  package hello;  public class Hello {      Clock clock = new Clock();      public static void main(String args[]) {         clock.sayTime();     } }   But it gave the error      Cannot access non-static field in static method main   So I changed the declaration of clock to this:  static Clock clock = new Clock();   And it worked. What does it mean to put that keyword before the declaration? What exactly will it do and/or restrict in terms of what can be done to that object?


In GitHub, I already have an Automata repository with 1 project in it. I just want to add more projects in this repository. I wish to create different folders inside the Automata repository so I can better organize my projects. In other words, my question is "how to add a folder inside a repository?"

How can I add an empty directory (that contains no files) to a Git repository?


I am currently using Ubuntu 14.04.04 LTS Trusty Tahr. Ubuntu 16.04 LTS Xenia Xerus has been released but Software Updater so far has not notified me as it has other people, e.g.:      Note that I am talking about just LongTerm Support releases, not intermediate releases like 15.10, such as some questions address.  The Updater settings should be allowing this notification to occur:      When will the 16.04 notification occur?  (If the setting for new versions is changed to "For any upgrade", the Software Updater dialogue offers Ubuntu 15.10. Why?)

I'm following the , but on launching the upgrade tool I get this response:  Checking for a new ubuntu release No new release found   Am I doing something wrong? Is there a workaround?


Let $G$ be a bipartite graph with a perfect matching. Prove that $G$ has a node $v$ for which every edge incident to $v$ belongs to a perfect matching.   I don't think that this question is true if all the edges incident to $v$ belongs to the same perfect matching.  My attempt: Suppose $v$ is not incident to any perfect matching of $G$. This implies that $G$ cannot have a perfect matching, which is a contradiction.  Am I on the right way, thanks for your comment.

A matching or independent edge set in a graph is a set of edges without common vertices.    A perfect matching (also called 1-factor) is a matching which matches all vertices of the graph.    a bipartite graph (or bigraph) is a graph whose vertices can be divided into two disjoint sets and (that is, and are each independent sets) such that every edge connects a vertex in to one in.    Now imagine a bipartite graph like G which has a perfect matching. Prove that there exists a vertex in G like V such that every edge connected to G is in a perfect matching.  Note : I tried to prove it but i have nothing to start with ! Thanks in advance.  Edit : The graph is a simple undirected graph and i don't know anything about "strongly" connected graphs.


According to   the following should work:  x = list(range(0, 10, 100)) print(x)   but it prints [0], while I am expecting [0,0.01,...,10] What am I missing?

Is there a way to step between 0 and 1 by 0.1?   I thought I could do it like the following, but it failed:  for i in range(0, 1, 0.1):     print i   Instead, it says that the step argument cannot be zero, which I did not expect.


Since $i^2 = -1$, then doesn't $i = \pm \sqrt[2]{i}$? How does $i$ only equal the plus part?

Does $\sqrt{-1}=\pm\sqrt{-1}$ since it has 2 solutions for roots? Note the link says there are two complex square roots for -1 which are $i$ and $-i$ .


GNU GRUB version 2.02 beta2-9ubuntu1.3 Ubuntu Advanced options for Ubuntu Memory test Memory test serial console 115200 Windows 8 (Loader)   Recently I decided to install Ubuntu and Windows 8.1 in different partitions. They both work. The problem is that I want that the windows run with no key before 5 seconds, or put it the first.

I have both Windows 7 and Ubuntu installed on a shared machine. Because a lot of the non-developers use Windows, I'd like to change the boot order to make it easier for them.  Currently the boot order looks like the following:   Ubuntu 11.10 kernelgeneric *86 Ubuntu 11.10 kernelgeneric *86 (safe boot)  Memory test Memory test Windows 7 on /dev/sda6   How do I change the default order so that Windows 7 is at the top of the list?   Windows 7 on /dev/sda6 Ubuntu 11.10 kernelgeneric *86 Ubuntu 11.10 kernelgeneric *86 (safe boot)  Memory test Memory test


I can reference a figure (or table) from text using \label(fig:example) between \begin{figure} and \end{figure}, and using \ref(fig:example) within my text.  However, my figures are at the end of my document (a long document), and after I look at any of the figures, I would like to go back to the text where I left for the figure.  Is there any command that can link me back to the text from the figure so that I don't have to scroll back up to look for the text?

The backref option and its variants in the hyperref package allow to  in the bibliography to the page(s) or section(s) in which a given reference was cited.  The target of the back-reference is the beginning of the page (or of the section, depending on the option) in which the citation occurs (see backref manual).   How can I get the back-reference links to point precisely at the line in which the citation key occurs in the text?  Apparently, someone had a  with "runners" on the side of the page, but the solution hinges on the definition of the runners themselves.  I am looking to obtain, in the back-reference, the same behavior of the link from in-text citation to reference (i.e., point to the line of the reference in question), just backwards.  Any suggestion will be appreciated.  Edit Below is a minimal working example: the in-text citations are evenly spaced in the page and the back-reference commands in the bibliography should point to them, instead to the top of page.  \documentclass[10pt,a4paper]{article} \usepackage[utf8]{inputenc} \usepackage[T1]{fontenc}     \usepackage[pagebackref]{hyperref}     \begin{document} Top of page \vfill \cite{Cleveland2007} \vfill \cite{Spence1999}  \newpage  \begin{thebibliography}{2} \providecommand{\natexlab}[1]{#1} \providecommand{\url}[1]{\texttt{#1}} \expandafter\ifx\csname urlstyle\endcsname\relax   \providecommand{\doi}[1]{doi: #1}\else   \providecommand{\doi}{doi: \begingroup \urlstyle{rm}\Url}\fi  \bibitem[Cleveland(1984)]{Cleveland2007} WS~Cleveland. \newblock {Graphical perception: Theory, experimentation, and application to   the development of graphical methods}. \newblock \emph{Journal of the American Statistical Association}, 79\penalty0   (387):\penalty0 531--554, 1984.  \bibitem[Spence et~al.(1999)Spence, Kutlesa, and Rose]{Spence1999} I.~Spence, N.~Kutlesa, and D.L. Rose. \newblock {Using color to code quantity in spatial analysis}. \newblock \emph{Journal of Experimental Psychology: Applied}, 5:\penalty0 393,   1999.  \end{thebibliography} \end{document}   I compile with Pdflatex, twice.


I know this question has been frequently asked but I can never seem to get it to work. Can you tell me what's wrong?  I have three divs within a #container div, which I want to centre side by side. The #container is 1000px wide (I want to keep it that way). Here is my code:    #container {   margin-top: 500px;   position: absolute;   width: 1000px; } .related-article {   background-color: #D6A400;   display: inline-block;   width: 230px;   height: 300px;   border-radius: 30px;   margin-bottom: 0px; } .related-article > img {   width: 200px;   height: 150px;   border-radius: 15px;   margin-top: 15px; } .related-article > h3 {   font-size: 15px;   width: 180px;   text-align: justify;   margin-left: auto;   margin-right: auto;   color: #f1f1f1;   font-family: Abel, serif;   margin-bottom: none; } a {   text-decoration: none; } #right {   float: right; } #left {   float: left; } #center {   margin-left: 385px;   margin-right: 385px; }

Here's what you'll do!

Constructing amazing fossils you never even dreamed of

Studying ancient marine biology

Uncovering the world's greatest mysteries

     All help would be gladly appreciated.

How can I horizontally center a
 within another
 using CSS?

Foo foo


Can i create a query in order to extract records from MobileConnect Subscriptions and MobileConnect Demographics?

In trying to develop a process to deal with MobileConnect Contacts, I have come to understand that the old SMS DE _SubscriberSMS has been deprecated and that the new DEs that will contain this information are: _MobileAddress and _MobileSubscription. I presume that these DEs contain information about the Contact (with a primary key of mobile number or SubscriberId) and the contacts' subscriptions, respectively.   The information that was given to me (by ET) about _MobileAddress was that it contained the following fields:  City   ContactID   CountryCode   CreatedBy   CreatedDate   FirstName   LastName   MobileNumber   ModifiedBy   ModifiedDate   State   Status   ZipCode    However, when I try to set up a query like SELECT MobileNumber FROM _MobileAddress, I am told that that field does not exist. If I modify the DE to something like _MobileAddressX it tells me that DE doesn't exist, so presumably _MobileAddress exists and has an unknown set of fields.  Can anyone tell me how to get more information about _MobileAddress and _MobileSubscription?   What fields do they have?   Can I access it via API or only through Queries?   Since MobileConnect does not seem to support a series of functions for maintaining Mobile Contacts, it would be infinitely useful to be able to access those contacts and their subscriptions at the data level.


How to wire gfci to aluminum wiring. Have not tried to yet, i want to be sure as to how first. I've been told of using no-ox and 6" copper pig tails.

My house has aluminum wiring, which from what I understand isn't recommended any more. How do I replace a plug or switch since the new unit only takes copper wiring?


I have looked at  solution and while it works for items without labels in my case I have the labeling environment (to be more specific: \begin{labeling}{alligator} ... \end{labelling}) and obviously a labeling list without labels doesn't make much sense.  Currently it looks like this (right part is cut off since it's not related to the issue):    Initially (before I added the Python 3.4 item) it looked okay but then I noticed that due to the length of some of the labels things weren't "looking" as if they had the same alignment especially since my labels are also bold which makes the issue even more visible.  I would like to feed a line break and get the following result:    I've just started learning about defining custom commands (or redefining present ones) and I'm having a tough time figuring out how to do that for the \item[...] command. Adding \mbox{}\\ after every single item is a lot of unnecessary work and even if I didn't have to do it (that is another solution for my problem is present) I would still like to know how to handle such commands.  I have tried  \let\OldItem\item \renewcommand{\item}[1]{\OldItem[#1]\mbox{}\\}   but it results in a horrible mess (plus it doesn't fix my issue at all):    Any ideas how to do this?

How can I ger a line break after the label of a description environment item? I'd like to keep the indentation and the bold face for the item label, but I'd like to have the body of the item in a separate paragraph, because it starts with an itemize environment and indenting that looks really strange.  Adding \\ does not work (error message “no line to end here”), neither does a blank line or \par (no effect). Even \,\par has no effect.  Example:  \documentclass{article} \begin{document}  \begin{description} \item[Animals:]   \begin{itemize}   \item Dog   \item Cat   \item Fish   \end{itemize} \item[Colors:]   \begin{itemize}   \item Red   \item Green   \item Blue   \end{itemize} \end{description} \end{document}   It renders like this:


A function $f: X \rightarrow \mathbb{R}$ is said to be mid-point convex if for all $x, y \in X$, we have  $$f(\frac{x + y}{2}) \leq \frac{f(x) + f(y)}{2}. $$ Can you please give an example of a function which is mid-point convex but not convex?

Rudin's Real and Complex Analysis Chapter 3 Exercise 4 is:  Assume that $\varphi$ is a continuous real function on $(a,b)$ s.t. $$\varphi\left(\frac{x+y}{2}\right)\leq \frac{\varphi(x)+\varphi(y)}{2}$$ for all $x,y\in(a,b)$. Prove that $\varphi$ is convex.   The conclusion does not follow if continuity is omitted from the hypotheses.  My question is, is there some way to explicitly construct a counterexample such that  $\varphi\left(\frac{x+y}{2}\right)\leq \frac{\varphi(x)+\varphi(y)}{2}$ for all $x,y\in(a,b)$, but $\varphi$ is not convex?


I installed Lamp server in UBUNTU 16.04 with the command: sudo apt-get install lamp-server^.  The installation completed successfully. After that when I opened localhost in browser it displayed the "Apache2 Ubuntu Default Page".  BUT  When I am trying to open localhost/phpmyadmin I'm getting 404 error.  I'm not able to understand what is wrong here. Can anyone suggest a solution?  Note: Although this question may seem similar to the one here "", but the process I used to install LAMP is different than the one mentioned in that question. None of the solutions given there work either. Solutions suggest smylink for conf files, but when I try that it says the file or folder doesn't exist. I'm not very technical person, but I'm guessing my LAMP setup may be different from the one mentioned there.

I regularly set up Virtualbox ubuntu setups to run as local webservers. I have set these up several times and never had an issue. However, something has changed:  1)VB guest additions no longer allow me to copy and paste (I'll worry about that later)  2)More importantly phpmyadmin no longer works as installed - Initially going to localhost/phpmyadmin gave a message that the page could not be found. So I have followed some instructions which told me to do the following in var/www:  sudo ln -s /usr/share/phpmyadmin phpmyadmin   which has created a phpmyadmin directory in /var/www but now I get an error saying:      the mysqli extension is missing.   If I run phpinfo mysql and mysqli are listed.  All I have done so far is   sudo apt-get update   sudo apt-get install apache2 sudo apt-get install php5 sudo apt-get install mysql-server   and   sudo apt-get install phpmyadmin    I found a post of a similar question which suggested I should do   sudo apt-get install php5-mysql   (I've done this) and edit php.ini and uncomment the line:  extension=mysqli.so   This is not there, so I tried adding it but no joy. I have restarted apache and still no phpmyadmin.  I'm running a windows 7 machine and the guest os is ubuntu 12.04


I need your help to answer the following problem:  Let $f(x)=x^6+3\in\mathbb{Q}[x]$  Let $\alpha$ be a root of $f(x)$ and $L=\mathbb{Q}(\alpha)$.     a) Show that $L$ is a splitting field for $f(x)$ over $\mathbb{Q}$   Hint: Show that $w=\frac{1+\alpha^3}{2}$ is a primitive sixth root of unity.     b) determine $Gal(L/\mathbb{Q})$ .   I answered question a) but i don't manage to answer question b).  Thanks

I have some problems with this exercise. I don't know if it can be done. Consider the polynomial $ x^n - a \in \mathbb{Q} $ Can I compute the Galois group of this over $\mathbb{Q}$? Maybe having a nice "basis.  The splitting field is given by $\mathbb{Q}(\zeta_n,\alpha)$ , where $\zeta_n$ is a primitive root of unity , and $\alpha$ is some number such that $\alpha^n = a $. Well first of all, I want a $\underline{"good basis"}$ for the splitting field. In the sense that the minimal polynomials, of the adjoined elements, are different (in this case the computation of the galois group is very simple).  For example one easy case, it's when $a>0$, then $(a)^{\frac{1}{n}} \in \mathbb{R}$ , so clearly the minimal polynomial of $(a)^{\frac{1}{n}} , \zeta_n$ are distincs, and I'm done. If $n$ is odd then , it's also easy, since one root it's also real, for example $x^3-3 $, the real root is $ \root 3 \of { - 3}  =  - \root 3 \of 3  $ , so I can consider the splitting field as $\mathbb{Q}(-\root 3 \of 3 , \zeta_3 )=\mathbb{Q}(\root 3 \of 3 , \zeta_3 )$. The difficult case is when $n$ is even and $a<0$ , for example  $x^8+20$ or $x^4+20$ in some cases as in the second, there are particular cases since there exist algorithms for the Galois group of quartics, but in general. It can be done?  $\underline{Remark}$ I'm searching a $\underline{"good basis"}$ for the splitting field. In the sense that the minimal polynomials, of the adjoined elements, are different since in this case the computation of the galois group is very simple.


I am consolidating incorrect entries in a table. Specifically for this online shop there are manufacturers and their article numbers. Sometimes manufacturers have been created twice with two different names, such as "VHY" and "Vishay" which should be the same. So I want to consolidate this into one correct manufacturer.  I have the following SQL statement:  /** Old Manufacturer Name **/ DECLARE @old varchar(100) = 'VHY'; /** New Manufacturer Name **/ DECLARE @new varchar(100) = 'VISHAY';  /** Updating the table **/ UPDATE [ESO65].[dbo].[ESO$Manufacturer Item] SET [Manufacturer Code] = @new WHERE [Manufacturer Code] = @old   Unfortunately I get the error message:      Violation of PRIMARY KEY constraint 'ESO$Manufacturer Item$0'. Cannot insert duplicate key in object 'dbo.ESO$Manufacturer Item'.   This is because there are duplicate entries where Manufacturer Code = VHY, Manufacturers Item No_= TEST and Manufacturer Code = Vishay, Manufacturers Item No_= TEST. So this is the duplicate object violation.  How do I delete all entries for old where there is double entries and then rename the old to new?

Assume a table structure of MyTable(KEY, datafield1, datafield2...).  Often I want to either update an existing record, or insert a new record if it doesn't exist.  Essentially:  IF (key exists)   run update command ELSE   run insert command   What's the best performing way to write this?


I have a portfolio page, which includes websites that I made with links to them. Should I make nofollow links to them? Or does having do-follow links help me?

I have 20 sites in the same domain, different niches and I want to interlink them for USER EXPERIENCE. I want to know from someone who tested this:  Will using a nofollow attribute for the links keep the sites safe from google link scheme penalties?


Suppose I am sitting in an office chair in a room. Now someone just starts to rotate the chair. The chair is now rotating quite fast. I think my arms will be   pulled outwards.  Now from my point of view I am sitting still but the room and chair base is being rotated the same axis. Why do I feel my arms getting pulled still?

When I'm rotating, I feel centrifugal force. But if I were the only one in the universe and rotating, wouldn't I just kinda be still (since I'm not rotating with respect to anything) or would there just be a force pulling me out? What if there were another person a billion miles away, this should not change anything, right?


I faced with some compilation issues, here is details:  Lets say I have a declared of some data structure my_data_struct<typename T>. The reason I use templates here is I want my data structure to be able to work with any data type (Like std::stack or std::vector do)  In that case, if I don't know the final types it will be used for, I must define and declare my structure in one file.  Lets say then, I have couple of other libs (divided by .h declaration and .cpp definition). Each of them use my_data_struc.  Finally, lets say I have main.cpp file where "all comes together" with #include's.  How could I get compile my program?  If I will compile my cpp files separately to object files, and will try to link them togather, I will receive multiple definition of error, because my_data_struct will be defined couple of times...  The only way I realize, is to move definitions of my libs to its declaration (.h) files and then just compile the main.cpp all at once. But, is it the right way to compile programs like that? Or is there is any better way how to build and compile such stuff?  I didn't find any best practices of how to proceed with it...  Thanks in advice.   UPD:  Well, while creating example, I figured out that the actual issues is caused not by template class, but by non template functions that exists beside the class in the same namespace:  //mydatastruct.h #ifndef MYSTRUCT #define MYSTRUCT  namespace G{     template<typename T>     class my_data_struct{         public:          my_data_struct(){};         ~my_data_struct(){};         int do_something(int a){ return a; };         //...     };      int test(int b){ return 2; }; }  #endif   // a.h #ifndef A_H #define A_H  #include "mydatastruct.h"  class A{     public:     A();     ~A(); };  #endif  // a.cpp #include "a.h" A::A(){} A::~A(){}   // main.cpp #include "a.h" int main(){ return 0; }   Compiling:  g++ -c a.cpp -o a.o g++ -c main.cpp -o main.o g++ a.o main.o -o main.exe   And the actual error is:  main.o:main.cpp:(.text+0x0): multiple definition of `G::test(int)' a.o:a.cpp:(.text+0x0): first defined here

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


i'm currently studying Java and i want to know what is the difference between implementing Runnable to a class and declaring a new thread and executing what you need inside.   Thread t = new Thread(){      public void run() {     //code here     } }; t.start();   vs  Thread t = new Thread(My_class_with_runnable_implementation); t.start();

From what time I've spent with threads in Java, I've found these two ways to write threads:  With implements Runnable:  public class MyRunnable implements Runnable {     public void run() {         //Code     } } //Started with a "new Thread(new MyRunnable()).start()" call   Or, with extends Thread:  public class MyThread extends Thread {     public MyThread() {         super("MyThread");     }     public void run() {         //Code     } } //Started with a "new MyThread().start()" call   Is there any significant difference in these two blocks of code ?


Before I begin, I'd like to point out that my primary interests aren't actually in literature/linguistics, but within the domain of music. However, I have come accross a problem I feel is of much concern and is in essence a problem with the (English) language, in part that is, not as a whole.  Anyway, I am writing a song about a person who is climbing a mountain, but they are doing so both physically, and then metaphorically. This is a song that is supposed to represent human weakness and strength, and so naturally that includes both men and women.  The lyrics go something like this:  1.2-2 Oh...  2-3 Will he...  3-4 Sur-vive?  4-5 and climb this   5-6 Mounta…ain  ?  5.2-6 He will do   6-6.2 One   6.2-7 Of only  two things  7-7.2 He  7.2 - 8  Will fail and fall into the dark  The lyrics presented are not meant to be grammatically correct, to me they just need to represent the words to fit the song. Also, the numbers are just units of time, but that doesn't matter here.   So, as you can see, I used what I think is a pronoun, the word 'he', to generalise the term to both males and females. Now, whilst this is common practise, I do not think it is good practice, so I was wondering if there may be another, ideally single syllable word, that one could use to describe both males and females.   I feel that such a word really should be integrated into the English language, as it would be much more effective than s/he, or even worse, just he.

Is there a pronoun I can use as a gender-neutral pronoun when referring back to a singular noun phrase?  Each student should save his questions until the end. Each student should save her questions until the end.


I am using the following basic RGB color scheme for my website:  43/66/79  84/129/156  79/68/43  156/122/84  176/176/176  79/79/79  I would like to extend the pallette, but not in a random way. I would like to apply known theories of how that is systematically done.  Can someone refer me to reading on the subject, or perhaps even better, places on the net that allows me to enter the base colors and receive suggestions on extentions.

I have a set of colors on a webpage where one color is the main one:  #864062 <-- main color #853f61 #925071 #541c38 #64304A #eac9d7   Now I would like to derive similar color scheme for any arbitrary main color.   My idea was to:   Convert all colors to decimal notation (r, g, b) Calculate ratio of individual components for each other color and main color Use these rates as a conversion matrix for any other main color.   For my example, rgb of individual colors is:  134  64  98 133  63  97 146  80 113 84   28  56 100  48  74 234 201 215   Ratio of each component (other color / main color):  0.99 0.98 0.99 1.09 1.25 1.15 0.63 0.44 0.57 0.75 0.75 0.76 1.75 3.14 2.19   Now for any new main color I can calculate all the other colors:  100 100 100 <-- new main color  99  98  99 109 125 115  63  44  57  75  75  76 175 255 219 (max is 255, cannot have 314)   My question is if this way of calculation makes any sense as I have never done any math with colors before.


I dual booted my PC 2 years ago, and I installed a 50gb partition for Ubuntu. But now I use Ubuntu most of the time. And now there is no space remaining in my Ubuntu partition. I have watched several tutorials, read many blogs, but still can't extend my Ubuntu partition size.  I have tried using GParted in Ubuntu and Disk Management in Windows. But in Gparted, I can't extend ext4 partition size    And in case of Disk Management it only shows delete and help option for the Ubuntu partition. There are no extend option.   I have a lot of free space in other drives, please someone suggest me the solution  free -h:  total        used        free      shared  buff/cache   available Mem:           7.7G        2.8G        761M        1.2G        4.1G        3.4G Swap:          1.9G          0B        1.9G  grep -i swap /etc/fstab:  # swap was on /dev/sda8 during installation UUID=6d6b17ee-13d7-49f9-90aa-6a1118c56698 none     swap    sw       0       0  sudo blkid | grep -i swap:  /dev/sda8: UUID="6d6b17ee-13d7-49f9-90aa-6a1118c56698" TYPE="swap" PARTUUID="93bc1965-08"

Till today I was using ubuntu 13.04 in my windows7/ubuntu dual boot. Just now I have upgraded to ubuntu 14.04. My software updater showed an updates available message. I proceeded with  Install Now . Soon I got the following window.    Then I tried sudo apt-get clean as recommended. Nothing happened! Not even a window opened. Teach me deleting the temporary packages.   Deleting temporary files may not be highly helpful in case of further updates and installs for I don't have too much space left in my /. I wanna extend my / partition with the help of the unallocated space in my HD. The following is my Gparted window.       I got an answer . But it wasn't useful for me. I had two choices. But the answer wasn't working for both my chioces.  Choice 1: I may use the 4.25 GiB unallocated space to extend my /dev/sda10. To do so, I must need to move my linux-swap partition. But my Resize/Move option is disabled for the linux-swap partition. Choice 1 failed!   Choice 2: I may use the 14.35 GiB unallocated space instead. In this case I must move more than one partition. /dev/sda4  partition is the first on the list. Even that partition has the same problem. Resize/Move option is disabled. Choice 2 failed!  I am out of choices now.  What shall I do? Help me to extend my / with Gparted.


I feel like I am missing something obvious.  Evocation/Channeling can be used for a great deal of fun effects on your turn.  But what about when you need to make a defend roll against an enemy? As far as I can tell, the only way to defend yourself with magic is to create a block before the opponent attacks you.  The books are FULL of Harry tossing up a transient shield as a split-second reaction to someone shooting a gun, or an explosion, or whatever. In our short time with DFRPG so far, we have not figured out how this would be represented mechanically.

Say that Player X is 2nd in the initiative. 1st is the Black Court vampire that is in a rage and taking a swing at Player X. Player X gets a built in defense [Athletics/Fists + 4dF] but can Player X instead use his action this turn to cast his Rote Evocation Shield?  It is not his turn in the initiative order. A Block is an Action that a Player can take on his turn.   Thematically though, it seems to make sense that the char could cast a Rote Evocation Shield in response to an attack ahead of him in the initiative order. At least thematically in the books. Also, the example in YS252, shows him reacting to an attack by Agatha Hagglethorn by bring up his shield.  I am hoping there is some as yet undiscovered dark corner where this concept is covered or squashed.


You 'collect' them when done and have an inventory of them.  Can they be sold?

I keep building these imperial levels and delivering supply workers to build items that show in my inventory screen (rebel secrets! security codes!) but I can't figure out why I would want to do that.  What do the imperial items do for me other than pile up in my inventory menu item?


Consider the code below:  \documentclass[convert = false, border = 1cm]{standalone} \usepackage{tikz} \begin{document} \begin{tikzpicture}   \node[font = \scriptsize] at (-3.5, 4) {Position of $S_2$ when};   \node[font = \scriptsize] at (-3.5, 3.7) {$S_1$ reaches $C$}; \end{tikzpicture} \end{document}   I used two nodes to write short explanation of a point in a figure I am constructing.  However, I had to play around with the set up so they weren't spaced vertically too far a part and the second node was centered on the content of the first node.  Is there a better way to this?

How can I insert a line break in a TikZ node? Simply putting \\ where I want the break doesn't work (see MWE).  Is there a way to make lines break automatically at some specified width?  And can I control the alignment of the text (left, right, centered, justified)?  \documentclass{article} \usepackage{tikz} \begin{document} \begin{tikzpicture} \node {First line\\second line}; \end{tikzpicture} \end{document}


Can someone tell me if I need to purchase the online subscription in order to download and play Fortnite on Xbox? It's for my children. I will purchase either the XBOX or PS4. Also am I capable of putting this on a laptop or Chromebook?

Can you play Fornite on PS4 without PlayStation Plus?  If so, how do you do it?


In VB.NET there are two ways to declare an array without initialization  1.  Dim Foo() As Integer   2.  Dim Foo As Integer()   I noticed that but never really cared about it and sometimes used the first and sometimes the second syntax. Now I wonder if both methods are really identical.  Which one should I use?  Looking at the IL code in ILSpy I see that  Private d1() As Integer Private d2 As Integer()   results in  .field private int32[] d1 .field private int32[] d2   meaning that they are both identical.  Is this always the case? Why are there two ways to write the same code?

This may sound trivial, but what is the difference between  Dim v As String()   and  Dim v() As String   in VB.NET?


For some reason Disk Utility (16.0) didn't eject my HDDs correctly and show the list of ghosts external drives as per below image:    despite I've no any external hard drives connected. Ejecting them from contextual menu doesn't do anything.    I've tried to use diskutil to unmount these non-existing drives:  diskutil list diskutil unmountDisk /dev/disk2   but it didn't work.  Including this shell command to unmount them all:  $ while read disk _; do diskutil unmountDisk force $disk; done < <(diskutil list | grep external) Unmount of all volumes on disk2 was successful Unmount of all volumes on disk4 was successful Unmount of all volumes on disk5 was successful Unmount of all volumes on disk6 was successful Unmount of all volumes on disk7 was successful Unmount of all volumes on disk8 was successful Unmount of all volumes on disk9 was successful Unmount of all volumes on disk10 was successful   but the command doesn't take any (even with force) effect despite the successful message. So these disks are still showing after restarting Disk Utility as per below command:  $ diskutil list | grep external /dev/disk2 (external, physical): /dev/disk4 (external, physical): /dev/disk5 (external, physical): /dev/disk6 (external, physical): /dev/disk7 (external, physical): /dev/disk8 (external, physical): /dev/disk9 (external, physical): /dev/disk10 (external, physical):     The following log entries shows when unmounting a single disk:  $ log stream opendirectoryd: Client: <private>, UID: 501, EUID: 501, GID: 20, EGID: 20 opendirectoryd: <private> completed, delivered 1 result diskutil: (CoreFoundation) Loading Preferences From System CFPrefsD For Search List diskutil: (CoreFoundation) Loading Preferences From User CFPrefsD For Search List authd: (Security) SecTrustEvaluateIfNecessary trustd: [com.apple.securityd.policy] cert[2]: AnchorTrusted =(leaf)[force]> <CFBoolean 0x7fffcc25d578 [0x7fffcc25cbd0]>{value = false} authd: (Security) [com.apple.securityd.security_exception] CSSM Exception: -2147411889 CSSMERR_CL_UNKNOWN_TAG authd: (Security) [com.apple.securityd.security_exception] CSSM Exception: -2147411889 CSSMERR_CL_UNKNOWN_TAG authd: (Security) [com.apple.securityd.security_exception] CSSM Exception: -2147411889 CSSMERR_CL_UNKNOWN_TAG authd: (Security) [com.apple.securityd.security_exception] CSSM Exception: -2147411889 CSSMERR_CL_UNKNOWN_TAG authd: (Security) [com.apple.securityd.security_exception] CSSM Exception: -2147411889 CSSMERR_CL_UNKNOWN_TAG authd: (Security) [com.apple.securityd.security_exception] CSSM Exception: -2147411889 CSSMERR_CL_UNKNOWN_TAG opendirectoryd: Client: <private>, UID: 0, EUID: 0, GID: 0, EGID: 0 opendirectoryd: <private> completed, delivered 1 result opendirectoryd: Client: <private>, UID: 0, EUID: 0, GID: 0, EGID: 0 opendirectoryd: <private> completed, delivered 1 result opendirectoryd: Client: <private>, UID: 0, EUID: 0, GID: 0, EGID: 0 opendirectoryd: <private> completed, delivered 1 result authd: Succeeded authorizing right 'system.volume.external.unmount' by client '/usr/sbin/diskutil' [30724] for authorization created by '/usr/sbin/diskutil' [30724] (13,0) opendirectoryd: Client: <private>, UID: 0, EUID: 0, GID: 0, EGID: 0 opendirectoryd: <private> completed, delivered 1 result opendirectoryd: Client: <private>, UID: 0, EUID: 0, GID: 0, EGID: 0 opendirectoryd: <private> completed, delivered 1 result opendirectoryd: Client: <private>, UID: 0, EUID: 0, GID: 0, EGID: 0 opendirectoryd: <private> completed, delivered 1 result authd: Succeeded authorizing right 'system.volume.external.unmount' by client '/usr/libexec/diskarbitrationd' [97] for authorization created by '/usr/sbin/diskutil' [30724] (2,0) taskgated: (Security) [com.apple.securityd.security_exception] MacOS error: -67062 taskgated: (Security) [com.apple.securityd.security_exception] MacOS error: -67062     How do I get rid of these non-existing volumes without restarting the system?

I have this external (USB) drive that can't seem to be disconnected correctly.  Whenever I eject the drive, it won't disappear from Disk Utility.  Afterwards when the drive gets re-connected again, it cannot be mounted. At this stage, I would need to reboot the Mac to get the drive to mount again.    Ejecting from the Terminal via diskutil eject /dev/disk2 returns a Disk /dev/disk2 ejected message and unmounts the disk.  However the disk still shows up both in Disk Utility and diskutil list.   Furthermore even after the USB cable is disconnected, the disk still shows in both Disk Utility lists — GUI and command line.   How can I solve this?  OS: macOS Mojave 10.14.1 (18B75)


i have a question about CBC operating mode.  what problem happen if we always use IV Zero in CBC Mode?

I have a need to encrypt credentials for a third-party app used by a secured internal app. Over on ITSec.SE, I was helpfully shown a scheme to encrypt the third-party credentials based on a hash of the credentials for the internal app.   I picked AES as the encryption algorithm, but the problem is that the password-based scheme doesn't produce a "secret" IV. So, the IV must at least be known to an attacker (stored alongside the encrypted data). A hash value used for password verification could work, or I could just generate a pseudorandom byte array and drop it in the DB as a new column. I was further considering, for simplicity, to use a constant IV.   What adverse effect will either of these choices have on the security of the encryption? Does AES depend, as many block ciphers do, on an unpredictable IV? Does it matter if the IV is stored as unencrypted plaintext?


Since rational numbers are real algebraic numbers, clearly the real algebraic numbers must be dense in $\mathbb{R}$. So it seems natural to ask: are the (complex) algebraic numbers dense in $\mathbb{C}$? If not, is the (topological) closure of the algebraic numbers known?

Clearly, $\mathbb Z$ is not dense in $\mathbb Q$ (and not dense in $\mathbb C$).  But why is the ring of algebraic integers $\overline{\mathbb Z}$ dense in $\overline{\mathbb Q}$?  In particular, if this is so, it is dense in $\mathbb C$.


Is there something I can do that will filter  questions so I only see questions in real time from sites I choose?  A huge bonus would even be a preview of the question text along with the title and such.  Or should I attempt to write some program to monitor the page and push questions from there to somewhere else?

I'm thinking that adding options to choose from what sites the  would fetch would be useful (with the available choosing of meta sub-sites).


I have made a JAVA program where I have initialized a 1-D String array. I have used for loop to search any inputted String if it exists in the array(Scanner Class).  Here is the source code :-  import java.util.*; class search {     public static void main(String args[])     {         Scanner sc=new Scanner(System.in);         System.out.println("Enter the name to search :-");         String s=sc.nextLine();         String array[]={"Roger","John","Ford","Randy","Bacon","Francis"};         int flag=0,i;         for(i=0;i<6;i++)         {             if(s==array[i])             {                 flag=1;                 break;             }         }         if(flag==1)         System.out.println("The name "+s+" Exists");         else         System.out.println("The name "+s+" does not Exists");     } }   The class even compiles successfully, but when I enter a valid string(say- Roger), the output is The name Roger does not Exists.  Please help me out with this issue, and for this I shall be grateful to you.  Thanking You,  J.K. Jha,  01.09.2018.

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


I am a student reviewing multiple COVID tracing applications deployed in various countries around the world. Although I'm located in the US, I'm also interested in applications that other countries have deployed. As far as I understand, to do that I would need to find a VPN server in the country I am interested in and browse Play Store from there. It looks that people all around the internet advise to:  Connect to the VPN, Remove cache and data from Play Store, and Restart Play store.  However, this does not work for me. Play Store still lists only the applications available in the US and prices in US dollars. I have checked whether my VPN works and it does. whatismyipaddress.com shows that at least my search queries coming from the browser go through a foreign VPN server.

Can someone tell me how to change the country preference for Google Play? I have searched high and low but in most of the forums people ask you to go to Gmail settings -> edit profile and change the country there. But there is no place to change the country in settings! There is a something called place (which can be marked as current) but that has no impact on Google Play.  I don't want to circumvent country restrictions, I want to permanently change the country. So it's NOT a duplicate of .


This is what i do      xmodmap -e "keycode 135 = g"   but i lost it everytime i shutdown/restart my computer. I use ubuntu 14.04. Please someone can help me to make this change be permanent?  Thanks!

I'm unsure how to swap these 2, this is the thought process I had but am unsure how to get it working:  remove sh = Shift_R remove dl = Delete  keysym Delete = Shift_R keysym Shift_R = Delete  add sh = Delete add dl = Shift_R   This is based on the code I use to swap caps lock and control.  Any thoughts?  xmodmap output:  dan@lantea:~$ xmodmap -pke | grep Shift_R keycode  91 = Shift_R NoSymbol Shift_R keycode 119 = Shift_R NoSymbol Shift_R dan@lantea:~$ xmodmap -pke | grep Delete keycode  62 = Delete NoSymbol Delete


I am having a difficult time obtaining the correct size of a string in order to satisfy strcpy_s.   For example if I specify  char buffer = {0}; char *str1 = (char*)&buffer;     strcpy_s(str1,sizeof("This is a string\n"),"This is a string\n");   Then it will work as expected.   If however I declare the following:  char buffer = {0}; char *str1 = (char*)&buffer; const char* string1 = "This is a string....."; strcpy_s(str1, ?????,string1);   If I use anything other than a literal in place of ????? it will fail with a memory exception, for example if I use std:strlen(str1), etc.  Any size literal for ???? will work.   Of course using a fixed literal is not acceptable.  This is a major re-edit of the original question and I apologise to the people who have answered to date.   However none of the the answers below have worked.

First off, here is some code:  int main()  {     int days[] = {1,2,3,4,5};     int *ptr = days;     printf("%u\n", sizeof(days));     printf("%u\n", sizeof(ptr));      return 0; }   Is there a way to find out the size of the array that ptr is pointing to (instead of just giving its size, which is four bytes on a 32-bit system)?


So lets say you have the following two polynomials:  $$f_1(x)=(x-1)(x-2)^2$$  and  $$f_2(x)=(x-1)^2(x-2)$$  And we want know whether Newton-Raphon's method will converge quadraticly or linearly for finding the root $x=2$. How would I go by doing this?

How would you show that if f'(a)=0 then the Newton's Method is linear convergent when 1. $f''(a)\neq 0$ 2. $f''(a)=0, f'''(a) \neq 0$? I am having some trouble getting it to the point where you can take the limit of ratio of the error terms and using L'hospital's rule to prove this.


ArrayList<String> values=new ArrayList<String>(); values.add("s"); values.add("n"); values.add("a"); values.add("s");   In this Array, I want to remove repeated values.

I have an ArrayList<String>, and I want to remove repeated strings from it. How can I do this?


By pressing a rice bowl on his abdominal muscles, Zhang Xingquan was able to create enough suction to pull a 36.15 tonnes heavy train for 40 meters   Source: Guinness world records website.  How does the bowl 'attach' to his abdominals and not fall down as he walks backwards? How is he able to use suction to pull such a heavy object?  A video can be found .

My roommate and I are having trouble agreeing on how suction cups work.  Presumably, the ambient air pressure is the only thing which keeps the suction cup attached to the object.  When lifting an object with a suction cup (or a rigid chamber with air pumped out):   Given that the suction cup isn't physically affixed to the object, it can't apply any force to lift it. How does pulling actually lift the object? What dictates how much weight can be lifted?   If the object is touching the ground (so there's no air underneath it), can it be lifted? If not, can the suction cup be detached by pulling?   In practice, why does a rubbery suction cup work better than a rigid object (such as an inverted glass cup)? Inside a rigid spherical shell (with gravity towards the center), presumably a suction cup can be used to hang a mass.    Yet, the air pressure is acting nearly uniformly on the sphere. How does the gravitational force on the mass get balanced out so the whole system doesn't move?


I want to learn how to create stylish Graphic User Interfaces for android applications beyond the common style of the google apps itself. if some one has some documents i can read to give applications that particular style.  for example i like a lot the style of the QuizUp app, i would like to learn more about how they got this look.

Thanks to the internet, graphic design and programming are becoming increasingly overlapping fields.   As a programmer, I constantly find myself needing basic knowledge of Graphic Design, but have trouble locating thorough yet concise graphic design learning resources, and instead usually find bits and pieces of knowledge applicable to the task at hand.  Can you guys offer some tips or recommend some good books, tutorials, blogs, and websites which provide a beginner level overview of web design that have been, in your experience, effective and high quality learning materials. I'm not looking for tips on how to use image editing tools, but assuming a basic grasp of those, which resources and advice will best help a new designer create professional looking designs?


when I tried to delete some records from a MYSQL server  (version 5.0.95-log)  and checked the process list I got  the result as follows  mysql> show processlist \G *************************** 2. row ***************************      Id: 3480    User: admin    Host:      db: test_db1 Command: Connect    Time: 8367   State: invalidating query cache entries (key)    Info: NULL   I  would like know what is this "invalidating query cache entries (key)" and is this due to any configuration settings.Replication is configured in this machine and it acts as the Master Server.  Please find the my.cnf file setting blow  [mysqld]  datadir=/var/lib/mysql socket=/var/lib/mysql/mysql.sock user=mysql lower_case_table_names = 1 default-storage-engine=InnoDB innodb_buffer_pool_size=5G innodb_log_file_size=512M query_cache_size=512M table_cache=64 innodb_flush_method=O_DIRECT  #Replication   log-bin=mysql-bin server-id=1 sync_binlog=1 innodb_flush_log_at_trx_commit=1  binlog-do-db=test_db1 binlog-do-db=test_db2  # Default to using old password format for compatibility with mysql 3.x # clients (those using the mysqlclient10 compatibility package). old_passwords=1  # Disabling symbolic-links is recommended to prevent assorted security risks; # to do so, uncomment this line: # symbolic-links=0  [mysqld_safe] log-error=/var/log/mysqld.log  pid-file=/var/run/mysqld/mysqld.pid

I'm currently working on a MySQL database where we are seeing a large number of invalidations from the query cache, primarily because of the high number of INSERT, DELETE and UPDATE statements that are being executed on many of the tables.  What I'm trying to determine is whether or not there is any benefit at all to allowing the query cache to be used for SELECT statements that are being run against these tables. Since they get invalidated so quickly, it seems to me the best thing would be to just use SQL_NO_CACHE on SELECT statements with these tables.  Is the overhead of frequent invalidation ever worth it?  Edit: At the request of the user @RolandoMySQLDBA below, here's the info on MyISAM and INNODB.  InnoDB   Data Size: 177.414 GB Index Size: 114.792 GB Table Size: 292.205 GB   MyISAM   Data Size: 379.762 GB Index Size: 80.681 GB Table Size: 460.443 GB   Additional info:   Version: 5.0.85 query_cache_limit: 1048576 query_cache_min_res_unit: 4096 query_cache_size: 104857600 query_cache_type: ON query_cache_wlock_invalidate: OFF innodb_buffer_pool_size: 8841592832 24GB of RAM


I know it is possible to comment on someone's question or answer, but is it possible to ask a question about or on his profile?

Related Posts:              I was thinking about .  and I thought being able to leave a comment on a user profile would be a nice solution. Once in a while I have a question for a specific person. Once I notice a person doing OSdev and wanted to know about his projects he was working on. I remember a person mentioning a paper he did and I wanted to ask him more. I'm sure he didn;t notice my comment because he has many replies (which get commented on) and isn't on the site for days at a time. If he decided to look at his profile comments I am sure he would have a higher chance of noticing it.  I would like comments on user profiles. I dont think flamewars would be an issue and would be hard to follow if you cant reply back on the same page (you either cant post on your own profile and if you can the other person would be notified of the comment which may slow it down)


Please explain the difference between X's Y and Y of X. Example: "The building's roof" and "roof of the building". Is there a "correct" form? When is the former used and when the latter?

I gave a quick answer to part of  which had not been covered by previous answers, trying to clarify the reason you would say time of decoding but not decoding’s time. I said it was ’s usually indicates possession, but of course there were several counterexamples that would have occurred to me after a moment’s consideration, and these where helpfully supplied:   Britain’s climate two days’ time  a day’s work  the sun’s rays   I am still of a mind to say that possession of some sort is what allows the ’s. Even though the sun does not have title to its rays, they do belong to the sun. Now, at the risk of duplicating the original question and/or being pigheaded, I am curious as to why time of decoding but not decoding’s time is correct, if not for the reason I gave.


Is the flair tab working correctly?  It is counting aproximately 3 times more points and over 2 times more bronze badges at the time I'm posting it.

I took a look at my profile, where I stuck my flair. Here's the flair:    However, I don't have 28k rep. According to chat, I have 19.7k.  Note: I know about the combined flair - I've had this in my profile for at least a year. It had been showing me the same as in chat, now it isn't.   What is going on here?  Edit: I'm reporting a bug here, that the combined flair is not showing the correct number, as it has in the past.


I was trying to install ubuntu but when I select the USB boot option on my BIOS it does nothing,just got a black screen and the computer restarts. I was able to install windows xp via USB on that computer. I've already tried a few programs like unetbootin and LilLi but the computer keeps restarting. I've been using the 14.04 ISO

I tried to use the usb-creator.exe from Ubuntu 10.10 desktop i386 ISO image and it does create an USB stick that doesn't boot. When I try to boot from it I get:     Operating System not found.   I try to do this from Windows 7 x64. I'm not looking to create a live Ubuntu media, only an installation USB disk.  I repeated the process several times and I even tried to reformat the USB drive (FAT32), no success yet.  The USB stick is a 8GB one.


Now there are dedicated stackexchange sites for wordpress, drupal etc. I got a question regarding the wordpress and so I asked it in wordpress.stackexchange.com. But as the audience is less, I didn't get an answer.   But I am sure that I would get a response if posted it on stackoverflow. If I pasted the same question, it will be marked as double posting across the network.  So how can I point the stackoverflow users to the wordpress question and get a response?

With the advent of the WordPress Answers Stack Exchange site, there's undoubtedly going to be overlap.  But I just want to get some advice:  I'm a developer and I kinda hate WordPress, but have to use it occasionally. My WordPress questions are usually development ones (when I have them), and most often related to 'how WordPress handles things', which are pretty obvious in straight programming terms.  But with the WordPress layer of abstraction, they become problematic.  I find that most developers that have gone near WordPress are usually also PHP/JS/CSS/MYSQL guys who dabble with WordPress and, as a result, hangout more on SO. And theres a die hard bunch who are heavy into the WP.SE site, but generally the WP site is for people trying to muddle through the day to day operation of using WordPress and its many themes/plugin etc.    As a result, if I were to ask something pretty in-depth about writing / integrating new & strange features or something, I'm talking to a much smaller group of devs than I would be on SO.  So, enough of the ramble, my question:  Should I be posting heavy development questions relating to WordPress on the WP.SE site or to SO? Can I post to both, or is cross posting frowned upon in these cases still?


My makefile will not run for some reason. This code comes from one of my instructors on how to run a makefile for java programs. It's called Makefile  all:     javac cs286_p1/*.javac     jar cmf manifest.mf cs286_p1.jar cs286_p1     @echo "+ to run type: java -jar exampleProgram.jar"     @echo "+ to run with command line arguments, simply append them to the line above"   I've run cat -e -t -v Makefile to see what the result was and it was this:  $ cat -e -t -v Makefile all:^M$ ^Ijavac cs286_p1/*.javac^M$ ^Ijar cmf manifest.mf cs286_p1.jar cs286_p1^M$ ^I@echo "+ to run type: java -jar exampleProgram.jar"^M$ ^I@echo "+ to run with command line arguments, simply append them to the line above"^M$   Any help with this?  EDIT: It seems as as though dos2unix didn't work. I edited the file to take out the ~$. I'm editing and working on this in a linux environment that I'm currently connected to, I however started this on Notepad++ and made sure that ANSII was the encoding. Still not working, however, anything else that can be thought of?

We have 10 PC with some version of Ubuntu and only remote access. While doing some upgrades to custom software I did not notice that the line endings in some scripts were Windows version (CR+LF) and not the Unix version (LF). So now when I want to launch the script it gives an error:   bash: /usr/local/bin/portsee: /usr/bin/python^M: bad interpreter: No such file or directory   Is there a way to change all line endings in a script from terminal. The thing is that I can not install any new software to this group of PC-s.


The Stack Exchange network seems like the best way to get good answers fast, but I don't if and what SE forum I should use to ask my question:  I'm looking for somewhere, anywhere, that would let me view and or purchase the full taping of the September 20th, 1973 tennis match between Billy Jean King and Bobby Riggs, also known as "The Battle of the Sexes". I just need evidence that it exists somewhere so I can go about trying to obtain it. Any help at all would be greatly appreciated.

There are many general resource questions that ask questions such as "what is the best programming language?" or "How do I implement this commonly-confusing thing?", which get closed for being subjective or generalized.  While these are currently outside the scope of SE, many have generated .  Therefore, I suggest that instead of closing these questions, the best ones should be relocated to a new sister site like this:     assorted.stackoverflow.com (or any other prefix)   I've looked around and seen something like this suggested before, but what I found suggested things such as a compiled FAQ or separate site (which is similar, but then would be hard to search since all site questions would be merged into one long list).  Of course, I understand the implications of such a heady statement, and the effort that would be required to accomplish this must be immense.  However there are good reasons for this change:     This would provide a place to ask subjective questions, which means instead of closing questions against the community's will, misplaced questions can be migrated. This can discourage repetitious questions that continuously ask the same popular questions.  It certainly wouldn't get all of the duplicates, but it might help. This would encourage users to write new, useful questions that are inherently subjective,  but are still very helpful.   A number of technologies could accompany this that could make integration simpler:   Each site has the sub-site in the main toolbar listed between "chat" and "main/meta".  This allows for quick navigation between the sub-sites. The new sub-site could have its search results automatically included in the "main" portion of the site so that it can be seen by people posting their questions on the main page (to help avoid duplicates). Either a new rating system could be imposed which does not affect the user's rep (i.e. is local to the question only) so that the questions can be ordered by rating, or rating can be taken out altogether.  I don't recommend tying in the rating with the parent site because the sites may become indistinguishable. Allow for migration to the new sub-site.  Perhaps require less migration votes to move to this particular sub-site because A) it still pertains to the actual subject matter, and B) Migration would be more frequent to this sub-site.   Finally, if this would become a reality, Stack Exchange would likely require a change to their mission statement to include that there is a small subsection devoted to the most highly-valued subjective questions, or something along those lines.  Now, nothing ever gets done without first being discussed, so how does everybody feel about all of this?  NOTE TO DOWNVOTERS Thank you for your interest.  Downvoting does not mean that you dislike my post.  Do not downvote because the question happens to be a duplicate of a question that by all means, I would never have found without stumbling across it myself (yes, I took a good hard look before I asked this one).  Remember that downvoting is only meant to indicate a bad question or for feature requests, a poorly thought-out request.  I took a lot of time writing this request; because you do not agree with it is no cause for the (to quote another user) "Haterade".


I don't understand how a zener diode placed in series with a resistor creates a constant voltage for a load in parallel with the diode. The load voltage drop must be the same as the zener diode voltage drop since they are in parallel, right?

I'm having trouble understanding the simple voltage regulator that can be built using a zener diode (from section 2.04 in the Art of Electronics).  I know that it would be better to use amplifiers, et cetera, but I'm just trying to understand how this circuit works.      I don't really understand how the circuit works, but I am guessing that when a load is applied to the output, it drains current from the source (Vin) and thus causes the voltage to drop?  How does the zener diode help to maintain the voltage and thus make this circuit act as a regulator?


Prove the inequality for a triangle with sides $a,b,c$ we have $$\dfrac{a}{b+c}+\dfrac{b}{c+a}+\dfrac{c}{a+b} <2$$  Trial: Since $a,b,c$ are sides of a triangle I know  $a+b>c,b+c>a,a+c>b$

How can one show that for triangles of sides $a,b,c$ that   $$\frac{a}{b+c}+\frac{b}{c+a}+\frac{c}{a+b} < 2$$  My proof is long winded, which is why I am posting the problem here.   Step 1: let $a=x+y$, $b=y+z$, $c=x+z$, and let $x+y+z=1$ to get   $\frac{1-x}{1+x}+\frac{1-y}{1+y}+\frac{1-z}{1+z}<2$  Step 2: consider the function $f(x)=\frac{1-x}{1+x}$, and note that it is convex on the interval (0,1), so the minimum of   $\frac{1-x}{1+x}+\frac{1-y}{1+y}+\frac{1-z}{1+z}$  is reached when the function takes the extreme points. i.e. $x=y=0, z=1$.    But going back to the fact that this is a triangle, we note that $x=y=0 \implies a=0$ which is not possible, so the inequality is strict.


Does anyone know this short story I read many years ago? It's about a group of people who decided to get to a distant planet on a spaceship that isn't very advanced. Some time after they started their trip, new technology got developed that allows space travel at a much faster speed. A second group of people who set out for the same destination end up arriving a lot earlier than the first group of people.  I think this would be a good story to introduce my kids to space travel but couldn't remember the name of the book.

I'm a huge fan of SF from the golden age of SF, so this could be a fairly old book.  It was a story about a "generation" starship or sublight starship.  I believe most of the story was about their journey and some of the problems and difficulties.  I believe that something strange is observed along the way which later turns out to be them being passed by an FTL starship which was developed, on their long voyage, after they left Earth.  When they arrived at their destination they were amazed and, I believe, disheartened to be greeted by people from Earth.


I remember a story I have read buy could not remember the author the name or anything apart from the basic plot. The story is about some future where humanity has to fight with some aliens (not 100% sure). The story tells about a guy who was some kind of activist and who was in a prison two or more times and somehow helped humanity by being held in a prison (can't remember details). I think the story starts by saying that there is a statue in his honor that is not very well known but he did more to help humanity than famous politicians.   The story is most likely written by some famous English-speaking author, though I read it in a translation.

I am looking for the title or author of a atory I read back in the 90's, no idea when it was written. The plot goes something like this: Humanity has gained access to space travel and sends 9 or 12 survey ships towards galactic center, only 1 returns with stories of an enemy so rapacious that humanity starts preparing for war. After a long time, the enemy hasn't shown up and people begin to doubt the need to keep building for war. The government engineers a plan to turn the core systems against the fringe worlds and start warring amongst ourselves so that we may be prepared for when the real enemy shows up.  Written with the focus on one spaceship captain battling in our own internal war.


Hello, everyone.  Is there a way in python to insert all items from one dictionary to another inside variable assignment?  dict1 = {"a": 1, "b": 2, "c": 3} dict2 = {"d": 4, #INSERT THERE ALL FROM "dict1"#, "e": -1}   Maybe there's smth like {key: value for key, value in temp.items()} or other "hack"?  I know that there's update() method and I've already applied it, but it looks a bit weird. Order of entries matters so to build dict in proper order I need to write next code :  dict1 = {"a": 1, "b": 2, "c": 3} dict2 = {"d: 4"} dict2.update(dict1) dict2.update({"e": -1, "f": -2})   Hope there's a way to do it more "nice".

I have two Python dictionaries, and I want to write a single expression that returns these two dictionaries, merged (i.e. taking the union).  The update() method would be what I need, if it returned its result instead of modifying a dictionary in-place. >>> x = {'a': 1, 'b': 2} >>> y = {'b': 10, 'c': 11} >>> z = x.update(y) >>> print(z) None >>> x {'a': 1, 'b': 10, 'c': 11}  How can I get that final merged dictionary in z, not x? (To be extra-clear, the last-one-wins conflict-handling of dict.update() is what I'm looking for as well.)


I have found many people asking for help about login looping issue of ubuntu.One thing i wand to insure is that there is no single particular reason which may result in login looping so there is no single solution to this.But,there is only one solution why works for all and that is reinstalling ubuntu.Well, what is about the data i had in,how can i save it? The answer is we can reinstall it without loosing data of home/ directory.for this,while partitioning,we can use home partition of old installation in new installation without formation it.Other partitions (swap,root,efi) need to be created again.so we can free up these partitions mentioned to create again for new installation.

My Ubuntu is stuck in a login loop when trying to enter my desktop. When I login, the screen gets black and soon after that the login screen comes back.   I've read that the problem might be caused by an error depending on the graphics, here's my graphics card: ATI Radeon 7670M


I am currently working inandroid studio. I have an input form activity, which is written to a CSV file on submit, which is then added as an attachment for an email. In a particular field, if I press the Enter key, to create a new line - the CSV file format is disturbed (but I need to be able to press enter in the field)

Is it possible/legal to somehow encode CR/LF characters into a CSV file?  (as part of a CSV standard?)  If so how should i encode CR/LF?


Hi I have an array defined in my header filed  private:     Customer** customerListArray;   In my cpp file I set it as following,   customerListArray = new Customer* [data.size()]; cout << "arr size " << data.size() << "\n"; cout << "arr size " << sizeof(customerListArray) << "\n";   However data.size() is 11900, but sizeof(customerListArray) array is always 4. I've tried replacing data.size() with 100 and still I get 4.  What am I doing wrong here?  Thank you.

First off, here is some code:  int main()  {     int days[] = {1,2,3,4,5};     int *ptr = days;     printf("%u\n", sizeof(days));     printf("%u\n", sizeof(ptr));      return 0; }   Is there a way to find out the size of the array that ptr is pointing to (instead of just giving its size, which is four bytes on a 32-bit system)?


My question pertains to article submission waiting times.  How long, your experiences, is the period of time between a journal receiving completed peer reviews back on a paper (as indicated by the online system), and a decision being issued to the authour?  My particular case: I have submitted to a large geography journal, and can see that peer reviews have been in for a month, in which time my manuscript is shown as "awaiting ed decision". Advice as to if/when to pester the editors would be useful to me.  Thanks greatly

What steps does a manuscript typically go through from submission to publication (or rejection) in a typical journal? How are these steps referred to, in particular by editorial systems, and how long do they each typically take?  Note that this question is about the typical situation and hence not about:   Journals with an atypical workflow, e.g. those that allow for an instantaneous reviewer–author interaction. Exceptional steps or rare occurrences such as withdrawal or .   This is a canonical question on this topic as per . Due to its nature, it is rather broad and not exemplary for a regular question on this site. Please feel free to improve this question.


Say $B$ is a basis for the topology $O$ on some set $X$.  Then, must we have $\emptyset \in B$ ?    If not, then how does one get $\emptyset \in O$ from taking the union of non-empty sets of $B$ ?    My definition of a basis for a topology is     a collection $B$ of open sets is a basis for the topology, if every open set of the topology is a union of elements of $B$.

In Munkres’ topology, there are two instances where we would have to represent the empty set as a union of sets.  First, we have a lemma that says if $X$ is a set; and $\mathcal{B}$ is a basis for a topology $\tau$ on $X$, then $\tau$ is equal to the collection of all unions of elements of $\mathcal{B}$.  Later on, we define a subbasis $S$ of a topology on a set $X$ to be a collection of subsets of $X$ whose union equals $X$, and the topology generated is the collection of all unions of finite intersections of elements of $S$.  So there are a few questions I wanted to ask about these just to make sure that I'm understanding them correctly. First in the case of the subbasis, when Munkres says finite intersections, he's allowing for a set to be intersected with itself right? There's nothing that says the sets have to be different? This is important because we will need the elements of S to be in the collection of finite intersections so that we can get the full set X.  Secondly, and more importantly, when dealing with the empty set, how do we say that this set is a union of anything? If I have a collection of sets D and I take the empty collection $\mathcal{A}$, then can I say the union of the empty collection is the empty set? I think this is ok to do, and Munkres mentions this earlier in the book, so is he allowing this to occur when he says all unions of elements from a collection of sets? I suppose its not that hard to understand but I guess I'm not used to thinking this way.  Lastly, in the proof of the lemma I mentioned first, Munkre's proves that every open set is a union of basis elements in the following way. Let $U \in \tau$, choose for each $x \in U$ an element $B_x$ of the basis such that $x \in B_x \in U$. Then $U = \bigcup_{x \in U} B_x$, so $U$ equals a union of elements of the basis.  I'm having trouble interpreting this statement if we start with $U=\emptyset \in \tau$. Then there is no $x \in U$, so how do we interpret the rest of the statement?  Thank you


$f(x,y) = 2x+y$ subject to $g(x,y)=x^2+y^2-1=0$. The Lagrangian function is given by  $$ \mathcal{L}(x,y,\lambda)=2x+y+\lambda(x^2+y^2-1), $$  with corresponding   $$ \nabla \mathcal{L}(x,y,\lambda)= \begin{bmatrix}  2 + 2\lambda x \\ 1+2\lambda y \\ x^2+y^2-1 \end{bmatrix}. $$  From the latter we can see that $x=\frac{-1}{\lambda}$ and $y=\frac{-1}{2\lambda}$, which we can substitute into $x^2+y^2=1$ to obtain $\lambda = \pm\sqrt{\frac{5}{4}}$. Meaning that $x = \pm \dfrac{2}{\sqrt{5}}$ and $y= \pm \dfrac{1}{\sqrt{5}}$. We find the critical points $(\frac{2}{\sqrt{5}}, \frac{1}{\sqrt{5}})$ and $(\frac{-2}{\sqrt{5}}, \frac{-1}{\sqrt{5}})$.  I am confused on how I should proceed to check wether these points or minima or maxima? I know the Hessian is involved, but which one?

QUESTION  Determine all extrema of the function  $$f(x,y) = x+ 2y $$ subject to $$x^2 + y^2 - 80 = 0$$  ATTEMPT  I don't think I understand what I'm supposed to do. This was in a test and I ended up trying to "graphically"or ïntuitively" find out how the $f(x,y)$ would behave in a circle of radius $\sqrt80$ Which left me with some pretty random numbers that turned out to also be wrong.   What could I have done differently? (If possible could I get a bit of a detailed explanation or some links to that info.)  Lagrange Multipliers: I tried that too on the paper and it also went horribly wrong (but I did get some points, though) but I couldn't quite figure it out.


I would like to know if the color of a mesh means something special. Is it because these two triangles are deep grey that something is wrong with them? Thanks everyone.

While rendering a mesh with smooth shading on, I get a dark region/shadow on certain faces. The effect is more evident when smooth shading is applied to a mesh containing ngons, with the ngons turning black when rendered.   The blackening effect is visible in the viewport too.  How can I solve this problem?


In this story, it is in the far future so that it feels like a fantasy story. The protagonist is a boy named Flea with one shriveled leg. He gets dumped in a hole by his adopted family of orcs (or trolls?). He finds a cave and keeps journeying deeper into the earth. Along the way, he finds traps and puzzles that he solves, allowing him to continue. Among them, he finds a room with flying girl-like beings, which aren't afraid of him. He kills an animal there for food, and then gets in big trouble. At the end of the journey, he meets a wizard.  Any idea what this book is called, or who wrote it?

This is a novel that I think I remember reading somewhere in the 1990s courtesy of my brother (who does not remember the book). Only a few details are coming to mind at the moment. It's a male protagonist. Something was not quite right with his legs, which led to him being nicknamed Frog or Leapfrog due to his usual method of locomotion, which consisted of pushing off from his legs to his hands and vice versa. Something happens and he winds up moving between a number of worlds (I want to say that he fell into a well or a hole in a field). There was a part which stuck with me where he's in a bottomless hole and finds he keeps falling faster and faster without end with the rushing wind becoming actively painful (I don't remember if he actually reaches a terminal velocity or if some aspect of the world prevented it while still allowing the rushing air to affect him physically).  Unfortunately, that's all I can remember. I don't remember whether he eventually gains companions on the voyage or how it ended. The most vivid memory is that of the nonstop falling.


Here in the exercice, I have to show that $(Z[t],+, . )$ and $(Q[t],+, .) $ are not isomorphic.  I know the answer!  I am simply wondering if it would be true that, showing that $(Z,+, . )$ and $(Q,+, . )$ are not isomorphic is sufficient to say that the polynomial rings are also not isomorphic.  If not, can you find me a counter example?  thank you!

This is a very simple question but I believe it's nontrivial.  I would like to know if the following is true:      If $R$ and $S$ are rings and $R[x]$ and $S[x]$ are isomorphic as rings, then $R$ and $S$ are isomorphic.    Thanks!  If there isn't a proof (or disproof) of the general result, I would be interested to know if there are particular cases when this claim is true.


My flash disk encountered an error saying that it has been write protected, so of course I can't even copy files or even format my flash drive.   What happened to my flash drive to cause this?   And is there a way I can I fix this?

When I plug in my USB flash drive, it shows up on my computer as write-protected or read-only. I am unable to transfer data to it, nor can I modify or delete any files already stored on it. I also cannot repartition or reformat the drive using Windows Disk Management, DiskPart, GParted, or other tools. The drive does not have a write-protect switch.  Why did this happen and what can I do about it? Is there a way to remove the write protection?  (Note that this can happen with some memory cards, too, as they often use controllers similar to those used in flash drives. In some cases, the system may report that the drive or card was formatted successfully even though it was never actually formatted; the original data reappears when the device is reinserted.)     This question comes up often and the answers are usually the same. This post is meant to provide a definitive, canonical answer for this problem. Feel free to edit the answer to add additional details.


I have a new Lenovo Thinkpad E560, running Windows 7. I installed Ubuntu 16.10, creating partitions for root, home, tmp, and swap. A partition called "bios_grub" was created automatically.  Now whenever I boot the system it boots to Windows 7. My boot menu does not seem to be from grub, it shows only four items:  Windows ATAPI CD0 – boots from DVD ATA HDD0 – does nothing PCI LAN – does nothing   My question is not "how do I install Ubuntu". I have done that several times, without any major problems. This time, however, although Ubuntu has been installed on my disk, it does not appear in the boot menu.  I booted from an Ubuntu live DVD and ran boot-repair but it tells me it cannot deal with a BIOS boot, only UEFI. So I tried to change the Windows boot to UEFI. The result is no booting system at all, with the following message:  File: \EFI\Microsoft\Boot\BCD Status: 0xc000000d Info: An error occurred while attempting the boot configuration data.   When I changed the boot menu back to BIOS Windows worked again. No Ubuntu boot option.  The file \EFI\Microsoft\Boot\BCD exists on the EFI system partition, and the partition is flagged as "boot" and "esp" (shown by gparted). There is no other partion flagged as "boot". The disk is GPT. The Windows partition administration says the partition has status "no errors (EFI system partition)". It is the first partition on the disk.  I see two possible ways to proceed:  (1) Can I change my Windows boot to UEFI, so I can run boot-repair successfully?   (2) Alternatively, is there a way to get a dual boot (grub or whatever) running with BIOS?  Any help is appreciated. Please inform me if there is more information I should provide.    Edit: Output from "sudo lsblk -f":  NAME    FSTYPE    LABEL   … sda ├─sda1    vfat    SYSTEM_DRV                 … ├─sda2 ├─sda3    ntfs    Windows7_OS … ├─sda4    ntfs    Lenovo_Recovery … ├─sda5 ├─sda6    swap … ├─sda7    ext4 … ├─sda8    ext4 … ├─sda9    ext4 … ├─sda10   ext4 … sr0    tso9960    Ubuntu 16.04.1  LTS amd64      … /cdrom loop0    squashfs         …    /rofs   sudo lsblk -fm additionally gives the following sizes:  sda    931.5G sda1   100M     sda2   128M sda3   232.9G sda4   14G sda5   95M sda6   14.9G sda7   9.3G sda8   14.9G sda9   540.2G sda10  105.1G   I installed Ubuntu 16.10 from a live DVD, which I booted via the second item in my boot menu (ATAPI CD0). How can I "start installer in UEFI mode", as oldfred suggested? If I can do that, maybe it resolves my problem.  Sorry, I cannot answer in a comment (size limitation), so I have to edit my original question.    @ubfan1's hint to change my boot options from "BIOS first" to "UEFI first" solved my problem. I re-installed Ubuntu after changing this, and now I have a Grub menu. – ubfan1, if you re-enter this as an answer rather than a comment I will gladly give you credit.

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


About the information paradox in the black holes, isn't it possible in principle, that the "singularity" itself doesn't really exists, and its just the horizon plane, where the particles that falls into it gets stucked, and the hawking radiation, instead of being the creation of the 2 virtual particles, it would creates only the one that goes out of it, and that be entangled with a correspondent one stuck in the horizon, with that way we could retrieve the information, I'm sure that is some problems with that view, but, since we proved we can describe all the black hole just with the horizon itself, doesn't it shows that there isn't nothing more than the horizon? I mean, for me its a much smaller leap, than what physics is doing to assume that since the black hole can be described by the horizon, our hole universe can be described in one less dimension.

Assuming we have a sufficiently small and massive object such that it's escape velocity is greater than the speed of light, isn't this a black hole? It has an event horizon that light cannot escape, time freezes at this event horizon, etc. However this object is not a singularity.  If a large star's mass were compressed to the size of, say, a proton, it would certainly have these properties but it would still not be a singularity as a proton does have volume.  The reason "physics breaks down" at singularities is because we cannot divide by zero, but as long as the proton-sized object has volume, physics won't "break down", yet we still have an event horizon and an object that is invisible (but not undetectable) from the outside.  I have read the answers to  related question. I'm not sure if they don't address my specific question or if I don't understand the answers.


Basically, I want a tool to interpret the raw output of commands that output ANSI color codes, terminal reset codes, etc. in the Linux/Unix/macOS terminal. Something based on  would be ideal. Does something like this already exist? If not, it wouldn't be too hard to write a tool to read codes from standard input and translate it using this page.

To get the character sequences of a particular keyboard shortcut we use showkey -a or verbatim insert (Ctrl+V). What is the opposite of it? How can I get the keyboard shortcut in human readable format from character sequences? I used some keybindings for example ^[^? ^X^U ^[[3;5~ ^[[1;2D ^[[1;2C ^[[1;5C ^[[1;5D ^[[1;6C ^[[1;6D ....  Now I do not remember which key/key-combination they used to represent. How can I find that out? Update 1 I am looking for something which will output Ctrl+R or Ctrl+Delete etc, I mean in human readable format. Any reference to a table which has possible character sequences and their human readable formats will also do.


I have 7 different Likert Scales each consisting of 4 Likert items. In other words, I have 7 variables (Likert scales) and 28 Likert items (questions).  I tested for reliability using cronbach's aplha and all likert scales were above 0.70. Now by putting the likert items together to build new variables do I use the mean or mode?  And lastly, I want to find the correlation between one likert scale and the rest of them? What kind of analysis should I use?   Thanks

I have some  gained from survey questions.  In my case they are  responses (Strongly Disagree-Disagree-Neutral-Agree-Strongly Agree).  In my data they are coded as 1-5.  I  don't think means would mean much here, so what basic summary statistics are considered usefull?


as a preface - my only experience with Ubuntu is playing around on VM's, so I apologize in advance for any naivety.  I've just updated my Yoga 2 Pro from Windows 8.1 to 10, and am trying to install Ubuntu 14.04.2 along side. I created a UEFI bootable USB with Ubuntu 14.04.2 using rufus .  I disabled secure boot and fast boot and enabled USB boot in the BIOS menu. I was able to get 'try Ubuntu' running, but when I go to install, I get errors with the grub install.  When I select /dev/sda as the pointer for the boot loader, I get the error:  The 'grub-efi-amd64-signed' package failed to install into /target/. Without the GRUB boot loader, the installed system will not boot.   This is followed by the installation crashing.  Looking online, it seems like others had this issue, but it was resolved when they pointed the boot loader to /dev/sda2 (which is where the Windows Boot Manager is). Unfortunately, I get another error when I do this:  Executing 'grub-install /dev/sda2' failed. This is a fatal error.   If it matters, I elected to not have separate root and home partitions due to a smaller SSD. So I have a partition, sda8, that is a 8gb swap partition and a ~25gb root partition, sda9, formated in Ext4 and mounted at /.  EDIT: I've tried going through  to no avail. I tried to install 15.04 as well (the above link seems to indicate that alone could resolve some UEFI related issues) but got the same errors. Ubuntu seems to be installing (the installer sees a previous install in the correct partition), but crashes at the boot loader.  EDIT 2 - SOLUTION: I'm not sure what solved it, but here is what I did in case anyone else has the same issue. Some how the EFI partition corrupted. I deleted the ubuntu partitions using a live USB, then deleted /EFI/boot/Ubuntu. This lead to a failure to boot windows as well, so I used a windows recovery USB to repair windows boot manager. Then, in windows, I created the partitions for a clean ubuntu install. Finally, I reinstalled with no problem.

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


Suppose i invest 100000 today.and suppose rate of interest is 12% and inflation rate is 6% . so what amount i will get after 2 year at the rate of 12% and inflation of 6%.  In other word you can say,how the rate of interest affects inflation rate.  Please help me to get this.I'm struggling for this for a long while. Any help will be appreciated. Thanks in advance.

Suppose the following:   if a child's age is 2 years today and  he/she will go to college at the age of 15 years  for 2 years(duration of education) and  for which Cost incurred P.A. as on today (Rs.) 100000, Expected rate of return (%) 12  Expected Inflation rate (%) 6,   how can we calculate the future expenditure of education of child.  And for help the answer is: Amount required at start of College (Rs.) :4,39,383  To meet this Goal you must Invest (Rs.) :  - 1,00,695 Lumpsum amount OR  - 1,228 Monthly SIP  Can anyone help me to get the formula to calculate the future amount with right logic.


I am trying to detect if a sequence of text begins with a numbering, eg I), IV., a), C/, C. C -, C- etc with a regex.  I tried the following regex :   m = re.search(r'^(IX?{\s|-|-\s|,|,\s|\)|\)\s|.|.\s}|IV?{\s|-\s|-|\)|\)\s|.\s|.}|VI{0,3}?{\s|-|-\s|\)|\)\s|.|.\s})', "II - Informations supplementaires") m.group(0) >> 'I' m.group(1) >> 'I'   It only gives me 'I' as a result, I don't have "II", "II -", which are expected .... What is my error in the pattern ^^ ?

Thinking about , i decided I can't even create a regular expression that will match roman numerals (let alone a context-free grammar that will generate them)  The problem is matching only valid roman numerals.  Eg, 990 is NOT "XM", it's "CMXC"  My problem in making the regex for this is that in order to allow or not allow certain characters, I need to look back. Let's take thousands and hundreds, for example.  I can allow M{0,2}C?M (to allow for 900, 1000, 1900, 2000, 2900 and 3000). However, If the match is on CM, I can't allow following characters to be C or D (because I'm already at 900).  How can I express this in a regex? If it's simply not expressible in a regex, is it expressible in a context-free grammar?


Editing ignored tags can be cumbersome when you have a lot of them already.   If you would be so kind to take a look at the following. My front page looks like this:    When I proceed to click "edit" on the right of Ignored Tags...    ... I have to scroll all the way to the bottom of the page to find a small add box using my trusty scrollbar or scroll wheel. Both of which take ages:    To add to my agony, I normally middleclick to make the autoscroll option appear. Then I can just move my mouse down and it will go to the place fast. But if I middle click to the right of the list of ignored tags, the add box dissappears. So I have to use the scroll wheel or scroll bar instead, which takes forever.   Could something be done to address this issue?

It seems that most people who use the ignored tags feature end up with a fairly long list of those tags.  Although , it is sometimes necessary to add new ignored tags manually (typically when adding some-tag*).  It would be a lot easier if the add box was above the long list of ignored tags rather than below. I suppose the same would apply to the favorites tags for consistency's sake.


I know the Fourier transform is an isometry of $L^2$ functions. I've read that the Laplace Transform of an $L^2$ function is $L^2$ but cannot prove it nor can I find a proof. Does anyone know of a proof?

The Laplace transform is defined by \begin{equation} (\mathscr{L}f)(s) \triangleq   \int_0^\infty e^{-sx} f(x) dx, \quad s>0, \end{equation} then how can we check that the Laplace transform $\mathscr{L}$ is bounded as an operator from $L^2(\mathbb{R}_+)$ to $L^2(\mathbb{R}_+)$ with norm $\sqrt{\pi}$?


Use counting arguments to prove these identities: I don't know how to type this: it is two numbers in brackets the first on top of the other, but there is no fraction line. Here is an image of both of the identities.  $${n \choose 0} + {n \choose 1} + {n \choose 2} + \cdots + {n \choose n} = 2^n$$ $$ {n \choose 1} + 2 {n \choose 2} + 3 {n \choose 3} + \cdots + n{n\choose n} = n 2^{n-1}$$

Prove that   $$\sum^{n}_{i=1}\binom{n}{i}i=n2^{n-1}$$   I can't find counting interpretations for either of the sides. A hint of "if $S$ is a subset of $\{1, . . . , n\}$ and $S^\prime$ is its complement then $|S| + |S^\prime| = n$" was also given, but I still don't know how to begin.


How many points can exist in one dimension? ANS: Infinite! How many lines can exist in a two dimension? ANS: Infinite! Now my question is how many points can exist two dimensions or even higher dimensions? "Infinite points * Infinite lines" infinity? Or "just" infinity? Can we say two dimensions contain more points than one dimension?

Is the set of points or the set of lines on a plane "larger",or there is a 1-1 correspondence between lines and points?