|
Herself's sister. She passed away on Sunday. Not my favourite member of the family ...
"I have no idea what I did, but I'm taking full credit for it." - ThisOldTony
AntiTwitter: @DalekDave is now a follower!
|
|
|
|
|
OriginalGriff wrote: To be honest, I didn't like her: she's one of these "attention freaks" who fake asthma attacks if someone else is under the spotlight Her tombstone reads "See I told you I was ill"?
|
|
|
|
|
How did Herself feel about her sister?
|
|
|
|
|
Mixed, a bit: she didn't like her or what she did, but she loved her because she was her sister. Strange, but true.
So she's both upset and relieved, and feeling guilty about both.
"I have no idea what I did, but I'm taking full credit for it." - ThisOldTony
AntiTwitter: @DalekDave is now a follower!
|
|
|
|
|
|
Starting this past week, my Android, when using Speech-to-Text, has been inserting the period Character (".") At weird places.
Google does not know the answer to this question, nor Has he been able to lead me to any Sort of cause, reason, or fix.
If anyone can give me a clue as to what is going on, and more importantly how to fix this, Please do.
. Also, if anyone knows how to ask Google the right question to find the answer as to how to fix this, Thank you even more.
.
This message that you are currently reading, is being done on the very Android phone, which I'm describing.
. Also, sometimes he will use the question mark instead of the period.
Again, this only started this past week; past couple of days In fact.
.
|
|
|
|
|
Try turning off the autocorrect option that adds a fullpoint (period) if you type a double space.
I wanna be a eunuchs developer! Pass me a bread knife!
|
|
|
|
|
|
|
If it does it again, just say "stop it"; that should work.
|
|
|
|
|
Talk faster and no breathing.
(Or, try "retraining" the speech recognition).
It was only in wine that he laid down no limit for himself, but he did not allow himself to be confused by it.
― Confucian Analects: Rules of Confucius about his food
|
|
|
|
|
While you're at it, you might also want to look into how it decides to capitalize random words for no reason.
|
|
|
|
|
I think the answer is "remove Cortana" ...
|
|
|
|
|
I have been examining Neo4j's implementation (Java engine, .NET/C# driver available). I have to control my knee-jerk "oohh ... alien" prejudice against Java technology.
The free book "Graph Databases," by Neo4j principals Robinson, et. al., published by O'Reilly, is an excellent overview of gdb's in general as well as Neo4j implementation features: download here [^].
So far all of the graph db's I've looked at implement connections (edges, links) between object (vertices, nodes) as one-way, which interests me since I am interested in modeling reciprocal relationships; the C# prototype I implemented for fun is based on two-way connections with each direction having a "strength," and dynamic interacting functions used, so ... when one direction changes strength ... the other direction's strength is modified (of course, two-way reciprocity demands preventing runaway recursion).
Neo4j defines Properties as "first class" objects, and they can be attached to either nodes, or connections: I really like that.
Here's an example, in Neo4j's query language, Cypher, that selects friends of friends of a selected person who are not immediate first-level friends of the person:
var people = new List<string[]>
{
new[] {"Jim", "Mike"}, new[] {"Jim", "Billy"}, new[] {"Anna"Neo4j, "Jim"},
new[] {"Anna", "Mike"}, new[] {"Sally", "Anna"}, new[] {"Joe", "Sally"},
new[] {"Joe", "Bob"}, new[] {"Bob", "Sally"}
}; Cypher code executed by Neo4j engine:
MATCH
(person:Person)-[:KNOWS]-(friend:Person)-[:KNOWS]-
(foaf:Person)
WHERE
person.name = "Joe"
AND NOT (person)-[:KNOWS]-(foaf)
RETURN
foaf You can see this code in a complete C# example here: [^].
Well, I find the Cypher syntax very weird, but, I never completed SQL potty-training I sat down and toyed with what I would do using Linq (which I am sure can be improved) to handle such a query, came up with this:
List<(string p1Name, string p2Name)> people = new List<(string, string)>
{
("Jim", "Mike"), ("Jim", "Billy"), ("Jim", "Jonas"), ("Anna", "Jim"),
("Anna", "Mike"), ("Sally", "Anna"), ("Joe", "Sally"),
("Joe", "Bob"), ("Bob", "Sally")
};
var friendsByPerson = people
.GroupBy(p =>
p.p1Name).ToDictionary(grp =>
grp.Key, grp =>
grp.Select(g =>
g.p2Name));
var friendsOfJoe = friendsByPerson["Joe"];
var friendsOfFriendsofJoe = friendsOfJoe
.SelectMany(name1 =>
friendsByPerson[name1].Where(name2 =>
!friendsOfJoe.Contains(name2))); If I were as smart as our local code witch, I might try to create a converter for C# <=> Cypher
If you care to share your experiences, or interest in graph db's, I am ready to eat your live coals of wisdom with สี่หูห้าตา "four eyes and five ears" [^]
«One day it will have to be officially admitted that what we have christened reality is an even greater illusion than the world of dreams.» Salvador Dali
modified 10-Feb-20 1:23am.
|
|
|
|
|
Gosh that syntax is weird.
And I'm not really smart so much as stubborn and determined, but that can be our secret.
Real programmers use butterflies
|
|
|
|
|
You should probably feel at home with Graph databases, since the thinking behind them are quite similar to your parsers.
Actually, it should be quite possible to create a database covering all aspects of for example regular expressions. Add a regex into the db and test a string using a query.
Note that I say possible, I don't necessarily think it's a good way to do it.
|
|
|
|
|
BillWoodruff wrote: I am interested in modeling reciprocal relationships
Trust me, one sided relationships are way better.
"It is easy to decipher extraterrestrial signals after deciphering Javascript and VB6 themselves.", ISanti[ ^]
|
|
|
|
|
lw@zi wrote: Trust me, one sided relationships are way better. Oh yeah, I'll trust you on that one !
«One day it will have to be officially admitted that what we have christened reality is an even greater illusion than the world of dreams.» Salvador Dali
|
|
|
|
|
It reminds me of PROLOG; when I was still a student we modelized the relationships between all Greek gods using it.
"Five fruits and vegetables a day? What a joke!
Personally, after the third watermelon, I'm full."
|
|
|
|
|
Greek Gods:
wonderful source site: [^]
an example of Neo4j indexing for Greek gods: [^]
Neo4j and D3js generated display of Greek Gods (German): [^]
a source db: [^]
graph using SAP-HANA: [^]
many happy theogonies to you
«One day it will have to be officially admitted that what we have christened reality is an even greater illusion than the world of dreams.» Salvador Dali
|
|
|
|
|
It seems Greek mythology is the 'Hello World!' equivalent to graph databases
"Five fruits and vegetables a day? What a joke!
Personally, after the third watermelon, I'm full."
|
|
|
|
|
There's a Youtube channel called Computerphile that has done a few videos on graph theory and the kind of problems it is used to solve. Might be worth hunting some down if you want to apply this to a real-world problem, as I find having an actual thing to solve is the best way to getting to learn a new technology.
|
|
|
|
|
Don't forget about relationship direction when working with graph DBs. Your Cypher query is bi-directional but the LINQ query is uni-directional. I really like Cypher and neo4j but haven't had much reason to use a graph DB recently Fun stuff though.
|
|
|
|
|
Jon McKee wrote: Don't forget about relationship direction Hi, Jon,
"Directionality" is an issue I raise explicitly in my post: don't forget that
Neo4j edges/vertices/connections are one-way. I see nothing in the Cypher query that suggests "Your Cypher query is bi-directional:" it's just a compound/chained query.
cheers, Bill
«One day it will have to be officially admitted that what we have christened reality is an even greater illusion than the world of dreams.» Salvador Dali
|
|
|
|
|
What I was alluding to was that no direction for the relationship is specified in your Cypher query. This means that outgoing and incoming relationships will be searched in the match. So for example:
CREATE (p1:Person)-[:KNOWS]->(p2:Person)
//Matches both p1 and p2
MATCH (p:Person)-[:KNOWS]-(:Person)
RETURN p
//Matches only p1
MATCH (p:Person)-[:KNOWS]->(:Person)
RETURN p
Un-directed was probably a better word to use than bi-directional. My bad. Since it's common to think of directed relationships as p2 "not knowing about" p1 since you can't traverse to p1 directly from p2, I figured I'd point out this little nuance of matching in case you weren't aware. The LINQ example would only match p1 so I thought maybe there was some misunderstanding.
|
|
|
|
|