ibm domino – Is there a Microsoft technology equivalent of DAOS?

DAOS = Domino Attachment and Object Store, a neat technology we have been using for the last decade or so primarily in a huge document and email database. DAOS effectively de-duplicates attachments and objects over a certain size by replacing them with links to an object store (e.g. so instead of storing 23 identical copies of a 10Mb file attachment it stores 1 plus 23 links). It has saved us humungous amounts of disk space.

Now we need to migrate our stuff to a Microsoft platform and they don’t seem to have anything similar…. or do they?

dnd 5e – what is the equivalent of Lathander from the Dawn War Deities

A player getting his cleric ready for a campaign I am creating has told me he usually plays Forgotten Realms and his usual deity is Lathander, this is not a deity I am familiar with.

Largely I am basing my Pantheon for this campaign on the DawnWar Deities, with some tweaks being made. I am perfectly happy allowing my Cleric to play Lathander, and he is equally happy to worship an equivalent deity in my pantheon.

Who would be the closest equivalent to Lathander from the Dawn War Deities, either to be replaced by Lathander or to replace him as my players Deity?

big list – Conditions equivalent to finiteness

We’ve all probably come across some conditions that naturally imply finiteness, or are equivalent to it. For $ZFC$ examples:

  1. A set $X$ can be ordered in such a way that the ordering is well-founded and reverse well-founded iff $X$ is finite.
  2. A field has finite characteristic iff its underlying set is finite.
  3. The discrete topology on $X$ is compact iff $X$ is finite (this can probably be strengthened topologists).

What other conditions are equivalent to being finite in various background theories?

More ZFC examples are definitely welcome, but I’m also interested if working in weaker/stronger background theories can make fewer/more conditions equivalent to finiteness, or perhaps break an iff in one direction. Some more examples Dedekind finiteness occurred to me just after I wrote this:

  1. A set $X$ is finite iff it has no infinite subsets.
  2. A set $X$ is finite iff every self-injection is a surjection.

These both fail if we remove choice unless I’m mistaken.

functional analysis – How is this property equivalent to the Reiter Property?

We have the Reiter Property $(R_2)$ for an action of a group G on a set X:
For any $epsilon>0$, any finite subset $S$ of G, there exists $phiin{ell^2(X)}$ such that $|sphi-phi|_{ell^2}<epsilon{|phi|_{ell^2}}$ for all $sin{S}$.
I am trying to show this is equivalent to the alternative property $(R_2)’$: for any $epsilon>0$, any finite subset $S$ of G, there exists $phiin{ell^2(X)}$ such that $$left|frac{1}{|S|}sum_{sin{S}}{sphi}right|_{ell^2}>(1-epsilon)|phi|_{ell^2}$$
but I am completely stuck.
I have tried using some uniform convexity since $ell^2$ has an inner product, but can only get anything out of it when $|S|=2$, I have heard from someone else that this is related to adjoint operators, so I have tried defining $T:ell^2(X)rightarrowell^2(X)$ by $T(phi)=frac{1}{|S|}sum_{sin{S}}{sphi}$ and can deduce that it has norm 1 and, if we extend S to also contain the inverses of all its elements, is self adjoint, but I can’t see how this could be helpful to solve the problem.

Many thanks.

SQL SERVER equivalent for Oracle DBA_USERS

The sys schema is your friend for these kind of queries. Specifically sys.sysusers will give you the list of all Users of the current database.

You can also get a list of all server Logins using sys.syslogins.

In SQL Server, a server Login is first created, and then mapped to the databases that Login has access to. Each database a Login is mapped to has a User created within that database for that Login.

What is the equivalent of Microsoft Word documents called in Google Docs?

I can’t believe I’m asking this, but what is the equivalent of a Microsoft Word document in Google Docs called?

I know that the equivalent of Excel is called “sheets”, but I don’t know what the equivalent of a Word document is called (for instance in the documentation).

Is Exit (no square brackets) equivalent to Quit[] for refreshing the Kernel from within an Evaluation Notebook?

I prefer to use Exit as it conveniently requires fewer key presses over Quit[]. But before I use it regularly I need to know if there any subtle differences between Quit[] and Exit. The Wolfram documentation pages for Quit and Exit appear to be very similar and even call these two functions synonymous but I just need to be sure.


aws – A 2 P email service, equivalent of amazon ses receive email

I am working on a service which is supposed to accept email from the user and do some processing with that like for archiving, taking action on the email by an automated system etc.
I found that amazon SES provides a service called Email Receiving, which is something I was looking for but the availability of that is in very few regions as of now.
I have done a lot of google search spet days to find A2P email services but couldn’t found any.
If anyone has done something like that before, please help me with it.
Thank you.

applications – Are the Ip address of a website and the android app equivalent the same?

Large services like Facebook have own servers for web-site and mobile apps. Other services have one (API) server for both. Therefore there can be a relationship between the server of the website and the server used by the Android app but does not have to be.

The large services even have multiple servers distributed around the world that share the same DNS name. Therefore if you want to block something on IP level your filter list will soon be very long.

An relative simple way to get all IP addresses an app communicates with is sniffing it’s traffic. Even if the traffic will be mostly HTTPS and therefore encrypted the destination IP is always visible in plain text in each IP packet.

There are apps like PacketCapture that allow you to get the complete IP addresses an app communicates with.
After identifying a few IP addresses I would re-run the app while sniffing it with PacketCapture to make sure there are no alternative addresses the app just switche to if the main IP is not accessible.
Also keep in mind that you have to periodically check the IP addresses again as they will change from time to time.

Keep in mind in the times of cloud services the IP address of a service can change at any time and your block may also block other services that are running by coincidence on the same server.

Is this set theory equivalent to ZFC?

Consider a variant of set theory with these axioms:

  • Extensionality,
  • Regularity (foundation),
  • Separation,
  • Powerset,
  • Axiom of Choice, and
  • Transitive closure of a set-like relation is set-like.

Note that it does not explicitly postulate Pairing, Union, Infinity and Replacement.

Question: Is this set theory equivalent to $mathrm{ZFC}$?