body1
stringlengths 20
4.1k
| body2
stringlengths 23
4.09k
|
|---|---|
i'm new to this forum. I have the following problem. After i boot my ubuntu 16.04 i can't use the ntfs formated windows partion in the Terminal. ls /media/xxx/BE309CB8309C79DB Error file or directory not found. At first I have to click on the partition in nautilius. After this i can also use the command above. I know it's probably a beginner's question, but how is it possible to get to a status where i can use the path in the terminal right after startup? Thanks
|
I have two NTFS partitions, and I don't want to mount them manually every-time I start Ubuntu. How can I do this? Is there a tool or a code to use? If so, is it safe to automount? specially when they are being used by another OS?
|
Write down the assumptions in a form of clauses and give a resolution proof that the formula is a tautology. $((p\to q)\land (q\to r)\land p)\to r$ I got information that i need to use here Resolution calculus...Someone can help me?
|
Write down the assumptions in a form of clauses and give a resolution proof that the proposition $$\Big((p \rightarrow q) \land ( q \rightarrow r) \land p \Big) \rightarrow r$$ is a tautology.
|
I tried without '0' and got error,Please explain it. getline(cin,str); int n=str[4]-'0';
|
I have a string of digits, e.g. "123456789", and I need to extract each one of them to use them in a calculation. I can of course access each char by index, but how do I convert it into an int? I've looked into atoi(), but it takes a string as argument. Hence I must convert each char into a string and then call atoi on it. Is there a better way?
|
Prove that $2n-3\leq 2^{n-2}$ , for all $n \geq 5$ by mathematical induction I have to prove by mathematical induction that: $2n-3\leq 2^{n-2}$ , for all $n \geq 5$
|
Prove that $2n-3\leq 2^{n-2}$ , for all $n \geq 5$ by mathematical induction I have to prove by mathematical induction that: $2n-3\leq 2^{n-2}$ , for all $n \geq 5$ Thank you for the Review.
|
Show that $(x-1)^2$ is a factor of $x^n-nx+n-1$ Here's my approach:- Letting $P(x)=x^n-nx+n-1$ I tried putting $P(1)=0$ but it would only prove for $,(x-1)$ Here's what I can think of, $x^n-1-nx+n=(x^n-1)-(nx-n)=(x-1)(x^{n-1}+x^{n-2}+x^{n-3}................+x+1)-n(x-1)$ Because $x^n-y^n=(x-y)(x^{n-1}+x^{n-2}y+x^{n-3}y^{n+1}................+xy^{n-2}+y^{n-1})$ $=(x-1)[x^{n-1}+x^{n-2}+x^{n-3}................+x+1-n]$ But I am not able to proceed any further neither I am able to get $(x-1)^2$ as common factor.
|
Show that $(x-1)^2$ is a factor of $x^n -nx +n-1$ By factor theorem we know that $(x-a)$ is a factor of $f(x)$ if $f(a)=0$. In this case, $f(x)=x^n -nx +n-1 \implies f(1)=0$ Hence we conclude that $(x-1)$ is a factor. From hereon, how can I say that $(x-1)^2$ is a factor? Can we approach the problem without calculus approach? This problem was taken from a book of pre-calculus algebra.
|
I am trying to make the while loop stop asking for user input once the user enters "stop", but i cannot get it to stop asking the user for input. public static void main(String[] args) { exampletoday llist=new exampletoday(); Scanner keyboard=new Scanner(System.in); System.out.println("Enter the first operator or operand: "); String first=keyboard.nextLine(); llist.addNode(first); while(true) { System.out.println("Enter the next operand or operator or stop to stop: "); String next=keyboard.nextLine(); llist.addNode(next); if(next=="stop") break; }
|
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'm working with a system where each customer has their own database. This amounts to ~4000 databases (approximately 150 tables each database) spread over 8 instances of Microsoft SQL server 2012. The database scheme for all these databases is supposed to be identical, but recent events has shown that there are minor deviations in data types, indexes, keys and nullable/default value settings in some of the databases. My goal is to synchronize all database schemas so they all have identical tables, columns, indexes, keys and nullable/default value settings I have a single database that I'm certain has the 100% correct database schema. How could I compare this database scheme to others, in an attempt to find variations in keys, indexes, tables, columns and nullable/default value settings? I've read which is similar to mine, but the suggestions (like right clicking the database object in SSMS to generate a script or generating and comparing a .dacpac file with the Visual Studio extension SSDT) seems to be oriented towards comparing only two databases, and is not practical for comparing 4000 database schemas.
|
Is there a way to find the differences in two SQL Server databases (schema only). One is local and the second is at a customer's site. We are experiencing problems with crystal reports running some reports and some code not executing and it would appear that the schemas don't match. Can I run the same command on both databases and compare the results to tell where the differences are?
|
Trying to setup a FTP server on a EC2. I have installed vsftp and followed this When I try to connect with the -p option I cannot pass any command. Everything is smooth without it. I have setup vsftpd.conf: allow_writeable_chroot=YES pasv_address=<my-ip> pasv_enable=Yes pasv_min_port=50000 pasv_max_port=51000 port_enable=YES And opened the port (20-21 && 50000-51000 using Terraform here) resource "aws_security_group" "ftp_passive_port" { name = "ftp_passive_port" description = "Access to FTP passive" vpc_id = aws_vpc.din_vpc.id ingress { from_port = 50000 to_port = 51000 protocol = "tcp" cidr_blocks = [...] } # Allow all outbound traffic. egress { from_port = 0 to_port = 0 protocol = "-1" cidr_blocks = ["0.0.0.0/0"] } } I got this error : Connected to xxxxxxxx. 220 Welcome to XXXXX FTP service. Name (xxxxx:qwerty): xxxxxxxxxx 331 Please specify the password. Password: 230 Login successful. ftp> ls 227 Entering Passive Mode (0,0,0,0,198,19). ftp: connect: Connection refused ftp> bye 221 Goodbye.
|
As said in the title, I don't manage to connect my Windows 10 host to my FTP server on the VirtualBox guest side (Ubuntu 18.04). On the guest side, the vsftpd server works fine, I can connect without any problem. So I tried to forward the associated port to the host (NAT) and tried to connect to the server via FileZilla. It does login, but always fails to retrieve directory listing. I tried deactivating the firewalls, giving all the access permissions to the folder but it doesn't change anything. I read that it could be a problem of passive mode there: So I added the following lines to : pasv_enable=YES pasv_min_port=8020 pasv_max_port=8020 port_enable=YES pasv_address=127.0.0.1 I forwarded the port 8020 but I now get the following error on FileZilla: The data connection could not be established: WSAEADDRNOTAVAIL - Cannot assign requested address Full FileZilla response: Status: Connecting to 127.0.0.1:2100... Status: Connection established, waiting for welcome message... Status: Server does not support non-ASCII characters. Status: Logged in Status: Retrieving directory listing... Command: PWD Response: 257 "/home/cakephp" is the current directory Command: TYPE I Response: 200 Switching to Binary mode. Command: PASV Response: 227 Entering Passive Mode (0,0,0,0,31,84). Command: LIST Error: The data connection could not be established: WSAEADDRNOTAVAIL - Cannot assign requested address Error: Connection timed out after 20 seconds of inactivity Error: Failed to retrieve directory listing Status: Disconnected from server I'm a bit lost with this, does anybody have a suggestion? Thanks in advance EDIT1: Without any kind of hope, I also tried to access from the Windows Command Prompt. It does connect but when I ls the current folder I get the following error: 500 illegal PORT command. 425 use PORT or PASV first. But I guess that this is because . Just in case it can help, you can find here . Also, I can seamlessly access to the guest SSH server from the host with Putty. EDIT2: I set listen_ipv6 to YES, changed pasv_max_port to 8030 to increase the number of passive ports and forwarded them. I get the following logs from FileZilla: Status: Connecting to 127.0.0.1:2100... Status: Connection established, waiting for welcome message... Status: Server does not support non-ASCII characters. Status: Logged in Status: Retrieving directory listing... Command: PWD Response: 257 "/home/cakephp" is the current directory Command: TYPE I Response: 200 Switching to Binary mode. Command: PASV Response: 227 Entering Passive Mode (0,0,0,0,31,90). Command: LIST Error: The data connection could not be established: WSAEADDRNOTAVAIL - Cannot assign requested address Error: Connection timed out after 20 seconds of inactivity Error: Failed to retrieve directory listing
|
I am interested in the integral over the log-zeta function$$I=\int_0^1 \ln\left(\zeta(s)\right)ds$$ My attempts: Sub $u=1-s$ to get $$I=\int_0^1 \ln\left(\zeta(1-u)\right)du=\int_0^1 \ln(\zeta(u))-u\ln2-(u-1)\ln\pi-\ln\left(\sin(\frac{\pi u}{2})\right)-\ln\left(\Gamma(1-u)\right) du$$ This doesn't seem to lead anywhere unfortunately. I also tried to set up a parameter $a$ as $$I(a)=\int_0^1 \ln\left(\zeta(s+a)\right)ds$$ $$I'(a)=\int_0^1 \frac{\zeta'(s+a)}{\zeta(s+a)}ds=\ln\left(\zeta(s+a)\right)|_{s=0}^{s=1}=\ln\left(\zeta(a+1)\right)-\ln\left(\zeta(a)\right)$$ From this point on I am not sure of what to do as integrating with respect to $a$ to recover $I(a)$ does not simplify the integral. If anybody has any idea of how to approach finding a closed form of this integral then please let me know. Thank you in advance.
|
With the help of I know good approximations of the real part of the integral $$\int_0^1 \log \left(\zeta(x)\right)dx,$$ where $\zeta(x)$ denotes the Riemann zeta function (evaluated over real numbers). See it as int log(zeta(x))dx, from x=0 to 1 or 15 digits of int log(zeta(x))dx, from x=0 to 1 Question. I'm curious to know if this constant $$\Re\int_0^1 \log \left(\zeta(x)\right)dx$$ is in the literature. Can you provide me the reference? Then answer this question as a reference request adding what is the article showing/defining the value of this real constant, and I am going to search and read such statement. Many thanks. My problem here is that I can not find the numeric value of this constant in The On-Line Encyclopedia of Integer Sequences or in Internet.
|
I found that this command install elementary os $ sudo apt-get install elementary-desktop but the package cannot be located so please help.
|
I want to install Pantheon desktop environment from elementaryOS on Ubuntu, is that possible?
|
I started working for a company that fired a previous IT worker for leaking data. I can only say the following things: We use a Firebird DB with an application written by another company, Proxmox, for virtualization of Windows Server 2008 R2, SQL Server, cloud core Mikrotik router, and a few other Mikrotik devices. I am not 100% sure, but is there some quick way to check if there are some backdoors left, without interrupting internal processes and reformatting everything? This previous guy was really good, having written software in C++ and C#. I also know that he did some assembler and cracked a few programs in ollydbg.
|
We all know it happens. A bitter old IT guy leaves a into the system and network in order to have fun with the new guys and show the company how bad things are without him. I've never personally experienced this. The most I've experienced is somebody who broke and stole stuff right before leaving. I'm sure this happens, though. So, when taking over a network that can't quite be trusted, what steps should be taken to ensure everything is safe and secure?
|
I'm trying to align my equations so that the align takes up a fresh line. My code at the moment is \begin{align} \frac{d}{d x_3}(|\hat R(\omega,x_3)|^2 + |\hat T(\omega,x_3)|^2) &= \frac{d\hat R}{d x_3}\overline{\hat R} + \frac{d \overline {\hat R}}{d x_3}\hat R + \frac{d \hat T}{d x_3} \overline {\hat T} + \frac{d \overline {\hat T}}{d x_3}\hat T \\ \nonumber &+ \hat R \overline{\hat R}(\Delta_{4}-\Delta_1)-\hat{R}^2\overline{\hat R} \Delta_2+\overline{\hat R}\Delta_3 \\ \nonumber &+\hat R \overline{\hat R}(\overline{\Delta_4}-\overline{\Delta_1})-\overline{\hat R}^2\hat{R} \overline{\Delta_2}+\hat R \overline{\Delta_3} \\ \nonumber &- \hat T \overline{\hat T}(\Delta_1+\Delta_2\hat R) \\ \nonumber &- \hat T \overline{\hat T}(\overline{\Delta_1}+\overline{\Delta_2}\overline{\hat R}). \\ \nonumber \end{align} How can I align this such that the right hand side starts under the derivative? I want to fill the page better. Thanks in advance.
|
I find that I have unpleasant spacing between the equals sign and (e.g.) the exponential function in this particular case, while using the align environment. I have a long expression which has to be split up in multiple rows. The alignment character & appears to gobble up all space when it comes after the equals sign. How could I remedy this while still preserving the plus sign alignment below? Ideally, I would like to have the second row from the first equation, and the first row from the second equation. \documentclass{article} \usepackage{amsmath} \begin{document} \begin{align} % bad spacing at first row, but correctly placed second row 2 \cosh t =& e^t \\ &+ e^{-t} \end{align} \begin{align} % good spacing at first row, but incorrectly placed second row 2\cosh t &= e^t \\ &+ e^{-t} \end{align} \end{document}
|
Given a dictionary in Python: {u'100': 0, u'200': 1, u'300': 2, u'100': 1, u'400': 1, u'400': 1, u'500': 1} How can I create a new dictionary that reverses the key and value: {0: [u'100'], 1: [u'200', u'100', u'400', u'400', u'500'], 2: [u'100']}
|
Given a dictionary like so: my_map = {'a': 1, 'b': 2} How can one invert this map to get: inv_map = {1: 'a', 2: 'b'}
|
The infinite monkey theorem states that a monkey hitting keys at random on a typewriter keyboard for an infinite amount of time will almost surely type a given text, such as the complete works of William Shakespeare. Source: My question is actually if pi is a "random" sequence of numbers. (I've read in other posts that it's likely to be such a sequence, and that e.g. irrationality isn't a sufficient condition, as can be seen in 0.01001000100001...) But is there an elegant mathematical way to proof if a number is such a random sequence? Or can it be proven with statistics/numerical methods with a kind of certainty that it's such a number? EDIT: people stated that the exact mathematical term for "random" that I was searching for, should've been "normal". So my questions boils down to: Pi is likely to be a normal number; if it is, it contains every sequence of numbers. But if it isn't, does it then contain every sequence of numbers (although in this case not with the same likelihood)? Or is this not sure (or even a contradiction)?
|
I came across the : Which states: $\pi$ Pi Pi is an infinite, nonrepeating $($sic$)$ decimal - meaning that every possible number combination exists somewhere in pi. Converted into ASCII text, somewhere in that infinite string of digits is the name of every person you will ever love, the date, time and manner of your death, and the answers to all the great questions of the universe. Is this true? Does it make any sense ?
|
I run Ubuntu on a USB, but it doesn't save my data. Is there a way to save my data?
|
I've tried so many combinations - all I want is a fast Ubuntu Live USB disk with persistence that works. What I've tried so far: Using unetbootin on my Mac, choosing some "Space used to preserve files across reboots (Ubuntu only)". Result: Doesn't boot at all. Using unetbootin on my Mac, choosing no such space. Result: Boots fine and very fast (doesn't even show the annoying dialog "Try ubuntu/install ubuntu" at startup!), but has no persistence. (So I have to choose my keyboard layout, install programs I need, etc. every time) Using Startup Disk Creator from my Ubuntu 11.04 installation. Result: I cannot choose "reserved extra space" at all. It's greyed out. I know I know, there was bug , and many people say that the workaround from works for them. But it doesn't work with Ubuntu 11.04 anymore (see also ). Using Startup Disk Creator from my Kubuntu 10.10 installation, gnome version (usb-creator-gtk). Result: I can select the "reserved extra space" option, but installation doesn't work (fails when installing the bootloader). Using Startup Disk Creator from my Kubuntu 10.10 installation, kde version (usb-creator-kde). Result: Actually works: Reserved space can be selected, installation works. But after booting, I get the screen "Try ubuntu/install ubuntu". Clicking on "Try ubuntu" takes me to the desktop - but only after waiting 5 minutes (every time!). It also doesn't seem to keep my keyboard settings. I know, that instead of creating a startup disk, I could install a full ubuntu system on the USB stick. But as far as I know, this isn't very good, because /tmp and similar directories will then also be on the USB disk, which is a) slow, and b) not very good for the USB disk due to frequent overwriting. I'm frustrated. So has anybody managed to create a working Ubuntu 11.04 Live USB disk with persistence?
|
I want to prepend the data of a file (random.txt) into another set of files (real.txt) in a folder. Take the following example: $ cat random some text $ cat real.txt sample text If I run the following command: $ sed i.old '1s;^;some text\n;' real.txt $ cat real.txt some text sample text This command prepends the text of file random into file real.txt, but the content of random is not fixed. Is it possible to redirect the content of the random into real.txt? I tried the following command: $ sed -i.old "1s;^;$(cat random)\n;" real.txt $ cat real.txt Which gives the output: some text sample text The problem occurs when i my random fil gets a txt starting with "/*". It shows following error: $ cat real.txt /*new text new line*/ $sed -i.old "1s;^;$(cat random)\n;" real.txt sed: -e expression #1, char 16: unterminated `s' command
|
I need to add PHP tags surrounding a file. It's easy to append them using find . -exec echo "?>" >> '{}' \; but how can I prepend the tag <?php?
|
Why does Metropolis Hastings algorithm need/make a sequence of interdependent samples, i.e., a Markov chain in order to generate a posterior distribution?
|
Maybe the concept, why it's used, and an example.
|
The .asc LiDAR files provided by the environment agency have height values provided to a precision of the level used to measure atoms. How to quickly lose a few of the pointless digits on the end to get from attometers to centimetres? There must be a simple solution but I can't see it. I have tried raster calculator but the results of the calculation below are still in attometers. (ToInt("DSM@1"*10))/10
|
How can I use gdal_translate for AAIGrid so that the raster values are not more than 4 decimal places.
|
I was recently coding in C++ when I realized that the int main() function works fine as a long main() and can support larger numbers (up to 2^63) so why is that not the normal way it is coded?
|
What is the correct (most efficient) way to define the main() function in C and C++ — int main() or void main() — and why? And how about the arguments? If int main() then return 1 or return 0? There are numerous duplicates of this question, including: — For C++, with a very good answer indeed. Related:
|
I have a few SQL Server 2005 databases in simple recovery mode. The disk volume in which my transaction logs are stored had only 1GB free, when I started a stored procedure (massive delete in a single table) the log grows a lot and the disk is running out of space, and the stored procedure seems to work indefinetly. How can I manage this transaction log?
|
This one seems to be a common question in most forums and all over the web, it is asked here in many formats that typically sound like this: In SQL Server - What are some reasons the transaction log grows so large? Why is my log file so big? What are some ways to prevent this problem from occurring? What do I do when I get myself on track with the underlying cause and want to put my transaction log file to a healthy size?
|
I recently bought myself a Windows 10 gaming computer and I downloaded MC on it. It works until I try to open a world or server and crashes giving me this message: Completely ignored arguments: [--nativeLauncherVersion, 301] [19:24:28] [Client thread/INFO]: Setting user: Vek05 [19:24:28] [Client thread/INFO]: (Session ID is <censored>) [19:24:29] [Client thread/INFO]: LWJGL Version: 2.9.4 [19:24:29] [Client thread/INFO]: Reloading ResourceManager: Default [19:24:30] [Sound Library Loader/INFO]: Starting up SoundSystem... [19:24:30] [Thread-4/INFO]: Initializing LWJGL OpenAL [19:24:30] [Thread-4/INFO]: (The LWJGL binding of OpenAL. For more information, see http://www.lwjgl.org) [19:24:30] [Thread-4/INFO]: OpenAL initialized. [19:24:30] [Sound Library Loader/INFO]: Sound engine started [19:24:31] [Client thread/INFO]: Created: 1024x512 textures-atlas [19:24:42] [Server thread/INFO]: Starting integrated minecraft server version 1.9 [19:24:42] [Server thread/INFO]: Generating keypair [19:24:42] [Server thread/INFO]: Preparing start region for level 0 [19:24:43] [Server thread/INFO]: Preparing spawn area: 10% [19:24:44] [Server thread/INFO]: Preparing spawn area: 22% [19:24:45] [Server thread/INFO]: Preparing spawn area: 34% [19:24:46] [Server thread/INFO]: Preparing spawn area: 48% [19:24:47] [Server thread/INFO]: Preparing spawn area: 61% [19:24:48] [Server thread/INFO]: Preparing spawn area: 72% [19:24:49] [Server thread/INFO]: Preparing spawn area: 83% [19:24:50] [Server thread/INFO]: Preparing spawn area: 97% [19:24:50] [Server thread/INFO]: Changing view distance to 12, from 10 [19:24:51] [Server thread/INFO]: Vek05[local:E:0e11365e] logged in with entity id 236 at (244.5, 98.0, 265.5) [19:24:51] [Server thread/INFO]: Vek05 joined the game [19:24:55] [Server thread/WARN]: Can't keep up! Did the system time change, or is the server overloaded? Running 4073ms behind, skipping 81 tick(s) # # A fatal error has been detected by the Java Runtime Environment: # # EXCEPTION_ACCESS_VIOLATION (0xc0000005) at pc=0x00007ffe9ca0d76c, pid=9492, tid=7700 # # JRE version: Java(TM) SE Runtime Environment (8.0_25-b18) (build 1.8.0_25-b18) # Java VM: Java HotSpot(TM) 64-Bit Server VM (25.25-b02 mixed mode windows-amd64 compressed oops) # Problematic frame: # C [ig9icd64.dll+0x56d76c] # # Failed to write core dump. Minidumps are not enabled by default on client versions of Windows # # An error report file with more information is saved as: # C:\Users\vince\AppData\Roaming\.minecraft\hs_err_pid9492.log # # If you would like to submit a bug report, please visit: # http://bugreport.sun.com/bugreport/crash.jsp # The crash happened outside the Java Virtual Machine in native code. # See problematic frame for where to report the bug. # AL lib: (EE) alc_cleanup: 1 device not closed Java HotSpot(TM) 64-Bit Server VM warning: Using incremental CMS is deprecated and will likely be removed in a future release What does it mean and how can I fix this?
|
I go to the Minecraft menu and click on singleplayer to test out the 1.9 update. I made a new world (no mods), it said downloading terrain and then it crashes every time (I've tried about 20 times now). Has anyone else experienced similar issues and know what the fix may be? Here is the launcher log: Completely ignored arguments: [--nativeLauncherVersion, 301] [00:35:12] [Client thread/INFO]: Setting user: Teddy_Cromwell [00:35:12] [Client thread/INFO]: (Session ID is <censored>) [00:35:14] [Client thread/INFO]: LWJGL Version: 2.9.4 [00:35:14] [Client thread/WARN]: Removed selected resource pack resources (no region and battle music).zip because it's no longer compatible [00:35:14] [Client thread/INFO]: Reloading ResourceManager: Default [00:35:15] [Sound Library Loader/INFO]: Starting up SoundSystem... [00:35:16] [Thread-5/INFO]: Initializing LWJGL OpenAL [00:35:16] [Thread-5/INFO]: (The LWJGL binding of OpenAL. For more information, see http://www.lwjgl.org) [00:35:16] [Thread-5/INFO]: OpenAL initialized. [00:35:16] [Sound Library Loader/INFO]: Sound engine started [00:35:18] [Client thread/INFO]: Created: 1024x512 textures-atlas [00:35:26] [Server thread/INFO]: Starting integrated minecraft server version 1.9 [00:35:26] [Server thread/INFO]: Generating keypair [00:35:27] [Server thread/INFO]: Preparing start region for level 0 [00:35:28] [Server thread/INFO]: Preparing spawn area: 5% [00:35:29] [Server thread/INFO]: Preparing spawn area: 8% [00:35:30] [Server thread/INFO]: Preparing spawn area: 15% [00:35:31] [Server thread/INFO]: Preparing spawn area: 21% [00:35:32] [Server thread/INFO]: Preparing spawn area: 27% [00:35:33] [Server thread/INFO]: Preparing spawn area: 34% [00:35:34] [Server thread/INFO]: Preparing spawn area: 42% [00:35:35] [Server thread/INFO]: Preparing spawn area: 48% [00:35:36] [Server thread/INFO]: Preparing spawn area: 56% [00:35:37] [Server thread/INFO]: Preparing spawn area: 66% [00:35:38] [Server thread/INFO]: Preparing spawn area: 74% [00:35:39] [Server thread/INFO]: Preparing spawn area: 81% [00:35:40] [Server thread/INFO]: Preparing spawn area: 91% [00:35:41] [Server thread/INFO]: Preparing spawn area: 98% [00:35:42] [Server thread/INFO]: Teddy_Cromwell[local:E:6d7525a7] logged in with entity id 301 at (244.5, 69.0, 244.5) [00:35:42] [Server thread/INFO]: Teddy_Cromwell joined the game # # A fatal error has been detected by the Java Runtime Environment: # # EXCEPTION_ACCESS_VIOLATION (0xc0000005) at pc=0x00007fffcf6e6b37, pid=15456, tid=12424 # # JRE version: Java(TM) SE Runtime Environment (8.0_25-b18) (build 1.8.0_25-b18) # Java VM: Java HotSpot(TM) 64-Bit Server VM (25.25-b02 mixed mode windows-amd64 compressed oops) # Problematic frame: # C [ig8icd64.dll+0x16b37] # # Failed to write core dump. Minidumps are not enabled by default on client versions of Windows # # An error report file with more information is saved as: # C:\Users\Connor\AppData\Roaming\.minecraft\hs_err_pid15456.log # # If you would like to submit a bug report, please visit: # http://bugreport.sun.com/bugreport/crash.jsp # The crash happened outside the Java Virtual Machine in native code. # See problematic frame for where to report the bug. # AL lib: (EE) alc_cleanup: 1 device not closed Java HotSpot(TM) 64-Bit Server VM warning: Using incremental CMS is deprecated and will likely be removed in a future release
|
The other day I got a 10k egg and I was pretty hyped seeing as they are quite rare now. So I decided I would go out and walk 10k. When the egg got to 9.9k I got out my phone and looked at it then put it back in my pocket. But then when I checked it again the egg was not there it had disappeared from the page where it shows all the eggs. So I checked journal. Nothing. I went onto Pokemon and clicked recently caught. Nothing. I don't know what happend that day but I would like to know.
|
So my Pokemon eggs are reaching "maturity" then they just disappear. I don't get a new Pokemon. The egg just disappears. I had this happen with a 2k and a 5k now. Is this happening to anyone else?
|
My terminal prompt is set using the following configuration in my .profile file: # Prompt GREEN=$(tput setaf 2) LIME_YELLOW=$(tput setaf 190) MAGENTA=$(tput setaf 5) WHITE=$(tput setaf 7) NORMAL=$(tput sgr0) PS1="\[${WHITE}${MAGENTA}\]\u\[${WHITE}@${GREEN}\]\h \[${LIME_YELLOW}\]\W \[${WHITE}${NORMAL}\]$ " Generally speaking it works fine but sometimes I end up with an off-by-one error. After a running a few commands and then accessing the history using the up key, some characters seem to be getting garbled. For example: matt@laptop ~ $ git log becomes matt@laptop ~ $ gitlog or: matt@laptop ~ $ ssh desktop becomes matt@laptop ~ $ssh desktop The incorrectly displayed command executes normally and appears in history normally too.
|
Often when I start looking at history of commands some of the characters from a command displayed aren't erased, for example: What's happening: prompt$ some_command prompt$ some_commanother_command What should have happened: prompt$ some_command prompt$ another_command I can't erase those characters and bash ignores them when executing the command. They also disappear when a new prompt is being displayed (after pressing Enter for example). I asked other people who work on Linux at my workplace and they said that they have that problem sometimes too, but they didn't have an idea on how solve that issue. I have Ubuntu 11.10 and I'm using guake. Here is my PS1: \e[0;31m\u \A ${PWD##*/}\e[0;32m$(parse_git_branch)\e[0;31m$\e[m where parse_git_branch is parse_git_branch () { git name-rev HEAD 2> /dev/null | sed 's#HEAD\ \(.*\)# (\1)#' } As far as I know my colleagues have that problem even with less "fancy" PS1.
|
I have the following sequence $(x_{n})_{n\geq 1}$ ; $x_{n+1}=x_{n}^2-x_{n}+1$ I need to find $x_1$ such that $(x_{n})_{n\geq 1}$ is convergent. I found that $(x_n-1)^{2}>0$ so $x_n$ is increasing. Also, If I note the limit with $L$ I get $L^2-2l+1=0$ so $L=1$ If $x_1>1$ and $x_n$ is increasing result that $x_n>1$ How to continue?
|
Suppose that $x_0 = \alpha \in \mathbb{R}$ and $x_{n+1} = x_n ^2-x_n +1$. I am asked to study the boundedness of $(x_n)$ and then asked if $(x_n)$ converges. How can I show that $(x_n)$ is bounded? I have noted that $$x_{n+1}-x_n = (x_n-1)^2\geq 0$$ so $x_n$ is increasing. Suppose that $(x_n)$ converges, then $l = l^2-l+1$ so $l = 1$. This means that the sequence converges only when $\alpha \leq 1$. And so $(x_n)$ is bounded above by $1$ if $\alpha\leq 1$ (since an increasing sequence converges to its supremum) otherwise the sequence is not bounded above. Is my reasoning correct?
|
I am new into photography as a business, one of my customers have asked if they could get an A2 size print. My question is, will an A2 size print be clear enough from a canon 5d iii image (No Crop).
|
What size images do I need for common print sizes, such as wallet size, 8x10, and 16x20? Is there a general formula? How could that size change if, for example, a 16x20 was printed on canvas rather than photopaper?
|
I always do this when passing variable to command mkdir -p "$dir_to_make" are those quotes needed? I tried to google but didn't find much. I always write them, just interested if they are necessary.
|
The old advice used to be to double-quote any expression involving a $VARIABLE, at least if one wanted it to be interpreted by the shell as one single item, otherwise, any spaces in the content of $VARIABLE would throw off the shell. I understand, however, that in more recent versions of shells, double-quoting is no longer always needed (at least for the purpose described above). For instance, in bash: % FOO='bar baz' % [ $FOO = 'bar baz' ] && echo OK bash: [: too many arguments % [[ $FOO = 'bar baz' ]] && echo OK OK % touch 'bar baz' % ls $FOO ls: cannot access bar: No such file or directory ls: cannot access baz: No such file or directory In zsh, on the other hand, the same three commands succeed. Therefore, based on this experiment, it seems that, in bash, one can omit the double quotes inside [[ ... ]], but not inside [ ... ] nor in command-line arguments, whereas, in zsh, the double quotes may be omitted in all these cases. But inferring general rules from anecdotal examples like the above is a chancy proposition. It would be nice to see a summary of when double-quoting is necessary. I'm primarily interested in zsh, bash, and /bin/sh.
|
I have a table as below: FileHash FilePath 1 A.txt 3 e.txt 3 f.txt 3 g.txt 3 h.txt 2 B.txt 2 c.txt In T-SQL, How to concatenate the first 3 FilePath of each FileHash as follows: FileHash FilePath 1 A.txt 2 B.txt, C.txt 3 e.txt, f.txt, g.txt
|
I'm trying to migrate a MySQL-based app over to Microsoft SQL Server 2005 (not by choice, but that's life). In the original app, we used almost entirely ANSI-SQL compliant statements, with one significant exception -- we used MySQL's group_concat function fairly frequently. group_concat, by the way, does this: given a table of, say, employee names and projects... SELECT empName, projID FROM project_members; returns: ANDY | A100 ANDY | B391 ANDY | X010 TOM | A100 TOM | A510 ... and here's what you get with group_concat: SELECT empName, group_concat(projID SEPARATOR ' / ') FROM project_members GROUP BY empName; returns: ANDY | A100 / B391 / X010 TOM | A100 / A510 So what I'd like to know is: Is it possible to write, say, a user-defined function in SQL Server which emulates the functionality of group_concat? I have almost no experience using UDFs, stored procedures, or anything like that, just straight-up SQL, so please err on the side of too much explanation :)
|
Issue: When I try to run a java program on my personal machine I recieve the following error: Exception in thread "main" java.lang.NoClassDefFoundError: ecs100/UI at BallDrop.<init>(BallDrop.java:37) at BallDrop.main(BallDrop.java:63) Caused by: java.lang.ClassNotFoundException: ecs100.UI at java.net.URLClassLoader.findClass(URLClassLoader.java:381) at java.lang.ClassLoader.loadClass(ClassLoader.java:424) at sun.misc.Launcher$AppClassLoader.loadClass(Launcher.java:331) at java.lang.ClassLoader.loadClass(ClassLoader.java:357) Explanation: I am required to write a program using an external library 'ecs100'. It has been supplied as a .jar mime-type file. I have the file test.java: import ecs100.*; class test{ public static void main(String args[]){ System.out.println('Test string'); UI.initialise(); //this is just how the library is supposed to be used } } I have tried compiling with the command: javac -cp esc100.jar test.java, which appears to load correctly. Then when I attempt to run with the command java test it gives the error I specified. Details: I have been told that the library was written for oracle java 8. I have attempted to compile and run with oracle java 8 JDK, oracle java 9 JDK and openJDK 9 or 8. I am running ubuntu 16.10. And I do not have any nVidia drivers installed (apparently that can cause problems). I have tried running files compiled successfully from another computer. Even if they ran on that computer, no luck with mine. The command java -version outputs: java version "1.8.0_121" Java(TM) SE Runtime Environment (build 1.8.0_121-b13) Java HotSpot(TM) 64-Bit Server VM (build 25.121-b13, mixed mode) The command javac -verison outputs: javac 1.8.0_121 Conclussion: I would greatly appreciate any feedback or suggestions. I imagine I'm either doing something wrong with: The classpath in compilation The import statement A missing dependancy Wrong use of one of the commands I am basically positive the problem is not one of the following: An issue with the way I am using the library
|
I am getting a NoClassDefFoundError when I run my Java application. What is typically the cause of this?
|
How do i Download Web Page using C (not with libcurl), OS: Win32
|
How to fetch HTML in C or C++? with Sockets. Can you give me a Example code pls? NOTE - I originally closed this, but reopened. To the poster - Please see: and
|
From what I heard. Flora Colossus's can only say a specific phrase when they get older because of their voice box hardening. If baby Groot is young enough to not have his voice box hardened, why does he still say the only phrase we all have heard?
|
In the Marvel Comics series "Annihilation: Conquest - Starlord," Groot is introduced and speaks normally. However, in "Annihilation: Conquest," which is the mini-series immediately following "Starlord," he only says the phrase "I am Groot" repeatedly. This continues through to "Guardians of the Galaxy." The "Starlord" mini-series was written by Keith Giffen, whereas "Annihilation: Conquest" and "Guardians of the Galaxy" were written by Dan Abnett and Andy Lanning. Was this simply something that was changed between writers? Is it ever explained why Groot went from speaking normally to only saying "I am Groot"?
|
I have a Dell Inspiron 531s desktop computer. I have installed Ubuntu 14.04.2 on it, but I can only install it from USB when I go to the "Install Ubuntu" option and not the "Try Ubuntu without installing" option because nothing will show up. When I boot up Ubuntu, I can log in, but after that, there is only the background and my mouse and nothing else. I have tried all kinds of things from other threads, but they have not worked. I have also tried installing nvidia-current and nvidia-current-updates to no avail. None of the commands from the mentioned thread works for me. Also, I can boot into recovery mode, but only if I don't have the Nvidia driver. And I haven't been able to do a normal boot at all.
|
When I login, nothing happens. I am presented with my desktop wallpaper. No Dash, no Launcher, nothing.
|
I have a Windows form which is taking forever to load data into my datagridview. I keep getting the error in this line: dataGridView1.Rows.Add(row); Cross-thread operation not valid: Control 'dataGridView1' accessed from a thread other than the thread it was created on. Here is my code: public List<string> _checked = new List<string>(); private void getBarcodProperty() { string query = "select Name from RfidUnic where Barcode = @barcode"; while (true) { while (_checked.Count > 0) { SQLiteCommand cmd = new SQLiteCommand(query, sqliteConnection); cmd.Parameters.AddWithValue("@barcode", _checked[0]); sqliteConnection.Open(); SQLiteDataReader da = cmd.ExecuteReader(); if (da.Read()) { if (!da.IsDBNull(0)) { string[] row = new string[] { da[0].ToString(), "1", _checked[0] }; dataGridView1.Rows.Add(row); _checked.RemoveAt(0); } } else { string[] row = new string[] { "empty", "1", _checked[0] }; dataGridView1.Rows.Add(row); _checked.RemoveAt(0); } sqliteConnection.Close(); } } } Please show me where I am going wrong Thanks
|
I have a scenario. (Windows Forms, C#, .NET) There is a main form which hosts some user control. The user control does some heavy data operation, such that if I directly call the UserControl_Load method the UI become nonresponsive for the duration for load method execution. To overcome this I load data on different thread (trying to change existing code as little as I can) I used a background worker thread which will be loading the data and when done will notify the application that it has done its work. Now came a real problem. All the UI (main form and its child usercontrols) was created on the primary main thread. In the LOAD method of the usercontrol I'm fetching data based on the values of some control (like textbox) on userControl. The pseudocode would look like this: CODE 1 UserContrl1_LoadDataMethod() { if (textbox1.text == "MyName") // This gives exception { //Load data corresponding to "MyName". //Populate a globale variable List<string> which will be binded to grid at some later stage. } } The Exception it gave was Cross-thread operation not valid: Control accessed from a thread other than the thread it was created on. To know more about this I did some googling and a suggestion came up like using the following code CODE 2 UserContrl1_LoadDataMethod() { if (InvokeRequired) // Line #1 { this.Invoke(new MethodInvoker(UserContrl1_LoadDataMethod)); return; } if (textbox1.text == "MyName") // Now it wont give an exception { //Load data correspondin to "MyName" //Populate a globale variable List<string> which will be binded to grid at some later stage } } BUT BUT BUT... it seems I'm back to square one. The Application again become nonresponsive. It seems to be due to the execution of line #1 if condition. The loading task is again done by the parent thread and not the third that I spawned. I don't know whether I perceived this right or wrong. I'm new to threading. How do I resolve this and also what is the effect of execution of Line#1 if block? The situation is this: I want to load data into a global variable based on the value of a control. I don't want to change the value of a control from the child thread. I'm not going to do it ever from a child thread. So only accessing the value so that the corresponding data can be fetched from the database.
|
1-Therefore, the extraction of optimized thermodynamic parameters from various publications is required. In the above sentence, is the definite article "the" really necessary? When are they required in the case of the+noun+of+noun sentences?
|
Tell me please why the is not used in the first following sentence and is used in the second one. Ancient egyptian civilization existed for a long time. The Inca civilization flourished for a long time. Is the omitted because of the word ancient, or the use of the is optional in both sentences?
|
I have Ubuntu ver. 12.04 and Nvidia ver. 304. After i updated my driver to 319 which is recommended in Additional Driver, I got stuck in the booting screen with something like: AppArmor etc. (black screen with yellow code) so i had to reinstall my OS. Please could you help me how to install it correctly without error, because I am new with Linux. Thank you very much!
|
I recently installed the NVIDIA 319 driver from the Jockey window, and now X won't load! I'm stuck with a blinking cursor. I used to have the 304 drivers installed. How do I fix this?
|
Does Great Weapon Fighting style allow Vicious weapons 2d6 bonus to be rerolled? Is it considered weapon damage? I know similar questions have been asked but need to know for this exact circumstance. (Note: this question concerns the SRD version of a Vicious Weapon. The Vicious Weapon published in the Dungeon Master's Guide adds a flat 7 damage, rather than 2d6)
|
This has been a point of some controversy within our local AL community, with different DMs giving different rulings. From what I could see, this site has only touched on the Maneuver/Smite issue, with, according to some of my DMs, an out of date answer. This also leaves the problem of extra dice on magical weapons such as an Ild rune or Hazirawn, maneuver damage dice given by another player through Commander's Strike, damage dice given by a College of Valor bard, Sneak Attack dice, and likely others which currently escape my mind. Which damage dice exactly does the Great Weapon Fighting fighting style allow you to reroll?
|
I am running Ubuntu Mate 16.04 Beta 2. When the release of Ubuntu Mate 16.04LTS on April 21 will I have to do anything to upgrade or will it just run as a normal upgrade operation? Robert...
|
I installed an Ubuntu alpha or beta and have been keeping it up to date. So, Should I presume that my system has automatically updated to the next alpha or beta, and will be running the official release when it's finished?
|
I have simple javascript alert box i want it to close automatically after 5 second. if possible help please. <script type="text/javascript"> function show_alert() { alert("Hello! I am an alert box!"); } </script> <input type="button" onclick="show_alert()" value="Show alert box" />
|
I want to be able to close an alert box automatically using Javascript after a certain amount of time or on a specific event (i.e. onkeypress). From my research, it doesn't look like that's possible with the built-in alert() function. Is there a way to override it and have control over the dialog box that it opens? Also, I don't want an override that shows a hidden div as the alert. I need an actual dialog box.
|
I've seen a few videos of folk connecting their Nexus to an external monitor with a SlimPort HDMI cable. Would a 10 or 7 inch touchscreen work the same way? Or would it need a different cable connection? If this is possible I can extend my Nexus 4 to a tablet :)
|
I need to buy new monitor for my PC and I'm thinking about touch enabled monitors like or . I recently bought Gooseberry Board with Android on it and it would be great if I could connect it by HDMI cable to one of these monitors and use touch screen like i would on a tablet. Does anybody know if Android can work with such touch enabled monitors? Maybe someone have touch enabled monitor and could check it somehow?
|
$-1=(-1)^1=(-1)^\frac{2}{2}=((-1)^2)^\frac{1}{2}=\sqrt{(-1)^2}=\sqrt{1}=1$ This proof bugs me for the following reasons: Mathematicians have defined the symbol $\sqrt{}$ (Named the principal square root) to mean 'take only the positive square root of the number under the radical' This makes it so that the $y = \sqrt{x}$ is a function and therefore for every x-value (input) there is only 1 y-value (output). Therefore $\sqrt{x^2}=|x|$ due to the above definition. But then this means $\sqrt{(-1)^2} = |-1| = 1!!!!$ I really don't understand what's wrong with the above proof, the only way this could make sense is to define $\sqrt{a} = \pm k$ where the symbol know gives rise to two solutions to the equation, but then y = $\sqrt{x}$ is not a function and is simply a relation. If we have $\sqrt{a}=\pm k$ then $\sqrt{(-1)^2}$ can be equal to -1 as well and then $-1=(-1)^1=(-1)^\frac{2}{2}=((-1)^2)^\frac{1}{2}=\sqrt{(-1)^2} = -1 = -1$ and everything works out fine. Side Note: Why do we even want y = $\sqrt{x}$ to be a function anyway? What's the harm in defining $\sqrt{x} = \pm k$ where y = $\sqrt{x}$ is not a function? Proof for $\sqrt{x^2}=|x|$ Let k = $\sqrt{x^2}$ where k is a constant. $k^2=(\sqrt{x^2})^2=(((x^2))^\frac{1}{2})^2$ $k^2=x^2$ $k^2-x^2=0$ $(k+x)(k-x)=0$ $k = x$ or $k=-x$ But $\sqrt{a}>0$ for $a>0$ by definition of the principal square root. $\therefore k \neq-x$ In order to make this identity work properly, an absolute value sign is required. $\therefore \sqrt{x^2}=|x|$ Btw, my question is not the same as why $\sqrt{-1\times-1}\neq(\sqrt{-1})^2$ as I am not using the property $\sqrt{a}\sqrt{b}=\sqrt{ab}$ here and I am not bringing up the concept of imaginary numbers.
|
I know there is something wrong with this but I don't know where. It's some kind of a math fallacy and it is driving me crazy. Here it is: $$-1= (-1)^3 = (-1)^{6/2} = \sqrt{(-1)^6}= 1?$$
|
So I have a line that looks like this $\begin{pmatrix}1\\2\\-1\end{pmatrix}$ + t$\begin{pmatrix}1\\5\\1\end{pmatrix}$. And I'm trying to find the minimal distance between that line and the line x1 = x2 = x3. I know the find the distance between two lists would be to subtract the lists and the find the length of that but how would I find the distance for two equations like this?
|
I know how to find the distance between a point and a line, not between two lines. Find the shortest distance between the lines $(-1,1,4) + t(1,1,-1)$ and $(5,3,-3) + s(-2,0,1)$ Any help would be appreciated.
|
I'm trying to build the . When I run the command make -s -j8 DEFAULT_TARGET=shared_release it gives me the error of permission denied.
|
I have this problem: I'm used to compile and run .c files with CodeBlocks. If I do that from my Desktop (ext4 partition) it works without problems, but doing this from my secondary hard drive (NTFS partition) makes CodeBlocks to say permission denied while running a .c file. I have read it's because of the partition type is it correct? But I don't know how to solve it. I tried to edit fstab (sudo gedit /etc/fstab) adding this line: /dev/sda /media/Dati ntfs user,exec 0 1 but after rebooting Ubuntu I had a warning on boot about a problem mounting a drive, that's because I set KDE to auto mount my Dati drive on boot. So I should auto mount my NTFS drive with execute permission? How can I do that?
|
I cannot paste in comments. The option appears on long press, but nothing is pasted when I tap it (the comment box blinks, but with no visible effect). Pasting in the answer box, question editing interface, etc. works, and in comments on the mobile site in a browser. App Version: 1.6.6.2 Device: iPhone 7 OS Version: Version 11.0.3 (Build 15A432)
|
I’m able to copy-paste from any application to any application. I’m able to copy from a comment or from a question or from an answer. I’m able to paste to a question or answer. However, if I attempt to paste into a comment, nothing happens. I am able to subsequently paste into another application, confirming that the text is actually on the clipboard. However, copying SE links will paste them successfully, but all other text - including other links - still fails. This leads me to believe that it’s a SE issue and not an Apple one. This has been an issue since 11.0 beta and persists through iOS 13 release.
|
I want to display a list of terms and child terms using Taxonomy menu,my list is very large ( more than 2000 terms), and Im getting this error: Additional uncaught exception thrown while handling exception. Original PDOException: SQLSTATE[HY000]: General error: 2006 MySQL server has gone away: SELECT * FROM {system} WHERE type = &#039;theme&#039; OR (type = &#039;module&#039; AND status = 1) ORDER BY weight ASC, name ASC; Array ( ) in system_list() (line 165 of C:\wamp\www\Books\includes\module.inc). Additional PDOException: SQLSTATE[HY000]: General error: 2006 MySQL server has gone away: SELECT expire, value FROM {semaphore} WHERE name = :name; Array ( [:name] =&gt; theme_registry:runtime:adaptivetheme_admin:cache ) in lock_may_be_available() (line 167 of C:\wamp\www\Books\includes\lock.inc). Uncaught exception thrown in session handler. PDOException: SQLSTATE[HY000]: General error: 2006 MySQL server has gone away in _drupal_session_write() (line 206 of C:\wamp\www\Books\includes\session.inc). Uncaught exception thrown in shutdown function. PDOException: SQLSTATE[HY000]: General error: 2006 MySQL server has gone away: DELETE FROM {semaphore} WHERE (value = :db_condition_placeholder_0) ; Array ( [:db_condition_placeholder_0] =&gt; 14337154844f4e188d884c54.86419408 ) in lock_release_all() (line 269 of C:\wamp\www\Books\includes\lock.inc). Is this because Taxonomy menu can not handle a large amount of terms?
|
Recently I started getting an error every time I try and add a content no matter what type. This is the error that shows up in the browser: Additional uncaught exception thrown while handling exception. Original PDOException: SQLSTATE[HY000]: General error: 2006 MySQL server has gone away: SELECT COUNT(cid) FROM {comment} WHERE status = :status; Array ( [:status] => 0 ) in comment_count_unpublished() (line 313 of /Applications/MAMP/htdocs/modules/comment/comment.module). Additional PDOException: SQLSTATE[HY000]: General error: 2006 MySQL server has gone away: INSERT INTO {watchdog} (uid, type, message, variables, severity, link, location, referer, hostname, timestamp) VALUES (:db_insert_placeholder_0, :db_insert_placeholder_1, :db_insert_placeholder_2, :db_insert_placeholder_3, :db_insert_placeholder_4, :db_insert_placeholder_5, :db_insert_placeholder_6, :db_insert_placeholder_7, :db_insert_placeholder_8, :db_insert_placeholder_9); Array ( [:db_insert_placeholder_0] => 1 [:db_insert_placeholder_1] => php [:db_insert_placeholder_2] => %type: !message in %function (line %line of %file). [:db_insert_placeholder_3] => a:6:{s:5:"%type";s:12:"PDOException";s:8:"!message";s:154:"SQLSTATE[HY000]: General error: 2006 MySQL server has gone away: SELECT COUNT(cid) FROM {comment} WHERE status = :status; Array ( [:status] =&gt; 0 ) ";s:9:"%function";s:27:"comment_count_unpublished()";s:5:"%file";s:56:"/Applications/MAMP/htdocs/modules/comment/comment.module";s:5:"%line";i:313;s:14:"severity_level";i:3;} [:db_insert_placeholder_4] => 3 [:db_insert_placeholder_5] => [:db_insert_placeholder_6] => ; [:db_insert_placeholder_7] => [:db_insert_placeholder_8] => 127.0.0.1 [:db_insert_placeholder_9] => 1338336955 ) in dblog_watchdog() (line 154 of /Applications/MAMP/htdocs/modules/dblog/dblog.module). I also get the following error in my php error file: PHP Fatal error: Uncaught exception 'PDOException' with message 'SQLSTATE[HY000]: General error: 2006 MySQL server has gone away' in /Applications/MAMP/htdocs/includes/database/database.inc:2136 Stack trace: 0 /Applications/MAMP/htdocs/includes/database/database.inc(2136): PDOStatement->execute(Array) 1 /Applications/MAMP/htdocs/includes/database/database.inc(664): DatabaseStatementBase->execute(Array, Array) 2 /Applications/MAMP/htdocs/includes/database/database.inc(2315): DatabaseConnection->query('SELECT expire, ...', Array, Array) 3 /Applications/MAMP/htdocs/includes/lock.inc(167): db_query('SELECT expire, ...', Array) 4 /Applications/MAMP/htdocs/includes/lock.inc(146): lock_may_be_available('theme_registry:...') 5 /Applications/MAMP/htdocs/includes/theme.inc(447): lock_acquire('theme_registry:...') 6 /Applications/MAMP/htdocs/includes/bootstrap.inc(427): ThemeRegistry->set(Array) 7 [internal function]: DrupalCacheArray->__destruct() 8 {main} thrown in /Applications/MAMP/htdocs/includes/database/database.inc on line 2136 I am having a little trouble deciphering these error messages. Could anyone help me understand what's going on here?
|
I am using MySQL server 5.0. I have a table named User_Login_Details. I want to receive email from my MySQL server when anyone tries to change anything in my Table. That may be Insert, Update or Delete. How can I do this?
|
I'm trying to send an email to several recipients when a new row is inserted into a table. The list of recipients varies. I would like to be able to set this list using a select statement. I also have installed Navicat which allows me to send email notifications but only to a predetermined set of people. Thanks.
|
When entering XML literals using E4X syntax in ActionScript the code highlighting can be broken: package { public class XMLTest { public function XMLTest() { // here highlighting works ok var aVariable:int = 0; var aSprite:Sprite = new Sprite(); var xmlFragment:XML = <root> <node /> <node /> <node /> </root>; // from now on all code highlighting is borked var otherVariable:int = 0; var yetAnother:Sprite = new Sprite(); } } } There is a workaround: package { public class XMLTest { public function XMLTest() { // here highlighting works ok var aVariable:int = 0; var aSprite:Sprite = new Sprite(); var xmlFragment:XML = <root> <node /> <node /> <node /> </root>; // / //<-- resets the parser and code remains valid var otherVariable:int = 0; var yetAnother:Sprite = new Sprite(); } } }
|
I noticed that sometimes my code gets highlighted in different colors when rendered. What is syntax highlighting? How does it work? Why isn't my code being highlighted correctly? How do I report a bug or request a new language? How do I use syntax highlighting? What languages are currently available on Stack Exchange?
|
I have a TikZ picture \begin{tikzpicture}[scale=0.5] \draw (-1,0) arc (180:360:1cm and 0.5cm); \draw[dashed] (-1,0) arc (180:0:1cm and 0.5cm); \draw (0,1) arc (90:270:0.5cm and 1cm); \draw[dashed] (0,1) arc (90:-90:0.5cm and 1cm); \draw (0,0) circle (1cm); \shade[ball color=blue!10!white,opacity=0.20] (0,0) circle (1cm); \end{tikzpicture} which makes a small ball. Is it possible to reuse this shape in another tikz picture? I have another tikz picture in which I use \draw[fill=yellow!30, fill opacity=0.5,text opacity=1] (B) circle (0.7cm) node[right] {$A$}; Instead of circle I want my small custom ball. How is that possible?
|
If I have two tikzpictures drawn: \documentclass{article} \usepackage[margin = 1in]{geometry} \usepackage{tikz} \usetikzlibrary{decorations.pathmorphing,calc,shapes,shapes.geometric,patterns} \begin{document} \tikzset{treetop/.style = {decoration={random steps, segment length=0.4mm},decorate},trunk/.style = {decoration={random steps, segment length=2mm, amplitude=0.2mm},decorate}} \begin{tikzpicture} \foreach \w/\f in {0.3/30,0.2/50,0.1/70} { \fill [brown!\f!black, trunk] (0,0) ++(-\w/2,0) rectangle +(\w,-3); } \foreach \n/\f in {1.4/40,1.2/50,1/60,0.8/70,0.6/80,0.4/90} { \fill [green!\f!black, treetop] ellipse (\n/1.5 and \n); } \end{tikzpicture} \begin{tikzpicture} \shade[bottom color=cyan!60!black, top color=blue!20!white] (0,0) rectangle (10,10); \end{tikzpicture} \end{document} How could I use the first tikz picture within the second? Can I define the first picture as some variable and then place this variable within the second picture and have the option of defining its exact location (x,y) and its size? For example, if I wanted to place the tree in the middle of the rectangle (5,5) but make the size of the tree half its current size. How would I do this
|
There are a few dead projects that could do this: Too Compilcated The question before I go to bed: How to slipstream Ubuntu the easy way? Meaning a GUI Tweaks/Features Autostart in LiveCD mode Full support of Windows filesystems If possible support of Mac OS X hfs+ filesystems(Not needed, but nice to have) Recovery/backup tools slipstreamed. Gparted, with support of all filesystems related to Windows, as that is what needs the most fixing Extremely lite! Wine, for Anti Malware tools. This will be used in a TestCD, which i will use, if i want to backup Windows machines. And if also possible wine, to scan the Windows drives for virusses with mbam superantispyware. Already tested them. They work fine.
|
I would like to customize Ubuntu live CD by installing some additional packages. I have followed but it doesn't seems to work. Can anyone provide clear instructions? Note: I do not prefer Remastersys, manual way will be appreciated. Customization Packages that I want to install: Thunderbird Samba SSH Changes that I need: Remove Games menu from the Application menu Firefox shortcut on Desktop Radiance as the default Theme Different default Ubuntu Wallpaper Configuration file changes I want the panel to be placed at the bottom I want to paste my Samba configuration file instead of default Samba configuration I have few Firefox shortcuts and folders I would like to show that in Desktop Also it will be nice if you say me how to change the icon sets Recent Updates I have customized Ubuntu 10.10 with Firefox shortcuts and few folders on desktops. Everything went smooth. But the installer gets crashes after choosing the timezone. How do i fix this issue? Also setting wallpaper affects the login screen. The wallpaper which i set is displayed on the login screen also. I just want the default one for the login screen.
|
Am an Indian Citizen travelling to Ireland with an Irish visa via LHR so would I need a transit visa at London Heathrow airport?
|
Is there a website or some other way to find out if I need a transit visa for a short stop in the UK on my way somewhere else? Ideally this should give me the answer for all nationalities, and take into account any other visas I may have.
|
I am in Japan and I have purchased a kitchen knife (slightly over ¥16,000), claiming back the sales tax. The tax refund office did attach a document to my passport stating the sale. Tomorrow I will be leaving through Narita. I have read about the procedure and I must show that I am taking the knife away with me. But of course, being it a knife I cannot take it with me in the cabin and I must leave it on the checked luggage. What will be the proper procedure? May I go through customs before checking in? Or must I declare it when checking it somehow?
|
I'm on a vacation in Japan and have bought some items tax-free in different stores (Bic Camera, Isetan, some smaller shops). Can I use the items while in Japan? Do I need to show them after check-in together with the receipts on my passport (at Customs) or can I pack them?
|
I'm not talking about the Google Desktop Search, I'm looking for something more like an android-style widget, where I can enter the search term while on the desktop and it will launch the browser with the search results.
|
How do you get Dash to search Google results?
|
This is a Python-specific PyCharm IDE question regarding the viewing of resulting output plots (in this case, from the Seaborn library). I am looking for a more user-friendly form of displaying my plots external to creating a new window (then exiting that window and opening the next window...) every time I want to view my output plots. In this case, I would also like to avoid any sort of web-dependent output. An example of the incredibly ugly and down-right brutal way in which I currently generate then view plots is as follows: import matplotlib.pyplot as plt fig, ax = plt.subplots() ## plot plot plot plt.show() I also put myself through this in other viz libraries such as matplotlib. While I am aware of the sequential output formatting of Jupyter NoteBooks, I prefer working through PyCharm's environment and would like any answers to be geared toward the PyCharm IDE. Any and all suggestions are certainly welcome. Ideally, I will be provided the most sufficient way to view my plots across any library, but library-specific answers are absolutely welcome as well.
|
After these instructions in the Python interpreter one gets a window with a plot: from matplotlib.pyplot import * plot([1,2,3]) show() # other code Unfortunately, I don't know how to continue to interactively explore the figure created by show() while the program does further calculations. Is it possible at all? Sometimes calculations are long and it would help if they would proceed during examination of intermediate results.
|
Trying to implement some small test cases in my Android application, but at the moment i have some trouble getting the test class to find the fragment. Here is my Activity that just create my fragment. public class DetailActivity extends FragmentActivity { @Override protected void onCreate(Bundle savedInstanceState) { super.onCreate(savedInstanceState); setContentView(R.layout.activity_detail); Intent intent = getIntent(); Bundle bundle = new Bundle(); bundle.putParcelable("match", intent.getParcelableExtra("match")); DetailFragment fragment = new DetailFragment(); fragment.setArguments(bundle); if (savedInstanceState == null) { getSupportFragmentManager().beginTransaction() .add(R.id.container, fragment, "test") .commit(); } } } And my fragment looks like this. public class DetailFragment extends Fragment { @Override public View onCreateView(LayoutInflater inflater, ViewGroup container, Bundle savedInstanceState) { context = getActivity().getApplicationContext(); mh = getArguments().getParcelable("match"); int id = context.getResources().getIdentifier( "c" + String.valueOf(mh.getChampionImage()), "drawable", context.getPackageName() ); } @Override public void onStart() { super.onStart(); if (Utility.hasNetworkConnection(context)) { FetchIcons fetchIcons = new FetchIcons(); fetchIcons.execute(mh); } } ...//Some Code My test looks like this. public class DetailFragmentTest extends ActivityUnitTestCase<DetailActivity> { DetailActivity activity; DetailFragment fragment; public DetailFragmentTest() { super(DetailActivity.class); } @Override protected void setUp() throws Exception { super.setUp(); Intent intent = new Intent(new MockContext(), DetailActivity.class); int[] i = {1, 2, 3, 4, 5, 6, 7}; MatchHistory mh = new MatchHistory("Win", "23", "42", "31", "23414", "321", 22, true, i); intent.putExtra("match", mh); startActivity(intent, null, null); activity = getActivity(); fragment = (DetailFragment) activity.getSupportFragmentManager().findFragmentByTag("test"); } public void testText() { ...//Some more code } } Everything up to the part where i'm trying to receive the framgent works fine, but gives me NullPointerException as soon as i try to fetch it. And my stacktrace doesn't shed much light on the problem. java.lang.NullPointerException at com.plushogskolan.chobi.matchhistory.DetailFragmentTest.setUp(DetailFragmentTest.java:34) at org.junit.internal.runners.JUnit38ClassRunner.run(JUnit38ClassRunner.java:86) at org.junit.runner.JUnitCore.run(JUnitCore.java:137) at com.intellij.junit4.JUnit4IdeaTestRunner.startRunnerWithArgs(JUnit4IdeaTestRunner.java:74) at com.intellij.rt.execution.junit.JUnitStarter.prepareStreamsAndStart(JUnitStarter.java:211) at com.intellij.rt.execution.junit.JUnitStarter.main(JUnitStarter.java:67) at sun.reflect.NativeMethodAccessorImpl.invoke0(Native Method) at sun.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62) at com.intellij.rt.execution.application.AppMain.main(AppMain.java:134) Been trying to solve it using several different methods, including just the ActivityInstrumentationTestCase2, but then i can't even get the Activity. I'm clearly doing something wrong. But since not a single tutorial for unit testing in android have yielded any luck i can at least give it a shot here and see if anyone knows what the problem is. Regards!
|
What are Null Pointer Exceptions (java.lang.NullPointerException) and what causes them? What methods/tools can be used to determine the cause so that you stop the exception from causing the program to terminate prematurely?
|
When I take the 5 root of a big number, js gives me a wrong answer var pow = 5; var A = 133; var B = 110; var C = 84; var D = 27; var E; E = Math.pow((Math.pow(A, pow) + Math.pow(B, pow) + Math.pow(C, pow) + Math.pow(D, pow)), 1/pow); console.log(E) This should give 144 but gives 144.00000000000003 5 root of 61917364224 = 144
|
Consider the following code: 0.1 + 0.2 == 0.3 -> false 0.1 + 0.2 -> 0.30000000000000004 Why do these inaccuracies happen?
|
Prove that if $\left\{ x_n \right\}$ is an infinite sequence of real numbers, $x \in \mathbb{R}$, and every subsequence $\left\{ x_{n_k} \right\}$ has a subsequence $\left\{ x_{n_{k_j}} \right\}$ with $x_{n_{k_j}} \rightarrow x$, then $x_n \rightarrow x$. I know that if every subsequence of a sequence converges to the same number, then the sequence converges to that same number. But I don't know if the same can be applied to subsubsequences. So for this problem, can I safely state that because $x_{n_{k_j}} \rightarrow x$, it is also true that $x_{n_k} \rightarrow x$? If this is true, then does that mean every subsequence $\left\{ x_{n_k} \right\}$ also converges to $x$?
|
Is the following true? Let $x_n$ be a sequence with the following property: Every subsequence of $x_n$ has a further subsequence which converges to $x$. Then the sequence $x_n$ converges to $x$. I guess that it is true but I am not sure how to prove this.
|
First post, version 2.77 - I'll just apologize now. I have a simple scene with a cube and a camera. I rendered it as shown below. How do I either close this/these rendering windows, or return to the main scene window to change things? Thanks, Joe
|
I accidentally opened too many menus (or windows) and I want to reset them to default. It is really annoying, and effecting my animation. Thanks
|
How do I write a loop like this in Ruby? hashTable = [node(None, -1, None, None, -1) for i in range(0, tableLength)] I already tried the following: hash_table = [table_length.times do |x| x = NODE.new(@key, @val, @next, @prev, @pos) x end] Where I'm passing the values for @key, @val... when I'm calling the class, as follows: this = NODE.new(nil, -1, nil, nil, -1) this.read_file("alice.txt") But it's not working.
|
To do the equivalent of Python list comprehensions, I'm doing the following: some_array.select{|x| x % 2 == 0 }.collect{|x| x * 3} Is there a better way to do this...perhaps with one method call?
|
In Herstein, the defination of isomorphism is a homomorphism which is one-one and the definition of isomorphic is that it's the onto isomorphism (i am sure it's not a printing mistake because he used this consistently) but some other sources on net show that isomorphism is a bijective homomorphism? So which definition is true?
|
ProofWiki as a bijective homomorphism. In Topics in Algebra 2$\varepsilon$, Herstein defines a group isomorphism as an injective homomorphism: Definition. A homomorphism $\phi$ from $G$ into $\bar{G}$ is said to be an isomorphism if $\phi$ is one-to-one. Herstein does not define a homomorphism to be surjective, so the definition on ProofWiki and the definition in Topics in Algebra 2$\varepsilon$ contradict. Which definition is standard?
|
How to find a polynomial with integer coefficients and a root $\sqrt[3]{2} + \sqrt{5}$? The degree of this polynomial can't be more than 7.
|
Prove that $\sqrt[3]{2} +\sqrt{5}$ is algebraic over $\mathbb{Q}$ (by finding a nonzero polynomial $p(x)$ with coefficients in $\mathbb{Q}$ which has $\sqrt[3] 2+\sqrt 5$ as a root). I first tried letting $a=\sqrt[3]{2} +\sqrt{5}$ and then square both sides. But I keep on going into a loop by continuing to square it over and over again. Then I tried $a^3=(\sqrt[3]{2} +\sqrt{5})^3$. Just can't seem to get rid of the radicals.
|
I am following a tutorial on youtube online and I noticed that the teacher used ' before a value. like this: (defvar *randomStuff* 'stuff) all help will be appreciated
|
After making it through the major parts of an introductory Lisp book, I still couldn't understand what the special operator (quote) (or equivalent ') function does, yet this has been all over Lisp code that I've seen. What does it do?
|
Consider the following background information: I have a sphere that equally divided in to two hemisphere P and S. There is a plane that separate two different zone. Upper zone called A and lower zone called B. The angle $\alpha$ defined where the sphere is touching the intersection plane. So $\alpha$ larger means sphere is more in zone A and vice versa. The angle $\beta$ defines the orientation of the sphere. Schematic representation of this is below. To calculate the area of $P$ portion of the sphere into $A$ is given by following equation $$ \mathrm{Area}_{P-A}= r^2\int_{\theta=\frac{\pi}{2}-\beta}^\alpha \int_{\phi=\arcsin(1/(\tan\theta \tan \beta))} ^{\pi -\arcsin(1/(\tan\theta \tan \beta)} \sin\theta\; d\theta d\phi. $$ After solving this equation we can get the following solution. $$ \textrm{Area}_{P-A}= 2 r^2 \left\{ \cos (\alpha) \sin ^{-1}(\cot (\alpha) \cot (\beta)) -\tan ^{-1}\left(\frac{\cos (\beta)}{\sqrt{\sin ^2(\beta)-\cos ^2(\alpha)}}\right)\right\}+\pi r^2 (1-\cos (\alpha)). $$ Note that the solution is defined as a function of $\alpha$ and $\beta$. If we change the value of $\alpha $ and $\beta$, the area of P into A will change eventually. Now consider more complex case where $P$ and $S$ are not equal hemisphere. Question: If $P$ and $S$ are not equal, then what should I consider if I want to calculate the area of $P$ into $A$ as a function of $\alpha$ , $\theta$ and $\beta$? Here $\theta$ defines the distance of the cap edge from center. Note: I have seen this question: where it solves for two spherical cap separate each other by an angle and calculate the area of their intersection. In my problem, I would like to calculate the area of one spherical cap when it cross a fixed intersection. I am looking for an analytical solution like the top one so that I can be able to calculate area when sphere going up and down and it rotate.
|
Given a sphere of radius $r$ with two spherical caps on it defined by the radii ($a_1$ and $a_2$) of the bases of the spherical caps, given a separation of the two spherical caps by angle $\theta$, how do you calculate the surface area of that intersection? To clarify, the area is that of the curved surface on the sphere defined by the intersection. At the extreme where both $a_1,a_2 = r$, we would be describing a spherical lune. Alternatively define the spherical caps by the angles $\Phi_1 = \arcsin(a_1/r)$ and $\Phi_2 = \arcsin(a_2/r)$.
|
I uninstalled Ubuntu from Windows 7 in stupidest way. I deleted the partition memory of Ubuntu from Windows. When i restarted my system it stuck into "grub rescue". how to solve this problem.? any advice. all my work are stuck into windows and i can't do anything now. pls help me.! I'm new to Ubuntu and I don't know how it works. I don't want Ubuntu in my system.
|
I had Windows 7 and Ubuntu installed on the same partition Some time later, decided to uninstall Ubuntu.So I booted Ubuntu,Changed the hd related to it to NTFS,I did NOT extended my main drive restarted-> GRUB rescue>. No surprise since I had just wiped out the whole GRUB directory staff Now I just want to boot into my windows.Move my necessary files to an external memory and reinstall the windows seven What I have in my hands: Ubuntu live CD, A copy of win7 DVD I tried to make use of the win7 DVD(I had lost my DVD) to fix the mbr but the problem is when I choose repair, It says that this version of Windows is incompatible with yours What should I do?
|
I'm creating a wizardry plugin for Minecraft, and I was wondering how you would get the entity that a player was looking at, I know that you would have to use a Vector, but I really am not familiar with them. Pretty much what I'm looking for is something like this: public void entityLookingAt(Player p){ if(p.EntityLookingAt() instanceof Player){ p.sendMessage("You're looking at a player!"); } }
|
I am currently making a mod for Minecraft but I have come to a stop because I am lacking in some knowledge. I need to get data for the entity I am looking at, which I believe requires the use vectors, something I don't really know how to use. How would I achieve this? Some stuff that I think could help are mc.thePlayer.getLookVector() which returns the normalized vector of the user and mc.theWorld.loadedEntityList, which is a List with all the loaded currently loaded entities.
|
(a) Show that there must exist $x,y \in [0,1] $ satisfying $|x-y| = \frac{1} {2}$ and $f(x) = f(y)$ I can start by defining a function $g(x) = f(x + \frac{1} {2}) - f(x)$ to guarantee an $x,y$ so that $|x-y| = \frac{1} {2}$ But how do I show that $f(x) = f(y)$? (b) Show that for each $n \in \mathbb{N}$ $\exists x_n ,y_n \in [0,1]$ with $|x_n - y_n| = \frac{1} {n}$, and $f(x_n) = f(y_n)$ Actually I'm not sure where to start here. Any help is greatly appreciated. Thanks!
|
Let $f \in C[0,1]$ and $f(0)=f(1)$. How do we prove $\exists a \in [0,1/2]$ such that $f(a)=f(a+1/2)$? In fact, for every positive integer $n$, there is some $a$, such that $f(a) = f(a+\frac{1}{n})$. For any other non-zero real $r$ (i.e not of the form $\frac{1}{n}$), there is a continuous function $f \in C[0,1]$, such that $f(0) = f(1)$ and $f(a) \neq f(a+r)$ for any $a$. This is called the Universal Chord Theorem and is due to Paul Levy. Note: the accepted answer answers only the first question, so please read the other answers too, and also this answer by Arturo to a different question: This is being repurposed in an effort to cut down on duplicates, see here: . and here: .
|
I'm trying to setup a ListView using ArrayList but when I run the app I face with the error Unfortunately, app has stopped. Here is the error in android monitor: Caused by: java.lang.NullPointerException: Attempt to invoke virtual method 'void android.widget.ListView.setAdapter(android.widget.ListAdapter)' on a null object reference at com.example.nfp.weather_g.MainActivity.onCreate(MainActivity.java:35) and this is my code: package com.example.nfp.weather_g; import android.os.Bundle; import android.support.v7.app.AppCompatActivity; import android.widget.ArrayAdapter; import android.widget.ListView; import java.util.ArrayList; import java.util.List; public class MainActivity extends AppCompatActivity { @Override protected void onCreate(Bundle savedInstanceState) { super.onCreate(savedInstanceState); setContentView(R.layout.activity_main); List<String> forecast = new ArrayList<>(); forecast.add("Today - Sunny - 88/63"); forecast.add("Tomorrow - Foggy - 70/40"); forecast.add("Weds - Cloudy - 72/63"); forecast.add("Thurs - Asteroids - 75/65"); forecast.add("Fri - Heavy Rain - 65/56"); forecast.add("Sat - HELP TRAPPED IN WEATHERSTATION - 60/51"); forecast.add("Sun - Sunny - 80/68"); ArrayAdapter<String> arrayAdapter = new ArrayAdapter( getApplication(), android.R.layout.simple_list_item_1, forecast ); ListView listView = (ListView) findViewById(android.R.id.list); listView.setAdapter(arrayAdapter);}} Also the ListView id is list How should I fix it?
|
What are Null Pointer Exceptions (java.lang.NullPointerException) and what causes them? What methods/tools can be used to determine the cause so that you stop the exception from causing the program to terminate prematurely?
|
I have a query that will currently return multiple records because the date is slightly different amongst them. I would like to return the record with earliest date per ID. Example output: ID AMOUNT DATE 1 10 1 1 20 2 1 30 3 1 1 4 2 34 1 2 234 2 2 234 3 2 34 4 3 3 1 3 3 2 3 23 3 3 20 4 Desired output: ID AMOUNT DATE 1 10 1 2 34 1 3 3 1 Here is my current query: SELECT DISTINCT th.somefield21 as field21, th.somefield18 AS field18, th.somefield17 AS field17, (c.somefield19 || ' ' || c.somefield20) AS field19, CASE when th.somefield15 = 'TEST' then (b.apple || ' ' || b.bananna || ' ' || b.peach || ' ' || b.plum || ' ' || b.grape) else a.somefield16 END AS field16, a.somefield1 AS field1, a.somefield2 AS field2, a.somefield3 AS field3, th.somefield4 AS field4, s.somefield5 AS field5, th.somefield6 AS field6, th.somefield7 AS field7, th.somefield8 AS field8, s.somefield9 AS field9, s.somefield10 AS field10, s.somefield11 AS field11, s.somefield12 AS field12, s.somefield13 AS field13, th.somefield14 AS field14 FROM schema.therm th, schema.charlie c, schema.faux f, schema.alpha a, schema.bravo b, schma.sierra s, schema.delta d, schema.golf g, schema.echo e, schema.foxtrot ft WHERE ft.act='submit' AND ft.tid = th.tid AND ft.aid = c.aid AND c.cid = f.cid AND f.addid = a.addid AND f.addid = b.addid AND th.tid = d.tid AND ft.aid = e.aid AND e.dsrid = g.dsrid AND g.dsprid = s.dsprid AND th.ttype = 'c1' AND f.add = 'wookie' AND th.date between to_date('01/01/2001 00:00:00','MM/DD/YYYY HH24:MI:SS') and to_date('10/01/2019 23:59:59','MM/DD/YYYY HH24:MI:SS') AND s.code = 'han' AND th.state != 'darth' AND d.act NOT IN ('peach','pear','cherry','plum') ORDER BY th.field21; Which results in multiple records for entries with the same ID. I tried adding min(th.somefield18 AS field18,) but that resulted in ORA-00937: not a single-group group function 00937. 00000 - "not a single-group group function". When I attempt to add GROUP BY field19 it results in ORA-00979: not a GROUP BY expression 00979. 00000 - "not a GROUP BY expression"
|
Table: UserId, Value, Date. I want to get the UserId, Value for the max(Date) for each UserId. That is, the Value for each UserId that has the latest date. Is there a way to do this simply in SQL? (Preferably Oracle) Update: Apologies for any ambiguity: I need to get ALL the UserIds. But for each UserId, only that row where that user has the latest date.
|
What I have so far: 11 inches = 0.916667 feet Let a represent θ tan a = 0.916667 / 87 = 0.010536402 tan^-1(0.010536402) = 0.6036... rounded to 0.6 degrees. Is this correct?
|
In curling, it is often necessary to hit and displace an opponent’s stone to win the end. Olivia would like to hit her opponent’s stone with her own stone. If she releases her stone at the hog line, it needs to travel another 87 feet before reaching her opponent’s stone. Olivia can be off by 11 inches in either direction and still hit her opponent’s stone. Assuming her stone doesn’t curl (change direction), within what angle, $\theta$, to the nearest tenth, must Olivia throw her stone to hit her opponent’s stone? With this question, do you need to convert the 11 inches to feet, and then solve from there? And since both triangles are the same, do you only solve for one? $11$ inches = $0.916667$ Feet $\tan (a) = a / b$ $\tan (a) = 0.916667 / 87$ $a = \arctan (0.105364022989)$ $a = 0.6037^\circ$
|
I have a macbook (running MacOS Catalina) connected to a HP 3005pr 3.0 Port Replicator. This port replicator has a internal USB disk, I want to format this disk but am not able because it is Read-Only (see the diskutil below): /dev/disk2 (external, physical): #: TYPE NAME SIZE. IDENTIFIER 0: FDisk_partition_scheme *126.4 MB disk2 1: Windows_FAT_16 HP Dock 126.3 MB disk2s1 When I type in 'diskutil info /dev/disk2s1' I get this info: Device Identifier: disk2s1 Device Node: /dev/disk2s1 Whole: No Part of Whole: disk2 Volume Name: HP Dock Mounted: No Partition Type: Windows_FAT_16 File System Personality: MS-DOS FAT16 Type (Bundle): msdos Name (User Visible): MS-DOS (FAT16) OS Can Be Installed: No Media Type: Generic Protocol: USB SMART Status: Not Supported Volume UUID: 6BD6C793-C86B-34D2-9BBC-1ACBD79E8FA0 Partition Offset: 32256 Bytes (63 512-Byte-Device-Blocks) Disk Size: 126.3 MB (126321152 Bytes) (exactly 246721 512-Byte-Units) Device Block Size: 512 Bytes Volume Total Space: 0 B (0 Bytes) (exactly 0 512-Byte-Units) Volume Free Space: 0 B (0 Bytes) (exactly 0 512-Byte-Units) Read-Only Media: Yes Read-Only Volume: Not applicable (not mounted) Device Location: External Removable Media: Removable Media Removal: Software-Activated Solid State: Info not available When i try to format this disk whit the command 'diskutil eraseDisk FAT32 HP-USB /dev/disk2' Started erase on disk2 Unmounting disk Creating the partition map Error: -69877: Couldn't open device Any ideas howto switch off the Read-Only setting and format this disk?
|
Disk Utility (macOS Catalina 10.15.2) fails to erase my USB drive (64GB key, currently formatted in exFAT). /dev/disk2 (external, physical): #: TYPE NAME SIZE IDENTIFIER 0: GUID_partition_scheme *64.1 GB disk2 1: EFI EFI 209.7 MB disk2s1 2: Microsoft Basic Data Lexar 63.9 GB disk2s2 I've tried a bunch of commands that I've found here and there in the terminal, but none of them worked, like: ➜ ~ diskutil eraseVolume exFAT MyName /dev/disk2 Started erase on disk2 Unmounting disk Error: -69888: Couldn't unmount disk ➜ ~ diskutil eraseVolume exFAT MyName /dev/disk2s2 Started erase on disk2s2 Lexar Unmounting disk Erasing Error: -69760: Unable to write to the last block of the device ➜ ~ diskutil eraseDisk FAT32 MYSD MBRFormat /dev/disk2 Started erase on disk2 Unmounting disk Creating the partition map Error: -69877: Couldn't open device ➜ ~ diskutil eraseDisk free EMPTY /dev/disk2 Started erase on disk2 Unmounting disk Creating the partition map Error: -69877: Couldn't open device My USB drive appears as read only when i do CMD+I, I tried repairing the permissions but that failed too. ➜ ~ diskutil resetUserPermissions /dev/disk2 `id -u` Ready to reset user permissions on disk2 Error encountered attempting to reset permissions for user 501 home directory on disk2: Permissions are not enabled on the disk (-69861) Thx in advance for the help :)
|
USER_DEV="abcd" ENV="DEV" Requirement: to print the actual value abcd by substituting 2 variables as below? echo $(USER_$ENV) should return abcd. I get error as below: USER_ENV: command not found Please suggest.
|
I am getting a "bad substitution" error while running this code. I want to print the values in h_1, h_2, h_3with a for loop. #/!/bin/bash h_1=12 h_2=13 h_3=14 for ((i=1; i<=2; i++)) do echo "${h_$i}" done
|
I need to Root Samsung Galaxy S 2, GT-I9100, with XXKI4 I need to Root it with Room Android 2.3.5 or any version within 2.3.X while searching I just found Android versions above this version all with 4.XX?? Any suggestion for Android version 2.3.X ??
|
I have a Galaxy S2 with NFC (GT-I9100P) and I wish to have root access to properly administrate my phone. I've been looking at various forum posts on different sites and I've just been getting more and more confused as to what I need to do. From what I understand, I need to flash an unsecure kernel to the phone (with ODIN) to get root access, then I can flash the stock firmware back onto the phone and retain root access. Is this correct? Further information: My baseband version is I9100PBVLP7 kernel version: 3.0.15-I9100PBVLPA-CL364024dpi@DELL169 #3 and my operator is Orange UK. I've managed to obtain the firmware version that is on my phone already through sammobile.com, I just have no idea what I need to do next. Reward If anyone can help me to get root access on my stock firmware I will give them as much bounty as I can when the question is eligible for it.
|
I have a 4x3 matrix and want to determine if the columns of my matrix are linearly independent. Is there a way to form a square matrix (4x4) in order get the ability to calculate the determinant and see if they are linearly independent?
|
We can easily find out if the vectors are dependent or not by finding determinant of matrices formed from the vectors. But if the matrix is not a square matrix, we cannot find the determinant. Then how do we know if the vectors are linearly independent?
|
I'm trying to load data from firebase here is how i load the data mUser = new ArrayList<>(); reference1 = FirebaseDatabase.getInstance().getReference("USERS"); reference1.addValueEventListener(new ValueEventListener() { @Override public void onDataChange(@NonNull DataSnapshot dataSnapshot) { mUser.clear(); for (DataSnapshot snapshot :dataSnapshot.getChildren()){ User user = snapshot.getValue(User.class); for (ChatList chatList : userList){ if (user.getId().equals(chatList.getId())){ mUser.add(user); } } } adapter = new ChatAdapter(getContext(),mUser); recyclerViewchat.setAdapter(adapter); } but i got this error when I try to run it, I get ConcurrentModificationException, can anyone explain why it happens, even if the code is running in same thread? And how could I avoid it? 10-05 16:24:14.521 24692-24692/com.example.sy.infosys_ips E/AndroidRuntime: FATAL EXCEPTION: main Process: com.example.sy.infosys_ips, PID: 24692 java.util.ConcurrentModificationException at java.util.ArrayList$ArrayListIterator.next(ArrayList.java:573) at com.example.sy.infosys_ips.Chat.ChatFragment$2.onDataChange(ChatFragment.java:102) at com.google.android.gms.internal.firebase_database.zzfc.zza(Unknown Source) at com.google.android.gms.internal.firebase_database.zzgx.zzdr(Unknown Source) at com.google.android.gms.internal.firebase_database.zzhd.run(Unknown Source) at android.os.Handler.handleCallback(Handler.java:739) at android.os.Handler.dispatchMessage(Handler.java:95) at android.os.Looper.loop(Looper.java:148) at android.app.ActivityThread.main(ActivityThread.java:7325) at java.lang.reflect.Method.invoke(Native Method) at com.android.internal.os.ZygoteInit$MethodAndArgsCaller.run(ZygoteInit.java:1230) at com.android.internal.os.ZygoteInit.main(ZygoteInit.java:1120)
|
We all know you can't do the following because of ConcurrentModificationException: for (Object i : l) { if (condition(i)) { l.remove(i); } } But this apparently works sometimes, but not always. Here's some specific code: public static void main(String[] args) { Collection<Integer> l = new ArrayList<>(); for (int i = 0; i < 10; ++i) { l.add(4); l.add(5); l.add(6); } for (int i : l) { if (i == 5) { l.remove(i); } } System.out.println(l); } This, of course, results in: Exception in thread "main" java.util.ConcurrentModificationException Even though multiple threads aren't doing it. Anyway. What's the best solution to this problem? How can I remove an item from the collection in a loop without throwing this exception? I'm also using an arbitrary Collection here, not necessarily an ArrayList, so you can't rely on get.
|
Let $A\in \mathbb R^{n\times n}$ have a right inverse $B\in \mathbb R^{n\times n}$, i.e. $AB=E_{n\times n}$. Is it possible to see only using the definition of the matrix product that $BA=E_{n\times n}$? Please do not tell me anything about the rank or endomorphisms of finite-dimensional vector spaces or even the Gauss algorithm. Only the definition of $[AB]_{j,\ell} = \sum\limits_{k=1}^n a_{j,k} b_{k,\ell}$ (which, by assumption is $1$ for $j=\ell$ and $0$ else) is allowed.
|
If $A$ and $B$ are square matrices such that $AB = I$, where $I$ is the identity matrix, show that $BA = I$. I do not understand anything more than the following. Elementary row operations. Linear dependence. Row reduced forms and their relations with the original matrix. If the entries of the matrix are not from a mathematical structure which supports commutativity, what can we say about this problem? P.S.: Please avoid using the transpose and/or inverse of a matrix.
|
I have GIS points (x, y data) for every minute over a landscape. If I load them up as a CSV into QGIS they all show up as points, which you would expect. However, what I would like to do is use these points to create a grid. In other words, each point is a corner of a 1x1 minute grid. How can I do this?
|
I'm a beginner QGIS user and am struggling with creating a grid. I've used the MMQGIS geometry import function to import data from the CSV file shown below but they pop up as points on QGIS. I want to make it into a grid so that I can pretty much have each of the points be in a box format. I've also tried to use the join function but am not sure what variable both the grid and the points have so that I can join them.
|
I am trying to create a video file(can be any format) from an image file(also any format) and a mp3 audio file. I found that we can use ffmpeg and tried the answers : The following produces a video ffmpeg -i ep1.png -i ep1.wav ep1.flv But the video is not right, the video player crashes and the video cannot be uploaded to youtube because youtube also cannot process it. The following gives an error: ffmpeg -i still.png -i narrate.wav -acodec libvo_aacenc -vcodec libx264 final.flv The error being Unknown encoder 'libvo_aacenc' I tried all other methods in answers to question each giving a different error. I am using Ubuntu 18.04 in XOrg mode. I have ffmpeg encoders. How can I achieve this in Ubuntu 18.04? Note: This is in Ubuntu 18.04. Other answers as in are not working and I am not trying to compress the video. I only need to be able to create a video
|
I'm using ffmpeg to add a JPG to an MP4 to make an MP4. As there is only one image to make the video I'm wondering if there is a way to reduce the video size? Command: $ ffmpeg -loop 1 -i image.jpg -i audio.mp3 -shortest -c:a copy output.mp4 Results: image.jpg = 26.7K (image not so clear) audio.mp3 = 64.6M (54 minutes) output.mp4 = 80.6M (video result is not so clear, music still good) Is it a reasonable size for MP4?
|
I have a list of textfile such as below example: username1 username2 username3 I want a regex that can make it like following example: username1:username1 username2:username2 username3:username3 etc.. I've tried many regex with failed attempts. hopefully somebody can help me.. thank you in advance. regards.
|
I don't really understand regular expressions. Can you explain them to me in an easy-to-follow manner? If there are any online tools or books, could you also link to them?
|
A conductor is defined as it has free electrons to move, but when non conductor attain charge, it would also have free electrons. so it should behave like a conductor or not?
|
So I was recently wondering what happens to the excess charge when it is placed on an insulator or conductor e.g. rubbing two objects together. I know in the conductor the electrons are free to move whereas in the insulator they in general are not very mobile so the charge stays in a small region. But why does this happen? I know about the differences in insulator and conductor band structure, how is this related? Do the excess electrons become part of the band structure? Thanks!
|
This bug affects both the tablet and phone app. The last item in the reorder list section becomes the second item in the left-swipe list. Here are images showing the issue. Reorder screen shows desirable order of subs which is correct (Notice user-experience is at the bottom): Nexus 7 (2013) & S4 Mini: Now this is the sidebar with the bug (notice user-experience is now second in the left-swipe list even though it has been set to be at the bottom): Nexus 7 (2013) & S4 Mini: Bug reproduction: Moving any sub to the bottom in the reorder screen results in that sub being second in the left-swipe list. Bug occurs on both Nexus 7 (2013) tablet & Samsung S4 Mini phone.
|
In the Android app, left sidebar, there is an editable list of "Your Sites". In the editing pane, the sites are re-orderable (although awkwardly), and the order one places the sites in there is preserved, even after quitting the app and returning to this pane. One expects that order to be reflected in the "Your Sites" portion of the left sidebar when the editing pane is closed, but it is not. I'm not sure what is determining the order of the sites in the left sidebar, it doesn't seem to be by date they were "pinned" into the list one wants to show, either.
|
I just try to move completely from Windows to Ubuntu. I am a web designer and developer, the development part is awesome in Ubuntu but I am missing the design part. What I used to work with is Adobe Photoshop and Illustrator. Are there any good alternatives for Ubuntu available?
|
I have been moving toward Ubuntu from a long time Windows development background. The one program I cannot seem to do without is a graphic editor. I have seen recommendations for programs, but they turn out to be directed at children or tailored to working with personal photographs. I am looking for something more for programming tasks like analysing colors, resizing, creating web graphics, etc. I have used Photoshop in the past and more recently have mostly used Paint.net for Windows. Is there a program for Ubuntu that covers this area?
|
How to show this $$\sum_{k=0}^{n-1} [x+\frac{k}{n}]= [nx]$$ for every $x\in \mathbb{R}, n\in\mathbb{N}$. Where the function $[x] = \max\{p \in\mathbb{N}: p\leq x\}$ is the floor function?
|
I'm doing some exercises on Apostol's calculus, on the floor function. Now, he doesn't give an explicit definition of $[x]$, so I'm going with this one: DEFINITION Given $x\in \Bbb R$, the integer part of $x$ is the unique $z\in \Bbb Z$ such that $$z\leq x < z+1$$ and we denote it by $[x]$. Now he asks to prove some basic things about it, such as: if $n\in \Bbb Z$, then $[x+n]=[x]+n$ So I proved it like this: Let $z=[x+n]$ and $z'=[x]$. Then we have that $$z\leq x+n<z+1$$ $$z'\leq x<z'+1$$ Then $$z'+n\leq x+n<z'+n+1$$ But since $z'$ is an integer, so is $z'+n$. Since $z$ is unique, it must be that $z'+n=z$. However, this doesn't seem to get me anywhere to prove that $$\left[ {2x} \right] = \left[ x \right] + \left[ {x + \frac{1}{2}} \right]$$ in and in general that $$\left[ {nx} \right] = \sum\limits_{k = 0}^{n - 1} {\left[ {x + \frac{k}{n}} \right]} $$ Obviously one could do an informal proof thinking about "the carries", but that's not the idea, let alone how tedious it would be. Maybe there is some easier or clearer characterization of $[x]$ in terms of $x$ to work this out. Another property is $$[-x]=\begin{cases}-[x]\text{ ; if }x\in \Bbb Z \cr-[x]-1 \text{ ; otherwise}\end{cases}$$ I argue: if $x\in\Bbb Z$, it is clear $[x]=x$. Then $-[x]=-x$, and $-[x]\in \Bbb Z$ so $[-[x]]=-[x]=[-x]$. For the other, I guess one could say: $$n \leqslant x < n + 1 \Rightarrow - n - 1 < x \leqslant -n$$ and since $x$ is not an integer, this should be the same as $$ - n - 1 \leqslant -x < -n$$ $$ - n - 1 \leqslant -x < (-n-1)+1$$ So $[-x]=-[x]-1$
|
I want to typeset unicode symbols like ≥ (U+2265) and ∧ (U+2227) in the typewriter / tt / monospaced / non-proportional font of my document. I don't care how I have to enter these symbols in my .tex files. Entering ≥ or using a commando like \ge is both fine as long as I can do so inside \texttt and \begin{verbatim}. I know that I can enter unicode signs directly using \DeclareUnicodeCharacter{2265}{\ge}. However, the command \ge can only be used in math mode which changes the font. Therefore \texttt{$\ge$} is not a solution. Also, I have to use pdflatex so XeTeX or LuaLaTeX are not an option for me. Is there a way to output a ≥ in the current non-math font?
|
I have a listing to be used in verbatim (acutally Verbatim) that uses unicode characters such as ∀, ∃, →, ∨. Using \DeclareUnicodeCharacter{2203}{\ensuremath\exists} they do appear in the listing, but obviously in the wrong font. For → I got the desired result using \usepackage{textcomp} \DeclareUnicodeCharacter{2192}{\ifmmode\to\else\textrightarrow\fi} but I do not see how to do it for ∃, ∀ and ∨. MWE: \documentclass{article} \usepackage[T1]{fontenc} \usepackage[utf8]{inputenc} \usepackage{textcomp} \DeclareUnicodeCharacter{2192}{\ifmmode\to\else\textrightarrow\fi} \DeclareUnicodeCharacter{2203}{\ensuremath\exists} \begin{document} \begin{verbatim} Make this → ∃ look nice! \end{verbatim} \end{document} I’d like to stick to latex (i.e. not xetex). I would prefer to stick to the default type writer font (Computer Modern Typewriter), but if it only works with a different font (such as DejaVu Sans Mono), then that would be ok as well.
|
I am currently using the following code within single.php (after the_content) This gets the store_name from custom field as $merchant from the post and then returns a list of products from that merchant from and external script. <?php $merchant = get_field('store_name'); echo '<h3> Random products from ' . get_field('store_name') . '</h3>'; $external_baseHREF = "http://www.website.com/store/"; $external_path = "/home/website/public_html/store/"; $_GET["q"] = "merchant:".$merchant; require($external_path."searchExternal.php"); ?> This is working fine, however I cannot move the position of where the products are appearing, they currently appear after the main post. I would like to have them appearing further up the post, and one solution I have considered is adding them via a shortcode so I can position them as I like eg [merchant-name merchantname="Adidas"] or something similar Can you please assist in creating this shortcode? Or offering alternative solution. Thanks Richard
|
So I have the following code: <span class="delete"><a onclick="return confirm('Are you sure?');" href="<?php echo wp_nonce_url( add_query_arg( array( 'action' => 'my-delete-product', 'product_id' => $post->ID ), my_get_navigation_url('products') ), 'my-delete-product' ); ?>"><?php _e( '삭제', 'my' ); ?></a> | </span> It is a simple button. I want to make this into a shortcode so that I can use it anywhere where appropriate. Any suggestions? Thanks.
|
I am practicing calculus section of GRE Math Subject test, and I can't figure out a way to do the following integral: $$\int_0^\infty \frac{\cos (ax) - \cos (bx)}{x}dx.$$ I absolutely have no clue how to do this. Can someone show me the solution explicitly? Thank you.
|
How can I prove the Theorem of Frullani? I did not even know all the hypothesis that $f$ must satisfy, but I think that this are Let $\,f:\left[ {0,\infty } \right) \to \mathbb R$ be a a continuously differentiable function such that $$ \mathop {\lim }\limits_{x \to \infty } f\left( x \right) = 0, $$ and let $ a,b \in \left( {0,\infty } \right)$. Prove that $$ \int\limits_0^{\infty} {\frac{{f\left( {ax} \right) - f\left( {bx} \right)}} {x}}dx = f\left( 0 \right)\left[ {\ln \frac{b} {a}} \right] $$ If you know a more general version please give it to me )= I can´t prove it.
|
So i have 2 different arrays that should be the same (?) that are just declared in different ways and are named differently: public static int[][] box = new int[10][5]; public static int[][] testBox ={{0,0,0,0,0},{0,0,0,0,0},{0,0,0,0,0}, {0,0,0,0,0},{0,0,0,0,0},{0,0,0,0,0},{0,0,0,0,0},{0,0,0,0,0},{0,0,0,0,0}, {0,0,0,0,0}}; Now i have the followming Method: public static boolean putProductIntoBox(int[] product) { if ((getFreePositionToFit(product) != null) && (remainingWeight >= product[2])) { for (int i = getFreePositionToFit(product)[0];i-getFreePositionToFit(product)[0] < product[1]; i++) { 67 for (int j = getFreePositionToFit(product)[1]; j-getFreePositionToFit(product)[1] < product[0]; j++) { testBox/box[j][i] = product[3]; // <- testBox works , box not } } remainingWeight -= product[2]; return true; } else { return false; } } Now what really boggles me : I go into the method with a product[0] being 10 (length of the product) and product[1] being 5 (width of the product). Now look at line 4 of the method : If i run it with testBox[j][i] it works just fine If it run the method with box[j][i] i get a NullPointerException in line 67 (The other methods in putProductIntoBox work fine , tested them) Could someone tell me why that is and how i fix it ? Thanks
|
What are Null Pointer Exceptions (java.lang.NullPointerException) and what causes them? What methods/tools can be used to determine the cause so that you stop the exception from causing the program to terminate prematurely?
|
I installed Ubuntu 16 on a 8GB pendrive (Bootable Drive) and created two partitions for Ubuntu(Ext4 - 6000MB, Swap - 2000MB). I want to resize the partitions without re-installing the Ubuntu. Is there any possibility???
|
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 don't understand what I do wrong. I'd like to iterate list in jsp. (In class it's working) public static void main(String[] args) throws ClassNotFoundException { List<SprawdzanieCen> PaS = SprawdzanieCenLista.PS(); for (SprawdzanieCen ob : PaS ) { System.out.println("nrFaktury: "+ob.nrFaktury); } } But as I wrote I'd like to do it in jsp jsp code is as follows: <% out.println("Lets Start"); List<SprawdzanieCen> PaS = SprawdzanieCenLista.PS(); for (SprawdzanieCen s : PaS) { s.nrFaktury; } %> I do not understand why "nrFaktury" is underline on red. Hot to iterate this list. Help,
|
I just started learning JSP technology, and came across a wall. How do you output HTML from a method in <%! ... %> JSP declaration block? This doesn't work: <%! void someOutput() { out.println("Some Output"); } %> ... <% someOutput(); %> Server says there's no “out”. U: I do know how to rewrite code with this method returning a string, but is there a way to do this inside <%! void () { } %> ? Though it may be non-optimal, it's still interesting.
|
How do I prove that this limit does not exist? $$\lim_{x\rightarrow 0} \frac{e^{1/x} - 1}{e^{1/x} + 1} $$ My attempt: When you approach from from left towards zero , say i take -0.00000000000001 . i substitute in expression i get (-1) . But if i take 0.000000000001 and substitue i get (=1) (by applying L'Hop) . But if i dont do this and apply L'Hop straighaway i get 1 .
|
How do I prove that this limit does not exist? $$\lim_{x\rightarrow 0} \frac{e^{1/x} - 1}{e^{1/x} + 1} $$ My attempt: When you approach from from left towards zero , say i take -0.00000000000001 . i substitute in expression i get (-1) . But if i take 0.000000000001 and substitue i get (=1) (by applying L'Hop) . But if i dont do this and apply L'Hop straighaway i get 1 .
|
In the WP article about , there is an integral solved as: $$K(x,x';t)=\frac{1}{2\pi}\int_{-\infty}^{+\infty}dk\,e^{ik(x-x')} e^{-\frac{i\hbar k^2 t}{2m}}=\left(\frac{m}{2\pi i\hbar t}\right)^{\frac{1}{2}}e^{-\frac{m(x-x')^2}{2i\hbar t}}$$ I was trying to find out how to evaluate the integral, using the method of "completing the squares" at the exponential. But at the end, I came up with $\gamma\int_{-\infty}^{\infty}e^{i\alpha (z-\beta)^2}dz$, where $\gamma$, $\alpha$ and $\beta$ are constants. The answer of the WP can be reached if it is solved as a gaussian integral: $= \gamma \sqrt{\frac{\pi}{i\alpha}}$ But is it valid to use the formula of the gaussian integral for a complex constant? When I look at the main integral (of K), the exponentials are after all oscillating functions, that don't have necessarily to go to zero at infinity.
|
Although this question is going to seem completely trivial to anyone with any exposure to path integrals, I'm looking to answer this precisely and haven't been able to find any materials after looking for about 40 minutes, which leads me to believe that it makes sense to ask the question here. In particular I'm looking for an answer wherin any mathematical claims are phrased as precisely as possible, with detailed proofs either provided or referenced. Also my search for a solution has led me to think I'm actually looking for a good explenation of Wick rotation, which I can't really claim to understand in detail. Any good references about this would be very welcome as well. I'm looking to make sense of the following integral identity: $$\int_{-\infty}^{\infty} dx \ \exp\left(i\frac{a}{2}x^2+iJx\right)=\left(\frac{2\pi i}{a}\right)^{1/2}\exp\left(\frac{-iJ^2}{2a}\right), \qquad a,J\in\mathbb{R}$$ (and various other sources) say that "This result is valid as an integration in the complex plane as long as a has a positive imaginary part." Clearly the left hand side does not exist in Lebesgue sense for real $a, J$. An answer to the question "" claims: "it is convergent as a Riemann integral, thanks to some rather delicate cancellations. To make the integral well defined -- equivalently to see how these cancellations occur -- we need to supply some additional information. Wick rotation provides a way of doing this. You observe that the left hand side is analytic in t , and that the right hand side is well-defined if Im(t)<0. Then you can define the integral for real t by saying that it's analytic continued from complex t with negative imaginary part." I want to see the gory details and all known motivation for the validity of this procedure for the kinds of applications where such integrals occur. Suggestions such as "include an $i\epsilon$ in order to make it finite" seem arbitrary. In that case one would have to motivate that prescription from the very start, that is within the modeling procedure that ends up giving that integral expression (which is likely the correct way to approach this). I'm also not sure how to interpret the right hand side, since it involves the square root of an imaginary number, which should involve some choice of branch cut, which I have never seen specified in connection to this formula.
|
Recently I installed full Ubuntu 15.10 in my HP 15 Notebook with Windows 8.1 (before), all was fine, but it began to fail, when I'm watching a video in youtube or only use the note writer, the screen freezes and I can't do anything. I have to shut down from the switch, after the laptop turned on, the screen remains dark and can't do anything, I must return shut down the pc and switch on to make it work again. My processor is Intel(R) Pentium(R) CPU N3540 @ 2.16GHz,my baseboard is a Hewlett-Packard,Product Name: 2213,Version: 57.51, and the video card is Intel, in the terminal says Intel Atom Processor Z36xxx/Z37xxx Series Graphics & Display. Thank for your time community.
|
My system freezes completely at random, frequent intervals. I started to have the same problem in Ubuntu 14.04 but after recent upgrade to 16.04 there is no improvement, in fact it seems worse. When it happens, it's impossible to do anything. I've tried everything in this thread: but nothing works, I have to hard reset. I have read all the system logs and journalctl but there is never any information that could help diagnose the problem. This is a dual-boot system with Windows 10 and there's no problem there, so it's not defective hardware. My laptop has an Intel Bay Trail processor (Pentium N3540)
|
I need to optimize parameters of a Gaussian shaped function to best fit my data points using maximum likelihood. I first make an initial estimate for the parameters (mu, sigma and peak) and apply a gradient descent (fmincon in Matlab) algorithm to optimize these parameters. The cost function is the sum of the negative log values of probabilities of observing each data point given the model parameters and the model noise parameter. sum(-log( normpdf( Y - model( X, params) ,0,error_sigma) )); where, Y: observations normpdf : normal probability densitiy function. model: a function that takes the x values and parameters to be optimized params : parameters of the model error_sigma : noise of the data I optimize the model parameters and the noise parameter simultaneously to obtain highest -loglikelihood values. I am puzzled by obtaining negative likelihood values. I would have estimated that -log of probabilities should always evaluate in positive values. However, the matlab function normpdf, especially for small spread values, returns probability values which are bigger than 1. This is because the integral of the normpdf function does nearly never sums up to 1. Therefore I am thinking that I should be using the normal cumulative function for optimization, instead of normpdf in order to get valid loglikelihood values. However, the parameters never converges as good as the normpdf case, when I use normcdf. I hope I am clear.
|
On the , there is this line: $p(\mathrm{height}|\mathrm{male}) = 1.5789$ (A probability distribution over 1 is OK. It is the area under the bell curve that is equal to 1.) How can a value $>1$ be OK? I thought all probability values were expressed in the range $0 \leq p \leq 1$. Furthermore, given that it is possible to have such a value, how is that value obtained in the example shown on the page?
|
Say, if you're going to create a writers' group called The Writers Land (just made it up), will you add an apostrophe like this, "The Writers' Land"? It looks odd to me, but perhaps that's just me? Same with other things like an institution name: Would you say Writers Association or Writers' Association (when you're creating it)? Do readers prefer one or the other?
|
Although Children's books is what everybody says, I would like to understand why the genitive case is applied in such case. If I write books for children, children is an adjective here; not the owners of my book! The word "children" just defines or characterizes the type of books I write. Therefore, it's an adjective. So, I understand that genitive/possessive case ("I write children's book") is incorrect grammar. My question is: is the genitive case here really accepted as right? If I use "I write children books" (following the grammar principle) as as I say "I write pets books" (books about pets, and not possessions of pets) - would I be incorrect? Why?
|
Consider, there are two classes of data and we have learned the SVM parameters in terms Lagrange multipliers. There are many learning techniques to learn these parameters quadratic programming or sequential minimal optimization etc. The question is, once we have learned our classifier, can we update the parameters somehow, once we get a new unknown sample . We can easily pass the unknown sample through the classifier and get a result. But is there a way to learn something blindly from the sample? This is essential for our case: in our application the input to the classifier changes slowly over time. So we need to capture the slow changes somehow blindly. Is it possible? The list of answers from are related to how to train when you get a new sample. Kindly note in that case you know the label of the new sample, in other words the class of the new sample is known or using oracle. The question here refers to the case when the class of the sample is not known As such in my opinion this is not duplicate. This question may not have an answer though. The closet approach so far seen is active learning, however this not answer the original question of slow changing. To be more specific some active learning considers support vectors and weights as a metric to decide a label but here question is related to change of support vectors to cope with slow changes. Let me write other way, I am looking for active learning without knowing the label. All those references deal with how to choose a sample, the oracle or somebody would specify the class of the sample.
|
I'm using libsvm and I noticed that everytime I call svmtrain(), I create a new model and that there seems to be no option to put data in an existing model. Is this possible to do however? Am I just not seeing this aspect in libsvm?
|
I'm stuck on the following exercise from Herstein's "Topics in Algebra": "show that ($n$ is prime) $\Leftrightarrow ([a][b]=[0]\Rightarrow [a]=[b]=[0]) $ in $J_n$". for the rightward implication I have: $[a][b]=[ab]=[0]\Rightarrow n|ab\Rightarrow n|a$ or $n|b$ (or both) $\Rightarrow [a]=[0]$ or $[b]=[0]$ and I'm stuck on the leftward implication. Why do I get $[a]=[0]$ OR $[b]=[0]$ and not $[a]=[0]$ AND $[b]=[0]$ in the leftward implication? Where is it that I go wrong? I'd also appreciate any comment/hint about how to prove the remaining left implication.
|
Suppose $$ab \equiv 0 \pmod n$$ and that $a$ and $b$ are positive integers both less than $ n$. Does it follow that either $a | n$ or $b | n$? If it does follow, give a proof. If it doesn’t, then give an example. For this question is this a suitable answer: No it doesn't. $3$ and $4$ are both less than $6$. $$3 \times 4 \equiv 0 \pmod {6}$$ but $4 \not \mid 6$.
|
I have just installed ubuntu 14.04 and my wifi networks are not showing. I do not have the broadcom wifi driver in my settings and I've tried the mediatek wifi adapter, but I get "modprobe: ERROR: could not insert 'mt7630e': Required key not available" when i run the install command. Here are excerpts from when my wireless-info file ##### rfkill ############################ 0: asus-wlan: Wireless LAN Soft blocked: no Hard blocked: no 1: asus-bluetooth: Bluetooth Soft blocked: no Hard blocked: no ##### NetworkManager.state ############## [main] NetworkingEnabled=true WirelessEnabled=true WWANEnabled=true WimaxEnabled=true Please help!
|
This issue happens only on UEFI systems with enabled Secure Boot. When I try to install DKMS modules like VirtualBox, Nvidia, or Broadcom drivers, they do not install and I get Required key not available when I try to modprobe them. VirtualBox complains that vboxdrv is not loaded. Broadcom wl driver is shown in lspci -k as a kernel module but is not in use. sudo modprobe wl throws Required key not available. Also this issue may happen when I install some kernel modules from git sources. This issue may appear after a kernel update as disabled wireless adapter, black screen after a reboot, etc. How can I fix it?
|
If $A,B\in M(n,\mathbb{R})$ and there exists $P\in GL(n,\mathbb{C})$ such that $A=PBP^{-1}$, does that imply that there exists $Q\in GL(n,\mathbb{R})$ such that $A=QBQ^{-1}$?
|
As in the title: If two real (square) matrices are conjugated over $\mathbb{C}$, are they then also conjugated over $\mathbb{R}$?
|
I have a directory that have the r permission bit: dr-------- 3 robert robert 4096 2017-12-17 03:47 dir This directory have two files and one directory: file 1.txt file 2.txt subdir When I run the command ls dir (from the robert account), I get an error alongside the content of the directory: ls: cannot access dir/file 1.txt: Permission denied ls: cannot access dir/file 2.txt: Permission denied ls: cannot access dir/subdir: Permission denied file 1.txt file 2.txt subdir Why ls displayed an error even though it also displayed the content of the directory without any problem?
|
In my CMS, I noticed that directories need the executable bit (+x) set for the user to open them. Why is the execute permission required to read a directory, and how do directory permissions in Linux work?
|
For example, you have a sprite of mario with a size of 20px x 20px. This sprite however was made for a game resolution of 1000px x 1000px. What if you want to provide a different game resolution as an in-game option? You could offer to change the game resolution to 2000px x 2000px, but then Mario should be drawn again for this particular resolution. And if you offer many resolutions, this can be very much to draw and the amount of space the image files will take, are going to get too big. So, my question, what's the trick here?
|
Those games that are not fortunate enough to run on a locked platform spec, like handhelds, need to run across various resolution formats and aspect ratios. In a 3D game you might have a HUD or menu GUI based on raster graphics, and in a 2D game you might have a bunch of quads which are vessels for sprites. So my question is, how do you approach designing and operating content across various resolutions and aspect ratio? Let's assume you have a sprite character that is 300x400 pixels sprite and surrounded by a level made of tiles. On different resolutions/aspect ratios you'd see a different FOV altogether. Or if you have a HUD or a GUI menu, you'd want to keep some stuff at same positions and of same size relative to the screen. Yet, graphics source is raster bitmaps, not vector. Obviously, problem has been addressed numerous times. I'm interested to hear abut various approaches that worked for you so far. Do you keep an arbitrary dimension agnostic 'pixel' unit that you magically transform into needed dimensions via formula based on res and aspect ratio or other approaches? edit: So, conclusion is to enumerate your aspect ratios. Lowest combination of aspect:resolution is the one you design important stuff into. A safe area if you will. Same aspect ratios, but higher resolutions are simple scaling issues. Art content is designed for highest resolution. Larger aspect ratios simply show more of level/FOV with information presented which is not critical as is the one in safe area. .
|
I want to insert a figure into a column, which means a figure uses 0.5*paper width.And the paper are written in two columns. At the same time, I need to use \bicaption{}{},which is in bicaption package, to create two captions for one figure. \usepackage{caption} \usepackage{multicol} \usepackage{bicaption} \begin{document} xxxx...... \begin{multicols}{2} \begin{figure} \includegraphics{figure A} \end{figure} \end{multicols} \end{document} The problem is,in this case, the figure can not display in a pdf document. Note, I want to write a paper in one column at the title, and in two column at the text. The text begins at the title page. For example, Thank you very much!
|
While the paper are written in two columns,I want to insert a figure into a column, which means a figure uses 0.5*paper width. At the same time, I need to use \bicaption{}{},which is in bicaption package, to create two captions for one figure. \usepackage{caption} \usepackage{multicol} \usepackage{bicaption} \begin{document} xxxx...... \begin{multicols}{2} \begin{figure} \includegraphics{figure A} \end{figure} \end{multicols} \end{document} in this case, the figure can not display in a pdf document. Note, I want to write a paper in one column at the title, and in two column at the text. The text begins at the title page. For example, Thank you!
|
i have jar file which contains file with main method. I am running that main class with batch file (as some parameters are being set over there) I want to remote debug the program from eclipse. I am not getting how to proceed ?
|
I know there's some JAVA_OPTS to set to remotely debug a Java program. What are they and what do they mean ?
|
let's say there's two events, a and b both a and b are uniformly distributed and have a range of [100,400] a and b are independent i know that the probability that a=A is 1/300 and the probability that b=B is 1/300 but let's say also that c = b - a what's the probability distribution of c? like... what's the probability that c=C? how do i figure this out?
|
Let $X$ and $Y$ both be distributed between $[1,2]$, what is the distribution of $Z=X-Y$?
|
How can i find, does $\lim_{n\to\infty}\frac{\eta_n}{n}$ where $\eta_n$ has poisson distribution with $\lambda = n$ exists?
|
$X_{n}$ independent and $X_n \sim \mathcal{P}(n) $ meaning that $X_{n}$ has Poisson distributions with parameter $n$. What is the $\lim\limits_{n\to \infty} \frac{X_{n}}{n}$ almost surely ? I think we can write $X(n) \sim X(1)+X(1)+\cdots+X(1)$ where the sum is taken on independent identical distribution then use the law of large number. But I am not sure that is it correct or not. Can anyone give me some hints? Thank you in advance!
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.