body1
stringlengths 20
4.1k
| body2
stringlengths 23
4.09k
|
|---|---|
This is python 3.5 under Lubuntu. I'm creating a two-dimensional list of 0's (8 x 64) and then I assign a value to each position (dirty and fast way to store a cryptographic transformation, I'm just prototyping). When I try to retrieve the value stored in any position I get a different value than the one I stored (see doctest at the end of the code). I'd like to know what's happening and why I'm not getting the results I'm expecting (if I can't find a solution I'm going to change it to a huge if-elif block). _taulesS = 8 * [64 * [0]] _taulesS[0][0] = 14 _taulesS[0][1] = 0 _taulesS[0][2] = 4 _taulesS[0][3] = 15 ... _taulesS[0][13] = 13 _taulesS[0][14] = 8 _taulesS[0][15] = 1 _taulesS[0][16] = 3 _taulesS[0][17] = 10 _taulesS[0][18] = 10 _taulesS[0][19] = 6 ... _taulesS[0][62] = 0 _taulesS[0][63] = 13 _taulesS[1][0] = 15 _taulesS[1][1] = 3 _taulesS[1][2] = 1 _taulesS[1][3] = 13 ... _taulesS[1][62] = 15 _taulesS[1][63] = 9 _taulesS[2][0] = 10 _taulesS[2][1] = 13 ... _taulesS[7][59] = 5 _taulesS[7][60] = 5 _taulesS[7][61] = 6 _taulesS[7][62] = 8 _taulesS[7][63] = 11 def taulesS(s, value): """ >>> taulesS(0, 17) 10 Doctest fails, taulesS(0, 17) returns 12 """ return _taulesS[s][value]
|
I needed to create a list of lists in Python, so I typed the following: my_list = [[1] * 4] * 3 The list looked like this: [[1, 1, 1, 1], [1, 1, 1, 1], [1, 1, 1, 1]] Then I changed one of the innermost values: my_list[0][0] = 5 Now my list looks like this: [[5, 1, 1, 1], [5, 1, 1, 1], [5, 1, 1, 1]] which is not what I wanted or expected. Can someone please explain what's going on, and how to get around it?
|
Calculate the determinant of this magic square (which is from Albrecht Dürer's Melancholia) $$\begin{pmatrix} 16 & 3 & 2 & 13 \\ 5 & 10 & 11 & 8 \\ 9 & 6 & 7 & 12 \\ 4 & 15 & 14 & 1 \end{pmatrix}$$ I'm very unsafe about the term "magic square" and I couldn't find much reliable information on the internet either about calculating their determinant.. : / Wikipedia says: A magic square is a $n \times n$ square grid (where $n$ is the number of cells on each side) filled with distinct positive integers in the range $1,2,.., n^2$ such that each cell contains a different integer and the sum of the integers in each row, column and diagonal is equal [...]. All in all, I don't really see a difference between a normal square matrix and a magic square when it comes to calculate their determinants. Am I right? If this is the case, I would just calculate the determinant of this magic square by using formula of Laplace choosing the first column of the magic square as pivot column. I did it on paper and I get $$\det =0$$ So basically my question is: When I got this magic square, can I consider it as a normal square matrix when it comes to calculating its determinant? Or do you calculate its determinant completely different?
|
The determinant of even-magic square matrix is 0. For example, this 4x4 magic square matrix: {{16, 2, 3, 13}, {5, 11, 10, 8}, {9, 7, 6, 12}, {4, 14, 15, 1}} And this 6x6 matrix: {{35, 1, 6, 26, 19, 24}, {30, 5, 7, 21, 23, 25}, {31, 9, 2, 22, 27, 20}, {8, 28, 33, 17, 10, 15}, {3, 32, 34, 12, 14, 16}, {4, 36, 29, 13, 18, 11}} So is true for 8x8,10x10... Is there anything special here? Is it possible to recognize this kind of matrix and conclude that its determinant is zero? Reference for magic square matrix:
|
I have to evaluate a function (3x-2) in a interval [-10,10] with precision increments from 1, 0.1, 0.01, 0.001, 0.0001, etc. I tried this a=1.0 for x in range(1,40): for y in range(-10,10,a): c=3(x)-2 print(c) a=a/10 (The first for is because I need to get 40 decimals) But I got this error for x in range(-10,10,a): TypeError: 'float' object cannot be interpreted as an integer Thanks for the help.
|
Is there a way to step between 0 and 1 by 0.1? I thought I could do it like the following, but it failed: for i in range(0, 1, 0.1): print i Instead, it says that the step argument cannot be zero, which I did not expect.
|
I have .NET dll and I would like to know what platform was used to build. (x86, x64 or Any CPU) if it is debug or release version. Is there a way how to find this information? Thank you. (I'm trying to play with TFS build server and would like to verify, that my dll are build as I want)
|
I've got an arbitrary list of .NET assemblies. I need to programmatically check if each DLL was built for x86 (as opposed to x64 or Any CPU). Is this possible?
|
Could you please tell me how to go back to my old android? I have a Samsung S5 and I tried the factory reset and that did not work. I hate this new android version
|
Is it possible to downgrade from Android version 4.0(ICS) to 3.0(Honeycomb) after upgrading to ICS? Can any one help me.
|
I am trying to prove the set $W=\{(a_n) | \sum a_n^2 <∞\}$ is subspace of vector space $V=\mathbb{R}^∞$ (vector space of all sequences of real numbers) For this, clearly as $0^2+ 0^2+...=0 <∞$ Hence (0) is in $W$. Further, if $(a_n), (b_n) \in W$ then we have $\sum a_n^2<∞$ and $\sum b_n^2<∞$. How can I prove $\sum (a_n+b_n)^2<∞$
|
So I know that $\sum x_n^2$ converges, and $\sum y_n^2$ converges. ${x_n}$ and ${y_n}$ are both sequences of real numbers. How can I prove that $$\sum(x_n+y_n)^2$$ converges? So far I have $$\sum(x_n+y_n)^2=\sum(x_n)^2 +\sum (y_n)^2 +\sum(2x_ny_n)$$ so I need to prove that $\sum 2x_ny_n$ converges. Is this the right way to approach it? If it is, I am completely lost as to the next step. I also need to prove that $$\sqrt{\sum(x_n+y_n)^2}\leq \sqrt{\sum(x_n)^2}+\sqrt{\sum(y_n)^2}$$ I assume this will follow pretty easily from a result in the first proof, but I'm stuck on that now, and perhaps it is easier to start with the second one. I have a lot of work I've done on the first problem, but none of it seemed to go anywhere. Any hints? Thanks!
|
I am learning Python by trying to code up a simple adventure game. I have created a while loop to get a choice of direction from the user and I am clearly not doing it in an efficient way. I have created a while loop with multiple 'or' conditions to keep looping until the user provides one of the four valid directions as input. Unfortunately this extends the line beyond 80 characters with the tab. What is the best way to either break this line onto two lines so as not to get a syntax error or write this sort of loop more efficiently? while direction != "N" or direction != "S" or direction != "E" or direction != "W": if direction == "N": print "You went N to the Mountain Pass" return 'mountain' elif direction == "S": print "You went S to the Shire" return 'shire' elif direction == ... When I try to break the first line into two, no matter where I break it I get a syntax error... File "sct_game1.py", line 71 while direction != "N" or direction != "S" or ^ SyntaxError: invalid syntax I'm open to suggestions on how to break the line successfully, or even better, writing this loop more efficiently. Thanks.
|
I have a long line of code that I want to break up among multiple lines. What do I use and what is the syntax? For example, adding a bunch of strings, e = 'a' + 'b' + 'c' + 'd' and have it in two lines like this: e = 'a' + 'b' + 'c' + 'd'
|
Silus died during a Dawnguard quest because Serana killed him. I've tried searching his body, but it had nothing on it.
|
I am playing through Skyrim on the Xbox 360 and have 49/50 achievements competed. Earlier in the game, to gather a 1000 gold bounty in every city, I went into Dawnstar and slaughtered the first few guards I saw. Without realizing it, my companion killed the leader of the museum. My last achievement, "Oblivion Walker", was to complete 15 Daedric quests. I completed 14/15, and then saw that I still had "Pieces of the Past". I went to try and start the quest, but was unable to. I searched through Dawnstar, but could not visit the measure any longer. Do I need to restart my game from a previous save before my companion slaughtered the museum leader? If so, do I need to have all 15 done at the same time, or will I get the achievement upon completion of that quest?
|
My sis and I really want to play together in Minecraft but she always gets lost in public ones plus I get lag. I really want to play with her. How can it just be us and no one else?
|
I went to multiplayer and pressed "New Server" I entered the name I want it to be and the address. I pressed done but it said "hostname not available"
|
I am close to starting a new website for a small business which imports products from USA to Australia. The wholesaler says he will allow my client to be the sole distributor for Australia & New Zealand. I'm not sure what CMS or shopping cart software to use yet, but it will need to include an affiliate system to allow advertisers to push customers our way. Do you have any suggestions for robust, flexible affiliate software?
|
This is a general, community wiki question to address non-specific "I need a CMS or Wiki that does x, y, and z..." questions. If your question was closed as a duplicate of this question and you feel that the information provided here does not provide a sufficient answer, please open a discussion on . I have a list of features that I want for my website's Content Management System (CMS) - where can I find a [free] script that includes all of them?
|
When I add data to my db Russian letter are converted into some kind of symbols like this: давид. Same with Georgian language. I use PHP to insert data from web to db. In html charset is utf-8 and also in database Collation is set to utf8_general_ci. How can i fix it?
|
I'm setting up a new server and want to support UTF-8 fully in my web application. I have tried this in the past on existing servers and always seem to end up having to fall back to ISO-8859-1. Where exactly do I need to set the encoding/charsets? I'm aware that I need to configure Apache, MySQL, and PHP to do this — is there some standard checklist I can follow, or perhaps troubleshoot where the mismatches occur? This is for a new Linux server, running MySQL 5, PHP, 5 and Apache 2.
|
I just installed Ubuntu 20.04 and a lot of weird things start to happen including: 1. Files from my previous OS (xubuntu) were not deleted, although i've deleted and created new partitions while installing Ubuntu 20.04 and 2. I can't select all files or all folders on Desktop! I can do it within folders but I can't use for example Ctrl + A on desktop, I can't even select all the files with a cursor, it only selects one! Please help me.
|
In Ubuntu 20.04, on the desktop, there is a number of actions I wish I could do, such as, by order of importance : use keyboard shortcuts such as select all, copy / paste. use drag & drop with icons deactivate the "mouse over" highlight, and restrict the clicking area to only the icon, not the surrounding square To put it simply, I'd like to have the exact same features as offered by the desktop of Ubuntu 18.04 (probably related to a specific version of GNOME, and not Ubuntu itself). Am I missing something obvious here? I actually see no reason why those actions are removed or deactivated on the desktop, since they all work in any Nautilus window.
|
Let $x,y$ be positive real numbers with $1<x<y$ and $x^y = y^x$. Prove ${\bf carefully}$ that $x<e<y$. My attempt to the solution. Notice that if $x^y = y^x$ we can write it as $\dfrac{\ln x }{x} = \dfrac{ \ln y }{y} $ because $x,y$ are both more than 1.We know that the function $f(t) = \dfrac{ \ln t }{t}$ is maximal at $t = e$. Thus, $\dfrac{ \ln y}{y} \leq \dfrac{ \ln e }{e} = \dfrac{1}{e} $ and so $$y \geq e \ln y $$ Now, if $e \geq y$, then $\ln y \leq 1$. I can't seem to see a contradiction from here. Any hint?? Next, Notice that $\dfrac{\ln x }{x} < \dfrac{1}{e}$ then clearly $\boxed{x<e}$. But, I am still stuck on showing $y>e$.
|
We know that $2^4 = 4^2$ and $(-2)^{-4} = (-4)^{-2}$. Is there another pair of integers $x, y$ ($x\neq y$) which satisfies the equality $x^y = y^x$?
|
I am getting a System.IO.FileNotFoundException when trying to open a StreamReader on a file that exists in the same directory as Program.cs. try { using (StreamReader sr = new StreamReader("file.txt")) { ... } } The word file in question exists within the same directory as the program source code. I am using Visual Studio 2019 and this is a simple command line project. So why can't C# find this file, despite it being in the same directory? It doesn't help that Visual Studio won't show me the whole stack trace, but only the one line error.
|
How do I find out what directory my console app is running in with C#?
|
I have a war record book belonging to a German man from WW1. I would like to contact his family if possible to return it. What is the best way to go about this?
|
I am looking for information on Heinrich Märte (my grandfather) and his family. He was born on July 1, 1912 in Sipplingen and died On April 19, 1944 when the military plane crashed in Geierswalde because its engine failed. I am not sure if his family knows that he fathered my dad. I am hoping someone knows of him or his family. I would love to know how he met my grandmother or any further information on him. We have always had two photo's of him, but never knew his name. We have only just found out about him and it has opened so many more questions. How can I determine Heinrich's parents and siblings, and then locate any living family members?
|
I'm using a X server which doesn't implement the XKB extension (it is VNC, but I don't think it matters, my vncviewer is running on Windows XP, I don't think it matters either). I've set up a Compose aka Multi_key key. By setting the XLOCALEDIR and LC_??? environment variables, I'm able to point to a Compose file to which I've added some key combinations. They are working in some programs (xev, emacs, kate, konqueror) and not others (firefox, OpenOffice, gnome-text-editor). The applications who aren't working have their own set of compose combinations. They aren't taking the locale into account to choose the Compose data base. Modifying the system provided one on another machine where I've root access hasn't any effect on them. The fact that it is working with xev makes me think that the basic settings are correct and it is the non working applications which aren't take them into account. Does someone know how I may persuade them to do so without having root access?
|
I used Gnome for a long time, but preferred vanilla X input method (xim) over the default GTK behaviour. I just set GTK_IM_MODULE and QT_IM_MODULE environment variables to xim, and didn't have any problem with multiple-layout config, Compose key, custom ~/.XCompose and misc:typo typography extensions. Recent Gnome 3.6 completely screwed keyboard input by shipping a half-baked and buggy ibus . I just couldn't get the keyboard working as well as before (even with ibus disabled), and had to abandon Gnome completely. Now I use a simple window manager, and configure my keyboard with setxkbmap. While the keyboard works well again, I couldn't get the Compose key working everywhere. Compose works in plain X11 apps (xterm), but it doesn't work in neither GTK2, nor GTK3, nor Qt apps. I use current Archlinux versions: xorg-xinput 1.6.0 xorg-server 1.13.1 xf86-input-keyboard 1.6.2 gtk2 2.24.14 gtk3 3.6.4 qt 4.8.4 and enable Compose key like this: setxkbmap ... -option 'compose:menu' and export GTK_IM_MODULE, QT_IM_MODULE variables: $ echo $GTK_IM_MODULE $QT_IM_MODULE xim xim Compose key is properly recognized by X11: $ xev | grep -A2 --line-buffered '^KeyRelease' | sed -n '/keycode /s/^.*keycode \([0-9]*\).* (.*, \(.*\)).*$/\1 \2/p' 135 Multi_key It works properly in xterm, sequences from my ~/.XCompose included. It doesn't work in either GTK or Qt apps. Let say, if I enter Compose ', then apps echo ' immediately, without waiting for the third key in the sequence. Now I suppose something has changed in either Xorg (because Compose doesn't work in Qt apps either), or in GTK and Qt. *_IM_MODULE variables are not enough now. What else is required to make modern GTK and Qt recognise xim and its Compose sequences? P.S. There is a similar (and unanswered) question about . Unlike the asker, I don't have ibus installed.
|
What is the license for Consolas font? Can it be used for commercial applications and/or embedded? I tried to find it but couldn't find any. There's a "request quote" on the Microsoft website and that's all I could find, nowhere that says "you need to pay to use it"
|
I've noticed that most custom fonts include a license.txt file that requests some amount of money for a commercial license. I am interested in whether it is also necessary to license OS (Mac/Windows) included fonts for commercial use. As a side question, is font theft an issue in the industry?
|
Is there some special property of '$e$' which makes it suitable to be used as a base for logarithms? Moreover, does the natural logarithm possess some advantage over the common logarithm? I don't understand why there is a need to choose an irrational number, '$e$', for a base. Isn't it much simpler to use 10 as a base?
|
There are so many available bases. Why is the strange number $e$ preferred over all else? Of course one could integrate $\frac{1}x$ and see this. But is there more to the story?
|
I told Dogmeat to stay outside this raider building because even though he has armor I don't want him to die. After I came out I searched the area and I couldn't find him. I think if he's told to stay somewhere he won't show up when you fast travel and I tried one post that said to hit ~ and then type prid0001d162 and then hit enter and then type moveto player and then hit ~ again to leave. But when I first typed in prid0001d162 and hit enter it said "Script command prid0001d162" not found." What do I do?
|
I recently dismissed Dogmeat in favor of Codsworth, and I'm fairly sure I sent him to Sanctuary Hills. However, I've had a fairly detailed look around the place and I haven't found him yet. Does anyone know where he is?
|
I'm fairly new to this site, I've used it a lot for research, but never actually created an account until just recently, and so far, it doesn't seem to be very self-explanatory. I wanted to check my reputation, but it's not labelled anywhere on my profile, I was thinking it might be the little coin with the number next to it at the top of the page, but I just wanted to make sure. Is this correct? And if not, how can I check my reputation? Edit: Also, do you have a separate reputation for each community?
|
When I visit the reputation tab of my profile, I see a lot of stuff. I can make out some of it, but not all. What do all the event types mean? Why do some events show an odd reputation gain or not show any reputation change at all? Why are some events sometimes highlighted in yellow? My reputation suddenly dropped, but I don't see anything. What happened? Why do some events disappear from my reputation history?
|
I'm calling the sleep command from awk like so: system("sleep 15m") and found that when I interrupt that with CTRL-C it only interrupts the sleep command, not the script. So I tried wrapping the system function in an if statement, as suggested and further explained . It then looks like if (system("sleep 15m") != 0) exit 1. That didn't work, so I tried print system("sleep 3"), which always returns 0, contrary to the stated behavior. Typing sleep 3 then echo $? in the shell produces 0 if I let it run and 130 if I interrupt it. So what am I missing? I've checked for typos several times, tried the --posix and --traditional switches, and studied the user's guide, nothing changes it. $ awk --version GNU Awk 4.1.3, API: 1.1 (GNU MPFR 3.1.4, GNU MP 6.1.0) Copyright (C) 1989, 1991-2015 Free Software Foundation.
|
I'm having an issue with the following piece of (G)AWK script: do { ... } while (system("sleep 10")) My intention is to break the loop when the user presses ^C during the sleep, but it's not working. I believe the problem is that Bash exits with 0 when interrupted with ^C, at least when it's executed by AWK's system(): $ awk 'BEGIN { print "\n" system("sleep 2") }' (let the sleep complete) 0 $ awk 'BEGIN { print "\n" system("sleep 2") }' ^C 0 Why is it so? Is this a bug in Bash or in (G)AWK? Is there a simple solution that doesn't involve complicated Bash-specific syntax like trap? The best I could come up with is this: do { ... } while (42 == system("sleep 10 && exit 42")) which still looks like a kludge to me.
|
i am trying to count number of bits in 64 bit integer but it shows some unexpected.here is the code. counting bits is was not the major part but some unexpected output is....plz have a look on input and output!!!! #include<iostream> #include<math.h> #include<stdint.h> #include<cstdio> using namespace std; int64_t t,n,ans; int main(){ cin>>t; while(t--){ int64_t ans=0; cin>>n; /* while(n>0LL){ n>>=1LL; ans++; }//*/ ans=floor(log2(n)); //ans=floor(log2l(n)); cout<<ans<<"\n"; } return 0; } the input and output is this 10 18446744073709551615 63 (number of bits in 18446744073709551615) should be printed only once and console should be waiting till i input another number and the count the number of bits in other number.but it is not happening.The output comes is like this.... 63 63 63 63 63 63 63 63 63 63 plz help me ragarding the same.
|
8 bits representing the number 7 look like this: 00000111 Three bits are set. What are algorithms to determine the number of set bits in a 32-bit integer?
|
In Game of Thrones S08E05 The Bells, when the Lannister soldiers drop their weapons & ring the bells indicating their surrender, Daenerys still decides to burn Kings Landing to the ground using Drogon. A large number of people seem to agree that this is a character assassination on the part of D&D (Dan Weiss & David Benioff). In Inside The Episode, they indicted that Daenerys has made this a personal matter rather than just the business of War. Right from the beginning of S08, we are shown how nobody in Westeros loves her. Even her advisors serve her out of duty & not love. She loses Jorah & Missandei, her closest friends and now she's all alone. In E05, she says to Jon as nobody loves her, she will choose fear. In early seasons, when Daenerys sees the vision in House of the Undying, she's in the throne room with snow falling. Everyone assumed it was snow but now, after seeing Arya's scene at the end, we know it wasn't snow but ash falling. So, it was a prophecy. In the last episode, we see Daenerys talking about her destiny. So, is Daenerys's decision to burn down Kings Landing consistent with her character arc right from S01? Or was this character assassination on part of D&D? Was Daenerys Targeryean the Queen of Ashes all along?
|
In S08E05 of Game of Thrones, Dany decides to torch Kings Landing and all the innocent people in it. She is angry and can't seem to hold back her rage, and apparently taken with the madness that afflicts Targaryens. But why does she attack the city and the people first? Why not go after the cause of all her woes, Cersei, who's right there in front of her, whilst Dany looks directly at the Red Keep where Cersei is standing. Dany knows that Cersei doesn't care about the inhabitants of King's Landing. She can't be killing them just to cause Cersei pain. And in doing so she gives Cersei plenty of time to escape, missing her best opportunity.
|
I wanna prove this problem. I tried it with Mean Value Theorem but cannot proceed to any plausible result. So could I have some hints?
|
Let $f:\mathbb{R} \to \mathbb{R}$ be a twice differentiable function. And let $$\eqalign{ & M_0 = \sup \left|f(x)\right| \cr & M_1 = \sup \left|\frac{d}{dx} f(x) \right| \cr & M_2 = \sup \left|\frac{d^2}{dx^2} f(x) \right| \cr }$$ Prove that $$M_1 ^2 \leqslant 4M_0 M_2$$ I can not think how I can relate these values in some inequality )=
|
I posted this question earlier but I like to repeat it again. I have 50 folders. Each folder consists of 40 rasters. Each raster has a value that I need to extract. These rasters share the same x&y. Finally, I need to put them all in one data frame. To do so, I tried to run a loop to read all rasters from all folders and combine them by row. For example, I have 50 Rain rasters, so these will fall under the same column and so on. Is there any way to do that? Here are the codes: Reading <- function(raster) { df <- stack(raster) } All_raster <- dir("E:/50_folders/", recursive=TRUE, full.names=TRUE, pattern=".tif$")# This is to read rasters from 50 folders All_tif <- sapply(All_raster, Reading) ALl_tif <- as.data.frame(All_tif , xy =TRUE) And this is the error I get Error in as.data.frame.default(x[[i]], optional = TRUE) : cannot coerce class ‘structure("RasterStack", package = "raster")’ to a data.frame
|
I could read many rasters as one list of ratsers but when I want to convert them to data frames I get an error. Is there any way to convert them? library(raster) Pro <- function(s) { df <- stack(s) } files <- dir("path", recursive=TRUE, full.names=TRUE, pattern=".tif$") agg <- sapply(files, Pro) df <- as.data.frame(agg)
|
I'm trying to prove that: $$F\,\{f'(x)\} = -i\omega F(\omega) \qquad (1) $$ where $\, F(\omega) = F\,\{f(x)\}$ This is my procedure so far: $$F\,\{f'(x)\} = \frac{1}{\sqrt{2\pi}} \int_{-\infty}^{\infty} f'(t)e^{i\omega t} dt$$ Integrating by parts I obtained: $$=\frac{1}{\sqrt{2\pi}} \big[ \space f(t) e^{i\omega t} \space \big|_{-\infty}^{\infty} - \int_{-\infty}^{\infty} i\omega f(t)e^{i\omega t} dt \space \big]$$ Now, in order to (1) to be true I need to get: $$ f(t)e^{i\omega t} \space \big|_{-\infty}^{\infty} =0 \qquad (2)$$ I developed it and got the following: $$ f(\infty)e^{i\omega \infty} - f(-\infty)e^{-i\omega \infty } = f(\infty)e^{i\omega \infty} - 0= f(t)e^{i\omega \infty} $$ I undarstand that the second term is $0$, since f(t) must have a value to accomplish Dirichlet conditions (and $e^{-\infty} = 0$), but I don't see how $ f(\infty)e^{i\omega \infty}$ is $0$.
|
Consider a function $f(t)$ with Fourier Transform $F(s)$. So $$F(s) = \int_{-\infty}^{\infty} e^{-2 \pi i s t} f(t) \ dt$$ What is the Fourier Transform of $f'(t)$? Call it $G(s)$.So $$G(s) = \int_{-\infty}^{\infty} e^{-2 \pi i s t} f'(t) \ dt$$ Would we consider $\frac{d}{ds} F(s)$ and try and write $G(s)$ in terms of $F(s)$?
|
What do you call someone who has passed deadline or someone who should return book to the library, but has passed due date?
|
What is the correct word to describe the people who have not finished their work after the deadline? For the antonym, there is finisher, but I can't find *unfinisher in the dictionary.
|
The following is an extract from my LaTeX file which describes a table. The table has a fair amount of space below it. I would, therefore, like to increase the arraystretch. However, by increasing it slightly, the table moves to the next page. Why does LaTeX think the table is too big for the first page? How can I force it to put the table right after the text? Thanks! \documentclass[a4paper,12pt]{article} \usepackage{amsmath,graphicx,fullpage,microtype,hyperref,subfig,hypcap,amsfonts,parskip,multirow,titlesec} \titlespacing\section{0pt}{20pt plus 4pt minus 2pt}{2pt plus 4pt minus 2pt} \titlespacing\subsection{0pt}{16pt plus 4pt minus 2pt}{2pt plus 4pt minus 2pt} \widowpenalty=2000 \clubpenalty=2000 \hyphenpenalty=400 \interfootnotelinepenalty=400 \DisableLigatures{encoding=*,family=*} \numberwithin{equation}{section} \hypersetup{colorlinks,citecolor=black,filecolor=black,linkcolor=black,urlcolor=black} \begin{document} \section{Payoff Matrix} \label{sec:Payoff Matrix} From the brief description in section~\ref{sec:Model and Assumptions} and the full description of section~\ref{sec:Extensive Form}, it is straight forward to create the payoff matrix, which shows the expected payoff to the sender and to the receiver as a function of their strategies. \vspace{6mm} \begin{table}[h] \small \renewcommand\arraystretch{1.05} \begin{center} \begin{tabular}{l||lr|lr} &\multicolumn{2}{c|}{AA}&\multicolumn{2}{c}{AK}\\ \hline \hline \multirow{2}{*}{GGGG}& &$1$& &$1$\\ &&&&\\ &$p$& &$p$& \\ \hline \multirow{7}{*}{GGGB}& &$p(1-e_{1})+$& &$p(1-e_{1})+$\\ & &$p(e_{1})(1-e_{3})+$& &$p(e_{1})(1-e_{3})+$\\ & &$(1-p)(e_{1})+$& &$(1-p)(e_{2})+$\\ & &$(1-p)(1-e_{1})(1-e_{3})$& &$(1-p)(1-e_{2})(e_{3})$\\ &&&&\\ &$p(1-e_{1})+$& &$p(1-e_{1})+$& \\ &$p(e_{3})(1-e_{3})+$& &$p(e_{1})(1-e_{3})+$& \\ &$(1-p)(1-e_{1})(e_{3})$& &$(1-p)(1-e_{2})(e_{3})$& \\ \hline \multirow{4}{*}{GGBB}& &$p(1-e_{1})+$& &$p(1-e_{1})$\\ & &$(1-p)(e_{1})$& &$(1-p)(e_{2})$\\ &&&&\\ &$1-e_{1}$& &$p(1-e_{1})+$& \\ &$ $& &$(1-p)(1-e_{2})$& \\ \hline \multirow{4}{*}{GBGB}& &$x$& &$x$\\ & &$x$& &$x$\\ &&&&\\ &$x$& &$x$& \\ &$x$& &$x$& \\ \hline \multirow{7}{*}{GBBB}& &$x$& &$x$\\ & &$x$& &$x$\\ & &$x$& &$x$\\ & &$x$& &$x$\\ &&&&\\ &$x$& &$x$& \\ &$x$& &$x$& \\ &$x$& &$x$& \\ \hline \multirow{2}{*}{BBBB}& &$0$& &$0$\\ &&&&\\ &$1-p$& &$1-p$& \end{tabular} \end{center} \caption{The payoff matrix} \label{eq:Label} \end{table} \end{document}
|
How to influence the position of float environments like figure and table in LaTeX? This is a general question and should collect useful answers for all users. I hope we can use this as a reference
|
As defined in this thread I would like to see a derivation of the closed form soft-thresholding solution for the LASSO using the KKT optimality conditions. Does anybody know how to do it?
|
For the lasso problem $\min_\beta (Y-X\beta)^T(Y-X\beta)$ such that $\|\beta\|_1 \leq t$. I often see the soft-thresholding result $$ \beta_j^{\text{lasso}}= \mathrm{sgn}(\beta^{\text{LS}}_j)(|\beta_j^{\text{LS}}|-\gamma)^+ $$ for the orthonormal $X$ case. It is claimed that the solution can be "easily shown" to be such, but I've never seen a worked solution. Has anyone seen one or perhaps has done the derivation?
|
"He looked the same as her" or is it "He looked the same as she" I thought the rule was to complete the clause to figure this out such as "He looked the same as she looked" in which case the answer would be "she" but I'm fighting this conclusion because it just sounds wrong.
|
He was almost as bad at English as me. He was almost as bad at English as I. The first one sounds better as-is, but not when you change the second one to He was almost as bad at English as I was. Which is correct?
|
I would like to place an image in the corner of each page. Something like this: But I want a different image on each page. The images are numbered. For example, page 1 gets image 1.png in the corner, page 2 gets 2.png, et cetera. I try to avoid to include each image by hand. The document is large, and I would like to avoid including and positioning 200 images by hand. Is this possible, and how?
|
I am right now writing my master thesis in computer science about a visualization topic. Since the core stuff of my thesis is a complex 3D visualization that only quite sends its message through user interaction (click/drag/turn to view from different angles), my only option to get this message across on paper would be a bunch of screenshots. 30 screenshots side by side or spread across a couple of pages should be ok, but I thought it'd be rather nice to have some kind of flipbook where the screenshots are in a specific spot spread on consecutive pages. Is this a good idea at all? For now this is what I am using: \usepackage[automark]{scrpage2} \ofoot[\pagemark]{\pagemark} since there are less screenshots than pages of my thesis I would start these on some specific page in the middle of the thesis (is that even a good idea, I'm starting to doubt this whole thing...) like this: \cfoot[{ \IfFileExists{pics/s\thepage.png}{ \raisebox{-40mm}{\includegraphics[trim = 40mm 40mm 40mm 40mm,clip,height=40mm]{s\thepage.png}}}{\raisebox{-40mm} {}} }]{ \IfFileExists{pics/s\thepage.png}{ \raisebox{-40mm}{\includegraphics[trim = 40mm 40mm 40mm 40mm,clip,height=40mm]{s\thepage.png}}}{\raisebox{-40mm} {}} So as you see I was putting the screenshots in the footer, which is also not ideal ( ideal would probably be an area on the lower right of the page where the screenshots would go and the text would wrap around, but I don't know how to do that). So with this in place I can not really control the footer. the \pagemark jumps lower or highter when the pages start with the screenshots in the footer compared to those without screenshots, and also the sceenshots will end up very close to the text - I'd like to see a larger space there but I can't control the footer height. What to do? I'm thankful for every input, also for people telling me: "don't do this!" ( or the contrary) EDIT: just so you know what I'm talking about: These are microstructures. The thick brownish/pink lines represent grains in copper. the greyish thing in the middle is the separating interface between the two grains. The thinner lines form a grid representing the crystal orientations. This output is quite customizable, I could change colors, switch of either grid, change the grid density and obviously change the view. I was just now thinking of including for each grid one set of 3 thick Arrows that the eye could make out easier on paper. I'll probably do this. Also, I'll probably not go this way of doing the flipbook somewhere in the footer or margin, but actually put just a few of these shots consecutively as figures in the appendix.
|
I have a jQuery script that shows an animated counter on page, but the script starts on page load, and I need it to be loaded when the user scrolls down to a specific <div>. <script> $({countNum: $('#counter').text()}).animate({countNum: 63 }, { duration: 3000, easing:'linear', step: function() { $('#counter').text(Math.floor(this.countNum)); }, complete: function() { $('#counter').text(this.countNum); } }); </script> This script need to be executed when I scroll to this specific <div> on a page. <div id="counter"></div>
|
I'm loading elements via AJAX. Some of them are only visible if you scroll down the page. Is there any way I can know if an element is now in the visible part of the page?
|
I have a Hexagon turned into a curve shape, and I'm trying to make the sphere go follow the curvature, I add the array and curve modifier then select the Hexagon but the sphere shape gets distorted. I also added more segments in case it would correct this issue, but the sphere shape becomes even worse. How can I fix this? Thank you.
|
I have a chain object. And i have a curve it follows. I got it to work for following curve, but chain object is not circles but both parts are more like stretched circles (ovals). Object i made with 2 toruses one rotated 90 degrees and then joined them together. I tried single torus too. But same issue. on a curve it just looks stretched oval. What can be the issue? Thanks
|
Is it possible to put the list of figures and tables onto consecutive pages? The default configuration inserts a white page between both lists. \listoffigures \listoftables I have found to put the list of figures and tables onto one page, but what I'd like is to clear the page after the list of figures.
|
I am using book environment. Between \listoffigures, \listoftables, \printglossary[glossaryname]s and appendices, I need a normal \clearpage between them (not a \cleardoublepage). I still need to define these as chapters for document style consistensy and \cleardoublepage between normal chapters.
|
if(.is-open close-now){ jQuery(".extra_div").click(function($){ alert('"Sorry, this takeaway only accepts orders during its opening hours"'); }); } I think something like the above is what I need but I don't know how the if statement part should work out. I'm looking to check if a certain div is present and then if it is, run the following jQuery on click code. Update 1 if ($(.is-open close-now).length){ jQuery(".extra_div").click(function($){ alert('"Sorry, this takeaway only accepts orders during its opening hours"'); }); } The two divs are is-open open-now - open .is-open close-now - closed
|
How can I check the existence of an element in jQuery? The current code that I have is this: if ($(selector).length > 0) { // Do something } Is there a more elegant way to approach this? Perhaps a plugin or a function?
|
i m planing to buy a point and shoot digital camera, there are two options in nikon, i like both the cams but i am confused in one matter. the details are as follows. nikon cool pix l820 - max shutter speed 1/1500 and minimum shutter speed of 4 sec nikon cool pix l820 - max shutter speed 1/4000 and minimum shutter speed of 1 sec so if i purchase the first one(which is in my budget) what will be the effect of shutter speed on the photos. please reply as soon as possible
|
If I use a shutter speed below 1/30 on my Nikon P100, I get extremely dark images which are completely unusable. If I use the flash, it comes out fairly bright but just not natural. My camera supports shutter speeds as fast as 1/2000 and as slow as 8 seconds. How do I use them correctly? What should I take into account before shooting, what else do I have to configure or use?
|
I just made a to flag a "thank you" answer. But this is what I got when I clicked "flag": This is a brand new account. What happened? Update: this issue also occurred on Physics SE. It hasn't affected Stack Overflow or Lifehacks SE.
|
I spotted a (10k-only by now) and when I went to flag it, the flag dialog told me that I'd already flagged it as VLQ: The thing is, I'd never seen this post before. And a look at the flag history in my user profile confirms that I haven't flagged a post since yesterday: Certainly, well before the 2015-02-04 05:36:21Z time of Mr. Miracle's post. I was able to reproduce this on SO from the VLQ review queue: when you're presented with an answer, click on link at the right side of the page, then click flag. You get the "you have already raised this type of flag" message on either the "it is not an answer" or "it is very low quality" options, I gather depending on the original flag that pushed the post into the VLQ queue.
|
I want to grep across 500 files in a Maildir directory. I issued the command grep MyPattern * I got the error message: bash: /usr/bin/grep: Argument list too long So I stored the list of files in a file MyFiles, and issued the following for i in $(`cat MyFiles`); do echo $i; done Before I did a grep, I wanted to do an echo just as a check. But this gave the following error bash: 1434361691.M617282P6399V0000000000000808I00000000000E16C1_23.ananda-linux,S=10055:2,S: command not found where that 1434... thing is the first file in the directory. So back to the original question. How do I grep across all these files in the mailbox. And I have larger mailboxes containing 50000 or more emails.
|
I have directory with cca 26 000 files and I need to grep in all these files. Problem is, that I need it as fast as possible, so it's not ideal to make script where grep will take name of one file from find command and write matches to file. Before "arguments list too long" issue it took cca 2 minutes to grep in all this files. Any ideas how to do it? edit: there is a script that is making new files all the time, so it's not possible to put all files to different dirs.
|
There can be many nearby Pokémon in the list but one of them show before other in the right bottom corner without clicking on it and it's mostly one of the unlocked one. So is there any significance of changing it?
|
At the bottom right of the playing screen, there is a small banner that displays 3 Pokémon. Selecting it brings up a screen that details all the nearby Pokémon. Previously caught Pokémon show in full colour, uncaught Pokemon show as a silhouette, and doubles can be displayed. When I select any of these Pokémon and click the footprints the Pokémon becomes circled in purple on the previously mentioned banner. Why would I want to "watch" a Pokémon in this way? I have observations and assumptions, so far, but nothing concrete.
|
how to self-detect when it has overflowed the value (32 bit signed integer) of an int variable. Can I add some conditional logic (an if statement) that breaks the loop when overflow is detected. #include<iostream> using namespace std; int factorial(int n){ if (n== 1){ return 1; } else { return n * factorial(n-1); } } int main() { for (int i = 0; i < 20; i++) { cout << i+1 <<"!:" << factorial(i+1) << endl; } system("pause"); }
|
I was writing a program in C++ to find all solutions of ab = c, where a, b and c together use all the digits 0-9 exactly once. The program looped over values of a and b, and it ran a digit-counting routine each time on a, b and ab to check if the digits condition was satisfied. However, spurious solutions can be generated when ab overflows the integer limit. I ended up checking for this using code like: unsigned long b, c, c_test; ... c_test=c*b; // Possible overflow if (c_test/b != c) {/* There has been an overflow*/} else c=c_test; // No overflow Is there a better way of testing for overflow? I know that some chips have an internal flag that is set when overflow occurs, but I've never seen it accessed through C or C++. Beware that signed int overflow is undefined behaviour in C and C++, and thus you have to detect it without actually causing it. For signed int overflow before addition, see .
|
I cannot get to open my Python scripts saved in default directory: ....\QGIS\QGIS3\profiles\default\processing\scripts in QGIS 3.0 Processing Toolbox. There is no folder called Scripts like in 2.18. Anybody knows how to open my Python script in Processing Toolbox of 3.0?
|
A simple script created within the QGIS 2.18 processing toolbox: ##example=string print example Upon running would produce and input box in a window with a run button: Once executed would produce the expected print in the python console When testing the same code in QGIS-3.0, changing the print to python 3's print(), I get an error where the input section is seemingly ignored as a comment: Does the processing framework no longer accept inputs in this way?
|
In minecraft it says I can't play games because I have to update my client. Also, 2 of the servers say X-1.6.2 so am I in 1.6.3? It also says that I can't play some servers because they are 1.6.4. How can I update Minecraft?
|
I tried connecting to a server this morning but it said "outdated client". I understand that that means I have to get Minecraft 1.6.4 but I have no clue how to do it. I tried getting it on Minecraft.net but I couldn't find it. Please tell me how to download it and use it.
|
Is it possible to view all of my purchased DLC for a given game on Steam? I want to know which expansions I've already bought, and pulling up the game's DLC page lists all DLC without indicating which I have purchased, even when logged in. I don't want to go view each content's page to try and figure out if I have it or not, and I don't want to need to download the entire game to see what I have.
|
Assume you bought a game on steam and 7 out of 10 DLCs that are available for that game. When you go (in the steam application) to "LIBRARY" -> "game XY" -> "DLC", you get a list of all DLCs that are available for the game XY but none of the DLCs are marked as bought or not... (?!) At least I don't see any marks. If you click on a specific DLC though, you get "You already own XY", or the "Buy XY" depending on having/not having the DLC. Is there an easier way to find out which DLCs you are missing than clicking to each DLC? Perhaps a place (that I haven't found yet) with a list of all the DLCs available for that game and some small icons that would tell you if you have that DLC or not? I am asking because if a game has lots of DLCs, it is a bit tiresome to click and check all of them.
|
Let's say it would take the torture and death of 100 million people to find the cure for death and aging. The cure would be cheap and easy to make and is easily distributed to the rest of the world's population. With utilitarianism, it seems like it would be a morally just thing to do. Does utilitarianism have some kind of caveat to deal with that kind of situation? Are the rights of the few protected? A similar situation would be a doctor killing someone to harvest their organs to save the lives of multiple people. Is that morally just with utilitarianism?
|
Utilitarianism, when dealing with the question of what is the best course of action for a whole group (community, country, society as whole, etc...), states that the maximum benefit for the maximum number of people should be the decision criteria. "The well-being of the group is simply the sum total of the interests of the all of its members." But it seems to me that this would immediately lead to the justification of such scenarios as: Scientists are testing a new medical procedure or drug, and lab experiments or animal trials can't provide any conclusive results. It would then be ethical to force a small number of people to undergo clinical trials (with or without their consent), since this would lead to larger benefits to humanity as a whole. It would be ethical to euthanize severely disabled people, who cannot contribute meaningfully to society, and would require significant resources to be taken care of, since the people who have to take care of them would otherwise be happier. This would be especially true if they had no family who cared about them (i.e. whose happiness would be reduced by their death). Eugenics would be ethical. And all sorts of similar situations were one could argue that the needs of the many outweigh the needs of the few. Situations which I call "ethical totalitarianism" (if there is a more accurate term please correct me). My question is, how do utilitarians avoid justifying such scenarios? Or would a utilitarian say that these scenarios are indeed justified?
|
I've 8 bytes before encryption (for example: 01 02 03 04 05 06 07 08) and 8 bytes after DES encryption: 08 07 06 06 05 04 03 02 01. Is it possible to calculate the key?
|
I know DES is outdated, but will is is secure in CBC mode? Can anyone help me understand why not?
|
In Windows 10, Settings > Update & Security > Windows Update > Advanced Options > Choose when updates are installed, there are these two options: A feature update includes new capabilities and improvements. It can be deferred for this many days: [0-365] A quality update includes security improvements. It can be deferred for this many days: [0-30] Screenshot: Phrasing it with “can” is confusing, so I want to know exactly what that number does. If an update is released to my channel on day d, and I've set those options to n days, will the update be ... pushed to me on day d+n? pushed to me sometime between d and d+n, inclusive, at MS's discretion? offered to me on d, but I'll be able to dismiss it until d+n? Something else? Note that have instructions for setting these options, including and . None of those clearly state what effect the numbers have, just that they “defer updates by this many days”.
|
In Windows 10 version 1607, it was still possible to defer updates by a few months via the Local Group Policy Editor, but now there's a subfolder containing two entries where it's only possible to defer them by 30-60 days with a maximum of 365 days (timer has to be set anew every time). Am I seeing this correct or am I missing something? And what's the difference between feature and quality updates?
|
Do you lose privileges if you lose reputation (e.g. by spending it on bounties) and dip below what you had to reach to gain that privilege? Or, do you get to keep a privilege once it is earned no matter what?
|
For example, if your reputation starts above 50 and then falls below 50, do you lose the ability to leave comments? Or, are privileges forever, once earned?
|
Let $H$ be a proper subgroup of maximal order in a group $G$. Now suppose $H$ is solvable and normal in $G$ so there exists a series of normal subgroups: $1 = H_0 ⊲ H_1 ⊲ ... ⊲ H_n = H$, with $\dfrac{H_{j+1}}{H_j}$ abelian. Consider the cyclic group $<g>$ = $K$ generated by some $g\in G-H$. Now $HK = G$ by maximality of $H$. Thus $\dfrac{G}{H}\cong\dfrac{HK}{H}\cong\dfrac{K}{H∩K}$ wich is a quotient of an abelian group ($K$ is cyclic and hence abelian) so $G/H$ is abelian. We can now construct a series of normal subgroups as following: $1 = H_0 ⊲ H_1 ⊲ ... ⊲ H_n = H ⊲ G = H_{n+1}$ with $\dfrac{H_{j+1}}{H_j}$ abelian. So G is solvable. My question is, is there another way to approach this proof or in some way generalize it? Can we in some way have less restrictions on $H$ and still make the proof work for example?
|
I recently read the well known theorem that for a group $G$ and $H$ a normal subgroup of $G$, then $G$ is solvable if and only if $H$ and $G/H$ are solvable. In my book, only the fact that $G$ is solvable implies $H$ is solvable was proven. I was able to show that if $H$ and $G/H$ are solvable, then so is $G$, but I can't quite show that $G$ is solvable implies $G/H$ is solvable. My idea was this. Since $G$ is solvable, there exists a normal abelian tower $$ G=G_0\supset G_1\supset\cdots\supset G_r=\{e\}. $$ I let $K_i=G_i/(H\cap G_i)$, in hopes of getting a sequence $$ G/H\supset K_1\supset\cdots\supset K_r=\{e\}. $$ My hunch is that the above is also a normal abelian tower. However, I'm having trouble verifying that $K_{i+1}\unlhd K_i$ and that $K_i/K_{i+1}$ is abelian. Writing $H_i=H\cap G_i$, I take $gH_{i+1}\in K_{i+1}$ for some $g\in G_{i+1}$. If $g'H_i\in K_i$, then I want to show $g'H_igH_{i+1}g'^{-1}H_i$ is still in $K_{i+1}$, but manipulating the cosets threw me off. I also tried to use either the second or third isomorphism theorems to show that $K_i/K_{i+1}$ is abelian, but I'm not clear on how to apply it exactly. I'd be grateful to see how this result comes through. Thank you.
|
I have the following code: public string GetSetting(string setting) { return db2.ExecuteScalar<string>("SELECT VALUE FROM Setting WHERE SettingType = ?", setting); } public enum NOA { All = 0, Five = 5, Seven = 7, Nine = 9, Ten = 10 } public static partial class Extensions { public static string Text(this NOA noa) { switch (noa) { case NOA.Ten: return "10"; case NOA.Five: return "5"; case NOA.Seven: return "7"; case NOA.Nine: return "9"; } return ""; } } What I would like to do is to get the value of noa and cast it to a NOA. Here's what I have tried. But I get an error saying "String does not contain a definition for Value": NOA noa = (NOA)App.DB.GetSetting("NumberOfAnswers").Value; When I try this. I get an error saying "Cannot convert type string to Japanese.NOA: NOA noa = (NOA)App.DB.GetSetting("NumberOfAnswers"); Can someone tell me how I can get the value and put it into noa?
|
What's the best way to convert a string to an enumeration value in C#? I have an HTML select tag containing the values of an enumeration. When the page is posted, I want to pick up the value (which will be in the form of a string) and convert it to the corresponding enumeration value. In an ideal world, I could do something like this: StatusEnum MyStatus = StatusEnum.Parse("Active"); but that isn't a valid code.
|
I want to create something like this in modernCv, how I can create a section in latex for that. please, pay attention that i want produce space at the left exactly like picture that i have posted.
|
I am wondering about creating something like this in moderncv.
|
I am calling the @InvocableMethod from the Process Builder and @InvocableMethod method is returning the result, how can I take the result and use in Process Builder? public class GetAccountUsingPhone { @InvocableMethod public static List<Account> getAccountsUsingPhone(List<String> phones){ System.debug('~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~'); System.debug('Phone Values :: '+phones); List<Account> accounts = [select Id, Name, AccountNumber, Phone from Account where Phone=:phones]; System.debug('Accounts :: '+accounts); return accounts; } }
|
Good morning. Hopefully this is a simple question, that I've just bone-headedly missed in the documentation. In process builder how can I access the return value of an Apex InvocableMethod?
|
Let f be a continuously differentiable real-valued function on [0,1] such that $\int_{1/3}^{2/3} f(x)dx = 0$. Find the minimum value of $$I = \frac{\int_{0}^{1}f′(x)^2 dx} {(\int_{0}^{1}f(x)dx)^2}$$
|
Let $f$ be a continuously differentiable real valued function on $[0,1]$. It is given that $\displaystyle \int_{\frac{1}{3}}^{\frac{2}{3}}f(x) dx=0$ Find the minimum value of $\dfrac{\int_{0}^{1} (f'(x))^2 dx}{\left( \int_{0}^{1} f(x) dx \right)^2}$ I tried to use Cauchy-Schwarz to show that $$\frac{\int_{0}^{1} (f'(x))^2 dx}{\left( \int_0^1 f(x) dx \right)^2} \ge \frac{\left( \int_0^1 \bigl| f(x)f'(x) \bigr| dx \right)^2}{ \left( \int_0^1 f(x) dx \right)^2} \ge \frac{ f(1)^2 - f(0)^2}{2 \left( \int_0^1 f^2 (x) dx \right)^2}$$ But I can't proceed from here. Also, I don't know how to use the condition $\int_{1/3}^{2/3}f(x) dx=0$
|
We have the set $A=\{1,2,3,4,5\}$. what is the number of functions from $A$ to $A$? I think the domain of the function should contain all the elements of $A$ but range of the function may have any elements of $A$ or not having them. so for each of the numbers from $1$ to $5$ we have two possibilities $(1)$ existing in the range of function. $(2)$ not existing in the range. so the number of functions from $A$ to $A$ is $2^5=32$. is my justification right?
|
Let $X$ and $Y$ be finite sets. Then the set $Y^X$ is finite and $\#(Y^X) = (\#Y)^{\#X}$. I can see how to do it combinatorially. Let $y \in Y$. There are $\#(X)$ choices for such y to come from x, therefore we have $\#Y^{\#X}$ choices. I am not sure how to do it bijectively.
|
I want to position the footer at the bottom of the page which having a fixed header also... Not with position: fixed - I don't want it to remain on the screen, it should just be at the end of the page and behave normally when scrolling. Not at the bottom of the visible screen - At the bottom of the page, i.e; after all other content. Here's a diagram to explain better: Here's the code: I have prepared a demo: Or see below <div id="header">Header</div> <div id="content"> <p>Some content...</p> </div> <div id="footer">Footer</div> body{ /* Just to enable scrolling in JSFiddle */ height: 1000px; } #header{ width: 100%; height: 100px; position: fixed; top: 0px; z-index: 1; } #content{ width: 100%; position: absolute; top: 100px; /*Height of header*/ z-index: 0; } #footer{ width: 100%; height: 100px; position: absolute; bottom: 0px; } /*For demo only*/ #header, #footer{ border: 3px dashed #333333; background: #FFFFFF; } #content{ background: #CCCCCC; height: 200px; }
|
I have a simple 2-column layout with a footer that clears both the right and left div in my markup. My problem is that I can't get the footer to stay at the bottom of the page in all browsers. It works if the content pushes the footer down, but that's not always the case.
|
How can I rotate a Transform over a specified time in a single line of code? I have had a lot of trouble with this in the past. I wrote a script which rotates a Transform by a specified rotation over n seconds, or rotates a Transform towards a Vector3 over n seconds, in a one liner. I hope it helps others in the future. See below.
|
I'm trying to make a plane rotate down a certain amount and 180 degrees horizontally over 2 seconds. Basically I want it to take the plane 1 second to rotate to a horizontal-facing angle, then take the other second to rotate 180 degrees around to face the other direction. The formula I'm currently using is: //If you're rotating, lower the speed and rotate the plane. if (rotate == 1 && rotationPhase > 0) { //If in phase 0, figure out which phase you need too go to. if (angle > 90 && rotationPhase == 1) { //Rotation phase 2 = rotating down rotationPhase = 2; rotationAngleTime = angle - 90; } else if (rotationPhase == 1) { //Rotation phase 3 = rotating up rotationPhase = 3; rotationAngleTime = 90 - angle; } //After phase 0, if in phase 1 begin rotating down, if in phase 2 begin rotating up. if (angle > 90 && rotationPhase == 2) { transform.Rotate(0, 0, -rotationAngleTime * (Time.deltaTime * (rotationSpeed / 2))); angle -= rotationAngleTime * (Time.deltaTime * (rotationSpeed / 2)); if (angle > 89 && angle < 91) { angle = 90; rotationPhase = 4; rotationAngleTime = 180; } } else if (rotationPhase == 3) { transform.Rotate(0, 0, rotationAngleTime * (Time.deltaTime * (rotationSpeed / 2))); angle += rotationAngleTime * (Time.deltaTime * (rotationSpeed / 2)); if (angle > 89 && angle < 91) { angle = 90; rotationPhase = 4; rotationAngleTime = 180; } } //After you have rotated to horizontal in phase 1/2, rotate around to face the other direction. if (rotationPhase == 4) { transform.Rotate(rotationAngleTime * (Time.deltaTime * (rotationSpeed / 2)), 0, 0); rotationAngle += rotationAngleTime * (Time.deltaTime * (rotationSpeed / 2)); if (rotationAngle > 179) { rotationAngle = 0; rotationPhase = 0; rotationAngleTime = 0; } } } I've tried many different things, but I can't figure out what to do. EDIT: This seems to be a problem with Time.deltaTime. I can get the plane to rotate correctly, but for some reason it's not rotating over the right amount of time. I have a timer being subtracted by Time.deltaTime, and this animation happening, and the animation always finishes about half a second before the timer runs out.
|
How do I show that $\lim_{(x, y) \to (0,0)}\frac{xy^2}{x^2 - y^2} = 0$? I tried using polar coordinates, and arrived at $\lim_{r \to 0^+}r \tan{(2\theta)} \sin \theta$. But then, I couldn't find a nice way to prove that this is zero, because the function multplying $r$ isn't bounded. Does anyone have a nice, simple solution?
|
It's a quite simple question. But I couldn't see it... How to prove that $$\lim_{(x,y) \to (0,0)}\frac{xy^2}{x^2 - y^2}$$ doesn't exist? It's sufficient to show that for different paths through the origin this limit has diferent values (or doesn't exist in some of them). But, what paths to choose?!
|
I've been searching the web for a way to prove that $\int^{\infty}_{-\infty}{\sin(x)/x} = \pi$ with complex analysis, because I have a problem of consistency. I found two, carried in the following link : . But then I wanted to find it by using the fact that : $\sin(x)/x = \text{Im}(e^{ix}/x)$ To do so, I shifted the integration by $-i$ in the complex plane, showing that the integral on $[-\infty , \infty]$ is equal to the one on $[-\infty -i, \infty -i]$, since the integrand vanish on the vertical borders of the rectangle when we tend to infinity. I did this to get rid of the pole on the contour of integration. Then, by using the residues theorem on the contour $C_1 : z = y-i, y \in [-R,R]$ and $C_2 : z = Re^{it}-i, t \in [0,\pi]$. Given the integral on $C_2$ vanishes, we have then that : $\int^{\infty}_{-\infty}{\sin(x)/x} = \text{Im}(\int^{\infty}_{-\infty}{e^{ix}/x}) = \text{Im}(2\pi i\,\text{Res}(e^{iz}/z, 0)) = 2 \pi$ Which gives me the answer with a factor of $2$. I don't understand were did I go wrong ? I think it has something to do with the fact that I take the imaginary part of the integral, but I don't really know... Can someone spot my mistake ? If needed, I can provide further detail on my calculations.
|
A famous exercise which one encounters while doing Complex Analysis (Residue theory) is to prove that the given integral: $$\int\limits_0^\infty \frac{\sin x} x \,\mathrm dx = \frac \pi 2$$ Well, can anyone prove this without using Residue theory? I actually thought of using the series representation of $\sin x$: $$\int\limits_0^\infty \frac{\sin x} x \, dx = \lim\limits_{n \to \infty} \int\limits_0^n \frac{1}{t} \left( t - \frac{t^3}{3!} + \frac{t^5}{5!} + \cdots \right) \,\mathrm dt$$ but I don't see how $\pi$ comes here, since we need the answer to be equal to $\dfrac{\pi}{2}$.
|
In ArcMap 10.2, I have a layer that has two attributes: depth and magnitude. Depth should be represented by color: deeper points being lighter and shallower being darker. Magnitude represented by symbol's size: points with a higher magnitude have a bigger symbol and points with a lower magnitude have a smaller one. How do i do that? So, many people has told me to use "multiple attributes" in the symbology dialog. I wish i could upload a screenshot but my firewall seems to have the image service blocked. Let's try with words. "Multiple attributes" offer these input boxes: "value fields" and "variation by". in "value fields" i select "depth" and "magnitude" in "variation by" we have two buttons: "color ramp" and "symbol size" in "color ramp" i choose "depth" i open "symbol size". There, "depth" is selected. I change it to be "magnitude". open "color ramp" again. No longer "depth" is selected. Now "magnitude" is. Basically, whenever i select something on "symbol size" or "color ramp", the same selection is duplicated on the other button.
|
I am trying to make a map using US census data showing vacant housing to total housing on the same map. I came across the "multiple attributes" feature under the symbology tab and wondered if this is the way to go and, if so, how to use it? I have only been able to get one type of symbol, the gradient feature to appear. I'm using ArcGIS Desktop 10.
|
Find all pairs $(x, y)$ of integers such that: $$1+2^x+2^{2x+1}=y^2$$ Using congruence modulo 3 and 4, I concluded that $x$ is a even integer, $y=1$ $(mod\ 12)$ but I couldn't use them to solve the problem.
|
What are the solutions in positive integers of the equation: $${1+2^x+2^{2x+1}=y^2}$$ I tried to factorize the equation but it didn't help much. Clearly $y $ is an odd integer. Substituting $y =2n+1$, we get $2^x+2^{2x+1}=(2n)\cdot{(2n+2)}$ $\Rightarrow (2^{x-2})\cdot(1+2^{x+1})=(n)\cdot(n+1)$ Which is the product of 2 consecutive integers. Does it help? I don't know.
|
Hi in the below code value am adding values to account_name the after that using that adapter doing the set adapter.response is coming the server but values are not adding to the list and list is also displaying. For displaying used the recyclerview to display the values . can any one help me where did the mistake Error: java.lang.NullPointerException: Attempt to invoke virtual method 'android.view.View android.view.LayoutInflater.inflate(int, android.view.ViewGroup, boolean)' on a null object reference at com.genworks.oppm.Adapter.MyAdapter.onCreateViewHolder(MyAdapter.java:32) at com.genworks.oppm.Adapter.MyAdapter.onCreateViewHolder(MyAdapter.java:19) updated code: Activity.java: for(SyncBlocks syncBlocks1:syncBlocks){ String label=syncBlocks1.getLabel(); ArrayList<SynFields> synFields=syncBlocks1.getFields(); ArrayList<SynFields> jsonArray=syncBlocks1.getFields(); for(SynFields synFields1:synFields){ String name=synFields1.getName(); Object values = synFields1.getValue().toString(); try { if (values instanceof JSONObject) { JSONObject jsonObject1 = new JSONObject(String.valueOf(synFields1.getValue())); String value=jsonObject1.getString("value"); }else if (values instanceof String) { //here, you get string String value = synFields1.getValue().toString(); //account_name.addAll(value); String value_names= String.valueOf(synFields1.getValue()); // Log.e("account_name", String.valueOf(account_name.add(value))); account_name.add(value_names); //account_name.add(value); } } catch (JSONException e) { e.printStackTrace(); } } myAdapter = new MyAdapter(getContext(),account_name); recyclerView.setLayoutManager(new LinearLayoutManager(getContext(), LinearLayoutManager.VERTICAL, false)); recyclerView.setAdapter(myAdapter); } MyAdapter.java: public class MyAdapter extends RecyclerView.Adapter<MyAdapter.MyViewHolder> { private LayoutInflater inflater; private Context mContext; private ArrayList<String> mSynFields=new ArrayList<>(); public MyAdapter(Context context, ArrayList<String> synFieldsArrayList) { mContext=context; mSynFields=synFieldsArrayList; } @Override public MyViewHolder onCreateViewHolder(ViewGroup parent, int viewType) { View view = inflater.inflate(R.layout.fragment_account, parent, false); MyViewHolder holder = new MyViewHolder(view); return holder; } @Override public void onBindViewHolder(MyViewHolder holder, int position) { holder.name.setText(mSynFields.get(position)); } @Override public int getItemCount() { return mSynFields.size(); } class MyViewHolder extends RecyclerView.ViewHolder{ TextView country, name, city; ImageView iv; public MyViewHolder(View itemView) { super(itemView); country = (TextView) itemView.findViewById(R.id.headingText); name = (TextView) itemView.findViewById(R.id.subHeaderText); city = (TextView) itemView.findViewById(R.id.subHeadingText); } } }
|
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?
|
As we known, there'is a command called "force index" within mysql database. So this can force mysql to use an index whether optimizer like or not. And my confusion is that how to do the same thing on postgresql? Any reply will be appreciated.
|
How do I force Postgres to use an index when it would otherwise insist on doing a sequential scan?
|
In addition to well-known soft /s/ and hard /k/ pronunciations, 'c' is sometimes pronounced /ʃ/ e.g. special, liquorice? Is there any rule?
|
How can I tell whether "c" should be pronounced "s" or "k"? I always get confused and pronounce it like "s" because it looks like russian "с".
|
How does one find a decreasing sequence of closed balls ( not necessarily concentric) in a complete metric space whose intersection is empty?
|
Could someone provide me with an example of a metric space having a nested decreasing sequence of bounded closed sets with empty intersection? I first thought of Cantor set but the intersection is not empty!
|
Can every physically sound differential equation, that is covariant, deterministic etc. be derived by extremising a suitable action using a suitable lagrangian, that may be arbitary. Is this a mathematical theorem?
|
We see variational principles coming into play in different places such as Classical Mechanics (Hamilton's principle which gives rise to the Euler-Lagrange equations), Optics (in the form of Fermat's principle) and even General Relativity (we get Einstein's equation from the Einstein-Hilbert action). However, how do we explain this very principle, i.e., more mathematically, I want to ask the following: If I am given a set of generalized positions and velocities, say, $\{q_{i}, \dot{q}_{i}\}$, which describes a classical system with known dynamics (equations of motion), then, how do I rigorously show that there always exists an action functional $A$, where $$A ~=~ \int L(q_{i}, \dot{q}_{i})dt,$$ such that $\delta A = 0$ gives the correct equations of motion and trajectory of the system? I presume historically, the motivation came from Optics: i.e., light rays travel along a path where $S = \int_{A}^{B} n ds$ is minimized (or at least stationary). (Here, $ds$ is the differential element along the path). I don't mind some symplectic geometry talk if that is needed at all.
|
A couple months ago, I started to see some very small stain spots on the bottom of my MacBook Pro early 2015 screen. It's very annoying to see while I'm using it. When the screen is turned off, I see it as in the picture below. But when it's turned on, I see it as very small water-ish drops. I tried to clean it using water, screen cleaner, and even alcohol, but it didn't go away. Also that area doesn't feel as smooth as the unaffected area. So, I think it's on the outside of my screen not inside. Have you ever seen this before? Any suggestions on how to remove it without the need of replacing the whole screen?
|
I try to clean my mid-2015 Macbook Pro with Retina display by wiping the screen with a damp cloth and then immediately drying. However, there seems to be left some residue/streak marks, which look very oily. Sometimes these disappear after a few minutes, but they are still very unsightly, and a bit worrying (is there something wrong with my screen?) I'm wondering if there are other cleaning techniques which avoid this issue, or whether this is completely normal behaviour. Thank you!
|
Everytime I need to access ifconfig , I find using using /sbin/ifconfig. If I need to directly type ifconfig in bash and get the required output without calling the directory every time, what should I do?
|
Compare Debian (left) and Ubuntu (right): $ ifconfig $ ifconfig bash: ifconfig: command not found eth0 Link encap ... $ which ifconfig $ which ifconfig $ /sbin/ifconfig Then as superuser: # ifconfig # ifconfig eth0 Link encap ... eth0 Link encap ... # which ifconfig # which ifconfig /sbin/ifconfig /sbin/ifconfig Furthermore: # ls -l /sbin/ifconfig # ls -l /sbin/ifconfig -rwxr-xr-x 1 root root 68360 ... -rwxr-xr-x 1 root root 68040 ... It seems to me the only reason I cannot run ifconfig without superpowers on Debian is that it's not in my path. When I use /sbin/ifconfig it does work. Is there any reason I should not add /usr/local/sbin:/usr/sbin:/sbin to my path on Debian? This is a personal computer, I am the only human user. Versions used (uname -a): Ubuntu: Linux ubuntu 3.13.0-51-generic #84-Ubuntu SMP Wed Apr 15 12:08:34 UTC 2015 x86_64 x86_64 x86_64 GNU/Linux Debian: Linux debian 3.16.0-4-amd64 #1 SMP Debian 3.16.7-ckt11-1+deb8u3 (2015-08-04) x86_64 GNU/Linux
|
I have a windows 8 laptop and i am interested in downloading and installing Ubuntu 12.04.3, but what happens next? Can I change back to my old desktop? How do i use Ubuntu? Please I need advice
|
I'm absolutely new to Linux. I would like to know how to install Ubuntu alongside the pre-installed Windows 8+ OS. Should I do it with Wubi, or through the Live USB/DVD? What steps do I need to take to correctly install Ubuntu?
|
I've been reading the Books Online article. It states: FAST_FORWARD: Specifies a FORWARD_ONLY, READ_ONLY cursor with performance optimizations enabled. and FORWARD_ONLY: Specifies that the cursor can only be scrolled from the first to the last row. FETCH NEXT is the only supported fetch option. If FORWARD_ONLY is specified without the STATIC, KEYSET, or DYNAMIC keywords, the cursor operates as a DYNAMIC cursor. Does this mean that a FAST_FORWARD cursor is a DYNAMIC cursor by default, unless I also specify that it's STATIC?
|
I'm running into a performance problem with a query that I can't seem to get my head around. I pulled the query out of a cursor definition. This query takes seconds to execute SELECT A.JOBTYPE FROM PRODROUTEJOB A WHERE ((A.DATAAREAID=N'IW') AND ((A.CALCTIMEHOURS<>0) AND (A.JOBTYPE<>3))) AND EXISTS (SELECT 'X' FROM PRODROUTE B WHERE ((B.DATAAREAID=N'IW') AND (((((B.PRODID=A.PRODID) AND ((B.PROPERTYID=N'PR1526157') OR (B.PRODID=N'PR1526157'))) AND (B.OPRNUM=A.OPRNUM)) AND (B.OPRPRIORITY=A.OPRPRIORITY)) AND (B.OPRID=N'GRIJZEN'))) AND NOT EXISTS (SELECT 'X' FROM ADUSHOPFLOORROUTE C WHERE ((C.DATAAREAID=N'IW') AND ((((((C.WRKCTRID=A.WRKCTRID) AND (C.PRODID=B.PRODID)) AND (C.OPRID=B.OPRID)) AND (C.JOBTYPE=A.JOBTYPE)) AND (C.FROMDATE>{TS '1900-01-01 00:00:00.000'})) AND ((C.TODATE={TS '1900-01-01 00:00:00.000'})))))) GROUP BY A.JOBTYPE ORDER BY A.JOBTYPE The actual execution plan looks like this. Noticing the server wide setting was set to MaxDOP 1 I tried playing around with maxdop settings. Adding OPTION (MAXDOP 0) to the query, or changing the server settings results in much better performance and this query plan. However, the application in question (Dynamics AX) doesn't execute queries like this, it uses cursors. The actual code captured is this. declare @p1 int set @p1=189527589 declare @p3 int set @p3=16 declare @p4 int set @p4=1 declare @p5 int set @p5=2 exec sp_cursoropen @p1 output,N'SELECT A.JOBTYPE FROM PRODROUTEJOB A WHERE ((A.DATAAREAID=N''IW'') AND ((A.CALCTIMEHOURS<>0) AND (A.JOBTYPE<>3))) AND EXISTS (SELECT ''X'' FROM PRODROUTE B WHERE ((B.DATAAREAID=N''IW'') AND (((((B.PRODID=A.PRODID) AND ((B.PROPERTYID=N''PR1526157'') OR (B.PRODID=N''PR1526157''))) AND (B.OPRNUM=A.OPRNUM)) AND (B.OPRPRIORITY=A.OPRPRIORITY)) AND (B.OPRID=N''GRIJZEN''))) AND NOT EXISTS (SELECT ''X'' FROM ADUSHOPFLOORROUTE C WHERE ((C.DATAAREAID=N''IW'') AND ((((((C.WRKCTRID=A.WRKCTRID) AND (C.PRODID=B.PRODID)) AND (C.OPRID=B.OPRID)) AND (C.JOBTYPE=A.JOBTYPE)) AND (C.FROMDATE>{TS ''1900-01-01 00:00:00.000''})) AND ((C.TODATE={TS ''1900-01-01 00:00:00.000''})))))) GROUP BY A.JOBTYPE ORDER BY A.JOBTYPE ',@p3 output,@p4 output,@p5 output select @p1, @p3, @p4, @p5 resulting in this execution plan (and unfortunately the same multiple-second execution times). I've tried several things such as dropping cached plans, adding options in the query inside the cursor definition, ... But none of them seem to get me a parallel plan. I've also searched google for quite a bit looking for parallelism limitations of cursors but can't seem to find any limitations. Am I missing something obvious here? The actual SQL build is SQL Server 2008 (SP1) - 10.0.2573.0 (X64) which i realise is unsupported, but I cannot upgrade this instance as I see fit. I would need to transfer the database to another server and that would mean pulling a fairly large uncompressed backup over a slow WAN. Trace flag 4199 doesn't make a difference, and neither does OPTION (RECOMPILE). The cursor properties are: API | Fast_Forward | Read Only | Global (0)
|
I am building a 4 leg robot with a Raspberry Pi and 8 servos (). Currently I have a a 6 V 3A power supply powering the servos through a 5V 5A buck converter and a 5V 2A power supply for the Raspberry Pi. This set up works great but I would like to lessen the weight on the robot by using one power supply to power both components. I'm new to electrical things and was wondering how do I determine what the power requirements are to power all the servos and raspberry pi with one battery? Do I just need to increase the amps?
|
Power supplies are available in a wide range of voltage and current ratings. If I have a device that has specific voltage and current ratings, how do those relate to the power ratings I need to specify? What if I don't know the device's specs, but am replacing a previous power supply with particular ratings? Is it OK to go lower voltage, or should it always be higher? What about current? I don't want a 10 A supply to damage my 1 A device.
|
Does there exists two real valued functions $f$ and $g$ on $R$ such that $f \circ g = x^{2018}$ and $ g\circ f = x^{2019}$ ? My attempt : since $g \circ f $ is bijective thus $f$ is one one and $g$ is onto. Now $f \circ g(-x) = f \circ g(x) $ imply $ g(-x) = g(x) $ (because $ f $ is one one) thus g is even function. Now i dont know how to proceed from here any hint will be helpfull for me.... (I know no such map exists as answer)
|
I have tried a little bit to solve the problem which goes as follows: My intuition says that there exist no $f:\Bbb R\to\Bbb R$ such that $$f(g(x))=x^{2018}\text{ and }g(f(x))=x^{2019}.$$ Note that $$f(g(f(x)))=f(x)^{2018}\implies f(x^{2019})=f(x)^{2018}$$ Similarly, $$g(x^{2018})=g(x)^{2019}$$ Putting $x=1$ in $f(x^{2019})=f(x)^{2018}$, we get $f(1)=f(1)^{2018}$ and thus $f(1)=0$ or $f(1)=1$. Similarly, putting $x=1$ in $g(x^{2018})=g(x)^{2019}$ we get $g(1)=g(1)^{2019}$ and thus $g(1)=0,1,-1$. Now, I can't proceed further. Can anybody solve it? Thanks for assistance in advance.
|
I have a dual-booted pc with windows 10 and ubuntu 14.04, which has been working just fine for a few months now. I noticed yesterday, however, that now when I restart my computer it boots straight to windows without showing me the grub menu. Secure boot is still disabled. I don't know if this is related to a windows update or what, but help in resolving the issue would be most welcome.
|
I have installed Ubuntu 15.10 alongside Windows 10 with UEFI. To install Ubuntu, I chose the option install alongside Windows 10 or something similar to this. Then I created a new partition for Ubuntu and installed it. After installation, the boot menu did not show up. Initially I thought Ubuntu has not been installed, but when I plugged in the USB drive and wanted to install Ubuntu I saw an option of reinstalling Ubuntu on my machine. So, I found out that Ubuntu is installed. Pressing F8 and F12 also does not help. Can anyone help me bring up the GRUB boot menu? In Windows, I also entered the command bcdedit /set {bootmgr} path \EFI\ubuntu\grubx64.efi in cmd, but still the boot menu does not show up. Reply (Himanshu) : Just boot in bios and, if you can, add boot option with name say ubuntu and path EFI/ubuntu/shimx64.efi. No need for live PCB or anything. Move the boot option to top. This is for dell GUI bios but I assume it works for all. Or you may want to see or , where you can enable Windows Boot Loader for one boot or forever as you wish, and boot Ubuntu from it. If you want now, you can use the installed Ubuntu terminal to use the commands update-grub to use GRUB instead. (Not enough reputation to answer properly btw.)
|
According to , answers that are earnest attempts at an explanation, but that are technically incorrect, should be downvoted but not deleted. However, the Low Quality review queue does not offer an easy way to do the right thing: "Looks OK" is inappropriate: "nothing is wrong" doesn't apply to a wrong answer. "Edit" is inappropriate: Any edit that corrects the answer would also radically alter the meaning of the post. "Recommend Deletion" is inappropriate since it is an earnest but misguided attempt at an answer. "Skip" is, unfortunately, the only way to clear this item from the queue. However, skipping items isn't letting the reviewer be helpful. Therefore, the Low Quality review queue needs to offer better choices of actions.
|
VLQ flagged posts are now being shown in the Low Quality review, which allows: Looks Good Edit Delete Skip but no option to vote on the post. My suggestion is to add downvoting as options: Downvote Downvote/Delete (this would replace current Delete) There have been times I want to downvote but not necessarily delete a post I see in the queue. This is likely much more common on subjective sites than Stack Overflow. "What is an answer?" is a little less clear. My current workflow is to open the question, scroll down and downvote, then go back to the review task and hit "skip." It seems this is not really what is intended. I do this because I cannot rescind delete votes and occasionally someone will edit a post which is VLQ. Yet I still want to take action, in this case downvoting.
|
I want to make a multiboot USB stick. I extracted XP.iso into a folder then added winvblock driver that lets ISO load into memory. Now I want to pack folder into iso but it's not that simple since it must be bootable. Is there such a tool that let me pack folder into iso? EDIT: It's not a duplicate of above mentioned link. I asked to make a bootable iso from folder. In the link it mentions how to create iso image from a folder which is very easy. Anyway I found the answer here:
|
Considering I have a bunch of files in a directory, I would like to bundle them into an ISO image file. How should I proceed to do that?
|
The list of interesting tags would be more usable if it was ordered alphabetically. Apologies if this suggestion has already been made, I couldn't find it (, but not quite the same).
|
I think it would be nice to display tags in alphabetical order. Currently, tags are displayed in order of creation. As a workaround, I remove, and then add the tags, which is a bit dumb, but I like 'em in alphabetical order. It's probably pretty trivial to implement, and nice to have!
|
I am guessing differences in the following two codes. The first one is in python and works just fine.Here it is: >>> def foo(): if 1: print "this is working" n=6 print "the value of n is {0}".format(n) >>> foo() this is working the value of n is 6 The second one is in c, i guess the way i want to implement both programs is same.Here it is: void main(){ if(1){ printf("this is working"); int n=9; } printf("the value of n is %d",n); } n goes undeclared in the c code while it works good in python. I know that in the c code n has scope within the if block.But why there is no as such scope issue in python. Do the variables inside a block { } are stored in different memory stacks in c while in python they are stored in function's memory stack ?.Correct me if i am wrong somewhere. Regards.
|
What exactly are the Python scoping rules? If I have some code: code1 class Foo: code2 def spam..... code3 for code4..: code5 x() Where is x found? Some possible choices include the list below: In the enclosing source file In the class namespace In the function definition In the for loop index variable Inside the for loop Also there is the context during execution, when the function spam is passed somewhere else. And maybe pass a bit differently? There must be a simple reference or algorithm somewhere. It's a confusing world for intermediate Python programmers.
|
I recently installed Ubuntu 13.04 in dual boot with 12.04.1. The problem I have is with the Bluetooth not working. I've tried searching for my phone, but no luck. I've installed Blueman and still no go. Bluetooth is working just fine on 12.04.1, but on 13.04 it is simply dead. Personal file sharing is enabled on both versions, visibility is enabled but no matter what I do I can't get it to work. This is really annoying. How can I fix this problem?
|
I have a Broadcom BCM2046, it appears as connected in the bluetooth widget over the panel, and the hcitools drops me data, but it doesn't work at all, I've tried to connect from another device and it's inexistent and viceversa from PC to the device hcitool dev and lsusb hci0: Type: BR/EDR Bus: USB BD Address: 89:21:09:79:B5:1B ACL MTU: 1017:8 SCO MTU: 64:0 UP RUNNING PSCAN ISCAN RX bytes:779 acl:0 sco:0 events:27 errors:0 TX bytes:376 acl:0 sco:0 commands:27 errors:0 Bus 001 Device 007: ID 0a5c:4500 Broadcom Corp. BCM2046B1 USB 2.0 Hub (part of BCM2046 Bluetooth) Bus 001 Device 008: ID 0a5c:2100 Broadcom Corp. Bluetooth 2.0+eDR dongle
|
Can PhD students study in universities in Germany, in engineering courses, without knowing the German language? Can they research and live without any problems? Does applying to these universities require knowledge of the German language?
|
Can a Ph.D. student who only knows how to speak English study in a European non-English speaking country (e.g., Austria, Netherlands, Switzerland, Italy, etc.) without any problems? Does applying to these universities require knowledge of that country's language?
|
I've got Linux Mint 17.1 on my laptop installed by someone else and I want to replace Mint with Ubuntu. I don't have a Windows system on it - just Mint. Can anyone tell me - in newbie friendly terms - how to do that? When I type df -h in terminal, the result is as below: Filesystem Size Used Avail Use% Mounted on /dev/sda1 684G 189G 460G 30% / none 4.0K 0 4.0K 0% /sys/fs/cgroup udev 1.9G 4.0K 1.9G 1% /dev tmpfs 386M 1.4M 385M 1% /run none 5.0M 0 5.0M 0% /run/lock none 1.9G 32M 1.9G 2% /run/shm none 100M 28K 100M 1% /run/user
|
How will Ubuntu automatically allocate the disk partition sizes when we select Erase disk and install Ubuntu during installation? Can the settings for automatic space allocation be changed?
|
The hand to hand combat prowess of STNG Starfleet's security personnel is lauded by Tasha Yar in the accepted answer to . Tasha: I think you should know that there is no physical training anywhere that matches Starfleet, especially its security people. It is likely combat training evolved during the time elapsed between TOS and STNG, but Kirk definitely had specific moves which he seemed to be trained in and repeatedly used during his 5 year mission. While some of the moves are identifiable, I find it difficult to pin a label on the double handed, flying hip check, style William Shatner utilized in his portrayal of James Kirk. According to canon, is Kirk practicing , and if so, what is it?
|
I'm less familiar with Enterprise and Voyager, but in TOS, TNG, and DS9 I have repeatedly seen Star Fleet officers engaged in melee combat perform this awkward and slow-looking attack where they clasp both hands together and swing at their opponent. At times it looks like they are trying to chop wood with no axe, hitting the opponent from the side. Other times, it looks like they are playing volleyball extra vigorously, uppercutting their enemy with both hands. If this were just in TOS, I would assume it was just the choreography of the day. However, it is still present in the more modern incarnations of the show. Is this part of a fictional martial art that is used by Star Fleet (and possibly others? I can't recall if, for example, I have ever seen klingons use this technique), or is it part of a real martial art? If there is no canon explanation (i.e. this move is not part of either a real or a fictional martial art), then why did they continue to use such awkward choreography in the more modern series?
|
Why can't you use numbers in CSS and is there another way of doing the job? I have the following code: <div class="center 400-width" id="position"> <div class="" id="header"> Header </div> <div class="" id="content"> Content </div> <div class="" id="footer"> Footer </div> </div> The CSS selects the class 400-width which means the container gets a width of 400px. And the background-color is for checking if it's true. .400-width{ width:400px; background-color:blue; color:white; } It doesn't happen right now as you can see I solved the problem by replacing 400- by four. So it becomes fourwidth.
|
What characters/symbols are allowed within the CSS class selectors? I know that the following characters are invalid, but what characters are valid? ~ ! @ $ % ^ & * ( ) + = , . / ' ; : " ? > < [ ] \ { } | ` #
|
I need to prevent/restrict standard users from accessing directory like bin,boot,dev,etc,lib,media?
|
I am working on a small project. I have about 20 computers with Ubuntu 10.04 on them, which will be used in a computer lab for elementary, middle, high school and college kids. Some seniors and new computer-users will be using the computers. I want to lock-down the computers for so children and people who want to play around with PC configuration can use them securely and without breaking them. I therefore want to restrict user privileges, removing the ability to upgrade, add/install software or otherwise personalize the lab's computers. The only uses for these computers should be: access to school websites for access of e-text books (homework assignments) access to learning-aid websites(such as www.math.com or webster.com) access/restrictions to applications that are safe and appropriate for the elementary students. For more senior users only, access to websites for completing applications for re-certifications of say food stamps, medicaid and so on. Are there any software packages that will let me do this?
|
$G$ is a simple graph that consists of a vertex set $V(G) = \{v_1, v_2, ..., v_n\}$ and an edge set $E(G) = \{e_1, e_2, ..., e_m\}$ where each edge is an ordered pair of vertices. The edge $\{u,v\}$ is denoted $uv$. A walk of length $k$ is a sequence $v_0,e_1,v_1,e_2,...,e_k,v_k$ of vertices and edges such that $e_i=v_{i-1}v_i$ for all $i$. A path is a walk with no repeated vertex. Prove: If $G$ is a finite simple graph in which every vertex has degree at least $k$, then $G$ contains a path of length at least $k$. I believe this has something to do with the longest path but I can't come up with a reasoning/proof that is of length of at least $k$.
|
Prove there's a simple path of length $k$ in a simple graph $G$ where all the vertices have degree of at least $k$. Relevant definitions: $G$ is a simple graph that consists of a vertex set $V(G) = \{v_1, v_2, ..., v_n\}$ and an edge set $E(G) = \{e_1, e_2, ..., e_m\}$ where each edge is an ordered pair of vertices. The edge $\{u,v\}$ is denoted $uv$. A walk of length $k$ is a sequence $v_0,e_1,v_1,e_2,...,e_k,v_k$ of vertices and edges such that $e_i=v_{i-1}v_i$ for all $i$. A path is a walk with no repeated vertex. My attempt: Induction, for $k=1$ it's obvious. Suppose for $k-1$ and we'll prove for $k$. Let $G$ be a simple graph such that $\forall v \in V : d(v)\ge k$. We can assume that there are at least $k+1$ vertices since there are $k$ neighbours to every vertex. Let $v_0$ be some vertex, it has $k$ neighbours, we'll move to one of its neighbours say $v_1$ and remove $v_0$. So now there are $k$ vertices with a degree of at least $k-1$ and from the induction hypothesis we'll have a path of length $k$. Is using only $k$ vertices from $n$ right? Does it keep the generality when using only all the neighbours of $v_0$?
|
What is the best way to create a dict from two other dicts (very big one and small one)? We have: big_dict = { 'key1':325, 'key2':326, 'key3':327, ... } small_dict = { 325:0.698, 326:0.684, 327:0.668 } Needs to get a dict for data in small_dict, but we should use keys from big_dict: comb_dict = { 'key1':0.698, 'key2':0.684, 'key3':0.668 }
|
I have two Python dictionaries, and I want to write a single expression that returns these two dictionaries, merged (i.e. taking the union). The update() method would be what I need, if it returned its result instead of modifying a dictionary in-place. >>> x = {'a': 1, 'b': 2} >>> y = {'b': 10, 'c': 11} >>> z = x.update(y) >>> print(z) None >>> x {'a': 1, 'b': 10, 'c': 11} How can I get that final merged dictionary in z, not x? (To be extra-clear, the last-one-wins conflict-handling of dict.update() is what I'm looking for as well.)
|
I got the original nikon d7200 batteries before, but its first initial 1st charge drains very fast. I tried to used them for a couple of weeks so they have definitely run down. And up. They've gone from full to empty very fast. Does anyone have any experience of using third party batteries like LP Neweer Vemico or some other brands?
|
I need another LP-E5 type battery for my Canon 450D. Should I buy an original Canon battery or one of the many generic brands available? There are loads of cheapos on , for example. I should add that the new battery will be added to my existing Canon battery in a battery grip. Does anyone have any experience (good or bad) of using generic batteries?
|
Currently there is an issue happening on the production environment and not happening in dev. so I would like to recreate it in dev by creating a image of prod and restore it in dev. the hardware are the same as well as the RAID. My question is a. what the best tool to use to do that? b. when creating the image, does it require any downtime? c. I presume that i need to do some configuration changes once the restore is done? d. after the restore, would the logic/physical mount be eased? Plus I am new to Ubuntu, have tried tar way to do. it seems that it caused lots of issues. I have gave up on that due to time limitation. Thank you so much. Bing
|
I'm a new Linux user. I've reinstalled my Wubi from scratch at least ten times the last few weeks because while getting the system up and running (drivers, , etc.) I've broken something (X, grub, unknowns) and I can't get it back to work. Especially for a newbie like me, it's easier (and much faster) to just reinstall the whole shebang than try to troubleshoot several layers of failed "fixing" attempts. Coming from Windows, I expect that there is some "disk image" utility that I can run to make a snapshot of my Linux install (and of the boot partition!!) before I meddle with stuff. Then, after I've foobar'ed my machine, I would somehow restore my machine back to that working snapshot. What's the Linux equivalent of Windows disk imagers like or ? Note: I found a similar question:
|
Prove for every two sets $A$ and $B$ that $A − B$, $B − A$ and $A ∩ B$ are pairwise disjoint. I've been looking at this problem and keep thinking it isn't true every time I think I make progress. My main issue is that $A$ and $B$ can be any sets, including themselves. If $A = B$ then $A-B=\{\}$ but also $B-A=\{\}$ so they can't be disjoint. Obviously, I'm missing something, probably will feel dumb after I figure it out.
|
Prove for every two sets $A$ and $B$ that $A-B$, ${B-A}$ and $A \cap B$ are pairwise disjoint. I'm really stuck on this one. I know pairwise disjoint means no two elements in $A$ and $B$ are the same. $A \cap B$ is the empty set, but how would I prove this?
|
For a desktop PC is it bad to leave the side panel to it's case off? Initially I thought it would help cooling (and allow me easy access) but wondered if it lets more dust in. Any other pros and cons? Obviously this is in a safe area and no likely to get bumped.
|
My friends say that it should actually improve the cooling since there is more air available to it, especially the CPU fan. I have to admit that it at least looks like it would stay cooler. I disagree. It should prevent the case fans from effectively running fast-moving air across the components, right? As for the CPU fan, the air around it isn't being refreshed as much with the case open, I think, so it's getting hotter, so the CPU cooling isn't as effective. Not that it would kill the computer, but it seems to me that it would make the cooling less efficient. Who's right? This is about settling an argument, not trying to solve a real problem. The computer in question is a custom-made "1337 gaming b0x0r r!g" (you know the type) school computer with like 8 fans that's being used right now to make graphene using a LightScribe DVD burner (not a heavy task), and its case is open. The key here is that it has a good-quality case, and we can't try heat tests on it.
|
This question is very basic but I could not find it among previous questions so here it goes: I am trying to measure the current of a very low power device with very short intervals of activity. I know I should use a shunt resistor and OPAMP but: 1) I am not sure about the correct configurations and setup of these wrt device 2) I am not sure about the range of the resistor and the specifications of the OPAMP that should be used in this matter. The range of the currents to be measured are starting from 10 microamperes to a few mili amperes
|
I’m building a battery powered data logger with a microcontroller and several sensors. I’d like to measure the supply current of individual parts with idle currents in the μA range and peak currents in the low mA range. The current is not constant which rules out a simple multimeter. Usually I’d (temporarily) replace ferrite beads on the PCB with a 10Ω resistor and measure the voltage drop with my DS1104Z oscilloscope. However, the voltage drop of some μV for 1 or 2 μA of current is simply drowning in the noise and peak currents of ~10mA already result in a noticeable supply drop (so increasing the resistance is out of the question). I was thinking about building a small board with a 5Ω resistor and OPAMP set to something like 100x amplification, but first wanted to know if this is a good idea or if you know of any affordable, ready-made solutions. Obviously the bandwidth doesn’t have to be high, but some accuracy would be desirable. Thanks in advance. Michael
|
I have a variable which stores a string, the output of a sed command. I want to execute a set of commands only if this string value matches either of the 2 other strings. I used the below code. #! /bin/ksh request=”Request” fault=”Fault” while read lines; do category=`echo $lines|sed -n -e 's/.*Summary: Value//p'| awk '{print $1}'` if [ ! -z "$category" ] then if($category = $request) then echo $category fi fi done<content.txt But it's giving me an error: sample.sh: Request: not found The variable category will have either value Request or value Order Can someone point the error or a solution to this? If inner if is eliminated and echo $category will print the exact string value.
|
I am using the below script to move two days back when script runs at starting two days of the year and also check first and second days of every month and move two days back. if [$month="01"] && [$day="01"]; then date="$last_month/$yes_day/$last_year" fulldate="$last_month/$yes_day/$last_year" else if [$month="01"] && [$day="02"]; then date="$last_month/$yes_day/$last_year" fulldate="$last_month/$yes_day/$last_year" else if [ $day = "01" ]; then date="$last_month/$yes_day/$year" fulldate="$year$last_month$yes_day" else if [ $day = "02" ]; then date="$last_month/$yes_day/$year" fulldate="$year$last_month$yes_day" else date="$month/$yes_day/$year" fulldate="$year$month$yes_day" fi fi fi fi But my bad am getting the below error message Etime_script.sh: line 19: [06=01]: command not found Etime_script.sh: line 24: [06=01]: command not found
|
If A and B are compact set, then A∩B is compact set. How to prove this problem?. I know compact, but not use to this problem...
|
Is the the intersection of a finite number of compact sets is compact? If not please give a counter example to demonstrate this is not true. I said that this is true because the intersection of finite number of compact sets are closed. Which therefore means that it will be bounded because the intersection is contained by every set. I am not sure if this is correct. Thank you for the help
|
I have a checkbox, which changes the content of a table when it's clicked. For some reason, my UTF-8 is no longer working after I have submitted the form with ajax. Ajax: function showUser() { if (window.XMLHttpRequest) { xmlhttp = new XMLHttpRequest(); } else { xmlhttp = new ActiveXObject("Microsoft.XMLHTTP"); } xmlhttp.onreadystatechange = function() { if (xmlhttp.readyState == 4 && xmlhttp.status == 200) { document.getElementById("table").innerHTML = xmlhttp.responseText; } } xmlhttp.open("GET","getuser.php?customer="+variable); xmlhttp.send(); } and getuser.php: $customer = intval($_GET['customer']); $connection = mysqli_connect('localhost','root','*********','name'); if (!$connection) { die("Could not connect: " . mysqli_error($connection)); } if($customer == 1) { $searchType= 1; } else { $searchType= 0; } $sql="SELECT * FROM table WHERE type= $searchType"; $result = mysqli_query($connection,$sql); After this I echo a table with content got from the database. In my database there is some customers that has some special characters in their name. Instead of showing them like usual, it only shows ? in place of those special characters. Any help? (sry for my bad english)
|
I'm setting up a new server and want to support UTF-8 fully in my web application. I have tried this in the past on existing servers and always seem to end up having to fall back to ISO-8859-1. Where exactly do I need to set the encoding/charsets? I'm aware that I need to configure Apache, MySQL, and PHP to do this — is there some standard checklist I can follow, or perhaps troubleshoot where the mismatches occur? This is for a new Linux server, running MySQL 5, PHP, 5 and Apache 2.
|
My question is different from that question. I'd like to randomly draw a number of dots with different colors and sizes, for example, 50 dots, 60 dots... It will be better if these dots can distribute in a circle. \documentclass{article} \usepackage{tikz,pgfmath} \begin{document} \thispagestyle{empty} \begin{pgfpicture} \pgfmathdeclarerandomlist{color}{{red}{blue}{green}{yellow}{white}} \foreach \a in {1,...,50}{ \pgfmathrandominteger{\x}{1}{200} \pgfmathrandominteger{\y}{1}{200} \pgfmathrandominteger{\r}{5}{10} \pgfmathrandomitem{\c}{color} \pgfpathcircle{\pgfpoint{+\x pt}{+\y pt}}{+\r pt} \color{\c!40!white} \pgfsetstrokecolor{\c!80!black} \pgfusepath{stroke, fill} } \end{pgfpicture} \end{document} Example output:
|
I want to fill a part of a picture with more or less evenly and randomly distributed circles which should not overlap. It would be okay if circles are only partly inside the shape. The density should be like what you see on this page with values 80-100. (But I do not need so many circles, 30 should be enough, I could repeat the pattern). I cannot use a grid and "wobble" the circles a bit: The circles are too large and it simply does not look randomly. Currently I am thinking about a random attempt: Get some random point, measure its distance to existing circles, either paint or throw the point away. Try 100 times and hope that you get the right number of circles (and that it does not take too long). But perhaps someone has a better idea. The example draws the circles simply manually: \documentclass{article} \usepackage{tikz} \usetikzlibrary{backgrounds} \begin{document} \begin{tikzpicture}[framed,gridded,radius=0.5cm] \draw[red](0,0) rectangle (5,5); \draw (1,1) circle; \draw (2.3,1.1) circle ; \draw (4.5,0.8) circle ; \draw (5.1,1.8) circle ; \draw (0.4,3.3) circle ; \draw (2.1,2.8) circle ; \draw (3.8,3.5) circle ; \draw (4.8,4.2) circle ; \draw (0.8,4.9) circle ; \draw (2.1,4.1) circle ; \draw (3.8,2.0) circle ; \draw (3.5,0.6) circle ; \draw (3.0,5.0) circle ; \draw (4.1,5.1) circle ; \draw (0.9,2.1) circle ; \end{tikzpicture} \end{document}
|
with fragments i got confused on how to call the UI compared to activities as i have to do it differently. Now with my listview i am initialising it in the oncreateView as most of the tutorials state that i have to do. however on my PostExecute function it's seems to return an empty ui and therefore the results will be null which triggers a null exception error. public View onCreateView(LayoutInflater inflater, ViewGroup container, Bundle savedInstanceState) { View view = inflater.inflate(R.layout.listview_main, container, false); listview = (ListView) view.findViewById(R.id.listview); new RemoteDataTask().execute(); return view; } private class RemoteDataTask extends AsyncTask<Void, Void, Void> { @Override protected void onPreExecute() { super.onPreExecute(); // Create a progressdialog mProgressDialog = new ProgressDialog(getActivity()); // Set progressdialog title mProgressDialog.setTitle("Stored Files"); // Set progressdialog message mProgressDialog.setMessage("Loading..."); mProgressDialog.setIndeterminate(false); // Show progressdialog mProgressDialog.show(); } @Override protected Void doInBackground(Void... params) { // Locate the class table named "UploadedFiles" in Parse.com final ParseQuery<ParseObject> query = new ParseQuery<ParseObject>("NewFiles"); query.orderByDescending("_created_at"); query.findInBackground(new FindCallback<ParseObject>() { @Override public void done(List<ParseObject> objects, com.parse.ParseException e) { if (e == null) { try { aF = query.find(); } catch (com.parse.ParseException e1) { e1.printStackTrace(); } Toast.makeText(getActivity(), "Success", Toast.LENGTH_LONG).show(); } else { Log.d("Error", e.toString()); } } }); return null; } @Override protected void onPostExecute(Void result) { // Locate the listview in listview_main.xml // Pass the results into an ArrayAdapter adapter = new ArrayAdapter<String>(getActivity(), R.layout.list_view_item); // Retrieve object "ImageName" from Parse.com database for (ParseObject NewFiles : aF) { adapter.add((String) NewFiles.get("ImageName")); } // Binds the Adapter to the ListView listview.setAdapter(adapter); // Close the progressdialog mProgressDialog.dismiss(); // Capture button clicks on ListView items listview.setOnItemClickListener(new AdapterView.OnItemClickListener() { @Override public void onItemClick(AdapterView<?> parent, View view, int position, long id) { // Send single item click data to SingleItemView Class Intent i = new Intent(getActivity(), SingleFileView.class); // Pass data "name" followed by the position i.putExtra("ImageName", aF.get(position).getString("ImageName") .toString()); // Open SingleItemView.java Activity startActivity(i); } }); } } And this is the error that i am getting. And I have the Listview set correctly with no mistakes so i don't think the issue is from that. Process: com.venomdev.safestorage, PID: 3027 java.lang.NullPointerException: Attempt to invoke interface method 'java.util.Iterator java.util.List.iterator()' on a null object reference at com.venomdev.safestorage.ListViewFiles$RemoteDataTask.onPostExecute(ListViewFiles.java:146) at com.venomdev.safestorage.ListViewFiles$RemoteDataTask.onPostExecute(ListViewFiles.java:95)
|
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 am considering on applying for a different PhD position in a different university and even different country, but I don't know if I should mention I am already in one, and I'm planning to leave it, or just address that as a research assistant position, what should I do?
|
I have recently completed my MS and joined as a Ph.D. candidate in the same university. But I want to move out. I am filling the application for an other position where they have asked the following: Please give the full contact details for you at your permanent institute. If you do not have a permanent institute, you can use the Leave empty button to leave this page empty. There are options to mention that I am currently a Ph.D. candidate. Is it a good idea to mention that I am currently a Ph.D. candidate? I am asking this because someone have told me that if you are currently a Ph.D. candidate, universities don't give much attention to your application.
|
I could create a page like this: using the following code: \documentclass{article} \usepackage{tikz} \usetikzlibrary{fit, calc} \usepackage{fontspec} \newfontfamily{\myfont}{Arial} \usepackage{marginnote} \newcommand\commentary[2]{% \tikz[remember picture, baseline={(here.base)}] \node (here) {#1};% \marginpar{ \begin{tikzpicture}[remember picture, overlay] \begin{scope}[rotate=(rand*10),shift={(1.8,0)}] \node [text width=3cm, align=center, transform shape] (text) at (0, 0) {\footnotesize \myfont #2}; \draw [transform shape, thick] plot [smooth, tension=0.8] coordinates { ($(text.south) + (-10pt, -5pt) + (rand * 2pt, rand * 2pt)$) ($(text.south east) + (-5pt, 5pt)$) ($(text.north east) + (rand * 2pt - 5pt, rand * 2pt)$) ($(text.north west) + (rand * 2pt + 5pt, rand * 2pt)$) ($(text.south west) + (rand * 2pt + 5pt, rand * 2pt)$) ($(text.south) + (10pt, -3pt) + (rand * 2pt, rand * 2pt)$) }; \end{scope} \draw[->, thick] ($(text.south west) - (-10pt, 5pt)$) to [bend left=20] ($(here.south east) - (3pt, 2pt)$); \end{tikzpicture} } } \begin{document} The equation of a plane through $(x_0,y_0,z_0)$ \commentary{is:}{The tangent plane: $\nabla f(\mathbf{x})\cdot (\mathbf{x}-\mathbf{x}_0)=0$.} $$a(x-x_0)+b(y-y_0)+c(z-z_0)=0$$ The vector $(a,b,c)$ is normal to the plane. \end{document} 1) How can put the head of the arrow to the equation (for example to + sign in the display question) instead of a word in the text (intead of "is :" in this example)? (2) How can I move the text bubble 1 cm to up or down?
|
I just read a book "Linear Algebra and Its Applications 4E" by David C. Lay. The book is (should be) LaTeX typeset. The matrix and equations are so nice, please see the following 3 examples: It's so beautiful, so I want get the same effect inside my paper. Here is my code: \usepackage{amsmath} \usepackage{colortbl} \newcommand\y{\cellcolor{clight2}} \definecolor{clight2}{RGB}{212, 237, 244}% %%% \[A=\left[ \begin{array}{ccccc} \y 0 & -3 & -6 & 4 & 9 \\ -1 & \y -2 & -1 & 3 & 1 \\ -2 & -3 & 0 & \y 3 & -1 \\ 1 & 4 & 5 & -9 & -7 \end{array} \right]\] \[A=\left[\begin{array}{cccccc} \rowcolor{clight2} 3 & -9 & 12 & -9 & 6 & 15\\ 0 & 2 & -4 & 4 & 2 & -6 \\ 0 & 3 & -6 & 6 & 4 & -5 \end{array} \right]\] And the result: But how to add these arrows??
|
The gravitational force between two masses is given by: $$\vec{F_g}=G\frac{m_1m_2}{r^2}$$ and the electrostatic force between two charged particles by: $$\vec{F_e}=k\frac{q_1q_2}{r^2}$$ Both the forces have inverse square dependence on the separation or distance although the two types of forces are totally different. One can definitely ask if both charge and mass are totally different properties of matter, why does the force generated by them have such similar formulas? My question might seem similar to . But that question is more specific if moving masses would generate some kind of field. My question is, is the similarity in their formula just a coincidence or can we conclude something from it?
|
It seems paradoxical that the strength of so many phenomena (, ) are calculable by the inverse square of distance. However, since volume is determined by three dimensions and presumably these phenomena have to travel through all three, how is it possible that their strengths are governed by the inverse of the distance squared? The gravitational force and intensity of light is merely 4 times weaker at 2 times the distance, but the volume of a sphere between the two is 8 times larger. Since presumably these phenomena would affect all objects in a spherical shell surrounding the source with equal intensity, they travel in all three dimensions. How come these laws do not obey an inverse-cube relationship while traveling through space?
|
I'm pretty sure the answer is out there, see , but that is unfortunately way over my head :). I'm interested in the case that $G$ is a Lie group (e.g. $U(1)$), but I don't need to know the answer for general manifolds -- just for boring old Euclidean space. For example, I sort of feel like there is only one $U(1)$-bundle over $\mathbb{R}^n$ for any $n$ (up to isomorphism), and possibly only one $SU(2) \times U(1) \times SU(3)$-bundle, too. But I have no idea how to prove/disprove that. Do I need to go ahead and try to understand these classifying spaces referenced in the link above? Or is there a more elementary argument? If there can be multiple different $G$-bundles over $\mathbb{R}^n$, what is the simplest Lie group $G$ and the lowest value of $n$ for which this occurs? Is there a simple explicit construction?
|
What's the easiest way to see this? The only thing I could think of was to try to patch together trivializations. I couldn't find a way to make that work. Thank you! edit: For the record, here's why I asked about this special case of the more general result about fiber bundles over contractible spaces. In the much beloved book by Bott and Tu, it's claimed that the Leray Hirsch theorem can be proven in the same way the Kunneth theorem is proven: induct on the size of a finite good cover for the base space, then apply the Mayer Vietoris sequence and the Poincare lemma for the induction step. It's assumed that there exists a finite good cover for the base space, but it's not assumed that this cover is a refinement of the cover of the base space, which gives the local trivializations of the fiber bundle. Therefore, to apply the Poincare lemma in the induction step, it seems that you need to know that the result I asked about is true. Since fiber bundles had just been introduced in the text, I thought there may be a short, elementary proof that the authors had taken for granted.
|
This film was a turn of the century 1900s time frame color film. It was a movie not a TV show. British I think. It was about the invention of a projector / lamp that would show creatures that were invisible floating in mid air. The creatures were snake like. The longer the projector was on the more aggressive the creatures became and eventually would have crossed over to our dimension. I can't remember the film and cant find any images on Google. May be a Lovecraft type film
|
I remember very little of this, I was quite young - It was on television in the mid 90's, but seemed older. My wife was telling me about the 21 grams experiment and the memory clicked into place. Setting Inside of a mad scientist sort of lab, with the plasma balls and everything else, a character (Who in my mind resembles Gene Wilder in Young Frankenstein) is conducting an experiment. The room is hazy, lots of hues of purple and red. He has an assistant present. They were conducting some sort of experiment to try to figure out the secrets of immortality (or possibly reanimation). I remember them "trapping" a human soul in a glass vessel to see what it weighed or what kind of volume it took up - I believe they shot someone in this vessel, and because their soul could not "escape", they did not die.
|
$$0 < \cos (\theta)<\frac {\sin (\theta)}{\theta}<\frac {1}{\cos(\theta)} $$ for $\theta\in(0,\pi/2)$.
|
How can I find the following product using elementary trigonometry? Suppose $0 \lt x \lt \frac{\pi}{2}$ is an angle measured in radians. Use the trigonometric circle and show that $\cos(x) \le \frac{\sin(x)}{x} \le \frac{1}{\cos(x)}$. I have been trying to solve this question. I can't figure out whether or not the solution requires a trigonometric circle or if it can be done using another method.
|
A disk 2 inches in diameter is thrown at random on a tiled floor, where each tile is a square with sides 4 inches in length. Let C be the event that the disk will land entirely on one tile. In order to assign a value to P(C), consider the center of the disk. In what region must the center lie to ensure that the disk lies entirely on one tile? If you draw a picture, it should be clear that the center must lie within a square having sides of length 2 and with its center coincident with the center of a tile. Since the area of this square is 4 and the area of a tile is 16, it makes sense to let $P(C) = \frac{4}{16}.$ I don't really understand the statement for the last sentence "Since the area of this square is 4 and the area of a tile is 16, it makes sense to let $P(C) = \frac{4}{16}.$"
|
I came up with a mental problem in probability and I found out that it's either trivial or more complex than what I thought. The problem is this: Take a coin of diameter $D$ and radius $R$, and toss it. Cover the table with a rectangular tablecloth made of small squares of side $\ell$, with $\ell \geq D$. What is the probability for the coin to land exactly inside a little square? If the problem has a trivial solution then I expect it to be this: the probability is the area of the coin over the area of the square: $$P = \frac{\pi R^2}{\ell^2}$$ But here I would a sort of $\theta$ function such that (in case this hypothesis is missing) the probability is zero when $D>\ell$ hence: $$P = \frac{\pi R^2}{\ell^2}\theta(\ell - 2R)$$ But here many problems arise: first of all my convention demands that $\theta (\ell - 2R) = 1$ for $2R = \ell$, because as improbable it is, there could be a golden toss by which the coin lands exactly perfectly within the square the side of which is identical to the diameter. But now I strongly believe I shall consider the whole number of squares of the tablecloth. But more squares = more probability? I'm stuck on an either trivial or complicated reasoning. Any clarification?
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.