J
J
JKornev2014-12-15 00:02:34
Email
JKornev, 2014-12-15 00:02:34

Determining the address of the mail server by email?

For example, I have a certain email ([email protected]) and a password for it, it is necessary to determine the address of the imap server. I want to do something like this:
1. We try through the MX record of the domain
2. If it doesn’t work, then we try through the imap domain. (imap.mail.domain)
3. If it doesn't work, then we just try by domain (mail.domain)
is it valid? And is there any standard for this or a recommended way?

Answer the question

In order to leave comments, you need to log in

5 answer(s)
A
Armenian Radio, 2014-12-15
@gbg

There is no standard. But you can look into the thunderbird source and see how such a definition is made there.

B
brutal_lobster, 2014-12-15
@brutal_lobster

https://developer.mozilla.org/en-US/docs/Mozilla/T...

D
dom1n1k, 2017-04-20
@dom1n1k

It? https://en.wikipedia.org/wiki/%D0%A2%D1%80%D0%B0%D...

E
evgeniy_lm, 2017-04-20
@evgeniy_lm

Maybe someone has how to solve this problem
. Everyone who really studied at the university has
Faced all who studied at the university Linear programming. Those who deal with logistics in production also face these tasks.
If I can solve your problem for a small fee

M
Mercury13, 2017-04-20
@Mercury13

The task is complex and requires serious research. The point here is that the second tier - an intermediate storage warehouse - is added if the costs are NON-linear and in large volumes the delivery of goods is cheaper. This, of course, can be simulated by cheaper delivery to warehouses. (And also to unload the "dead stocks" of stores and to compensate for random fluctuations in demand by the law of large numbers, but this, as I understand it, is none of your business.)
You have written: "The cost of delivery is the distance between points." Thus, the cost of delivery does not depend on the volume of delivery, but depends only on the distance? Also, so to speak, non-linear behavior. Look for an approximate solution in clustering algorithms: the zone covered by one warehouse is the cluster. If you need to be more precise, you have to use some heuristics.
For example, let's place seven warehouses in some cities, calculate the resulting cost. And now the question is: is it possible to move a warehouse to a neighboring city to make it cheaper? We work iteratively until we settle down to the “optimal position”. We randomly sketch seven points - and “roll down” until we calm down, and so many, many times.
It is better to display not one solution, but several - for example, up to 120% of the optimal one. The fact is that after a computer calculation, some human factors will arise: having learned that the eastern warehouse is only in Komsomolsk-on-Amur, and the northwestern one can be placed anywhere in the vicinity of Leningrad, we decide to put warehouses in Komsomolsk and not far from the Leningrad underground.

Didn't find what you were looking for?

Ask your question

Ask a Question

731 491 924 answers to any question