Skip to content

GitLab

E
EMAM2Middleware

Aufgrund von Umarbeiten des s3 Storage wird es in GitLab, in nächster Zeit, mögliche Performance-Einbußen geben. Näheres dazu unter: https://maintenance.itc.rwth-aachen.de/ticket/status/messages/43/show_ticket/6670

Commit c12f3ea4 authored by Michael Günther Beyer's avatar Michael Günther Beyer
Browse files
Options

model and clustering visualization: proof of concept

parent 1615dbeb
Show whitespace changes
Inline Side-by-side
Showing with 251 additions and 16 deletions
pom.xml
View file @ c12f3ea4
......@@ -120,6 +120,20 @@
<version>${Embedded-montiarc-math-rosmsg-generator.version}</version>
</dependency>
<dependency>
<groupId>org.graphstream</groupId>
<artifactId>gs-core</artifactId>
<version>1.3</version>
<optional>false</optional>
</dependency>
<dependency>
<groupId>org.apache.commons</groupId>
<artifactId>commons-math</artifactId>
<version>2.1</version>
<optional>false</optional>
</dependency>
<!-- EMADL Dependencies -->
<dependency>
<groupId>de.monticore.lang.monticar</groupId>
......
src/main/java/de/monticore/lang/monticar/generator/middleware/clustering/AutomaticClusteringHelper.java
View file @ c12f3ea4
......@@ -20,8 +20,6 @@ import java.util.stream.Collectors;
public class AutomaticClusteringHelper {
static double MAXCOST= 999999;
public static double[][] createAdjacencyMatrix(List<ExpandedComponentInstanceSymbol> subcomps, Collection<ConnectorSymbol> connectors, Map<String, Integer> subcompLabels) {
// Nodes = subcomponents
// Verts = connectors between subcomponents
......
src/main/java/de/monticore/lang/monticar/generator/middleware/clustering/SimpleModelViewer.java
View file @ c12f3ea4
package de.monticore.lang.monticar.generator.middleware.clustering;
public class SimpleModelViewer {
import org.graphstream.graph.Graph;
import org.graphstream.ui.view.Viewer;
import org.graphstream.ui.view.ViewerListener;
import org.graphstream.ui.view.ViewerPipe;
import javax.swing.*;
public class SimpleModelViewer implements ViewerListener {
private Graph graph;
protected boolean loop = true;
public SimpleModelViewer(Graph g) {
this.graph = g;
}
public void run() {
Viewer viewer = this.graph.display();
viewer.getDefaultView().add(new JLabel(graph.getId().toString()));
viewer.setCloseFramePolicy(Viewer.CloseFramePolicy.CLOSE_VIEWER); // set to "HIDE_ONLY" to allow for further communication
ViewerPipe fromViewer = viewer.newViewerPipe();
fromViewer.addViewerListener(this);
//fromViewer.addSink(this.graph);
while(loop) {
fromViewer.pump();
}
}
public void viewClosed(String id) {
this.loop = false;
}
public void buttonPushed(String id) {
//System.out.println("Button pushed on node "+id);
}
public void buttonReleased(String id) {
//System.out.println("Button released on node "+id);
}
}
\ No newline at end of file
src/main/java/de/monticore/lang/monticar/generator/middleware/helpers/ComponentHelper.java
View file @ c12f3ea4
......@@ -29,4 +29,12 @@ public class ComponentHelper {
subcomps.forEach(sc -> componentIndecies.put(sc.getFullName(), i[0]++));
return componentIndecies;
}
public static Map<Integer, String> getSubcompsLabels(List<ExpandedComponentInstanceSymbol> subcomps) {
Map<Integer, String> componentIndecies = new HashMap<>();
int[] i = {0};
subcomps.forEach(sc -> componentIndecies.put(i[0]++, sc.getFullName()));
return componentIndecies;
}
}
src/test/java/de/monticore/lang/monticar/generator/middleware/AutomaticClusteringTest.java
View file @ c12f3ea4
......@@ -3,10 +3,7 @@ package de.monticore.lang.monticar.generator.middleware;
import de.monticore.lang.embeddedmontiarc.embeddedmontiarc._symboltable.ConnectorSymbol;
import de.monticore.lang.embeddedmontiarc.embeddedmontiarc._symboltable.ExpandedComponentInstanceSymbol;
import de.monticore.lang.embeddedmontiarc.embeddedmontiarc._symboltable.PortSymbol;
import de.monticore.lang.monticar.generator.middleware.clustering.AutomaticClusteringHelper;
import de.monticore.lang.monticar.generator.middleware.clustering.ClusteringAlgorithm;
import de.monticore.lang.monticar.generator.middleware.clustering.ClusteringAlgorithmFactory;
import de.monticore.lang.monticar.generator.middleware.clustering.ClusteringKind;
import de.monticore.lang.monticar.generator.middleware.clustering.*;
import de.monticore.lang.monticar.generator.middleware.clustering.algorithms.*;
import com.clust4j.algo.AffinityPropagation;
import com.clust4j.algo.AffinityPropagationParameters;
......@@ -23,10 +20,17 @@ import net.sf.javaml.core.DenseInstance;
import net.sf.javaml.core.Instance;
import org.apache.commons.math3.linear.Array2DRowRealMatrix;
import org.apache.commons.math3.linear.RealMatrix;
import org.graphstream.graph.implementations.SingleGraph;
import org.graphstream.stream.file.FileSinkImages;
import org.graphstream.ui.view.Viewer;
import org.graphstream.ui.view.ViewerPipe;
import org.junit.Test;
import smile.clustering.DBSCAN;
import smile.clustering.SpectralClustering;
import de.monticore.lang.monticar.svggenerator.SVGMain;
import org.graphstream.graph.*;
import javax.swing.*;
import java.io.IOException;
import java.util.*;
import java.util.stream.Collectors;
......@@ -38,6 +42,7 @@ import static org.junit.Assert.assertTrue;
public class AutomaticClusteringTest extends AbstractSymtabTest{
public static final String TEST_PATH = "src/test/resources/";
public static final String TEST_PATH_PNG = "src/test/resources/clustering/test-images/";
@Test
......@@ -435,6 +440,52 @@ public class AutomaticClusteringTest extends AbstractSymtabTest{
@Test
public void testClusteringAlgorithms(){
TaggingResolver taggingResolver = AbstractSymtabTest.createSymTabAndTaggingResolver(TEST_PATH);
//String modelName= "clustering.unambiguousCluster";
String modelName= "clustering.midSizeDemoCluster";
ExpandedComponentInstanceSymbol componentInstanceSymbol = taggingResolver.<ExpandedComponentInstanceSymbol>resolve(modelName, ExpandedComponentInstanceSymbol.KIND).orElse(null);
assertNotNull(componentInstanceSymbol);
// get stuff together for adjmatrix
List<ExpandedComponentInstanceSymbol> subcompsOrderedByName = ComponentHelper.getSubcompsOrderedByName(componentInstanceSymbol);
Map<String, Integer> labelsForSubcomps = ComponentHelper.getLabelsForSubcomps(subcompsOrderedByName);
Map<Integer, String> subcompsLabels = ComponentHelper.getSubcompsLabels(subcompsOrderedByName);
double[][] adjMatrix = AutomaticClusteringHelper.createAdjacencyMatrix(subcompsOrderedByName,
ComponentHelper.getInnerConnectors(componentInstanceSymbol),
labelsForSubcomps);
// build a graph from this stuff
Graph graph = new SingleGraph(modelName);
Node node= null;
Edge edge= null;
String subCompLabel= null;
for(int i = 0; i < adjMatrix[0].length; i++) {
node= graph.addNode(Integer.toString(i));
subCompLabel= subcompsLabels.get(Integer.parseInt(node.getId()));
subCompLabel= subCompLabel.substring(subCompLabel.lastIndexOf('.') + 1);
node.addAttribute("ui.label", node.getId() + " (" + subCompLabel + ")");
}
for(int i = 0; i < adjMatrix[0].length; i++) {
for(int j = i; j < adjMatrix[0].length; j++) {
if (adjMatrix[i][j] > 0) {
edge= graph.addEdge(i + "-" + j, Integer.toString(i), Integer.toString(j));
edge.addAttribute("ui.label", adjMatrix[i][j]);
}
}
}
FileSinkImages img = new FileSinkImages(FileSinkImages.OutputType.PNG, FileSinkImages.Resolutions.XGA);
img.setStyleSheet("graph { padding: 100px; }");
img.setLayoutPolicy(FileSinkImages.LayoutPolicy.COMPUTED_FULLY_AT_NEW_IMAGE);
try { img.writeAll(graph, TEST_PATH_PNG + modelName + ".png"); } catch (IOException e) { System.out.println("Couldn't create image file "+TEST_PATH_PNG + modelName + ".png"+
"\n"+e.getMessage()); };
SimpleModelViewer viewer= new SimpleModelViewer(graph);
viewer.run();
Object[] params;
for(ClusteringKind kind : ClusteringKind.values()){
params= null;
......@@ -449,24 +500,148 @@ public class AutomaticClusteringTest extends AbstractSymtabTest{
};
break;
}
testCreateClusters(ClusteringAlgorithmFactory.getFromKind(kind), params);
testCreateClusters(ClusteringAlgorithmFactory.getFromKind(kind), params, componentInstanceSymbol, modelName);
}
}
private void testCreateClusters(ClusteringAlgorithm algorithm, Object[] params){
//UnambiguousCluster
TaggingResolver taggingResolver = AbstractSymtabTest.createSymTabAndTaggingResolver(TEST_PATH);
ExpandedComponentInstanceSymbol componentInstanceSymbol = taggingResolver.<ExpandedComponentInstanceSymbol>resolve("clustering.unambiguousCluster", ExpandedComponentInstanceSymbol.KIND).orElse(null);
assertNotNull(componentInstanceSymbol);
private void testCreateClusters(ClusteringAlgorithm algorithm, Object[] params, ExpandedComponentInstanceSymbol componentInstanceSymbol, String modelName){
System.out.println(algorithm);
String algoName= algorithm.toString().substring(0, algorithm.toString().lastIndexOf("@"));
String algoNameShort= algoName.substring(algoName.lastIndexOf(".")+1);
System.out.println(algoName);
List<Set<ExpandedComponentInstanceSymbol>> clusters = null;
if (params != null) clusters = algorithm.cluster(componentInstanceSymbol, params); else
clusters = algorithm.cluster(componentInstanceSymbol);
double colorIncrement= 1.0/clusters.size();
double sizeIncrement= Math.ceil(50/clusters.size());
double color= 0;
double size= 10;
// get stuff together for adjmatrix
List<ExpandedComponentInstanceSymbol> subcompsOrderedByName = ComponentHelper.getSubcompsOrderedByName(componentInstanceSymbol);
Map<String, Integer> labelsForSubcomps = ComponentHelper.getLabelsForSubcomps(subcompsOrderedByName);
Map<Integer, String> subcompsLabels = ComponentHelper.getSubcompsLabels(subcompsOrderedByName);
double[][] adjMatrix = AutomaticClusteringHelper.createAdjacencyMatrix(subcompsOrderedByName,
ComponentHelper.getInnerConnectors(componentInstanceSymbol),
labelsForSubcomps);
// build a graph from this stuff
Graph graph = new SingleGraph(algoNameShort);
Node node= null;
Edge edge= null;
String subCompLabel= null;
for(int i = 0; i < adjMatrix[0].length; i++) {
node= graph.addNode(Integer.toString(i));
subCompLabel= subcompsLabels.get(Integer.parseInt(node.getId()));
subCompLabel= subCompLabel.substring(subCompLabel.lastIndexOf('.') + 1);
node.addAttribute("ui.label", node.getId() + " (" + subCompLabel + ")");
}
for(int i = 0; i < adjMatrix[0].length; i++) {
for(int j = i; j < adjMatrix[0].length; j++) {
if (adjMatrix[i][j] > 0) {
edge= graph.addEdge(i + "-" + j, Integer.toString(i), Integer.toString(j));
edge.addAttribute("ui.label", adjMatrix[i][j]);
}
}
}
// style (colorize + resize) nodes for clusters
Node n;
Edge e;
String nodeName;
String nodeId;
Set<ExpandedComponentInstanceSymbol> cluster;
List<String> clusterNames;
for(int i = 0; i < clusters.size(); i++) {
cluster = clusters.get(i);
clusterNames = cluster.stream().map(CommonSymbol::getFullName).collect(Collectors.toList());
for(int j = 0; j < clusterNames.size(); j++) {
nodeId= null;
nodeId= labelsForSubcomps.get(clusterNames.get(j)).toString();
if (nodeId!=null) {
n= graph.getNode(nodeId);
n.setAttribute("ui.style", "fill-mode: dyn-plain; fill-color: red, black; size: " + size + "px;");
n.setAttribute("ui.color", color);
// find cutting edges and delete or re-color them
for(int k = 0; k < adjMatrix[Integer.parseInt(nodeId)].length; k++) {
if (adjMatrix[Integer.parseInt(nodeId)][k] > 0) {
// target node k is not in current cluster
nodeName= subcompsLabels.get(k);
if (!clusterNames.contains(nodeName)) {
e= null;
e= graph.getEdge(Integer.parseInt(nodeId)+"-"+k);
//graph.removeEdge(e);
if (e!=null) e.setAttribute("ui.style", "fill-mode: plain; fill-color: #F0F0F0;");
}
}
}
}
}
color= color + colorIncrement;
size= size + sizeIncrement;
}
FileSinkImages img = new FileSinkImages(FileSinkImages.OutputType.PNG, FileSinkImages.Resolutions.XGA);
img.setStyleSheet("graph { padding: 100px; }");
img.setLayoutPolicy(FileSinkImages.LayoutPolicy.COMPUTED_FULLY_AT_NEW_IMAGE);
try { img.writeAll(graph, TEST_PATH_PNG + modelName + "/" + graph.getId() + ".png"); } catch (IOException ex) { System.out.println("Couldn't create image file "+TEST_PATH_PNG + graph.getId() + ".png"+
"\n"+ex.getMessage()); };
SimpleModelViewer viewer= new SimpleModelViewer(graph);
viewer.run();
if (modelName=="clustering.midSizeDemoCluster") {
assertTrue(clusters.size() == 2);
Set<ExpandedComponentInstanceSymbol> cluster1 = clusters.get(0);
Set<ExpandedComponentInstanceSymbol> cluster2 = clusters.get(1);
assertTrue((cluster1.size() == 3 && cluster2.size() == 4) ||
(cluster2.size() == 3 && cluster1.size() == 4)
);
List<String> cluster1Names = cluster1.stream()
.map(CommonSymbol::getFullName)
.collect(Collectors.toList());
List<String> cluster2Names = cluster2.stream()
.map(CommonSymbol::getFullName)
.collect(Collectors.toList());
if (cluster1.size() == 4) {
if (cluster1Names.get(0).endsWith("comp0") ||
cluster1Names.get(0).endsWith("comp1") ||
cluster1Names.get(0).endsWith("comp2") ||
cluster1Names.get(0).endsWith("comp3")
) {
assertTrue(cluster1Names.contains(modelName + ".comp0"));
assertTrue(cluster1Names.contains(modelName + ".comp1"));
assertTrue(cluster1Names.contains(modelName + ".comp2"));
assertTrue(cluster1Names.contains(modelName + ".comp3"));
assertTrue(cluster2Names.contains(modelName + ".comp4"));
assertTrue(cluster2Names.contains(modelName + ".comp5"));
assertTrue(cluster2Names.contains(modelName + ".comp6"));
}
} else if (cluster1.size() == 3) {
if (cluster1Names.get(0).endsWith("comp4") ||
cluster1Names.get(0).endsWith("comp5") ||
cluster1Names.get(0).endsWith("comp6")
) {
assertTrue(cluster2Names.contains(modelName + ".comp0"));
assertTrue(cluster2Names.contains(modelName + ".comp1"));
assertTrue(cluster2Names.contains(modelName + ".comp2"));
assertTrue(cluster2Names.contains(modelName + ".comp3"));
assertTrue(cluster1Names.contains(modelName + ".comp4"));
assertTrue(cluster1Names.contains(modelName + ".comp5"));
assertTrue(cluster1Names.contains(modelName + ".comp6"));
}
}
}
if (modelName=="clustering.unambiguousCluster") {
if (algorithm instanceof SpectralClusteringAlgorithm) {
assertTrue(clusters.size() == 2);
......@@ -522,6 +697,7 @@ public class AutomaticClusteringTest extends AbstractSymtabTest{
assertTrue(cluster3Names.contains("clustering.unambiguousCluster.compC"));
assertTrue(cluster4Names.contains("clustering.unambiguousCluster.compD"));
}
}
}
......
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment