Papers about black (reflective language) and a repl too. Computer Science

Papers about black (reflective language) and a repl too.
[Regular Languages] L* = L+
Malaysian Capital Gets Alibaba AI's "ET City Brain" for Urban Planning and Governance
TSP on multiple graphs? A single vertex list which minimizes the route total when path length across different graphs is accumulated.
Computational Geometry : Geometry :: ? : Music
Thoughts on second major after comp sci ?
Limits of Granger Causality

Papers about black (reflective language) and a repl too.

Posted: 01 Feb 2018 02:48 AM PST

submitted by /u/agumonkey
[link] [comments]

Posted: 01 Feb 2018 01:07 AM PST

For a given language L, what's the condition to have L^* = L⁺ ? I read somewhere it's when L is empty, bit somewhere else I found that is when we have L⁺ U €. Can anyone help me?

submitted by /u/pietrochico
[link] [comments]

Malaysian Capital Gets Alibaba AI's "ET City Brain" for Urban Planning and Governance

Posted: 31 Jan 2018 10:10 AM PST

submitted by /u/gwen0927
[link] [comments]

TSP on multiple graphs? A single vertex list which minimizes the route total when path length across different graphs is accumulated.

Posted: 31 Jan 2018 07:04 PM PST

I'm wondering if there's any name for this or any one could suggest related literature.

Basically I want to look at a bunch of graphs with numbered nodes and find a good route that applies on all of the graphs at the same time. The vertices are 2d points on the plane. Distance should use Manhattan metric. There's also a minimum edge distance. The title was also misleading - I'm interested in minimizing the longest edge rather than the total distance. Bottleneck TSP.

Given K sets vertices in R2 Pi = { x0 , ... , xn} (for 0 <= i < k) I want a sequence of (a0, ... an) such that

for each j (0 <= j < n) across all Pi |xaj,xaj+1| > A
Let mi = max(|xa0,xa1|, ... ,|xan-1,xan|) from Pi = { x0 , ... , xn}. Minimize max (m0, ... mk-1)

The > A constraint must be met. The maximum edge length could be minimized in a way that's approximate. Total edge length is also better lower than higher.

My first though was to do successive nearer neighbour searches of distance > A from P on each graph. Until some candidate was found in every graphs candidate set of "nearest n neighbours of distance > A from P" n would increase. Once a vertex was found to be shared in each graphs nearest neighbour candidate set P would be removed from the graphs and that shared candidate would become the new P. This would not work very well however and would make long paths once the nodes began to be exhausted.

submitted by /u/frenris
[link] [comments]

Computational Geometry : Geometry :: ? : Music

Posted: 31 Jan 2018 04:42 PM PST

I had one lecture called comp. geometry where we did compute complex hulls, triangulations, voronoi diagramms... all very cool stuff.

I am interested in music and wondered wether some analogue exists for music. What I found so far was basically a bunch of ML, which I find boring (no doubt it's usefull!). So is there some field that deals with music in a formal, discrete (rather than statistical-heuristical) way? I'd love to analyze algorithms and datastructures once again, this time in the realm of music!

submitted by /u/rect_pizza
[link] [comments]

Thoughts on second major after comp sci ?

Posted: 31 Jan 2018 11:03 AM PST

Im considering stats or math as my second major in the uni. I'm interested in artificial intelligence and bio algorithm. Any opinions?

submitted by /u/kamisch
[link] [comments]

Limits of Granger Causality

Posted: 31 Jan 2018 04:49 AM PST

submitted by /u/austingwalters
[link] [comments]