|
Thread Rules 1. This is not a "do my homework for me" thread. If you have specific questions, ask, but don't post an assignment or homework problem and expect an exact solution. 2. No recruiting for your cockamamie projects (you won't replace facebook with 3 dudes you found on the internet and $20) 3. If you can't articulate why a language is bad, don't start slinging shit about it. Just remember that nothing is worse than making CSS IE6 compatible. 4. Use [code] tags to format code blocks. |
On October 14 2014 07:26 Spazer wrote: It's a common story. Almost happened to me too. It's just so damn easy to have too big of a scope. I wish just once I could start a project that took me as long as I thought it was going to...
Maybe some day. It's a nice dream.
|
|
|
Hyrule19173 Posts
a proper estimate is "between now and the heat death of the universe"
|
On October 14 2014 04:23 FFGenerations wrote: er.... guys did you know gmail just started blocking 7zip (zip) files that contain vbs files? i saved all my work by emailing myself vbs inside 7zip and now all my archived files are deleted by gmail?????????
could have lost a weeks worth of work due to formatting and thinking my files were not going to be randomly fucking DELETED by my email service
If you still need to find a vbs file from gmail, you may be able to recover it:
https://productforums.google.com/forum/#!topic/gmail/F509J1du_eU
If that doesn't work and you still need it back send me a PM.
Also separately, consider starting to save your code via some form of vcs. Maybe github.
|
Yo, re Gmail being able to detect that my password-protected (and name-hidden) 7zip file contains a .vbs file that contains text, I found this post about a sort of related issue which might explain how it happens.......
"Self-respecting anti-virus researchers do NOT send malware by e-mail in ZIP archives. Not even password-protected ZIP archives. Not only is the encryption used by ZIP archives insecure and easily broken - one does not even need to break it, in order to detect that the archive contains some kinds of malware.
A ZIP archive (as well as most other kinds of archives) contains, among other things, the CRC-32 of each uncompressed (and unencrypted) file. If the file contains static malware (i.e., not a program infected by a parasitic virus or a self-modifying Trojan horse), its CRC will be the same, no matter what password is used to encrypt it. An external program can detect it in the archive without even having to bother with the encryption.
In addition, as far as I know, McAfee's scanner automatically tries the password "infected" when scanning password-protected ZIP archives; probably other scanners can do it too. The reason for this is not anything nefarious - it is because the developers of the scanner use their own product as a tool when examining incoming virus samples and these are often contained in ZIP archives protected with the password "infected". There are simply way too many people who ignorant about cryptography and don't take sufficient precautions when sending malware by e-mail, alas.
That's why professional anti-virus researchers always use PGP when sending mailware to others. It is way more secure and responsible. It also ensures that only the intended recipient can decrypt the sample - not just about anyone who knows (or can guess) the password. Sure, this method is not suitable for samples that are made publicly available (e.g., on a web or ftp site) - but responsible anti-virus researchers don't do that."
http://www.ghettoforensics.com/2014/02/google-actively-scanning-malware-emails.html
IDK why an encrypted file format would publicly display a hash of its contents though.............seems a bit retarded?
|
On October 14 2014 11:58 phar wrote:Show nested quote +On October 14 2014 04:23 FFGenerations wrote: er.... guys did you know gmail just started blocking 7zip (zip) files that contain vbs files? i saved all my work by emailing myself vbs inside 7zip and now all my archived files are deleted by gmail?????????
could have lost a weeks worth of work due to formatting and thinking my files were not going to be randomly fucking DELETED by my email service
If you still need to find a vbs file from gmail, you may be able to recover it: https://productforums.google.com/forum/#!topic/gmail/F509J1du_eUIf that doesn't work and you still need it back send me a PM. Also separately, consider starting to save your code via some form of vcs. Maybe github.
Oh thanks dude. I'm sorted now thankyou. Yeah I was using email for this out of habit/convenience but will start using github now, cheers
|
Zip is an archive format that happens to support encryption through extra bits. If it was meant to be a good encrypted archive format, the standard Zip encryption scheme has been known to be easily cracked, because Zip was never a secure way of encrypting your documents after its default encryption was cracked.
If you're using 7-Zip the default encryption scheme for the Zip format, ZipCrypto, is weaker than AES-256 (it's been cracked). 7-Zip also doesn't specify "Encrypt file names" for Zip files because it doesn't work and never worked (as I mentioned before). You're misunderstanding what's going on.
If you want to hide the public name of your compressed files and still want to use Zip, put them inside a second Zip file.
|
|
|
that's not a zip file. if you're going to change it then refer to it properly in the first place. it's a 7z archive file.
|
Was working on Project Euler problems, read up on example primality test of a number function:
![[image loading]](http://puu.sh/cfbcI/1ac2c217f4.png)
Can someone explain to be the else part of the function? The way I write this function is to test obviously from 3 -> root n, increment by 2 to avoid evens. But they went even further here.
I don't really get the second if condition to leave the function..."if n mod (f + 2" or why they increase f by 6 each time.
|
It's tied to the "All primes greater than 3 can be written in the form 6k+/-1." Essentially, what the algorithm is doing here is start from 5 = 6*1 - 1, and test each step if (6k - 1) divides n (that's "if n mod f = 0") then if (6k - 1) + 2 (which is 6k + 1) divides n (that's "if n mod (f+2) = 0").
It's a way to skip some of the non-prime potential dividers. A non-prime integer p is to be skipped, because p's own dividers have already been checked against n before in the algorithm. If p was a divider, its own dividers would have consequently been dividers of n, so you would have stopped already. Edit: Hmm, I guess you understood that already. It's like skipping even numbers, but better ;D
Edit4: Wait no I was right actually. Whelp, removed it now.
|
"All primes greater than 3 can be written in the form 6k+/-1."
Rewritten: Possible candidates are 6*k-1 and 6*k+1. Let's define f as 6*k-1. Then the possible candidates are f and f+2
The +6 is just increases the value of k by 1. (So f is 5, 11, 17,...)
If you want to know why all primes have the form I'd say look at this: http://mathblag.wordpress.com/2013/08/30/primes-of-the-form-6k1/
|
Thanks. I understand the 6k +/- 1 and reasoning behind f + 2 now. Just gonna go do some more follow up reading on why "All primes greater than 3 can be written in the form 6k+/-1."is true.
|
On October 17 2014 11:52 Ninoah wrote: Thanks. I understand the 6k +/- 1 and reasoning behind f + 2 now. Just gonna go do some more follow up reading on why "All primes greater than 3 can be written in the form 6k+/-1."is true.
Do you understand why you could skip by say 2s starting with an odd number greater than 1 to find primes? Going up by sixes is same principle except you're accounting for factors 2 and 3.
We take our number and do mod six. If this equals zero, two, or four then the number is even and has a factor of 2. if it equals three then the number has a factor of three. The other two cases align with 6k +- 1 and may or may not be prime. 6k + 1 is mod six equal to one and 6k -1 is mod six equal to five.
|
|
|
Now? It's been an open standard since it was started (I think it was in 2006, but not sure) and it became standard in Office 2007.
The fact that there's still no editor that correctly implements the spec... That's a different story ;o)
|
Wait if it's been an open standard for 7 years why do people still complain about them messing around with the formats to screw up libreoffice and openoffice?
|
Because while it's a standard, Office itself is not as compliant as you would wish... But also because it's a *massive* spec - the 4 parts of the spec is around 7000 pages.
To compare, the Open Document Format spec is around 1000 pages.
Both are similar in the structure, but one is made to be read and understood by humans
|
|
|
On October 14 2014 04:15 FFGenerations wrote: taken your comments on board, i am instead going to look into cloud computing.
"My next idea was to have a look at Cloud Computing as I was advised that many interesting technical challenges exist here. I saw a company hosting online MMO games which conventionally have a download size of 20 gigs that puts a lot of 1st-time users off from bothering to trial them. The cloud hosting of the company allows users to instantly jump into the game without having to download, patch and install it whatsoever. This seems pretty intriguing. "
i'll see what my tutor has to say about it tomorrow. the problem here is that i was supposed to give in a Product Initiation Document last friday which specifies what my project is going to be about, but obviously i have no fucking clue about Cloud Computing so can't specify much!!
i just made a draft title of "An exploration of the benefits and risks of cloud computing with regards to the hosting of large-scale applications" and hope tutor isn't upset at my progress... :/
any comments on this subject? ill make a post maybe later in the week probably after doing some basic research./..
ideally i want to prototype something rather than do 100% research Sounds like Eve online using amazon web services AppStream. Pretty much just sophisticated streaming from cloud servers to your mobile/computer.
http://aws.amazon.com/blogs/aws/amazon-appstream-can-improve-the-new-user-experience-for-eve-online/
|
|
|
|
|
|