body1
stringlengths 20
4.1k
| body2
stringlengths 23
4.09k
|
|---|---|
I was wondering if it's possible to have the subdivisions to show only on one viewport, so I can have a quick preview on my second viewport while editing the raw low poly geometry, something like that: | When I split screen in two and switch Edit/Object mode, they both change. How to change just one? The intention here is: use one to modelling with numkey view with transparent wireframe and the other to see the progress in perspective, with solid mesh |
Let $X\in\mathbb{A}^n$ and $Y\in\mathbb{A}^m$ be affine varieties (irreducible algebraic sets). Then, if we denote by $i_X$ and $i_Y$ their ideals in their respective affine spaces, we define their product in $\mathbb{A}^{n+m}$ as the set $$ X\times Y = \{(x,y):x\in X\text{ and } y\in Y\} = \{(x,y):x\in Z(i_X)\text{ and }y\in Z(i_Y)\}. $$ Using the second characterization it's easy to show that in fact $X\times Y$ is closed in $\mathbb{A}^{n+m}$ and particularly that $X\times Y = Z(I_X+I_Y)$, where $I_X$ and $I_Y$ are the vanishing ideals of $X\times\mathbb{A}^m$ and $\mathbb{A}^n\times Y$ (these ideals clearly are in bijective correspondence with $i_X$ and $i_Y$, respectively). Then, by the Nullstellensatz, we get $I(X\times Y) = \sqrt{I_X+I_Y}$. The problem is that the references I've seen claim that in fact $I(X\times Y) = I_X+I_Y$ (, example 2.3.9 in page 25, and Georges' answer in , specially the last display). This would only be true if $I_X+I_Y$ is radical, which I haven't been able to show for this case and know isn't true in general (see ). Are my references wrong, or what am I missing? | This is a follow up question to my previous question Let $k$ be a field and $V \subseteq \Bbb{A}^n$ and $W \subseteq \Bbb{A}^m$ be algebraic sets. Then it should be true that $I(V \times W ) = I(V) + I(W)$ where by $I(V)$ here we mean the extension of $I(V)k[x_1,\ldots,x_{m+n}]$. Now I believe I have proven this (see the proof at the bottom of my question) but when I look at Martin's answer , it is instead claimed that we actually have $$I(V \times W )= \sqrt{I(V) + I(W)},$$ and for $I(V) + I(W)$ to be a radical ideal we need $k$ to be algebraically closed. My question is: What's going on here? I believe my claim is true even without the assumption that $k$ is algebraically closed. Here's a proof user Sanchez told me of, which I have simplified: First it is clear that we always have $I(V) + I(W) \subseteq I(V \times W)$. For the reverse inclusion consider a polynomial $f \in I(V \times W)$. Then we can always write $$f = \sum_{i=1}^n f_ig_i$$ where $f_i \in k[x_1,\ldots,x_n]$ and $g_i \in k[x_{n+1},\ldots,x_{m+n}]$. Now take any $b' \in W$. If for all $i$ we have $g_i(b') = 0$ then since $b'$ is arbitrary, $g_i \in I(W)$ for all $i$. Then $f \in I(W) \subseteq I(V ) + I(w)$ and we are done. Otherwise suppose there exists $b \in W$ and $i$ such that $g_i(b) \neq 0$. Then wlog we may suppose that $g_1(b) \neq 0$. Next, $\sum f_ig_i(b) = 0 $ on all of $V$ by assumption of $f \in I(V \times W)$. So $\sum f_i g_i(b) = p$ for some $p \in I(V)$. Now write $$f_1 = \frac{ p - g_2(b) f_2 + \ldots g_n(b)f_n}{g_1(b)}.$$ Substituting this for $f_1$ in $\sum f_ig_i$, followed by taking things mod $I(V)$ we get an expression with only $n-1$ terms $\mod{I(V)}$. Continuing this process we will finally get an expression with $0$ terms $\mod{I(V)}$ so that $f \in I(V)$. This shows $I(V \times W) \subseteq I(V) + I(W)$ which completes the proof. |
When I run a command on a new machine (or install that I'm testing) I often find that the package needs to be installed first. This leads, for example, to the following sequence: > colordiff The program 'colordiff' is currently not installed. You can install it by typing: sudo apt-get install colordiff Argggh. > apt-get install colordiff Is there a way, when given the prompt that says the command You can install it by typing: sudo apt-get install XXXX to run sudo apt-get install XXXX without typing the entire line out? The best I can do is: > apt-get install !! but since some command (the shell?) is telling me what I should run, it would be nice if I could get that same program to run it for me. | If you try to execute a program that is not installed you will get a message The program 'x' is currently not installed. You can install it by typing: sudo apt-get install x and instead of offering you to install the program for you, you have to type the actual command. How can this behavior be changed? |
Because we usually use past tense for the past and present tense for present and fact. This question is a past but it is a fact (I guess). I'm confused whether to use is or was for this question. | Are these two sentences grammatically correct? Mona told me that London was the biggest city in England. He wanted to know where Manchester was. I found these two sentences by chance in an exercise book published by Egypt's Ministry of Education. Both sentences talk about a fact, and Is it unreasonable to change the verb tense in reported speech to past simple when what the sentences talks about is still true? (As my teacher and the books say.) Or is it right when we talk about facts to change the tense or is the tense change optional and both are correct? |
public class Main { public static void main(String[] args) { double U=-1; double s=0.1; for(int i=0;i<20;i++) { U=U+s; System.out.println("U:" + U); } } } this code run result is: U:-0.9 U:-0.8 U:-0.7000000000000001 U:-0.6000000000000001 U:-0.5000000000000001 U:-0.40000000000000013 U:-0.30000000000000016 U:-0.20000000000000015 U:-0.10000000000000014 U:-1.3877787807814457E-16 U:0.09999999999999987 U:0.19999999999999987 U:0.2999999999999999 U:0.3999999999999999 U:0.4999999999999999 U:0.5999999999999999 U:0.6999999999999998 U:0.7999999999999998 U:0.8999999999999998 U:0.9999999999999998 Why is U in the 3rd step -0.7000000000000001, not -0.7? | Consider the following code: 0.1 + 0.2 == 0.3 -> false 0.1 + 0.2 -> 0.30000000000000004 Why do these inaccuracies happen? |
I have two shape files, one is a route shapefile with polyline and have measurement values. The other one is point with coordinates but no measurement values. I am trying to snap the points to closest route and get measurement of the route that snapped in(please see picture). | We need to find the distance of a series of point along a given polyline. We have a polyline dataset repsenting rivers in a catchment, broken up into river reaches (FID 1 through 35 for example). We also have a point dataset of abstraction licenses within this catchment, some of which are situated along rivers - we can tell from the attribute table which these are as they are defined as groundwater or surface water licenses. The two are not related - i.e. one has not been derived from the other. Therefore not all the surface water licenses lie exactly over the river polylines, despite in 'reality' being on these rivers. We need to be able to see which points are "upstream/downstream" of each other, and so wanted to have a list of which river reach the point is on, followed by the distance downstream from the start of this reach. We can then compare the downstream distances of two point to see which is upstream and which is downstream - the desired outcome! To solve the problem of finding points on/very close to the rivers we were told to use a (small) buffer around each river reach and then to query the buffer to find the points within it. This is fine but we are then left with an area (buffer), not a line, so we can't measure a distance along/within this. Can we use a buffer as described to find out the points on/near the river reach in question and then, somehow (?!) query these points for distance along the river reach (polyline segment)? |
I have tried using sudo apt remove gnome-shell-extension-ubuntu-dock but the dock is still present when I open the Activities overview and show all programs. How do I completely get rid of it? | After I installed plank as my dock panel, I removed the default Ubuntu dock by running sudo apt-get remove gnome-shell-extension-ubuntu-dock Then Ubuntu dock is not on my desktop anymore, but when I open the application menu or Activities overview it is there, how can I hide it? Removed dock shows on the left: |
According to linuxaudio.org, I should add the command echo 3072 >/sys/class/rtc/rtc0/max_user_freq to my startup scripts. In previous versions, I've done this by adding the line to the file /etc/rc.local, however as I understand, this does not work in 18.04 anymore. Then, I found an answer that mentions creating a startup script in /etc/systemd/system/ like so: [Unit] Description=RTC Max User Freq [Service] ExecStart=echo 3072 >/sys/class/rtc/rtc0/max_user_freq Type=oneshot RemainAfterExit=yes [Install] WantedBy=multi-user.target The script was found by the systemctl autocomplete command and I enabled it successfully, however it does not come into effect upon reboot. What do I have to do in Ubuntu 18.04 to execute this command on startup? Edit: The solution to this issue is a simple syntax change, the code in the .service-file when using systemd to run the script on startup should actually be: [Unit] Description=RTC Max User Freq [Service] ExecStart=/bin/bash -c "echo 3072 >/sys/class/rtc/rtc0/max_user_freq" Type=oneshot RemainAfterExit=yes [Install] WantedBy=multi-user.target After wrapping the command in /bin/bash -c "...", the script worked immediately. | I have a systemd file to start a jar file. But I want to execute jar file as *.jar. Is there a way to do this? [Unit] Description=Test Background [Service] ExecStart=/usr/bin/java -jar /var/www/test.com/*.jar Type=simple WorkingDirectory=/var/www/test.com [Install] WantedBy=multi-user.target I tried this but not working. |
It is proposed to colour the squares of a $4 \times 4$ board black and white, so that there are exactly two black squares and two white squares in each row or column. In how many ways can this be done? I've tried this finding out the number of ways column 1 and 2 can be done which is $36 = 6 \cdot 6$ as $\binom{4}{2}$ since the second column doesn't get in the way of the first. Then I hit a road block. Can anyone provide a hint? | I don't know if this is a famous problem but my professor assigned this for a research project and I am hitting a dead end( I don't know what to do next). Note: In $\phi(n)$ ; $n=rows=columns$ and this function throws out total combination of matrices that satisfies the following rule: Rule for this square binary matrix: Every Row and Column has two 1's. So, $$\phi(2)=1$$ \begin{bmatrix} 1 1 \\ 1 1 \\ \end{bmatrix} $$\phi(3)=6$$ I can't write out all the possible matrices for $n=3$ but this is one of them (btw i did this by hand): \begin{bmatrix} 0 1 1 \\ 1 0 1 \\ 1 1 0 \\ \end{bmatrix} According to a program made by my friend, he told me: $$\phi(4)=90$$ $$\phi(5)=2040$$ |
I have this method that receives a string that contains an integer at the end, i've tried to extract the characters and the integer this way: public void findCardPosition(String cardLocation,ImageView cardImage){ String cardName = null; String cardType = cardLocation.replaceAll("[^a-z]",""); String cardPosition = cardLocation.replaceAll("[^0-9]", ""); int position = Integer.parseInt(cardPosition)-1; if(cardType=="territory"){ cardName=GameBoard.getTerritoryTower().placeTowerTerritories().get(position).getName(); } if(cardLocation=="territory1"){ cardName=GameBoard.getTerritoryTower().placeTowerTerritories().get(position).getName(); } if(cardName!=null){ this.findCardImage(cardName,cardImage); } } In theory both IF should work but the first one doesn't which means that when i apply String cardType = cardLocation.replaceAll("[^a-z]",""); to the string "territory1" it doesn't return the string "territory". The string cardPositionworks, so i don't understand why the stringcardTypedoesn't. | I've been using the == operator in my program to compare all my strings so far. However, I ran into a bug, changed one of them into .equals() instead, and it fixed the bug. Is == bad? When should it and should it not be used? What's the difference? |
I have been searching for a while, but I didn't find what I was looking for. If this question has been answered before please add a link to the answer. I am writing a report, where every chapter is a published article that I discuss. I want to cite each article in the title of its corresponding chapter, but I don't want the reference number to be shown in the table of contents. I tried \chapter{Paths \cite{...}} The chapter title looks fine with the citation number beside it for example, Paths [1] but it also shows like this in the table of contents, and that is what I don't want. I want to show up in the table of contents only as Paths Is this possible? Or there another better way to do it? Maybe put a header just for the citation number? | Sorry if this question already appears elsewhere, I couldn't find it. Is there a way to label a section in the text but give it a different name in the table of contents? I have very long section titles but would like to give them nicknames in the TOC. I tried using \section*{A} then \addcontentsline{toc}{section}{B} but this removes the numbering of the section from the body of the text. I'm very new to LaTeX so sorry if this is an annoying question! |
The below given image is rendered with 1000 samples with appropriate light settings but the final rendered image is coming as smudged. Is there any solution to fix this? EDIT : please find the link for .blend file below. | I was following on creating a watch and noticed that when I rendered the watch, some pieces were messed up. I'm new to 3D modeling and I've just learned Blender, I can't explain it well, so here's a picture: Other examples: I don't know if it's a problem with my World texture, the object, or the object's texture/material, so I can't even guess how to fix it. What causes this? Is it possible to fix it? |
Assume that $f$ is a given real-valued continuous function over $\mathbb{R}$. How to construct an entire function $F$ such that $F(z)$ is real-valued when $z\in \mathbb{R}$ and there exists a real number $a$ such that $f(z)<F(z)$ for all $z>a,z\in \mathbb{R}$. | Does there exist a continuous function $\: f : \mathbf{R} \to \mathbf{R} \:$ such that for all functions $\: g : \mathbf{R} \to \mathbf{R} \:$, for all real numbers $x$, there exists a real number $y$ such that $\: x < y \:$ and $\: g(y) < f(y) \:$? |
I have encountered a problem when trying to introduce new people to the SE network: they can't remember Stack Exchange. So, for example, I might tell a non-tech user: "You should ask your question on this cooking website, it's called cooking.stackexchange.com." They remember the cooking part very easily (or the diy, or gaming, etc..), but they tend to forget the stackexchange part. So what I propose is that we buy domains for all Area 51 site proposals that end in *.se. So, for example, cooking.stackexchange.com would be magically transformed into cooking.se. I understand that it isn't a .com but it could be forwarded to *.stackexchange.com Most (if not all) of the domains should be available since this is a . I'm not 100% sure if non-Swedish compaines/people can register these domains . This is not the same as since it proposes we use *.se.com. Also the accepted answer for was basically that "all sites will get their own .com once they leave beta," which we now know isn't the plan. | On Stack Exchange sub-sites it seems to be a common practice to refer to other Stack Exchange sites by abbreviating the ".stackexchange.com" part of the domain to simply ".se" (often capitalized), as in "math.SE" or "unix.SE". These aren't actual Stack Exchange domains, but they could be, answering only to GET on the root path and redirecting to the relevant .stackexchange.com URL. Pros: Leverages an existing community custom from an abbreviation convention to actual references to the relevant sites. Shortens getting to the main page of a site by 15 characters. Cons: Some domains such as unix.se are already in use, which at the very least complicates things. Introduces an inconsistency if .se domains for some important sites cannot be bought. |
Let $f_{n}$ be a sequence of holomorphic functions on an open set $U \in \mathbb{C}$, which tends to f uniformly on $U$. Prove that f is holomorphic on U I have proved a simple case which is if $U$ is a simply connected domain, then a continuous function $g$ on $U$ is holomorphic if and only if $\int_{\gamma}g=0$ for any closed curve $\gamma$ in $U$. But I don't know how to apply to the general case $U$ is an open set. Thanks. | Let $\{f_n\}$ be a sequence of holomorphic functions defined in a generic domain $D \subset \mathbb{C}$. Suppose that there exist $f$ such that $f_n \to f$ uniformly. My question is: is it true that $f$ is holomorphic too? |
i have this lines of code: $veo = mktime (0,02,0,0,0,0); $veo1 = mktime (0,03,0,0,0,0); $dif = ($veo1 - $veo); echo date("H:i",strtotime($dif)); The output is: 18:00 when it should be 00:01 Can you please help me? I need to calculate the difference between those two times (of course in this example is easy) Thanks | How to calculate minute difference between two date-times in PHP? |
I have a decimal variable with following values a = 99.9999 b = 88.423766 c = 11.896589 Here I am trying to convert with 4 decimal points. And I used a = Math.Round(Convert.ToDecimal(a), 4); b = Math.Round(Convert.ToDecimal(b), 4); c = Math.Round(Convert.ToDecimal(c), 4); However I get values like a = 100 b = 88.4238 c = 11.8966 Though the preferred values are with out rounding, a = 99.9999 b = 88.4237 c = 11.8965 How can I achieve it. | Possible Duplicate: I want to truncate the decimals like below i.e. 2.22939393 -> 2.229 2.22977777 -> 2.229 |
I want to show that if $n$ is a positive integer greater than $3$, then $n^3+(n+1)^3+(n+2)^3$ is divisible by $9$. By expanding the expression and combining the like terms, I get $n^3+(n+1)^3+(n+2)^3=3(n+1)\left[(n+1)^{2}+2\right]$. The factor $3$ is easy to see. I wonder how to get the other factor $3$. Thanks. | I'm trying to prove by MI. I have already distributed n+1, but now I'm stuck on how I can show 9 divides the RHS since $42n$ and $3n^3$ does not divide evenly. $$(n+1)^3+(n+2)^3+(n+3)^3=3n^3+18n^2+42n+36$$ |
How may I prove that both are uniformly continuous?: $f(x,y)=\sin(x+y)$ for 1, I said, let $\epsilon > 0$ if $d((x,y),(u,v))<\lambda$: $|f(x,y)-f(u,v)|<|f(x,y)|+|f(u,v)|=|\sin(x+y)|+|\sin(u,v)|<|x+y|+|u+v|$ But how may I continue from here? | Let $f(x,y) = \sin(x^2+y)$. Show that $f$ is not uniformly continuous over $\mathbb{R^2}$. I know that $g(x) = \sin(x^2)$ is not uniformly continuous over $\mathbb{R}$, but does it imply something about $\mathbb{R^2}$? How can we use the definition of uniformly continuity in $\mathbb{R}$ to uniformly continuity in $\mathbb{R^2}$? |
Every finite group is a subgroup of An for n>=1 Can anyone give a sketch of the proof. I cannot proceed! | How does one prove that every finite group is isomorphic to a subgroup of an alternating group? |
I joined stackoverflow 4 months ago and got really excited (addicted too) on solving other people's issues and editing first posts etc... Day before yesterday I hit the 1k reputation bar but was shocked a day after of reversal voting that brought me down to 700 after "serial votes were reversed". I don't deny that two of my friends were up voting my answers but they did only up voted my accepted answers (I have roughly 15 accepted). They judged each answer, they choose to up vote or not. I didn't ask them to do it nor did I bribe them by any sort to do it. Actually, one friend once up voted one of my very average answer and we had argument about it because I simply believe it is wrong to do so and he took it down I believe. Ethically, I wouldn't let anyone votes for me just for who I am. Also, I was a victim of a down voting multiple times just because my answer got accepted and another person' answer did not and that was never recovered. Is there anyone who please can explain how reversal algorithm works? And is there a chance I get back my reputation points that were earned only on accepted answers? | I just noticed that I lost a bunch of points from my reputation score, and I used the "reputation" tab on my user profile page to try and track down the cause. During my investigation, I noticed there was an unusual event of type "reversal". In the normal place of a question title, it says "voting corrected". What does this mean, and what caused it? Did I do something wrong? Why did I lose all of that reputation? Is the system punishing me for leaving too many good answers? Is there any way to earn it back? |
I need to prove the following inequality: $n!\leq(\frac{n+1}{2})^n$ Thank you very much for your help. | I don't know what to do with this. Nothing works. I hope somebody can help me to find a decision $$n!\leq {\left(\frac{n+1}{2}\right)}^{n}$$ |
A polynomial $f(x)$ with real coefficients leaves the remainder $15$ when divided by $x-3$ and the remainder $2x+1$ when divided by $(x-1)^2$. The remainder when $f(x)$ is divided by $(x-3)(x-1)^2$ is? | A polynomial function $f(x)$ with real coefficients leaves the remainder $15$ when divided by $x-3$, and the remainder $2x+1$ when divided by $(x-1)^2$. Then the remainder when $f(x)$ is divided by $(x-3)(x-1)^2$ is? What I have thought-The remainder must be of the form $ax^2+bx+c$. Now applying the remainder theorem, I am able to find $2$ equations in $a,b,c$ . eg Let $f(x)$=$(x-3)$$h(x)$+$15$ ...................................(1) Also let $f(x)=(x-3)(x-1)^2g(x)+ax^2+bx+c$...........................(2) Put $x=3$ and using (1) we get $15=9a+3b+c$ Similarly I can get another equation using the other information given. But I am only able to get 2 equations in 3 variables. From where do I get the 3rd equation in $a,b,c$ and hence the remainder? |
I want to extract parameters values from a String that contains a method call. Example: sort("KAMP_MR","BEZ ASC, lower(KAMPNR) ASC") I need to extract the parameter values: KAMP_MR BEZ ASC, lower(KAMPNR) ASC I have a regex that works to some point "[0-9a-zA-Z.,_()" "]*" But this will match "KAMP_MR","BEZ ASC, lower(KAMPNR) ASC" but how do I split this by ,? | I have a value like this: "Foo Bar" "Another Value" something else What regex will return the values enclosed in the quotation marks (e.g. Foo Bar and Another Value)? |
I'm trying to run my main activity but every time my splash activity finished I keep getting a Java NullPointerException. I'm using butterknife to bind my variables. Here is my main activity code: private SectionsPagerAdapter mSectionsPagerAdapter; @BindView(R.id.container) ViewPager mViewPager; @BindView(R.id.tabs) TabLayout mTabLayout; protected void onCreate(Bundle savedInstanceState) { super.onCreate(savedInstanceState); setContentView(R.layout.activity_main); ButterKnife.bind(this); doBindService(); Toolbar toolbar = (Toolbar) findViewById(R.id.toolbar); setSupportActionBar(toolbar); // Create the adapter that will return a fragment for each of the three // primary sections of the activity. mSectionsPagerAdapter = new SectionsPagerAdapter(getSupportFragmentManager()); // Set up the ViewPager with the sections adapter. mViewPager.setAdapter(mSectionsPagerAdapter); mTabLayout.setupWithViewPager(mViewPager); } here is my error report: java.lang.RuntimeException: Unable to start activity ComponentInfo{yobra.msupa.brianyobra.scenatra/yobra.msupa.brianyobra.kilo.MainActivty}: java.lang.NullPointerException at android.app.ActivityThread.performLaunchActivity(ActivityThread.java:2211) at android.app.ActivityThread.handleLaunchActivity(ActivityThread.java:2261) at android.app.ActivityThread.access$600(ActivityThread.java:141) at android.app.ActivityThread$H.handleMessage(ActivityThread.java:1256) at android.os.Handler.dispatchMessage(Handler.java:99) at android.os.Looper.loop(Looper.java:137) at android.app.ActivityThread.main(ActivityThread.java:5103) at java.lang.reflect.Method.invokeNative(Native Method) at java.lang.reflect.Method.invoke(Method.java:525) at com.android.internal.os.ZygoteInit$MethodAndArgsCaller.run(ZygoteInit.java:737) at com.android.internal.os.ZygoteInit.main(ZygoteInit.java:553) at dalvik.system.NativeStart.main(Native Method) Caused by: java.lang.NullPointerException at yobra.msupa.brianyobra.kilo.MainActivty.onCreate(MainActivty.java:69) at android.app.Activity.performCreate(Activity.java:5133) at android.app.Instrumentation.callActivityOnCreate(Instrumentation.java:1087) at android.app.ActivityThread.performLaunchActivity(ActivityThread.java:2175) at android.app.ActivityThread.handleLaunchActivity(ActivityThread.java:2261) at android.app.ActivityThread.access$600(ActivityThread.java:141) at android.app.ActivityThread$H.handleMessage(ActivityThread.java:1256) at android.os.Handler.dispatchMessage(Handler.java:99) at android.os.Looper.loop(Looper.java:137) at android.app.ActivityThread.main(ActivityThread.java:5103) at java.lang.reflect.Method.invokeNative(Native Method) at java.lang.reflect.Method.invoke(Method.java:525) at com.android.internal.os.ZygoteInit$MethodAndArgsCaller.run(ZygoteInit.java:737) at com.android.internal.os.ZygoteInit.main(ZygoteInit.java:553) at dalvik.system.NativeStart.main(Native Method) | What are Null Pointer Exceptions (java.lang.NullPointerException) and what causes them? What methods/tools can be used to determine the cause so that you stop the exception from causing the program to terminate prematurely? |
I have the following Master-Detail relationship and would like to get the related Addresses for the Natural Person into a custom Visualforce page using a custom NaturalPersonController so when looking at a specific Natural Person record, I am also able to see it's related Addresses. After sifting through many threads I found the following code, but I cannot see how to obtain the Addresses for the specific Natural Person. public List<Address__c> getRelatedAddresses(){ List<Address__c> addressList = New List<Address__c>(); for(Natural_Person__c np:[SELECT Id, Name,(SELECT Id, Name FROM Addresses_r) FROM Natural_Person__c WHERE Id =: naturalPerson.Id]){ for(Address__c a:np.Addresses_r) addressList.add(a); } return addressList; } When building I get the error: Id, Name, (SELECT Id, Name FROM Addresses_r) FROM Natural_Person__c ^ ERROR at Row:1:Column:40 Didn't understand relationship 'Addresses_r' in FROM part of query call. If you are attempting to use a custom relationship, be sure to append the '__r' after the custom relationship name. Please reference your WSDL or the describe call for the appropriate names. Variable does not exist: Addresses_r Any assistance to assist my thinking would be appreciated. | I am trying to create an Apex Trigger that performs a Rollup from a custom object to Contacts. Here is the error that I am receiving: Didn't understand relationship 'Assignments__r' in FROM part of query call. If you are attempting to use a custom relationship, be sure to append the '__r' after the custom relationship name. Please reference your WSDL or the describe call for the appropriate names. The child relationship name is Assignments. Below is the code: trigger RollupActiveAssigmentLevelsToContact on pse__Assignment__c (after insert, after update, after delete) { set<Id> set_id = new set<Id>(); List<Contact> con_list = new List<Contact>(); if(trigger.isInsert || trigger.isUpdate){ for(pse__Assignment__c myAssignment : trigger.New) { set_id.add(myAssignment.pse__Resource__c); } } else if(trigger.isDelete){ for(pse__Assignment__c myAssignment : trigger.Old){ set_id.add(myAssignment.pse__Resource__c); } } if(trigger.isAfter && (trigger.isInsert || trigger.isUpdate || trigger.isDelete)){ con_list = [SELECT id,Total_Levels__c, (SELECT id,name FROM Assignments__r WHERE Active_Assignment__c = TRUE) FROM Contact WHERE id IN :set_id]; for(Contact con : con_list){ if(con.Assignments__r.size()>0) con.Total_Levels__c = con.Assignments__r.size(); else con.Total_Levels__c = 0; } if(!con_list.isEmpty()) update con_list; } } Below is a snap of the Child Relationship name: |
I purged python3 due to some problems. After doing that, it removed a lot of packages.I installed Firefox and visual studio then I restarted the laptop but it switch into the virtual terminal. I searched many times but could not find the solution. I tried sudo apt install --reinstall ubuntu-desktop but it shows package have unmet dependencies , and unable to correct problem, you held broken package Please help me I am in trouble. | I am a new Ubuntu user running Ubuntu 13.04. I've been trying to install and use a DeDRM tool, but I've been having problems doing so. I was following some directions that said I needed a version of Python 2.7, but not anything Python 3.0 or later (because 3.0 versions are missing some necessary libraries?). I tried to install Python 2.7.5.6, but it didn't work. I thought it was probably because I had the later version of Python, so I went through terminal and removed Python 3.3, so I could install the earlier version of Python. Now that I've uninstalled Python 3.3, a lot of applications no longer work, including the terminal and the Ubuntu Software Center. I have no idea how to fix this problem now. |
I'm in the process of writing a program, and I get to the part(which I've commented below) and I try to do if(userInput.get() != "") It still executes the code inside the if statement if I leave the dialog box blank and press "ok" or enter. So it would say: "You did not enter numeric information" instead of "You did not enter any information" like in the outer else statement. I tried with null and it didn't work either. What am I doing wrong here? import java.util.Optional; import javafx.application.*; import javafx.event.*; import javafx.geometry.Pos; import javafx.scene.*; import javafx.scene.control.*; import javafx.scene.control.Alert.AlertType; import javafx.scene.input.*; import javafx.scene.layout.*; import javafx.scene.paint.*; import javafx.scene.shape.*; import javafx.scene.text.*; import javafx.stage.*; import javafx.stage.Stage; public class QuizDialogBox extends Application { public void start(Stage primaryStage) { TextInputDialog inputDialog = new TextInputDialog(); inputDialog.setHeaderText(null); inputDialog.setTitle("Grams to Ounces"); inputDialog.setContentText("Enter number of Grams: "); Alert errorAlert = new Alert(AlertType.ERROR); Optional<String> userInput = inputDialog.showAndWait(); if((userInput.get() != "") && userInput.isPresent()) //the part thats not working { String userInputString = userInput.get(); System.out.println("{" + userInputString + "}"); if(isNumeric(userInputString)) { int userNumber = Integer.parseInt(userInputString); System.out.println(userNumber); } else { errorAlert.setContentText("You did not enter numeric information"); errorAlert.showAndWait(); } } else { errorAlert.setContentText("You did not enter any information"); errorAlert.showAndWait(); } } public static void main(String args[]) { launch(args); } public static boolean isNumeric(String string) { boolean isNumber = false; try { Integer.parseInt(string); isNumber = true; } catch(NumberFormatException ex) { } return isNumber; } } | I've been using the == operator in my program to compare all my strings so far. However, I ran into a bug, changed one of them into .equals() instead, and it fixed the bug. Is == bad? When should it and should it not be used? What's the difference? |
We must prove :$\min\limits_{x+y=1}(x^n+y^n)=\frac{1}{2^{n-1}} $ for all $n \in \mathbb{N}_{>0}$ And to prove this we can use the inequality: $\frac{x+y}{2}\leq (\frac{x^n+y^n}{2})^{\frac{1}{n}}$ where equality is satisfied if $x=y=1/2$ My question is how we can prove inquality: $\frac{x+y}{2}\leq (\frac{x^n+y^n}{2})^{\frac{1}{n}}$ ? | Can you help me to prove that $$(x+y)^n\leq 2^{n-1}(x^n+y^n)$$ for $n\ge1$ and $x,y\ge0$. I tried by induction, but I didn't get a result. |
In Harry Potter and the Half-Blood Prince, it was said that Rufus Scrimgeour took over Fudge to become the Minister for Magic. Also, Dumbledore stated that he is a more proactive and decisive Minister for Magic than Fudge had been, and Scrimgeour took on more active role in fighting Voldemort and Death Eaters. So that means he is a more powerful Minister than Fudge had been, right? How come Death Eaters took over the Ministry so easily in Harry Potter and the Deathly Hallows? | Yesterday I watched Harry Potter and the Deathly Hallows: Part 1, and I was wondering how exactly the Death Eaters took the Ministry? In the movies we never saw that. Later I checked on Wikipedia's book article and it just said that they kill the Minister. Was it a Coup d'état or a conspiracy? Why didn't any of the authorities help the Ministry? |
I've accidentally discovered the lolcat package today. The first thing that I though about is: it would be fantastic if i could pipe everything that comes from stdout to the terminal through lolcat to get those rainbow effects. Just imagine the pranking possibilities. Essentially what I'm asking for is a way to apply a command to every line that comes out of a bash prompt to stdout. | Good Afternoon, (OS X user) I am specifically trying to pipe the output of every shell command I type into the ruby gem 'lolcat' (which makes the output to the terminal rainbow colored). Is there a way to do this without explicitly aliasing command individually? I was thinking perhaps there might be a way to pipe anything before the return key is pressed , but I am not sure how to do this. Your assistance is appreciated, as I am tired of looking at just one color in my terminal. |
The first time I knew about the hyperbolic function was when I was studying the derivatives. And I know that the derivative of $\sinh x= ( e^x - e^{-x} )/ 2$ , but i still confused with what are they really are? and how did we get them and for what we are using them? Thanks very much, and i hope that wasn't a long question. | I covered hyperbolic trigonometric functions in a recent maths course. However I was never presented with any reasons as to why (or even if) they are useful. Is there any good examples of their uses outside academia? |
Please do not flag this question as a duplicate of this one: This is not a general question, but more a localized question that probably should be closed as soon as replied. These days, I sent a lot of flag. I noticed that more I send flag, more I can send flag. I can currently flag 62 times per day and all the flags all can't be reviewed quickly. So the number of flag waiting for review is growing, growing, and growing. I have currently more than a hundred flags waiting for review and I don't know if it is a problem. So please just let me know If I should stop a moment? Note: my goal is just to participate to maintain quality of the site. It is not to break the machine. ;-) | I’m still a long way from being able to cast close votes on SO (my rep is around 40% of the required amount). When I see something that looks wrong I generally flag it (usually as not a real question, duplicate, or needs to be somewhere else). I get the impression that my flag weight is relatively high (around 557). Does this mean that I’m flagging too often or is it ok to flag whenever something seems like it’s in the wrong place? Should I instead be ignoring the questions and assuming that close/delete votes will be cast by members with sufficient rep? If I am doing the right thing, then what’s the appropriate action when I do eventually get to the point where I can cast close votes? Do you just vote to close, or vote to close and flag, or is this a nonsense question that will make sense when I get there? |
I'm new to Blender (so hopefully this isn't too obvious) and I've recently been trying to import obj files but when I do, nothing shows up. I'm sure the object I'm importing is .obj, and when I import it, it shows up on the scene collection menu but I just can't see it... I don't know if there's something that I'm missing here or something, but I just can't seem to see the object that I imported. Here are the steps I followed: Clicked "File" Clicked "Import" Clicked "Wavefront (.obj)" Selected the file and imported From there on I could see nothing. Help? (I'm using Blender 2.91.2 on Windows 10) | I try to import .obj files from this project: - the files contain Polygon Mesh Data. When I import the obj file into blender, the outliner shows a new mesh added, but nothing is visible in the 3D viewport: Any help will be appreciated. |
I'm running Ubuntu 20.04 on a 2010 Mac Pro, and have had successful results for about a year until now. After booting this morning, I attempted to open GNOME Terminal. It appears that the font rendering is broken. Only parts of the words are rendering. The best example of this can be seen in the Settings app: Random letters are bolded and the longest words rendered are cut to four letters long. I've already tried running sudo apt-get update && sudo apt-get upgrade, and it doesn't fix the problem. I've also tested changing the font, which also doesn't help. Rebooting does not fix this, and it appears to be duplicated across accounts. This glitch only appears in certain areas - for example, the top bar does not display the issue, and nor do any third-party apps I've discovered that it may be a GTK issue, because Brasero and a few other native apps have the same issue. Help on this issue is greatly appreciated, considering it makes all GNOME default apps unusable. | I am a novice Linux user. Today, I turned on my system and found out that whenever I open any system apps (like Setting, Files, even the Terminal), a bunch of text was missing from there, and it was showing only the first four letters of every word in the app (Screenshot attached to further visualize the issue) Please, help me to fix the issue. Thank you all |
$f_n$ defined on $[0;1]$ by $f_n(x)=x^n$, $f_n(x)$ weakly-converges if $\forall x \in I$ $(f_n(x_0))_{n\in \mathbb{N}}$ have a finite limit. And it goes without saying (tell me if that's too weak to prove) that $\forall x\in [0,1],f_n(x)\rightarrow 0$ $f_n(x)$ converges uniformly to $f(x)$ if $\forall\epsilon\ge 0,\exists N\in \mathbb{N}|f_n(x)-f(x)|\le\epsilon$ An it exists such a N because $\lim\limits_{n\rightarrow +\infty}|x^n-f(x)|=0$ but I'm not quite sure about the uniform-convergence as far as I don't know what's hidding behind $f(x)$ alone without $n$. | For the following sequence of functions and its limit function, we can see that $f_n(x)$ is clearly pointwise convergent $$f_n(x) = x^n\text{ }\forall x\in[0,1]\text{ and }\forall n\in\mathbb N^*\\ f(x) = \begin{cases}0&\text{if } x\in[0,1)\\1&\text{if } x=1\end{cases}$$ However, I was wondering why this is not uniformly convergent. The condition for uniform convergence is: $$|f_n(x) - f(x)| < \epsilon,\ \ \ \forall x \text{ when } n > N$$ Now most sources present an argument along the lines of: assume that $f_n(x)$ is uniformly convergent and that $0 < x < 1$, this means that $x^n<\epsilon$ whenever $n>N$. Specifically, this would mean $x^{N+1}<\epsilon$ for some fixed $N$. But if we now pick $x$ such that $1 > x > ε^{\frac{1}{N+1}}$, then this would lead to a contradiction, therefore $f_n(x)$ is not uniformly convergent. However, I was wondering why couldn't we take $n$ to infinity. If $0 < x < 1$, then $\lim_{n\rightarrow \infty} |f_n(x) - f(x)| = 0$ (which is less than $\epsilon$). Now since $|f_n(x) - f(x)|$ will always be $0$ if $n > \infty$, then wouldn't this be uniformly convergent? |
I have to implement Equals method for below generic class. public class SomeIdentifier<T> { public T Id { get; set; } public String Name { get; set; } public override bool Equals(object obj) { var other = obj as SomeIdentifier<T>; if (other == null) { return false; } return Id == other.Id && Name == other.Name; } } But I am not allowed to compare Id == other.Id as both are of type T. I am getting below error message *Operator '==' cannot be applied to operands of type 'T' and 'T' * | According to the documentation of the == operator in , For predefined value types, the equality operator (==) returns true if the values of its operands are equal, false otherwise. For reference types other than string, == returns true if its two operands refer to the same object. For the string type, == compares the values of the strings. User-defined value types can overload the == operator (see operator). So can user-defined reference types, although by default == behaves as described above for both predefined and user-defined reference types. So why does this code snippet fail to compile? bool Compare<T>(T x, T y) { return x == y; } I get the error Operator '==' cannot be applied to operands of type 'T' and 'T'. I wonder why, since as far as I understand the == operator is predefined for all types? Edit: Thanks, everybody. I didn't notice at first that the statement was about reference types only. I also thought that bit-by-bit comparison is provided for all value types, which I now know is not correct. But, in case I'm using a reference type, would the == operator use the predefined reference comparison, or would it use the overloaded version of the operator if a type defined one? Edit 2: Through trial and error, we learned that the == operator will use the predefined reference comparison when using an unrestricted generic type. Actually, the compiler will use the best method it can find for the restricted type argument, but will look no further. For example, the code below will always print true, even when Test.test<B>(new B(), new B()) is called: class A { public static bool operator==(A x, A y) { return true; } } class B : A { public static bool operator==(B x, B y) { return false; } } class Test { void test<T>(T a, T b) where T : A { Console.WriteLine(a == b); } } |
I have a code, which basically makes one formula for B10, then it copies it all the way down and insert it back as values to remove the formula and make it more 'clean'. My issue is that I have a defined 'lastrow' which in this case is 5000. Can I somehow introduce a lastrow which enables it code to copy it down until there is no data in the row. (if a specific column is to be used, then Column C can be used for this. can this be solved? Sheets("Table").Range("B10").Formula = "=LEFT(F10,4)&E10&D10&C10" Sheets("Table").Range("B10").Copy Sheets("Table").Range("B11:B5000").PasteSpecial xlPasteAll Sheets("Table").Range("B10:B5000").Copy Sheets("Table").Range("B10:B5000").PasteSpecial xlPasteValues | How can I find the last row that contains data in a specific column and on a specific sheet? |
I have this string ?foo=bar&language=fr&bar=foo or this string ?language=fr I want to capture (fr) so i did the below: /language=(.*)(?:\&)?/ A link for the regex, | If I had a URL such as http://localhost/search.php?year=2008 How would I write a JavaScript function to grab the variable year and see if it contains anything? I know it can be done with location.search but I can’t figure out how it grabs parameters. |
I am running two background jobs eclipse and wine in my terminal emulator lxterminal, when the terminal shows Memory pressure relief: Total: res = 39469056/39215104/-253952, res+swap = 35393536/35139584/-253952 I was wondering what program generated the output? Thanks. | My syslog file is has large number almost continuous entries as follows. Apr 13 11:49:40 nrao-XPS-8700 gnome-session[2439]: Memory pressure relief: Total: res = 9682944/9682944/0, res+swap = 0/0/0 Apr 13 11:50:05 nrao-XPS-8700 gnome-session[2439]: Memory pressure relief: Total: res = 12369920/12369920/0, res+swap = 0/0/0 Apr 13 11:50:07 nrao-XPS-8700 gnome-session[2439]: Memory pressure relief: Total: res = 10633216/10690560/57344, res+swap = 0/0/0 Apr 13 11:50:10 nrao-XPS-8700 gnome-session[2439]: Memory pressure relief: Total: res = 9682944/11800576/2117632, res+swap = 0/0/0 Apr 13 11:50:35 nrao-XPS-8700 gnome-session[2439]: Memory pressure relief: Total: res = 12369920/12369920/0, res+swap = 0/0/0 Output of free -m command is follows total used free shared buff/cache available Mem: 15998 7155 5903 113 2939 8323 Swap: 18477 4182 14295 |
I want to study a time series using ARIMA. To understand what is the best ARIMA model, I use the function Arima (dataset, order, seasonal) from the package forecast in R. You can see dataset I am trying to analyse below. TEST <- c(0, 0, 0, 8.718396e-04, 6.345178e-04, 4.752852e-04, 7.390983e-04, 2.973536e-04, 0, 0, 0, 0, 0, 1.138822e-04, 9.984026e-05, 0, 0, 7.015575e-05, 6.248828e-05, 0, 0, 8.847600e-05, 7.894841e-05, 3.533444e-05, 3.162255e-05, 2.840909e-05, 2.558068e-05, 2.313048e-05, 2.099782e-05, 0, 0, 0, 0, 0, 1.159205e-05, 1.077714e-05, 0, 0) Using Arima(TEST, c = order(0,1,1), seasonal = FALSE) in R, I obtained the following results: Series: TEST ARIMA(0,1,1) Coefficients: ma1 -0.2155 s.e. 0.1741 sigma^2 estimated as 3.221e-08: log likelihood=274.33 AIC=-544.67 AICc=-544.33 BIC=-541.39 However, if I try to load the same dataset in SPSS, via Analyze > Forecasting > Create Traditional Models... and I select ARIMA(0,1,1), my results are different and, in particular, the sign of my ma1 is opposite, i.e. ma1 = .215 SE = .163 I am a newbie in time trend analysis, and I performed these calculations for multiple datasets, some of them very poor. Initially, I associated my sign differences to the low quality of the dataset, however I am not sure if this could be the case also in this situation, given that the dataset does not seem so bad to justify radically difference results using different programs and, consequently, different algorithms. I also tried to compare the plots obtained from R and from SPSS, and at first glance the seem identical. Finally, I did some tests also looking at the autoregressive part, and I did not notice a similar phenomenon of sign inversion. For example, if I use the same dataset and an ARIMA (1,1,0) I get the following results in R Coefficients: ar1 -0.1549 s.e. 0.1580 sigma^2 estimated as 3.26e-08: log likelihood=274.11 AIC=-544.23 AICc=-543.89 BIC=-540.95 and in SPSS ar1 = -.155 s.e. = .165 What could be the reason for this difference? And which results should I trust? | I noticed that sometimes the moving average process is written in two different ways. I would like to know which one is correct. $y_t = \epsilon_t + \theta \epsilon_{t-1}$ $y_t = \epsilon_t - \theta \epsilon_{t-1}$ |
$\alpha$ is an arbitrary (random) circle that passes through the origin. Show that there are real numbers $s$ and $t$ such that $\alpha$ is the graph of $r = 2s \cos (\theta + t)$. I believe that $r = 2s \cos (\theta +t)$ can be simplified down to $r = x^2+y^2$ using Cartesian coordinates. What next? | Let $\Gamma$ be a circle that passes through the origin. Show that we can find real numbers $s$ and $t$ such that $\Gamma$ is the graph of $r = 2s \cos (\theta + t).$ I know this has to be converted to a cartesian equation, but how do I do this, and what do I do after? Thanks |
Is it possible to enter the next command line like this: command1 ; command2; After validating command1? For example I do: make And it takes a long time! I want to say: after this command: do ./myprogram So I can go take a coffee, and not just wait until it finishes to launch the next command. | I have the following commands. cd import zcat urls1.sql.gz | mysql -u root -p urls cd /var/www/project1/ nano 1.php As of now I'm executing it one by one. Is there a way to combine those commands in one line? |
I have a C++ project and I love mycode organized, however when I put everything in separate directories (headers and source files kept together) I am not able to include headers from another folder. For example: I have two classes called "FooException" and "ContentProvider", which obviously go into separate directories, FooException being an exception and ContentProvider being a utility. Of course, I put them into different folders, but when I try to include the FooException in the ContenProvider it does not work and says that it could not find the source file. Has anyone encountered such problem? Any suggestions? Thanks in advance and Happy New Year! UPD: Okay, people suggested looking at the differences between #include <> and #include "" and that still did not help. Although I am able to access any files from my Main.cpp I am not able to access files neither in my ContentProvider class nor in FooException class no matter which #include-statement I use. Moreover, no matter which statement I use I can access SFML-library from any point in my project. Does it have to do with the SFML-directory being in the "include"-directory in my project? UPD 2: Okay, problem solved and it had nothing to do with #include <> and #include "". I just had to put "..\" before writing the name of the path and it worked beautifully. I marked the answer that suited the best right. | In the C and C++ programming languages, what is the difference between using angle brackets and using quotes in an include statement, as follows? #include <filename> #include "filename" |
One justification for the ubiquity of the (multivariate) normal distribution in statistical/machine learning modeling is that it maximizes entropy among distributions with mean $\mu$ and variance matrix $\Sigma$ (see for example, ). More generally, any exponential family maximizes entropy among distributions subject to the parameters governing the moment restrictions related to its sufficient statistics. The link above suggests that this maximum entropy property is useful because it makes "minimal assumptions" about the true underlying distribution. But in what sense is this true? It seems like depending on your task, for example, using a normal distribution is far from making "minimal assumptions". For example, if we are worried about outliers, using a normality assumption masks the true uncertainty. For what ends exactly is using a maximum entropy parameterization a good way to make "minimal" assumptions? Or is maximum entropy an end in itself? | I have used the principle of maximum entropy to justify the use of several distributions in various settings; however, I have yet to be able to formulate a statistical, as opposed to information-theoretic, interpretation of maximum entropy. In other words, what does maximizing the entropy imply about the statistical properties of the distribution? Has anyone run across or perhaps discovered yourself a statistical interpretation of max. entropy distributions that does not appeal to information, but only to probabilistic concepts? As an example of such an interpretation (not necessarily true): "For an interval of arbitrary length L on the domain of the RV (assuming its 1-d continuous for simplicity), the maximum probability that can be contained in this interval is minimized by the maximum entropy distribution." So, you see there is no talk about "informativeness" or other more philosophical ideas, just probabilistic implications. |
What is the correct method of introducing the expanded form for Acronym in the bracket? is it expanded form first and then the acronym in bracket or Vica-Versa. Also, what is the difference in introducing the acronyms to the American audience or to the British audience? | When creating an acronyms/initialisms in a document which will be referenced throughout the document, what is the proper way to display it for the first time? ("Word") or just (Word)? |
i have two shapefile for same region but they are not overlapping with each other. one data set is admin boundaries which i have purchased form the survey of India and other data set is ward boundaries of the cities which i have downloaded form the government website. i have projected the ward boundaries in same projection system as the admin boundaries but still its not overlapping. what i should do.?? Admin boundaries details: Projected Coordinate System: LCC_WGS84 Projection: Lambert_Conformal_Conic False_Easting: 4000000.00000000 False_Northing: 4000000.00000000 Central_Meridian: 80.00000000 Standard_Parallel_1: 12.47294400 Standard_Parallel_2: 35.17280600 Scale_Factor: 1.00000000 Latitude_Of_Origin: 24.00000000 Linear Unit: Meter Geographic Coordinate System: GCS_WGS_1984 Datum: D_WGS_1984 Prime Meridian: Greenwich Angular Unit: Degree | I put 4 different layers into my ArcMap document, but only one of them will show up on the map! I should be seeing the other 3 layers as well. When I do a Zoom to layer, I can see one layer, but I cannot figure out how to make the other 3 show up at once on top of each other. Before I opened ArcMap, I used ArcCatalog where I right-clicked 3/4 of the shapefiles and clicked Properties → Coordinate system → Import and then clicked on my Trees layer, which has the coordinate system I want the other 3 to have. But when I opened ArcMap the 4 layers did not overlap, nor could I move them above or below each other. |
I have 2 live MySQL servers, one running on Linux and another running on Windows. I have recently setup another MySQL environment on Windows however I am getting this error when inserting data into any of the databases's tables... Failed to read auto-increment value from storage engine From what I am reading this is because the MySQL auto increment field is reset after rebooting the server, which it does on this machine. However I am not getting this on my production boxes either Linux or Windows, which are the same version, with many reboots. Any ideas how to fix this? CREATE TABLE `images` ( `imageId` int(11) unsigned NOT NULL AUTO_INCREMENT, `imageUrl` varchar(255) COLLATE utf8mb4_unicode_ci NOT NULL, `imageFileName` varchar(15) COLLATE utf8mb4_unicode_ci NOT NULL, `imageComments` varchar(255) COLLATE utf8mb4_unicode_ci DEFAULT NULL, `imageAddedOn` datetime DEFAULT NULL, `imageStatus` tinyint(3) unsigned DEFAULT NULL, PRIMARY KEY (`imageId`), UNIQUE KEY `image_UNIQUE` (`imageId`) ) ENGINE=InnoDB DEFAULT CHARSET=utf8mb4 COLLATE=utf8mb4_unicode_ci | I need a way to keep auto-increment counter between mysql service restart. As docs states by default after restart mysql autoincrement counter start from max(id)+1. How can I keep the last autoincrement value? This is a big problem for me. I'm using envers to keep entities audits. I get as many errors as many "last rows" I delete. Suppose I'm starting insert data into an empty table. Suppose to insert 10 rows. Then suppose to delete the last 8. In my table I will have as result 2 entities, with id 1 and 2 respectively. In the audit table I will have all 10 entities, with id from 1 to 10: entities with id from 3 to 10 will have 2 action: create action and delete action. auto-increment counter is now setted to 11 in main table. Restarting mysql service auto-increment counter goes to 3. So if I insert a new entity, it will be saved with id 3. But in audit table there is already an entity with id = 3. That entity is already marked as created and deleted. It result in an assertion failure during update /delete action because envers cannot handle this inconsistent state. Thanks |
If I setup the following template method of a template class foo:func template<typename T> class foo{ public: template<typename U> static void func(){} }; int main(){ foo<int>::func<long>(); } everything works fine. When I try to call foo::func from a template class template<typename T> class foo{ public: template<typename U> static void func(){} }; template<typename T,typename U> class bar{ public: bar(){ foo<T>::func<U>(); } }; int main(){ bar<int,long> b; foo<int>::func<long>(); } I get the following compile error: main.cpp: In constructor ‘bar<T, U>::bar()’: main.cpp:13:19: error: expected primary-expression before ‘>’ token foo<T>::func<U>(); ^ main.cpp:13:21: error: expected primary-expression before ‘)’ token foo<T>::func<U>(); ^ How can I call foo::func from the template class bar? | In templates, where and why do I have to put typename and template on dependent names? What exactly are dependent names anyway? I have the following code: template <typename T, typename Tail> // Tail will be a UnionNode too. struct UnionNode : public Tail { // ... template<typename U> struct inUnion { // Q: where to add typename/template here? typedef Tail::inUnion<U> dummy; }; template< > struct inUnion<T> { }; }; template <typename T> // For the last node Tn. struct UnionNode<T, void> { // ... template<typename U> struct inUnion { char fail[ -2 + (sizeof(U)%2) ]; // Cannot be instantiated for any U }; template< > struct inUnion<T> { }; }; The problem I have is in the typedef Tail::inUnion<U> dummy line. I'm fairly certain that inUnion is a dependent name, and VC++ is quite right in choking on it. I also know that I should be able to add template somewhere to tell the compiler that inUnion is a template-id. But where exactly? And should it then assume that inUnion is a class template, i.e. inUnion<U> names a type and not a function? |
In The Lord of the Rings: The Two Towers Gandalf cast Saruman out of the order; he had become the White. How could Saruman have no colour? What is the requirement for being White in the order and what is the crime for which someone can lose his colour in the council? | When Gandalf comes back alive after dying in The Lord of the Rings, why does he come back as the white wizard not the grey wizard? Am I correct that it is because Saruman had become evil? |
i want to add column inside table. column name is name,surname how i can add this column inside already created table? like alter table MyTable ADD name,surname Varchar(100) ??? | After reading a couple of answers and comments on some SQL questions here, and also hearing that a friend of mine works at a place which has a policy which bans them, I'm wondering if there's anything wrong with using backticks around field names in MySQL. That is: SELECT `id`, `name`, `anotherfield` ... -- vs -- SELECT id, name, anotherfield ... |
I have a global dataset consisting of tiles in UTM projection that I want to mosaic and therefore need to reproject to a common projection. Can I solve my reprojection error with options to gdalwarp or do I need to manipulate the input files? Reprojection is done with gdalwarp and the following command: gdalwarp -t_srs EPSG:4326 -of GTiff -co "COMPRESS=LZW" N01_50.TIF N01_50_wgs84.TIF Tiles in UTM Zone01 produce the following error and the result is visibly distorted (spans around the globe in E-W direction). All other tiles work fine. ERROR 1: Too many points (441 out of 441) failed to transform, unable to compute output bounds. Warning 1: Unable to compute source region for output window 6006,0,6007,340, Here is the output of gdalsrsinfo and the : PROJCS["WGS 84 / UTM zone 1N", GEOGCS["WGS 84", DATUM["WGS_1984", SPHEROID["WGS 84",6378137,298.257223563, AUTHORITY["EPSG","7030"]], AUTHORITY["EPSG","6326"]], PRIMEM["Greenwich",0], UNIT["degree",0.0174532925199433], AUTHORITY["EPSG","4326"]], PROJECTION["Transverse_Mercator"], PARAMETER["latitude_of_origin",0], PARAMETER["central_meridian",-177], PARAMETER["scale_factor",0.9996], PARAMETER["false_easting",500000], PARAMETER["false_northing",0], UNIT["meters",1], AUTHORITY["EPSG","32601"]] | I'm using gdalwarp to manipulate SRTM tiles near the the dateline (i.e. 180°, aka the antimeridian). SRTM tiles have a very slight (1/2 pixel) overlap with the meridian. You can see this using gdalinfo: gdalinfo S16W180.hgt Driver: SRTMHGT/SRTMHGT File Format Files: S16W180.hgt Size is 1201, 1201 [...] Lower Left (-180.0004167, -16.0004167) (180d 0' 1.50"W, 16d 0' 1.50"S) Upper Right (-178.9995833, -14.9995833) (178d59'58.50"W, 14d59'58.50"S) [...] So the source spans the dateline by a tiny amount. This causes problems with gdalwarp, which ends up creating huge globe-spanning outputs. gdalwarp -t_srs "epsg:900913" S16W180.hgt test.tif gdalinfo test.tif Driver: GTiff/GeoTIFF Files: test.tif Size is 1703, 5 [...] Lower Left (-20037508.330,-1806798.473) (180d 0' 0.00"W, 16d 7'13.00"S) Upper Right (20032839.451,-1689152.120) (179d57'29.01"E, 15d 5'45.84"S) Note the longitudes span (almost) the entire globe, and also the number of lines is unexpectedly small (5) Is this a bug in gdalwarp? If not, what are the correct options to pass to gdalwarp to get a sensible output? |
I have imported a function from file main.py in the same directory as my current file from main import locate_reference_point print("exited") The above code executes the entire main.py file and them prints "exited". This is how the code was run from the terminal [python -u "c:\Users\Aadithya\Documents\GitHub\whatsapp_bot\unread_messages.py"] This is not how its supposed to work, right? Why is this happening and how to rectify this and execute only the imported function only when it is called for? Thanks a lot for your help.. P.S I have verified many times. | Given the following code, what does the if __name__ == "__main__": do? # Threading example import time, thread def myfunction(string, sleeptime, lock, *args): while True: lock.acquire() time.sleep(sleeptime) lock.release() time.sleep(sleeptime) if __name__ == "__main__": lock = thread.allocate_lock() thread.start_new_thread(myfunction, ("Thread #: 1", 2, lock)) thread.start_new_thread(myfunction, ("Thread #: 2", 2, lock)) |
When I was in elementary school I read a book where in a ghoul somehow got to the local setting. I want to say it was in the US, but that could just be my eagle-centric mindset. The poltergeist followed a couple of children around, a brother and sister. The poltergeist was moving things in relatively non-harmful ways (I remember a scene involving a roller desk?), but the parents brought in a paranormal specialist who blamed it on the girls latent psychic abilities. The brother was a computer aficionado, and at one time upon playing his game an entity appeared near the games character that was a representation of this poltergeist. Eventually, they put it on a disk and ship it back to either Scotland or Ireland. At one point the children worked with a friend of family who spoke Gaelic to help them understand the poltergeist, but I don't remember wherein the story this occurred. Does anyone know this story and the name of the bookl? Edit -- To clarify I was in elementary school from '96 - 2000, and it was in English. | So, this is super vague and I apologize, but something sparked my memory and it's been bothering me, so here goes... I'm looking for a young-adult book I read probably in the early 2000's. It was possibly older than that, but I doubt it was earlier than the seventies or so, and was likely somewhere in my elementary school. I have no information as to what was on the cover. In terms of plot, I think it involved a haunting of an old house and two (or maybe three) children. Either the older or middle one was a girl of twelve or fourteen. When the ghost/spirit/whatever starts moving things and causing havoc in the house, I think the parents call a doctor. He turns out to be a sinister-type character who wants to take the girl away, believing her to be the source of the disturbances. I think the ghost or whatever takes a liking to the kids and tries to help, but for some reason I don't think it can talk or manifest, only move things. I know it's not much to go on, but it's been on my mind all day. Any help would b great! |
Say if I listen for an event: Subject.NewEvent += delegate(object sender, NewEventArgs e) { //some code }); Now how do I un-register this event? Or just allow the memory to leak? | Is it possible to unsubscribe an anonymous method from an event? If I subscribe to an event like this: void MyMethod() { Console.WriteLine("I did it!"); } MyEvent += MyMethod; I can un-subscribe like this: MyEvent -= MyMethod; But if I subscribe using an anonymous method: MyEvent += delegate(){Console.WriteLine("I did it!");}; is it possible to unsubscribe this anonymous method? If so, how? |
In my work somebody did produce a code which is reduced as follow: int main() { int a[20]; a[3, 4]; return 0; } the a[3, 4] compile without error and without warning on default gcc option. With gcc -Wall option it produce the following warning: test.c: In function ‘main’: test.c:4:8: warning: left-hand operand of comma expression has no effect [-Wunused-value] a[3, 4]; ^ test.c:4:5: warning: statement with no effect [-Wunused-value] a[3, 4]; ^ I can also compile on clang. Basically, i dont understand why this is compiling ? And what it is actually doing (i know a[3,4] return a pointer but that is all i understand). I have tried to look at the assembly code with the -S gcc option but i dont really understand its output (lack of x86 assembly knowledge). EDIT: it actually does not return a pointer but a integer (mistake on my part) | What does the , operator do in C? |
I'm trying to fix a dataset that has some errors of decimal numbers wrongly typed. For example, some entries were typed as ".15" instead of "0.15". Currently this column is chr but later I need to convert it to numeric. I'm trying to select all of those "words" that start with a period "." and replace the period with "0." but it seems that the "^" used to anchor the start of the string doesn't work nicely with the period. I tried with: dataIMN$precip <- str_replace (dataIMN$precip, "^.", "0.") But it puts a 0 at the beginning of all the entries, including the ones that are correctly typed (those that don't start with a period). | I am tired of always trying to guess, if I should escape special characters like '()[]{}|' etc. when using many implementations of regexps. It is different with, for example, Python, sed, grep, awk, Perl, rename, Apache, find and so on. Is there any rule set which tells when I should, and when I should not, escape special characters? Does it depend on the regexp type, like PCRE, POSIX or extended regexps? |
My ubuntu is 14.04, the default gcc and g++ is 4.8, I installed gcc and g++ 4.4 manually, so how can I specify the older version of gcc to call when I compile a program? | So I have installed gcc-4.4 and gcc-4.3 (same for g++). Now as far as I remember there is a tool in Ubuntu which sets the symlinks for you if you just tell it which version you want. However it does not seem to work in the newest version, which I find disappointing. root@nexus:~# update-alternatives --config gcc update-alternatives: error: no alternatives for gcc. root@nexus:~# update-alternatives --config cc There is only one alternative in link group cc: /usr/bin/gcc Nothing to configure. root@nexus:~# dpkg -l | grep gcc | awk '{print $2}' gcc gcc-4.3 gcc-4.3-base gcc-4.3-multilib gcc-4.4 gcc-4.4-base gcc-4.4-multilib gcc-4.5-base gcc-multilib lib32gcc1 libgcc1 Any ideas? |
$\lim_{n\to\infty} \sum_{r=0}^n \frac{\binom{n}{r}}{(n^r)(r+3)}$ I have no idea how do I solve this problem. I do know I have to somehow convert this in a function of $\frac{r}{n}$ cause this looks to me as Riemann integral problem. Any help would be appreciated. | Evaluate $\displaystyle \lim_{n\rightarrow \infty}\sum^{n}_{k=0}\frac{\binom{n}{k}}{n^k(k+3)}$. $\bf{My\; Try::}$ Although we can solve it by converting into definite Integration. But I want to solve it without Using Integration. So $\displaystyle \lim_{n\rightarrow \infty}\sum^{n}_{k=0}\frac{\binom{n}{k}}{n^k(k+3)} = \lim_{n\rightarrow \infty}\sum^{n}_{k=0}\frac{(n-1)(n-2).......(n-k+1)}{k!\cdot n^{k}\cdot (k+3)}$ Now How can i solve after that, Help required, Thanks |
Let us consider the integral $$\int \frac{x^2}{(x\sin x+\cos x)^2}\, dx$$ I have tried with the following way $\displaystyle \int \frac{x^2}{(x\sin x+\cos x)^2}\, dx$ $\displaystyle \Rightarrow \int \frac{x^2\sec^2 x}{(x\tan x+1)^2}\, dx$. How can I do the next step. | The question: Compute$$ \int \frac {x^2 \, \operatorname{d}\!x} {(x\sin x+\cos x)^2} $$ Tried integration by parts. That didn't work. How do I proceed? |
What my professor is telling us that there is no conduction current through a parallel plate capacitor but the current that is passing through capacitor is the displacement current and this phenomena can be seen in one of the Maxwell's equation. What I know about displacement current is that there is no charge movement in displacement current but I am so confused with that. Can some one explain me the displacement current and how does it work in parallel plate capacitor? | I am confused with this! How does a capacitor block DC? I have seen many circuits using capacitors powered by a DC supply. So, if capacitor blocks DC, why should it be used in such circuits? Also, the voltage rating is mentioned as a DC value on the capacitor. What does it signify? |
Is there a special name/word or popular phrase for the students who work part-time/full-time to generate income while at college or in school? | Is there a special word/name/phrase for the money/income generated by a student while he is in college by working part time? |
I've read multiple answers regarding this question here on stack flow but still I want some clarification on my case. I want to apply for UK standard visa next year to sit some tests. One of the most important things as I understood was bank statement and other things that prove you have ties to your country that will force you to return to your country by the end of the visit. My income is about $1650 monthly from 2 jobs and my wife's income is $800 monthly from 1 job in a public hospital. I work in a public hospital as a doctor earning $750, and as part-time pharmaceutical salesperson in a private company earning $900. I can provide a proof for my income from my job in the hospital with all legal certification and stamps from a governmental regulating body, but not from my second job since I can't authorize or certify the letter from my employer because it's not a properly regulated business in my country and there are no official documents regarding this, I can only provide a simple letter in English language from this employer explaining (my role, my salary, the period I've been employed) with their stamp only but no other official stamp from a governmental or a regulating body. My bank account currently have a $700 after I have drawn about $6000 for house renewals. I will restart depositing money again next month, and I want to reach like $12000 by next year to appear financially stable and capable. So what are my options? Can I declare I have 2 jobs and I can deposit like $1250 monthly? Or keep my second private job a secret and that I only earn $750 monthly and deposit a monthly amounts of $500-$600 in proportion to this income? Should I deposit and draw money regularly, or can I explain that I deposit about 75% of my monthly income because I keep %25 of it as it's enough for my monthly living specially that I live in family-owned house and I don't pay any rent? Is it enough for me to have a bank statement so me and my wife can travel together to UK, or we should have separate accounts and both present a bank statement? Or we can have a joint account where we deposit like $1300 monthly together and both apply to visa using a bank statement for this joint account? I'm short of time and need to do things properly and accurately starting next month so please help me. | The UK Visas and Immigration Directorate publishes that provides helpful tips that can result in successful visa applications. Section 2 of this guidance opens is entitled "other documents you may want to provide" (emphasis mine). Section 2: other documents you may want to provide – all visitors This section provides guidance on the types of documents that you may want to provide to help us consider your application against the Immigration Rules. Previous travel documents/passports, which show previous travel. Financial documents showing that you have sufficient funds available. These must clearly show that you have access to the funds, such as: bank statements building society book proof of earnings such as a letter from employer confirming employment details (start date of employment, salary, role, company contact details) where a third party (who is either in the UK or will be legally in the UK at the time of your visit) is providing financial support to you e.g. a business, a friend or a relative, documents to show that they have sufficient resources to support you in addition to themselves and any dependant family should be provided The first item is "bank statements" and this ties in with the , which says... evidence that you can support yourself during your trip, eg bank statements or payslips from the last 6 months (Note 'eg' is a Latin abbreviation meaning "for example"; this appears to be optional rather than a fixed requirement.) Question: How should someone interpret this such that the chances of success are maximized? How many statements should I submit? What are they looking for and what do my bank statements tell about me? |
Let's say I have two internal HDDs and configure Windows to place pagefiles on both of them. How do pagefile writes occur? Are pagefile writes spread evenly across the disks? Does Windows prefer accessing the higher-performing disk (perhaps measured through pagefile I/Os)? Does Windows access them sequentially, starting on disk #1, and only proceeding to the pagefile on the second disk when the first is full? Why I ask: If there are two disks with greatly different performance characteristics (a 5.4K HDD and 15K HDD, for example), it could potentially be a detriment to place a pagefile on both disks if the one on the higher-performing disk will never be accessed. | I cant find any documentation or articles online online for this... how does Windows handle page files on multiple hard drives? Does windows treat them as a concatenation, writing to one till its full then moving to the next? Or does it treat them like a stripe, writing to each one incrementally? Does it write to the first one free? Or perhaps some other method? |
Once we know that the problem needs to be solved using supervised learning, how do we know if we have to use regression analysis or classification algorithm to solve it? Is there some thumb rules that can be used? Most of the resources online give the standard example of prices of house for regression model and malignant/benign cancer plot for classification model. This isn't helping me much. Is there come conceptual method to analyze the given problem? | I understand classification....a discrete response or category, like animal is dog or cat. The author says..."Regression techniques predict continuous changes such as the change in temperature, power demand, or stock market prices." I can't wrap my head around what he means. Thanks. |
I have a requirement to set URL expiration to 24 hours, but the system only lets me choose a timeframe between 60-730 days: Administrators can set links to expire in email sends at any point between 60 and 730 days or 2 years. I am trying to figure out an alternative way to make this work - any ideas or experience in this area? Please note that this is not a one-off send, where I could simply re-publish the landing page after 24 hours, this solution will be a part of an automated process. Thanks! | Is it possible in Marketing Cloud to set custom expiration which applies only to one particular URL? We include lots of different links in our emails, these have to stay valid as long as possible as direct to product pages and so on. But in one email we include a promotional link, which has to expire after 14 days. Is there any way to perform this setting on single-url-level? |
guys when does the deathclaws start attacking my Vault? Does it depends on gametime, Dwellers count or rooms count? Maybe something else? Thanks for answer! | I've been playing the Android version for a few days now, and have 33 Dwellers (slow growth FTW?) and I've noticed that I've never been attacked by the Deathclaws that I've heard about. Do the Deathclaws and other stronger enemies like Raiders with more guns or molerats only show up after a certain number of hours of Vault existence, or perhaps after your Vault reaches a certain number of Dwellers? |
Can you pick up a wild card from the discard pile with two wildcards from your hand to start a Canasta of wildcards? | If the player before you in canasta freezes the pile with a wild card, can you pick the pile up if you have two wild cards in you hand? Do you have to take the entire pile or just the wild card on top? |
Let n be a positive integer. Prove that: $\lfloor \sqrt{n}+\sqrt{n+1}\rfloor=\lfloor\sqrt{4n+2}\rfloor$ | This is from Apostol's book. Many of them seem tough and here is one of them which I am struggling with. For $n \in \mathbb{N}$, prove that this identity is true: $$\Bigl\lfloor{\sqrt{n} + \sqrt{n+1}\Bigl\rfloor} = \Bigl\lfloor{\sqrt{4n+2}\Bigl\rfloor}$$ |
I am a math PhD student in a US university and also a teaching assistant. This fall I’m expecting to apply for jobs. I’m looking for math lecturer/instructor jobs. However, when I worked as a teaching assistant I did not actually teach a course. Instead, I did recitations, grading and assisting. So I cannot get teaching letters from the department. Hence, I’m thinking to get letters from the instructors that I did recitations, who are postdoctoral fellows. Would it be disadvantageous to have recommendation letters from postdoctoral fellows rather than professors? EDIT: I don’t consider my post to be a duplicate because that post doesn’t solve my issue. It has inconsistent answers. One answer says Professor is better, other says postdoctoral fellow is better. Thank you. | I was guided by a Post-Doc for my undergraduate thesis, but the one responsible for all and offering the thesis was a Professor, who I only talked to when discussing the thesis, agreeing to it, and the explanation of the grade in the end. Who of both would be the one to ask for a letter of recommendation? More general, should you always ask the person with who one was mostly in contact during work, or the person responsible for it all, if they are not the same person? |
EDIT2: This was flagged as duplicate to a question about hyphenation in multi-language-documents. It is not. My document (60 pages) has just one language, but i have eleven such documents, in different languages. I noticed the problem in the danish version. My question relates to the traceability of the hyphenation rules, i.e., how can i find out which rule is followed to what point, rather like in a debugger for a programming language. ORIGINAL QUESTION: I inherited a very complex latex document (50+ files, class-file, ...). In this document, some expressions are written in CamelCase, and i wanted to employ \hyphenation{Camel-Case} to make sure the expression only gets cut at that one specific position. In at least one case, the expression is cut like this: Came-lCase. If i put the above command exactly in front of the line containing the offending expression, the expression is cut correctly. I checked the spelling of this instance, and made sure it's actually the very same character-encodings as any other instance. So my thinking is that somewhere along the line the hyphenation command gets countermanded. My question is twofold: how can i find out where the command ist countermanded (without trial& error) is there a way to make that command more countermand-proof? EDIT: I just realized that the sentence runs: "[...] yada yada CamelCase." and that only the dot at the end makes the difference between obeying the hyphenation-command and not obeying it (but that should not impact hyphenation-rules, should it? The dot adds length, but should not make the expression different). The specific document is using\usepackage[danish]{babel} , as the main difference to other documents of the same structure (same content rendered in eleven different languages and therefore babel-packages) - apart from the content being in different languages, of course... | This question led to a new feature in a package: By default, (La)TeX fails at hyphenating some words, e.g., the English word potable (should be pot-able) or the German word Mor-dop-fer (murder victim, should be Mord-op-fer). There are two strategies to achieve correct hyphenation: adding a "hyphenation exception" list for the document's main language in the preamble with \hyphenation{pot-able}; using pot\-able at every instance in the document body. (This is also the only resort for words that already contain hyphens.) But what to do in case of multi-lingual documents? As \hyphenation only works for the main document language, must one fall back to manual hyphenation correction in the document body for other languages? Or is it possible to specify separate hyphenation exception lists for the respective languages? \documentclass[draft]{article} \usepackage[ngerman,english]{babel} \begin{document} The language is \languagename\ (correct hyphenation is \verb|pot-able|): XXXX XXXX XXXX XXXX XXXX XXXX XXXX XXXX XXXX X potable \selectlanguage{ngerman} The language is \languagename\ (correct hyphenation is \verb|Mord-op-fer|): XXXX XXXX XXXX XXXX XXXX XXXX XXXX XXXX XXXX Mordopfer \end{document} |
I'm trying to repair Ububtu 15.10 crash/lockup boots up with no icons on screen, many repairs did not sove this problem, so created a dvd install for 15.10. But after all this, It comes back with "the root filesystem on /dev/sd1 requires a manual fsck." How does one do this ? I'm not a software dev/writer etc | I dual boot Ubuntu and Windows 7. I was browsing on FireFox in Ubuntu and all of a sudden I get some error message, so I rebooted. Now when I try to boot into Ubuntu I get this message: fsck from util-linux 2.26.2 /dev/sda6 contains a file system with errors, check forced. /dev/sda6: Inodes that were part of a corrupted orphan linked list found. /dev/sda6: UNEXPECTED INCONSISTENCY; RUN fsck MANUALLY. (i.e., without -a or -p options) fsck exited with status code 4 The root filesystem on /dev/sda6 requires a manual fsck Busybox v1.22.1 (Ubuntu 1:1.22.0-15ubuntu1) built in shell (ash) Enter 'help' for a list of built-in commands. (initramfs) _ How can I fix this? |
Find all continuous functions that satisfy the Jensen inequality(I don't know why the problems states ''inequality'') $$f(\frac{x+y}{2})=\frac{f(x)+f(y)}{2}$$ I've checked around stackexchange and google a bit, but none of the questions related to this problem gave me any hints on what I should do. The expression ''find all continuous functions'' confuses me. Am I supposed to determine some kind of a property that applies to all continuous functions that satisfy the property above or? Likewise there is a problem asking to find all continuous functions that satisfy$$f(x+y)=f(x)+f(y)$$ I'm sorry if this is a duplicate question, but even after reading all of those answers I've failed to find an adequate one. Also, another problem is that I'm not allowed to use derivations, and hence anything more complex than that. | Which functions $f:\mathbb{R} \to \mathbb{R}$ do satisfy $$f\left(\frac{x+y}{2}\right) = \frac{f(x)+f(y)}{2}$$ for all $x,y \in \mathbb{R}$ I think the only ones are of type $f(x) = c$ for some constant $c\in \mathbb{R}$ and the solutions of the Cauchy functional equation $f(x+y) = f(x)+f(y)$ and the sums and constant multiples of these functions. Are there other functions which are both midpoint convex and concave? |
Can someone please tell me what purposes logarithms have in the everyday world? What non-theoretical applications are they in and when would one use them? | I am trying to gain a more intuitive feeling for the use of logarithms. So, my questions: What do you use them for? Why were they invented? What are typical situations where one should think: "hey, let's take the $\log$!"? Thanks for the great comments! Here a short summary what we have so far: History: Logarithms were first published 1614 by John Napier (mathematician/astronomer) . He needed them for simplifying the multiplication of large numbers. Today’s uses: In regression analysis: If you expect a predictor variable to follow a power/exponential law, take the corresponding logarithm to linearize the relationship. In finance to calculate compound interests. Or more general: to calculate the time variable in growth/decay functions. (Nuclear decay, biological growth…) In computer science to avoid underflow. (Cool trick! But seriously: 32-bit? Take a double ;-) In the Prime Number Theorem For handling very large/small numbers (pH, etc.) Plotting (if your scale gets too large) |
A great circle is a circle drawn on a sphere that is an "equator," i.e., its center is also the center of the sphere. There are $n$ great circles on a sphere, no three of which meet at any point. They divide the sphere into how many regions? (The Art and Craft of Problem Solving, Page $37$, Problem $2.2.14$) $2.2.12$ asks about the relation between vertices, edges and faces on a $3\text{-d}$ polyhedron, which is simply $V-E+F=2$. $2.2.13$ asks about the number of regions an infinite plane can be split into using $n$ non-parallel lines, no three of which meet at any point. Here I checked a few cases, determined that $k=1$ and used $V-E+F=1$ to find that $f(n)=\frac 12 (n^2+n+2)$ where $f(n)$ is the number of regions. For $2.2.14$, I am once again attempting to find $k$ such that I can use $V-E+F=k$. However, I am unsure how to define vertices or edges here. The few things I attempted all suggested different values of $k$ for different values of $n$. I am unsure as to how I can determine $k$, as well as defining how vertices and edges are counted. Additionally, it would be really helpful if there was a simple way to manually count the number of edges, vertices and faces, especially since making $4$ great circle on a sphere and reading the number of faces, vertices and edges using Geogebra $3\text{-d}$ was very difficult. | Find the recurrence relation satisfied by $R_n$, where $R_n$ is the number of regions into which the surface of a sphere is divided by n great circles (which are the intersections of the sphere and planes passing through the center of the sphere), if no three of the great circles go through the same point From: Rosen Discrete Mathematics textbook My attempt: I was unable to visualize these greater circles for values of $n \geq 4$. So, I launched GeoGebra and made the : My initial planes were $x=y$, $x=-y$, and the $z=0$ plane. Now, I added a fourth yellow plane $y=z$. However, I still find it hard to understand how to calculate what number of new sections are formed. I am able to calculate the number of new sections in this specific case, but, I am unable to arrive at a general formula for the new number of sections, through recurrence. I visited the following website - - which happens to have a solution, where they mention the addition of $2(n-1)$ regions to the existing regions, after the addition of the $n$-th plane. However, I am unable to understand why exactly that is true. |
Recently, I had to make a ruling that did not completely sit with me. The party's Evocation Wizard tried to cast a fireball on top of the party and claimed that due to their Sculpt Spells ability, nobody in the party took any damage. I looked up the definition from the rulebook which states this: Beginning at 2nd Level, you can create pockets of relative safety within the effects of your Evocation Spells. When you cast an Evocation spell that affects other creatures that you can see, you can choose a number of them equal to 1 + the spell’s level. The chosen creatures automatically succeed on their Saving Throws against the spell, and they take no damage if they would normally take half damage on a successful save. I interpreted this as simply stating, sculpt spells means creatures he chose, at MOST take half-damage (due to automatically succeeding saving throw) and IF they actually succeed on their saving throws, they will take NO damage. I felt like otherwise Evocation wizards will have absolutely no qualm in nuking their parties to take out enemies co-located with them with no penalty and with no limited resource. However the player who's wizard it is obviously counter-argued my approach. Is there some official guidance somewhere I missed on this issue? | According to an class feature, they can create pockets of safety that allow the chosen creatures to: ...automatically succeed on their saving throws against the spell, and they take no damage if they would normally take half damage on a successful save. I'm reading this to say: If there's a save, those in these 'pockets' automatically make it. If making a save would result in half damage, the 'pockets' take no damage. So, if I'm reading this correctly, why not just say that those in the 'pockets' take no damage if there's a save? Why all the extra words? When would someone in a Sculpt Spell's 'pocket of safety' take damage? |
I would deeply appreciate it if you would answer this question, since I do not know or understand exactly the difference between inductive reasoning and abductive reasoning, which is a problem for me in my next philosophy evaluations. | Consider this statement: Abductive reasoning typically begins with an incomplete set of observations and proceeds to the likeliest possible explanation for the set. But couldn't the same be said about inductive reasoning? Someone finds a penny in a jar. Then they find a second and a third penny, so they conclude that all the coins in the jar are pennies. Three pennies constitute an incomplete set, so how is that different from abduction? What example of abduction would complement the following two deduction/induction sets? DEDUCTION #1: All mammals have vertebrae; llamas are mammals. Therefore, llamas have vertebrae. INDUCTION #1: The first three bones found in Cave X were vertebrae. Therefore, the other bones may represent mammals. ABDUCTION #1: ??? DEDUCTION #2: All planets orbit stars. Earth is a planet. Therefore, Earth orbits a star. INDUCTION #2: Astronomers have pronounced Object X a planet. The nearby Object Z is also a planet. Therefore, Object X and Object Z probably orbit the nearest star. ABDUCTION #2: ??? |
I'm using ubuntu 20.04 now and I need to install cisco webex for important meetings but I'm unable to do it. So I would be super great and good if anyone in this community helps me out with this. I tried every method provided( only a few available in the internet), So please guys do help me with this. Thanks. | There is no one guide that I have tried that results in a fully working WebEx on Linux. Typically audio is the feature hardest to get working. How do I get WebEx working with audio on Ubuntu? |
Is it possible to construct a matrix with non-zero off-diagonal entries whose eigenvalues are nonetheless equal to its diagonal entries? EDIT: @ajotataxe pointed out that this holds for triangular matrices. My follow up is - is the converse true? If the Eigen values are the diagonals, does it have to be triangular? | I want to learn about matrices whose diagonal elements are the eigenvalues... but the matrix is neither diagonal nor triangular. Is there a term for such matrices, and have they been researched? |
I need to add multiple images with image descriptions form wp admin. Admin Form: <label for="image[]">Image</label> <input type="file" name="image[]"/> <label for="imgdesc[]">Description</label> <input type="text" name="imgdesc[]"/> <label for="image[]">Image</label> <input type="file" name="image[]"/> <label for="imgdesc[]">Description</label> <input type="text" name="imgdesc[]"/> . . . // number of image and description is dynamic <?php wp_nonce_field('image', 'image_upload_nonce'); ?> Here my PHP code during form submission. <?php if (isset($_POST['image_upload_nonce']) && wp_verify_nonce($_POST['image_upload_nonce'], 'image')) { require_once( ABSPATH . 'wp-admin/includes/image.php' ); require_once( ABSPATH . 'wp-admin/includes/file.php' ); require_once( ABSPATH . 'wp-admin/includes/media.php' ); //Here my doubt to handle multiple images $attachment_id = media_handle_upload('image', 0); if (is_wp_error($attachment_id)) { echo $attachment_id->get_error_message(); } else { // The image was uploaded successfully! } } else { echo "The security check failed, maybe show the user an error."; } I don't know whether my approach is right. If not please correct me. | I have a WordPress form plugin and I use to upload the files and get there ids directly and attached its ids to the post as a meta date, I used the following to did that: The HTML of the form field is: <input type="file" name="my_file_upload" id="my_file_upload"> And the php code was: $attach_id = media_handle_upload( 'my_file_upload', $post_id ); if ( is_numeric( $attach_id ) ) { update_post_meta( $post_id, '_my_file_upload', $attach_id ); } And everything was work perfectly. Now I am trying to upload multiple files my HTML code is: <input type="file" name="my_file_upload[]" id="my_file_upload[]" multiple="multiple"> But I cant make the media_handle_upload function work with multiple files upload. Any help will be appreciated. |
So this is what I see now, but I cant get the bottom part (that's orange right now) to be viewed normally again, like the top part. I have no idea how this happened and I tried to google the problem but I am unsure what has even happened so I don't really know what to look for. Can anyone explain what I can do to fix this? Please keep in mind that I'm a beginner. | I'm new to Blender and this site, so I apologize in advance if I'm not following any of the proper etiquette. I'm no artist, but I'm trying to learn Blender so that I have some programmer art for me to work around in Unity. I followed a tutorial for making a basic human model, I rigged it with rigify, and now I'm starting to export it following yet another tutorial. The thing is, when I was trying to rig the model, I couldn't get the model to go transparent so that I could see the bones inside the model. Eventually, I managed to get it into wireframe mode, but I can't get it back into solid mode. It's probably just a display thing and not a property of the model itself, but I want to be sure. I'm looking at the display options under the "Figure" pane in Blender, and none of the Display check boxes are checked, including the one that says "Wire". I don't want to import a plain wireframe model into Unity, and even if that doesn't happen, this is functionality of Blender that I should really know anyway, so I'd appreciate any help that anyone has to offer. If necessary, I can upload the .blend file, but I'm not sure what site people would prefer that I upload it to. |
I a trying to grep for certain string after issuing the grpck -n ALL command so when trying grpck -n ALL | grep -i format, for example, I still see the whole output and not just the lines containing the format string. I know I could direct the output to a file and use grep on that file but it has to be an easier way. The grpck is just an example as I have noticed other commands that don't support grep. | The script I use is actually returning this output: (source /Thetra/Commun/env_ora.sh >/dev/null; sh aclenv/arun) geIlgif0t1 -DVORACLE geIlgif0t1 prg_25900: ACOMP=X geAhadlAd1 -DVORACLE geAhadlAd1 prg_25948: ACOMP=A syCcgge0t1 -DVORACLE syCcgge0t1 prg_26023: ACOMP=S2 syVcalq0t1 -DVORACLE syVcalq0t1 prg_26071: ACOMP=Y syVvali0t1 -DVORACLE syVvali0t1 prg_26119: ACOMP=Y syAedit0t1 -DVORACLE syAedit0t1 prg_26167: (1312) DBMS WARNING: Column not found in table. (-11238) RETURN (-6) END END END IF cm_para_f2('VDEF','abQtip_0n1','unicite',syAedit0t1:$v_unicite)<>0 OR null_convert$(syAedit0t1:$v_unicite,'R') <> 'F' THEN SET syAedit0t1:$v_unicite TO 'R' SET $v_tips_mrgl TO 'S' SET $v_rfbt_iban, $v_rfbt_intitule, $v_orga_creancier, $v_orga_tip_adr1, $v_orga_tip_adr2, $v_orga_tip_adr3, $v_code_docu, $v_tips_centre, $v_code_etab, $v_orga_tip_emetteur, $v_orga_emetteur, $v_rfbt_compte, $v_orga_banque, $v_rfbt_emetteur TO SELECT rfbt_iban, rfbt_intitule, orga_creancier, orga_tip_adr1, orga_tip_adr2, orga_tip_adr3 ACOMP=N syAvali0t1 -DVORACLE syAvali0t1 prg_26215: (2751) DBMS WARNING: Column not found in table. (-11238) + to_string_using$(str_to_val$(substr$(clip_str$(to_string$($f_imme_no)),1,4)),'&&&&') + to_string_using$(str_to_val$(substr$(clip_str$(to_string$($f_sepa_propriete_no)),1,5)),'&&&&&') IF syAvali0t1:$v_unicite ='R' THEN SET $v_sepa_rum3 TO $v_sepa_rum3 + substr$(to_string_using$(syAvali0t1:$v_ordr_direct,'&&&&&&&&&'),7,9) ELSE ACOMP=N syAcalc0t1 -DVORACLE syAcalc0t1 prg_26263: ACOMP=N syAcalc0t2 -DVORACLE syAcalc0t2 prg_26311: ACOMP=N syAcalc0t3 -DVORACLE syAcalc0t3 prg_26359: ACOMP=N To check for errors I use the following command: (source env_ora.sh >/dev/null; sh aclenv/arun) | egrep '^ACOMP=$' Output: (1312) DBMS WARNING: Column not found in table. (-11238) RETURN (-6) END END END IF cm_para_f2('VDEF','abQtip_0n1','unicite',syAedit0t1:$v_unicite)<>0 OR null_convert$(syAedit0t1:$v_unicite,'R') <> 'F' THEN SET syAedit0t1:$v_unicite TO 'R' SET $v_tips_mrgl TO 'S' SET $v_rfbt_iban, $v_rfbt_intitule, $v_orga_creancier, $v_orga_tip_adr1, $v_orga_tip_adr2, $v_orga_tip_adr3, $v_code_docu, $v_tips_centre, $v_code_etab, $v_orga_tip_emetteur, $v_orga_emetteur, $v_rfbt_compte, $v_orga_banque, $v_rfbt_emetteur TO SELECT rfbt_iban, rfbt_intitule, orga_creancier, orga_tip_adr1, orga_tip_adr2, orga_tip_adr3 (2751) DBMS WARNING: Column not found in table. (-11238) + to_string_using$(str_to_val$(substr$(clip_str$(to_string$($f_imme_no)),1,4)),'&&&&') + to_string_using$(str_to_val$(substr$(clip_str$(to_string$($f_sepa_propriete_no)),1,5)),'&&&&&') IF syAvali0t1:$v_unicite ='R' THEN SET $v_sepa_rum3 TO $v_sepa_rum3 + substr$(to_string_using$(syAvali0t1:$v_ordr_direct,'&&&&&&&&&'),7,9) ELSE We can see that grep is returning non matching lines. When I redirect the stderr to stdout with this command: (source /Thetra/Commun/env_ora.sh >/dev/null; sh /Thetra/Oracle/transfert/P2016.H.1/aclenv/arun) 2>&1 | egrep '^ACOMP=$' As expected, the output is void. Why grep is returning non matching lines when stderr is not redirected ? |
I want to know how can I copy or shell copy multiple files within a bash script. What I mean is that cp /path/to/source/{file1,file2,file3} /path/to/dest and scp /path/to/source/{file1,file2,file3} user@host:/path/to/dest will work fine but as example #!/bin/sh scp /path/to/source/{file1,file2,file3} user@host:/path/to/dest will throw an error like this: /path/to/source/{file1,file2,file3}: No such file or directory If you will copy or shell copy a single file it works, so the problem are multiple files. Also it works if I would use * for all files but I do not want to copy all files. I should only copy selected files because in both folders are files with the same name but their content is different. Thereby to copy all files and then remove the not needed files would not work. For better understanding following would work: #!/bin/sh scp /path/to/source/file1 user@host:/path/to/dest Also following: #!/bin/sh scp /path/to/source/* user@host:/path/to/dest So it has something to do with the correct use of { ... } for multiple files which will work inside the terminal but not if I run the bash script in it. Thanks in advance. //Edit: I add the error if I try it with cp: cp: cannot stat '/path/to/source/{file1,file2,file3}': No such file or directory | Do I have to do any configuration to start brace expansion? When I run mkdir {1..10}, it just creates a dir naming {1..10}. |
We know, according relativity theory, no information or matter can travel with velocity bigger than light. However, consider the following situation: a completely empty water hose is hypothetically connected between the sun and the earth. After this, we turn on the water hose until it stay completely full, next we turn off. When we turn on again here on the earth, the water will arrive instantly on the sun in order a person there, to receive instantly the information that the water hose was turned on here on the earth. This case, the information travel with velocity bigger than light, violating the relativity theory. How can this happen? | Is it possible for information (like 1 and 0s) to be transmitted faster than light? For instance, take a rigid pole of several AU in length. Now say you have a person on each end, and one of them starts pulling and pushing on his/her end. The person on the opposite end should receive the pushes and pulls instantaneously as no particle is making the full journey. Would this actually work? |
I have issues with a cell in google apps script where if a cell = "0:00" it needs to equal some text like "Unexcused Absence". when I run the code it gives me a blank cell. function Boh() { var sheet = SpreadsheetApp; var ss = sheet.getActiveSpreadsheet().getActiveSheet(); var lastRow = ss.getLastRow(); var spreadsheet = SpreadsheetApp.getActive(); var b = 0; var wCell = 'Work'; var x = new Date('3/16/2013 0:00:00'); for(var i=2;i<=lastRow;i++){ ss.getRange(i,10).activate(); if(x.setHours(0,0,0,0) == ss.getRange(i, 17).getValue() && 'Work' == ss.getRange(i, 5).getValues()){ ss.getRange(i, 10).setValue('Unexcused Absence'); } } | Can someone suggest a way to compare the values of two dates greater than, less than, and not in the past using JavaScript? The values will be coming from text boxes. |
I'm using the template %% bare_jrnl_compsoc.tex %% V1.3 %% 2007/01/11 %% by Michael Shell %% See: %% http://www.michaelshell.org/ %% for current contact information. which can be downloaded from here: for my paper. It works fine, except for one thing: I would like to use the descriptionenvironment, but the result is quite a mess: The underlinings are not a problem; they will be erased later. However, it seems that the description environment has a problem if the word after \item[THIS WORD]is too long. Is there any easy fix for this? Thank you for your help! | I'd like to use a description environment together with the IEEEtran document class. One of the labels is actually quite long (three words) so I need to use \IEEEsetlabelwidth to avoid having the text and the label overlap. As apparently it determines the indentation of the whole text and not just the text on the first line, I get a skinny column that spans over a large number of lines. \begin{description}[\IEEEsetlabelwidth{Very long label}\IEEEusemathlabelsep] \item[Very long label] this text is spanning over multiple lines. Since the label was very long and the label determined the indent of the text it really covers a large number of lines. \end{description} The result is something like Very long label this text is spanning over multiple lines. Since the label was very long and the label determined the indent of the text it really covers a large number of lines. While I would like something like Very long label this text is spanning over multiple lines. Since the label was very long and the label determined the indent of the text it really covers a large number of lines. I don't have specific requirements for the body of the text, but it'd be nice if it was consistent across the several descriptions of the document (it is not the case at the moment). I have tried to read the documentation of IEEEtran, but I'm quite confused. |
South Africans are visa exempt for Ireland for 3 months. However, if connecting in the UK on the way there, they have to clear UK immigration as Ireland is in the CTA. The states the following regarding South Africans going to Ireland via the UK: You’ll usually need to apply for a UK standard visitor visa; ; You might be eligible for ‘transit without visa’ if [...] [you] have the right documents for your destination (for example a visa for that country) and You must also have an Irish biometric visa (marked ‘BC’ or ‘BC BIVS’ in the ‘Remarks’ section) and an onward flight ticket to the Republic of Ireland. The second and third statements overlap but differ: the second statement implies you just need to have the right papers to enter Ireland (for a South African, a passport), while the third statement specifically says you need an Irish visa to connect the UK visa-free. Judging by the first and third statements combined, it would appear that a South African, despite being visa exempt for Ireland, would need either a UK Standard visitor visa or an Irish visa if connecting in the UK. Is this the case? | I am Lebanese Citizen and am planning a trip to Ireland this month. A valid Irish visa is already in hand and I am willing to reach there through the UK. Will I need a transit visa in the UK for few hours for flight connections to Ireland? |
Just noticed the Unicoins ad on the site and spent some time breaking rocks. Since it popped up 'today' (April 01) I am sure it isn't legit. BTW, I bought 'no downvotes please' so please don't downvote ;) Before it goes away! This is what it looked like. | Recently I saw a widget on the Stack Overflow website which says Stack Overflow now has its own currency called "unicoins". According to this widget, a user can earn reputation, customize Stack Overflow by changing its colors and the user can also remove the vote down button from their questions and answers by spending "unicoins". This widget does not look real, because this is out of standard of the Stack Overflow website. Also today is 1st April. Is Stack Overflow fooling us? |
$f'(0)$ when $f(x)=x^2\sin(1/x)$, $f(0)=0$ This is presented as an MCQ and answer is given as "$f$ is differentiable at every $ x$ but $f'$ is discontinous at $0$ " I calculated LHD and RHD at $0$ as $0$ and $f'(x)=2x\sin(1/x)-\cos(1/x)$ which is not defined at 0 thus the answer should be "$f$ is not differentiable at $0$" Is this a misprint or am I missing something? | Assume this function has a value $0$ at $x=0$. If the right hand derivative of a derivable function is equal to the right hand limit of the derivative function (same for the left), why aren't functions like the one above continuously differentiable? For a function to be continuous, limits should be finite and equal to value at that particular point. For this function derivative using first principle yields $0$. The RHD, LHD is $0$, I think. So why isn't the derivative continuous? For finding the RHD and LHD, I have seen answers resorting to using known derivatives. My question is: why don't we use the first principle itself? Why do we get different answers then? |
I am using the Android SE app. I want to know if my connection to Stack Exchange encrypted? Thanks. | I’d like to know the transmission of SE Android app is encrypted or not with https. Please make me confirm. |
After downloading and extracting them, how do I install the CMAKE binary files in Ubuntu 14.04 so that they're recognized with cmake --version? | Default cmake version of 14.04 is 2.8. How can I install cmake 3.2 and replace the default one? Or how can I upgrade 2.8 to 3.2? |
If $\alpha$ is a real root of the equation $x^5-x^3+x-2=0$, find the value of $\lfloor\alpha^6\rfloor$, where $\lfloor x\rfloor$ is the least positive integer not exceeding $x$. My approach is to bound the value of $\alpha^6=\alpha^4-\alpha^2+2\alpha$. First I proved the function $f(x)=x^5-x^3+x-2$ is monotone increasing by derivative. Then I argue that $1<\alpha<\frac32$ as $f(1)<0$ and $f(\frac32)>0$. Then I tried to create an upper and lower bound for $\alpha$, as such $$\alpha^6=\alpha^4-\alpha^2+2\alpha<\frac94\alpha^2-\alpha^2+2\alpha=\frac54\alpha^2+2\alpha<\frac{45}{16}+3=\frac{93}{16}$$ and $$\alpha^6=\alpha^4-\alpha^2+2\alpha>\alpha^3-\alpha^2+2\alpha=\alpha^2(\alpha-1)+2\alpha>2$$ Now we know that $\lfloor\alpha\rfloor\in\{2,3,4,5\}$. But I cannot proceed any further. Any idea, help, hint, or answer is appreciated. Thank you. | If $\alpha$ is a real root of the equation $$x^5-x^3+x-2=0$$ find the value of $\lfloor {\alpha}^6 \rfloor$. This one totally stumped me. We are asked to calculate $\lfloor {\alpha}^6 \rfloor$ without actually calculating the root or using wolfram alpha or any other calculator. I found that the above equation has only one real root by sketching its graph using calculus. I was also able to use the intermediate value theorem to conclude that $1<\alpha<2$ , but this is of little use while calculating $\lfloor {\alpha}^6 \rfloor$. Please help! |
Can open-circuit voltage be treated as voltage to find power dissipated? I combined all the resistors (including Vlamp) to get one resistor of 40/6 Ohms (Correct me if I'm wrong). Using Ohm's law to find the current doesn't work since I don't know the voltage, Thus the title. I don't think so but I wasn't taught this in detail and Googling doesn't benefit since Wikipedia has a page I already figured out that: Battery has open circuit voltage of 4V R1 = 5 Ohms R2 = 5 Ohms k = 0.2A/V When lamp on and Vlamp = 2V, Rbat = 10 Ohms The lamp turns on if the voltage across the lamp is greater than 2V. When the lamp is on it has an internal resistance of 10 Ohms, and when it is off it acts like an open circuit. This is what I calculated: I'm getting Ilamp as 1/5, still trying to see how that will help... EDIT: My answer has been suggested as a duplicate. Is it the same question? NO. Is it the same answer? NO. The only thing that is the same is the circuit, any objections? | This is my circuit. I need to find the power dissipated by Vlamp. So the lamp turns on if the Vlamp is more than 2V. When the lamp is on it has an internal resistance of 10 Ohms, and when it is off it acts like an open circuit. How would I find the power dissipated? I know how to do it for Voltage sources and Resistors, but not elements like these. One more thing, I already figured out that: Battery has open circuit voltage of 4V R1 = 5 Ohms R2 = 5 Ohms k = 0.2A/V When lamp on and Vlamp = 2V, Rbat = 10 Ohms . |
Is there tool or application that can set the brightness of the screen below the system minimum? | I have an Optimus Elite, and it has a minimum brightness setting. In certain apps, I can reduce the brightness below the safe minimum, but when I leave the app, the brightness is increased to the system-wide minimum. Using , I can permanently set the brightness below the safe amount, and it will stay even after going to other apps. Or using , I can accomplish almost the same thing even without needing root (it displays a translucent 'filter' over the whole screen, reducing brightness/contrast but not actually changing the backlighting power amount). What I want to know is where the minimum screen brightness is stored. I have a rooted phone with CyanogenMod 9, so I have permissions to edit anything and could change a config or sqlite entry, but I don't know where this value is stored. What I would like to do is use the status bar brightness slider to be able to slide to the actual minimum of the screen, rather than the OS-controlled minimum. Having an app is useful, but having the functionality without the app seems to be within reach, if only I knew where the OS is getting it's safe minimum setting. Where is this "safe minimum brightness" setting stored? If I can change it, I can remove my apps and use native controls. |
Here I am taking the definition of isomorphism to be an injective homomorphism. Suppose we have two finite fields of the same characteristic, $\mathbb{F}_{p^n}$ and $\mathbb{F}_{p^m}$ with $m<n$. Is there always an isomorphism $\phi:\mathbb{F}_{p^m}\rightarrow \mathbb{F}_{p^n}$? If $m|n$ then we could use the same construction $\mathbb{F}_{p^m}[X]/(P)$ where $P$ is an irreducible polynomial in $\mathbb{F}_{p^m}[X]$ such that $\deg(P)m=n$. Since this would produce a field of the same characteristic and cardinality, it would provide an isomorphism. Does anyone have any references on this topic? Thanks in advance. | Blue was correct, I need to fix my understanding of this: Finite fields have cardinality of a prime order because they have a prime subfield that has finite characteristic. I do not completely understand why finite field of each characteristic is unique. Perhaps we look at a polynomial and express the finite field as a splitting field? And we use uniqueness of splitting fields? Then, why is it that $\mathbb F_{p^m} \subseteq \mathbb F_{p^n}$ if and only if $m$ divides $n$? |
Need help with include vs. includes: He's had hits with a massive number of artists that include so-and-so, so-and-so, and so-and-so. Or should it be includes, agreeing with the word "number"? | This is from a recent article: He was rushed to the hospital immediately and a battery of tests was conducted. Now shouldn't it be He was rushed to the hospital immediately and a battery of tests were conducted. Which is correct and why is it correct? :) |
Error mounting /dev/sda2 at /media/lubia/Media: Command-line mount -t "ntfs" -o "uhelper=udisks2,nodev,nosuid,uid=1000,gid=1000,dmask=0077,fmask=0177" "/dev/sda2" "/media/lubia/Media"' 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/sda2': 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. | Whenever I boot Ubuntu, I get a message that it cannot mount my windows partition, and I can choose to either wait, skip or manually mount. When I try to enter my Windows partition through Nautilus I get a message saying that this partition is hibernated and that I need to enter the file system and properly close it, something I have done with no problem so I don't know why this happens. Here's my partition table, if any more data is needed please let me know. Device Boot Start End Blocks Id System /dev/sda1 2048 20000767 9999360 83 Linux /dev/sda2 20002814 478001151 228999169 5 Extended /dev/sda3 * 478001152 622532607 72265728 7 HPFS/NTFS/exFAT /dev/sda4 622532608 625141759 1304576 82 Linux swap / Solaris /dev/sda5 20002816 478001151 228999168 83 Linux |
I'm lost not sure what to do here.... I don't know how to configure my secure booting options. I don't which setting to change? | After installing the Windows 10 upgrade on my laptop, it ruined the grub boot manager, and I could only boot in windows 10. I fixed the boot manager using a live cd with the boot-repair tool, but it only recognized the Ubuntu partition, and not the Windows one. So I edited the /etc/grub.d/40_custom file and added the following contents: menuentry "Windows 10" { set root='(hd0,3)' chainloader +1 } After running sudo update-grub2, I got an entry in the boot menu, but the partition does not load. It gives the following error: Error: Invalid signature. Does anybody know how one can overcome this error? My most recent boot-repair dump is here: , and the partition I want to boot is this one: sda4: __________________________________________________________________________ File system: ntfs Boot sector type: Windows 8/2012: NTFS Boot sector info: No errors found in the Boot Parameter Block. Operating System: Boot files: /bootmgr /Windows/System32/winload.exe |
ok I know this is backwards but after spending half a day doing a clean install of Windows and updating drivers I'd prefer to not have to repeat the process. I'd like to simply partition my SSD in half. Can I do this properly AFTER having already installed windows? is there a recommended(no malware) 3rd party app that can accomplish this? | I have just bought an HP laptop with Windows 7 (64 bit). It has a 500 GB HDD with three partitions: a small hidden system partition, a 12 GiB HP recovery partition, and a 450 GiB C: boot partition. I would like to split this large C: partition into two partitions, leaving only 100 GiB for the system, and giving the rest to a new data partition. Although the Windows built-in Disk Management utility has an option to shrink the bootable partition, it only allows me to shrink it roughly by half, even though only 20 GiB on the partition is used. As far as I understand, system unmovable files lie in the middle of the partition, preventing Disk Management utility to do what I want. And since new HP laptops don't come with OS installation disks (they only allow you to create recovery disks yourself), I can't just repartition HDD and then reinstall OS. So, is there a way to shrink the C: bootable partition and preserve Windows 7 working? P.S.: I have tried to use the third-party utility, and after shrinking the partition, Windows 7 stopped booting, with a . System recovery didn't work, and I had to do factory recover. Since this is a long process, I would like to avoid doing it again :) So, please, suggest only proven solutions. |
I have the following: list = ["player1", "player2", "player3"] I want to find all possible combinations of two elements of that list, but with no duplicates. I have tried to work with the itertools.combinations() but without the desired result. I'm looking for a result like this: player1, player2 player1, player3 player2, player3 Can someone help me in the right direction? Thanks in advance | I have a list with 15 numbers in, and I need to write some code that produces all 32,768 combinations of those numbers. I've found (by Googling) that apparently does what I'm looking for, but I found the code fairly opaque and am wary of using it. Plus I have a feeling there must be a more elegant solution. The only thing that occurs to me would be to just loop through the decimal integers 1–32768 and convert those to binary, and use the binary representation as a filter to pick out the appropriate numbers. Does anyone know of a better way? Using map(), maybe? |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.