body1
stringlengths 20
4.1k
| body2
stringlengths 23
4.09k
|
|---|---|
How can I add the character in the figure in a formula? I would like a yellow filled character, wider then \sqcup
|
I know what my symbol or character looks like, but I don't know what the command is or which math alphabet it came from. How do I go about finding this out?
|
I have two macbooks. I want them to be exact copies. They have different CPUs, RAM, but they have the exact same drives. I work on both of them. I never work on them simultaneously. Can I setup something that will update what is new on the one, to the other? I start doing something on macbook1, I want macbook2 to receive it via somekind of wireless connection. I have an Airport Extreme, I can setup FTPs and whatever. Both macs will have high speed internet almost all the time. I don't think DropBox is a solution. I have a lot of data and I don't want it on dropbox. CCC doesn't work bothways it has a source and a destination. Probably there is something with rsync, but is there an automated solution? OSX Server?
|
I actually have a Macbook Pro with Snow Leopard (I plan on upgrading to Lion). I may have to buy an Mac mini in order to have a full dual screen (external identical screens) layout (see my ). So I will work on a Mac Mini and a Macbook Pro, most of the time on the same LAN. How to get everything completely synchronised, as fast as possible? (I don't know if iCloud can) I am talking about every file/data on my computer: applications application preferences mails calendar iPhoto/aperture libraries lots of small files (web development...) files out of my account (apache server files, php/libraries) ... I don't want to manage 2 computers and do everything twice (installing something, configuring the system, etc...).
|
I seem to have unintentionally deleted almost everything from Ubuntu using apt-get remove libc6 libc6-dev Is there any chance I can get my files back (with Ubuntu) or will I have to reinstall Ubuntu?
|
I have removed the mentioned libraries. Then my system disconnected from NIS service and many packages are being removed. The problem is I am not even able to login in my system. When i restarted it is showing "low graphics mode error". I do not know what to do Please help me. I am a beginner to Ubuntu.
|
I flagged as very low quality on the grounds that it was an answer consisting only of links, and was notified: very low quality – 18 hours ago declined - a moderator reviewed your flag, but found no evidence to support it However, I now see that the answer has been "deleted by Robert Harvey♦ 12 hours ago" What did I get wrong here? I thought link-only answers were discouraged? Also, the fact that the answer was deleted, suggests that I did not get it wrong. It is getting somewhat confusing working out what to flag and what not to flag.
|
Related: (not a dupe, that's a feature request and was closed as a dupe of another one) (old) post does indeed say that Link-only answers can be flagged as NAA, but there are a lot of posts like which define Not An Answer is a way that it doesn't apply to link-only answers. Can we get some up-to-date consensus on this? That link only answers are not allowed is .
|
I've a similar question concern the Dutch Language, but I couldn't find any dutch forum which actually discusses the Dutch language (with actual quite a lot members), so I thought let's ask her. Yesterday I was asked I worked for < company name > or at < company name > . But what's the difference? Is it really that for a company means you can be hired to do something, and working at a company it really means you are working at and for that specific company? So let's say I'm a freelancer and I'm hired to work for Facebook, so I am actually working for facebook. But if you have a contract at Facebook and they pay your montly salary and so on, you are actual working at Facebook. Is this correct? And can somebody tell me the same rule counts for dutch as well?
|
If you are working as an employee at an organization, when you tell about it to others which usage would be more appropriate? I work for company. I work at company. Or are both usages correct?
|
So, low and behold, a legacy site we've been hosting for a client had a version of FCKEditor that allowed someone to upload the dreaded c99madshell exploit onto our web host. I'm not a big security buff -- frankly I'm just a dev currently responsible for S/A duties due to a loss of personnel. Accordingly, I'd love any help you server-faulters could provide in assessing the damage from the exploit. To give you a bit of information: The file was uploaded into a directory within the webroot, "/_img/fck_uploads/File/". The Apache user and group are restricted such that they can't log in and don't have permissions outside of the directory from which we serve sites. All the files had 770 permissions (user rwx, group rwx, other none) -- something I wanted to fix but was told to hold off on as it wasn't "high priority" (hopefully this changes that). So it seems the hackers could've easily executed the script. Now I wasn't able to actually locate c99madshell.php itself -- only a bunch of other HTML files containing russian text and a few .xl and .html files with inline PHP that were renditions of the madshell hack. Upon doing a bit of research, though, it looks like the hack destroys itself after execution -- great. Anyway, my initial assessment would be this: Not necessary to rebuild the entire host, as given the isolation of the apache user / group, they shouldn't have been able to get system level passwords. It is necessary to fix this vulnerability by restricting uploads to not have the execute permission, updating the FCKEditor version to correct the original exploit target, and add server-level configuration that denies execution of PHP script within the uploads directory. I should change the DB passwords for the app -- given the configuration file for the database connection lies within the web-root, the hacker most likely could've grabbed it and with it the DB password. Anyway, please provide any input you guys have regarding what I should tell the bossman. Obviously it'd be ideal to avoid rebuilding the whole host -- but if thats what we have to take to ensure we're not running a hacked machine, then thats what its going to take. I really appreciate your guys help. Also don't hesitate to ask for more information (I'd be happy to run commands / work with you guys to assess the damage). God damn hackers :(.
|
This is a about Server Security - Responding to Breach Events (Hacking) See Also: Canonical Version I suspect that one or more of my servers is compromised by a hacker, virus, or other mechanism: What are my first steps? When I arrive on site should I disconnect the server, preserve "evidence", are there other initial considerations? How do I go about getting services back online? How do I prevent the same thing from happening immediately again? Are there best practices or methodologies for learning from this incident? If I wanted to put a Incident Response Plan together, where would I start? Should this be part of my Disaster Recovery or Business Continuity Planning? Original Version 2011.01.02 - I'm on my way into work at 9.30 p.m. on a Sunday because our server has been compromised somehow and was resulting in a attack on our provider. The servers access to the Internet has been shut down which means over 5-600 of our clients sites are now down. Now this could be an FTP hack, or some weakness in code somewhere. I'm not sure till I get there. How can I track this down quickly? We're in for a whole lot of litigation if I don't get the server back up ASAP. Any help is appreciated. We are running Open SUSE 11.0. 2011.01.03 - Thanks to everyone for your help. Luckily I WASN'T the only person responsible for this server, just the nearest. We managed to resolve this problem, although it may not apply to many others in a different situation. I'll detail what we did. We unplugged the server from the net. It was performing (attempting to perform) a Denial Of Service attack on another server in Indonesia, and the guilty party was also based there. We firstly tried to identify where on the server this was coming from, considering we have over 500 sites on the server, we expected to be moonlighting for some time. However, with SSH access still, we ran a command to find all files edited or created in the time the attacks started. Luckily, the offending file was created over the winter holidays which meant that not many other files were created on the server at that time. We were then able to identify the offending file which was inside the uploaded images folder within a website. After a short cigarette break we concluded that, due to the files location, it must have been uploaded via a file upload facility that was inadequetly secured. After some googling, we found that there was a security vulnerability that allowed files to be uploaded, within the ZenCart admin panel, for a picture for a record company. (The section that it never really even used), posting this form just uploaded any file, it did not check the extension of the file, and didn't even check to see if the user was logged in. This meant that any files could be uploaded, including a PHP file for the attack. We secured the vulnerability with ZenCart on the infected site, and removed the offending files. The job was done, and I was home for 2 a.m. The Moral - Always apply security patches for ZenCart, or any other CMS system for that matter. As when security updates are released, the whole world is made aware of the vulnerability. - Always do backups, and backup your backups. - Employ or arrange for someone that will be there in times like these. To prevent anyone from relying on a panicy post on Server Fault.
|
As discussed , if you try to upvote a comment on a deleted answer, you get an error message: Comments on deleted answers cannot be upvoted Wouldn't it be better, though, if the upvote icon were simply not available in this case?
|
When you visit a question that you have asked or an answer you have given you can see on the left hand side of the screen buttons for up-voting and down-voting as well as the number of people of votes for the question. When one clicks up-vote, a message appears telling you that you can't vote on your own question. I'm just wondering why the up-vote and down-vote buttons are even visible if they cannot be used. When you hover over your own comments it doesn't give you voting buttons...so why should it do so on questions and answers that you own?
|
The lubuntu version I have is: $ lsb_release -a No LSB modules are available. Distributor ID: Ubuntu Description: Ubuntu 19.10 Release: 19.10 Codename: eoan When I try to install anything, I get these errors about sources: E: The repository 'http://security.ubuntu.com/ubuntu eoan-security Release' no longer has a Release file. N: Updating from such a repository can't be done securely, and is therefore disabled by default. N: See apt-secure(8) manpage for repository creation and user configuration details. Answers about this in other threads say to go into Software Sources and uncheck basically everything, and then only enable main. However, when I enable just main and close, it says: Your local copy of the software catalog is out of date. A new copy will be downloaded. So I hit Reload and it says pk-client-error-quark: E: The repository 'http://dk.archive.ubuntu.com/ubuntu eoan Release' does not have a Release file. W: Updating from such a repository can't be done securely, and is therefore disabled by default. W: See apt-secure(8) manpage for repository creation and user configuration details. (319) So now I am stuck. How can I install anything now? I understand that 19.10 is no longer supported. I would be happy to upgrade. However, I cannot seem to upgrade either. When I follow on upgrading, it says to run sudo apt update && sudo apt full-upgrade -y However, this encounters the same error about sources as above! How can I make any progress here? Edit: I have tried the solution in . This allows me to fetch a release file. However, I still remain fundamentally impeded. When I follow the instructions in that post to upgrade my distribution, I receive the following error: $ sudo do-release-upgrade Checking package manager Reading package lists... Done Building dependency tree Reading state information... Done Calculating the changes Calculating the changes Could not calculate the upgrade An unresolvable problem occurred while calculating the upgrade. If none of this applies, then please report this bug using the command 'ubuntu-bug ubuntu-release-upgrader-core' in a terminal. If you want to investigate this yourself the log files in '/var/log/dist-upgrade' will contain details about the upgrade. Specifically, look at 'main.log' and 'apt.log'. When I look at main.log I see: 2021-01-21 13:30:18,069 INFO Using config files '['./DistUpgrade.cfg']' 2021-01-21 13:30:18,069 INFO uname information: 'Linux andromeda 5.3.0-64-generic #58-Ubuntu SMP Fri Jul 10 19:33:51 UTC 2020 x86_64' 2021-01-21 13:30:18,296 INFO apt version: '1.9.4ubuntu0.1' 2021-01-21 13:30:18,296 INFO python version: '3.7.5 (default, Apr 19 2020, 20:18:17) [GCC 9.2.1 20191008]' 2021-01-21 13:30:18,298 INFO release-upgrader version '20.04.29' started 2021-01-21 13:30:18,307 INFO locale: 'en_DK' 'UTF-8' 2021-01-21 13:30:18,354 DEBUG screen returned: 'There is a screen on: 21705.ubuntu-release-upgrade-screen-window (2021-01-21 13:27:45) (Attached) 1 Socket in /run/screen/S-root. ' 2021-01-21 13:30:18,354 INFO found active screen session, re-attaching which appears unhelpful. There is no file apt.log.
|
Recently I have installed an older version of Ubuntu on my old machine. Whenever I try to install any software, I get an error saying it couldn't be found: $ sudo apt-get install vlc Reading package lists... Done Building dependency tree Reading state information... Done E: Couldn't find package vlc
|
This is a question from Section 3.2 of Wayne Patty's topology. Question :Prove that if A is countable subset of $\mathbb{R}^2$ , then $\mathbb{R}^2 - A$ is pathwise connected. The intution is very easy to get but I am not getting ideas on how should I define a continuous function f such that f(0)= a and f(1)=b for any a , b in $\mathbb{R}^2$. Kindly guide me with that.
|
Here's a question that I share: Show that if $D$ is a countable subset of $\mathbb R^2$ (provided with its usual topology) then $X=\mathbb R^2 \backslash D $ is arcwise connected.
|
after I updated my server 1 hour ago to 14.04 LTS I can't find/load the sites hosted on that server. I use apache2 and haven't really configured anything else than 2 enabled sites on it. As of now the site only shows all destinations as empty directories. The sites are still on the server and looks to be intact but somehow unreachable.
|
I recently installed Ubuntu 14.04, then I installed lamp-server and placed my webpages in /var/www directory, but when I opened localhost in the browser there was nothing. I think that happened because Zend updated Apache. Whatever the reason may be, I want to know where to keep my php files so that I can access them from my browser.
|
How can I convert PDF files to HTML with Python? I was thinking something alone the lines of what Google does (or seems to do) to index PDF files. My final goal is to setup Apache to show the HTML for the PDF files, so anything leading me in that direction would also be appreciated.
|
Is there any python module to convert PDF files into text? I tried found in Activestate which uses pypdf but the text generated had no space between and was of no use.
|
I am a PhD student in computer science and I have noticed that my advisor tries to avoid having me submit to workshops in my field when I bring workshops to his attention that we could submit to. He, instead, prefers to publish in a conference, journal, or IEEE/ACM magazine instead. I almost feel like he treats workshops as not prestigious enough. The workshops I bring to his attention are all good workshops in my opinion. These workshops are IEEE and ACM workshops demanding original research papers that are about 6 pages long (conference papers in my field are usually 8 to 10 pages long). The program committees for these workshop are known people in my field and previous year's workshop papers have a 5 or 6 citations (for example), so they do get attention (but I don't know how this compares to the attention that this same paper could have gotten if it was published at a conference). My questions are: are workshops viewed as less prestigious in general than conferences? Is there an unspoken understanding that only new, inexperienced students present their papers at workshops? Would having workshop papers in my resume somehow lower the credibility of my work? (Apologies if the questions sound naive. I have always been unable to understand the 'prestige' of a 'co-located' workshop when juxtaposed against the conference.)
|
I had missed deadline for a reputable conference (Computer Science). Now I see that a workshop is being organized with the conference which exactly aligns with my area of research. The workshop proceedings will be published with the conference proceedings. (It is the first workshop in this series) Does a workshop publication holds same value as a conference publication for PhD work, future employment opportunities etc. ? (I am a PhD Candidate as of now) Edit My field is Computer Vision The conference is
|
I had an error installing a program, and the process is incomplete. I tried to remove it using the following command: sudo apt-get purge realvnc-vnc-server Then, it gives me this: apt-listchanges: Can't set locale; make sure $LC_* and $LANG are correct! perl: warning: Setting locale failed. perl: warning: Please check that your locale settings: LANGUAGE = (unset), LC_ALL = "en_US.UTF-8", LC_TIME = "es_EC.UTF-8", LC_MONETARY = "es_EC.UTF-8", LC_ADDRESS = "es_EC.UTF-8", LC_TELEPHONE = "es_EC.UTF-8", LC_NAME = "es_EC.UTF-8", LC_MEASUREMENT = "es_EC.UTF-8", LC_IDENTIFICATION = "es_EC.UTF-8", LC_NUMERIC = "es_EC.UTF-8", LC_PAPER = "es_EC.UTF-8", LANG = "en_GB.UTF-8" are supported and installed on your system. perl: warning: Falling back to a fallback locale ("en_GB.UTF-8"). locale: Cannot set LC_CTYPE to default locale: No such file or directory locale: Cannot set LC_MESSAGES to default locale: No such file or directory locale: Cannot set LC_ALL to default locale: No such file or directory dpkg: error processing package realvnc-vnc-server (--remove): package is in a very bad inconsistent state; you should reinstall it before attempting a removal Errors were encountered while processing: realvnc-vnc-server E: Sub-process /usr/bin/dpkg returned an error code (1) Hope somebody can help me to fix this, and install it again.
|
I can't update my system because it freezes while installing a third-party update (zramswap-enabler)! Sometimes I get the following message in Update manager: Could not initialize the package information An unresolvable problem occurred while initializing the package information. Please report this bug against the 'update-manager' package and include the following error message: E:The package zramswap-enabler needs to be reinstalled, but I can't find an archive for it. I tried to remove the zramswap-enabler, but it's impossible because I get the following message: dpkg: error processing zramswap-enabler (--remove): Package is in a very bad inconsistent state - you should reinstall it before attempting a removal. Errors were encountered while processing: zramswap-enabler E: Sub-process /usr/bin/dpkg returned an error code (1) Actually I would really reinstall that package, but it is unable to do it! If I remove this third-party PPA then the system is warning me about a very very serious problem. So why can I not install/reinstall/remove/update this package and why freezes the updater if I try to update?
|
$$\lim_{x \to 2} \frac{\cos{\left(\frac{\pi}{x}\right)}}{x-2}$$ This limit is supposed be found without L'Hospital's Rule, but I have not been able to get close to the answer using conjugates, squares, Pythagorean Identity, half angle formulas or Squeeze Theorem. For each attempt, I expected at least one of the well-known limits $\lim_{x \to 0} \frac{\sin{x}}{x}$ or $\lim_{x \to 0} \frac{\cos{x} - 1}{x}$ to come into use. They frequently did in my attempts but did not go anywhere. I have also been experimented substitutions but in vain. How can this be solved without using L'Hospital's Rule?
|
I am a kid trying to teach myself Calculus in order to prepare for next year. I have the expression $$\lim_{x\to 2}\frac{\cos(\frac \pi x)}{x-2} $$ There is a hint that says to substitute t for $(\frac \pi2 - \frac \pi x)$ and WolframAlpha evaluates this expression as $\frac \pi4$. However, I got the answer of $1$. Can someone clarify the steps to solving this problem.
|
Let $f:\mathbb{R}\to (0,1)$, $f=t\sin\left(\frac1t\right)$. I think this function is uniformly continuous, but I don't see how to prove this formally. I can observe that if $s,t\in (0,1)$ and $|s-t|<\delta$, then the smaller $\delta$ we take, the smaller the quantity $$\left|t\sin\left(\frac1t\right)-s\sin\left(\frac1s\right)\right|\mbox{ (*)}$$ becomes. So we can take any $\varepsilon>0$ and any $s,t$, such that (*) is less than $\varepsilon$, and there will necessarily be a $\delta>0$ such that $|s-t|<\delta$. I would appreciate some suggestions on what approach to take.
|
A student showed me the following exercise: Is $h(x) = x \sin\left(\frac{1}{x}\right)$ uniformly continuous on $(0,1)$? Admittedly, it has been a while since I have looked at problems involving uniform continuity and so I am not sure how to go about this problem. My guess is that $h(x)$ is uniformly continuous on this interval but I am not sure how to go about picking an appropriate $\delta > 0$ such that $|x-c|< \delta$ implies $|h(x) - h(c)| < \epsilon$ for $x,c \in (0,1)$. The student and I looked at $|x \sin(x) - c \sin(c)| \leq |x \sin(x)| + |c \sin(c)| \leq |x| + |c|$ although this feel like the wrong path to go down. I appreciate any help! Thanks in advance!
|
Looking for 90s book title - Pandemic cure causes sterility and children sex change. Plot: There is a pandemic. The cure causes selective sterility mother's must find fathers with different blood types to conceive a child. At puberty, males change to females or females change to males due to menstrual cycles.
|
The initial plot was about genetic engineering being used to defeat disease, but something went awry that caused a massive social upheaval, where people in social settings would have a lapel pin or small badge that showed their blood type, so they could match up with someone compatible ( and not catch/cause a worse disease ). An unknown effect of this genetic engineering was that newer children born turned into a sort-of hermaphrodite where they would physiologically switch genders under certain circumstances ( either puberty or pregnancy, I don't remember ). The protagonist eventually adopted the surname Dos Caras ( meaning two-face or two-faced? ) and ended the story with a compatible mate. All I remember of the antagonist was that he was a real ass, and regardless of the gender he/she was at the time, would flaunt the social custom of showing blood type in a gathering ( by wearing whatever blood type corresponding to the person he/she was interested in, and not his/her own ) just so he could 'sow his seed far and wide' to spread the genetic mutation that causes children to switch physiological genders. The antagonist might have even died, by the end of the story, but that's one of the more fuzzier parts.
|
After importing my cleaned up mesh from mesh Lab I have a solid color on it. Does anyone know why this happened? Thanks
|
I used node textures in a mesh I exported to .FBX. I then imported it into Unreal Engine 4 and it didn't import any textures; I clicked the Upload Textures option in Unreal Engine. Is there something I'm doing wrong or is it Blender?
|
There is an NTFS partition with data that was converted into RAW partition by a piece of software. Now it's not readable. File recovery utils easily find all the files (including deleted ones) and it's no problem to recover data file by file. But is there a way to recover the file system as a whole (including metadata, like creation time)? Essentially I am looking for a way of undoing the covertation of the NTFS partition into RAW.
|
What steps can I take to try to recover lost or inaccessible data from any storage device? Answers: This applies to any computer storage device, e.g. internal/external hard drives, USB sticks, flash memory. The most important thing is to STOP using it, any type of I/O can ruin your chances of a recovery. We have separate questions covering common problems with USB flash drives in greater detail:
|
I have two structs: struct struct_A { uint8_t v1[4]; // 4 bytes uint8_t v2; }; struct struct_B { uint32_t v1; // 4 bytes uint8_t v2; // 1 byte }; I obtain their sizes by using the code: std::cout<<"size of struct_A is: "<<(sizeof(struct_A)) <<std::endl; std::cout<<"size of struct_A::v1 is: "<<(sizeof(struct_A::v1))<<std::endl; std::cout<<"size of struct_A::v2 is: "<<(sizeof(struct_A::v2))<<std::endl; std::cout<<"size of struct_B is: "<<(sizeof(struct_B)) <<std::endl; std::cout<<"size of struct_B::v1 is: "<<(sizeof(struct_B::v1))<<std::endl; std::cout<<"size of struct_B::v2 is: "<<(sizeof(struct_B::v2))<<std::endl; And I get output: size of struct_A is: 5 size of struct_A::v1 is: 4 size of struct_A::v2 is: 1 size of struct_B is: 8 size of struct_B::v1 is: 4 size of struct_B::v2 is: 1 How do I understand the size of struct_A and size of struct_B are different? Thanks.
|
Why does the sizeof operator return a size larger for a structure than the total sizes of the structure's members?
|
A dear friend of mine is from Vietnam. In one of our conversations, I asked her whether I can call her "ABC", but she replied that is my domestic name. Maybe what she meant by domestic name is the name that her family calls her by. I am wondering whether she is correct in her English when she used the words "my domestic name".
|
In Dutch (and other languages) people have have different types of first names. First, there is the Christian name or given name, which is the official name of a person and is used for official documents etc. Then there is the first name that is used on a regular basis. The literal translation of the Dutch word for that is 'calling name' (roepnaam). Finally there is the nickname that close friends and family use. My sister's name is a typical example. Her given name ('birth name' in Dutch) is 'Elisa Hermina', the name used by everybody, however, is 'Lisette' and the name used by family and close friends is 'Jet'. They could of course also be the same. For an English paper I am writing, I need to distingish between the names. Which words could I best use for each of the names? I know 'calling name' is also used in english and also seems to have a similar meaning. Does it indeed have exactly the same meaning a the dutch roepnaam?
|
Installing Debian I have to choose between the kernels linux-image-3.2.0.4-amd64 linux-image-amd64 What's the difference?
|
I've started installing Debian testing on amd64 and I've come to a screen asking me to install a kernel. It gives me a choice between linux-image-3.16-2-amd64, linux-image-amd64, and none. What is the difference between these options? Which do I choose?
|
What are the mathematical steps to get loadings and scores matrices of a 3x3 matrix basing of PCA and what is the relationship relating eigenvalues eigenvectors with loadings and score?
|
In today's pattern recognition class my professor talked about PCA, eigenvectors and eigenvalues. I understood the mathematics of it. If I'm asked to find eigenvalues etc. I'll do it correctly like a machine. But I didn't understand it. I didn't get the purpose of it. I didn't get the feel of it. I strongly believe in the following quote: You do not really understand something unless you can explain it to your grandmother. -- Albert Einstein Well, I can't explain these concepts to a layman or grandma. Why PCA, eigenvectors & eigenvalues? What was the need for these concepts? How would you explain these to a layman?
|
Firefox has a config option (browser.tabs.remove.autostart.2) enabled by default. My Firefox was hanging, so I checked the process and it looked suspicious, so I verified the same with a new Firefox installation (but it looked ok). First, could some one confirm that below is genuine? also, what does intPrefs, boolPrefs, stringPrefs arguments for? ubuntu 14891 21.7 3.6 2213104 295320 ? Sl 22:23 0:09 /usr/lib/firefox/firefox ubuntu 14945 4.4 1.9 1876248 153596 ? Sl 22:23 0:01 /usr/lib/firefox/firefox -contentproc -childID 1 -isForBrowser -intPrefs 5:50|6:-1|18:0|28:1000|34:20|35:5|36:10|45:128|46:10000|51:0|53:400|54:1|55:0|56:0|61:0|62:120|63:120|98:2|99:1|114:5000|124:0|126:0|137:10000|162:24|163:32768|165:0|166:0|174:5|178:1048576|179:100|180:5000|182:600|183:4|184:1|193:3|206:60000| -boolPrefs 1:0|2:0|4:0|26:1|27:1|30:0|33:1|37:1|38:0|39:0|40:0|43:1|44:1|47:0|48:0|49:0|50:0|52:0|57:1|58:1|59:0|60:1|64:1|65:1|66:0|67:1|68:1|69:0|70:1|73:0|74:0|77:1|78:1|82:1|83:1|84:1|85:0|86:0|88:0|89:0|90:1|91:0|92:1|95:1|97:0|100:1|101:0|108:0|113:0|116:0|118:1|119:1|121:1|125:0|127:0|129:0|131:1|132:1|138:1|139:0|140:1|142:0|153:1|160:0|161:0|164:1|167:0|169:1|171:1|172:0|177:0|181:1|186:0|187:0|188:0|189:1|190:0|191:1|192:1|195:1|198:0|199:0|200:1|201:1|202:0|203:1|204:1|205:1|207:0|208:0|210:0|218:1|219:1|220:0|221:0|222:0| -stringPrefs 3:7;release|96:0;|141:3;1.0|158:332; ¼½¾ǃː??։֊׃״؉؊٪۔܁܂܃܄ᅟᅠ᜵ ???‐’․‧??????? ‹›⁁⁄⁒ ⅓⅔⅕⅖⅗⅘⅙⅚?⅜⅝⅞⅟∕∶⎮╱⧶⧸⫻⫽⿰⿱⿲⿳⿴⿵⿶⿷⿸⿹⿺⿻ 。〔〕〳゠ㅤ㈝㈞㎮㎯㏆㏟꞉︔︕︿﹝﹞?．／｡ﾠ???�|159:4;high| -schedulerPrefs 0001,2 -greomni /usr/lib/firefox/omni.ja -appomni /usr/lib/firefox/browser/omni.ja -appdir /usr/lib/firefox/browser 14891 true tab It is more readable below: /usr/lib/firefox/firefox -contentproc -childID 1 -isForBrowser -intPrefs 5:50|6:-1|18:0|28:1000|34:20|35:5|36:10|45:128|46:10000|51:0|53:400|54:1|55:0|56:0|61:0|62:120|63:120|98:2|99:1|114:5000|124:0|126:0|137:10000|162:24|163:32768|165:0|166:0|174:5|178:1048576|179:100|180:5000|182:600|183:4|184:1|193:3|206:60000| -boolPrefs 1:0|2:0|4:0|26:1|27:1|30:0|33:1|37:1|38:0|39:0|40:0|43:1|44:1|47:0|48:0|49:0|50:0|52:0|57:1|58:1|59:0|60:1|64:1|65:1|66:0|67:1|68:1|69:0|70:1|73:0|74:0|77:1|78:1|82:1|83:1|84:1|85:0|86:0|88:0|89:0|90:1|91:0|92:1|95:1|97:0|100:1|101:0|108:0|113:0|116:0|118:1|119:1|121:1|125:0|127:0|129:0|131:1|132:1|138:1|139:0|140:1|142:0|153:1|160:0|161:0|164:1|167:0|169:1|171:1|172:0|177:0|181:1|186:0|187:0|188:0|189:1|190:0|191:1|192:1|195:1|198:0|199:0|200:1|201:1|202:0|203:1|204:1|205:1|207:0|208:0|210:0|218:1|219:1|220:0|221:0|222:0| -stringPrefs 3:7;release|96:0;|141:3;1.0|158:332; ¼½¾ǃː??։֊׃״؉؊٪۔܁܂܃܄ᅟᅠ᜵ ???‐’․‧??????? ‹›⁁⁄⁒ ⅓⅔⅕⅖⅗⅘⅙⅚?⅜⅝⅞⅟∕∶⎮╱⧶⧸⫻⫽⿰⿱⿲⿳⿴⿵⿶⿷⿸⿹⿺⿻ 。〔〕〳゠ㅤ㈝㈞㎮㎯㏆㏟꞉︔︕︿﹝﹞?．／｡ﾠ???�|159:4;high| -schedulerPrefs 0001,2 -greomni /usr/lib/firefox/omni.ja -appomni /usr/lib/firefox/browser/omni.ja -appdir /usr/lib/firefox/browser
|
I've discovered this yesterday, as it was generating system load on otherwise idle Ubuntu 14.04 Desktop machine. Today, I've confirmed such behavior also on another Ubuntu instance (17.10 in Virtualbox VM) The sub-process in command line looks like below ( I've put this as picture below intentionally to prevent askubuntu.com from changing/escaping the content ) For me it looks like exploit/malware. Or at least there is something to hide. this happens even for url
|
I am using SP.RequestExecutor to add attachments to a list item. I followed I need to wait the completation of the asynch call of executeAsync method. How can I achieve this? Thanks,Nk
|
I'm working on a SharePoint app where I need to run SP.RequestExecutor.executeAsync() in order to grab some information from one of the Host Web's lists. Depending on what method is calling the oData call I want to do something different. Unfortuntely, executor.executeAsync() isn't playing as nice as $.ajax() does in terms of using $.when().done() and executing code after an async call is made. Below is some code if you'd like to see: load = function (){ $.when(getEntries()).done(function () { ViewModels.Calendar.addEventSource(ko.utils.unwrapObservable(eventList)); }); } getEntries = function () { return executor.executeAsync({ url: appweburl + "/_api/SP.AppContextSite(@target)/web/lists/getbytitle('" + LIST + "')/items?@target='" + hostweburl + "'&$select=Title,OData__x006e_ot5,qnlu,OData__x0066_x20" + "&$filter=OData__x0066_x20 eq '" + ViewModels.Person.user.userName() + "' " + "and qnlu ge DateTime'" + startDate().toString("yyyy-MM-dd") + "T00:00:00' " + "and qnlu le DateTime'" + endDate().toString("yyyy-MM-dd") + "T00:00:00' ", method: "GET", headers: { "Accept": "application/json; odata=verbose" }, success: onGetEntriesSuccess, error: onoDataCallFailure }); }, onGetEntriesSuccess = function (data) { var jsonObject = JSON.parse(data.body); $.each(jsonObject.d.results, function (index, item) { eventList.push(new Event(item.qnlu, item.OData__x006e_ot5)); }); }, onoDataCallFailure = function (data, errorCode, errorMessage) { alert('Failed to get host site. Error:' + errorMessage); }; Any ideas/suggestions would be appreciated.
|
I have a set of flat objects and they are independent, they are all in one single .AI file. How can I Change the colors of those objects while they are in symbol panel and are not yet in my artboard?
|
I have a group of objects of the same colour, consisting of compound paths, regular paths and groups of these. How to change the colour of all objects at once? When I tried to use colour picker or change it through color palette the colour remained the same but the graphics was rendered with a very tiny outline of the new colour, which I guess is not printable. Usually I had to change the colour of all objects individually. Edit: I'm sorry if I was not too precise. I mean to apply new colour / swatch to all member objects of the group at once, not to change properties of a commonly shared swatch. Edit 2: I received very useful answers, however my goal was to pick a colour from another object, serving as a source. When I tried to select all objects, for example with ctrl-a, and then use a eyedropper to pick up a desired colour, it didn't work for some objects in some groups. Please have a look at my answer where several methods are listed.
|
If I issue a sudo /bin/bash` [sudo] password for mark: cmp -bl /dev/blah1 /dev/blah2 and using sudo cmp -bl /dev/blah1 /dev/blah2 then logging in as root? I don't see whats different, if issuing multiple command lines then rooting IMHO seems the logical option over typing sudo prefix to command lines. I have seen sudo -i being used to log in to root, that used to work but the last week its issuing an error. ** EDIT ** I logged in as root, issued the command mark@mark-zotac:~$ sudo cmp -bl /dev/sda "/media/mark/Seagate Expansion Drive/SSD/ssd.img" [sudo] password for mark: mark@mark-zotac:~$ It ran, took about 30 minutes to run but produced zero as in nothing output. I am left with no indication of failure or success... So how do I know if the compare result was a success?
|
My question is asking regarding a specific observation that I would like to understand. I just tried to install the package rJava in R and failed even though I prefaced the installation as suggested with: sudo R CMD javareconf Then I came across : Using sudo and running as root are not exactly the same thing. – Jon7 Desparate as I was I tried it: sudo su R CMD javareconf And to my surprise I suddenly could install that package. Sorry for the lenghty introduction but I wanted to give you a context to prevent answers like . The question does not aim at specifically the described observation - rather at those "things" in general on Ubuntu. My question is: How could this be possible? What is the difference between sudo X and runnding X as root?
|
I want someone to answer me if what I'm doing is correct. I have a labelled data that I want to train different machine learning models that can predict the outcome. here are the steps that I have went through: I have divided the data into two sets 80% for training and 20% for testing. I have cross validated the training set (and only the training set) with 10 folds using different models (Knn, ANN, SVM ,...etc). I kept tuning the parameters of the models until I got a satisfactory root mean squared error (RMSE) for each model. I used the parameters that produced the lowest RMSE to build each model using the training set (80% of the data). I fed the testing set (the remaining 20%) into the each model and got a prediction from each model. I evaluated the testing set prediction error of each model using MSE, RMSE,MAPE and MAE. Compare the models and recommend the model that produced the lowest error. My questions: is using 10-fold cross validation on the testing set alone is similiar to dividing the data into 70% training, 10 % validation and 20% testing? It would be really helpful if you could provide me with research papers that adopt such technique. Does this procedure makes sense, or am I doing something wrong?
|
I'm trying to compare two classifiers using cross-validation. For one of the classifiers I'd like to use a validation set to tune a parameter. However, for the other one, I just want to use the training set and no validation set. Writing my own cross-validation loop, I'm not sure how to implement this. Is it correct to use the train set to estimate one of the classifiers and only 80% of the train set to estimate the other? This way, I could then tune one of the models and use the same test set eventually.
|
for _ in range(3): sec=sec+1.3 round(sec) print(sec) I am working on a GUI/ML project and i ran the above simple snippet.I have to display the number in the GUI(pyqt5) but the output is all messed up.Here is the output that i got.(sec=0 at the start obviously) 1.3 2.6 3.9000000000000004 Questions:- Why is the output 3.9000000000000004??Why the anomaly?? I have tried multiple ways to round up the number like ....but nothing works!! How can i round this upto 1/2 decimal places???
|
The documentation for the function states that you pass it a number, and the positions past the decimal to round. Thus it should do this: n = 5.59 round(n, 1) # 5.6 But, in actuality, good old floating point weirdness creeps in and you get: 5.5999999999999996 For the purposes of UI, I need to display 5.6. I poked around the Internet and found some that this is dependent on my implementation of Python. Unfortunately, this occurs on both my Windows dev machine and each Linux server I've tried. . Short of creating my own round library, is there any way around this?
|
code being run: package actionevent; import java.awt.*; import java.awt.event.ActionEvent; import java.awt.event.ActionListener; import java.awt.event.WindowAdapter; import java.awt.event.WindowEvent; public class CalculatorTest { public static void main(String[] args) { new Calculator().loadFrame(); }} class Calculator extends Frame{ TextField num1,num2,num3; public void loadFrame(){ TextField num1 = new TextField(10); TextField num2 = new TextField(10); TextField num3 = new TextField(11); Label label1 = new Label("+"); Button button2 = new Button("="); button2.addActionListener(new CalculatorActionListener()); setLayout(new FlowLayout()); setVisible(true); add(num1); add(label1); add(num2); add(button2); add(num3); pack(); closeWindow(this); } class CalculatorActionListener implements ActionListener{ @Override public void actionPerformed(ActionEvent e) { int a = Integer.parseInt(num1.getText()); int b = Integer.parseInt(num2.getText()); // System.out.println(a); // System.out.println(b); num3.setText(a + b +""); num1.setText(""); num2.setText(""); } } private void closeWindow(Frame frame){ frame.addWindowListener(new WindowAdapter() { @Override public void windowClosing(WindowEvent e) { System.exit(0); } }); }} Exception encountered Exception in thread "AWT-EventQueue-0" java.lang.NullPointerException at actionevent.Calculator$CalculatorActionListener.actionPerformed(CalculatorTest.java:46) at java.awt.Button.processActionEvent(Button.java:409) at java.awt.Button.processEvent(Button.java:377) at java.awt.Component.dispatchEventImpl(Component.java:4889) at java.awt.Component.dispatchEvent(Component.java:4711) at java.awt.EventQueue.dispatchEventImpl(EventQueue.java:760) at java.awt.EventQueue.access$500(EventQueue.java:97) at java.awt.EventQueue$3.run(EventQueue.java:709) at java.awt.EventQueue$3.run(EventQueue.java:703) at java.security.AccessController.doPrivileged(Native Method) at java.security.ProtectionDomain$JavaSecurityAccessImpl.doIntersectionPrivilege(ProtectionDomain.java:74) at java.security.ProtectionDomain$JavaSecurityAccessImpl.doIntersectionPrivilege(ProtectionDomain.java:84) at java.awt.EventQueue$4.run(EventQueue.java:733) at java.awt.EventQueue$4.run(EventQueue.java:731) at java.security.AccessController.doPrivileged(Native Method) at java.security.ProtectionDomain$JavaSecurityAccessImpl.doIntersectionPrivilege(ProtectionDomain.java:74) at java.awt.EventQueue.dispatchEvent(EventQueue.java:730) at java.awt.EventDispatchThread.pumpOneEventForFilters(EventDispatchThread.java:205) at java.awt.EventDispatchThread.pumpEventsForFilter(EventDispatchThread.java:116) at java.awt.EventDispatchThread.pumpEventsForHierarchy(EventDispatchThread.java:105) at java.awt.EventDispatchThread.pumpEvents(EventDispatchThread.java:101) at java.awt.EventDispatchThread.pumpEvents(EventDispatchThread.java:93) at java.awt.EventDispatchThread.run(EventDispatchThread.java:82)
|
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 quite a few DVDs of non-critical archived material - burned in different years, different disc manufacturers, different drives - but certainly some are now about 10 years old. I've read this question: about long-term archival media, and I understand there is no silver bullet, but my dilemma has some specific constraints: I (think I) have to replace my aging DVDs with something I'm willing to spend no more than a few hundred USD, maybe even less. In fact, if I lost this entire archive, I would be annoyed and distraught, but not devastated. The archived material does not become useless if some of it is lost I want to reduce the amount of space my archive takes up; right now my DVDs are in an 'album' of sleeves. So, I was considering switching to a portable HDD. I'm assuming that I'll replace it every 10 years or so with whatever is available then; but I still fear for the longevity of this choice. With that in mind, How useful is it to use ZFS with Reed-Solomon codes for storage? Are there other software solutions (not RAID, since we're talking about a single drive, but perhaps RAID between areas of the drive) I could use to increase longevity? Is it a good idea to buy two different portable HDDs and occasionally overwrite one of them with the other? Is the longevity of SSDs higher than that of HDDs when writes are infrequent, as in my case? Should I maybe just get a BluRay recorder and some good-quality discs instead? To emphasize: I need to make a decision for my own specific scenario.
|
I have many DVDs with movies and games, they are getting old and dusty, some of them are damaged. And I have more than 300 GB of general files in my PC. I want to store and preserve all of my data and keep them for a long long time. I want to know what is the best and more reliable storage media that I should use and... I can buy. I will copy all of my DVDs to a new media and throw all of my DVDs away. It will take a very smaller physical space. I think that everything that I need to store is currently 800 GB. I do not like optical discs, because they are fragile and I have lost many CDs and DVDs. Hard drives would be good, but they can suddenly stop working, and it is very expensive to recover data from a broken hard drive. Other questions: How often will I have to copy the files to a new storage media? Is it good idea to have another copy of each file stored in another storage media? Edit: If I put all of the movies and games in a HDD, if the HDD stops working, I will lose everything. This is how valuable they are for me: If I lose 10% of them, I will not cry, because I can get new ones, but if I lose 90%, it will be a disaster. Edit 2: I do not think that that online storage is reliable even if I pay for it, because they may be closed or may get bankrupt. They are not from my country and it would be difficult to get the files back.
|
We are in the middle of our ArcGIS 9.3 to 10.1 migration project and we have a lot of custom map documents (from different users) that among others, point to our current 9.3 SDE database. After our migration, we'll disable this database to the users so they can't connect anymore. That means they'll end up with broken links in their MXDs (that's basically what we want) and need to repoint to the new SDE. I prepared a little script that should automatically repoint all broken layers to our new 10.1 SDE (using a connection file), but unfortunately I always run into the same error. I already checked out some other posts on this site (e.g. and ), but also on the ESRI forums e.g. and the ESRI resource center of course. Also tried to repoint to e.g. a file geodatabase, but I'm getting the same error. However, none of the suggestions apply to my case or worked for me, and after playing around almost the whole day now, I thought maybe someone here knows a solution to that problem. The code itself works fine, it finds the MXDs, spits out the broken layers if I ask it to, it's just the actual repointing command(s) that give me a headache.. Below my (simplified) code and the error I get. Thankful for any tips! # Import system modules import sys, string, os, arcpy, datetime, shutil # source folder(s) to look for MXDs sourcePath = r"D:\scripts\fixBrokenLinks\test" # new 10.1 SDE connection sde = r"\\path to *.sde connection file # loop through folders and find all MXDs (put into a list) for root, dirs, files in os.walk(sourcePath): for f in files: if f.endswith(".mxd"): mxdPath = root + "\\" + f mxd = arcpy.mapping.MapDocument(mxdPath) print "converting " + str(mxdPath) brknList = arcpy.mapping.ListBrokenDataSources(mxd) for brknItem in brknList: ## print brknItem brknItem.replaceDataSource(sde, "SDE_WORKSPACE")#, brknItem, True) ## # ALTERNATIVE: ## find_workspace = brknItem.dataSource ## replace_workspace_path = r"\\path to *.sde connection file ## print "find_workspace " + str(find_workspace) ## brknItem.findAndReplaceWorkspacePath(find_workspace, replace_workspace_path) newMXD = mxdPath[:-4] + "_NEW.mxd" mxd.saveACopy(newMXD) del mxd And here the error I get: Traceback (most recent call last): File "D:\scripts\fixBrokenLinks\fixBrokenLinks_simple.py", line 19, in <module> brknItem.replaceDataSource(sde, "SDE_WORKSPACE")#, brknItem, True) File "C:\Program Files (x86)\ArcGIS\Desktop10.1\arcpy\arcpy\utils.py", line 181, in fn_ return fn(*args, **kw) File "C:\Program Files (x86)\ArcGIS\Desktop10.1\arcpy\arcpy\_mapping.py", line 680, in replaceDataSource return convertArcObjectToPythonObject(self._arc_object.replaceDataSource(*gp_fixargs((workspace_path, workspace_type, dataset_name, validate), True))) ValueError: Layer: Unexpected error I'm using ArcGIS 10.1 SP1 (Build 3143) and Python 2.7.2
|
Using the mxd.findAndReplaceWorkspacePaths method, if and MXD is updated and the path the the .sde connection file moves again all of the data sources will break again. Is there a method to permanently update each SDE layer in an MXD Table of Contents to permanently store the SDE Server and Service? Ie. Just replace the SERVER and INSTANCE for each SDE layer in an MXD using python or ArcObjects in Pyhton?
|
I have installed my Ubuntu 18.10 on a SSD and I also have a another drive which is formatted as NTFS file system. When I click on mount it mounts that drive but I am only able to see the files. I can't seem to write into it. I am not dual booting. I only have Ubuntu installed as a Operating System. Can anyone please help me on how to setup my NTFS drive to auto mount at startup with Read and Write Access?
|
Whenever I boot Ubuntu, I get a message that it cannot mount my windows partition, and I can choose to either wait, skip or manually mount. When I try to enter my Windows partition through Nautilus I get a message saying that this partition is hibernated and that I need to enter the file system and properly close it, something I have done with no problem so I don't know why this happens. Here's my partition table, if any more data is needed please let me know. Device Boot Start End Blocks Id System /dev/sda1 2048 20000767 9999360 83 Linux /dev/sda2 20002814 478001151 228999169 5 Extended /dev/sda3 * 478001152 622532607 72265728 7 HPFS/NTFS/exFAT /dev/sda4 622532608 625141759 1304576 82 Linux swap / Solaris /dev/sda5 20002816 478001151 228999168 83 Linux
|
In the original trilogy, Palpatine did not meet with Yoda. But in the prequel trilogy they met several times. Does Palpatine even remember Yoda at the point when he saw Luke Skywalker on the Death Star II? He did not mention Yoda in Return of the Jedi.
|
At the end of Revenge of the Sith, the Emperor knows thats Yoda is alive. Why would he not make that the first priority of the Empire? Yoda would be the one Jedi of all the Jedi you would not want alive, so why overlook this?
|
I have a Windows 7 laptop, which has 4GB of RAM and admittedly is quite a few years old. Recently, it seems all my RAM is being used up, without doing anything or very much at all (e.g. just opening Google Chrome and reading my Goggle Mail), and everything grinds to a halt if I try to do anything at all (e.g. open a PDF document in Acrobat Reader, open Word or Excel, etc...). Below are a couple of screenshots from Process Explorer that illustrate the issue: I have changed the indexing options of Windows to a minimum set of folders to see if that makes a difference. I suppose I could disable search indexing altogether. Any other suggestions (other than buying more RAM)? Update: my question is different from the suggested duplicate. I have tried stopping some services, but I don't really know which are needed, and which ones aren't. Below is a screenshot of RAMMap, it shows that most of the memory is active (mostly as "nonpaged pool" and "process private"), and not in standby as in the suggested duplicate question:
|
I'm having a problem with my ram on windows 7. The ram is clearing or programs are using and dumping it faster than it can clear. I have 8gb of ram I'm only using 4gb and the rest is in Standby. At best time I can get 100mb of free but its mostly at 15mb or less. I suspect a memory leak but I have no way to figure out what program it is. I have not installed any new hardware recently and newly installed programs have bin closed. Does any one have an idea of what is going on and how to fix it? I'm sorry this is so little information but that is all I have as well. Edit: I tried RamMap and found out the my "Mapped File" has 3,291,784k ram in standby how do I figure out what program and how do I limit it's ability to set ram in standby? Edit: I keep getting a problem when I will have 0 free ram and my computer will stop working properly. It will become outrageously slow where it will take 3-4 minutes to start task manager so I can close some programmes. When I free up some ram by closing some programmes every thing runs normally. It does not matter which programs I closes only that I free up some ram. I know a lot of you say it's supposed to be like that and that's how windows works. But its obviously a problem and my computer has never worked that way neither has any of my other computers. I would like to fix this please help me.
|
A friend thought of this problem and I found it interesting to think about so I want to share it with you. I am intrigued how you will solve the problem. Find countably infinite many sets $U_i$ such that $$\mathbb{N}=\cup_{i=1}^{\infty}U_i,$$ with $U_i$ disjunct and countably infinite.
|
The title says it. I thought of the following: we want $$\Bbb N = \dot {\bigcup_{n \geq 1} }A_n$$ We pick multiples of primes. I'll add $1$ in the first subset. For each set, we take multiples of some prime, that hasn't appeared in any other set before. Then $$\begin{align} A_1 &= \{1, 2, 4, 6, 8, \cdots \} \\ A_2 &= \{3, 9, 15, 21, 27, \cdots \} \\ A_3 &= \{5, 25, 35, 55, \cdots \} \\ A_4 &= \{7, 49, 77, \cdots \} \\ &\vdots \end{align} $$ I'm heavily using the fact that there are infinite primes. I think these sets will do the job. Can someone check if this is really ok? Also, it would be nice to know how I could express my idea better, instead of that hand-waving. Alternate solutions are also welcome. Thank you! Edit: the subsets must be also infinite.
|
I'm very new to Java, and I want to make a very simple login Java-program. Don't think about security issues and such in this example, I just need help to get it right. My "Account informations" has to be stored in an Array. This is my code: -- MAIN -- import java.util.Scanner; public class BATM { public static void main(String[] args) { Scanner input = new Scanner(System.in); String username; String password; System.out.println("Log in:"); System.out.println("Indtast username: "); username = input.nextLine(); System.out.println("Indtast password: "); password = input.nextLine(); users check = new users(username, password); if(check.auth()) System.out.println("You are logged in"); } } -- users --- public class users { private String username; private String password; private String[][] accounts = {{"jesper", "abc123"},{"christian", "abc123"}}; public users(String user, String pass){ username = user; password = pass; } public boolean auth(){ if((username == accounts[0][0]) && (password == accounts[0][1])) return true; else return false; } } I guess this should be a quite simple function, but for some reason the if-statment will never return "true". What am I doing wrong? Jesper.
|
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?
|
Disclaimer: This is homework, so I am not looking for an exact answer because I'd like to do this on my own. I have to read a matrix from a text file that is filled with doubles and put into a 2D array. I'm currently struggling to find where exactly my problem lies in my code because I know how to use the built in Java Scanner for a normal array. My code below always give me a NullPointerException error which means my matrix 2D array is empty. public Matrix(String fileName){ //reads first double and puts it into the [1][1] category //then moves on to the [1][2] and so on //once it gets to the end, it switches to [2][1] Scanner input = new Scanner(fileName); int rows = 0; int columns = 0; while(input.hasNextLine()){ ++rows; Scanner colReader = new Scanner(input.nextLine()); while(colReader.hasNextDouble()){ ++columns; } } double[][]matrix = new double[rows][columns]; input.close(); input = new Scanner(fileName); for(int i = 0; i < rows; ++i){ for(int j = 0; j < columns; ++j){ if(input.hasNextDouble()){ matrix[i][j] = input.nextDouble(); } } } } My text file: 1.25 0.5 0.5 1.25 0.5 1.25 0.5 1.5 1.25 1.5 0.25 1.25
|
What are Null Pointer Exceptions (java.lang.NullPointerException) and what causes them? What methods/tools can be used to determine the cause so that you stop the exception from causing the program to terminate prematurely?
|
I am switching from a MTB (with pretty old, but still fine, SPD cleats) to a CX and am in the process of picking pedals. I won't be driving the MTB at all anymore, after that, and have switched it to non-cleat anyways, because I prefer it that way on slow, technical routes. Do I want to worry about converting the shoes to the road cleat system? Or is that just a big hassle ending in an unhappy compromise? The point would be primarily to not have to go and look for new shoes (as the old ones are still well fitting and have not been used much), and just switch out the system.
|
I am interested in buying some pedals I can clip into for my bike. I currently ride a mountain bike/hybrid but I ma looking to get a road bike next year some time. What are the differences between road pedals and mountain bike pedals? Are road pedals suitable for my hybrid/MTB if I am only riding on roads?
|
I find people are limited in growth in technology due to them not expanding their skill despite it not being difficult so they end up being held back despite the demand in business and in job marking being in new technology. Technology constantly changes and being valued at corporations is dependent on overcoming ***** steps. This phenomenom can be described by an analogy. If you slowly move your finger up against a balloon, you feel resistance and feel like it is pushing back. You move your hand further still feeling the resistance until it pops and you can move on. These people are really smart and not lazy. The struggle in the first step of learning something new and different and give up. They need to learn to over the *****. Words I can think of barrier/friction/glass ceiling/struggle/opposition Neither describes the face that the friction is just in the beginning. Learning the new thing isn't really hard but the resistance is merely in it being different and new. I guess it is similar to waking up early in the morning or exercising. Initially it is very hard but becomes routine it is easy and become easy. Two people get given the same task of fishing. One tries to immediately catch fish with his hands. The other takes his time by making a net. The former could have done the same as it would make fishing so much easier however the friction of doing something different to what his existing methods was, he found to hard . What do you call (single word or compound word) the initial friction of doing something different or the bias of not wanting to do it because it is different/strange/alien even though it is beneficial once that irrational mental block gets passed. Not a dislike. Almost a phantom resistance but that isn't a recognized phrase. Not a mind block but a mind bubble but that also isn't a recognized phrase
|
What is the best term to describe the fact that most users have an initial dislike of any change to a UI even though it may really be net better over time? Note: Question originally appeared
|
Is there the regular expression that can completely remove a HTML tag? By the way, I'm using Java.
|
Is there a good way to remove HTML from a Java string? A simple regex like replaceAll("\\<.*?>", "") will work, but things like &amp; wont be converted correctly and non-HTML between the two angle brackets will be removed (i.e. the .*? in the regex will disappear).
|
Show that $\neg$ and $\wedge$ form a functionally complete collection of logical operators Can someone give a hint?
|
Earlier this day I ask about the assignmet: Show that $\neg$ and $\wedge$ form a functionally complete collection of logical operators. I was given the hint that I could use De Morgan law to show that $p \vee q$ is logically equivalent to $\neg (\neg p \wedge \neg q)$. $$\neg (\neg p \wedge \neg q) \equiv \neg (\neg p) \vee \neg (\neg q)$$ $$\neg (\neg p) \vee \neg (\neg q) \equiv p \vee q$$ But I cannot figure out? am I done?
|
$ b>a>0$. Calculate the integral $\displaystyle \int_{0}^{\infty} \frac{e^{-ax}-e^{-bx}}{x}\ dx $ Integration by parts doesn't work, nor can I find a proper substituion.
|
Prove that $$ \int_{0}^{\infty}\frac{e^{-bx}-e^{-ax}}{x}\,dx = \ln\left(\frac{a}{b}\right) $$ My Attempt: Define the function $I(a,b)$ as $$ I(a,b) = \int_{0}^{\infty}\frac{e^{-bx}-e^{-ax}}{x}\,dx $$ Differentiate both side with respect to $a$ to get $$ \begin{align} \frac{dI(a,b)}{da} &= \int_{0}^{\infty}\frac{0-e^{-ax}(-x)}{x}\,dx\\ &= \int_{0}^{\infty}e^{-ax}\,dx\\ &= -\frac{1}{a}(0-1)\\ &= \frac{1}{a} \end{align} $$ How can I complete the proof from here?
|
This may sound like a strange question, but it's incredibly relevant to my company. If it's legit to purchase previously used VL keys for SQL Server 2008 and have them legally transferred over to us through VLSC, that would fill a huge gap for us. We have an application that runs on SQL Server 2008 (not R2). If you read the licensing guidelines for SQL 2008, you can deploy as many virtual machines PER SOCKET as you want, as long as you've licensed all sockets. We run a SaaS application that is backed by SQL Server. As you can imagine, the licensing change to core-based licensing is quite literally a "million dollar" decision for us as we continue to roll out new Production hypervisors and SQL virtual servers. Thus far, we've been able to find retail copies of SQL 2008 as we build out new servers, but I assume as some point the retail supply of 2008 Ent Per-Proc licenses will be exhausted. However, since Microsoft no longer offers upgrade "discounts" for SQL Server, If you bought a perpetual VLK license of 2008 (without software assurance), you have to pay full price for 2012 if you want to upgrade. This would mean that there is a large population of SQL 2008 volume licenses that are basically used, right? If so, does anyone know if Microsoft has a provision to transfer ownership of these volume licenses to a different company? Lastly, if all of the above is accurate, does anyone have unused SQL 2008 Enterprise Per-Proc VL keys they would like to sell?
|
This is a about Licensing. Questions on licensing are off-topic on Server Fault. If your question has been closed as a duplicate of this question, then this is because we want to help you understand why licence questions are off topic rather than just telling you "it just is". In all likelihood, this question will not address your question directly, it was not meant to. I have a question regarding software licensing. Can the Server Fault community please help with the following: How many licenses do I need? Is this licensing configuration valid? What CALs do I need to be properly licensed? Can I run this product in a virtual environment? Can I downgrade this product to an earlier version? Am I entitled to feature X with license Y?
|
In a race there are $n$ horses. In that race, more than one horse may get the same position. For example, a race with 2 horses can finish in 3 ways: Both first Horse 1 first and horse 2 second Horse 2 first and horse 1 second How can I find out the number of ways the race can finish for any $n$. Is there any recurrence relation to calculate the number of ways? I need help to understand the solving way with better explanation.
|
In a race there are n horses.In the race more than one horse may get the same position. For example, 2 horses can finish in 3 ways. Both first horse1 first and horse2 second horse2 first and horse1 second In how many ways,the race can finish so that a particular horse can never be first.If f(n) is the number of ways, is there any recurrence relation to get f(n).
|
Yesterday someone got into my steam account and stole my full address, my full name and an old phone number that is out of service. I am 17 and living in Canada and I was wondering what can happen to me?? Should I be very worried? I also lost around 300$ of items but I'm not worried about that. The scammer also has my postal address so does that affect anything?
|
Updated question because old one was embarassing: I saw a spam email from "PayPal" and I didn't realize that it was a phishing attempt. I gave the phishing site my name, telephone number, and email. What could he do with them? Old question: Well, I saw a spam email, but I didn't realize that it's really a scam at first. I gave him my telephone number, address, and name. What would he do with them? Could he ruin ALL of my reputation with it?
|
How do I edit my Network Profile? Edit: "Save and copy changes to all public communities" does not work for the Network Profile. This looks like a bug. Is it supposed to not include stackexchange.com, Especially since meta.stackexchange.com gets updated? This is currently the only way to edit update it:
|
I made an account on Stack Exchange but I can't edit my network profile. How can I edit this?
|
I hope not repeat the topic, I don't find a post about it... I'm developing a webapp for FirefoxOS. I have a issue where I want to show more items when I click a button, and a item from those new items (another link) would be able to be click too and do what we want (call console in the example). I have two tags in HTML: <body> <a id="one" class="class_a">One</a> // if you click in this "one" link, you will see some text in console.log. <a id="two" class="class_b">Two</a> // if you click in this "two" link, you will charge on UI some new text and buttons. <div id="show_text"></div> </body> Then, in JS file I have: $('one').click(function(){ console.log("one"); }); function showItemsFromDB(element){ document.getElementById('show_text').innerHTML += "<li data-key=\""+element.key+"\">"+ "<p id=\"list_items"+ element.key + "\" class=\"list_items\">"+ "Number: "+ element.key+ "<br/>Frecuency: " + element.value.frecuency + "</p>"+ "<a id=\"one\" class=\"class_a\">ONE</a>"+ "</li>"; } $('two').click(function() { showItemsFromDB(element); }); If I click in the first link , I could see in console.log the text "one". OK!! When I click the second one , in the UI I can see the new items (text about the key number and frecuency and a link). If I click in this new link (which is a copy of ), it doesn't do anything...why?? Thanks in advance
|
I have a bit of code where I am looping through all the select boxes on a page and binding a .hover event to them to do a bit of twiddling with their width on mouse on/off. This happens on page ready and works just fine. The problem I have is that any select boxes I add via Ajax or DOM after the initial loop won't have the event bound. I have found this plugin (), but before I add another 5k to my pages with a plugin, I want to see if anyone knows a way to do this, either with jQuery directly or by another option.
|
What is actually taxonomy in wordpress? How and where exactly I can use taxonomy. I have read many google search about it but need someone to just explain in little simple language.
|
I've been reading the codex for WordPress closely and am confused about the vague definitions between what a Taxonomy is and what a Category is. For that matter, term is also a word that is used in the description of Taxonomies, but seems used in a manner that hints that it isn't solely limited to a Taxonomy. Both are described as a way to classify and group together posts. I do understand that Taxonomies are a more general form of categories, but how exactly do they relate to each other? Is there a subtle difference I'm just not picking up on?
|
Let $f:\mathbb{R} \rightarrow \mathbb{R}$ be an injective and continous function. Prove that $f$ is monotone. My proof-trying Since $f$ is injective for all $x_{1},x_{2}\in\mathbb{R}$ there is a $y$ in $\mathbb{R}$ such that $f\left( x_{1}\right) =f\left( x_{2}\right)$. Since $f$ is continous for any $\varepsilon >0$ there is $\delta >0$ such that if $\left| x-a\right| < \delta$ then we have $\left| f\left( x\right) -f\left( a\right) \right| < \varepsilon$. So how can I show $f$ is monotone?
|
I would like to prove the statement in the title. Proof: We prove that if $f$ is not strictly decreasing, then it must be strictly increasing. So suppose $x < y$. And that's pretty much how far I got. Help will be appreciated.
|
If we have $f(x,y)=f(\overline{x}\pm\sigma_x,\overline{y}\pm\sigma_y)$ how is then $$\sigma_f=\sqrt{\left(\frac{\partial{f}}{\partial{x}}\right)^2\sigma_x^2+\left(\frac{\partial{f}}{\partial{y}}\right)^2\sigma_y^2}~~~?$$ I have looked at Wikipedia page but I don't quite understand this approach since I'm not familiar with approximating functions with Taylor series. I have also found that in video it is said that that way of calculating the standard deviation for multivariate functions somehow gives us a average standard deviation but I don't understand why/how.
|
I'm in doubt with one thing: let's imagine that we have $n+1$ quantities, $n$ of them being directly measured, and the other one being related to the first $n$ by a function $f : \mathbb{R}^n \to \mathbb{R}$. If the $x_i$ is one of the quantities being directly measured and if $\Delta x_i$ is it's uncertainty, then I've learned that the uncertainty of the quantity $y = f(x_1, \dots x_n)$ is given by: $$\Delta y=\sum_{i=1}^{n}{\frac{\partial f}{\partial x_i}\Delta x_i}$$ My problem in understanding this is: well, if $f$ is such a function, it's derivative is the linear transformation $df : \mathbb{R}^n \to \mathbb{R}$ given by: $$df=\sum_{i=1}^{n}\frac{\partial f}{\partial x_i}dx_i$$ Where $dx_i : \mathbb{R}^n \to \mathbb{R}$ is given by $dx_i(a_1 \dots a_n) = a_i$. Hence, what we are saying, is that $\Delta y = df ( \Delta x_1, \dots \Delta x_n)$, in other words, we are saying that the uncertainty of $y$ is given by a linear function of the vector of uncertainties of the quantities $x_i$. Why should that be true? I mean, what's the reasoning behind this? I really didn't get the point, my teacher just gave the equation without justifying or anything like that. Any help and reference is appreciated.
|
I managed to encode my USB device having installed TrueCrypt on my Mac. I want to use the device with other Windows/OS X computers that may not have a version of TrueCrypt installed. How do I get my USB to have the traveler disk setup that seems to be easily achievable through Windows, but apparently only there?
|
I need to create a file-based TrueCrypt volume in a 32GB USB pendrive. If I wanted to access my files in offline computers, I'd need to include the TrueCrypt executable in the pendrive as well. I'd like to create a multiplatform disk with all the files required to access my encrypted file-based drive from Windows, Linux, and MAC. TrueCrypt already has an option for this: Options > Traveler Disk Setup (see ). It copies the executable portable app in the (unencrypted) drive, and has an option for including autorun.info files to automate mounting. In linux and MAC versions of TrueCrypt this option is not available I think, but the app can be run in "portable mode". If this worked (never tried), I'd have to include 3 executables in my USB drive: the Windows portable version, the Linux portable version and the MAC portable version. So my questions: Will the portable versions work as intended? The Win TrueCrypt executable certainly does, but what about the MAC and Linux versions? Will I need additional configuration in the host OS, permissions or drivers? I've heard that MAC doesn't support writing to NTFS (lmao). Otherwise this is the best filesystem for the pendrive since it is supported in both Windows and Linux. I could use the old FAT32 but it has a limit of 4 GB per file. My TrueCrypt volume needs to be way larger. So to make the drive RW-able in MAC, I've thought in including the NTFS-3G files in the USB, so that I could install them in a MAC machine should the need arise. Is this a good idea? Will I need admin permissions or make extensive configuration changes? (the MAC machine will not be mine, probably a hotel's or an internet cafe one). If #2 is not a good idea, I could partition the drive and include a Linux bootable distro only to cover the MAC case, and use the NTFS partition normally under Win and Linux. But Windows wont then recognise the second partition in a removable drive. I've read this can be overcomed by removing a "removable media bit" and converting the USB drive in a fixed drive. Is this bit stored or flashed in the USB drive, or is it part of the Windows OS configuration? Will all the partitions be recognised without problems in Linux and MAC? And most importantly, can a MAC run a linux live distro? Regarding #3, I've read about a Lexar tool (BootIt) that flips the bit, will this work with a Kingston pendrive? Thanks in advance.
|
Having a problem with document.getElementById in IE 11 to retrive a div who has a long url as id. Example : <div id="http://localhost:8084/group/control_panel/manage?p_auth=2kVqRblu&p_p_id=swcportaluploadData_WAR_swcportaluploadDataportlet&p_p_lifecycle=1&p_p_state=maximized&p_p_mode=view&doAsGroupId=20182&refererPlid=20185&controlPanelCategory=current_site.content&_swcportaluploadData_WAR_swcportaluploadDataportlet_javax.portlet.action=loadCsvData&_swcportaluploadData_WAR_swcportaluploadDataportlet_fileName=CIS_Contact.xlsx"></div> I am getting a null, but the id is unique. Works as expected on Google Chrome. Where is the fault ? Special characters? PS: It works fine for a simple id : <div id="hello">
|
When creating the id attributes for HTML elements, what rules are there for the value?
|
If on a Saturday someone refers to the "following Tuesday", which Tuesday is being referenced? The closest Tuesday, or the one after? The first one, or the second one?: SAT SUN MON (TUE) WED THU FRI SAT SUN MON (TUE) WED Thanks.
|
At what point does next Tuesday mean the next Tuesday that will come to pass and no longer the Tuesday after the Tuesday that will come to pass? And, when does the meaning switch back?
|
I'm using Ubuntu 12.04 with 3d unity. When I have several windows of the same application (say Nautilus) opened and I click on its launcher (in unity app launcher bar) window previews appear offering me to select which window I want to activate. But sometimes I can't recognize for sure which one I needed by those previews. So I'm clicking one of them. If wrong window is activated I'm clicking the launcher again, and trying next window. But then I found that those previews changed their positions (rotated). So I can't predict those window order to iterate them all without repetition. I would like to disable that "windows preview rotation" feature. Is it possible?
|
When using task switching in the default graphical mode of Ubuntu 12.04, if they are multiple windows of the same kind, eg. multiple Terminal windows, you can see them all together and select which one you want. My problem is that the order of these windows is constantly changed. It follows the "last used" order. I want them in a fix order always; how can I do it?
|
I am doing a very simple camera motion tracking, and I almost always get the errors: E1227 07:10:20.242158 6528 intersect.cc:159] POINT BEHIND CAMERA 1: 01.12694e+07 00000-502884 -2.22473e+07 E1227 07:10:20.244158 6528 intersect.cc:159] POINT BEHIND CAMERA 1: 01.12479e+07 -1.40083e+06 -1.93429e+07 E1227 07:10:20.246158 6528 intersect.cc:159] POINT BEHIND CAMERA 1: 016253.3 -19688.9 -87439.6 Unable to reconstruct position for track #2 'Track.002' Unable to reconstruct position for track #3 'Track.003' Unable to reconstruct position for track #4 'Track.004' like this: The video is simple; little movement and all the tracking points are visible from start to end. Only 8 points so far, I wanted to keep it simple to understand the errors above somehow. First frame: Half way: Last frame: The blue/red lines all look good to me; none loose track, they keep on point. If I check the "Tripod" on the Solve tab, it works, but I get a huge error (Solve error: 11.62 px), which also is very odd to me. If I now change the "Sensor width" to 16.000 and "Focal length" to 17.00 (which is what I think that the Huawei P30 has), then the error just disappears, but I still get a solve error of 13.79. Changing "Sensor width" and "focal length" resolves this error? But why? Im not even sure that the numbers I entered are correct.
|
Whenever I do camera tracking in Blender the reconstruction is always zooming out or not on the axis. I have a great quality camera, but the end results of the camera tracking always has the model sliding. If you have a solution please tell me.
|
Suppose $f$ is continuous and: $$ |f(e^{i \theta})| \leq M $$ Suppose: $$ |\int_{|z|=1}f(z)dz| = 2\pi M $$ I am trying to show that $f(z) = c \bar{z}$ for some constant $c$ with $|c|=M$
|
The problem is: Suppose that $f(z)$ is continuous on a domain $D$ that contains the unit circle, and that $f(z)$ satisfies: $$\vert f(e^{i\theta})\vert \leq M \; \forall \theta \, \in [0, 2\pi )$$ and $$\bigg \vert \int _{\vert z \vert=1} f(z) \text{d}z \bigg \vert =2\pi M $$ show that there exists a $c\in \mathbb{C}$ such that $f(z)=c \bar{z}$ for all $\vert z\vert=1$. I've tried lots of different approaches such as defining a function $g(z)=\frac{f(z)}{\bar{z}}$ and trying to show that $g'(z)=0$ so that $g$ is constant on the circle, or trying to use some bounding theorems for analytic functions to show that $g$ is constant but this requires $g$ to be analytic. Some other methods were using the Cauchy-Riemann equations but I couldn't find any reason why $g$ should be analytic. Any help would be greatly appreciated, thanks!
|
I am designing a PCB which uses a DPDT relay. I actually only need one of the relay contacts, but this relay was cheaper than any equivalent SPST relay I could find. Is there any advantage to connecting the second relay contact either in parallel (as shown in the picture) or in series? Or would it be better to just use one contact and leave the second unconnected? I already know that connecting in parallel will not allow me to double the amount of current the relay can handle, since the two contacts might not switch at the exact same moment. One advantage to connecting in parallel I could think of is that if one of the contacts eventually became stuck open, the circuit would still work as long as the other contact still worked. However, if the contacts were more likely to become stuck closed rather than open, it would actually be better to connect them in series instead. Is one of these modes of failure more common in this type of relay, or is there any other advantage to either connecting the second contact in parallel, series, or not at all? Edit: This relay is used as an auxiliary dry contact output. The user can connect the relay contacts to another device in order to trigger it to do something. The relay will be triggered by some sort of event, turn on for a configurable amount of time (usually no more than a few seconds), then turn off again.
|
I'd like to control a 20 amp, 240 volt AC resistive load with a heavy duty contactor. The contactor I have is a Siemens 3TX7130-0DB03 rated for 30 amps, and DPDT. I was originally going to switch both lines on this relay. But I got to thinking... Would it be easier on the contactor to use both poles in parallel to switch the same line, and leave the other line always powered? What theory or research would support that conclusion? In short... – Schematic created using Which of the above relays will last longer, why, and what other pros and cons are there?
|
Many statistical papers or articles present very nice draws of graphical models. Example: this on LDA from wikipedia or this, pg 7, directly from the paper: I am now writing a paper where I have to introduce a new graphical model. If I try to draw it, say with paint, something very horrible comes out (see my other posts) So I am wondering: which tool use statisticians to draw such nice models in their papers?
|
I am searching for [free] software that can produce nice looking graphical models, e.g. Any suggestions would be appreciated.
|
Whenever I want to open a editor from the terminal i write gedit filename.sh But in this case i cannot write again in the terminal until and unless I close the editor first. But whenever I use the command gedit filename.sh & It returns a value, like this and i get my control back over the terminal without closing the editor. I learnt this trick from an youtube video but that guy didnt mentioned why this occurs and what is the number that is being returned. I am a newbie in linux, so this question may be silly to some pros, but still its my doubt and I will be highly obliged if you kindly help me in this. Thank you.
|
How do I run a program in the background of a shell, with the ability to close the shell while leaving the program running? Lets say my UI is having problems or for some reason, I need to boot up a program from the terminal window, say, nm-applet: nm-applet When it's started, it occupies the foreground of the terminal window. Is there any simple way to run the program in the background without needing to leave the terminal open or have it occupy the whole terminal? On that note, I did find a way to run programs from the terminal and have it allow for other inputs, by appending an ampersand (&) to the command as such: nm-applet & But this isn't much use as any processes started in the terminal are killed once the terminal is closed.
|
Find all solutions that aren’t congruent to each other in modulo $105$ of $53x \equiv 62 \pmod{105}$ I’ve know that this equation has $1$ solution, because $(53 , 105) = 1$. But, how can I find that solution without brute-forcing?
|
When I am faced with a simple linear congruence such as $$9x \equiv 7 \pmod{13}$$ and I am working without any calculating aid handy, I tend to do something like the following: "Notice" that adding $13$ on the right and subtracting $13x$ on the left gives: $$-4x \equiv 20 \pmod{13}$$ so that $$x \equiv -5 \equiv 8 \pmod{13}.$$ Clearly this process works and is easy to justify (apart from not having an algorithm for "noticing"), but my question is this: I have a vague recollection of reading somewhere this sort of process was the preferred method of C. F. Gauss, but I cannot find any evidence for this now, so does anyone know anything about this, or could provide a reference? (Or have I just imagined it all?) I would also be interested to hear if anyone else does anything similar.
|
I'm trying beamer for the first time (but have some experience with LaTeX). I want to use \pause and number some problems, but the numbers increment when I don't want them to. There must be a simple way to fix this, but I haven't found it yet. Here is an example of code \documentclass{beamer} \usetheme{Madrid} \newcounter{bar} \newcommand{\pbctr}{% \stepcounter{bar}% \thebar} \begin{document} \begin{frame}{Some examples and problems} \begin{block}{Problem \pbctr} \begin{enumerate} \item How many divisors does the number 2 have? \pause \item How many divisors does the number 4 have? \pause \item What is the smallest number with six divisors? \end{enumerate} \end{block} \pause \begin{block}{Problem \pbctr} \begin{itemize} \item Can I distribute evenly 30 apples amongst 5 children \pause \item Can I distribute evenly 33 apples amongst 6 children? \end{itemize} \end{block} \end{frame} \end{document} Any help would be appreciated. code
|
I'm trying to continue the numbering of examples in enumerate environments in beamer. For example, I'd like one slide to feature Foo Bar and the next slide Zip Yadda My strategy so far has been to define a counter that saves the enumerate counter at the end of the first environment and can then be queried to set the enumerate counter at the start of the second enumerate environment. (This is essentially the proposal also found at ) That works wonderfully so long as I don't try to uncover elements of the slide sequentially. The problem, of course, is that as each of the pdf-pages that make up the slide is created, the counter is advanced. Here's a MWE. \documentclass{beamer} \setbeamercovered{highly dynamic} \newcounter{saveenumi} \newcommand{\seti}{\setcounter{saveenumi}{\value{enumi}}} \newcommand{\conti}{\setcounter{enumi}{\value{saveenumi}}} \begin{document} \begin{frame}[<+->] \begin{enumerate} \item foo \item bar% \seti \end{enumerate} \end{frame} \begin{frame}[<+->] \begin{enumerate} \conti \item zip \item yadda% \seti \end{enumerate} \end{frame} \end{document} As the second slide is progressively uncovered (pages 3 and 4 of the resulting PDF), the counter at the beginning of the enumerate environment is advanced each time. So page 3 of the PDF has the right numbering, (3) and (4) respectively, while the fully revealed page has the wrong numbering. Pictures follow: on one of the slides on the following one
|
If a horse pulls the carriage, the carriage should pull the horse with equal force (Newton's third law), then how does the whole system move? I drew the free body diagram but not yet figured what makes the whole thing move. Please give me an explanation.
|
Given Newton's third law, why is there motion at all? Should not all forces even themselves out, so nothing moves at all? When I push a table using my finger, the table applies the same force onto my finger like my finger does on the table just with an opposing direction, nothing happens except that I feel the opposing force. But why can I push a box on a table by applying force ($F=ma$) on one side, obviously outbalancing the force the box has on my finger and at the same time outbalancing the friction the box has on the table? I obviously have the greater mass and acceleration as for example the matchbox on the table and thusly I can move it, but shouldn't the third law prevent that from even happening? Shouldn't the matchbox just accommodate to said force and applying the same force to me in opposing direction?
|
Can I install Ubuntu operating system on my phone (Sony Ericsson w8)? How to install? Does it work properly?
|
With the announcement of the Ubuntu Phone OS I'd like to know what phone (and tablet) models are supported at this time. Note from foss & Oli: We are making this the master question for all future "Will this work on <insert random tablet/phone/device here>?!" questions
|
I have field final result on which on certain values, I only want some of the users to make the changes. The problem is that the user Id which are not mentioned in the formulae are able to get the error message which is correct but those users which are mentioned in the users Id are also not able to change the values which is incorrect. I only want the users mentioned in the formulae to edit the values.Basically I want that if the final result has values (ACCEPTED,REJECTED,ACCEPTED-Team Foundation",the users mentioned in the formuale can change to next stage,rest not. The formula is : AND(NOT(OR(ISPICKVAL(Final_Result__c,"ACCEPTED"),ISPICKVAL(Final_Result__c,"REJECTED"),ISPICKVAL(Final_Result__c,"Accepted-Team Foundation"))),OR(($User.Username <> "005j000000CNXpO"),($User.Username <> "005j000000DM7GK"),($User.Username <> "005j000000DY8DN"),($User.Username <> "005j000000C04vl"),($User.Username <> "005j000000CO3h7"),($User.Username <> "005j000000C0BeQ"),($User.Username <> "005j000000CO3gi"),($User.Username <> "005j000000CO3hC"),($User.Username <> "005j000000CO3iP"),($User.Username <> "005j000000D4hiP")))
|
I have a requirement where a certain field can be edited without the validations firing for a particular user. Now I tried to write rule like LastModifiedId != '005000000000000AAA' but the validation was still firing. Then I realized that until the record saves, the LastModifiedId does not change and the validations still fire, as the LastModifiedId would not be updated to the exempted User. Is there any workaround or a way to check the Id of the User who is currently editing the record?
|
I'm unable to figure out when was the first Dementor created and by whom. I know they don't breed and grow out of despair and gloom and they can't be destroyed. They have been guarding Prison of Azkaban since long time but where did they come from or who created them for the first time?
|
When reading the , I took away the following highlights (emphasis mine): TL;DR - Did Ekrizdis create Dementors? The fortress upon it was originally home to a little-known sorcerer who called himself Ekrizdis. Evidently extremely powerful, but of unknown nationality, Ekrizdis, who is believed to have been insane, was a practitioner of the worst kinds of Dark Arts. Those who entered to investigate refused afterwards to talk of what they had found inside, but the least frightening part of it was that the place was infested with Dementors. Others were afraid of what might happen to the Dementors infesting the building if they deprived them of their home. The creatures were already strong and impossible to kill; many feared a horrible revenge if they took away a habitat where they appeared to thrive. The very walls of the building seemed steeped in misery and pain, and the Dementors were determined to cling to it. The fortress was therefore left abandoned for many years, a home to continually breeding Dementors. Experts explained to him that the only reason the Dementors were (mostly) confined to the island was that they were being provided with a constant supply of souls on which to feed. If deprived of prisoners, they were likely to abandon the prison and head for the mainland. My feeling is that it is possible that Ekrizdis created the Dementors. However, the way the text uses tense and wording it could go either way. It seems that if they were not created on the island that the vast majority of them were hanging around there. Is there any other evidence to confirm the Dementors were created by Ekrizdis rather than just "existing" and being drawn to the island? Related, but does not touch on initial creation and possible link to Ekrizdis: It would not be the first time a dark creature were created; created the first Basilisk. Although, a Basilisk is a physical creature, while a Dementor is more of spirit/embodiment.
|
Suppose I have a list of integers: myList = [1,2,3,4] How would one return every possible combination of these two subsets with Python. For example, set [1,2,3,4] would produce [1,2], [3,4] and [1,3], [2,4] and [1,4],[2,3]
|
I have a list with 15 numbers in, and I need to write some code that produces all 32,768 combinations of those numbers. I've found (by Googling) that apparently does what I'm looking for, but I found the code fairly opaque and am wary of using it. Plus I have a feeling there must be a more elegant solution. The only thing that occurs to me would be to just loop through the decimal integers 1–32768 and convert those to binary, and use the binary representation as a filter to pick out the appropriate numbers. Does anyone know of a better way? Using map(), maybe?
|
Two questions: Show whether $\sum_{n=2}^{\infty} \frac{1}{n \ln(n^3)}$ converges or diverges. According to wolfram, the series diverges by the comparison test, so I tried the following: for $n$ large, we get $n < n \ln(n^3) $ but then $\frac{1}{n} > \frac{1}{n \ln(n^3)}$, which gives me nothing, any tips?
|
Is $\sum_{n=2}^\infty (n\ln n)^{-1}=\infty$ ? This seems like elementary calculus, but I can't figure this out. Can anyone supply a hint?
|
Show that $$\frac1{1\cdot2}+\frac1{2\cdot3}+\frac1{3\cdot4}+\cdots+\frac1{(n-1)\cdot n}=\frac{n-1}{n}.$$ I’m having a really hard time with this question - I can’t start it with one because you can’t divide by zero, and as I go further along I still am struggling. I started with two, so I did the base step, and the induction hypothesis step, how do you prove that K+1 is true? How do I do this process and what’s the answer?
|
I need to prove $\sum\limits_{i=2}^{n}\frac{1}{(i-1)i}$ = $\frac{(n-1)}{n}$ using induction. I am getting stuck midway through the inductive step. Here is what I have: $\forall n\geq 2$, where $n\in\mathbb{N}, P(n)$ is the statement "$\sum\limits_{i=2}^{n}\frac{1}{(i-1)i}$ = $\frac{(n-1)}{n}$". Base case: $\sum\limits_{i=2}^{2}\frac{1}{(i-1)i}$ = $\frac{1}{2}$ = $\frac{(2-1)}{2}$ so $P(2)$ is true. Inductive assumption: Assume $P(n)$ is true. Need to show $\sum\limits_{i=2}^{n+1}\frac{1}{(i-1)i}$ = $\frac{((n+1)-1)}{(n+1)}$. $\sum\limits_{i=2}^{n}\frac{1}{(i-1)i}$ + $\frac{1}{n^{2}}$ = $\frac{(n-1)}{n}$ + $\frac{1}{n^{2}}$ = $\frac{n(n-1) + 1}{n^{2}}$ = $\frac{n^{2}-n+1}{n^{2}}$ I got stuck here and tried working backward from $\frac{((n+1)-1)}{(n+1)}$, which gives me: $\frac{((n+1)-1)}{(n+1)}$ = $\frac{n}{(n+1)}$ Any suggestions on what to do next or where I may be going wrong?
|
I am new to Ubuntu (and Linux in general, as a home installer/user). Do I need to worry about fragmentation of the file system on a Linux partition on one's hard drive?
|
Why is defragmenting unnecessary in Ubuntu?
|
Take $x,y \in (0,\infty), a \in (1, \infty)$. For $a \in \mathbb N $ by binomial theorem it holds $$(x+y)^a \geq x^a + y^a.$$ Trying with some numbers it seems true also for $a \in (1, \infty)$. How can I prove it?
|
Let $x, \ y, \ p$ be any real numbers with $x>0$, $y>0$, and $p>1$. The question is about (most probably) an elementary inequality: Is it always true that $x^p+y^p\leq (x+y)^p$ ? Note that if $p$ is any positive integer, then the above inequality is obviously correct. What about if the number $p \ (\text{with} \ p>1)$ is any non-integer real number? I guess that (by my intuition) the answer should be positive. But how can we proceed to prove this inequality?
|
I need to prove that $x^2\equiv -1\pmod p$ if $p=4n+1$. ($p$ is prime of course...) I need to use Wilson theorem.
|
I came across this problem and I believe Lagrange's theorem is the key to its solution. The question is: Let $p$ be an odd prime. Prove that there is some integer $x$ such that $x^2 \equiv −1 \pmod p$ if and only if $p \equiv 1 \pmod 4$. I appreciate any help. Thanks.
|
My computer has become slow to fully boot since updating to 10.11. This isn't helped by Applications (including their previous windows) reopening automatically post login. I am aware that this is part of the default Mac OS experience and I've seen answers that involve checking a box when restarting, although I would prefer a permanent fix to disable this particular function and any other advice to improve my iMacs startup efficiency.
|
Is there any way to temporarily disable applications from starting up at login? I'm referring to both Lion apps that are started due to the resume/reopen feature, and also to applications set to launch in the Login Items setting. I know that I can disable the apps from launching in Lion by unchecking the relevant checkbox right before I shut down, but what if I forget to do this, or if I decide I don't want them to start up right before I login? To clarify: I'm looking for a one-time, temporary solution rather than something that will disable them all the time.
|
Although Ubuntu 15.10 (Wily) Beta1 has been , I can't see a stand-alone image that I can try to install. (I'm in particular interested in using ; therefore just from an already installed system is not suitable for me.)
|
I've got a 32-bit Ubuntu installation running on 64-bit hardware. Now that , I would like to switch to 64-bit without having to reinstall the OS. This is one of the : Shawn installed his system using the 32-bit version of Ubuntu, but his hardware is 64-bit and he wants to switch over. He manually installs the amd64 versions of dpkg and apt, replacing the i386 versions and changing which architecture is used as the default; then he installs the amd64 ubuntu-minimal package; then he installs the amd64 ubuntu-desktop package. Over time the remaining i386 packages are replaced automatically on upgrade. However, when trying to follow the instructions in there, I cannot find any 64-bit version of dpkg or apt. Did this user story got implemented in a different way in the final spec, or do I need to do something differently? In short, how can I switch my 32-bit installation to 64-bit?
|
Let $K/F$ be a Galois extension. Also, let $E_1$ and $E_2$ be two Galois extensions of $F$ in $K$ with $E_1E_2 = K$ and $E_1 \cap E_2 = F$. Prove that $G = \text{Gal}(K/F) \cong \text{Gal}(K/E_1) \times \text{Gal}(K/E_2)$. I think this is just an application of results of the Fundamental theorem of Galois theory (and maybe the Chinese Remainder Theorem?), but I'm uncertain on how to prove it. Since we know $E_1/F$ and $E_2/F$ are Galois extensions, we have $\text{Gal}(K/E_1)$ and $\text{Gal}(K/E_1)$ are normal subgroups of $G$. We get $\text{Gal}(E_1/F) \cong G/\text{Gal}(K/E_1)$ and similarly $\text{Gal}(E_2/F) \cong G/\text{Gal}(K/E_2)$. I don't know what to do from here, or if these statements if even help. Thoughts?
|
I'm just wondering if the following theorem is reasonable and whether the proof is makes sense or not? Also I have an application of it which I was trying to do earlier but I made a lot of mistakes so I would be very grateful if anyone would give some comments on this in case I have some very strong misunderstandings about Galois theory. Theorem Let $E_1$ and $E_2$ be Galois field extensions of $F$ with trivial intersection ($E_1 \cap E_2 = F$), then $E_1 E_2$ has Galois group $\text{Gal}(E_1/F) \times \text{Gal}(E_2/F)$. Proof $E_1$ and $E_2$ are splitting fields (over $F$) of some polynomials $f_1$ and $f_2$ so $E_1 E_2$ is the splitting field of $f_1 f_2$ over $F$ and therefore it is Galois and we are justified using the "Gal" notation. Let $\sigma_1 \in \text{Gal}(E_1/F)$ and $\sigma_2 \in \text{Gal}(E_2/F)$ then by the fundamental theorem of Galois theory we can lift these both into elements of $\text{Gal}(E_1 E_2/F)$. The claim is that $\sigma_1 \sigma_2 = \sigma_2 \sigma_1$, to see this consider an element $\alpha \in E_1$, we have both $\sigma_2 \alpha = \alpha$ and $\sigma_2 \sigma_1 \alpha = \sigma_1 \alpha$ because it is invariant with respect to $\sigma_2$, but we can combine these equalities to get $\sigma_1 \sigma_2 \alpha = \sigma_2 \sigma_1 \alpha$. Both groups $\text{Gal}(E_i/F)$ ($i = 1,2$) are included in $\text{Gal}(E_1 E_2/F)$ and the degrees say there are no more elements, furthermore since they commute we can conclude $\text{Gal}(E_1 E_2/F) = \text{Gal}(E_1/F) \times \text{Gal}(E_2/F)$. So hopefully that theorem is, if not correct, fixable.. and can be used to prove that $\mathbb Q (\sqrt{a_1},\sqrt{a_2},\cdots,\sqrt{a_n})$ has Galois group $C_2^m$ ($m \le n$) over $\mathbb Q$?
|
Is there ever a benefit to preceding a path with ./ (dot slash)? In most cases, cd ./home is equivalent to cd home (and also cd ./././././home). Is there ever a case where these two paths would NOT evaluate to the same path? Is there some benefit or drawback to either having or NOT having ./ at the beginning of a folder or file path? What if from inside a program or script, I wanted open a config file, i'm hard coding a file to open, should it be: resource/config.txt OR ./resource/config.txt Does POSIX (or common Unix implementations) give any semantic difference between opening these two paths?
|
What's the difference between du -sh * and du -sh ./* ? Note: What interests me is the * and ./* parts.
|
I am using WinShell as editor for my Latex text. I use GiHub to share my test with others. My problem is in my WinShell the text is wrapped correctly. But in GiHub, the text appears not the same. The paragraph appears in one extremely long line. This is causing me problems because when someone edits a word, the whole paragraph is marked as changed instead of that line only. It seems GitHub is not able to get the wrapping that is done in my WinShell editor. How can preserver the text wrapping mode from WinShell to GiHub?
|
It seems that hard-wrapping - i.e. inserting a newline when the line reaches a certain threshold - is extremely common in the LaTeX source when writing technical papers, either by manually inserting it or by letting the text editor take care of it. After years of writing text in soft-wrapping environment (text is displayed wrapped, but no newline is actually inserted), I find it hard to understand why hard-wrapping is so commonly used. I think understanding the reason(s) behind it will make me less resentful about using it. What are the disadvantages and advantages of using hard-wrap vs. soft-wrap, and why is hard-wrap so commonly used with LaTeX?
|
I am a beginner in XML language. I am learning XML in Android studio at school. Example, <Person> <sex ="female"></sex> <firstname = "Hani"></firstname> <lastname = "Jeong"></lastname> </Person> in this case, all the values are hidden from users, right? What I am really confused about is that I understood that attributes must always have values. Which common situations do you hide the values or show the values to users?
|
At work we are being asked to create XML files to pass data to another offline application that will then create a second XML file to pass back in order to update some of our data. During the process we have been discussing with the team of the other application about the structure of the XML file. The sample I came up with is essentially something like: <INVENTORY> <ITEM serialNumber="something" location="something" barcode="something"> <TYPE modelNumber="something" vendor="something"/> </ITEM> </INVENTORY> The other team said that this was not industry standard and that attributes should only be used for meta data. They suggested: <INVENTORY> <ITEM> <SERIALNUMBER>something</SERIALNUMBER> <LOCATION>something</LOCATION> <BARCODE>something</BARCODE> <TYPE> <MODELNUMBER>something</MODELNUMBER> <VENDOR>something</VENDOR> </TYPE> </ITEM> </INVENTORY> The reason I suggested the first is that the size of the file created is much smaller. There will be roughly 80000 items that will be in the file during transfer. Their suggestion in reality turns out to be three times larger than the one I suggested. I searched for the mysterious "Industry Standard" that was mentioned, but the closest I could find was that XML attributes should only be used for meta data, but said the debate was about what was actually meta data. After the long winded explanation (sorry) how do you determine what is meta data, and when designing the structure of an XML document how should you decide when to use an attribute or an element?
|
What I want to know is the relationship that lubricants have with viscosity. Is viscosity the cause of lubrication? The higher the viscosity, the more lubrication? And why not water instead of oil?
|
How come mineral oil is a better lubricant than water, even though water has a lower viscosity? When two surfaces slide over each other with a gap filled with a fluid, the different layers of the fluid are dragged at different speeds. The very top layer touching the top metal surface will have the same speed as the surface itself, while the bottommost layer is stationary. The speed in the layers between is distributed linearly and there exist friction forces between those layers that slow the movement. Those frictional forces should be reduces however, if a fluid with a lower viscosity is chosen. How come this is not so? Does it have to do with water's polarity, so that it sticks to surfaces in a different way than oil?
|
I've edited to include a link into exerpt. But it shows Markdown source of the link instead of actual link. How do I preview the exerpt while editing it? Where to find syntax and available Markdown features in exerpts? How do I include the link properly?
|
The Stack Exchange (Personal Productivity) markdown is showing literally rather than as a named link. Don't know why.
|
I recently set up a new dual-boot system with Ubuntu and Windows 10. The computer has an internal 256gb SSD, which contains the operating system partitions, and a 2tb HDD, formatted NTFS, which contains files that are shared between the two systems. The NTFS volume is mounted in fstab as /DATA/, and this folder appears in the Ubuntu file explorer: Text and image files on the volume can be edited without issue, and some programs can access it just fine -- for example, Firefox will save files to /home/[user]/Download, which is a symlink to /DATA/Downloads. I have several video files of different types on this volume, and none of them are able to play with VLC, nor are they able to play with the pre-installed Videos application. This error message appears when attempting to open the video files in VLC: I tried to find the log file, but despite turning on the log-to-file option (With debug verbosity) in preferences and supplying a non-read-only path for the file, no log file appeared. If I move the video files out of /DATA/ and onto the ext4 volume, they play without issue. It may also be worth noting that video files on the Windows system partition, which is also NTFS but is NOT mounted in fstab and is accessed through "Other Locations," play without issue. Upon further investigation, multiple applications that have the option to open files using a "Browse" feature are unable to access the /DATA/ folder. Here is a screenshot of the file explorer interface when attempting to open a video file through an already-open VLC window: As you can see, /DATA/ is absent. This screenshot is of the file browser in Discord, which is also unable to access the /DATA/ folder: The drag-and-drop functionality in Discord also does not work. The entry for this drive in /etc/fstab is the following: UUID=[redacted] /DATA ntfs defaults,uid=1000,gid=1000 0 0 I also tried using this alternative line, following an online tutorial, but it didn't seem to change anything. UUID=[redacted] /DATA ntfs-3g defaults,nls=utf8,uid=1000,gid=1000,umask=022 0 0 Thanks in advance for any help! I'd like to use Ubuntu more, but this pesky issue is unfortunately causing me to stay on the Windows side of my machine more than I'd like. EDIT: It has been suggested that this issue is a duplicate of an issue relating to snaps accessing removable media. The fix for this other issue is changing a setting within Ubuntu Software; however, I found this setting to be set to the "correct" value by default. Curiously, even with the setting enabled, the snap version of VLC is still unable to access actual removable media (in addition to the non-removable drive mounted to /DATA/), so it appears that this option does not function properly for VLC at all. The apt-get version, however, can access everything.
|
I have Ubuntu 18.04 LTS installed. I inserted USB-flash to my laptop. It was automounted to /media/username/DISKLABEL and opened in Nautilus. I can read and write objects to it. How can I access it from the application, which is installed as Snap? I tried snaps of the following applications such as gedit, arduino-mhall119, organize-my-files. All them show me errors if I navigate to /media folder: Could not read the contents of Media Error opening the directory of '/media': permission denied Output of active Snap is below: $ snap interfaces | grep -v ".*-$" Slot Plug :browser-support organize-my-files :core-support core:core-support-plug :cups-control gedit :desktop gedit,organize-my-files :desktop-legacy gedit,organize-my-files :gsettings gedit,organize-my-files :home arduino-mhall119,gedit,organize-my-files :network arduino-mhall119,gedit,organize-my-files,pulsemixer :opengl organize-my-files :pulseaudio organize-my-files,pulsemixer :unity7 arduino-mhall119,gedit,organize-my-files :wayland gedit :x11 arduino-mhall119,organize-my-files,pulsemixer gnome-3-26-1604:gnome-3-26-1604 gedit gtk-common-themes:gtk3-themes gedit gtk-common-themes:icon-themes gedit gtk-common-themes:sound-themes gedit - arduino-mhall119:serial-port - gedit:avahi-observe - gedit:mount-observe Updates: connecting mount-observe to Gedit with snap connect gedit:mount-observe does not help. it seems that we need special Snap with support of interface.
|
Let $R$ be a ring, and $M$ an $R$-leftmodule. Let $\operatorname{Ann}_R(M)$ be the annihilator of M, meaning that $r m = 0 \space\space\space\space \forall r \in \operatorname{Ann}_R(M), m \in M$. Let $I \subseteq \operatorname{Ann}_R(M)$ be a two-sided ideal. Show that M is naturally an $R/I$-module. Thanks in advance! I'm not that used to annihilators, so any help would be appreciated.
|
Suppose that $I$ is a two-sided ideal in the ring $R$, and that $M$ is a module over the quotient ring $R/I$. Why can we naturally regard $M$ as a $R$-module that is annihilated by $I$? Conversely, suppose that $M$ is a $R$-module annihilated by $I$. Why is $M$ naturally a module over $R/I$?
|
At a suitable reputation level, please could users be allowed to post short comments? By suitable level I'm thinking of 7,500 reputation, and by short I mean 8 to 10. At 7,500 rep, there hasn't been a privilege for a while, and there won't be for a while. On top of that, at that level users will know what is appropriate in a comment and what isn't. Sometimes (not often) I find myself needing to post a short comment, and I end up adding ...... to it. Not only does it look unprofessional, it can confuse new users as to what the dots are there for. I suggest 8 to 10 letters, because "Thank you" is 9 characters. I know that comments aren't meant to stick around, but sometimes it doesn't hurt to thank someone who edited in what you suggested - or tell someone that you've edited their suggestion in.
|
Surprisingly it seems no one asked this before. Not long ago I asked a question on the site, and in a comment I was asked "what version of jQuery are you using?". The answer is obviously less than 15 characters. So I had to do something like this "I am using version 1.9.1" instead of just "1.9.1". I see this a lot, so why not allow shorter comments? I guess the idea is to force people to give more thorough comments and not just small quirks, but I think it reasonable to allow users with a ceratin amount of reputation to give shorter comments, because sometimes it just makes more sense and you don't really need 15 characters
|
I was working in the Windows 7 OS previously, now i shifted to the ubuntu 14.04 version. I had important file on D && E drive of Windows 7 which i couldn't take backup. How to recover those data in Ubutnu? (I had choose the only ubuntu option while installing the ubuntu)
|
I have a Toshiba satellite A-200 laptop with a Vista OS on it with 4 NTFS partitions (C:) Vista (D:) Entertainment (E:) Work (F:) Sources and I wanted to start using Ubuntu instead. So I tried it first from the live CD and everything was OK and all the partitions were shown and working and so I decided to install Ubuntu to replace Vista on the (C:) drive. After I did that I can no longer find my folders and files on the (D:), (E:), (F:) partitions and the only file system that is shown is one 198 GB although my HDD is 320 GB. I can't access the lost data on the remaining 120 GB which I hope is still there and not totally lost I am now working from the live CD but I am unable to install testdisk. Can I recover the Vista partitions by the product recovery CD to get my laptop back to the factory settings? Can I recover the NTFS partitions using a recovery program for Windows or will that make the problem worse? I need these data badly as I don't have a backup for them.
|
I have python 2.7 and 3.4 versions installed. But when I say say "python -V", it shows version as 2.7 not 3.4 How to tell ubuntu to use newest python? where is this setting configured ?
|
The python program command executes Python 2. Python 3 can be executed using the python3 command. How can Python 3 be executed using the python command?
|
I was searching to learn which traits (e.g., hair color, intelligence, weight, etc) are and which are not normally distributed. In the lecture notes for some course on a university website (unfortunately I don't have the link), a college professor had stated that complex traits are normally distributed. But then I came across an answer on Quora to someone asking what besides height and intelligence is normally distributed A supposed statistician had replied that "Actually, nothing is described by a normal distribution.It approximately describes heights of people so long as they are all male or all female and not a mixture of East African Negros, West African Pygmies and Europeans." He went on to say that a large sample, however, with no outliers can approximate normal distribution. So I am confused. So can anything, if the sample is large enough, approximate normal distribution? And yet nothing is normally distributed to begin with?
|
I am a grad student developing an interest for statistics. I like the material over-all, but I sometimes have a hard time thinking about applications to real life. Specifically, my question is about commonly used statistical distributions (normal - beta- gamma etc.). I guess for some cases I get the particular properties that make the distribution quite nice - memoryless property of exponential for example. But for many other cases, I don't have an intuition about both the importance and application areas of the common distributions that we see in textbooks. There are probably a lot of good sources addressing my concerns, I would be glad if you could share those. I would be a lot more motivated into the material if I could associate it with real-life examples.
|
Is there any way I can find the specific reasons my question is being down voted for? I get it that I am not communicating my questions adequately but without specific feedback it is hard to improve. Apparently down votes are not close votes. But where do I see the close votes? [Update] My question is not about how do I work out for myself the problem with the question I asked. The question is about whether the reason for the down votes can be looked up. (They can't be as I explain below )
|
I am trying to improve my skill at asking questions, so I would like to ask feedback on a question I asked that was downvoted. Why do you think I got downvoted?
|
I need shapefiles for all administrative levels like country level, state level, division level and city level for all countries of the world?
|
After learning about the datasets I've working with the following layers, from the USA data Country boundaries State boundaries County boundaries City boundaries ZipCode/Postcode boundaries What I am trying to find is the equivalent (where appropriate) of the same data for various countries. Is there any free administrative boundaries available as shapefiles for other countries?
|
fairly new to Ubuntu and I've spent the last couple days working to get everything set up and running as smoothly as I can. I wasn't getting audio through my motherboard sound-card, and was following troubleshooting guide, which ended up solving my problems. However, I now have a bunch of programs that weren't there previously. My question is do I need them, and if not, how do I go about removing them? They are as follows - Echomixer Envy24 Control HDAJackRetask HDSPConf HDSPMixer Rmedigicontrol I hadn't used any of these during my audio troubleshooting, (only used Pavucontrol in the end) but figured I'd ask first. I have also tried purging a few through terminal commands by their name, but would receive "Unable to locate package." Not sure what to do. I'm on 18.04.1, if that's relevant.
|
Simple enough question: is there some shell command (or GUI method) I can use that, given the path to a file on my system, tells me what package put it there? Assuming the file did in fact come from a package, that is. Bonus question: what if it's a file that isn't installed on my system? Is there, say, a website that will let me look up a file and see what packages, if any, provide it?
|
I'm trying to install JDK on ubuntu 14.04 LTS. I downloaded it from oracle website. Than I extracted it and moved in usr/lib/java. It says java doesn't exist but it does. I use this video
|
I want to install Oracle's JRE and to update to the latest version with the Software Updater when they released. Is there a Ubuntu package that is provided by Canonical or Oracle? Before release Java 7, I followed to install Java 6. But it doesn't work for Java 7. There is no package sun-java7-xxx. How can you install Java 7?
|
A simple question but I know two conflicting rules on this: Multiplication is stronger that dividing: $8:4\times2=8:8=1$ Dividing is the same as multiplication with the inverse: $8:4\times2=8\times4^{-1}\times2=4$ Which rule should rule? Sorry if it is a duplicate.
|
There is a huge debate on the internet on the value of $48\div2(9+3)$. I believe the answer $2$ as I believe it is part of the bracket operation in BEDMAS. yields the same answer. I also believe that if $48\div2\times(9+3)$ was asked it would be $288$ which Mathway agrees with as well. However, says it is $288$ either way. A friend of mine (who is better at math) told me that there is no such thing as 'implicit multiplication', only shorthand so that is in fact done after the division (going left to right, not necessarily because division occurs before multiplication. But he didn't explicitly give a reason) What is the answer and why?
|
If $p$ is congruent to $2 \pmod 3$, how can I prove that all $a$, $1 \le a \le p-1$ are cubic residues $\mod p$? Here's what I've done: $1^3$ congruent to $1 \pmod p$ thus, 1 is a cubic residue, Also $(p-1)^3=(p-1) \pmod p$ implies $$(p-1)^3 - (p-1) = (p-1)[(p-1)^2 -1] = (p-1)(p^2 -2p) = p(p-1)(p-2) $$ implies $$p|(p-1)^3 -(p-1)$$ Thus $p-1$ is a cubic residue $\mod p$. Now I don't know how to show for $1\lt a \lt p-1$ are all cubic residues when $p$ is congruent to $2\pmod 3$.
|
This problem is from "An Introduction to Number Theory" by Ivan Niven. Define a to be a cubic residue if $x^3 \equiv a \mod p$ has solutions. Prove that if $p=3k+2 ,$ then every number that is in reduced residue system is a cubic residue. And if $p=3k+1$, only one-third of the reduced residues are cubic residues.I did find a solution . But, I've not covered the portion in the book after section 2.5(self-study). I attempted the question in the following way and would appreciate any hints to reach to conclusion: As $B=\{1,2,\dots ,p-1\}$ is a reduced residue system, it should be enough to prove that $i^3 \equiv j^3\mod p \Rightarrow i\equiv j\mod p$. So, one part of it boils down to If $p=3k+2$, then show that $p \nmid i^2+j^2+ij $, if $i\neq j \wedge i,j \in B$. I have no idea how to use the $p=3k+2$ part for proving this.
|
I'm looking for some software to monitor packet loss or packet retries. Preferably something that continuously monitors vs. a testing approach and preferably free. My server's OS is debian. I'm not sure if wireshark can do this since I don't have access to a graphical interface on my server, only text/SSH. Any suggestion please ?
|
How can I passively monitor the packet loss on TCP connections to/from my machine? Basically, I'd like a tool that sits in the background and watches TCP ack/nak/re-transmits to generate a report on which peer IP addresses "seem" to be experiencing heavy loss. Most questions like this that I find of SF suggest using tools like iperf. But, I need to monitor connections to/from a real application on my machine. Is this data just sitting there in the Linux TCP stack?
|
i have a client that wants to migrate his data to sql server 2016 . currently they have 2008r and the databases are huge(total of 4 tb) on the instance. what is the best way to performe this with the least amount of down time? i thought about mirroring but im not sure it can be done between the two versions. if so what are the steps to do so ? if im missing information please let me know. thanks
|
Problem definition Our database server needs to be transferred to an other datacenter. It runs on Microsoft SQL Server 2012 Enterprise (64-bit) and contains two databases of about 2TB and 1TB. Having little to no downtime for this would be ideal. Workload Those databases are used for a .NET website and are constantly getting updated. Having it not available over the weekend would be acceptable though. The currently in use DB would remain the only one in use until the switch over to the new one. That switch would ideally be made just by changing DNS entries to point to the new DB server while making sure the DB is not being updated. Also, time taken by this operation does not really matter as long as the switch from one server to the other (downtime) is kept low. Approaches considered Backup and restore This has been done in the past but involved a high downtime even though it was done through an internal network, so more efficiently than through Internet Log shipping As far as I understand, this approach would minimize downtime by configuring a master/slave and transferring an exact copy of the master DB to its slave being read only. As mentioned above, no access to the slave would be necessary and we just need a way to have a replica of the master DB without data corruption. It also seems to be quite efficient in terms of resources utilization and wouldn't impact to much the master performance. I might be wrong about this approach so feel free to correct me. Database mirroring I'm not too aware of that approach but it seems like a valid option. No need to have real time sync and performance of the master is quite important so asynchronous would be the way to go if this approach were to be chosen. Other options? That server runs directly on bare metal hardware so lower level solutions are unfortunately not an option. Maybe there is a better way to get this done? Constraints As described, those databases are quite big to the point they are hard to maintain but that's an other problem. The versions of SQL Server will be the same (Microsoft SQL Server 2012 Enterprise 64-bit). It will have to be transferred over network between two datacenters so most probably over Internet. Having disks sent from one site to the other for an initial sync is unfortunately not an option. Having some sort of security for the transfer would be ideal but we will do the best of this situation. That should give a quite good overview of our needs for this task and hopefully some of you had to face that situation before.
|
I'm trying to study this sequence of functions: $f_n(x) = nxe^{-nx}$ for $x \in [0,1]$ i ended up with the point convergence -> $f(x) = 0$ uniform convergence The function doesn't have the uniform convergence to $f(x) = 0$ in $[0, 1]$. Becouse during the study of the convergence if found that the $sup_{x \in [0,1]}|f_n(x) - f(x)| = \frac{1}{n}$ and for this $x=\frac{1}{n}$ the $\lim\limits_{n \to +inf}e^{-1} \not= 0$ I think that that's ok but I know that a correct and complete study of the sequences of functions include the analisys of the uniform convergence in other sub-ranges $[\alpha, \beta] ⊂ [0, 1]$. I don't know how to do this in a step-by-step way, but i think that in this case the uniform convergence is present in $[0, a] ⊂ [0, 1]$ with $a<\frac{1}{n}$ $[b, 1] ⊂ [0, 1]$ with $b>\frac{1}{n}$ where $\frac{1}{n}$ is the max value assumed by the function at index $n$ of the sequence. Am i right or thats a wrong idea?
|
Why isn't $nxe^{-nx}$ uniformly convergent for $x \geq 0$? The definition of uniform convergence states that $f_n$ is uniformly convergent if $$\lim_{n\to\infty} ||f_n-f|| = 0.$$ I apply the definition with $f = 0$ and get $$\lim_{n\to\infty}||\frac{nx}{e^{nx}} - 0 || = 0,$$ since $e^{nx}$ grows much faster than $nx$ regardless of $x$ (except when $x = 0$, but if that's the case everything is $0$). Where am I wrong?
|
I am using bibtex to render my references in the paper. I have a problem in rendering the authors' first names. The bibtex references I am directly copying from Google Scholar. As an example, see the following bibtex entry: @article{harikrishnan2006non, title={A non-subjective approach to the GP algorithm for analysing noisy time series}, author={Harikrishnan, KP and Misra, Ranjeev and Ambika, G and Kembhavi, AK}, journal={Physica D: Nonlinear Phenomena}, volume={215}, number={2}, pages={137--145}, year={2006}, publisher={Elsevier} } Here, the authors' first names' abbreviations are written as KP and AK. However, in my pdf file, they appear as K and A respectively. One way to resolve this is to put space between these strings: K P and A K. However, I have a very long list of references and I think there has to be a better way to force bibtex to render these first names properly. Any ideas?
|
BibTeX can abbreviate first names, e.g. change Smith, John to J. Smith. In some languages, certain (not all) first names must be abbreviated (it's not optional as in the case of Ch. for Charles). How can I force BibTeX to do this for particular first names? EDIT: I encounter this all the time, including for my own name which should be abbreviated Sz rather than S. I used to work around the problem by hand editing the reference list in the final version of the paper, but I'd prefer using BibTeX for everything if possible. Requested example: .tex file: \documentclass{article} \begin{document} Text \cite{kovacs, smith}. \bibliographystyle{abbrv} \bibliography{references} \end{document} .bib file: @Book{smith, author = "Peter Smith", title = "Title 1", year = 1980, publisher = "Addison-Wesley" } @Book{kovacs, author = "Csaba Kov\'{a}cs", title = "Title 2", year = 1986, publisher = "Addison-Wesley" } The output I get: Text [1, 2]. References [1] C. Kovács. Title 2. Addison-Wesley, 1986. [2] P. Smith. Title 1. Addison-Wesley, 1980. I need to tell bibtex that for Csaba Kovács I need to get Cs. Kovács in the output, and not C. Kovács, as this is incorrect. The document is in English, so this is not a babel-issue. This applies only to certain author names, and it's because in Hungarian C and Cs are considered to be distinct units of the alphabet.
|
I'm a new programmer and trying to teach myself Java by doing random projects. Below is a "Rock, Paper, Scissors" game and the issue that I'm facing is after printing "a", the program ends and does not continue onto the if else statements below. Any help that can be given would be greatly appreciated. package com.company; import java.util.Scanner; public class Main { public static void main(String[] args) { System.out.println("Hello & Welcome to Rock, Paper, Scissors. What's your name?"); Scanner scan = new Scanner(System.in); String userChoice = scan.nextLine(); System.out.println("Hello, " + userChoice + ". Let's start a game!"); Scanner scan = new Scanner(System.in); System.out.println("Choose one: Rock, Paper, Scissors"); String userFirstChoice = scan.nextLine(); System.out.println("You chose " + userFirstChoice); double a = Math.random(); System.out.println(a); if (a >= 0.00 && a<= 0.3){ if ( userFirstChoice== "Rock"){ System.out.println("Rock vs Rock: TIE"); } else if (userFirstChoice == "Paper"){ System.out.println("Rock vs Paper: YOU LOSE!"); } else if (userFirstChoice == "Scissors"){ System.out.println("Rock vs Scissors: YOU WIN!"); } } else if (a>=0.3 && a<=0.6){ if(userFirstChoice == "Paper"){ System.out.println("Paper vs Paper: TIE!"); } else if (userFirstChoice == "Rock"){ System.out.println("Rock vs Paper: YOU LOSE!"); } else if(userFirstChoice == "Scissors"){ System.out.println("Scissors vs Paper: YOU WIN!"); } } else if (userFirstChoice == "Scissors"){ System.out.println("Scissors vs Scissors: TIE!"); } else if (userFirstChoice == "Paper"){ System.out.println("Paper vs Scissors: YOU LOSE!"); } else if (userFirstChoice == "Rock") { System.out.println("Rock vs Scissors: YOU WIN!"); } } }
|
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?
|
In Python if a = 1 b = 1 print(a is b) returns True. However, if c = 1.23 d = 1.23 print(c is d) returns False. It appears for the float data type the output is False. Can someone explain to me why does python behave this way? a = 1 b = 1 print(a is b) #Output: True c = 1.23 d = 1.23 print(c is d) #Output: False
|
Why does the following behave unexpectedly in Python? >>> a = 256 >>> b = 256 >>> a is b True # This is an expected result >>> a = 257 >>> b = 257 >>> a is b False # What happened here? Why is this False? >>> 257 is 257 True # Yet the literal numbers compare properly I am using Python 2.5.2. Trying some different versions of Python, it appears that Python 2.3.3 shows the above behaviour between 99 and 100. Based on the above, I can hypothesize that Python is internally implemented such that "small" integers are stored in a different way than larger integers and the is operator can tell the difference. Why the leaky abstraction? What is a better way of comparing two arbitrary objects to see whether they are the same when I don't know in advance whether they are numbers or not?
|
I'm talking about this web part. This web part displaying a few posts (description + title).
|
When i'm creating blog subsite i have app named 'Posts'. Is there any way to use this app in team site? That's what i mean:
|
I have been searching for an answer to this problem, and found a number of other similar questions. However, I believe I followed the code in the accepted answers and I'm still throwing a NullPointerException error when I try to run it. The question I looked at was . This was the code suggested for getting a column value from a cursor: String id = cursor.getString( cursor.getColumnIndex("id") ); The answer made sense to me so I adapted it for my own function: public String getSubjectId(String subject, String level) { SQLiteDatabase db = this.getWritableDatabase(); Cursor subjectCursor = db.rawQuery("SELECT * FROM " + SUBJECTS_TABLE_NAME + " WHERE " + SUBJECTS_COL_2 + " = " + subject + " AND " + SUBJECTS_COL_3 + " = " + level, null); String id = subjectCursor.getString(subjectCursor.getColumnIndex("ID")); return id; } When I run this I am throwing a NullPointerException error. I can't see a problem with the code and am confused about what the error means here. My understanding of the error is that it occurs when a variable is declared but it does not create an object, but I can't see where I have done that in my code. An explanation of what I have done wrong to trigger this error would be much appreciated, as I believe I have followed a number of online tutorials accurately. Edit: I'm aware of but my issue is I can't see a place where I am assigning an object as null so the solution isn't helping me.
|
What are Null Pointer Exceptions (java.lang.NullPointerException) and what causes them? What methods/tools can be used to determine the cause so that you stop the exception from causing the program to terminate prematurely?
|
As the title says, how would I obtain the vector $\mathbf t$ if the vector $\mathbf i$ and the refractive indices are known? I've tried for hours but I keep getting stuck. Is there an equation readily available? Thank you.
|
Snell's law of refraction at the interface between 2 isotropic media is given by the equation: \begin{equation} n_1 \,\text{sin} \,\theta_1 = n_2 \, \text{sin}\,\theta_2 \end{equation} where $\theta_1$ is the angle of incidence and $\theta_2$ the angle of refraction. $n_1$ is the refractive index of the optical medium in front of the interface and $n_2$ is the refractive index of the optical medium behind the interface. How can this be expressed in vector form: \begin{equation} n_1(\textbf{i} \times \textbf{n}) = n_2 (\textbf{t} \times \textbf{n}) \end{equation} where $\textbf{i}(i_\text{x}, i_\text{y}$ and $i_\text{z})$ and $\textbf{t}(t_\text{x}, t_\text{y}, t_\text{z})$ are the unit directional vector of the incident and transmitted ray respectively. $\textbf{n}(n_\text{x}, n_\text{y}, n_\text{n})$ is the unit normal vector to the interface between the two media pointing from medium 1 with refractive index $n_1$ into medium 2 with refractive index $n_2$. Further more how can the Snell's law of refraction be expressed$^\text{1}$ in the following way? \begin{equation} t = \mu \textbf{i} + n\sqrt{1- \mu^2[1-(\textbf{ni})^2]} - \mu \textbf{n}(\textbf{ni}) \end{equation} Here $\mu = \dfrac{n_1}{n_2}$ and $\textbf{n}\textbf{i}= n_{\text{x}} i_{\text{x}} + n_{\text{y}}i_{\text{y}} + n_{\text{z}} i_{\text{z}}$ denotes the dot (scalar) product of vectors $\textbf{n}$ and $\textbf{i}$. References: Antonín Mikš and Pavel Novák, Determination of unit normal vectors of aspherical surfaces given unit directional vectors of incoming and outgoing rays: comment, 2012 Optical Society of America, page 1356
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.