I explored random matrices over Z/2Z and found a few crypto algorithms Computer Science |
- I explored random matrices over Z/2Z and found a few crypto algorithms
- TeXmacs 2.1 released — ideal for computer science research and education.
- Caesar-Cipher in Wireworld (RGB)
- Any Good Coursera Course Recommendations?
- Should an A* pathfinding visualizer use diagonal paths?
- How do I install Git for windows 10?
- How would you parse (or design) a lightweight markup language?
- Graph similarity measure which does not involve ML/NN techniques
- University Research & Development Project. !!Help Please!!
- Blowing Up Supernovas on Supercomputers with Bronson Messer by Alexa's Input (AI) • A podcast on Anchor
- Everyone Should Attend A Hackathon
- Most Popular Machine Learning Libraries - 2014/2021
- Please check my proof of P!=NP for errors.
| I explored random matrices over Z/2Z and found a few crypto algorithms Posted: 25 Jun 2021 02:36 PM PDT Hi! You can read the article here: https://drive.google.com/file/d/19lzQm50_coTdGPDmSAIyhok2_inzXCcg/view I'm also putting 100$ (CAD) bounties on each hash function if someone finds a collision! I created the subreddit /r/falkush to share your solution. I'd really like to know what you think about it and if you think this could be published in a small journal. I wrote a Java implementation that you can download here: https://drive.google.com/file/d/1nrUsManocHh8G_jlj0b9XFoexaQhzFDd/view Thank you! [link] [comments]  |
| TeXmacs 2.1 released — ideal for computer science research and education. Posted: 25 Jun 2021 05:50 AM PDT |
| Caesar-Cipher in Wireworld (RGB) Posted: 25 Jun 2021 08:06 PM PDT |
| Any Good Coursera Course Recommendations? Posted: 25 Jun 2021 06:04 PM PDT Hi all, I'm a college student with experience coding in Python and C. I want to learn more about AI, advanced applications of Python, or automation. Are there any suitable Coursera courses for someone who isn't a beginner but want to dive in more to the applications of programming? Thanks in advance! [link] [comments]  |
| Should an A* pathfinding visualizer use diagonal paths? Posted: 25 Jun 2021 02:20 PM PDT For example in this guys implementation, the paths won't go diagonal, even if the two points are diagonally located. Which way is "correct"? In my current implementation it prefers diagonal paths when appropriate. Example: https://imgur.com/a/aQA8MtC Whereas in other programs it would do something like this, which seems incorrect. I guess my answer to the title would be "yes duh" so my secondary question is why someone would implement it in a way that DOESN'T use diagonal paths when optimal? [link] [comments]  |
| How do I install Git for windows 10? Posted: 25 Jun 2021 02:46 PM PDT I am a beginner in programming/software. Where do I safley download git for windows 10? Is it from the git-scm.com website? or should my pc have git installed already? [link] [comments]  |
| How would you parse (or design) a lightweight markup language? Posted: 24 Jun 2021 05:24 AM PDT Apparently, most lightweight markup languages such as Markdown, Asciidoc, etc. use hand-rolled parsers, mostly based on regex and states, and don't have clear ASTs. CommonMark seems to be closest to a clean parser, as for instance cmark uses re2c to generate a lexer, and has a well-defined AST, and a reasonable parsing strategy is defined here: https://spec.commonmark.org/0.30/#appendix-a-parsing-strategy I assume no common lightweight markup language can be parsed by a standard parser? If you could, I'm guessing someone would have already done that? Could you design a usable lightweight markup language that *can* be parsed by a standard parser? From my run in trying to implement an Asciidoc grammar for Instaparse, I've seen Asciidoc started to require me to complicate the grammar a ton, and stuff such as escapes/markup within code blocks seemed really complex- if not impossible... [link] [comments]  |
| Graph similarity measure which does not involve ML/NN techniques Posted: 24 Jun 2021 09:50 AM PDT I'm working on a small research project where I have to devise a technique for detecting plagiarism attempts between ER or UML diagrams. One first attempt at solving the problem is by viewing these diagrams as graphs, and feed them into a graph similarity algorithm. I am still exploring the literature, but some of these methods (like graph kernels) require knowledge of ML and NN techniques, or somewhat advanced mathematics, which I don't possess since I am just an undergraduate student. Do you know of any technique which I can apply and at the same time understand? It's fine (and a lot of fun for me) to learn prerequisites, but I have a few weeks/months for this and I can't take a whole course to just learn them. [link] [comments]  |
| University Research & Development Project. !!Help Please!! Posted: 25 Jun 2021 01:16 AM PDT Hi All, I've taken on a research & development project In Cybersecurity at Edge Hill University, the title of my project is "Cybersecurity & COVID-19" I am doing research to identify if cybercrime increased due to the pandemic! I have created a survey to get some results from users who may have suffered a cyberattack! The survey is multiple choice, bar 1 question. I thank you all in advance! [link] [comments]  |
| Posted: 24 Jun 2021 07:17 AM PDT |
| Everyone Should Attend A Hackathon Posted: 24 Jun 2021 05:12 PM PDT |
| Most Popular Machine Learning Libraries - 2014/2021 Posted: 24 Jun 2021 09:57 AM PDT |
| Please check my proof of P!=NP for errors. Posted: 24 Jun 2021 03:56 PM PDT Please check my proof (PDF) of P!=NP for errors. Small error: I should speak about "coherence" of all members of a set rather than of a set. [link] [comments]  |
| You are subscribed to email updates from Computer Science: Theory and Application. To stop receiving these emails, you may unsubscribe now. | Email delivery powered by Google |
| Google, 1600 Amphitheatre Parkway, Mountain View, CA 94043, United States | |
No comments:
Post a Comment