I'm making JKnRnS master slave flip-flop, here is my code:  library IEEE; use IEEE.std_logic_1164.all;  entity JKnRnS is   port(        C : in STD_LOGIC;        J : in STD_LOGIC;        K : in STD_LOGIC;        nR : in STD_LOGIC;        nS : in STD_LOGIC;        Q : inout STD_LOGIC;        nQ : inout STD_LOGIC   ); end entity;  architecture JKnRnS of JKnRnS is                                                              signal Q_int: std_logic := '1'; signal NQ_int: std_logic := '0';  signal a,b,c1,d,f,e,notC: STD_LOGIC; begin     a<=not(C and J and nS and NQ_int);                                   c1<=not(d and a and nS);  d <= not(nR and b and c1);  b <= not(Q_int and nR and K and C);  e <= not(notC and c1);  f <= not(d and notC);  Q_int <= not(NQ_int and e and nS);  NQ_int <= not(nR and f and Q_int);  notC <= not(C);  Q<=Q_int; nQ<=NQ_int;   end architecture;   which works fine, but when I change it into:  library IEEE; use IEEE.STD_LOGIC_1164.all; use IEEE.STD_LOGIC_MISC.all;  entity nand_3 is                                     generic (t_rise: TIME:= 0 ns; t_fall : TIME:= 0 ns);      port(          in1 : in STD_LOGIC;          in2 : in STD_LOGIC;          in3 : in STD_LOGIC;          out1: out STD_LOGIC          ); end entity;   architecture nand_3 of nand_3 is  begin        process (in1, in2, in3) is     begin     out1 <= not(in1 and in2 and in3);       end process; end architecture;   library IEEE; use IEEE.STD_LOGIC_1164.all;  entity nand_4 is      port(          in1 : in STD_LOGIC;          in2 : in STD_LOGIC;          in3 : in STD_LOGIC;          in4 : in STD_LOGIC;          out1 : out STD_LOGIC          ); end entity;                                                 architecture nand_4 of nand_4 is begin      process (in1, in2, in3, in4) is      begin          out1<=not(in1 and in2 and in3 and in4);      end process; end architecture;  library IEEE; use IEEE.std_logic_1164.all;  entity JKnRnS is   port(        C : in STD_LOGIC;        J : in STD_LOGIC;        K : in STD_LOGIC;        nR : in STD_LOGIC;        nS : in STD_LOGIC;        Q : inout STD_LOGIC;        nQ : inout STD_LOGIC   ); end entity;  architecture JKnRnS of JKnRnS is                                                              signal Q_int: std_logic := '1'; signal NQ_int: std_logic := '0';  signal a,b,c1,d,f,e,notC: STD_LOGIC; begin      E1: entity work.nand_4(nand_4)     port map(in1=>C, in2=>J, in3=>nS, in4=>NQ_int, out1=>a); E2: entity work.nand_3(nand_3)     port map(in1=>d, in2=>a, in3=>nS, out1=>c1);  d <= not(nR and b and c1);  b <= not(Q_int and nR and K and C);  e <= not(notC and c1);  f <= not(d and notC);  Q_int <= not(NQ_int and e and nS);  NQ_int <= not(nR and f and Q_int);  notC <= not(C);  Q<=Q_int; nQ<=NQ_int;   end architecture;   I get an error:  KERNEL: Error: KERNEL_0160 Delta count overflow. Increase the iteration limit using -i argument for asim or the matching entry in simulation preferences. What is wrong here?


memoir does not generate figure cross reference

I do have this short file  \documentclass%[colorlinks=true] {memoir} \usepackage[pdftex]{hyperref} \begin{document} %\chapter{first} Here goes the figure. \begin{figure}[!h] \label{fig:MyFigure} this is the figure itself \caption{The figure caption} \end{figure}  Next part of text. Refer to Fig \ref{fig:MyFigure} on page \pageref{fig:MyFigure}. \listoffigures \end{document}   The result shows up like this:  Next part of text. Refer to Fig on page 1.  I.e. the Fig number is missing. When I uncomment [colorlinks=true], some very narrow rectangle is visible after Fig, so I guess somehow \ref{} generates nothing. At the same time, \pageref{} seems to work OK. Also, \listoffigures "sees" the figure. After uncommenting \chapter{first}, the compilation is OK. (The same effect also on ShareLaTeX, so it is not a TeX configuration problem.)  Also, I do have figure number "1.1", and in the reference I see "1". when having more than one figure, the figure sequence number is OK, but in the reference I see some increasing number, with 3-4 step size; at the same time the hyperref jump seems to take  to the right place.  Do I miss something, or it is a bug?


Spelling error in stackapps register page

I think this:     You'll also receive parameters for authentication users via OAuth 2.0.   Should say:     You'll also receive parameters for authenticating users via OAuth 2.0.        Keep up the good work!


Ubuntu Server 17.04 enable numlock without desktop environment

In earlier Ubuntu versions I would :  sudo apt-get install numlockx sudo sed -i 's|^exit 0.*$|# Numlock enable\n[ -x /usr/bin/numlockx ] \&\& numlockx on\n\nexit 0|' /etc/rc.local   But starting from version 16.10 there is no file rc.local, so how to I enable numlock in version 17.04 without desktop environment?  Update: I created rc.local file as described , then executed commands mentioned earlier and now numpad works when I connect over SSH. For it to work in VirtualBox I added  lines to rc.local:  # Turn Numlock on for the TTYs: for tty in /dev/tty[1-6]; do     /usr/bin/setleds -D +num < $tty done   And now everything works!


How do I delete a stubborn file in the Bin?

I have this file (see attached);   And I cannot delete it. it doesn't exist...  I have tried typing rm in the prompt then dragging the file on to it, I have gone to the actual location of the file and it's not there, I have deleted .Trash folders left right and center and I still can't find it... I have just run First Aid on ALL the volumes I have and the file still mocks me. Does anyone else have any suggestions?


How come pid files are used when pids can clash with an unrelated process?

It seems that a common way of running only one copy of a process is to  and then on start check whether a process with that pid exists. I imagine OS is trying not to reuse a pid quickly after a process has crashed, but since the number of pids is limited, sooner or later there is going to be another unrelated process using that pid. And the original one won't start. How can this situation be avoided?


Create trigger to add related opportunity for each new, updated account if no opportunity is already associated with the account

Please help me to write a test class for the below code trigger RelatedRecord on Account(after insert, after update) {    List<opportunity> opportunityList = new List<opportunity>();    Map<Id,Account> accountswithopp = new Map<Id,Account>();    ([select Id,(select Id from opportunities) from Account Where Id IN :Trigger.New]);    for(Account acc : Trigger.New) {       System.debug('accountswithopp.get(acc.Id).opportunities.size()=' + accountsWithopp.get(acc.Id).opportunities.size());       if (accountswithopp.get(acc.Id).opportunities.size() = 0) {          opportunityList.add(new Opportunity(                      Name=acc.Name + ' opportunity',                        StageName='Prospecting',                        CloseDate=System.today().addMonths(3),                        AccountId=acc.Id));       }    }    if (opportunityList.size() > 0) {       insert opportunityList;    } }


Suppose $D$ is a nonempty bounded subset of reals. Let $f:D \to \mathbb R$ and $g:D \to \mathbb R$. Define $(f+g)(x)=f(x)+g(x)$. Prove $\sup(f+g)(D) \le \sup f(D) + \sup g(D)$ (also prove that $\sup (f+g)$ exists).   I understand why this is the case, just not how to prove it. Left side is pretty much $\sup  (f(x)+g(x))$ and right side is $\sup (f(x) + g(y))$ for $x,\,y \in D$. Basically $f+g$ has to use the same variable and $f(D)+g(D)$ use different ones. But I don't know how to go about proving this.     The second part of the question is to find a specific example where strict inequality holds.    Let $D=\{a,b\}$ and $f: a \to 1,\, b\to 0, \,g: a \to 0,\, b\to 1$. $\sup f(D) = 1,\, \sup g(D) = 1,\, \sup f(D) + \sup g(D) = 2.$ $\sup (f+g)(D) = 1$ (if we choose a, $f+g = 1+0,\, b,\, f+g=0+1$).


Ubuntu not booting after installation alongside windows 10

Hi I am new to this site and linux as well. Installed ubuntu on my dell inspiron 3543 laptop which already had windows 10. After successfully installing ubuntu and at the first reboot, It started to boot windows 10 as usual and there was no option to select between ubuntu and windows 10.  Please help. Many thanks.


There is a limit of temperature that is about $0$ K = $-273.15$ $^\circ$C. Is there any maximum limit?


Is there a formula for the spring constant $k$ which satisfies the equation $$F=k\Delta \ell~?$$  A similar question was asked but was answered by transposition of this equation... I'm hoping for an answer addressing the physical meaning of a spring constant.  Unlike the question which is marked as a duplicate, I was hoping for a fixed equation which encompasses all factors, rather than just a list.


Edit blocked when there is a pending edit and I am review banned

I'm blocked from reviewing for some time, but I'm not blocked from editing. I would like to edit someone's question, but there is another suggested edit review pending. I can't approve it because of the review ban, but also I can't do any other edit as when I click "edit" it redirects me to approve the edit. Is that expected or this is a bug?


Could we use solar energy with endothermic reactions to fight global warming?

Im in holidays in Malaysia and it is god damn hot. You cannot leave your hotel/car and go out. All this because of the sun.  I we were to capture all the heat (solar panels, ...) would this help make the Earth cooler / fight global warming ?  Edit : see one of my comments, I mean use the heat to conduct some endothermic reactions (e.g solar panel -> electricity -> electrolyte)


I tried to run a bat file in Java using the following code.  Runtime.getRuntime().exec("run.bat", null, new File("C:\\test\\"));   I got the following error.  java.io.IOException: Cannot run program "run.bat" (in directory "C:\test"): CreateProcess error=2, The system cannot find the file specified at java.lang.ProcessBuilder.start(ProcessBuilder.java:1041) at java.lang.Runtime.exec(Runtime.java:617) at java.lang.Runtime.exec(Runtime.java:450) at stl_generator.Program.runCommandScript(Program.java:102) at stl_generator.Program.createFile(Program.java:20) at stl_generator.Program.main(Program.java:112) at sun.reflect.NativeMethodAccessorImpl.invoke0(Native Method) at sun.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:57) at sun.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43) at java.lang.reflect.Method.invoke(Method.java:606) at com.intellij.rt.execution.application.AppMain.main(AppMain.java:134) Caused by: java.io.IOException: CreateProcess error=2, The system cannot find the file specified at java.lang.ProcessImpl.create(Native Method) at java.lang.ProcessImpl.<init>(ProcessImpl.java:385) at java.lang.ProcessImpl.start(ProcessImpl.java:136) at java.lang.ProcessBuilder.start(ProcessBuilder.java:1022) ... 10 more   My file is exist in the location that I've declared. How to fix this?  Thanks in Advance


I want to get all Tasks from this Java code. I get      com.podio.APIApplicationException: null   How I skip the code with NPE and continue the execution of the code?  import com.podio.APIFactory; import com.podio.ResourceFactory; import com.podio.api.Podio; import com.podio.oauth.OAuthClientCredentials; import com.podio.oauth.OAuthUsernameCredentials; import com.podio.task.TaskAPI;  public class PodioImpl implements Podio {     @Override     public void connect(String client_id, String secret, String user_name, String password)     {         ResourceFactory resourceFactory = new ResourceFactory(             new OAuthClientCredentials(client_id, secret),             new OAuthUsernameCredentials(user_name, password));         APIFactory apiFactory = new APIFactory(resourceFactory);          TaskAPI api1 = apiFactory.getAPI(TaskAPI.class);          if(api1.getActiveTasks() != null){             System.out.println("ActiveTasks ");         }         if(api1.getAssignedActiveTasks() != null){             System.out.println("AssignedActiveTasks ");         }         if(api1.getCompletedTasks() != null){             System.out.println("CompletedTasks ");         }     } }


"two year's " or "two years' " or "two-year"

In _____ time, criteria for enrolling into university are going to be   quite different.   a) two year's  b) two-year  c) two years'  When it comes to me I'd pick b) or c), but the source of mine tells that a) is correct.  I want to know who is wrong and who is right here!


What is the intended use of the water hose in Indian restrooms?

In Indian restrooms, I have often seen a flexible water hose with a hand-release attached. My original assumption was that it is supposed to be used to clean the bowl if you have left 'skidmarks' after flushing, or for use by the cleaning personnel. However, recently I saw a reference in a travel blog that you are supposed to use it for cleaning yourself in the respective areas; similar to the water-spray system in toilets in Japan.  What is really the intention?  I would prefer an answer from someone that grew up in India, and really knows what the intended use is, not a guess from other travellers - I can guess myself.


Change float content order depending on its position selected by LaTeX's float mechanism

I'm (still) going to develop a class that will use wide margins and put some contents into it. In contrast to tufte-book, which sets the positioning parameters for floats as htbp by default, I would like to allow true floats. Furthermore, I'd like to offer an environemtn which a) floats and b) puts its caption (in the margin) either above or below the figure, depending on the positioning selected by the float mechanism. While I can handle this if a position is provided (the optional argument of figure or table), I'd like to do the same if no optional argument was specified. Since the content and hence the height of the figure is the same for both cases, it would not change the positioning of the figure.   I'm quite sure that I have read about this some years ago, but I don't find a hint via google. For the MWE, I omit the positioning in the margin but simply want to output the caption below or above the figure's content.   \documentclass{article} \usepackage[marginparwidth=7cm,left=1.5cm,right=1cm,includemp]{geometry} \usepackage{lipsum} \makeatletter \def\myt{t}\def\myp{p}\def\myb{b} \newcommand*\widefigure[3][]{%   % #1: Position   % #2: Figure   % #3: Caption   \def\@tempa{#1}%   \begin{figure}[#1]%     \rlap{%       \begin{minipage}{\dimexpr\textwidth+\columnsep+\marginparwidth}%         \ifx\@tempa\myb           \caption{#3}#2%         \else\ifx\@tempa\myt           #2\caption{#3}         \else\ifx\@tempa\myp           \caption{#3}#2%         \else          % What if no position is specified?         \fi\fi\fi       \end{minipage}}   \end{figure}% } \begin{document} \widefigure[b]{\rule{\textwidth}{5cm}}{foo} \lipsum[1-4] \widefigure[t]{\rule{\textwidth}{5cm}}{foo} \lipsum[2] \widefigure{\rule{\textwidth}{5cm}}{foo} \lipsum[7] \end{document}


I want this image be right in the center of the page, in a section but it is not working, btw I'am using jade and sass.  Jade:  section.believe(data-section-name='texture', <='', body='')       img.minion(src="/images/IMG_6219.jpg")   Sass:     .minion     top: 50%     left: 50%     padding: 100px     margin: 0 auto     height: 10%     transform: rotate(90deg)


Can I uninstall a preloaded app I want to remove flip board but it pops up with a warning that it may cause problems with other apps?


How to add users to a FTP site in Windows 7's IIS?

I've setup a HTTPS and FTP site in IIS but how can I add users to use the FTP site?  Does they necessarily need an account with password in the computer to be able to use it?


Passing multiple commands to gnome-terminal from a script

My bash-script is not run in a terminal, but opens a terminal at runtime to ask for user input (sudo password). I would like to tell the user in this terminal what the script is trying to do. First, here is my script:  #!/bin/bash #This should install: Qt Linguist, lrelease  #for Qt Linguist dpkg-query -l qt4-dev-tools if echo $? == 0; then  check1=1 fi  #for lrelease dpkg-query -l qt4-default if echo $? == 0; then  check2=1 fi  echo $check1 echo $check2  if [ $check1 = 1 ] && [ $check2 = 1 ];then  gnome-terminal -x sudo apt-get install qt4-dev-tools qt4-default fi $SHELL   This opens a terminal with this:  [sudo] password for "username":    But I would like to have:  qt4-dev-tools and qt4-default are missing. Now trying to install. [sudo] password for "username":    How do I get this when starting the terminal with gnome-terminal -x?


Adding 2 favorite tags at one time combines tag after page refresh

I was adding some tags to my favorite tags today and noticed tags being joined together when the page is refreshed.  Steps to reproduce:   Click edit on Favorite Tags Create the first tag and click add [I added django in this case] Add a second tag and click add [I added python in this case] Refresh page  Favorite tags now show previous tags + djangopython   In the edit section, it appears as if the tags are added separately, but when I refresh the page they get joined  OS: MacOSX-10.8  Browser: Chrome, Firefox


Show that any ball (open or closed) in $\mathbb{R}^n$ is a convex set.

I tried to show that the set $X = \{(x, y)\in \mathbb{R}^2 : x^2 + y^2<1\}$ is convex.


If an integral domain $A$ is integrally closed, then so is $A[T]$

Show that if an integral domain $A$ is integrally closed in its field of fractions $K$, then so is $A[T]$ in its ring of fractions, $K(T) := \mathrm{Frac}(A[T])$.    What I have done so far (albeit not much) is the following.  Pick any $p(T) \in K(T)$ that is integral over $A[T]$, that is, the following is true.  $p(T)^n + a_{n-1}p(T)^{n-1} + \cdots+ a_1p(T) + a_0 = 0$ with each $a_i \in A[T]$.  One hint I got was that I could try eliminating the denominator of $p(T) = \frac{f(T)}{g(T)}$ by multiplying out by $g(T)^n$. But that is about it, I'm stuck quite some time trying to do the next step.  So any help or insights regarding this is deeply appreciated.


I've had my led tape lighting under cabinet lighting for 3 years & it has just in the past week begun to flash on & off when it's turned on. It stops flashing after a few minutes. What could be the problem? I've already checked the strips & connectors & they all work fine. I'm thinking it might be in the connection of the on/off switch. It is plugged into an outlet inside my cabinet.


How to supervise and automatically restart a process?

I want to have a process which will be restarted if it crashes. I googled a bit and found that an easy solution is to use .  I didn't understand how to configure it.   What is the easiest way to acomplish such a functionality? How to configure it?


Don't tell me you're "hiding questions" when there are none to begin with

The question  notes that if I try to search for a tag that does not exist, like say, , and I have ignored tags on that site, I get told that posts are being hidden because of those ignore preferences:  Hiding questions because of your Ignored Tags preferences for tags  This is ridiculous and it is misleading, and leaves the impression that if one searches for that tag and the offending ignored tag one would get results. Instead, one gets results like , which simply doesn't make sense:  (Note also that the [homework] tag is part of that query, and it is not in any way expected behaviour to have the results hide posts with the tag.) Compare that search, for example, with ,  which is much more reasonable. So, feature request: Don't tell me you're hiding posts when there are no posts to begin with. The purpose of the banner is to alert you to other possible queries that may yield results that are not being displayed. It is perfectly easy to tell when there are no results to show even with the ignore preferences turned off. If that is empty, simply don't show anything.


Unable to change the license from Customer Community Plus to Customer Community

Previously I gave this user the Customer Community Plus License but when I tried to change it to Customer Community, it throws an error. It will be really helpful if I get a solution.  I am just learning community, in fact this is a trailhead problem. So please excuse if I made any silly mistakes. :)


I would like to calculate the response time of the PMOS cicruit in this ciruit.    But I have some troubles about the gate charging. I'm trying to use this:   With the IRF6215   I don't know "which" time should I use in the application note. And how do I do if i don't have Vgp?  Thanks  edit: This question is different from my previous one. Because this new question is focused on how I can applied the application whereas the previous one deals on how to calculate the transient voltage on the load  edit2: Vin1 = 28V and VCMD1 is a pulse in the range of [0;28V] To be more clear, I'm looking into how to do the calculation, instead of how to understand


Fundamental particles identical or just differences very small?

I have read that all electrons are identical and I assume the same for protons, etc. That is, all electrons are of the exact same mass and charge.  But do we really know this? Could there be slightly heavier electrons with slightly higher charge or is there a reason why such particles could not exist or would be unstable?


I want to write "Hall thrusters are propulsion devices whose power spans from 0.1 to 20 kW."  I am not sure about "whose" part, because it feels like it's supposed to be used only when talking about humans (am I right?).  So is there any other word that could replace the "whose"? Or can it be used in this way and I am just overthinking it?


Using while loop to ssh to multiple servers

I have a file servers.txt, with list of servers:  server1.mydomain.com server2.mydomain.com server3.mydomain.com   when I read the file line by line with while and echo each line, all works as expected. All lines are printed.  $ while read HOST ; do echo $HOST ; done < servers.txt server1.mydomain.com server2.mydomain.com server3.mydomain.com   However, when I want to ssh to all servers and execute a command, suddenly my while loop stops working:  $ while read HOST ; do ssh $HOST "uname -a" ; done < servers.txt Linux server1 2.6.30.4-1 #1 SMP Wed Aug 12 19:55:12 EDT 2009 i686 GNU/Linux   This only connects to the first server in the list, not to all of them. I don't understand what is happening here. Can somebody please explain?  This is even stranger, since using for loop works fine:  $ for HOST in $(cat servers.txt ) ; do ssh $HOST "uname -a" ; done Linux server1 2.6.30.4-1 #1 SMP Wed Aug 12 19:55:12 EDT 2009 i686 GNU/Linux Linux server2 2.6.30.4-1 #1 SMP Wed Aug 12 19:55:12 EDT 2009 i686 GNU/Linux Linux server3 2.6.30.4-1 #1 SMP Wed Aug 12 19:55:12 EDT 2009 i686 GNU/Linux   It must be something specific to ssh, because other commands work fine, such as ping:  $ while read HOST ; do ping -c 1 $HOST ; done < servers.txt


Trying to implement zobrist hash, but python is changing values in my zTable for some reason

So I'm trying to implement zobrist hashing into a school project I am working on. However, when initializing the table of random numbers, the output from printing the zTable has identical entries (126 and 127 which are the last numbers created). I know that for zobrist hashing, I should use large 64 bit numbers to represent each piece and its position. However in my game, there are only two pieces, so my thinking was as long as the numbers are unique, it shouldn't matter.  After a few rounds of debugging, I was able to figure out that the correct numbers are being assigned as the program loops, but once the program exits, the numbers are different when I call print(zTable). Any advice? Thanks      zTable = [[[None] * 2] * 8] * 8 currNumber = 0   # Initializes the zHashTable for this board def initTable(self):     for row in range(8):         for col in range(8):             for i in range(2):                 self.zTable[row][col][i] = self.currNumber                 self.currNumber += 1


How to extend my short stay Schengen visa?

I hold a China main-land passport.  I am doing study abroad from the US to France and Spain. With all the confusion and my poor judgement, now I end up with a short stay visa in France (Schengen visa). This only covered my stay in France but not long enough for my classes in Spain. Is it possible for me to extend my stay in Spain?


Neural Network - Can I use sigmoid activation function in hidden layers of regression problem?

I am trying to predict for count which ranges from 0 onwards as a regression problem using NN. Can I add sigmoid, tanh or relu activation function to the hidden layers and no activation function to the final layer?


how to convert jar file into .dmg on windows

I have developed a JavaFX project on Windows and now I want to convert jar file to Dmg file to run on mac. Please recommend a tool that runs on Windows and can create a DMG file for a Mac.


Biblatex authoryear dashed for entries with no year

I'm using biblatex authoryear and have multiple entries of the same author that do not have a year. When I cite them there are letters shown to distinguish them:   But in the bibliography those letters are not shown and you can only distinguish them by the title. Is it possible to show the letters in the bibliography, too?  \documentclass[a4paper,12pt]{article}% \usepackage[T1]{fontenc} \usepackage[utf8]{inputenc} \usepackage{filecontents} \begin{filecontents}{bib.bib} @BOOK{bar1,   title = {Text One},   year = {},   author = {Firstname Lastname}, } @BOOK{bar2,   title = {Text Two},   year = {},   author = {Firstname Lastname}, } \end{filecontents}  \usepackage[backend=biber, style=authoryear-icomp, dashed=true]{biblatex} \addbibresource{bib.bib}  \begin{document}  \cite{bar1} and \cite{bar2}  \printbibliography \end{document}


I have the following SQL query and I would like to output the ageOnLastSeptember date in a UK (dd/mm/yyyy) format. Can anyone tell me how I can achieve this?  $sql="select ( if(month(now()) < 9, year(now()) - 1, year(now())) - year(dob) - if(month(dob)<9, 0, 1)  ) as ageOnLastSeptember,first_name,last_name,dob,school,contact_no,family_id,contact_id from members_family where contact_id = '$contact_id' ";   I tried the following but it did nothing  $sql="select date_format(( if(month(now()) < 9, year(now()) - 1, year(now())) - year(dob) - if(month(dob)<9, 0, 1)  ), '%d/%m/%Y') as ageOnLastSeptember,first_name,last_name,dob,school,contact_no,family_id,contact_id from members_family where contact_id = '$contact_id' ";


How to get my file back in 2.79 after saving with 2.80 series?

I was experimenting with a file in 2.8 and accidentally saved it. When I opened it back in 2.79 I can't see my model. It disappeared with the error  File written by newer Blender binary.  How can I get my model? I can see my model in 2.8 but nothing in 2.79. I tried to export it  in .obj, but I lost all my modifiers, material and camera setting.


Ubuntu 12.10 is not  since May 2014.  Why is there no archived version at  ?


Can $i$ be defined as a square root of $-1$?

We all, by definition, know that $ i^2 = -1 $, but does that imply (or is it even equivalent ?) that $\sqrt{-1} = \pm i$ ? I often see debates on internet where people are arguing over this last equality, most people arguing that the square root operation is only defined for positive numbers.  I am not familiar with mathematics, so to me, both equations are equivalent, if not, could someone explain in easy terms ?


Sentence:      By 1997 a report in the Journal of the American Medical Association concluded that HRT extended life expectancy for postmenopausal women by as much as three years.   I don’t know if removing the “as much as” will affect the meaning. Why not take the phrase off if it doesn’t add more sense?


OS keyboard shortcuts working on pressing keyboard

is there any way to change this behavior to working on releasing keyboard? i am using ubuntu 18.04 with gnome 3, and if i bind switching layout to alt + shift i am not able to use some shortcuts which contains alt + shift in other apps (intelij idea for example), or it is not possible to change this behavior?


I created a new user and set its option to "root". Then I switched the option of the user which was activated to "standard" and closed the window. But now I can't login as the new user because I didn't set a password and so the user which is root is not activated. What shall I do?


$Q$ factor of parallel RLC circuit in series with a capacitor and resistor

I know that for parallel RLC circuits, the $Q$ factor is given by:   $$ Q = R \sqrt {\frac{C}{L}} $$  But now suppose it is connected in series to a resistor $R_2$ and capacitor $C_2$. Would the $Q$ factor be changed?


Find the sum of $\frac{1}{\sqrt1+\sqrt3} + \frac{1}{\sqrt3+\sqrt5} + \frac{1}{\sqrt5+\sqrt7} + ... \frac{1}{\sqrt79+\sqrt81}$

Find the sum of $\frac{1}{\sqrt1+\sqrt3} + \frac{1}{\sqrt3+\sqrt5} + \frac{1}{\sqrt5+\sqrt7} + ... \frac{1}{\sqrt{79}+\sqrt{81}}$ I've thought about multiplying every fraction by 1, but like this $\frac{1} {\sqrt1+\sqrt3} *\frac{\sqrt1+\sqrt3}{\sqrt1+\sqrt3}$, $\frac{1} {\sqrt3+\sqrt5} *\frac{\sqrt3+\sqrt5}{\sqrt3+\sqrt5}...$ After multiplying I end up with $\frac{\sqrt1+\sqrt3} {(\sqrt1+\sqrt3)^2} + \frac{\sqrt3+\sqrt5} {(\sqrt3+\sqrt5)^2}  ...$ but I don't have any more ideas than this, am I on the right path? I apologize for the question's simplicity, but I'm a younger math enthusiast so questions like this are harder for me.


Cycles : shadows on smooth shaded mesh, strange behavior

I wonder if this is a bug, or if I missed something... When a light hits tangentially convex surfaces with "smooth shading", the shadow on this surface seems to "partially ignore" the smoothness of the surface. Here is an example with a simple cylinder :    On the left, a cylinder with "flat shading". Everything's ok. On the right, the same with "smooth". We can see an edge, bad shadowed.  With or without the "Edge split" modifier, no matters, the edge is still there. The shader is a simple white diffuse shader with no texture nor displace.  I have to add a subsurf modifier with at least 2 levels, which will insanely increase the vertex count... And I can't do that for my project.  I hope someone already saw it, and have a little tip to share. Or if someone already know it's a bug, or a limit of the current Cycles renderer ?


Find a uniformly continuous function such that $a_{n+1}=f(a_n)$

$a_{n+1} = a_n - a_n^2$, $a_1 = 2/3$. for $n\ge1$         a) Show the series converges and find its limit.   b) find a uniformly continuous $f:\mathbb{R}\rightarrow \mathbb{R}$ such that: $a_{n+1}=f(a_n) \forall n \in \mathbb{N}$.     section (a) is very technically, I proved $\{a_n\}$ is monotonically decreasing and bounded bellow, And using limits arithmetic found $L=0$.    section (b) is quite tricky for me. I'd be glad for help. Thanks!


Can't access windows 10 shared folders with account/password

I'm trying to access the folders I shared on Windows 10 through my Android phone. Using Samsung's "My files" I am able to add the SMB network drive. When I turn OFF password protected sharing and sign in anonymously, everything's fine. I can access the files/folders I share. But when I turn it ON and access with my windows account email and password, it doesn't let me in. Seems like either the account's Username or Password are incorrect. I have only one profile on my windows, registered with my email. I changed the password to be sure I wasn't remembering it incorrectly. Am I doing something wrong? Should I be using some other password?


Given a homomorphism $f:G \rightarrow H$, $G$ finitely generated, what can you say about the order of $g_i$ and $f(g_i)$?   I've thought about this question for a while but haven't come to a conclusion.  If we consider the natural homomorphism from $\mathbb{Z}$ to $\mathbb{Z}_3$, the order of 1 in $\mathbb{Z}$ is infinite but the order of 1 in $\mathbb{Z}_3$ is only $3$. Therefore, the order of $f(g_i)$ can be less than that of $g_i$. But can't it also be greater? If not, wouldn't it be impossible to construct homomorphisms from a group of order $n$ to a group of order $p$ where $p > n$?  Thanks.


So that I will be able to see where people that used my bit.ly link come from? I already checked it with Chrome dev tool in Network tab but there is no info.


How to select via jQuery an innerHTML element generated dynamically with javascript

Here is my problem. I need to generate dynamically differents forms with a switch function. forms are displayed step by step to present few questions with radio input with a value for the anwser.  function myFunctionSwitch() { switch(myVarValue) { case "something": text = "
Question Answer<input class=\"reponse\" type=\"radio\" name=\"q1\" id=\"q1r1\" value=\"462\">    <input class=\"reponse\" type=\"radio\"...  <input class=\"reponse\" type=\"radio\"...  <input class=\"reponse\" type=\"radio\"...
" break;  default:... } document.getElementById("myModalInside").innerHTML = text;   I try to get input value with jQuery by this way:  $(document).ready(function(){   "use strict"; var result; var value1;  $('#q1 .reponse').on('change', function(){       value1 = parseInt(this.value);     result = value1 + ...; });   This jQuery code does the right job from an html page with form write in. But I need my switch function to present different forms. That's why I need help.


What is the jutsu that ninjas use to appear/disappear instantly?

Some users of the jutsu are Kakashi, Gai, Genma, Kabuto, etc. It can often be seen when Anbu members are dismissed.


Batch Geocoding in R over daily limit with pay as you go?

I have found the the geocode function in ggmap to be very helpful in the past.  Now I am trying to geocode about 60,000 addresses. The google maps API daily limit is 2500.  Google offers a "pay as you go" service that increases daily limits.      Here is my question:  Is there a way to access a "pay as you go" project through the ggmap geocode function (or something similar)?  If so, how would you do that?  That is:  how to use R's "geocode" for batch geocoding where you are willing to pay to go beyond the daily limit?


Until now, Blair had refused to link the two, insisting instead in the lead-up to the war that sending western troops would deny jihadis an arena and prevent Saddam Hussein from using them as proxies in his standoff with the west.   Source:   I am a little bit puzzled by the usage of past perfect ("Blair had refused…"). Given the fact that the time is localized by "until now", I would await the present perfect ("Blair has refused…").


PGFPlots cone weird artefact at the cusp

I am using the following code to plot a cone in 3D:  \documentclass[tikz]{standalone} \usepackage{pgfplots} \usepgfplotslibrary{patchplots} \usepgfplotslibrary{colormaps}  \pgfplotsset{compat=newest}  \begin{document} \begin{tikzpicture} \begin{axis}[     xlabel={$x$}, ylabel={$y$}, zlabel={$z$},     domain=0:1,     y domain=0:2*pi,     xmin=-1.5, xmax=1.5,     ymin=-1.5, ymax=1.5, zmin=-1.5, zmax=0.1,     colormap/blackwhite,     samples=20,     samples y=20,     z buffer=sort,     unit vector ratio=1 1 1 ]     \addplot3[surf] ({x*cos(deg(y))},{x*sin(deg(y))},{-x}); \end{axis} \end{tikzpicture} \end{document}   However, I end up with a few weird line extensions near the top. How do I get rid of them?    Thanks!


Apple ID's -- I have apple id's on two devices

I have the same apple id on two devices can i delete one app on one device without deleting it on the other device. There are lots of apps which I would like to have and lots of apps which I wouldn't like to have. Also like games with levels etc. do you start from THAT level or from the beginning? E.G simsfreeplay I use icloud to back up this game can I download it on another device (same app) but with the same id?!


how many outlets and fixtures can I connect to 20 amp cicuit?

can I connect one GFCI ,and one non GFCI, outlet along with 2 lights and an exhaust fan on a 20 amp circuit fed by a 12/2 wire?  I notice that some experts suggest a dedicated circuit for a GFCI outlet. Does this mean I must run a separate feed e.g. 14/2 to the lights in the bathroom?


How to remove IP search result from google search?

One of my website shows as IP instead of domain name:  Is there any way to remove this from google? From the search console when I used the removal tool I cannot use IP since it says the property is not mine.


Find the equation of the tangent plane to the surface $x^{\frac{2}{3}}+y^{\frac{2}{3}}+z^{\frac{2}{3}}=2^{\frac{2}{3}}$ at $(x_0,y_0,z_0)$

Find the equation of the tangent plane to the surface given by $$x^{\frac{2}{3}}+y^{\frac{2}{3}}+z^{\frac{2}{3}}=2^{\frac{2}{3}}$$ at the given point $(x_0,y_0,z_0)$ Then find the intersection of the tangent curve with the $x,y,z$ axis,show that the sum of the squares of these distances from the origin is a constant.  considering the given point, the equation transforms to $$\frac{2}{3}x_0^{\frac{-1}{3}}\left(x-x_{0}\right)+\frac{2}{3}y_0^{\frac{-1}{3}}\left(y-y_{0}\right)+\frac{2}{3}z_0^{\frac{-1}{3}}\left(z-z_{0}\right)=0$$ As I know the intersection of the tangent surface  with the $x,y,z$-axis is the set of all points such that (resp): $$x_0^{\frac{-1}{3}}\left(x-x_{0}\right)-y_0^{\frac{-1}{3}}y_{0}-z_0^{\frac{-1}{3}}z_{0}=0$$ $$x_0^{\frac{-1}{3}}x_{0}-y_0^{\frac{-1}{3}}(y-y_{0})-z_0^{\frac{-1}{3}}z_{0}=0$$ $$x_0^{\frac{-1}{3}}x_0-y_0^{\frac{-1}{3}}y_{0}-z_0^{\frac{-1}{3}}(z-z_{0})=0$$ I don't know what else should I do.


Best algorithm to test if a linked list has a cycle

What's the best (halting) algorithm for determining if a linked list has a cycle in it?  [Edit] Analysis of asymptotic complexity for both time and space would be sweet so answers can be compared better.  [Edit] Original question was not addressing nodes with outdegree > 1, but there's some talk about it. That question is more along the lines of "Best algorithm to detect cycles in a directed graph".


I know many similar approaches have been asked about this error but none of the solutions solved my problem. I was trying to install Nord VPN on my Ubuntu by this command: sudo apt-get install {/path/to/}nordvpn-release_1.0.0_all.deb  and it gives me this erorr: E: Unable to locate package {/path/to  What shold I do?


How can I find all files that do NOT contain a text string?

What concise command can I use to find all files that do NOT contain a text string?  I tried this (using -v to invert grep's parameters) with no luck:  find . -exec grep -v -l shared.php {} \;   Someone said this would work:  find . ! -exec grep -l shared.php {} \;   But it does not seem to work for me.   has this example:  find ./logs -size +1c  > t._tmp while read filename do      grep -q "Process Complete" $filename      if [ $? -ne 0 ] ; then              echo $filename      fi done < t._tmp rm -f t_tmp   But that's cumbersome and not at all concise.  ps: I know that grep -L * will do this, but how can I use the find command in combination with grep to excluded files is what I really want to know.  pss: Also I'm not sure how to have grep include subdirectories with the grep -L * syntax, but I still want to know how to use it with find :)


Did J.R.R. Tolkien ever write a deeper connection between The Hobbit & Lord of the Rings: Fellowship of the ring?

There seems to be a bit of a gap between The Hobbit and Lord of the Rings: Fellowship of the Ring. While we know the outcomes from The Hobbit to Lord of the Rings, we don't know what happened between them. Did Tolkien ever novelize this?  Connecting the two movies together, I've pieced the following sub-plots:   Saruman becomes corrupted by peering into the Palantír of Orthanc at some point after The Hobbit Gollum gets captured by Sauron's army Legolas leaves his homeland, in search of a ranger of some importance Tauriel is banished from her homeland Bilbo returns to the Shire, and finally relinquishes the one ring on his 111th birthday to Frodo   What doesn't seemed joined by the books or the two trilogy films:   How did a powerful white wizard like Saruman become enchanted/corrupted by Sauron What was Gollum doing before he was captured Where was Thranduil during the events of Lord of the Rings What happened to Tauriel during Lord of the Rings What happened to the remaining company of dwarves after The Hobbit Who now resides within Erebor What happened to Radagast during Lord of the Rings


Is it correct to sometimes capitalize words mid-sentence in computer user interfaces?

I've noticed that many sites and user interfaces tend to capitalize certain words or sentences like so:  Choose File  Select a File to Upload  Account Settings  How to Format   but in some other cases, they don't:  Please select a file to upload to our system  Browse the complete list of questions, or popular tags.   Help us answer unanswered questions.   And sometimes, particularly in list items, all in lowercase.  Are these good practices? What's a reasonable rule to decide when to capitalize or not, or even when to write all in lowercase?


The family of analytic functions with positive real part is normal

I'm having difficulty with the following exercise in Ahlfors' text, on page 227.     Prove that in any region $\Omega$ the family of analytic functions with positive real part is normal. Under what added condition is it locally bounded? Hint: Consider the functions $e^{-f}$.   Here is what I've tried:  I will start with a remark:  Apparently, Ahlfors wants us to show that the family is "normal in the classical sense". That is, every sequence of functions in the family has a subsequence which converges uniformly on compact subsets or tends uniformly to $\infty$ on compact subsets. In order to see why this is the right definition, consider the sequence $f_n(z)=n$. It is contained in the family but has no appropriate subsequence (in the sense of definition 2 in the text with $S=\mathbb C$).  Now, to the attempt itself:  Let $\Omega \subset \mathbb C$ be a fixed region, and consider the family $$\mathfrak F=\{f: \Omega \to \mathbb C | f \text{ is analytic and } \Re(f) >0 \}. $$ We would like to show that $\mathfrak F$ is normal in the classical sense. Following the hint, we examine the family $$ \mathfrak G=\{e^{-f}:f \in \mathfrak F \}.$$  $\mathfrak G$ is locally bounded (since $|e^{-f}|=e^{- \Re (f)}<1$ for every $f \in \mathfrak F$), thus it is normal with respect to $\mathbb C$ (theorem 15), and obviously, it is normal in the classical sense as well.  Let $\{ f_n \}$ be a sequence in $\mathfrak F$, and consider the sequence $\{ g_n \}=\{e^{-f_n} \}$ in $\mathfrak G$. According to normality it has a convergent subsequence $\{ g_{n_k} \}=\{e^{-f_{n_k}} \}$ which converges uniformly on compact subsets of $\Omega$ to some function $g$ (which is analytic by Weierstrass' theorem).  Since each $\{ g_{n_k} \}$ is nonvanishing, the limit function $g$ is either identically zero, or non vanishing as well (Hurwitz's theorem). In the former case it is easy to show that the subsequence $\{ f_{n_k} \}$, obtained by the same indices, tends to $\infty$ uniformly on compact sets. Hence, we will assume from now that $g(z) \neq 0$ for all $z \in \Omega$.  Up until now, I was trying to show that the subsequence $\{ f_{n_k} \}$ works in all cases, but sadly, this is not the case. Consider the sequence $f_n(z) \equiv 1+2 \pi i (-1)^n \in \mathfrak F$. In that case $g_n(z)=e^{-1}$, and an admissible subsequence is $g_{n_k}=g_k=e^{-1}$. However, $f_{n_k}=1+2 \pi i (-1)^k$ diverges everywhere.  Can anyone please help me finish this proof? Or maybe give me some hints?  Thanks!


I am new to distributed transaction thing, studying how two-phase commit works across a distributed transaction in micro-services architecture. As per my understanding, in the last part of the phase the transaction coordinator asks each node whether it is ready to commit. If everyone agreed, then it tells them to go ahead and commit.  But what prevents the following failure?  All nodes respond that they are ready to commit The transaction coordinator tells them to "go ahead and commit" but one of the nodes fails at commit (say due to some database constraint or connection timeout)  All other nodes commit successfully, but now the distributed transaction is corrupt  In short, what does it mean when the nodes say that they are ready to commit?  I am assuming each node is running a normal database that doesn't know anything about distributed transactions.


Prove that $\int_0^\infty e^{-x} \ln x d x = - \gamma $

I can see it is right by using some knowledge of the Gamma function. We have  $$ \Gamma(\alpha ) = \int_0^\infty e^{-x} x^{\alpha - 1 } dx  . $$  Differentiating with respect to $\alpha$, we get   $$ \frac{d\Gamma}{d \alpha} = \int_0^\infty e^{-x} x^{\alpha - 1 }\ln x dx  .  $$  Setting $\alpha = 1 $, we get   $$ \int_0^\infty e^{-x} \ln x dx = \frac{d\Gamma}{d\alpha }\bigg|_{\alpha = 1 }= - \gamma.   $$  But the knowledge $d \Gamma/d \alpha |_{\alpha = 1}=-\gamma$ is a mystery to me.   Can anyone find an elementary proof?


In Avengers: Endgame...     Black Widow kills herself on Vormir to obtain the Soul Stone.   The instructions from Red Skull to receive the Soul Stone are that you must sacrifice that which you love the most.   Hawkeye didn't sacrifice anything.   He actively tried to stop it...and failed. How is this death sufficient?  edit - It is not the same as  question since I am asking about getting the soul stone out of Vormir, specifically in how they did it in Endgame. Not transferring it once it's been removed from Vormir


Options for reducing transaction log size when disk space is restricted

I have a very unfortunate situation in which I have some SQL Server (standard edition) databases living on a small (~120gb) disk, and a transaction log which has grown to 50gb+. Unfortunately, the backup disk is only 45gb. The data itself is across all databases is only ~20gb.  I need to reduce the size of the transaction log to prevent the disk filling up, but I'm unable to back it up because it's too big, and I'm unable to get even temporary space from the server vendor. I've taken a full backup of the data and transferred that out to another machine,   What are my options for reducing the transaction log size?


Screen brightness keys not working (fn + f5/f6)

i'm using ASUS K501U with Ubuntu 14.04 LTS and Gnome-shell 3.10.4, The screen brightness works only from settings, i tried that, but it disabled all my fn keys:  In the terminal: sudo gedit /etc/default/grub Change GRUB_CMDLINE_LINUX_DEFAULT="quiet splash" to GRUB_CMDLINE_LINUX_DEFAULT="quiet splash acpi_osi=" Then, save the file. sudo update-grub Restart computer.   help me, please?


There seems to be a fair few questions and answers on SE sites with simple spelling or grammar mistakes in them, and as I am the sort of person who cares about such things, I used to spend the time going in and fixing these simple mistakes. Did, that is, until I realised how many of my edits were being rejected as being "insufficient edits".  It was shortly after that I noticed the Avoid trivial, tiny one-letter edits unless absolutely necessary. note. My bad :(  However, as this is still a passion for me, just now wondered why such a great(!) collection of sites doesn't yet have some softly, but actively, enforced automatic spelling and grammar checking/notification code, akin to (for example) Microsoft Word.  Could be something like / have handy additional features like:   A warning you have to click through if spelling / grammar mistakes are found in the post (Perhaps with a point penalty for mistakes, to encourage quality postings) Simple spelling errors are corrected ad-hoc The ability to set ones account to highlight the changes then approve sans input from the user after ¿5? seconds Ability to add words to a global dictionary, which would be vetted like edits are   What does the community think?  NOTE: British English used in the question, and errors are excepted :)


I know that the Imperial Space Marines are modified to be super human, but apart from violent death in battle do they age at all? Do they ever reach a point where their bodies are no longer fit for battle and they must set aside their battle armor?


Removing Line Breaks in Bibliography compiled with Biblatex

I have a strict page limit on a paper I'm writing, and the page limit includes citations, so to save space I would like to remove the line breaks between entries in my bibliography:  [1] Dr. Seuss. *Horton Hears a Who!* Random House, 1954. [2] J. Lennon. *In His Own Write*.  Macmillan & Scribner, 1964. [3] L. Carroll. *Alice's Adventures in Wonderland*. Macmillan, 1864.   instead of   [1] Dr. Seuss. *Horton Hears a Who!* Random House, 1954. [2] J. Lennon. *In His Own Write*.  Macmillan & Scribner, 1964. [3] L. Carroll. *Alice's Adventures in Wonderland*. Macmillan, 1864.   At the moment, the biblatex commands I'm using are  \usepackage[firstinits=true,backend=bibtex,doi=false,isbn=false,url=false]{biblatex} \AtEveryBibitem{%   \clearfield{pages}% } \renewcommand{\bibfont}{\normalfont\footnotesize} \addbibresource{bib.bib} \begin{document} \end{document}  \nocite{*} \begingroup \setlength\bibitemsep{0pt} \setlength\bibnamesep{0pt} \printbibliography[heading=none] \endgroup   which I think explains why I want to use Biblatex instead of the paralist solution I've seen (and that I could not get to work with Biblatex).  EDIT I: Here are two screen shots showing the spacing differences.  No line break:  With line break:   Edit II:  Solved with   \usepackage{setspace} ... \begin{spacing}{.5} \printbibliography \end{spacing}


How do one check with Php if a file is genuinely Editable

How do one check with php if a file is 'genuinely' editable i.e. the file is editable in any file editor. Ex : php, text, html or even .htaccess file. All these file is editable in notepad or any text editor.  I am using php 'is_writable' function. But it is also returning image file as writable file.


Best Way To Add Text Falling From The Sky In Order?

Ok So I have multiple pieces of text in the sky and they are falling down on a rigid body plane (the floor) and it's set to passive not active.  The problem is I don't want ALL of the text to hit the floor at the same time.  The 3D text is set as rigid too and it's set as active (so it falls).  The way I've gotten text to hit the floor at different times is by simply varying the heights of the text falling (text closer to the passive rigid plane will hit first).    I don't like this though.  I wish there was some way using keyframes etc. that I could change from passive to active so I could control exactly when the 3D text would start falling.    Is there any way to do that?  Thanks guys


What are all the items on the cover of the "Linux Administration Handbook"?

As I mentioned in  I'm fairly new to Linux and Unix.  @jasonwryan provided an excellent link to a blog that describes all of the items on the front of the first book, but is there an explanation available for all the items on the cover of the the "Linux Administration Handbook"? I didn't see any other entries on Lisa Hanley's blog.     Cloud Penguin Skiing VISTA Helicopter Tombstone Coffin Book Dead Cat Boy in a cube Monkey on a vine Tire Restrained Spider Cliff Spock Hand Doctor Tunnel


Is there a cardinal function such that the intersection of a family of open sets with the same cardinality has an open intersection?

I am working in some cardinal functions in topological spaces, and I need to either define a new cardinal function or use an existing one that behaves in the following way:  Lets say $\varphi$ is my desired cardinal function, and let $X$ be a topological space with $\varphi(X)=\kappa$ for some cardinal $\kappa$, I need that for every family of open sets $\mathcal{F}$ such that $|\mathcal{F}|\leq \kappa$ it holds that $$\bigcap_{U\in\mathcal{F}}U $$ is an open set.  I have been looking around and it seems like there is nothing that behaves this way, and yet I cannot come up with some cardinal function that makes this statement true; any help is appreciated, Thanks in advance.


Install Windows or Ubuntu first after clean wipe?

So some stuff happened and my hard drive was completely wiped out, I previously had a dual boot system between windows 10 and Ubuntu, I would like to do the same now. What I would like to know is which would be easier? Installing Ubuntu first and then Windows or vice versa? Also is it better to make partitions and install or install both of them together?


I marked  question as very low quality, but my flag was disputed. After reading the question again the phrase "I have got the answer here" might indicate that this is not a question at all. So I may have used the wrong flag. I think we can all agree that the question should be closed, but I don't want to flag again without making sure. Did I use the wrong flag? Does it even matter? For future reference this is the question in it's entirety:  Undefined symbols for architecture i386: "_SecCertificateCopyData", referenced from: -[AFURLConnectionOperation connection:willSendRequestForAuthenticationChallenge:] in AFURLConnectionOperation.o 跟着有八九个这样的错误，不知道缺什么？ I have got the answer here--> thanks @Martin R  EDIT: it's on hold now. I'm not sure if I was just too impatient, it was put on hold as a result of this post. Let me rephrase the question: I can't vote to close yet. Since I have absolutely no clue what the OP is looking for I could not edit the question and a comment feels pointless. Since I got the question as a review I felt obliged to do SOMETHING. What should I have done instead of flagging it as very low quality?


Why are we treating du/dx as a fraction?

When I was learning implicit differentiation in my class I was told to not think of $dy/dx$ as a fraction. Now I am doing integration by $u$-substitution and we treat $du/dx$ as a fraction and solve for $dx$. Why is this?


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


How to repair inaccesible external Hard disk

I was defragmenting my external hard drive which hardly had 3% free space. In the midway of defragmenting it, I stopped the process and tried ejecting the device but there was an error saying that the device is in use. But there was no window open using the drive. After 5-10 mins, I removed it from the USB slot without safely ejecting it as repeating the same error kept popping up. Upon reinserting the device the very next time, the files in it are inaccessible. What do I do other than data recovery and formatting to get the files back and access the hard disk drive. Is there any software that can repair the drive in a short time? Recovery is a very long, time-consuming process. Is at all recovery is the only option, which is the best data recovery software that can recover in the shortest possible time.


I read recently that if you hold a bullet in one hand and a pistol in the other, both hands at the same height, and subsequently fired the pistol at the same time as dropping the bullet, both bullets would hit the ground at the same time (assuming the fired bullet encounters no obstacles).  Is this true, and if so can you explain the reasoning behind it with as few equations as possible? I assume it is essentially that gravity is unaffected by momentum, but it just sounds counter-intuitive.


I've been gathering information about how addresses in different countries are written. While doing that I've also been working on a database design to hold this world wide information most probably used for making deliveries.  I started off with  data and came up with a first design (the higher table has the lower table as a child) :  Continent   Country     City       Address   With Currency (as a FK) and Language (with a many-to-many table) linked to the Country table. Also a many-to-many Capital table linking a Country and a City.  Soon I realized the US for example uses the state's code in their address. So an extra Province table was inserted between Country and City:  Continent   Country     Province       City         Address   Now I stumbled upon . This organization provides a list with all the cities in each country with some detailed information. This data fits pretty good with my 2nd design. I only renamed the Province table to SubDivision which is in the US the state, in Belgium the province and in France the department. This is very similar to the ISO 3166-2 codes.  Continent   Country     SubDevision       City         Address   To me, this looks like a good detailed database structure that won't need to be altered in the future. Like I said in the beginning, Currency is a FK in the Country table easy editable or removable. Language has a many-to-many relationship with Country and is also easy editable or removable. My biggest concern is that ISO also has more than 1 subdivision level fear certain countries. For Belgium for example there they have the provinces (provided in the UNLOCODE code list), but ISO () also has 3 regions that are higher than the provinces in Belgium and are pretty much in-between the Country and the Province.   Should additional (optional) tables be added? How this would be implemented is a question to me though. Another database design I can think off is all loose tables, no FK's, and 1 table linking all required tables together with following columns: AddressID, CityID, SubDiv1ID, SubDiv2ID, ... , CountryID, ContinentID. Not sure if this is a good approach. Add a different table per Country based on their amount of SubDivisions. This means Continent and Country and Address stay unchanged. City will be Country specific with the US for example having a USState (SubDiv 1) -> City and Belgium BERegion (SubDiv 1) -> BEProvince (SubDiv 2) -> City. I did a little more searching and found  answer.       Consider creating lookup tables for city, state and country entities. The city/state/country columns of the address table then consist of FKs pointing to these lookup tables. This allows you to guarantee consistent spellings across all addresses and gives you a place to store additional metadata (e.g., city population) if needed in the future.


How to setup Kiosk type functionality in Linux mint cinnamon?

I'm using Linux Mint Cinnamon. I want to setup the computer to act as a kiosk, where the user can only really interact with Firefox in full screen mode.  What is the easiest way to lock the machine down? Does dconf or gconf work with Cinnamon? Should I just ditch Cinnamon for xfce, or some other WM with built in kiosk mode?


I have a problem understanding the definition of the surface area integral of a revolution . I know that we can obtain its volume using the disc method . The method defines the width of the disc as infinitely small (dx) , it is then pretty obvious that the integral is defined as the area made by each point multiplied by the width , which is dx .I found however by the definition of the surface area integral that the width is not defined as dx . Can somebody please clarify why it doesn't work the same way with surface areas ? !  thanks


Force cloned hard-disk image upon a smaller hard-disk

I have a image which was taken with Clonezilla as SAVEDISK on a 160GB harddrive. Now a newer version of the PC released with a 120GB harddrive, the space in use is just 20GB  Is there a way I can force Clonezilla (or any other program) to manipulate the images 'original size' to 120GB or lower, so Clonezilla can write it to the new PC?


Exception in main "java.util.ConcurrentModificationException"

As usual Arrays and their lists will be the death of me, only this time the lab is working just fine up until the End and then i get a strong error, and me being a java newbie have know idea what this is. hopefully some of you better programmers will be able to help me.  Error + current output.   word with 2 vowels = 5 word with 3 vowels = 0 word with 4 vowels = 1 word with 2 chars = 0 word with 3 chars = 3 word with 4 chars = 2 word with 5 chars = 2 Exception in thread "main" java.util.ConcurrentModificationException at java.util.ArrayList$Itr.checkForComodification(ArrayList.java:901) at java.util.ArrayList$Itr.next(ArrayList.java:851) at Words.removeWordsWithXChars(Words.java:54) at Lab16c.main(Lab16c.java:25)   output i want  [one, two, three, four, five, six, seven, alligator] word with 2 vowels = 5 word with 3 vowels = 0 word with 4 vowels = 1 word with 2 chars = 0 word with 3 chars = 3 word with 4 chars = 2 word with 5 chars = 2  after removing words with 3 chars  [three, four, five, seven, alligator]  number of vowels in the words removed == 4   code in main  public class Lab16c { public static void main( String args[] ) {     Words test = new Words("one two three four five six seven alligator");     out.println(test);     out.println("word with 2 vowels = "+test.countWordsWithXVowels(2));     out.println("word with 3 vowels = "+test.countWordsWithXVowels(3));     out.println("word with 4 vowels = "+test.countWordsWithXVowels(4));     out.println("word with 2 chars = "+test.countWordsWithXChars(2));     out.println("word with 3 chars = "+test.countWordsWithXChars(3));            out.println("word with 4 chars = "+test.countWordsWithXChars(4));     out.println("word with 5 chars = "+test.countWordsWithXChars(5));     int vowelsRemoved = test.removeWordsWithXChars(3);     out.println("\nafter removing words with 3 chars \n" + test);     out.println("\nnumber of vowels in the words removed == " + vowelsRemoved);     out.println("\n\n");               //more test cases  } }   code in third class     public int countWordsWithXChars(int size)     {         int count=0;         for(Word i : words)         {             if(i.getLength() == size)             {                 count++;             }         }         return count;     }  //this method will remove all words with a specified size / length //this method will also return the sum of the vowels in all words removed public int removeWordsWithXChars(int size) {     for(Word i : words)     {         if(i.getLength() == size)         {             words.remove(i);         }     }     return 0; }  public int countWordsWithXVowels(int numVowels) {     int count=0;     for(Word i: words)     {         if(i.getNumVowels() == numVowels)         {             count++;         }     }     return count; } public String toString() {    return ""; } }   hopefully you can find my problem , thanks in the future


How to write permutations as product of disjoint cycles and transpositions

$$\sigma=\begin{pmatrix} 1 & 2 &3 & 4& 5& 6&7 &8 &9 &10 & 11 \\ 4&2&9&10&6&5&11&7&8&1&3    \end{pmatrix}$$  (1) I am asked to write this permutation in $S_{11}$ as a product of disjoint cycles and also as a product of transpositions.   (2) Also find the order of the element. Is this permutation even or odd?  I think these are the disjoint cycles  $E_{1}=(1,4,10)$, $\;\operatorname{order}E_1 =3$  $E_{2}= (3,9,8,7,11),\;$ $\operatorname{order}E_{2} =5$  $E_{3}=(5,6),\;$ $\operatorname{order}E_{3} =2$  $S_{11}$=  $E_{1} \cdot E_{2}\cdot  E_{3}$  The order of $\operatorname{order}E_{3}$ is even so the order of the permutation is even. Why are they asking this? And what is the significance of it being even or odd?  Transpositions – I have read this a couple times but the one example in my textbook is rather unclear, I am not sure what this means?  I think the transposition for $E_{1}$ is $(1,4)(1,10)$ but I'm not sure what this means.


Why the community of two subspace is not necessarily a whole space of the set R?

If W1 and W2 are the subspace of W, prove that (a): The Intersection of W1 and W2 is a subspace of W (b): The community of W1 and W2 may not necessarily be subspace W


Imported image as plane does not have accurate colors

I am trying to make a music video and import my logo (.png), however the logo does not have accurate colors (it has clear white background, but blender shows it as gray):   These are my material settings, I hope I have started correctly:   The circle I created behind it is also a bit grayish, so there must be something basic I'm missing.   Switching the mode does not solve the color problem, as mentioned in the comments the background of my logo is still gray afterwards.  Solved: I needed to add/move the light on top (to face the planes) and re-insert the image in order to reset to default settings. Result:


How to horizontally align underbraces in LaTeX?

Like in the question, how can I align underbraces in LaTeX? For example, the code \begin{align*} {\underbrace{Y \cdot \dfrac{\sum_{i=1}^t x_i}{D}}_{\text{abc} } } + {\underbrace{\sum_{j=t+1}^n K_j }_{\text{abc } } } \end{align*}  unfortunately yields an output where the text under the corresponding equations doesn't align.


Problems getting my bibliography working - "empty bibliography!

This has been stressing me out for a couple of hours now. I'm using MiKTeX 2.9 with Texmaker as the editor. I've been trying to use a .bib file as an external bibliography, which I've typed up in a text document. Every guide I've seen has said that I've needed to "run" bibtex, and they talk as if bibtex is a program, but I can't for the life of me find bibtex as a piece of software anywhere on the internet.   Here are the important parts of my main file:  \documentclass[11pt,a4paper]{article} \usepackage{graphicx} \usepackage[utf8]{inputenc} \usepackage[english]{babel} \usepackage{comment} \usepackage{amsmath} \usepackage[ backend=bibtex, style=alphabetic, sorting=ynt ]{biblatex} \usepackage{float}  \bibliography{biblio} \addbibresource{biblio.bib}  \begin{document}  Document text here.  \printbibliography   \end{document}   And here is my bibliography:   It gives me a fair few warnings.   1: 'babel/polyglossia' detected but 'csquotes' missing.  1: 'Data encoding is 'utf8' 131: 'Citation 'EPS' on page 6 undefined (defined in the .bib file 134: 'Empty bibliography' This is the big one. Bibliography clearly not empty! 1: 'There were undefined references' 1: 'Please (re)run BibTeX on one file(s): (biblatex)diss (biblatex) and rerun latex afterwards'   I don't understand how I can "run" biblatex? Isn't biblatex the language?   What am I doing wrong?


please tell me any type of Stock Exchange application available into linux like some other os window 7 available software like Odin Diet


Note: The legacy Skype for Linux application (v4.*) is now discontinued and was removed from Canonical’s partner repositories, so this question and its answers are obsolete. Please refer to  of our .  Skype 4.3 is just released with considerable improvements. As a regular Skype user I want to use the latest Skype on my Ubuntu 14.04, but there is no updates from Update Manager. Even in Skype website only Skype 4.3 is available only for Ubuntu 12.04. Is there anyway to use this latest Skype on Ubuntu 14.04 or how much we have to wait for the update?


How to see current memory usage in JVM during a loop?

I am running a loop in Jython and have a loop of 100K elements which fills up dictionary slowly and eventually crash the app with error:  java.lang.OutOfMemoryError: GC overhead limit exceeded   I can track how many elements were processed with a print out to terminal of a current index every 10K elements.  How to print current memory when running app in Jython ?   Want to create output similar to this:  10k - 50MB used so far.   20k - 100MB used so far.  30k - 150MB used so far.  ...   Thanks.


Proof of the duality of the dominance order on partitions

Could anyone provide me with a nice proof that the  $\leq$ on partitions of an integer $n$ satisfies the following: if $\lambda, \tau$ are 2 partitions of $n$, then $\lambda \leq \tau \Longleftrightarrow \tau ' \leq \lambda '$, where $\lambda'$ is the conjugate partition of $\lambda$ (i.e. the transpose of the set of 'dots' which $\lambda$ represents).   I feel like there must be a nice clever and concise/intuitive proof of this, but all I can come up with is an ugly brute force approach based on the definition of sums of the components $\lambda_i$. Could anyone suggest a particularly nice way to obtain this result? Many thanks.


What are the eigenvalues of $\operatorname{ad}x$?

Let $x\in \operatorname{gl}(n,F)$ have $n$ distinct eigenvalues $a_1,\ldots,a_n$ in $F$. Prove that the eigenvalues of $\text{ad }x$ are precisely the $n^2$ scalars $a_i-a_j$ ($1\leq i,j\leq n$), which of course need not be distinct.   So we can represent $x$ by an $n\times n$ matrix $X$. We have $Xv_1=a_1v_1,\ldots, Xv_n=a_nv_n$ for eigenvectors $v_1,\ldots,v_n$.   Now, $\operatorname{ad}x$ takes $y\in \operatorname{gl}(n,F)$ to $xy-yx$. I need to show that some $y$ is taken to a scalar multiple of itself, where that scalar is $a_i-a_j$. What could be that $y$?


Number of irreducible cubics over a field of $n$ elements.

This question originates from Pinter's Abstract Algebra, Chapter 25 Exercise C4.     How many irreducible cubics are there over a field of $n$ elements?    Total number of monic cubics $x^3 + ax + bx + c$: $n^3$. For monic reducible cubics in the form of $(x+a)(x+b)(x+c)$, either all, only two, or none of $a, b, c$ are the same. Therefore the total number of such cases is $\displaystyle {n\choose 1} + 2{n\choose 2} + {n\choose 3}$. Per , the number of monic irreducible quadratics is $n(n-1)/2$. This suggests for monic reducible cubics in the form of $(x^2+ax+b)(x+c)$ where $x^2+ax+b$ is irreducible, there are $n^2(n-1)/2$ cases.   Hence, the total number of  Monic reducible cubics:  $\displaystyle\quad R = {n\choose 1} + 2{n\choose 2} + {n\choose 3} + \frac{n^2(n-1)}{2}$  Monic irreducible cubics:  $\displaystyle\quad n^3 - R$  Irreducible cubics:  $\displaystyle\quad(n-1)\left(n^3 - R\right)$.  Correct?


Hide some fields in the NewForm.aspx for a custom list

I have 5 columns in the custom list. Out of which only 3 have to displayed in the NewForm.aspx page.  All of the 5 columns have to be displayed on the EditForm.aspx page. While googling, I have come across the following  :  When I implemented the code that was given on this page, I get an error which says that parentNode is not found. Please guide me how can I implement this requirement.  Any other alternatives other than this are also appreciated.


Prove that direct sum of torsion module is torsion

Suppose that $R$ is a ring and $M$ and $N$ are $R$-module. Prove that   a) If $R$ is integral domain, then $Tor(M \bigoplus N) \cong Tor(M) \bigoplus Tor(N)$  b) If $P$ is a submodule of $M$ and $Q$ is a submodule of $N$, then $M \bigoplus N /P \bigoplus Q \cong M/P \bigoplus N/Q$.  For the first part, I kind of confused of the direct sum. The direct sum here means external direct sum or internal direct sum?   For the second part, I define a map $f: M \bigoplus N \rightarrow M/P \bigoplus N/Q$ where $(m,n) \rightarrow (m+P,n+Q)$  Then I manage to show the map is bijective module homomorphism. Just want to confirm with the surjectivity, is it trivial in this case? Like I have $(m+P,n+Q)$, then its preimage is $(m,n)$ right?  EDIT: Part a): Let $(m,n) \in Tor(M) \bigoplus Tor(N)$. Then there exists $q,s \in R$, where $q,s \neq 0$ such that $(qm,sn)=(0,0)$ Note that since $R$ is integral domain and $q,s \neq 0 \Rightarrow qs \neq 0$. Hence, $qs(m,n)=(qsm,qsn)=(s(qm),q(sn))=(0,0)$, which implies that $(m,n) \in Tor(M \bigoplus N)$  Let $(m,n) \in Tor(M \bigoplus N)$. Then there exists $r \in R,r \neq 0$ such that $r(m,n)=(0,0)=(rm,rn) \Rightarrow rm=0,rn=0 \Rightarrow (m,n) \in Tor(M) \bigoplus Tor(N)$. Hence, $Tor(M \bigoplus N)=Tor(M) \bigoplus Tor(N)$


What does "Object obj: ArrayList" do in java?

I have been looking at a friends java code and this came up. But im not sure what it is. Can anyone help quickly. The code is like this: for(Customers cust: customerArrayList) { //  ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^-- fragment which I don't understand


Plural and singular items in the same list

Which is correct? The list contains a plural item, but it also contains singular items. So would I use "are" in this sentence?   "An applicant with an undergraduate degree in business is supposed to qualify for the one-year program if their grades, resume, and GMAT score are good enough." "An applicant with an undergraduate degree in business is supposed to qualify for the one-year program if their grades, resume, and GMAT score is good enough."


How do I change the locale that JasperReports uses?

The windows installed on my machine has the locale en_AU and that's what JasperReports uses. I already tried changing the locale of all users, including the Administrator but it still uses en_AU.  How can I change that locale? Is it possible to change the REPORT_LOCALE parameter on my report?


I want to close a div when clicking on the body but omit the parent div using .not( ) or a similar simple function

I have a search suggestion box that appears when a user types in the search box. I want to close that box when the user clicks outside of the parent div. I tried this method below using .not() to omit the parents div but it did not omit it and still closes it when clicked on the parent div.  I have looked at solutions using event propagation but those have their own perils so I'd really like to use a simple function like .not() to accomplish this.  JS  // close search suggestions     $("body").not('#searchbox').mousedown(function() {         $('.search-suggestions').fadeOut();     });   HTML

     <form class="form-inline clearfix">
         <input type="text" class="form-control" id="search-input" placeholder="Search">
       <button type="submit" class="btn btn-default pull-right"></button>     </form>

Browse:

result in New Homes

result in Renovation

result in Interior Living


Cancel out the effect of # hash symbol in text formatting creating headings

I don't understand how to properly format this particular thing (in block characters)    Just to fool around with script making, I made one that (I believe?) should open a terminal at startup:    #!/bin/bash   #start terminal at startup   #/usr/bin/gnome-terminal    The bit with the # (hash, pound or octothorpe symbol) causes the three lines to conform to one line, after I indented properly for block characters.  Without indents, I get this:    !/bin/bash  start terminal at startup  /usr/bin/gnome-terminal    How would I use block characters in the presence of the hash or pound sign?


a collegue and me started a discussion on a method that does a lookup for a String and returns an enum value.  We ended with two versions:  public Value lookup(String s) throws IllegalArgumentException {     if ("johndoe".equals(s)) { return Value.JOHNDOE; }     throw new IllegalArgumentException("No value found for lookup on "+s); }   vs  public Value lookup(String s) {     if ("johndoe".equals(s)) { return Value.JOHNDOE; }     return null; }   Which one is the better way of doing it?  The first one says: do not feed me with something I do not know about. If you do so, will exceptionally answer your request! The other one says: I'll try to look up your request. If I cannot serve I will simply give you a void answer.  For me, a void answer is something the caller must deal with. Like looking up some information in a dictionairy. If the entry does not exist it will not burn my eyes for having had tried to look something up. It just simply tells me 'emotionless' the lookup result: nothing.    For the collegue, he claims 'do only things which are capable of being done' - otherwise it will strongly, misunderstandle-free tell you that you should not have done that.  I can somewhat understand my collugues point. Since Exceptions are someone to prevent from the outside I would have to precheck the situation before calling - that would make no sense here since the lookup just needs to do that. On the other hand calling the look up would give the need in more complex code by wrapping the lookup call in a try-catch-statement. On my version I would have to check on a null value to properly work on. Using try-catch to wrap the method call looks more irritating to me.  When writing this I see that I do write very prejudiced. Would someone enlight me on seeing things different or proving what I claim in other words. ...what I also observed during wrinting this question is that I am more convinced on my option. Is there literature about this issue somewhere? - like the clean code book?


How to link a device in COC if the old device was lost?

I'm stuck with this problem.. I've been playing CoC for more than a half year and now I lost my old phone. It was an android. Now I got a new phone, which is iOS and I cannot link a device.   Is it possible somehow to recover my old account?  Thank you for any help!


What were the midi-chlorian counts for the main characters in the films?

So in Episode 1 they reveal that force sensitivity can be measured scientifically by counting midi-chlorian in your cells. Does anyone know the midi-chlorian counts of any of the main characters? The amount of detail in back stories in Star Wars is often so in depth that I wouldn't be surprised if the data were available somewhere.


Prove: $n\in\mathbb{N}$ is not divisible by $2^n-1$ if $n>1$  Using induction:  For $n=2\Rightarrow 2$ is not divisible by $3$  For $n=k\Rightarrow k$ is not divisible by $2^k-1$  For $n=k+1\Rightarrow k+1$ is not divisible by $2^{k+1}-1$  How to prove this by induction?


Regarding the usage of " do  " and " does " :   "I" is a first person "you" and "we" are second person. "they" is third person.   Then why following "they" we have to use the form "does"?  Eg. instead of "They do not come."  rather than we say " They does not come"   why?


How can I delete all function from my database using sql-script.  I tried:  declare @nm varchar(100) select @nm = name from sysobjects where type = 'FN' exec('drop function ' + @nm)   And I put in into the loop but it not delete all function. Please help


How can I show this implication for $\frac x{xy+x+1} + \frac y{yz+y+1} +\frac z{zx+z+1} = 1$?

$$(xy+x\ne -1 \land yz+y\ne-1 \land zx+z\ne -1 \land xyz=1)\\ \implies \frac x{xy+x+1} + \frac y{yz+y+1} +\frac z{zx+z+1} = 1$$ I tried finding each variables value using $xyz=1$ $(ex.x=1/yz)$ , and then replacing them but didnt really get anything. Then i tried writing the $1$s as $xyz$ and i could simplify some of them but still nothing. Thank you in advance


Hand wave/new contributor icon seems to follow the post, not the author

This user (who has never upvoted or accepted an answer) has four posts, two with the new-user icon and two without:  Question 1 (2018-08-15), no icon:    Question 2 (2018-08-20) icon:   Question 3 (2018-08-21) icon:   Question 4 (2018-08-24) no icon:   Is this expected?


I have two monitors on my desk, they are both the same resolution and screen size, but they are from different manufacturers - one is LG, the other is Dell. Using their default settings, the two render things quite differently, i.e. the same content looks much different when moved from one monitor to the other. Is there a quick way to get the two to render things somewhat closely. I understand that you cannot make two different monitors look like each other, but I expect that you can get close, at least the same amount of brightness, contrast, hues, etc. Is painfull trial and error tweaking the brightness, contrast settings on both my only option?  Is there perhaps a utility that knows the display characteristics of various monitors, and can suggest me display settings based on that knowledge?


how to change default editor for latex when compiling in the bash?

When you compile a latex file in bash (e.g., via a makefile), if latex encounters an error it stops for you to enter a command, for example R to continue running or Q to run quietly. Entering E calls the editor to fix the error, which is vim by default. How can I change this default to emacs?  From a previous post:  export TEXEDIT="emacs +%d %s"


Mounting error trying to access the drives in Ubuntu 15.04

While trying to mount the drive I get the error below and the drive is not mounted.  Error mounting /dev/sda3 at /media/ubuntu/B840AE6C40AE30D4:  Command-line `mount -t "ntfs" -o "uhelper=udisks2,nodev,nosuid,uid=1000,gid=1000" "/dev/sda3" "/media/sukhen/B840AE6C40AE30D4"' exited with non-zero exit status 14: The disk contains an unclean file system (0, 0).  Metadata kept in Windows cache, refused to mount.  Failed to mount '/dev/sda3': Operation not permitted  The NTFS partition is in an unsafe state.  Please resume and shutdown Windows fully (no hibernation or fast restarting), or mount the volume read-only with the 'ro' mount option.   How can this be fixed?


null pointer exception for onclicklistener event

I'm getting a runtime exception in my code that says :                                                                             java.lang.RuntimeException: Unable to start activity ComponentInfo{com.example.abiel.contacts/com.example.abiel.contacts.Data}: android.view.InflateException: Binary XML file line #0: Binary XML file line #0: Error inflating class android.support.relative.RelativeLayout  Here's my layout file:  <?xml version="1.0" encoding="utf-8"?> <android.support.relative.RelativeLayout xmlns:android="http://schemas.android.com/apk/res/android"     android:layout_width="match_parent" android:layout_height="match_parent">         <ImageView             android:layout_width="200dp"             android:layout_height="200dp"             android:id="@+id/ContactImage"             android:layout_gravity="center_vertical"             android:layout_alignParentTop="true"              />          <EditText             android:layout_width="294dp"             android:layout_height="wrap_content"             android:id="@+id/editName"             android:inputType="text"             android:textSize="24sp"             android:hint="Please write your name"             android:textColorHint="#ff84eb"             android:layout_centerVertical="true"             />          <EditText             android:layout_width="296dp"             android:layout_height="wrap_content"             android:id="@+id/editNumber"             android:inputType="number"             android:textSize="24sp"             android:hint="Enetr your number"             android:textColorHint="#ff9cda"             android:layout_above="@+id/editEmail"             />          <EditText             android:layout_width="297dp"             android:layout_height="wrap_content"             android:id="@+id/editEmail"             android:inputType="textEmailAddress"             android:textSize="24sp"             android:hint="Please write your E-mail"             android:textColorHint="#ff96ea"             android:layout_above="@+id/save"             />          <Button             android:layout_width="171dp"             android:layout_height="wrap_content"             android:id="@+id/save"             android:text="Save"             android:layout_gravity="center_horizontal"             android:layout_alignParentBottom="true"             android:layout_centerHorizontal="true"             android:layout_marginBottom="86dp"             android:background="#000000"             android:textColor="#ff0009"             android:textStyle="bold"/>  </android.support.relative.RelativeLayout>


Let $A$ be an $m × n$ matrix. Recall that Gordan’s lemma states that the system $$\{d : Ad < 0\}$$  is inconsistent if and only if the system $$λ ≥ 0 ∈ R ^m , λ \not= 0, A ^T λ = 0$$ is consistent.     Show that the consistency of the second system is equivalent to the statement that $0 ∈ C$ Use a separation argument to prove that $\{d : Ad < 0\} = ∅$ if and only if $ 0 \notin C$, thereby proving Gordan’s lemma  Proof so far   $\Rightarrow$ Let $C$ be the convex hull of the rows of $A$, that is, $C = co(a_1 , . . . , a_m ) ⊆ E$,where $a_i$ is the ith row of $A$. Suppose the second system is consistent. We want to show that $0 \in C$. If $A^{T}=[a_1,a_2,...,a_m]$. Then $A^{T}\lambda=\sum_{i=1}^{m}a_i\lambda_i=0$. Therefore $0 \in C$


Why is it true that $|AB:A|=|B:A\cap B|$ even if $A$ is not normal in $AB$? (Second Isomorphism Theorem)

I just read about the First and Second Isomorphism Theorems in the book Abstract Algebra by Dummit and Foote. After proving the Second Isomorphism Theorem, they said:        Proposition 13 isn't really important for my question (I guess) but anyway it is the one that states that if $H$ and $K$ are two finite subgroups of $G$ then $|HK|=\dfrac{|H||K|}{|H\cap K|}$.  I didn't understand why $|AB:A|=|B:A\cap B|$. It is obvious if $AB$ is finite because using the Second Isomorphism theorem we have $|AB:B|=|A:A\cap B|$ because $AB/ B \cong A/ A\cap B$. Then $$ |AB:B|=\dfrac{|AB|}{|B|}\quad\textsf{and}\quad|A:A\cap B|=\dfrac{|A|}{|A\cap B|}\\[0.3in] \implies\dfrac{|AB|}{|B|}=\dfrac{|A|}{|A\cap B|}\\[0.3in] \implies\dfrac{|AB|}{|A|}=\dfrac{|B|}{|A\cap B|} $$ which proves that $|AB:A|=|B:A\cap B|$, but this doesn't prove it if $A$ or $B$ is infinite and I believe there's a simple general proof that under the asssumptions in Theorem 18 we get $|AB:A|=|B:A\cap B|$. Could anyone please help me? If the proof is easy (and I guess so because they stated the relation in the book like if it was obvious) then could you give me hints?  Thank you in advance!


Zombie comments (aka wrong comments count when destroying a spammer who posted comments)

I noticed  (10k only) that there is "show 2 more comments":        Clicking it has no effect.  Viewing the raw server response, it simply returns the existing comments.  This is most likely the result of , which somehow fails to update the comments count on the spammer's posts, in case they wrote comments. (And yes, I am sure those two comments have been written by that user, as I've seen them before the account was deleted.)  Can this please be fixed?  Not sure if it matters, but as can be seen in the screenshot, the question was deleted before the account has been destroyed.


Will Google penalize news website for duplicate content when it links to original stories along with the full text?

My website is similar to news.google.com. news.goole.com link's to original source, and shows some of the content from the target page. My website copies the content of the original source and shows  users the copied content with a link to original source.  My question is will Google penalize my website as duplicate content? For SEO, what way is better: link to original source or show copied content to user?  My website language is Persian (Farsi), ca Google detect duplicate content in Persian language?


Editing a starred post in chat breaks display for user who starred it

Steps to reproduce:   User A posts a message User B stars it, the star next to the post appears yellow User A edits the post The display of the star in User B's view becomes black, as if they haven't starred it   This is the worst bug ever in the history of StackExchange and makes the entire network completely unusable for me. I'm going to Yahoo! Answers until this is fixed.


My ESTA application was denied, can I go to the US by land instead?

I'm German citizen, planned to visit my gf in US and my ESTA wasn't authorized. I think I did stupid mistake while applying, didn't check properly my answers, contacted ESTA authorities to fix mistake but was told to apply for a visa anyway and not to try to re-apply for ESTA. So I had to cancel my travel plans, because visa takes several weeks for ESTA denied people, so embassy told me. So at that time my gf visited me in Germany as it was easier.  Now I'm in Canada (Montreal) for business and my gf is in New York. I still want to visit her in US and meet her family for 3-5 days. I want to travel by bus.   I know that by law if I cross by land, EU citizen doesn't need ESTA nor visa. That's the rule. But I have ESTA denied in my record if I login, and I don't know if I can still go to US by land? Do they verify your ESTA status at canadian border and is it legal to go to US in my case?


Best way to determine if two path reference to same file in Windows?

How would I compare 2 strings to determine if they refer to the same path in Win32 using C/C++?  While this will handle a lot of cases it misses some things:  _tcsicmp(szPath1, szPath2) == 0   For example:    forward slashes / backslashes relative / absolute paths.   [Edit] Title changed to match an existing C# question.


I got those strange shadow artifacts when rendering with Eevee. Does anyone knows what might cause it ?    Thanks


Intuitive explanation for inconsistency between regression and correlation coefficient sign

An independent variable in a linear regression I am working on has positive coefficient but this variable has a negative correlation with the dependent variable. I know that this is mathematically possible given each variables' coefficient in a multiple regression is a results of complex interaction between the relationship of the variable of interest with the other independent variables as well as the dependent variable. But is there any intuitive way I can explain this phenomenon to my business stakeholders without going into the math, maybe using a real life example? Thanks


Why does my program has an error in the render method?

So I'm trying to build my first game loop and yes, I've watched a tutorial on this but can't seem to find what's wrong.   Every time I run my program, the image doesn't show on frame and also, it keeps telling me errors in the render method and where I called the draw method in my Ship class. Please help.  (This is my first game project)   This is the Game class which is my main class  package main;  import java.awt.Canvas; import java.awt.Color; import java.awt.Dimension; import java.awt.Graphics; import java.awt.image.BufferStrategy; import java.awt.image.BufferedImage; import javax.swing.JFrame;  public class Game extends Canvas implements Runnable{  public static final int WIDTH = 600; public static final int HEIGHT = 800;  private boolean running = false; private Thread thread;  private BufferedImage image = new BufferedImage(WIDTH, HEIGHT, BufferedImage.TYPE_INT_RGB);   Ship ship;  public void init() {     ship = new Ship(0, 500);  }    private synchronized void start() {     if (running) {         return;     }      running = true;     thread = new Thread(this);     thread.start();   }    private synchronized void stop() {     if(!running) {         return;     }      running = false;     try {         thread.join();     } catch (InterruptedException e) {}      System.exit(1); }    // Game loop public void run() {      long lastTime = System.nanoTime();     final double amountOfTicks = 60.0;     double ns = 1000000000 / amountOfTicks;     double delta = 0;      int updates = 0;     int frames = 0;     long timer = System.currentTimeMillis();   while (running) {         long now = System.nanoTime();         delta += (now - lastTime) / ns;         lastTime = now;            if(delta >= 1) {             tick();             updates++;             delta--;         }          //This render method right here tells me it has an error everytime I run the program         render();          frames++;          if (System.currentTimeMillis() - timer > 1000) {             timer += 1000;              System.out.println("Ticks: "+updates+", Fps: "+frames);             updates = 0;             frames = 0;         }      }     stop(); }  // where everything updates  private void tick() {     ship.tick();  }  // where everything renders/draws private void render() {      BufferStrategy bs = this.getBufferStrategy();      if(bs == null) {         createBufferStrategy(3);         return;      }      Graphics g = bs.getDrawGraphics();     //////////////////////////////////////////////////      g.setColor(Color.blue);     g.fillRect(0, 0, getWidth(), getHeight());      // This has an error too whenever I run the program     ship.draw(g);            ////////////////////////////////////////////////     g.dispose();     bs.show();    }    public static void main(String[] args) {      Game game = new Game();      game.setPreferredSize(new Dimension(WIDTH, HEIGHT));     game.setMaximumSize(new Dimension(WIDTH, HEIGHT));     game.setMinimumSize(new Dimension(WIDTH, HEIGHT));      JFrame frame = new JFrame();       frame.add(game);     frame.pack();     frame.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE);     frame.setResizable(false);     frame.setLocationRelativeTo(null);     frame.setVisible(true);     game.start();  }      }   This is the Ship Class  package main;  import java.awt.Graphics; import java.awt.Image; import java.awt.Toolkit;    public class Ship {  private int shipX; private int shipY;  Image character = Toolkit.getDefaultToolkit().createImage("D:\\user's-ship-fast-speed.gif");   public Ship(int x, int y) {     shipX = x;     shipY = y; }   public void tick() {  }  public void draw(Graphics g) {     g.drawImage(character, shipX, shipY, null); } }


Some videos (seems random) exported from Premiere can't be Airdropped to iPhone

Editing videos in Premiere, sometimes a certain video fails to Airdrop to an iPhone. I examined the Get Info window of each video that worked and of the one that didn't. Same approximate size, same file type, same codex etc. Looked at the settings in Premiere seem similar. Anyone know how to solve this? Found this  and tried a bunch of the suggestions. Tried converting it to .mov in Quicktime failed. Tried saving it as 4k in Quicktime failed. Tried importing it to Photos (works) then Airdropping it. Failed. Tried trimming it in Quicktime. Failed. Tried uploading it to Dropbox then downloading it to Photos on the iPhone. Failed.


How to install new software on Ubuntu 12.04 LTS?

I am a new user of Ubuntu. What command can I use to install something using the terminal?


The following code is supposed to divide a sum of money (e.g. : 325.200) into cards of 50, 10, 5 and 1. The rest (the decimal part being shown separately).  program Cards; uses wincrt;  var    d50, d10, d5, d1, dm: integer;    s: real; begin    readln(s);    d50 := trunc(s) div 50;    d10 := trunc(s) mod 50 div 10;    d5 := trunc(s) mod 10 div 5;    d1 := trunc(s) mod 5;    dm := trunc((frac(s) * 1000));    writeln('50: ', d50, ' 10: ', d10, ' 5: ', d5, ' 1: ', d1, ' m: ', dm); end.   A problem arises with the sum 356.200. The shown dm is 199 instead of 200.


The use of indefinite article with initials

Can you explain why we say AN NHS provision but A National Health provision. Or A UFO but An UNIDENTIFIED Fly Object. Are there any rules regarding the use of A or An when using initials such as ! In business FME ? Thanks


How can I display this polygon in Google Maps, properly

NOTE: this question is sorta like a follow-on question to  I asked. In that question, the main suggestion was that I was trying to show two polys. Now, I'm asking about a SINGLE poly.  I have the following GEOGRPAHY of Los Angeles in my Sql Server 2008 :-     (or in )  It's bascially ..  -- Shape of Los Angeles.  DECLARE @WKT VARCHAR(MAX) = 'POLYGON ((-118.66815700000011 34.181235000000029, ... )) SELECT GEOGRAPHY::STGeomFromText(@WKT, 4326)   Now when I just try and render this out, It now looks like this (NOTE: this is different, but still not correct .. compared to my previous GIS Question).    Now, in the previous question people were suggesting that the previous data was a MULTIPOLYGON so there was some bad stuff I must have been doing, trying to render out holes in polys.  This time, this is a single polygon. So i'm assuming the hole theory still doesn't work. Now, I understand that by looking at this image, there's a number of holes ... but the Well Known Text data which Sql Server gives me is a POLYGON which to me means .. one single shape. So i'm not sure how I can fix this :(  This is why i'm asking the a similar question to my previous one.  Can anyone help? Can they see the data I've posted and see what happens in other systems? (I don't have any other software besides Sql Server 2008).  Maybe I need to extract all my data from Sql Server 2008 .. and clean it up (whatever that means) through another system. For example. If Sql Server is saying that the shape of Los Angeles is a single Polygon .. but when cleaned up .. it's actually 7 Polygons .. and then those shapes then get rendered correctly .. then we have a solution!   Any suggestions?  Can -anyone- render this shape onto a Google map?


Why different line endings - Unix vs Windows

Just out of curiousity.. Why are the line endings different for Windows and Unix.  I was looking around for the answer but not found.


\bigints package is not working fine together with \lmodern

I'm trying to get big integral symbol, so I tried with '\bigints' but I've found that \documentclass{article}  \usepackage{lmodern} \usepackage{bigints}      \newcommand*\norm[1]{\left\lVert#1\right\rVert}  \begin{document}          $$ \bigints \dfrac{\dfrac{1}{2}}{\norm{s}+1} ds =  \int \dfrac{\dfrac{1}{2}}{\norm{s}+1} ds$$      \end{document}    produces  while \documentclass{article}  %\usepackage{lmodern} \usepackage{bigints}      \newcommand*\norm[1]{\left\lVert#1\right\rVert}  \begin{document}          $$ \bigints \dfrac{\dfrac{1}{2}}{\norm{s}+1} ds =  \int \dfrac{\dfrac{1}{2}}{\norm{s}+1} ds$$      \end{document}    produces  I don't know the internal code of '\lmodern' so, what's happening?


I'm going on a long distance permanent relocation road trip and have some random stuff left at home that I can either throw out or bring along.   What foods are safe to leave in the car over a long period of time?


I need to create something similarly to these functionality on picture. Like stack's TAGS about questions.     I want to be able to input more records for database in one form input field.  My another solution is to add dinamic field where you get another input field on button add or +, but i would try to implement something like this on picture above. I googled but i found nothin similary. Any idea how to acomplish that? I work in php, html, jquery.  Thank you.  Sorry if question is not clear, but i googled and try to find some plugin but i couldn't find anything. Best regards.


Confirmation of Proof: $\forall n \in \mathbb{N}, \ \pi (n) \geqslant \frac{\log n}{2\log 2}$

The question is as follows:          How can I prove the following theorem? $$\forall n \in \mathbb{N}, \ \pi(n) \geqslant \frac{\log n}{2\log 2} \tag1 \label1$$      I have no idea where to begin. I came across this equation on a paper that apparently proved Legendre's Conjecture. You can review the paper , which introduces the open conjecture, but it only reveals two proof even though the title states there are three proofs. In the paper, it mentioned that a demonstrated proof of $\eqref1$ was on pp. $21$ but for some reason, the paper that I observed, and that of which is accessible in the link, holds only $7$ pages.  May somebody please provide a proof of $\eqref1$? I am just curious.  Thank you in advance.    Edit:  When I was about to post this question, I was unaware that such a similar question has already been posted and answered. Sorry about that.