body1
stringlengths 20
4.1k
| body2
stringlengths 23
4.09k
|
|---|---|
Lets define the following function series (Riemann Zeta Function): $$\varsigma (z)=\sum _{n=1}^\infty n^{-z} $$ where the power is defined by the primary branch of the Logarithm. A) prove that the series converges in : $ D= \left\{ z:\operatorname{Re}(z) > 1 \right\}$ and also converges absolutely and uniformly in $D_\delta = \left\{z:\operatorname{Re}(z)>1+ \delta \right\} $ B) find $\varsigma '(z) $. Do guys have any hints? I thought about calculating the radius of convergence, but how do I do it in this case? and how do I prvoe that it converges with this minus power? also I didnt get the information about the power being defined that way, im not sure also that I translated this accurately from hebrew.
|
I'm aware there are been several similar questions, and some great answers with hints on how to prove this, for example and . But I've never really seen a detailed proof of the absolute convergence of the Riemann zeta function in the half-plane $\Re(s)> 1$. I hope there's interest on a detailed proof of this for reference. Here is my attempt. Please, fill in any detail that might be missing, or point out any mistake! On $\Re(s)=\sigma> 1$, we have $$\sum_{n=1}^{\infty}\bigg|\frac{1}{n^s}\bigg|=\sum_{n=1}^{\infty}\frac{1}{n^\sigma}$$ and $$\frac{1}{n^\sigma}\leq\frac{1}{n^{1+\epsilon}}$$ for any $\epsilon >0$, so by the direct comparison test, if $$\sum_{n=1}^{\infty}\frac{1}{n^{1+\epsilon}}$$ converges absolutely, then so do $\sum_{n=1}^{\infty}|1/n^s|$ and $\zeta(s)$. By the integral test, the convergence of $\sum_{n=1}^{\infty}1/n^{1+\epsilon}$ is equivalente to the finitude of the integral $$\int_1^\infty \frac{1}{n^{1+\epsilon}}=\bigg[-\frac{1}{\epsilon x^\epsilon}\bigg]=\frac{1}{\epsilon}$$ which holds for any $\epsilon < \infty$. Any correction or improvement is welcomed! Thanks in advance.
|
I cannot get VirtualBox to install on my Ubuntu Linux machine. I type in sudo apt install virtualbox And it reads the dependency tree and asks me if I want to install 161 MB of information. I confirm, and get the following string of error codes: Do you want to continue? [Y/n] y Err:1 http://archive.ubuntu.com/ubuntu disco-updates/main amd64 dkms all 2.6.1-4ubuntu2.5 404 Not Found [IP: 2001:67c:1360:8001::23 80] Err:2 http://archive.ubuntu.com/ubuntu disco/universe amd64 libgsoap-2.8.75 amd64 2.8.75-1 404 Not Found [IP: 2001:67c:1360:8001::23 80] Err:3 http://archive.ubuntu.com/ubuntu disco/multiverse amd64 virtualbox-dkms all 6.0.6-dfsg-1 404 Not Found [IP: 2001:67c:1360:8001::23 80] Err:4 http://archive.ubuntu.com/ubuntu disco/multiverse amd64 virtualbox amd64 6.0.6-dfsg-1 404 Not Found [IP: 2001:67c:1360:8001::23 80] Err:5 http://archive.ubuntu.com/ubuntu disco/multiverse amd64 virtualbox-qt amd64 6.0.6-dfsg-1 404 Not Found [IP: 2001:67c:1360:8001::23 80] E: Failed to fetch http://archive.ubuntu.com/ubuntu/pool/main/d/dkms/dkms_2.6.1-4ubuntu2.5_all.deb 404 Not Found [IP: 2001:67c:1360:8001::23 80] E: Failed to fetch http://archive.ubuntu.com/ubuntu/pool/universe/g/gsoap/libgsoap-2.8.75_2.8.75-1_amd64.deb 404 Not Found [IP: 2001:67c:1360:8001::23 80] E: Failed to fetch http://archive.ubuntu.com/ubuntu/pool/multiverse/v/virtualbox/virtualbox-dkms_6.0.6-dfsg-1_all.deb 404 Not Found [IP: 2001:67c:1360:8001::23 80] E: Failed to fetch http://archive.ubuntu.com/ubuntu/pool/multiverse/v/virtualbox/virtualbox_6.0.6-dfsg-1_amd64.deb 404 Not Found [IP: 2001:67c:1360:8001::23 80] E: Failed to fetch http://archive.ubuntu.com/ubuntu/pool/multiverse/v/virtualbox/virtualbox-qt_6.0.6-dfsg-1_amd64.deb 404 Not Found [IP: 2001:67c:1360:8001::23 80] E: Unable to fetch some archives, maybe run apt-get update or try with --fix-missing? I'm a rank amateur at this so the solution is hopefully simple. Any help with this would be appreciated.
|
Recently I have installed an older version of Ubuntu on my old machine. Whenever I try to install any software, I get an error saying it couldn't be found: $ sudo apt-get install vlc Reading package lists... Done Building dependency tree Reading state information... Done E: Couldn't find package vlc
|
It is a kind of messed up situation. I installed Ubuntu 13.10 on Windows 8 which didn't display Ubuntu. I then tried Boot-Repair by opening Try Ubuntu without installing. Here is the URL: At this instant I was unable to load Windows. Then I changed the BIOS setting from UEFI to Legacy which on restarting displayed the message No operating system found. I installed Ubuntu 13.10 again. Here are my problems: I am unable to load Windows. (It is asking for recovery media which I don't have right now.) In Ubuntu I am unable to mount any Windows partitions. Error message: Error mounting /dev/sda8 at /media/dew/Songs, Videos & Movies: Command-line `mount -t "ntfs" -o "uhelper=udisks2,nodev,nosuid,uid=1000,gid=1000,dmask=0077,fmask=0177" "/dev/sda8" "/media/dew/Songs, Videos & Movies"' exited with non-zero exit status 14: The disk contains an unclean file system (0, 0). Metadata kept in Windows cache, refused to mount. Failed to mount '/dev/sda8': Operation not permitted The NTFS partition is in an unsafe state. Please resume and shutdown Windows fully (no hibernation or fast restarting), or mount the volume read-only with the 'ro' mount option. I guess that Windows was hibernated or didn't shutdown properly. I can't open Windows again to ensure that it is properly shutdown (as mentioned earlier I don't have recovery media). I am happy to use Ubuntu for a while until I get my recovery media, but meanwhile is there any way to mount my Windows partitions?
|
Whenever I boot Ubuntu, I get a message that it cannot mount my windows partition, and I can choose to either wait, skip or manually mount. When I try to enter my Windows partition through Nautilus I get a message saying that this partition is hibernated and that I need to enter the file system and properly close it, something I have done with no problem so I don't know why this happens. Here's my partition table, if any more data is needed please let me know. Device Boot Start End Blocks Id System /dev/sda1 2048 20000767 9999360 83 Linux /dev/sda2 20002814 478001151 228999169 5 Extended /dev/sda3 * 478001152 622532607 72265728 7 HPFS/NTFS/exFAT /dev/sda4 622532608 625141759 1304576 82 Linux swap / Solaris /dev/sda5 20002816 478001151 228999168 83 Linux
|
Let $\lambda\leq\kappa$ be infinite cardinals. Then $| \{X\subset \kappa | |X|=\lambda \} | = \kappa^{\lambda} $ $\leq$ part is trivial, but I don't know how to prove the other part. I used transfinite induction on $\lambda$ but it didn't work to me. Can I have any hint for this? Thanks in advance
|
Initially assume ZFC. Let $\binom{\kappa}{\lambda}$ denotes $\left|[\kappa]^{\lambda}\right|$ where $[\kappa]^{\lambda}$ is the collection of all subsets of $\kappa$ with cardinality $\lambda$. That is, the number of subsets of $\kappa$ of size $\lambda$. Let $\kappa$ be any infinite cardinal number. Then it is easy to see that $\binom{\kappa}0=1$ $\binom{\kappa}n=\kappa$ for all positive natural number $n$. $\binom{\aleph_0}{\aleph_0}=\beth_1$ $\binom{\kappa}{\lambda}\le \kappa^\lambda$ when $1\le \lambda \le \kappa$ 3 is due to $\beth_1=\sum_{\lambda=0}^{\aleph_0}\binom{\aleph_0}{\lambda}$ and others besides $\binom{\aleph_0}{\aleph_0}$ sums $\aleph_0$(since countable infinite countable infinites sums to countable infinite) $\left({}^{\kappa}_{\lambda}\right)\le \kappa^\lambda$ is due to an injection can be made from $[\kappa]^{\lambda}$ into $\kappa^{\lambda}$(maps $\{a_i|i<\lambda\}$ to $\langle a_i\rangle_{i<\lambda}$ where $a_j<a_k$ iff $j<k$) I hypothesize that $$\binom{\kappa}{\lambda}=\begin{cases} \kappa^\lambda,&\lambda \le \kappa \\ 0,& \lambda>\kappa \end{cases}$$ It holds when $\kappa=\aleph_0$, but hard to induct for larger cardinals without assuming GCH. So I need some helps.
|
I am running a dualboot setup on my Lenovo Flex2 with Windows 10 and Ubuntu 15.10. I am on the rtlwifi - rtl8723be wireless card. While my wifi disconnect issue has been resolved, I have found out that my wifi speed is 3 times less than what I get on Windows 10. I have a 15 Mbps broadband connection. I consistently get the same speed of 15 mbps on windows but a maximum of 5 Mbps on Ubuntu. On my Android phone I get around 12 to 13.5 Mbps. I am on channel 6 (2437MHz) of the wifi router with AES encryption .Router is Tenda_3623D8. Current connection of my Ubuntu machine is on the 40M bandwidth as per the router status page. Any idea how to reach a better speed on Ubuntu?
|
I have installed Ubuntu 15.04 on my laptop with RTL8723BE Wi-fi card. But it is always disconnecting from network. I have tried echo "options rtl8723be fwlps=N ips=N" | sudo tee /etc/modprobe.d/rtl8723be.conf but that didn't helped. What can I do to prevent the wifi from disconnecting? If I upgrade to kernel 4.X, will it help? ~$ lspci -knn | grep Net -A2 09:00.0 Network controller [0280]: Realtek Semiconductor Co., Ltd. RTL8723BE PCIe Wireless Network Adapter [10ec:b723] Subsystem: Hewlett-Packard Company Device [103c:2231] Kernel driver in use: rtl8723be ~$ rfkill list 0: hci0: Bluetooth Soft blocked: yes Hard blocked: no 1: phy0: Wireless LAN Soft blocked: no Hard blocked: no ~$ ifconfig && iwconfig && route -n && ping -c 1 google.com eth0 Link encap:Ethernet HWaddr 38:63:bb:cd:4a:7e UP BROADCAST MULTICAST MTU:1500 Metric:1 RX packets:3 errors:0 dropped:0 overruns:0 frame:0 TX packets:53 errors:0 dropped:0 overruns:0 carrier:0 collisions:0 txqueuelen:1000 RX bytes:752 (752.0 B) TX bytes:8445 (8.4 KB) lo Link encap:Local Loopback inet addr:127.0.0.1 Mask:255.0.0.0 inet6 addr: ::1/128 Scope:Host UP LOOPBACK RUNNING MTU:65536 Metric:1 RX packets:3870 errors:0 dropped:0 overruns:0 frame:0 TX packets:3870 errors:0 dropped:0 overruns:0 carrier:0 collisions:0 txqueuelen:0 RX bytes:314613 (314.6 KB) TX bytes:314613 (314.6 KB) wlan0 Link encap:Ethernet HWaddr c0:38:96:6d:c4:83 inet addr:192.168.1.205 Bcast:192.168.1.255 Mask:255.255.255.0 inet6 addr: fe80::c238:96ff:fe6d:c483/64 Scope:Link UP BROADCAST RUNNING MULTICAST MTU:1500 Metric:1 RX packets:15240 errors:0 dropped:0 overruns:0 frame:0 TX packets:14627 errors:0 dropped:0 overruns:0 carrier:0 collisions:0 txqueuelen:1000 RX bytes:14410285 (14.4 MB) TX bytes:2192744 (2.1 MB) eth0 no wireless extensions. wlan0 IEEE 802.11bgn ESSID:"DIR-615" Mode:Managed Frequency:2.437 GHz Access Point: 00:90:4C:08:00:0D Bit Rate=150 Mb/s Tx-Power=20 dBm Retry short limit:7 RTS thr=2347 B Fragment thr:off Power Management:off Link Quality=70/70 Signal level=-22 dBm Rx invalid nwid:0 Rx invalid crypt:0 Rx invalid frag:0 Tx excessive retries:0 Invalid misc:186 Missed beacon:0 lo no wireless extensions. Kernel IP routing table Destination Gateway Genmask Flags Metric Ref Use Iface 0.0.0.0 192.168.1.1 0.0.0.0 UG 400 0 0 wlan0 169.254.0.0 0.0.0.0 255.255.0.0 U 1000 0 0 wlan0 192.168.1.0 0.0.0.0 255.255.255.0 U 0 0 0 wlan0 PING google.com.Dlink (172.26.136.19) 56(84) bytes of data. 64 bytes from 19.136.26.172.in-addr.arpa (172.26.136.19): icmp_seq=1 ttl=249 time=102 ms --- google.com.Dlink ping statistics --- 1 packets transmitted, 1 received, 0% packet loss, time 0ms rtt min/avg/max/mdev = 102.547/102.547/102.547/0.000 ms
|
I have: $ find 1 2 -printf '%i %p\n' 40011805 1 40011450 1/t 40011923 1/a 40014006 1/a/e 40011217 1/a/q 40011806 2 40011458 2/y 40011924 2/a 40013989 2/a/e 40013945 2/a/w I want: <inode> <path> any 2 40011450 2/t 40011458 2/y any 2/a 40014006 2/a/e 40011217 2/a/q 40013945 2/a/w How do do it?
|
I'm trying to merge two directory trees that have many common elements but also each have elements that are only present in one of the two trees. The main issue I am having is that when mv encounters two sub-directories with the same relative paths it either keeps the source (with -f) or the destination (with -n) but I can't make it take the union of both sub-directories. I could of course use rsync with --remove-source-files but this will actually copy the data and then delete the old files as opposed to a true move. The two directory trees contain several hundred GB of data and are both on same partition so I would love to do a true move if possible for the sake of time. Right now I have find * -type file -exec mv -n {} /destination/{} but this only moves files from the source to the destination when the target directory already exists. I can preface this command with something like mv -n * /destination/ but this only brings over the top level directories. Is there any way to do this in a single line? I could always write a script to check if the directory exists before copying the file but this seems like such a basic task, it seems like there should be an easier way.
|
I was kindly helped on this forum a few months ago to fix my Wifi. Only problem is I have to run the command in the terminal at the start of every session.Each time I need to run- sudo modprobe -v brcmsmac How can I make this process run automatically? Many thanks!
|
How can I make an application automatically start when I have logged in?
|
In my Java application I am renaming files to a file name provided in a String parameter. There is a method boolean OKtoRename(String oldName, String newName) which basically checks whether the newName isn't already taken by some other file, as I wouldn't want to bury existing ones. It now occurred to me that perhaps the newName String will not denote a valid file name. So I thought to add this check to the method: if (new File(newName).isFile()) { return false; } Which obviously isn't the right way to do it, since in most cases the newFile does not yet exist and therefore although it is OKtoRename, the function returns false. I was wondering, is there a method (I know there isn't for the java.io.File objects) like canExist()? Or would I have to resort to regex to make sure the newFile String does not contain invalid characters (e.g. ?, *, ", :)? I wonder if there is perhaps a function hidden somewhere in the JDK that would tell me if a string could possibly denote a valid file name.
|
I need to determine if a user-supplied string is a valid file path (i.e., if createNewFile() will succeed or throw an Exception) but I don't want to bloat the file system with useless files, created just for validation purposes. Is there a way to determine if the string I have is a valid file path without attempting to create the file? I know the definition of "valid file path" varies depending on the OS, but I was wondering if there was any quick way of accepting C:/foo or /foo and rejecting banana. A possible approach may be attempting to create the file and eventually deleting it if the creation succeeded, but I hope there is a more elegant way of achieving the same result.
|
Prove that $a^x\equiv a^{x\bmod(m-1)}\pmod m$ for m prime: I attempted to prove the cyclicity using Fermat's little theorem, that $a^p\equiv a\pmod{p} $ but didn't succeed. Could you please explain to me how to prove it?
|
I've read about Fermat's little theorem and generally how congruence works. But I can't figure out how to work out these two: $13^{100} \bmod 7$ $7^{100} \bmod 13$ I've also heard of this formula: $$a \equiv b\pmod n \Rightarrow a^k \equiv b^k \pmod n $$ But I don't see how exactly to use that here, because from $13^1 \bmod 7$ I get 6, and $13^2 \bmod 7$ is 1. I'm unclear as to which one to raise to the kth power here (I'm assuming k = 100?) Any hints or pointers in the right direction would be great.
|
I saw question few minutes back. The question is not at all clear and as far as what I have read in the FAQ and heard about the functioning of this site. Questions like these should be closed as "Unclear what OP is asking" But I found that the Moderators are also answering. I am not saying anything about there potential but dont you think that it is aganist the rule. I respectfully respect all the moderators here. But just curious to know that what is right and correct? I am really sorry if I am asking for a big trouble by asking this question here. I have no intention to blame or put a finger on any moderator.
|
Have a look at these Stack Overflow questions, and . Doesn't it fall under the following flag category? Questions asking for code must demonstrate a minimal understanding of the problem being solved. Include attempted solutions, why they didn't work, and the expected results. And yet a user having access to moderator tools is answering the question instead of putting it on hold or raising a flag. So, is it the time to rethink about how moderation privileges should be granted? Or some kind of flagging mechanism should be introduced for users belonging to 10K+ reputation category? Have a look at . What's wrong with it? Reading all the answers and comments, Stack Overflow seems to be following double standards. Rules are there, but not for everyone. It's totally on luck that either your not-so-good question will be accepted by the community or not. for example.
|
It would be nice if I could run a selected region of Emacs text as an input for a c or c++ program. The output of the program could then overwrite the selected text. Is there a feature like this?
|
In vi[m] there is the through a shell command -- like sort or indent -- and get the filtered text back into the buffer. Is there an equivalent in emacs?
|
6 up votes for a comment telling me its a duplicate when it is not. 4 votes to close despite no one reading the actual question. no answer accepted. I have found a link that explains. So long SO, account closed.
|
I'm currently passing the pid on the command line to the child, but is there a way to do this in the Win32 API? Alternatively, can someone alleviate my fear that the pid I'm passing might belong to another process after some time if the parent has died?
|
I had windows 7 installed, I had installed linux mint. I freed up one of my partitions from windows drive management to remove linux and now when I load, the screen I get is error: filesystem not found. grub rescue prompt. What can I do to fix it?
|
My operating system was Windows 7, and recently, I installed Zorin OS (linux based on Ubuntu). At first, when I turned on my laptop Windows started automatically. I used a program to make the Windows boot loader come on and ask me what to start. If I chose Linux, then the Linux GRUB comes on and asks me what to do. I want to remove the GRUB. I want to keep my Windows boot loader.
|
Many of the spaceships in Star Wars, e.g. X-wings, have wings as part of their design. If there's no air resistance in space, why would wings be at all beneficial? Wouldn't it be better to have a small, compact shape to a make a star fighter easier to cram through small spaces?
|
In space no one cares if you're aerodynamic. That said, why bother having actuating wings on craft primarily meant for space travel? Sure the X-Wing looks cool, but looking cool is hardly a sufficient justification for the expense, especially when you're running a costly and cash strapped rebellion.
|
Are there any dangers of eating food that's slightly past its prime? Say there's no visible mold or any other signs of spoiling, but the smell and taste aren't quite as good as they were right after the good was prepared. I'm guessing it depends on exactly what ingredients are in the food, so what ingredients should be avoided even if slightly past their prime? Are most things fine?
|
Kind of a strange question, but say something has spoiled, i.e. smells bad, tastes bad, etc. Will it actually always make you sick? Like for instance spoiled dressing, let's say it tastes sour, smells nasty and you eat it, will it make you sick? If so what actually makes you sick? The toxins/bacteria? or it just being unappetizing? I ask because I tried a TINY bit of ranch and while it tasted mostly fine (it was a bit tangy) it smelled quite tangy but looked fine. I also saw .
|
The question: Let $L$ be a three dimensional simple Lie algebra over $\mathbb{C}$. Say that $x \in L$, $x \neq 0$, and that $ad_x$ has an eigenvalue $\lambda \neq 0$. Show that $L \cong \mathfrak{sl}(2, \mathbb{C})$. Things I've tried: We can say $[h,e] = 2e$, $[h,f] = -2f$, and $[e,f] = h$. If I say $ad_x(y) = [x,y] = \lambda y$ then maybe I can have a basis $\{x,y,z\}$. I tried to just create a map $\phi(\frac{2}{\lambda}x)=h$, $\phi(y)=e$, and $\phi(z)=f$. Then I think $x$ and $y$ work but I'm not sure how to ensure $z$ works the way I want.
|
If we know that a 3-dimensional Lie algebra $L$ with $[L,L]=L$ is simple. How to prove that the only (up to isomorphism) 3-dimensional complex Lie algebra $L$ with $L=[L,L]$ is $sl_2(\mathbb C)$?
|
I operate a windows system with several applications, that all need a special home variable. But if I set this "home" variable, all applications use the same value. Is there a way to set this variable independent of application?
|
On Unix operative systems I can start a process with additional environment variables like this: $ DEBUG=1 VERBOSE=3 python myscript.py Does the Windows CMD have an equivalent for this? I'm stuck developing on a Windows computer and I want to test release-behaviour without having to build the project or permanently change the env variables in my CMD session.
|
Having this in the preamble: \usepackage{tikz} \usetikzlibrary{chains,shapes.multipart} \usetikzlibrary{scopes} \usetikzlibrary{decorations.markings} \usetikzlibrary{shapes,calc} \usetikzlibrary{automata,positioning} I have the following figure: \begin{figure} \centering \begin{tikzpicture}[start chain=going right,>=latex,node distance=0pt] \node[draw,rectangle,on chain,minimum size=1.5cm] (rr) {$I$}; \node[draw,rectangle,on chain,draw=white,minimum size=0.8cm]{}; % the rectangular shape with vertical lines \node[rectangle split, rectangle split parts=5, draw, rectangle split horizontal,text height=1cm,text depth=0.5cm,on chain,inner ysep=0pt] (wa) {}; \fill[white] ([xshift=-\pgflinewidth,yshift=-\pgflinewidth]wa.north west) rectangle ([xshift=-15pt,yshift=\pgflinewidth]wa.south); \node at (wa.east) (A){}; \draw [-latex] (A) --+(30:1.5) coordinate (B1); \draw [-latex] (A) --+(-30:1.5) coordinate (B2); % the circle \node [draw,circle,on chain,minimum size=1cm] at (B1) (se1) {$U_1$}; \draw [-latex] (se1) --+(0:1.3) coordinate (BB1); \node [draw,circle,on chain,minimum size=1cm] at (B2) (se2) {$U_2$}; \draw [-latex] (se2) --+(0:1.3) coordinate (BB2); \node [draw,diamond,on chain,minimum size=0.2cm] at (BB1) (C3){}; \draw [-latex] (C3)--+(0:1)node[midway,above] {$\mu$}; % the arrows and labels \draw[<-] (wa.west) -- +(-20pt,0) node[midway,below] {$\lambda$}; \draw[->] (C3.north) to[out=120, in=145] ([shift=(up:.3)] wa.west); \end{tikzpicture} \caption{The model represented as a queuing system.} \label{fig:queue} \end{figure} How to put labels on arrows where there are none (the picture below shows the edges where i want to put labels)?
|
\fbox{ \begin{tikzpicture}[scale=1,auto=center] \node[circle,fill=gray!20] (n1) at (2,8) {Node A}; \node[circle,fill=gray!20] (n2) at (8,8) {Node B}; \foreach \from/\to in {n1/n2} \draw (\from) -- (\to) node[draw=none,fill=none,font=\scriptsize,midway,below] {text below}; \end{tikzpicture} } The example show how to put text below the line in middle, but how to write the text below and above the line in middle (simultaneously) between two nodes? ...
|
I have seen something like this before: $\int \frac{dx}{(e+1)^2}$. This is apparently another way to write $\int \frac{1}{(e+1)^2}dx$. However, considering this statement: $\int\frac{du}{(u-1)u^2} = \int du(\frac{1}{u-1}-\frac{1}{u}-\frac{1}{u^2})$. On the left side, $du$ is moved, If I had to evaluate an integral that is written in this way, how would I expand it into the usual $\int f(x)dx$ form? (From the comments) Is this truly a product and if not why is it commutative?
|
From reading answers here, I've noticed that some people write integrals as $\int dx \; f(x)$, while other people write them as $\int f(x)\;dx$. I realize that there is no mathematical difference between the two notation forms, but was wondering why some people choose the first method over the second. Is there some place in higher maths that it becomes beneficial to write the differential first? (I, personally, have always used the second method, just because I was taught that way...)
|
In C/C++, return type of main() can be int/void but in JAVA it can only be void why ?
|
In the case of languages with a C-like syntax, we declare the main() method to return an int or float value (or void). Is it possible to declare a non-void return type from main() in Java? If not, then why not? Does this mean that a Java program doesn't return any value to the OS?
|
The question is basically to prove that convergence of $\sum{a_n}$ implies convergence of $\sum {\frac{\sqrt a_n}n}$ with $a_n>0.$ Basically what I tried to show is that: Since $\sum{a_n}$ converges, then $\lim a_n= 0$ when $n \rightarrow \infty$ , and so $\sqrt a_n \rightarrow 1$ when $n \rightarrow \infty,$ which means it is bounded. On the other hand, $\frac1n \rightarrow 0$ as $n \rightarrow \infty$ and is always decreasing. Per theorem 3.42 in Rudin, that means $\sum{\frac{\sqrt a_n}n}$ also converges. Is that correct or am I missing something? The solutions on the net appear to differ.
|
This is Baby Rudin exercise 7 of Chapter 3. Prove that the convergence of $\sum{a_n}$ implies the convergence of $\sum{\sqrt {a_k} \over k}$ if $a_n \ge 0$. Proof: I will attempt to show that the cauchy criterion is met so $${\sum_{k=n}^m {\sqrt {a_k} \over k}} \le \epsilon $$ for all $n,m \le N_1$. Im disregarding the absolute value since its all positive terms. Since $\sum{a_n}$ converges, we know that the $\lim \limits_{n \to \infty} a_n =0$ So there exists some $N_2$ such that for all $n \ge N_2$, $$ a_n \lt \ {{(m-n)}^2k^2(\epsilon)^2} $$ I am again disregarding the absolute values because its always positive Let N=max{$N_1,N_2$} then for all $n,m \ge N$ $$\sum_{k=n}^m {\sqrt {a_k} \over k} \le \sum_{k=n}^m {\sqrt {{(m-n)}^2k^2(\epsilon)^2} \over k} \le \sum_{k=n}^m{(m-n)(\epsilon)} = \epsilon $$ Maybe this is just crazy, should I just use Cauchy-Schwarz inequality and forget about this or could I possibly make this method work?
|
I want to include a table in a tex file and I get this error: ! LaTeX Error: File `standalone.sty' not found. Type X to quit or to proceed, or enter new name. (Default extension: sty) Enter file name: ! Emergency stop. I have tries to install the standalone fille from but I can't install it. \documentclass[11pt]{exam} \usepackage[french,english]{babel} \usepackage[utf8]{inputenc}%pour inclure documents \usepackage{caption} \usepackage[T1]{fontenc} \usepackage[capposition=top]{floatrow} \usepackage[top=1.5in, bottom=1.5in, left=2cm, right=2cm]{geometry} \usepackage{multirow} \usepackage{dcolumn} \usepackage{standalone} \begin{document} .... \input {pi_tableau_diagnosis_adult} \end{document}
|
I'm new to LaTeX, investigating using it for some work projects. I'm using MiKTeX on Windows. My employer's locked-down network blocks the application's automatic installation function. I can take my laptop home and successfully install from there, but if I need a package in the middle of the day I'm stuck. I am able to access the CTAN website and download the package files (.dtx or .ins?), but I don't know what do do with them. How can I do a manual package installation?
|
The class Map defines an inner interface Entry. Why did the designer of Map do it like that? What would change if I turn the inner interface Entry out of Map?
|
I have just found a static nested interface in our code-base. class Foo { public static interface Bar { /* snip */ } /* snip */ } I have never seen this before. The original developer is out of reach. Therefore I have to ask SO: What are the semantics behind a static interface? What would change, if I remove the static? Why would anyone do this?
|
I'm wondering if some power of $2$ can be written in base $10$ as $2013$ followed by other digits. Formally, does there exist $k,q,r \in \mathbb N$ such that $$2^k=2013 \cdot 10^q+r \,\,\,; \,\,\,r<10^q $$ I'm not sure if it's true or not. I would go for a 'no', but I can't prove it. Thanks for your help.
|
Prove that for any finite sequence of decimal digits, there exists an $n$ such that the decimal expansion of $2^n$ begins with these digits.
|
Is there any difference between "name of film" and "film's name"? How can I say that I need to remember film's name?
|
Which one is correct or are both correct? The boy's name is nice. The name of the boy is nice. I'm really confused these two sentences? Which one is more suitable?
|
I program MMO strategy game (C# monogame) like Goodgame Empire or Travian for Windows Phone. The server part of the game will run on Windows Server and MS SQL database. I'm trying to figure out a way to perform periodical operations over players' data. My point is that, for example farm will produce one piece of food every minute and I need store it to database in real time. I thought about that when registering a new player would cause the database start new job, but for example at 2000 players on the server I'm not sure if I do not kill performance. I want to find optimal solution and I wanted to ask your opinions on what you think would be the best solution.
|
I have a plan to build MMO strategy game like Goodgame Empire or Travian for Windows Phone. I want to program it in C# Monogame (because I have some good experience with it). But I still can't figure out how to do game-server communication. My plan is communicate with database through web service (WCF). For example, if player build some building then the game saves information about that building through a web service method to a database. But what if the player isn't logged in? For example farms produce some food every hour. How to count how much food the player has when he logs into game after some time? If you have some idea please let me know ;)
|
I would like to label data entries with multiple fields (that is easy, using the expression editor) in QGIS 2.18. But I fail to alter the styling of the labels, so that say the colour of the label from one data field (e.g., in the first line) was different to the second label value (second line). An older answer had the standard solution (duplicating the layer, ) I am wondering whether QGIS 2.18 or even the up and coming 3.0 will have a solution.
|
Is it possible to have label in QGis 2.8 two different colours? For example Field1 in red colour and Field2 in blue (Field1 || ‘ ’ || Field2).
|
When I bake with the bake mode "ambient occlusion" it ends in a horrible result. Anyone know the reason why this is happening? PS: It worked yesterday. I just opened it today and the model was black, so I hit bake again and it was then it happened.
|
I was following on creating a watch and noticed that when I rendered the watch, some pieces were messed up. I'm new to 3D modeling and I've just learned Blender, I can't explain it well, so here's a picture: Other examples: I don't know if it's a problem with my World texture, the object, or the object's texture/material, so I can't even guess how to fix it. What causes this? Is it possible to fix it?
|
I have this code. TelephonyManager tm=(TelephonyManager)getSystemService(Context.TELEPHONY_SERVICE); String showimei=tm.getDeviceId(); String viewimei = String.valueOf(imei); if (showimei==viewimei) { ACTION 1 } else { ACTION 2 { Assuming showimei is same as viewimei meaning the user is using the same smartphone with the application, Action 1 is supposed to happen. But it always goes to Action 2. How should I make this work?
|
I've been using the == operator in my program to compare all my strings so far. However, I ran into a bug, changed one of them into .equals() instead, and it fixed the bug. Is == bad? When should it and should it not be used? What's the difference?
|
Around six months ago, I did some light solder work in my room. I was pretty reckless with the lead solder, and even ate while soldering on several occasions. Should I be worried about the lead exposure? Since soldering in my room, I have vacuumed and wiped down my desk several times. Could small pieces of lead still be present?
|
I was reading about tin alloys for electronics soldering and found it it has about 40% of lead in composition. Lead, everyone knows, it's very dangerous to breathe due to being a heavy metal. Also, I found some recommendations using the combination of an exhauster and a respirator when working with soldering. Is there any international regularization of which respirator type should I use? If not, which type do you recommend? Beyond this, is there any additional safety equipment recommended? For economics reasons and for better soldering resistance, I've already discarded Pb free solder reflow.
|
Fix the language of set theory $\mathcal{L}=\{\in\}$. Let $\langle M,\in\rangle$ be a set or proper class model of ZFC (e.g. $M$ could be $L$, $HOD$, $V_{\kappa}$ for some inaccessible cardinal $\kappa$, etc.) consider the complete theory of this model in the language $\mathcal{L}$ that is $T_{M}:=Th(\langle M,\in\rangle)=\{\sigma\in\mathcal{L}~|~\langle M,\in\rangle\models \sigma\}$. My questions are about the possible number of countable models of this complete theory up to isomorphism $I(T_{M},\aleph_0)$ when $M$ varies over different models of $ZFC$. Question 1: What are $I(T_{L},\aleph_0)$ and $I(T_{HOD},\aleph_0)$, $I(T_{V_{\kappa}},\aleph_0)$ (for $\kappa$ inaccessible)? Question 2: Is there a set or proper class model $M$ of ZFC such that $I(T_{M},\aleph_0)=\lambda$ for each cardinal $\lambda\in\{1,3,4,\cdots,\aleph_{0},\aleph_1,2^{\aleph_{0}}\}$?
|
Assume that the meta theory allows for model theoretic techniques and handling infinite sets etc (The meta theory itself is, informally, "strong as ZFC"). Also assume that I'm studying ZFC inside this meta-theory and that I'm working with the assumption that ZFC is consistent. Let $ZFC\subset{T}$, where $T$ is a complete theory. I would like to know the number of non-isomorphic models of $T$ for some given $\kappa\geq{\aleph_{0}}$. I feel as if this should be the maximum number possible, i.e. $2^{\kappa}$. My idea for showing this was to use Shelah's theorem that says that unstable theories have $2^{\kappa}$ many models for any $\kappa>{\aleph_{0}}$ (which establishes the result for all uncountable $\kappa$). But in order to do this I first need to show that $T$ is unstable. However I'm not sure about how to do this (or even if I'm on the right track). Any help would be much appreciated.
|
We have 2 array,having some element. Comparing both array element at same index, if equal +4 and -1 if not. Example: array1=[a b a b], array2=[a a b b] explanation: array1[0]==array2[0] //+4 array1[1]!=array2[1] //-1 aarray1[2]==array2[2] //+4 aarray1[3]!=array2[3] //-1 OUTPUT//6** My code: import java.util.Scanner; class Solution { public static int scoreExam(String[] correct, String[] student) { int count=0; for (int i=0;i<correct.length ;i++ ) { for (int j=0;j<student.length ;j++ ) { if(i==j) { if(correct[i]==student[j]) { count=count+4; } else if(correct[i]!=student[j]) { count=count-1; } } } } return (count); } public static void main(String[] args) { Scanner sc=new Scanner(System.in); String[] array1String,array2String; String[] array2; int n=Integer.parseInt(sc.nextLine()); array1String=sc.nextLine().split("//s+"); array2String=sc.nextLine().split("//s+"); array2=new String[array2String.length]; for (int i=0;i<array2String.length ;i++ ) { if (array2String[i].equals("blank")) { array2[i]=""; } else { array2[i]=array2String[i]; } } System.out.println(scoreExam(array1String, array2)); } }
|
I've been using the == operator in my program to compare all my strings so far. However, I ran into a bug, changed one of them into .equals() instead, and it fixed the bug. Is == bad? When should it and should it not be used? What's the difference?
|
I am coming from JavaScript, in which callbacks are pretty easy. I am trying to implement them into JAVA, without success. I have a Parent class: import java.net.Socket; import java.util.concurrent.ExecutorService; import java.util.concurrent.Executors; public class Server { ExecutorService workers = Executors.newFixedThreadPool(10); private ServerConnections serverConnectionHandler; public Server(int _address) { System.out.println("Starting Server..."); serverConnectionHandler = new ServerConnections(_address); serverConnectionHandler.newConnection = function(Socket _socket) { System.out.println("A function of my child class was called."); }; workers.execute(serverConnectionHandler); System.out.println("Do something else..."); } } Then I have a child class, that is called from the parent: import java.io.IOException; import java.net.ServerSocket; import java.net.Socket; import java.util.logging.Level; import java.util.logging.Logger; public class ServerConnections implements Runnable { private int serverPort; private ServerSocket mainSocket; public ServerConnections(int _serverPort) { serverPort = _serverPort; } @Override public void run() { System.out.println("Starting Server Thread..."); try { mainSocket = new ServerSocket(serverPort); while (true) { newConnection(mainSocket.accept()); } } catch (IOException ex) { Logger.getLogger(Server.class.getName()).log(Level.SEVERE, null, ex); } } public void newConnection(Socket _socket) { } } What is the right way of implementing the serverConnectionHandler.newConnection = function(Socket _socket) { System.out.println("A function of my child class was called."); }; part, in the Parent class, which is clearly not correct?
|
Is there a way to pass a call back function in a Java method? The behavior I'm trying to mimic is a .Net Delegate being passed to a function. I've seen people suggesting creating a separate object but that seems overkill, however I am aware that sometimes overkill is the only way to do things.
|
Def: The product topology is generated by sets of the form $\prod\limits_{n\in\mathbb{N}} U_n$ where each $U_n$ is open in $X_n$ and, for all but finitely many $n$, we have $U_n = X_n$. I am looking for an answer that explains how the open sets in the final topology is affected by the definition especially for all but finitely many $n$, we have $U_n = X_n$.
|
Why are box topology and product topology different on infinite products of topological spaces ? I'm reading Munkres's topology. He mentioned that fact but I can't see why it's true that they are different on infinite products. So , Can any one please tell me why aren't they the same on infinite products of topological spaces ?
|
I have the following prompts [/share/registrazioni/Script] # cat delete_7gg.sh #!/bin/sh find /share/registrazioni/ -type f -mtime +7 -delete [/share/registrazioni/Script] # which sh /bin/sh [/share/registrazioni/Script] # chmod +x delete_7gg.sh [/share/registrazioni/Script] # ./delete_7gg.sh -sh: ./delete_7gg.sh: /bin/sh^M: bad interpreter: No such file or directory why do I get /bin/sh^M: bad interpreter: No such file or directory ? I made the script with vi. I made the script in a qnap qts 4.3.6 that I can reach via ssh. The script should simply delete files older than seven days. I can't install dos2unix because the system has no package manager. I just expected to make a script and put it into cron. but I'm receiving that error instead.
|
Why are the shebang parts of the following elementary scripts not working: $ cat hello.sh #! /bin/sh echo Hello $ ./hello.sh bash: ./hello.sh: /bin/sh^M: bad interpreter: No such file or directory $ cat hello.py #! /usr/bin/env python3 print("Hello") $ ./hello.py : No such file or directory whereas calling the interpreter manually is working: $ sh hello.sh Hello $ python3 hello.py Hello
|
Is it correct to say that "A function or a map or a mapping is a binary relation such that ..."
|
I wonder if there is any difference between mapping and a function. Somebody told me that the only difference is that mapping can be from any set to any set, but function must be from $\mathbb R$ to $\mathbb R$. But I am not ok with this answer. I need a simple way to explain the differences between mapping and function to a lay man together with some illustration (if possible). Thanks for any help.
|
$\varnothing\neq A \in 2^\mathbb R$, $A^s$ is isolated points of $A$. Is $A^s$ closed set? notation: x is isolated point means $\exists r>0 [N(x;r)\cap A=\{x\}]$ I would like to prove but I have no idea. I'm a uni student studying the very beginning of topology. Could you help me.
|
In metric space, $(X,d)$ I know limit points of some set(S maybe) is closed in X Then is set of isolated points of S is closed? Want to make sure if closure of isolated points of S doesn't intersect with limit points of S But i think i got it and i think i should leave it for people like me
|
My system is 64-bit Ubuntu 13.04. I'm trying to connect through USB 3.0 port. Output of lsusb Bus 003 Device 005: ID 12d1:1446 Huawei Technologies Co., Ltd. E1552/E1800/E173 (HSPA modem) I want to access MTS Mblaze for internet. I was not able to create connection so I googled and found out that 'crossplatformui-v2.1.2-sstl-all-ubuntu.deb' would solve the problem. I downloaded this package and tried to install but I'm getting Package is of bad quality error.
|
What does it mean to have a Bad Quality Package (What qualities would it have to be a Bad quality package) and what happens if I install a package that has bad quality but still installs.
|
I'm trying to render an animation. It's a space launch vehicle that is moving up, and I've added a quick smoke effect with a square mesh attached to it at the bottom, but when I render it, the fire doesn't show up at all. I can only see the smoke. Are there any particular settings that I should change or add? I rendered it in blender cycles. I would really appreciate if someone out there knows why this is happening or if there are setting that need to be added, or modified. Thank you, Mari
|
I am trying to make an explosion in Blender. I am having a problem with the smoke simulation with the Cycles rendering engine. More specifically, I have been able to render smoke, but flames do not show up. In the viewport however, everything looks perfectly fine. The render looks like this: But in the viewport, it is clear that there are flames. Does anyone have any idea what is going on? This is NOT a duplicate of because I have Flame Rate set to 1.0
|
So far I have this. I have a feeling I'm getting off track with the last two steps. We want to prove $\sum_{i=1}^{n} \frac{1}{\sqrt{i}}$ $< 2\sqrt{n}$ for $n \geq 1$ Base Case Prove P(1): $\sum_{i=1}^{1} \frac{1}{\sqrt{1}}$ $< 2\sqrt{1}$. We get $1 < 2$. Induction Hypothesis $\sum_{i=1}^{n} \frac{1}{\sqrt{n}}$ $< 2\sqrt{n}$ is true for $n \geq 1$ Induction Step Prove P(k + 1): $\sum_{i=1}^{k + 1} \frac{1}{\sqrt{k + 1}} < 2\sqrt{k + 1} $ LHS = $\sum_{i=1}^{k + 1} \frac{1}{\sqrt{k + 1}}$ = $\sum_{i=1}^{k} \frac{1}{\sqrt{k}}$ - 1 + $\frac{1}{\sqrt{k + 1}}$ + $\frac{1}{\sqrt{k + 2}}$ $< 2\sqrt{k}$ - 1 + $\frac{1}{\sqrt{k + 1}}$ + $\frac{1}{\sqrt{k + 2}}$
|
I am just starting out learning mathematical induction and I got this homework question to prove with induction but I am not managing. $$\sum_{k=1}^n\frac1{\sqrt k}<2\sqrt n$$ Please help!
|
gcc c99 MS2005/2008 I have started program that will be compiled on linux/windows. The program will be compiled on linux using gcc 4.4.1 c99. And on windows the compiler will be either MS 2005/2008. And this I cannot change. I am using SCons to create the build files. However, the reason I choose c99 as I can use the stdint.h so my integers would be compatible between different architectures i.e. x86_32 and 64 bit. using int32_t so it will compile without any problem on both 32 and 64 bit machines. However, I have just discovered that c99 isn't used for ms compilers. Only c89. However, c89 doesn't have the stdint.t. I am wondering what is the best way to make the integer portable among different compilers running on either 32 or 64. Many thanks for any advice,
|
To my amazement I just discovered that the C99 stdint.h is missing from MS Visual Studio 2003 upwards. I'm sure they have their reasons, but does anyone know where I can download a copy? Without this header I have no definitions for useful types such as uint32_t, etc.
|
In Minecraft 1.8, the Adventure gamemode is much more configurable than it has been in previous versions. However, by default, players cannot break or place blocks at all. In previous versions, players could break blocks given the proper tool (e.g., a player could break stone if they had a pickaxe), and place blocks freely. Is there a way to reproduce this old behavior in Minecraft 1.8?
|
Up until Minecraft 1.7.10 I enjoyed playing in adventure mode, which restricts one to use the right tools to destroy or harvest blocks (to have a more realistic experience). In this version (and before that), it was still possible to place blocks without much restrictions. But now in 1.8, sadly, I discovered that this behaviour was changed, and my favourite gamemode was "gone": I'm unable to place any blocks and cannot break any blocks even when using the proper tool (axe for trees etc.). How can I emulate 1.7.10's adventure mode while playing the new version (1.8)? Can I define rules for every tool with the command block somehow? (PS: i would prefer a solution without modding the game, staying with pure vanilla MC if possible)
|
I'm attempting to update a script that I used in ArcMap for ArcGIS Pro. Getting an AttributeError: 'list' object has no attribute 'ListLayers' Any ideas? I based this on the code snippet here: import arcpy aprx = arcpy.mp.ArcGISProject('CURRENT') lyr = aprx.listMaps('GeologicHazardMap').listLayers('qfaults')[0] cp = lyr.connectionProperties cp['connection_info']['database'] = 'N:\\ReferenceMaterials\\ArcGIS Python\\Current Catalog\\Test Data' cp['dataset'] = 'FaultsReprojected.shp' lyr.updateConnectionProperties(lyr.connectionProperties, cp)
|
A common ArcPy coding pattern that I used with ArcGIS Pro 1.4 (and earlier) no longer works at ArcGIS Pro 2.0. I have an ArcGIS Pro project with one map called Map, and that map has one layer called Test Layer. Test Layer has as its data source a file geodatabase feature class called testFC. I have used the Select tool to create a new feature class called testFC2 which is a subset of testFC (so it has an identical schema). In ArcPy at ArcGIS Pro 1.4 I had no trouble switching the data source of Test Layer from testFC to testFC2 in the same file geodatabase using this code: import arcpy aprx = arcpy.mp.ArcGISProject(r"C:\temp\test.aprx") mapx = aprx.listMaps("Map")[0] lyr = mapx.listLayers("Test Layer")[0] lyr.dataSource = r"C:\temp\test.gdb\testFC2" However, the same code at ArcGIS Pro 2.0 gives: AttributeError: can't set attribute I checked the and that now says that the dataSource property is now Read Only whereas previously it was Read and Write. The same help page says: Changing a layer's data source is a common requirement. There is a method and a property on the Layer object that help with this. For a more detailed discussion, parameter information, scenarios, and code samples, please refer to the help topic. I can find no suitable code sample to use in place of my coding pattern at which seems to be focussed on switching workspaces of data sources. How do we switch the data source of a layer to a new feature class using ArcPy with ArcGIS Pro 2.0? The same issue seems to have been noted at where Marco Boeringa says: The "dataSource" property of the Layer class also seems to have become Read Only. However, you can use the "updateConnectionProperties" on the same class to solve this However, I think his situation must have been slightly different because I cannot see how updateConnectionProperties can be used to answer my question above.
|
Here is how my GParted interface looks like: I want to add the unallocated space to my Ubuntu partition. However, when I try to resize/move I am not allowed to do so:
|
Previously, I have installed Windows 7 on my 320 GB laptop with three partitions 173, 84 and 63 GB each. The 63 GB partition was where the Windows was installed. The rest were for file containers. Now I changed my OS to Ubuntu 12.04 LTS. I installed Ubuntu by replacing the entire Windows 7 on the 63 GB partition. The rest of the partitions remain as an NTFS Windows partition and I can still access them both (the 173 and 84 GB partitions). Now I want to change the two partitions of Windows into an Ubuntu format partitions plus most importantly, I want to extend the 63 GB partition to more than a 100 GB because at the moment I am running out of disk space. Whenever I try to install any application, especially using wine, it always complains for a shortage of disk space. How do I do the extending activity before I entirely format my laptop again and lose all the important files on my partitions?
|
I'm not quite sure if I'm phrasing this right. It's just occurred to me that lat/longs are two dimensional coordinates like any other projected coordinate system, so it's presumably possible to create a two dimensional map based on these unprojected coordinates. It would obviously be centred on the point (0,0) (off the west coast of Africa, on the equator), and the 180 meridian would be exactly on the left and right borders. Is there a name for this kind of "non-projection"? Presumably there are images of it, but I'm just not sure what to look for.
|
May I know what is the correct specific term for latitude longitude coordinate system? With "", it seems to be a general term for every other system?
|
Created a bootable USB from an iso-file with sudo dd if=./ubuntu-18.04.3-desktop-amd64.iso of=/dev/sda1 bs=8M using BIOS does not see this USB. Did Fedora 31 mess up my BIOS and what can I do?
|
I would like to see a full how-to guide on how to install Ubuntu.
|
I am trying to extract a date from a string using regex in Python 3 (using Anaconda & Jupyter Notebooks on Win10). This seems like a simple task but the pattern I'm trying to find doesn't seem to want to extract the date properly using the string that I need to work with. The pattern appears to work properly for other strings however. Here's my code: # Trying to extract this text sequence from the test string: 'April 2, 2020 at 12:30PM'. import re test = 'Hampden\n \nUnknown\n \nYes\n \nFemale\n \n30s\n \nSuffolk\n \nYes\n \nYes\n \n\nPAGE2\nMASSACHUSETTS DEPARTMENT OF PUBLIC HEALTH\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \nData are cumulative and current as of \nApril \n2\n, 2020 at 12:30PM.\n \n*Other commercial and clinical laboratories continue to come on line. As laboratory testing results are \nprocessed and the source verified, they will be integrated into this daily report\n.\n \nL\naboratory\n \nTotal\n \nPatients \nPositive\n \nTotal Patients Tested\n \nMA State Public Health Laboratory\n \n912\n \n7355\n \nARUP\n \nLaboratories\n \n17\n \n187\n \nBaystate Medical Center\n \n5\n \n12\n \nBedford \nResearch Foundation\n \n30\n \n219\n \nBeth Israel Deaconess Medical Center\n \n686\n \n3976\n \nBioReference Laboratories\n \n9\n \n43\n \nBoston Medical Center\n \n236\n \n647\n \nBROAD Institute CRSP\n \n348\n \n1784\n \nCenters for Disease Control and Prevention\n \n1\n \n11\n \n\n \n11\n \n195\n \nGenesys Diagnostics\n \n106\n \n145\n \nLabCorp\n \n715\n \n4836\n \nMayo Clinic Labs\n \n353\n \n1812\n \nPartners Healthcare\n \n740\n \n4112\n \nQuest Laboratories\n \n4161\n \n27606\n \nSouth Shore Hospital\n \n7\n \n34\n \nTufts Medical Center\n \n463\n \n2154\n \nUMASS Memorial Medical Center\n \n32\n \n163\n \nViracor\n \n80\n \n1150\n \nOther\n \n54\n \n167\n \nTotal\n \nPatients Tested*\n \n8966\n \n56608\n \n' newtest = test.replace("\n", "") result1 = re.findall(r"Data are cumulative and current as of (.+)\.", newtest, re.IGNORECASE) print(result1) # This returns "April 2, 2020 at 12:30PM. *Other commercial and clinical laboratories continue to # come on line. As # laboratory testing results are processed and the source verified, they will be integrated into this # daily report". # Why does it not find the . after the PM and stop extracting? # When I attempt to run the pattern again on result1, again, it doesn't seem to find the . after the # PM (it extracts until the next period) and # returns: "April 2, 2020 at 12:30PM. *Other commercial and clinical laboratories continue to come on # line". # What is special about that . after PM that keeps regex from seeing it??? result2 = re.findall(r"(.+)\.", result1[0], re.IGNORECASE) print(result2) # If I use the same pattern on a subset of the test string, it sees the . after the PM and returns # the correct result. Why??? subtest = 'Data are cumulative and current as of April 2, 2020 at 12:30PM. *Other commercial' result3 = re.findall(r"Data are cumulative and current as of (.+)\.", subtest, re.IGNORECASE) print(result3) I'm guessing I must be doing something stupid but I haven't been able to figure out what it is. Can anyone provide some guidance? I could change the pattern to this (r"Data are cumulative and current as of (.+[P|A]M)") and it works properly on all strings but would still like to know why it seems to be having problems seeing the . after the PM. Appreciate any help.
|
I have this gigantic ugly string: J0000000: Transaction A0001401 started on 8/22/2008 9:49:29 AM J0000010: Project name: E:\foo.pf J0000011: Job name: MBiek Direct Mail Test J0000020: Document 1 - Completed successfully I'm trying to extract pieces from it using regex. In this case, I want to grab everything after Project Name up to the part where it says J0000011: (the 11 is going to be a different number every time). Here's the regex I've been playing with: Project name:\s+(.*)\s+J[0-9]{7}: The problem is that it doesn't stop until it hits the J0000020: at the end. How do I make the regex stop at the first occurrence of J[0-9]{7}?
|
I have several dwellers who train high SPECIAL attributes, but are needed elsewhere at times (someone has to keep the lights on). I have noticed that, most of the time (I haven't checked for all scenarios), training times resume back where I left them if the dweller was interrupted or made to work elsewhere; it is as if the system is tracking how much training has been done and getting the dweller back on track. Is training investment wasted on a dweller if it is interrupted for significant amounts of time for other tasks (including death and exploration)?
|
I know that event responses are different, since characters go right back to their original assigned places. What I'm wondering is if you have a character in a training room and swap them out (say, for a child that just turned into an adult), do you lose all training progress?
|
While trying to change the proxy settings for Google Chrome from Advanced Settings on Ubuntu 16.10, I am getting the following error: When running Google Chrome under a supported desktop environment, the system proxy settings will be used. However, either your system is not supported or there was a problem launching your system configuration. But you can still configure via the command line. Please see man chrome for more information on flags and environment variables. Well my friend using Ubuntu 16.04 is able to do it from the Chrome UI itself.
|
I want to use the Ubuntu Software Center to install software, but I cannot download them. How can I give my proxy settings in Ubuntu terminal (just like we use cmd in Windows to choose IE proxy settings)?
|
I understand that everything with mass does have a gravitational pull no matter how small the object, which means even a grain of sand has a gravitational pull. But light is something that exists, which means it must be made out of something, which is Photons. And doesn't that mean that the photons must have at least a small area which contact can be made? And if that's true doesn't that mean it has some sort of mass? Do we just say light has no mass because it's so little that it's completely useless to recognize?
|
I know a photon has zero rest mass, but it does have plenty of energy. Since energy and mass are equivalent does this mean that a photon (or more practically, a light beam) exerts a gravitational pull on other objects? If so, does it depend on the frequency of the photon?
|
I want to update to windows 8.1 from the Windows 8 installation that came with my computer. In Windows Store I see that there is an update to 8.1 (about 3.6GB). Will all my files, programs, apps, and data remain as they were in Windows 8? Normally when you install windows on a computer without it, all the data on the C drive is removed, will this happen with the 8.1 update from the Windows Store?
|
I installed Windows 8.1 from within Window 8 and noticed my apps don't work anymore, some are gone and a ton of stuff is missing. Is there no way to keep all the Windows settings and apps when doing this upgrade?
|
Ive been trying to follow this tutorial but i got lost... The mirror is inverted... I want it to be a closed object, not open from both sides.
|
When I add a mirror modifier it sometimes doesn't mirror correctly, giving me an overlapping mesh. How can I fix this?
|
I have created an x-o game with GUI and almost finished it, but I have difficulties declaring the winner, I managed to do it manually but it took alot of code lines and it looks messy, here's what I did: if((buttons[0].getText()=="X" && buttons[1].getText()=="X" && buttons[2].getText()=="X") || (buttons[0].getText()=="X" && buttons[3].getText()=="X" && buttons[6].getText()=="X") || (buttons[4].getText()=="X" && buttons[8].getText()=="X" && buttons[2].getText()=="X") || (buttons[0].getText()=="O" && buttons[1].getText()=="O" && buttons[2].getText()=="O") || (buttons[0].getText()=="O" && buttons[3].getText()=="O" && buttons[6].getText()=="O") || (buttons[4].getText()=="O" && buttons[8].getText()=="O" && buttons[2].getText()=="O") || (buttons[2].getText()=="X" && buttons[5].getText()=="X" && buttons[8].getText()=="X") || (buttons[1].getText()=="X" && buttons[4].getText()=="X" && buttons[7].getText()=="X") || (buttons[6].getText()=="X" && buttons[7].getText()=="X" && buttons[8].getText()=="X") || (buttons[2].getText()=="O" && buttons[5].getText()=="O" && buttons[8].getText()=="O") || (buttons[1].getText()=="O" && buttons[4].getText()=="O" && buttons[7].getText()=="O") || (buttons[6].getText()=="O" && buttons[7].getText()=="O" && buttons[8].getText()=="O") || (buttons[3].getText()=="X" && buttons[4].getText()=="X" && buttons[5].getText()=="X") || (buttons[3].getText()=="O" && buttons[4].getText()=="O" && buttons[5].getText()=="O") || (buttons[0].getText()=="X" && buttons[4].getText()=="X" && buttons[8].getText()=="X") || (buttons[0].getText()=="O" && buttons[4].getText()=="O" && buttons[8].getText()=="O") ) So I wanted to shorten this and add it in a loop, but it didnt work. for(int i=0;i<9;i++) { if(i%3==0){ y+=50; x=40; } buttons[i]=new JButton(); buttons[i].setSize(50, 50); buttons[i].setLocation(x, y); int temp=i; buttons[temp].addActionListener(new ActionListener() { public void actionPerformed(ActionEvent e) { String currentPlayer = turnCount % 2 == 0 ? "X" : "O"; buttons[temp].setText(currentPlayer); buttons[temp].setFont(new Font("Arial", Font.PLAIN, 30)); buttons[temp].setMargin(new Insets(0, 0, 0, 0)); buttons[temp].setEnabled(false); turnCount++; if(buttons[temp].getText()==buttons[temp+1].getText()) { System.out.println("GAME OVER!"); for(int i=0;i<9;i++) buttons[i].setEnabled(false); turnCount = 0; } } }); myForm.add(buttons[i]); x+=50; } It should print the code inside the if statement whenever 2 following buttons have the same value, but it doesn't work. This is exactly what needs to be changed somehow if(buttons[temp].getText()==buttons[temp+1].getText()) Thank you.
|
I've been using the == operator in my program to compare all my strings so far. However, I ran into a bug, changed one of them into .equals() instead, and it fixed the bug. Is == bad? When should it and should it not be used? What's the difference?
|
I have a folder called Programming under my /home partition. I mounted a partition of 50gb under the Programming partition permanently. Everything works fine. But I don't want to visually show the mounted partition explicitly in the Ubuntu explorer(not sure what's the exact term). How do I achieve this? [The partition in question is the highlighted one Prog . I don't want to display it.]
|
I need to hide an NTFS partition from listing in the nautilus. How can I achieve that? Is there any tool to do that? And how can I hide files in ubuntu (except . operator)
|
I am running a logistic regression in R, such as: glm(cbind(successes,tries-successes) ~ A + B, family="binomial") A is numeric, B is a factor. A only contains 4 different unique values; 2 of these never lead to 'successes', one value almost never does and the fourth value leads to a lot of successes. All 4 values are on a clearly interpretable linear scale, but it seems there is sort of a threshold value, above which successes can be reached. The factor B has two levels, both of which can lead to successes. When I run the GLM and look at my estimators for the different levels of B, the confidence intervals are huge. If I run the same GLM only including B, the confidence intervals for the estimators are reasonably narrow. If I run the full model, but treating both, A and B as factors, I also get reasonable confidence intervals. This leads me to the conclusion that including A as a numeric fixed effect 'ruins' the model. However, turning it into a factor also doesn't seem right, as the order (and possibly magnitude) does matter. So my questions are: Would it make sense to treat A as an ordered factor? This looses information on the magnitude of differences on the numeric scale, but at least keeps the ordering. And it seems to be the only way of building a functioning model including both, A and B. Why do I see this weird behaviour that A as a numeric variable 'destroys' the whole model? I find this especially intriguing, as there is no interaction term included. Do you think there is another way of solving the problem? Would it help including B maybe as a numeric column, but within a quadratic term, to acknowledge more this kind of 'threshold' behaviour?
|
If you have a variable which perfectly separates zeroes and ones in target variable, R will yield the following "perfect or quasi perfect separation" warning message: Warning message: glm.fit: fitted probabilities numerically 0 or 1 occurred We still get the model but the coefficient estimates are inflated. How do you deal with this in practice?
|
for a filemanagement i calculate the size of each file and the directories in a specific folder. I calculate the size of the files like below: sizeFormat(filesize($dir . '/' . $file)) and the size of the directories (included subdirs) like below: sizeFormat(recursive_directory_size($dir . '/' . $file)) How can i calculate now the sum size of all files and directories in that specific folder?
|
function foldersize($path) { $total_size = 0; $files = scandir($path); foreach($files as $t) { if (is_dir(rtrim($path, '/') . '/' . $t)) { if ($t<>"." && $t<>"..") { $size = foldersize(rtrim($path, '/') . '/' . $t); $total_size += $size; } } else { $size = filesize(rtrim($path, '/') . '/' . $t); $total_size += $size; } } return $total_size; } function format_size($size) { $mod = 1024; $units = explode(' ','B KB MB GB TB PB'); for ($i = 0; $size > $mod; $i++) { $size /= $mod; } return round($size, 2) . ' ' . $units[$i]; } $SIZE_LIMIT = 5368709120; // 5 GB $sql="select * from users order by id"; $result=mysql_query($sql); while($row=mysql_fetch_array($result)) { $disk_used = foldersize("C:/xampp/htdocs/freehosting/".$row['name']); $disk_remaining = $SIZE_LIMIT - $disk_used; print 'Name: ' . $row['name'] . '<br>'; print 'diskspace used: ' . format_size($disk_used) . '<br>'; print 'diskspace left: ' . format_size($disk_remaining) . '<br><hr>'; } Any idea why the processor usage shoot up too high or 100% till the script execution is finish ? Can anything be done to optimize it? or is there any other alternative way to check folder and folders inside it size?
|
I used the official install guide: Unfortunately, at the last step, I got the following error: ~$ sudo apt install --install-recommends winehq-devel Terminal output -> Some packages could not be installed. This may mean that you have requested an impossible situation or if you are using the unstable distribution that some required packages have not yet been created or been moved out of Incoming. The following information may help to resolve the situation: The following packages have unmet dependencies. winehq-devel : depends on: wine-devel (=4.19~bionic) E: Unable to correct problems, you have held broken packages. I tried to uninstall all wine packages one by one before I re-installed it, now I m stuck with the wine-devel package, I cant delete for some reason. Any ideas what could fix my problem? (Chose the development-branch (winehq-devel) instead stable-branch for I wanted to have the latest version 4.19 -> reason for trying to update to 4.19 was the announcement of: More stateblock support in WineD3D.)
|
After upgrading from 10.04 to 12.04 I am trying to install different packages. For instance ia32-libs and skype (4.0). When trying to install these, I am getting the 'Unable to correct problems, you have held broken packages' error message. Output of commands: sudo apt-get install -f Reading package lists... Done Building dependency tree Reading state information... Done 0 upgraded, 0 newly installed, 0 to remove and 0 not upgraded. After running this: sudo dpkg --configure -a foo@foo:~$ sudo apt-get install -f Reading package lists... Done Building dependency tree Reading state information... Done 0 upgraded, 0 newly installed, 0 to remove and 0 not upgraded.
|
LIGO is designed to detect changes in length on the order of 10,000ths the scale of a proton. I know they are extremely well isolated from their surroundings, but how could we even approach isolation at such a scale? Wouldn't even the vibration of the molecules making up the system be picked up by the sensor?
|
Since LIGO is dealing with readings at nanometers, events such as vehicles driving nearby, and constant (but extremely minor) tremors of the earth can cause movement with the mirrors at nanometers. Such tiny movements are extremely difficult to measure, but can easily cause errors when using such a small scale. How does LIGO remove these factors, and take precautions to prevent false readings due to noise?
|
It is always known that electrons and protons have opposite charges but what gives electrons or protons the charges they have?
|
Baryons have charges that are the result of a polynomial calculation of their building blocks (quarks)'s fractional charges. But what gives these quarks electric charges? What interactions do they have with photons? And what about leptons, like muons and electrons? How do they get their -1 charge? And then, how do positrons and anti-muons get +1 charge? Same goes for quarks: how does up-antiquarks get -2/3 charge? Or I may want to formulate my question this way: How does any elementary particle interact with the EM-Force to get an electric charge?
|
Seems like every time I open the dev console these days I get this message: The Developer Console didn't set the DEVELOPER_LOG trace flag on your user. Having an active trace flag triggers debug logging. You have 403 MB of the maximum 250 MB of debug logs. Before you can edit trace flags, delete some debug logs. I've had to manually query ApexLog using the Tooling API and delete the existing logs every time for new logs to start recording again. I did hear somewhere that SF switched from a time limit on debug logs to a size limit... But is there a setting change that allows SF to go back to deleting the oldest logs when the size limit is reached?
|
Recently I have regularly been getting the error message below when opening the Developer Console: The Developer Console didn't set the DEVELOPER_LOG trace flag on your user. Having an active trace flag triggers debug logging. You have 316 MB of the maximum 250 MB of debug logs. Before you can edit trace flags, delete some debug logs. It happens in sandbox and scratch orgs. Haven't tried in production. This only started happening recently. It goes away after clearing the logs but comes back after a few test runs. Also: the Debug->Clear->Log Panel action is not working for me -- the logs stay put. I can remove them using the Query Editor as described , but it's pretty tedious. Two questions: Does anyone know a way to prevent the logs from exceeding the max level? Perhaps by having old logs cleared out automatically? Is there a known issue with the Clear Log Panel action? I am using Chrome btw. Thanks!
|
I have a scene below where I am wanting to get an HDRI image to come in through the windows and light the scene in the window areas and have a god ray like effect. I want to do this with a volumetric effect and have the HDRI lighting create throw patterns in the scene. Is this possible? To have volumetric lighting where the HDRI creates throw patterns? Thanks for the help
|
I have scene that looks like this: And I want to add volumetric lighting to it so that light forms a rays of light when it go through the trees like on this example that I found in youtube: But the problem is that all of these tutorials show how to make this lighting coming from windows, but when I try to replicate it in my forest scene it looks like big ugly fog with cubical shape. Also the light is coming from the back of the camera (as you can see) and there are some spots that needs this special lighting (like places where light goes through trees) and some that don't (like big bright are on the bottom left corner) so I can't just add a giant cube to all of the scene.
|
Using the three prepositions (in/on/at) when their use is related to the word after them is very confusing to learners. E.g. in these examples all the prepositions refer to a location: The players were on court for three hours Do you feel sleepy at school or at work? Originally found in all countries Also, the three prepositions are used to refer to a time like on the weekend, at 7 AM and in the morning. Is there an easy way to tell which one is correct to use? If not, can someone please lead me to where (a website) I can learn to use them correctly?
|
I am really confused. Which preposition is correct? She is in/at the park. They are in/at the park. I am in/at the park. Should I use in or at in these sentences?
|
I voted to close as a dupe/too localized and then answered the . My solution is correct, It got +1/-4 but OP accepted it. the comments on my answers are saying you should not answer a dupe, or you answered and closed, so that I will earn points. Few thinking as answer is incorrect so got downvotes. Now I want to delete the answer, I commented and asked OP to un-accept but he is not doing so, can I flag it to moderator?
|
I made a mistake today. I . (A C# question, no less. My head is truly hanging in shame.) Unfortunately, by the time this was pointed out, the answer had already been accepted. Another answer has been posted which is correct. It has more votes than mine, and mine has some downvotes (still a balance of upvotes, but...) Unfortunately because the answer has been accepted, I can't delete my answer. I've edited it so that it's correct - it won't mislead anyone any more - but I'd far rather delete it to let the original correct one float to the top. In this case I suspect it won't be a real problem - the question author is reasonably regular, so hopefully he'll transfer acceptance to another answer reasonably soon. However, I can easily foresee situations where this wouldn't happen. Could I suggest that the author of the accepted answer should be able to delete it, if the answer has received some threshold of downvotes (e.g. 3)? Deleting the answer straight away would have been preferable to editing it to be correct, effectively duplicating the effort already put in by Luis Filipe in this case. I understand the "we don't want to lose value" argument for not letting a question author delete their own question after it's had good answers, but if an answer has received downvotes (so at least some of the community think it's harmful) and the answer's author thinks it should be removed, I think that should override the questioner's choice.
|
We represent an element of the domain as an equivalence class $\bar x$, and use the notation $ \left[ x \right]$ for equivalence classes in the codomain. Show that this is not well defined. $ f: \Bbb Z_{4} \rightarrow \Bbb Z_{6} \; \text{ given by, } f(\bar x) = \left[ 2x+1\right]$ My question is how do does one determine/ show that this is not a function? How does one show that this not one to one? $f(\bar 0) = 2(0) +1 = [1]$ $f(\bar 1) = [3]$ $f(\bar 2) = [5]$ $f(\bar 3) = [7]$ $f(\bar 4) = [9]$ $f(\bar 5) = [11]$ $f(\bar 6) = [13]$ I also guessing here that if a number is a multiple of another then that may play a role in determining it if is one-one.
|
By naming an equivalence class in the domain that is assigned at least two different values prove that the following is not a well defined function. $$f : \Bbb Z_{3} \to \Bbb Z_{6} \;\;\;\text{ given by } f(\overline x) = [x] $$ In this case we represent an element of the domain as an $\bar x$ and use the notation $[x]$ for equivalence classes in the co-domain. $f(\overline0) = [0] \;,$ $ \Bbb Z_{3} \quad (3x+0)\;\; \overline 0 = \{ ...-6,-3,0,3,6... \}, \; \Bbb Z_{6}\; (6x+0)\; \overline0 =\{ ...-12,-6,0,6,12...\}$ $f(\overline1) = [1], $ $\qquad \; (3x+1) \; \;\;\;\overline 1 = \{ ...-5,-2,1,4,7 ... \},\; \; (6x+1)\;\overline1 =\{...-11,-5,1,7,13.. \}$ $f(\overline2) = [2], $ $\qquad \qquad \qquad \;\overline 2 = \{ ...-4,-3,2,5,8 ... \},\;\;\overline 2 = \{ ...-10,-4,2,8,14 ...\},\;$ $f(\overline3) = [3] ,$ $\qquad \qquad \qquad \qquad \qquad \qquad,\; \quad \quad \quad \; \; \; \;\overline 3 = \{ ...-9,-3,3,9,15 ... \},$ $f(\overline4) = [4],\qquad \qquad \qquad\qquad \qquad\qquad \; \quad \quad \quad \quad \; \;\overline 4 = \{ ...-8,-2,4,10,16... \}, $ $f(\overline5) = [5], \qquad \qquad \qquad\qquad \qquad\qquad \; \quad \quad \quad \quad \;\;\overline 5 = \{ ...-7,-1,5,11,17... \}, $ $f(\overline6) = [6] ,$ So my main question for this problem is how to find out if this question is not a function. From the information I have gathered here I still cannot see why this is not a function any help on showing how this is not function would be much appreciated. The set of equivalence classes for the relation $\cong_{m}$ is denoted $\Bbb Z_{m}$ The $ 3x+0 \text{ and } 6x+0$ are just showing how I got $\overline 0 $
|
I'm training a CNN model for binary classification. The obtained confusion matrix and some corresponding performance measures on validation set are as follows: ans = 11046 177 561 9306 accuracy: 0.965007 sensitivity: 0.943144 specificity: 0.984229 precision: 0.981335 recall: 0.943144 f_measure: 0.961860 gmean: 0.963467 It seems the results are good. But the training loss seems bad, as shown as follows: Is this a good model?
|
I've fitted my model and am trying to understand whether it's any good. I've calculated the recommended metrics to assess it ($R^2$/ AUC / accuracy / prediction error / etc) but do not know how to interpret them. In short, how do I tell if my model is any good based on the metric? Is an $R^2$ of 0.6 (for example) sufficient to let me proceed to draw inferences or base scientific/business decisions? This question is intentionally broad, to cover a wide variety of situations that members frequently encounter; such questions could be closed as duplicates of this one. Edits to broaden the scope beyond the metrics mentioned here are welcome, as are additional answers - particularly those that offer insight about other classes of metrics.
|
Consider the following scenario if you were at a music concert: A singer sings into a microphone The sound comes out from the speakers The sound from the speaker is picked up by the microphone The sound comes out from the speakers The sound from the speaker is picked up by the microphone ... This kind of loop can manifest itself in other ways. E.g. happiness breeds success, success breeds happiness which breeds success, and so on. What’s the best word/phrase that captures this phenomenon?
|
Can you think of a word that is like a vicious circle, i.e. where it's difficult to say which thing creates the other, but not in a negative way? I know vicious circle also means that but it has a negative connotation.
|
I have organized my boxes in Pokémon X by type, and I have a few empty boxes at the beginning. Whenever I capture a Pokémon, it does not go in the first Box available. How do I set the box that the Pokémon go in to? Here is my setup: [ ] [ ] [ ] [ ] [ ] [X] [X] [X] [X] [X] [X] [X] [X] [X] [X] [X] [X] [X] [X] [X] [X] [X] [X] [X] [X] [X] [X] [X] [X] [X] [X] [X] The Xs represent boxes that are organized. I would like the Pokémon to go into the empty boxes at the beginning. Instead, they are currently going in to the 3rd to last box.
|
Title says it all. It seems to be random and is really annoying.
|
Is it possible to have a figure to the right of you text, and at the same time have the text wrapped around it? I've tried the package wrapfig, but doesnt seem to work. Any advice? sketch: \documentclass{tikzposter} \title{The Title} \author{The Author} \usepackage{lipsum} \begin{document} \maketitle \block{A Title}{ \lipsum \begin{center} \begin{minipage}{0.45\linewidth} \centering \begin{tikzfigure}[Caption of figure1] \includegraphics[height = 10cm]{example-image-a} \end{tikzfigure}% \end{minipage}\hfill \begin{minipage}{0.45\linewidth} \centering \begin{tikzfigure}[Caption of figure2] \includegraphics[height = 10cm]{example-image-b} \end{tikzfigure}% \end{minipage} \end{center} } \end{document}
|
While designing a poster with tikzposter I stumbled over a small issue. Usually one can use the wrapfig package to let text wrap around figures but in a box in tikzposter this seems to fail completely as shown in the MWE below. Is there any way to wrap around a figure without using wrapfig so that this works as expected? \documentclass[25pt, a4paper, portrait, margin=0mm, innermargin=15mm]{tikzposter} \title{Title} \author{Name} \institute{University} \usetheme{Default} \usecolorstyle[colorPalette=BrownBlueOrange]{Germany} \usepackage{graphicx} \usepackage{wrapfig} \begin{document} \maketitle \begin{columns} \column{.5} \block[roundedcorners=40]{First block}{ Here some text that wraps around the figure. Here some text that wraps around the figure. Here some text that wraps around the figure. Here some text that wraps around the figure. Here some text that wraps around the figure. Here some text that wraps around the figure. \begin{wrapfigure}[5]{r}{0.5\textwidth} \begin{tikzfigure}[Caption] \includegraphics{example-image} \end{tikzfigure} \end{wrapfigure} Here some text that wraps around the figure. Here some text that wraps around the figure. Here some text that wraps around the figure. Here some text that wraps around the figure. Here some text that wraps around the figure. Here some text that wraps around the figure. } \end{columns} \end{document}
|
Let's say there is an available booking from A-B-C, but I actually live in B. Can I book the flights and travel on the B-C flight only? I'm asking this because the A-B-C ticket is considerably cheaper than B-C ticket. If that is not possible, are there any tricks to take advantage of the cheaper A-B-C price compared to B-C?
|
Say I want to book a flight from Fort Lauderdale to Chicago. Say the airline also flies to St. Louis from Fort Launderdale but has a connecting flight through Chicago. If I book that flights from FLL->ORD->STL and just get off in Chicago, what possible problems can I run into, assuming I didn't check any bags and only have carry on? This scenario exist for Southwest, but I wanted this be more of a general question that would apply to all airlines.
|
For example, How can I know whether there is an argument like args.manual_selection in args (args = parser.parse_args())
|
Is there a way in Python to determine if an object has some attribute? For example: >>> a = SomeClass() >>> a.someProperty = value >>> a.property Traceback (most recent call last): File "<stdin>", line 1, in <module> AttributeError: SomeClass instance has no attribute 'property' How can you tell if a has the attribute property before using it?
|
I'm aware there is a very relevant explanation on L1 regularization's effect on feature selection at here: [Ref. 1]. To better understand it I'm reading Google's tutorial on [Ref. 2]. When it comes to the following part, there's some statements I emphasized that I do not understand: You can think of the derivative of L1 as a force that subtracts some constant from the weight every time. However, thanks to absolute values, L1 has a discontinuity at 0, which causes subtraction results that cross 0 to become zeroed out. For example, if subtraction would have forced a weight from +0.1 to -0.2, L1 will set the weight to exactly 0. Eureka, L1 zeroed out the weight. I imagine when it says "L1 has a discontinuity at 0" it means the loss of the L1 like in the following figure [Ref. 1]: But why it will "cause subtraction results that cross 0 to become zeroed out"? Why "if subtraction would have forced a weight from +0.1 to -0.2, L1 will set the weight to exactly 0"? Is it related to that L1 is not differentiable at $w = 0$?
|
I've a question regarding to the graphical intuition of the LASSO. I'm understanding why the lasso produce zero coefficient in case of intersecting a corner of the diamond. But I don't understand the case when the lasso Regression just shrink the paramters and don't set them to Zero. So if the RSS lines intersect with the "side" of the diamond. Assume in the case of the figure, that $\beta_1$ bigger and $\beta_2$ smaller. So the RSS-line would likely intersect a side. Could you give me some intuition when the RSS-Line tangents with the side of the diamond instead of the corner?
|
On the full site, there's that helpful Markdown toolbar above the post box: This is conspicuously missing in the mobile site: It's difficult just to get a bracket on my iPad. Backticks aren't even available. If there's a view that really needs it, i vote mobile.
|
As you can see by the screenshot below, neither buttons nor even the live-preview is available on the iPad. StackExchange is great on mobile devices, maybe it can be full available in mobile safari as well. The same thing happens with the tags autocomplete, there is no options for it! we need to check previous questions to know what tags are available to use.
|
I have a sample of a multivariate distribution, and I am interested in obtaining a sample from the marginals. I know the right way to do so is by simply taking the corresponding entries. What is the justification for this strategy? Is there a, probably simple, formula or result that justifies this procedure?
|
I want to sample from a univariate density $f_X$ but I only know the relationship: $$f_X(x) = \int f_{X\vert Y}(x\vert y)f_Y(y) dy.$$ I want to avoid the use of MCMC (directly on the integral representation) and, since $f_{X\vert Y}(x\vert y)$ and $f_Y(y)$ are easy to sample from, I was thinking of using the following sampler: For $j=1,\dots, N$. Sample $y_j \sim f_Y$. Sample $x_j \sim f_{X\vert Y}(\cdot\vert y_j)$. Then, I will end up with the pairs $(x_1,y_1),...,(x_N,y_N)$, and take only the marginal samples $(x_1,\dots,x_N)$. Is this correct?
|
Of course, if possible, without any VBScript-like scripts.
|
I am running a program and want to see what its return code is (since it returns different codes based on different errors). I know in Bash I can do this by running echo $? What do I do when using cmd.exe on Windows?
|
The flux of cosmic ray muons is about 1 muon per square centimeter per minute. I was trying to see if I can detect these using a glass of water, putting it in a totally dark room and take a picture of that with a camera mounted on a tripod. I used the highest ISO setting available and exposed for about half a minute, and I let the camera perform a dark frame subtraction. Muons moving through the water should produce photons, some of which will be detected by the camera sensor. I then converted the raw files using the dcraw program to tiff files without doing any demosaicing (so each pixel corresponds to the actual gray value detected by a sensor photosite). But I'm now a bit bogged down in analyzing the raw files (a problem here is that the Sony ARW files are not real raw files, they have build in lossy compression which is not ideal for doing this sort of analysis). So far I have not seen any interesting, if I look at gray values that are many standard deviations above the noise then I don't see any obvious (broken) straight line patterns. So, I'm wondering if one would actually expect any signal at all. It seems to me that you would because from close up you would detect some photons from the water, but perhaps I'm too optimistic.
|
I have read this article and it talks about estimating the muon cosmic ray flux by means of a DSLR camera. Is it possible to measure the muon's energy with the same apparatus? If yes, how can I "calibrate" (?) the camera in order to measure the energy?
|
In the attached image i have shown a square whose area comes out as 64. Now that square is cutted to make a rectangle and the area of rectangle comes out as 65. How is it possible when same material is their and no more material is added ? Thanks for your time .
|
how is this possible? I know there is some trick, should someone please explain?!
|
I am trying to write my master thesis using classicthesis package, everything if working fine except the section numbering. I am able to start the chapters correctly. But when I start a section I have the issue. I want to have a section numbering also. It comes in the top of the page, but I also want it in the beginning of the section. Would also like to have the page number to the bottom of the page. The big number when the chapter starts is okay. But in the other pages I want to have it to the bottom of the page not on the top right cornet, instead in the bottom left corner,
|
After reinstalling TeXLive distribution (install-tl-20160318, Ubuntu 14.04), a issue occurs with the updated version of the titlesec package: the section numbering is lost. What could it be missing? Is there a modification I have not seen? Below is a MWE comparison of the two versions. The prevtitlesec package is a reinstall of the previous version (2011/12/15). \documentclass{book} \usepackage[margin=2cm,a4paper]{geometry} %\usepackage{prevtitlesec}% 2011/12/15 version \usepackage{titlesec}% 2016/03/15 version \usepackage{lipsum} \begin{document} \chapter{Title of the first chapter} \lipsum[1] \section{A test section} \lipsum[4] \subsection{A test subsection} \lipsum[4] \subsection{A test subsection} \lipsum[4] \end{document} titlesec package 2011/12/15: titlesec package 2016/03/15:
|
I want to select all columns from a table except one column using MySQL. I know we can select all columns using this <?php $query = SELECT * FROM posts; ?> But how can I leave one specific column from the table?
|
I'm trying to use a select statement to get all of the columns from a certain MySQL table except one. Is there a simple way to do this? EDIT: There are 53 columns in this table (NOT MY DESIGN)
|
Its a pretty self contained question. I know its not the votes for a question, and not the total views. Is it views in a certain time period? The number I'm talking about is circled in the below image.
|
To the left side of questions listed under Hot questions, I see a number. What is that number? I would think it is the number of users who seen the question, but it's not the same number I see in the Q&A site.
|
Consider I am using hyperref package. Following LaTeX source: By the definition of $G_{L,\lambda_1,\lambda_2}$ (Definition \ref{def:bipGraphInducedByLl1l2_DecomposesL}) we have that produces the following output: i.e., only the number of the definition is made to be hyperlink. Is there possibility to link also the keyword Definion? I mean, I want whole "Definition 4.3" to be a hyper link. Thanks for help!
|
Is it somehow possible that I can extend the link to something which I produce by using \ref with a label by the word standing before \ref? If I write something like that: For further information, have a look into chapter \ref{chap:abc} and figure \ref{fig:def} then the only thing being "clickable" are the chapter number and the figure number. Is it somehow possible to make the words "chapter" and "figure" being linked to those objects as well?
|
I've bought an external 4TB HDD. It is this . The problem is that my Macbook Air 11" 2013 (with Mac OS X 10.9.2) does not recognize it. The device is ok. I can use it from other computers with GNU/Linux. But I don't know what happens with my Mac. Disk utils app does not show it in the volumes list, diskutil command either.
|
I want to do a clean install of el capitan OS. I booted to recovery mode, chose reinstall os x and followed the steps. So far so good. When it came to choose the destination disk where I wanted to install the OS, it did not show any hard drive, i.e Macintosh HD was not shown so I could select it. I figured I had to format it first. So I close the installation and went to Disk Utility. The problem is Disk Utility is stuck at loading and does not show anything. My OS is corrupted, that is the reason why I want to do a fresh installation. With corrupted I mean, I can boot my system only if I go to single-mode and mount the hard drive with mount -uw / and then exit. But this is not a long term solution. I search everywhere in the web and there are many solutions out there, but none worked form me. I tried erasing and formatting the hard drive when in single-mode with the help of diskutil. But this did not work because the DiskManagement Framework was missing. So I tried loading the files manually with launchctl. But still I can not use diskutil in single-mode. I tried also fsck, it did not do any good. I ran out of options. I don't know what to do. Here is an image when I try to erase the partition via Disk Utility And here is an image when I try to reinstall the OS. No Hard disk is shown to select
|
I have a non-encrypted service running separate to apache on 8080. I'd like to hide it and redirect all traffic to it via SSL. I have successfully setup proxy/reverse proxy so all requests to www.example.com go to port 8080. However, I can still directly access the service if I go to . And it goes via http, not https. I can't block that with the firewall, since the service includes some of the links in the form . I have tried adding a virtualhost on :8080 and listen on 8080 but that doesn't work (and also breaks the proxy on *:443). Could anyone suggest what I am doing wrong? All services run on the same ip address. <VirtualHost *:80> ServerName example.com ServerAlias www.example.com Redirect permanent / https://www.example.com/ </VirtualHost> <VirtualHost *:8080> ServerName example.com:8080 ServerAlias www.example.com:8080 Redirect permanent / https://www.swapsk.in:443/ </VirtualHost> NameVirtualHost *:443 <VirtualHost *:443> ServerName example.com ServerAlias www.example.com ServerAdmin webmaster@localhost DocumentRoot /var/www/html SSLEngine on SSLCertificateFile /root/cert.crt SSLCertificateKeyFile /root/key.key SSLCACertificateFile /root/ca.ca-bundle ProxyRequests Off ProxyPreserveHost On AllowEncodedSlashes NoDecode <Proxy *> Order deny,allow Allow from all </Proxy> ProxyPass /phpmyadmin ! ProxyPassReverse /phpmyadmin ! ProxyPass / http://localhost:8080/ nocanon ProxyPassReverse / http://localhost:8080/ ProxyPassReverse / http://www.example.com/ RequestHeader set X-Forwarded-Proto "https" RequestHeader set X-Forwarded-Port "443" </VirtualHost>
|
This question is here so we can offer users who are looking for information on how to make one or more common or basic redirects in Apache using the htaccess file. All future questions pertaining to finding information that is that is covered by the question should be closed as a duplication of this question. . Whats the point in this question? The idea while not perfect is catch the most commonly asked questions regarding redirects using the htaccess on the Apache platform either on some type of lamp or a live server. The type of answers should be generally those that you could imagine are used by 100,000’s of sites world-wide and are constantly asked here at Pro Webmasters repeatedly over and over in various forms. A few examples of the type of answers we are looking for: How can I redirect non-www to www? How can I redirect a sub domain to the main domain? How can I redirect a sub folder from domain to a root or a subdomain? How can I redirect an old URL to a new URL? A few examples of the types of answers that we are not looking for: Answers that do not involve a redirect. Any answers relating to NGinx, IIS or any other non-Apache platform. Answers that involve custom and complex string or query removals. Resources for Advanced to Complex Mod_Rewrite Rules: Please note: that this question is still in construction and may need some refining either by myself or a real moderator of Pro Webmasters, if you have any concerns or questions .
|
I've had to retry this a million times, and it's doing my head in. Please help me. I resized my partitions from within Windows 8, and disabled everything I was supposed to, I installed 13.04 from a multi-boot LiveUSB. Once installed, I could get into Ubuntu, but not Windows 8. After running boot-repair from Ubuntu on my LiveUSB, the machine boots into this error: error: file '/boot/grub/i386-pc/normal.mod' not found. And it gives me the grub-recovery thing. How do I get this working? At the moment I can have only Windows installed, or only Ubuntu. I want both.
|
error: file '/grub/i386-pc/normal.mod' not found. grub rescue> What can I do? I just sit and stare at it. I found my old netbook (Dell Inspiron 1010) which I have not used for about four years. I replaced Windows XP with Ubuntu 12.10. I used my bootable USB drive. I installed and rebooted. I got the message that normal.mod is not found. What should I do? Type exit, reboot, or quit? Should I re-install?
|
I am trying to prove the following fact, which seems intuitive to me, yet I cannot find a way to show it. Consider the set of functions $\{f_1,\ldots,f_n\}$, $f_i:\mathbb{R}\rightarrow\mathbb{R}$. Suppose that this set is linearly independent, i.e. $$\sum_i f_ic_i=0\implies c_i=0\;\;\; \forall i$$ Then there exists numbers $(x_i)_{i=1}^n$ such that the matrix \begin{bmatrix} f_1(x_{1}) & f_2(x_{1}) & \dots & \dots & f_n(x_{1}) \\ f_1(x_{2}) & \dots & \dots & \dots & \dots \\ \dots & \dots & \dots & \dots & \dots \\ f_1(x_{n}) & \dots & \dots & \dots & f_n(x_{n}) \end{bmatrix} has a nonzero determinat. I have tried to reason by contraposition, assuming that the determinant vanishes for any choice of the $(x_i)_{i=1}^n$ but I didn't get anywhere.
|
The following proposition is easy to verify: Given $n$ functions $f_1,...,f_n$, they are linearly independent in an interval $I$ if there exists a set of $n$ points in $I$, namely $x_1,...,x_n$, such that the matrix \begin{pmatrix} f_1(x_1) & \cdots & f_n(x_1) \\ \vdots & \ddots & \vdots \\ f_1(x_n) & \cdots & f_n(x_n) \end{pmatrix} has full rank. My question is: can I replace the if by if and only if? That is, if $n$ functions are linearly independent, is it true that there exists a set of $n$ points such that the above matrix has full rank? I am pretty convinced so, but I am not being able to prove it.
|
I downloaded something off a link and once I installed it a few minutes later this thing popped up in task manager: Microsoft Edge Update Setup/libmfxsw32.exe. I tried to open its file location in Task Manager (located in "%APPDATA%/Mxmetamux") and it says that access is denied, along with that the folder never displays in file explorer. I looked up the exe's name and it says that it executes these files: icalcs.exe, cmd.exe, and fontdrchost.exe. I know that icalcs.exe is the one that manages folder permissions, and I once tried both the takeown and icalcs commands that were "executed successfully" but didn't make the folder accessible. I tried ending the libmfxsw32.exe process but it keeps popping up again in task manager.
|
What should I do if my Windows computer seems to be infected with a virus or malware? What are the symptoms of an infection? What should I do after noticing an infection? What can I do to get rid of it? how to prevent from infection by malware? This question comes up frequently, and the suggested solutions are usually the same. This community wiki is an attempt to serve as the definitive, most comprehensive answer possible. Feel free to add your contributions via edits.
|
Let $G = \mathbb R\setminus\{-1\}$. Prove that G is a group with respect to the binary operation $x*y = xy + x + y$, where $xy$ and $x + y$ denote the usual multiplication and addition of reals, respectively.
|
So basically this proof centers around proving that (S,*) is a group, as it's quite easy to see that it's abelian as both addition and multiplication are commutative. My issue is finding an identity element, other than 0. Because if 0 is the identity element, then this group won't have inverses. The set explicitly excludes -1, which I found to be its identity element, which makes going about proving that this is a group mighty difficult.
|
The IV used in schemes such as CBC has to be random and unpredictable. But at the same time it does not have to be kept secret. If the IV does not have to be secret, why does it have to be random then? I fail to make sense out of these seemingly contradicting requirements. I have seen descriptions of attacks which exploit the non-randomness. So, I would understand why randomness is needed. However, things get confusing when the requirements specify that the IV does not have to be secret !This seems to defeat the whole purpose of randomness. Somebody help clarify this please.
|
I heard multiple times not to reuse the same IV and IV should be random but doesn't need to be secret. I also heard if the IV is something like sequential numbers or something predictable I should hash(salt+pepper) it. Why on earth should i be doing that if they don't need to be a secret? In this specific case i am encrypting rows with one secret AES key and i am using a fixed IV but xor-ing it with the row id. Its predictable and not secret but by doing this it isn't reused which i thought was the important part. Are IVs suppose to be secret? Are predictable IVs ok? Should i be hashing predictable IV?
|
Light is made by an electric field wave and a magnetic field wave. Induction laws state that a variation in the electric field creates a magnetic field and vice versa. Therefore can it be said that the simultaneous presence of magnetic wave and electric wave in electromagnetic waves is due to induction ? Can it be said there is an repetitive self induction in the electromagnetic waves such that the electric wave induces the magnetic wave which induces back the next electric wave period ? Can it be said that such back and forth is responsible for the light trajectory ?
|
Frequently when EM waves are taught, it is said that the change in electric field causes a change in the magnetic field, which then causes a change in the electric field, and so on and so forth. But from my understanding of basic electromagnetics, it is not necessarily a changing electric field that creates a change in magnetic field, but instead an accelerating charge. and it is this charge that creates both the electric and magnetic field. Again, from my understanding, a changing magnetic field is not generated by a changing electric field, but instead just happens to always be present perpendicular to a changing electric field due to the laws of electromagnetism. Am I wrong? Or is the "mutual generation" concept between the electric and magnetic components of an EM wave an actual thing?
|
I wonder if the matrices are similar, and if this is true, then if I want to solve a minimal polynomial problem on a matrix A, if I can simplify the matrix A until it has the form of a diagonal matrix by blocks B.
|
I am trying to understand reduction of an unsymmetric real square matrix to Hessenberg form from Numerical Recipes Vol. 3. In it, the author states that one does not use Gaussian elimination for reducing to Hessenberg form because the Gaussian elimination does not preserve similarity and hence ends up changing the eigenvalues of the matrix, which is undesirable. Why does Gaussian elimination not preserve similarity? Also, what conditions decide whether a particular matrix transformation preserves similarity? Heres a to where I found it. In case you cant view that, it's on page 594 of Numerical Recipes in C++ (Volume 3).
|
My question is in three (or so) related parts: 1) My understanding is that getlogin() will effectively return the auid associated with the process and so isn't actually changable by the user. Is that understanding true? 2) I found regarding getlogin() used in pam_wheel. I'm familiar with each individual command but not sure I understand how they're accomplishing the end effect. It seems they're accepting input from a symlink called tty1 which is also the same tty name the root user is on. How is it that the symlink succeeded? Shouldn't /dev/tty1 already be there if root is shown as being logged into it (in utmp)? 3) I was just starting out with GNU/Linux (like abut a year or so into it) when this exploit was written up, so it's possible that I'm unaware of some previous iteration in Linux identity/privilege management. How could a normal user create that symlink? I know /dev was a static list of mknod files back then, but reads/writes on symlinks get evaluated by the hardlink referenced, correct? I realize this is on a udev-based /dev hierarchy, but by way of example this is one pty on one of my systems: crw--w----. 1 jadavis6 tty 136, 3 May 27 00:47 /dev/pts/3 Shouldn't the above prevent any user that's not jadavis6 nor in the tty group access (via symlink or otherwise) for reading or writing? Were the permissions in /dev more liberal pre-devfs/udev? Also, how does reading from the TTY grant the process you're currently in root access? I could see using it to spy on the remote session by reading everything written to the tty device, but how are they getting logname to change for them? Are the subsequent commands (after the redirect from tty1) just what is happening on the root console or is there something at play here that actually led to this be a way to get root? If it's the latter, is this exploit really su specific? I mean won't a lot of functionality be opened up if all you have to do is create a symlink to a device file and then your auid is now root? Answer: Found out most of the critical information above in
|
I think the of this question was a little bit like a carpet bomb of questions, so that may have turned people off to it (to the point of almost being flagged for removal) so I'll start a new one that hopefully people can have an easier time with. Basically, my overall interest is in understanding logname and getlogin() as it relates to audit trails. It breaks down like this: 1) My understanding is that logname and getlogin() both display the auid that would/will end up showing in the session's audit logs. Is that correct? I know auid is an immutable process attribute, but I was interested in knowing whether the two are necessarily the same or just usually the same. This would help me with writing scripts/helper programs that can make access control decisions based on the user's original identity, rather than just who they happen to be at the moment or a mutable environmental variable. 2) I still don't understand how the of being shown was supposed to work. If someone could explain that to me, it would be great. My primary interest is with point #1, though.
|
So this is my first time encountering this type of problem, and I'm at quite a beginner level. If you could help me get on the right track I'd appreciate it. Now if i'm picking r objects from n objects that's going to be $n\choose r$ now there would be $\frac {n!}{(n-r)! r!}$ combinations (i think) if we just wanted to know ways where each object appears an odd number of times, wouldn't that be half of the total possibilities? My logic and math may be way off here, but I'm just a beginner. I feel like this makes sense because all the odd possibilities would be half the amount of all possible possibilities right? So if you were to pick r objects from n objects, how many ways are there to pick so that each r object appears an odd number of times. Is what the question is asking
|
Let $A$ be a non-empty set and $n$ be the number of elements in $A$, i.e. $n:=|A|$. I know that the number of elements of the power set of $A$ is $2^n$, i.e. $|\mathcal{P}(A)|=2^n$. I came across the fact that exactly half of the elements of $\mathcal{P}(A)$ contain an odd number of elements, and half of them an even number of elements. Can someone prove this? Or hint at a proof?
|
The home folder starts with default folders (mostly XDG base directories) like ~/Documents and ~/Music. These are decorated as follows: custom folder icon (not an emblem) custom icon matches the style of the regular folder icon Nautilus bookmark in a distinct section (separate from other bookmarks) custom bookmark icon I have created a non-XDG folder called ~/Work. How can I decorate it with all four features listed above?
|
How do I assign custom icons to folders, as well as the default folders Desktop, Downloads, Music, etc.? I know that one way is to assign the properties of folders, but I want to assign icons in the same way that are assigned the default folders, so the custom icons will also appear in the Nautilus bookmarks. I've also seen this question >> <<, but that is not what I seek. I want the markers to display custom icons like the dolphin. I know it's possible, because the folder "Desktop", "Documents", "Music" have their own custom icons in bookmarks. How?
|
I first thought it was a bug that my browsing history in Chrome was getting lost but there seems to be a for it: “Your History page shows the websites you've visited on Chrome in the last 90 days. It doesn’t store pages from secure websites, pages you've visited in Incognito mode, or pages you've already deleted from your browsing history.” The part about the Incognito mode and deleted entries is intuitive, but I’m dismayed to find that all the rest of my older browsing history is lost. Is there a trick, app, or extension that works around that and records all browsing history, HTTP and HTTPS, indefinitely? Thank you!
|
I need to recover old history. Google Chrome only stores the last 3 months in the "History" file. The rest is in the "Archived History" file. How can I view this older history?
|
If a university is named by a place, like "the Univerisity of Bonn". Can I call it "Bonn University"? When saying the former, is the mistake serious if without definite article "the" before "university"?
|
In some scientific papers, we see that some professors write "University of Bla" on their papers, while others write "Bla University". What is the difference between "University of Bla" and "Bla University"? Are there any differences at all?
|
What's wrong with the commands below? $ var1="~/Music/$(date +%d%m%y)" $ echo "$var1" ~/Music/240118 $ mkdir "$var1" mkdir: cannot create directory ‘~/Music/240118’: No such file or directory However $ mkdir ~/Music/240118 works. Never thought I would ask such questions after years of using bash...
|
According to and my own understanding, the tilde expands to the home directory: $ echo ~ /home/braiam Now, whenever I want the shell expansion to work, i. e. using variable names such $FOO, and do not break due unexpected characters, such spaces, etc. one should use double quotes ": $ FOO="some string with spaces" $ BAR="echo $FOO" $ echo $BAR echo some string with spaces Why doesn't this expansion works with the tilde? $ echo ~/some/path /home/braiam/some/path $ echo "~/some/path" ~/some/path
|
Say I have a level 18 bard and want to take the last two levels in paladin. Unfortunately my strength score is only 8, ruling me out. Fortunately a friendly fighter has a belt of hill-giant strength. If I borrow this and attune to this I have a strength score of 21, plenty enough to multiclass to paladin. My question is this: RAW would the above situation work: can I multiclass to a class I only meet the requirements of due to a magic item? Bonus points for what happens should I lose attunement.
|
The multiclassing rules (PHB, p. 163) state: To qualify for a new class, you must meet the ability score prerequisites for both your current class and your new one [...] Without the full training that a beginning character receives, you must be a quick study in your new class, having a natural aptitude that is reflected by higher-than-average ability scores. Can the ability score prerequisite(s) for multiclassing be met by (long-term) use of a magic item(s) such as the Headband of Intellect (INT 19), Ioun Stones (+2 to various ability scores), etc.? The phrase "natural aptitude" suggests nonmagical, but a character could have been using a magic item for years which seems virtually indistinguishable.
|
Is there a way, that I am not finding, to have a vanity profile name? On LinkedIn, Facebook, Twitter, etc I am KellCOMnet; on stackoverflow I am /users/464228/christopher-kelly. If this is not currently available, what is the community’s thoughts on this feature?
|
How can I change (or remove / reset ) my name on a site in Stack Exchange network?
|
I'm trying to gain some insight into how orders on an exchange are matched to design a proof of concept matching system. Am I correct in assuming market orders are immediately executed against the best priced limit order in the limit order book if there is not another market order at the same time to fill the opposite side ? eg: Limit order book Time|Buy | Time|Sell 00:01|50 | 00:02|55 00:03|53 | 00:01|60 Market buy order comes in at 00:05 Would it match with the sell limit order at 55 (because $55 is the best price) or with the order at 60 since it's the oldest ?
|
When I place my trade order in the stock exchanges, I know the price matching happens and only when there is a buyer and seller at the same price a trade happens. But how does the quantity matching happen? For example, if I want to buy 1000 shares at $100, but there is only one seller to sell 10 shares at $100, what happens then?
|
If a narrow slit makes monochromatic light coherent, why is light required to pass through the single slit before the double slits in Young's experiment? Wouldn't the double slits individually make light coherent if narrow enough and then form an interference pattern without a single slit?
|
In , a home experiment is presented which appears to produce a very good double-slit interference pattern with normal sunlight. The experiment is an empty cardboard box with a visor and a placeholder for a microscope slide with two slits on one side. This is arranged with the slits and visor facing the Sun, so the interference forms on the bottom of the box. They claim to observe a good interference pattern from the two slits: Discussions of interference in optics textbooks often stress that coherent light is needed to produce such patterns, and that sunlight and other thermal sources of light do not have such coherence. How, then, is this possible?
|
Using Ubuntu 14.04 LTS (64 bit). $ sudo apt-get update . . . Fetched 2,079 kB in 1min 1s (33.7 kB/s) Reading package lists... Done W: GPG error: http://public-repo-1.hortonworks.com HDP InRelease: The following signatures couldn't be verified because the public key is not available: NO_PUBKEY B9733A7A07513CAD W: GPG error: http://public-repo-1.hortonworks.com HDP-UTILS InRelease: The following signatures couldn't be verified because the public key is not available: NO_PUBKEY B9733A7A07513CAD How can I resolve this problem?
|
I frequently cross this issue, and always have to google for an answer. Does anyone have a permanent fix for BADSIG errors from apt-get? W: GPG error: lucid Release: The following signatures were invalid: BADSIG 54422A4B98AB5139 Oracle Corporation (VirtualBox archive signing key)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.