gphilip

> I also get electrocuted easily when I use the escalator.

You get shocked easily when you use the escalator.You wouldn't be electrocuted more than once.

gphilip

4년 전discuss

> Adding one edge after the exact number of edges required to create a Hamiltonian cycle (number of edges equal to number of vertices) would appear to break the property.

A Hamiltonian cycle is a simple cycle (no repeated vertices or edges) that contains every vertex of the graph. If a graph G has a Hamiltonian cycle, then adding more edges to G will not make that cycle go away; it will still be there. So the property of "has a Hamiltonian cycle" is not broken by adding more edges.

As a simple example: consider the graph which is the cycle on 5 vertices. That is, the graph has 5 vertices, and is just one big cycle with 5 edges. This graph has a Hamiltonian cycle (the entire graph itself is one such cycle). If we add an extra edge to this graph, say between vertices 1 and 3, the original Hamiltonian cycle does not go away.

> How can there be a lower bound other than zero? However small the possibility, surely given an infinite number of cases, there are infinite possibilities of a particular structure being created.

The lower bound can be other than zero because they are looking at the threshold (probability) at which the probability of the object existing goes from "very low" to "extremely high". This is alluded to in the following quote:

  "When edges are added to a random graph of N vertices with a probability of less than log(N)/N, for instance, the graph is unlikely to contain a Hamiltonian cycle. But when that probability is adjusted to be just a hair greater than log(N)/N, a Hamiltonian cycle becomes extremely likely."

I don't know the precise probabilities, but this would be something like: "When the probability of an edge being present is less than log(N)/N then the probability of there being a Hamiltonian cycle is 1/(N^2). When the probability of an edge being present is slightly more than log(N)/N then the probability of there being a Hamiltonian cycle becomes (1 - 1/(N^2))."

(Note that I plucked the above probabilities out of thin air just for the sake of illustration, just to give you an idea of the form that these statements take. For the precise probabilities, please ask Google.)

> What does this mean?

See: https://en.wikipedia.org/wiki/Sunflower_(mathematics)

> This seems to suggest multiple Hamiltonian cycles in a graph, contradicting the earlier definition that every vertex must be connected.

This is no contradiction. There can be multiple Hamiltonian cycles in a graph. Consider the complete graph on n vertices; there are roughly n-factorial-many Hamiltonian cycles. Any permutation of the vertices corresponds to one such cycle. Different permutations can correspond to the same cycle, so the number is not exactly n-factorial. But you get the idea.

gphilip

5년 전discuss

I configured Fastmail to send emails that I compose from my work address, via the work SMTP server. Not any other type of email. And indeed, they don't send emails that I compose from my non-work addresses via my work SMTP server: they use their own server to send these.

The support person who is dealing with this also turned up the fact that this is a change that they made some time in 2019. Earlier to that, all emails from Fastmail Calendar were sent from the "[email protected]" address. They changed this in late 2019 so that Calendar now sends these mails from my work address (following some peculiar logic and email rewrite rules).

So yes, it is surprising that they send emails from my Calendar via my work SMTP server.

gphilip

8년 전discuss

It's "choline", not "chlorine".

https://en.wikipedia.org/wiki/Choline

gphilip

9년 전discuss

Here is one thing you could try:

1. Identify research scientists (e.g: in Google/IBM/Microsoft/... research labs) and professors (in institutes/universities) that you would like to work with.

2. Write to them directly, attaching your publications and requesting an internship.

Depending on how your publications are perceived, there is a good chance that at least a few will choose to engage with you.

Indian institutes funded by taxpayer money are required to follow a prescribed set of rules for selecting PhD candidates, in the interest of ensuring fairness, preventing nepotism, etc. . The competitive exams that you seem to loathe are part of this process, and professors can do nothing about this.

They have much more leeway in choosing interns, though. The rest follows as per kubrickslair's recipe.

gphilip

9년 전discuss

> You can also publish papers as an undergrad with your adviser's support in the US, is that not true in India?

It is just as true in India as it is in the US.

And: while it definitely helps if your college/department/advisor is there to lend you support, such support is not a prerequisite for getting published.

gphilip

9년 전discuss

I can speak of theoretical computer science: if you have work that is worth publishing (as evaluated by your peers), then yes, it is possible to publish without any affiliation. I would be very surprised if a good result is rejected just because the author is not affiliated.

(Indeed, it is possible to get published even if you have negative affiliation; see: http://insa.nic.in/writereaddata/UpLoadedFiles/IJPAM/20005a2... )

The operative word in the first sentence above is "if". In my opinion, unless you are in the Ramanujan or Erdős class, then it is highly unlikely that you come up with a publishable manuscript on your own. Briefly put: you need a lot of "context" to be able to do publishable work, and you are unlikely to get this context unless you interact with the research community.

gphilip

9년 전discuss

> It would be great to have an offline way to search Rust documentation and examples,

>> It all works offline. These docs are pre-installed for you when you install Rust, and 'cargo doc' will generate them for your whole project.

Not by default, anymore[0], as I found out when I wanted to read the book offline.

To set up offline documentation, do:

  rustup component add rust-docs # One-time thing

Now to open the docs in a browser, do one of:

  rustup doc
  rustup doc --api
  rustup doc --book

The second and third forms open up the API documentation and the book, respectively. Bookmark for one-click access.

[0] https://users.rust-lang.org/t/psa-rust-documentation-is-now-...

gphilip

11년 전discuss

From the home page (http://www.dharwadker.org/):

A new proof of the Four Colour Theorem, by Ashay Dharwadker.

Abstract

#########################################

We present a new proof of the famous four colour theorem using algebraic and topological methods. Recent research in physics shows that this proof directly implies the Grand Unification of the Standard Model with Quantum Gravity in its physical interpretation and conversely the existence of the standard model of particle physics shows that nature applies this proof of the four colour theorem at the most fundamental level, giving us a grand unified theory. In particular, we have shown how to use this theory to predict the Higgs Boson Mass [arXiv:0912.5189] with precision. Thus, nature itself demonstrates the logical completeness and consistency of the proof. This proof was first announced by the Canadian Mathematical Society in 2000. The proof appears as the twelfth chapter of the text book Graph Theory published by Orient Longman and Universities Press of India in 2008. This proof has also been published in the Euroacademy Series Baltic Horizons No. 14 (111) dedicated to Fundamental Research in Mathematics in 2010. Finally, the proof features in an exquisitely illustrated edition of The Four Colour Theorem published by Amazon in 2011. The Endowed Chair of the Institute of Mathematics in recognition of this achievement was bestowed in 2012.

#########################################

See also (http://www.dharwadker.org/standard_model/):

Title: Grand Unification of the Standard Model with Quantum Gravity Author: Ashay Dharwadker

Abstract:

#########################################

We show that the mathematical proof of the four colour theorem [1] directly implies the existence of the standard model, together with quantum gravity, in its physical interpretation. Conversely, the experimentally observable standard model and quantum gravity show that nature applies the mathematical proof of the four colour theorem, at the most fundamental level. We preserve all the established working theories of physics: Quantum Mechanics, Special and General Relativity, Quantum Electrodynamics (QED), the Electroweak model and Quantum Chromodynamics (QCD). We build upon these theories, unifying all of them with Einstein's law of gravity. Quantum gravity is a direct and unavoidable consequence of the theory. The main construction of the Steiner system in the proof of the four colour theorem already defines the gravitational fields of all the particles of the standard model. Our first goal is to construct all the particles constituting the classic standard model, in exact agreement with 't Hooft's table [8]. We are able to predict the exact mass of the Higgs particle and the CP violation and mixing angle of weak interactions. Our second goal is to construct the gauge groups and explicitly calculate the gauge coupling constants of the force fields. We show how the gauge groups are embedded in a sequence along the cosmological timeline in the grand unification. Finally, we calculate the mass ratios of the particles of the standard model. Thus, the mathematical proof of the four colour theorem shows that the grand unification of the standard model with quantum gravity is complete, and rules out the possibility of finding any other kinds of particles.

#########################################

gphilip

11년 전discuss

You forgot Booth Capturing, the most blatant threat of all [1].

[1] https://en.wikipedia.org/wiki/Booth_capturing

gphilip

11년 전discuss

India has been successfully using EVMs for elections since the turn of the century [1].

And an Indian General Election is no menial task. In the latest election of 2014, 814.5 million people were eligible to vote, making it the largest-ever election in the world. A total of 8,251 candidates contested for 543 seats in the Indian parliament. The average election turnout was around 66.38% [2].

[1] https://en.wikipedia.org/wiki/Indian_voting_machines

[2] https://en.wikipedia.org/wiki/Indian_general_election,_2014

gphilip

11년 전discuss

What cynical comments? I read most (or all) of them as positive and encouraging.

gphilip

11년 전discuss

> 3. Set up a filter to route this fool's messages to your junk folder where it belongs.

Perhaps not. While the OP should not respond to these messages, these messages could turn out to be vital evidence if the OP (or, highly unlikely, the scammer) decides to go the legal route. So my advice would be: do not delete these messages; keep them somewhere safe so they can be used later if needed.

gphilip

11년 전discuss

Fixed, thanks.

gphilip

12년 전discuss

ELL [+] is perhaps a better fit for this question?

[+] http://ell.stackexchange.com/

"English Language Learners Stack Exchange is a question and answer site for speakers of other languages learning English."

gphilip

12년 전discuss

Rough translation of the Preface on page 4 by the person who scanned the book. The preface is written (mostly) in Malayalam [1], the language of the state of Kerala [2] in India:

I bought this book in 1986 for 50 Rupees [3]. Since it was a great book, I used to read it often, and many of my friends used to borrow it. Somebody borrowed it in 2007, and I never got it back. I searched the entire world for a copy, new or old, cheap or expensive .... I couldn't find one. Then a friend told me that if there is a copy anywhere in the world then he would buy it for me, no matter the price. He heard that it was available with Abe(?) Books in the U.S for $86, and ordered a copy. I waited for it to arrive ...... Then I got the regret message "Your consignment has been missed during transit, and we have no additional copy. Your payment will be redeemed however." I kept up my search. Then I got to know that a person in Koyilandy [4] had a copy, and I took a laptop and a scanner and journeyed from one end of Kerala to the other to reach there. It took 7 hours to scan the the entire book. I converted the entire corpus into text and edited it to make it identical to the original text, and added all the line drawings using CorelDraw to get it to its current form.

If you ever get your hands on this, then keep in mind that so much effort went into its making. Shouldn't I have done at least this much in return for the kindness which my good friend showed me, in offering to buy the book for me even at an exorbitant price? I offer this completed scan first to him, like a gift of the Magi [5]. I look back and think, was it worth it? Yes, absolutely.

[1] https://en.wikipedia.org/wiki/Malayalam

[2] https://en.wikipedia.org/wiki/Kerala

[3] A significant sum in those days. A good meal could be had for 5 Rupees or less in those days.

[4] https://en.wikipedia.org/wiki/Koyilandy

[5] He doesn't say "gift of the Magi" in so many words, but "a gift of a piece of a commonly found plant in return for a piece of broken slate pencil", but I guess the idea is somewhat similar.

gphilip

12년 전discuss

Off topic: It may be a good idea to prepend an "Ask HN:" to the title to get more visibility.

gphilip

12년 전discuss

"Project XOS or eXperimental Operating System is a platform to develop a toy operating system. It is an instructional tool for students to learn and implement OS data structures and functionalities on a simulated machine called XSM (eXperimental String Machine)."

XOS is used at the National Institute of Technology Calicut, India to teach Operating System principles [0]. The OS Lab essentially consists of students designing and implementing a kernel for XOS, starting from scratch:

"Cross compiler, debugger, file system interface and other supporting software tools are provided. The student will implement the scheduler, memory management, process management, exception handling and file system management functions of the OS."

[0] http://athena.nitc.ac.in/~kmurali/os/index.html

gphilip

12년 전discuss

DDG works as intended for me: http://imgur.com/dJGt3NV

gphilip

12년 전discuss

"It asked for my ... online banking password."

My bank tries to drill it into me that I should NEVER, EVER give my password to any third party, including employees of the bank. This behaviour from Datacoup certainly seems like a big red flag to me.

They do say this, though:

"Datacoup neither sees nor stores any bank or credit card user login information such as username or password. The communication to the bank is hashed and the access point is tokenized, which means we cannot decipher a password even if we wanted to. Datacoup never sees nor stores account or routing numbers."

(http://datacoup.com/docs#security)

Did they redirect you first to a secure web page from the bank, and is it this page which asked for the credentials? If what they say above is true, then (I think) this is the only way in which this should happen.

Submissions

Kinetic Bombardment

The Sahara swung between lush and desert conditions every 20k years (2019)

The Lisp Curse (2017)

Bring all your chats together

Easy Steps to Take Back Control of Your Privacy in 2022

Tell HN: Fastmail may be routing Calendar reminders via your work SMTP server

Invasion by Taranaki Māori (1835–1868)

Hashcat – advanced password recovery

If you've been misprepresented by Facebook

FastMail app for Android now available from Yandex.Store

Booth Capturing

Infant formula advertising does influence mothers

Computer Randomly Plays Classical Music

Seemingly impossible functional programs (2007)

Why is processing a sorted array faster than an unsorted array?

Scrambled Words

How can we help students learn how to read their textbook?

A monad is just a monoid in the category of endofunctors, what's the problem?

Google Play Store: Browsing with Firefox is no longer supported on Android

Facebook, Apple pay to freeze employees' eggs

comments