Since 7 years I’m working with LDAP but when times change the company who is using the software wants it to be LDAPS.

I’m currently running on Centos 6 (will be 7 this year).

The company provided me with an certificate in PFX format and a password. How do I install a PFX on Centos 6, and how do I get LDAPS working? Do I need OpenLDAP (and how to config that)?

I only need to check if a user + pass is in the AD, I don’t need anything more from the AD.

## Which books contain information about Giovanni ghouls?

I will attend a LARP in about a month, and my role will be a Giovanni ghoul. But I know pretty much nothing about Giovanni besides the fact that they are an Italian criminal syndicate, and I especially don’t know much about their ghouls. How are they chosen? How are they treated?

It’s not MET, gamemasters write their own rules, and I already know what the mechanics will look like. However, I am interested in the plot, and the game hosts have announced that they use the Revised edition as their basis.

Where can I find information about Giovanni as a clan and their ghouls in particular besides their third-edition clan book?

I can read some books in that time, but, probably, not all the books ever published for oWoD, that’s I am asking to narrow my choice.

## Question about Control Water And Sculpt Spell interaction

I tried to Answer this question: Can “x’/level” area effects be set at smaller sizes?

I was trying to find a spell with an area that can become bigger if your caster level is bigger: Control Water was the one I heard about (is there more spell like this, perhaps one could make it easier)

I’m now clueless about the interaction with the Sculpt Spell metamagic feat:

(Complete Arcane p.83)

Benefit

You can modify an area spell by changing the area’s shape to either a cylinder (10-foot radius, 30 feet high), a 40-foot cone, four 10-foot cubes, a ball (20-foot-radius spread), or a 120-foot line. The sculpted spell works normally in all respects except for its shape. For example, a lightning bolt whose area is changed to a ball deals the same amount of damage, but affects a 20-foot-radius spread.

• The area of the spell (wich you can control) goes bigger with your caster levels, but I guess if you modify it via Sculpt Spell it will now have a fixed area that won’t become bigger with your caster levels, is this correct by RAW or is there a rule I haven’t found somewhere about this?
• You can create a whirlpool on the ocean or even cast it on water elementals so the newly shaped area could help in these 2 situations, it might be useless in the other situations (raise/lower unless there are other water around wich could make the 4 10-foot cubes really useful if you need to raise the water for 4 different small ponds within the long range of the spell)

## How do you go about reaching the Far Realm?

How do you go about reaching the Far Realm?

I appreciate the lore found in 5e so far about the Far Realm:

Is there any official lore on the Far Realm?

What are all the creatures related to the Far Realm that have stat blocks in 5e?

Is there any further lore on how to actually reach the Far Realm in the materials from 5e or previous editions?

I know it is meant to be mysterious and mind-breaking place, but I wondered if there is any further information on ways of getting there. Or, further information about Firestorm Peak or the home world of the ancient elves who opened a portal to the Far Realm.

The Far Realm has no well-known portals, or at least none that are still viable. Ancient elves once opened a vast portal to the Far Realm within a mountain called Firestorm Peak, but their civilization imploded in bloody terror and the portal’s location—even its home world—is long forgotten. Lost portals might still exist, marked by an alien magic that mutates the area around them.

(PHB p.68)

If there is none, the proposal would be to go on an Inquisition spree with Zone of Truth and a liguist who knows Deep Speech, to find out exacly what the Aboleths, Beholders, Mind Flayers and Star Spawn know.

## What’s a good resource to learn about advanced character and narrative development?

I’ve seen the “50 questions to ask yourself about your character” lists. Those are very helpful early on and I still use them after 10 years of roleplay.

I think I’d like to move into more advanced techniques. Things I can do as a player to wow other players. How to handle complicated situations like “I’m playing a god character who is extremely powerful, and I don’t know how to entice them since they already have everything”.

What would be a good resource for this?

## simple question about epsilon and estimation turing machines

i am getting really confused by it. i got to a point i had to calculate the lim when $$n \rightarrow \infty$$ for an optimization problem, and i got to the point that i had to calculate a fairly simple limit: $$lim_{n \rightarrow \infty} {3-\frac{7}{n}}$$.

now i used $$3 – \epsilon$$ and i am trying to show that there can’t be any $$\epsilon>0$$ so that the estimation of the algorithm is $$3-\epsilon$$, because there exists a “bigger estimation” – and this is the part i am not sure about, what is the correct direction of the inequality? $$3-\frac{7}{n} > 3 – \epsilon$$ or the opposite? i am trying to show that the estimation ration is close to 3.

i think that what i wrote is the correct way, but not sure. would appreciate knowing what is correct in this case. thanks.

## About shortest cycles in undirected graphs

In an undirected (and unweighted) graph, to find the shortest cycle containing a specific vertex $$s$$, it is usually said to run a BFS from $$s$$ and the first time to find a re-visit, then that is the wanted smallest cycle length.

This does not seem to be true, quoting from https://www.cs.princeton.edu/courses/archive/spr08/cos226/exams/fin-f05-sol.pdf page 3:

Note that if you run BFS from $$s$$ and stop as soon as you revisit a vertex (using a previously ununused edge), you may not get the shortest path containing $$s$$.

Examples where this technique seems to be suggested: An efficient algorithm to find a shortest cycle including a specific vertex

Another technique, finding the shortest cycle in the whole graph, by running BFS from each vertex, also seems to detect only the shortestLength + 1 in a special case, as mentioned in this paper: https://link.springer.com/chapter/10.1007/978-3-540-78773-0_63 in the “Unweighted case”. On the contrary, here (http://theory.stanford.edu/~virgi/cs267/lecture3.pdf) it is mentioned (first and second paragraphs) that running BFS from every vertex gives the shortest length (girth) in all cases. This is also mentioned in an archive (http://web.archive.org/web/20140513212046/https://webcourse.cs.technion.ac.il/234247/Winter2003-2004/ho/WCFiles/Girth.pdf).

Which of all algorithms/methods is true for:

1. Finding the shortest-length cycle in an undirected graph?
2. Finding the shortest-length cycle that passes through a known vertex $$s$$ in an undirected graph?
3. Where is the pitfall in each of my above compare-and-contrasts? (I cannot believe that some of the above quoted might even be untrue…)

Note: A randomized sub-cubic algorithm seems to exist, in the paper “A shortest cycle for each vertex of a graph” by Raphael Yuster: http://research.haifa.ac.il/~raphy/papers/all-cycles.pdf

## dnd 5e question about hunters mark and sneak attack synergy

Wondering if when multi classing a ranger and a rogue, can the spell hunters mark stack with sneak attack on damage rolls?

## If L = {xy | |x| = |y|, x=y} is not Context Free, then what about L = {xy | |x| = |y|, x!=y}?

I know that, when x = y, then it’s not Context Free. This is because, the first letter of y cannot be matched with first letter of x, which is at the bottom of the stack. But, a link of Show that { xy ∣ |x| = |y|, x ≠ y } is context-free claims that, when x!=y, then it’s Context Free. But, how can the letters of x and y be matched on stack? Say x=abbb y=bbbb. How can we say first letters don’t match?