IntelliJ and SceneBuilder problem

I am using Ubuntu 19.04 and IntelliJ 2019 coummunity edition, and I cannot open SceneBuilder in in IntelliJ, the errors are:

java.lang.ClassNotFoundException: com.sun.javafx.fxml.LoadListener PluginClassLoader[org.jetbrains.plugins.javaFX, 192.6262.58] com.intellij.ide.plugins.cl.PluginClassLoader@24672b37

java.lang.NoClassDefFoundError: com/sun/javafx/fxml/LoadListener

com.intellij.diagnostic.PluginException: While loading class com.oracle.javafx.scenebuilder.kit.fxom.FXOMLoader: com/sun/javafx/fxml/LoadListener [Plugin: org.jetbrains.plugins.javaFX]

Project SDK is 10,

and project language level is 10 – local variable type interference

VPN: Problem with DNS

After connecting from at home via VPN to my institute by

sudo openvpn --config /home/myname/thinkpad1/thinkpad1.ovpn 

I cannot browse web pages. (The connection itself seems to be OK, saying “Initialzation sequence completed”). In analyzing the problem on the command line I see:

ping google.com 

gives no answer, whereas

ping 8.8.8.8 

is successful.

Further: Performing

route -n 

I get:

  1. Without VPN connection

Kernel-IP-Routentabelle Ziel Router Genmask Flags Metric Ref Use Iface 0.0.0.0 192.168.0.1 0.0.0.0 UG 600 0 0 wlan0 169.254.0.0 0.0.0.0 255.255.0.0 U 1000 0 0 wlan0 192.168.0.0 0.0.0.0 255.255.255.0 U 600 0 0 wlan0

  1. With VPN

Kernel-IP-Routentabelle Ziel Router Genmask Flags Metric Ref Use Iface 0.0.0.0 10.8.0.217 128.0.0.0 UG 0 0 0 tun0 0.0.0.0 192.168.0.1 0.0.0.0 UG 600 0 0 wlan0 10.8.0.1 10.8.0.217 255.255.255.255 UGH 0 0 0 tun0 10.8.0.217 0.0.0.0 255.255.255.255 UH 0 0 0 tun0 128.0.0.0 10.8.0.217 128.0.0.0 UG 0 0 0 tun0 147.142.19.56 192.168.0.1 255.255.255.255 UGH 0 0 0 wlan0 169.254.0.0 0.0.0.0 255.255.0.0 U 1000 0 0 wlan0 192.168.0.0 0.0.0.0 255.255.255.0 U 600 0 0 wlan0

Ubuntu 16.04 three monitor problem with HDMI and VGA port

I have two display ports on my laptop, Lenovo G580: HDMI and VGA port. If I used one of both to extend my monitor, it works. Also, Both ports works if I turn off built-in display. However, if I turn on all three monitors, only two of three works.

Here the error message,

could not set the configuration for CRTC 65 GDBus.Error:org.gtk.GDBus.UnmappedGError.Quark._gsd_2drr_2derror_2dquark.Code2: could not set the configuration for CRTC 65 

I checked my CPU, i7-3520M supports up to 3 displays.

What’s wrong and how to solve this problem?

Apt-Cache Corruption problem on Linux Mint Tessa Mate 19.1 [on hold]

I cannot seem to solve an issue with a apt-cache corruption problem on my operating system. Now I have looked up the issues and tried a few commands, but its not seeming to work. So I need guidance on issue see anyone else has ran into this problem and found a solution to fix…. I have also tried basics of switching the mirrors and still run into the issue as well….. maybe a clean install or upgrade to the next version is my second option if I cant find a solution.

How could I match my line-of-sight with Theta star? How could I fix my below problem?

I’m trying to implement my Theta star algorithm, but first I need to implement the line-of-sight algorithm. I have implemented below my lineOFsight algorithm in Python, I don’t know how accurate it is. But when I call this function of line of sight in my program, I got the below error:

    sight = lineOfsight(elevation1,drone_height,y1,x1,y2,x2) NameError: name 'lineOfsight' is not defined 

How could I fix this error?… And Is it ture what I have coded?

My Python code below for line-of-sight Algorithm:

from Thetastar import * def lineOfsight(elevation1,drone_height,y1,x1,y2,x2):     y_size = len(elevation1)     x_size = len(elevation1[0])      #Distance     dy=y2-y1;     dx=x2-x1;      if dy < 0:         dy=-dy         sy=-1     else:         sy=1      if dx < 0:         dx=-dx         sx=-1     else:         sx=1      f=0     if dy >= dx:         while y1 != y2:             f = f + dx             if f>=dy and 0<y1+(sy-1)/2 and y1+(sy-1)/2<y_size and 0<x1+(sx-1)/2 and x1+(sx-1)/2<x_size:                  if elevation1(y1+(sy-1)/2,x1+(sx-1)/2)> drone_height:                      sight = 0                     return sight                 x1 = x1 + sx                 f = f - dy                 if 0<y1+(sy-1)/2 and y1+(sy-1)/2<y_size and 0<x1+(sx-1)/2 and x1+(sx-1)/2<x_size:                     if f !=0 and elevation1(y1+(sy-1)/2,x1+(sx-1)/2)> drone_height:                         sight = 0                         return sight                  if 0<y1+(sy-1)/2 and y1+(sy-1)/2<y_size and 1<x1 and x1<x_size:                            if dx==0 and elevation1(y1+(sy-1)/2,x1)>h and E(y1+(sy-1)/2,x1-1) > drone_height:                         sight=0                         return sight                  y1=y1+sy      else:         while x1 != x2:                      f=f+dy;             if f>=dx and 0<y1+(sy-1)/2 and y1+(sy-1)/2<y_size and 0<x1+(sx-1)/2 and x1+(sx-1)/2<x_size:                 if elevation1(y1+(sy-1)/2,x1+(sx-1)/2) > drone_height:                     sight=0                     return sight                 y1=y1+sy                 f=f-dx              if 0<y1+(sy-1)/2 and y1+(sy-1)/2<y_size and 0<x1+(sx-1)/2 and x1+(sx-1)/2<x_size:                 if f != 0 and elevation1(y1+(sy-1)/2,x1+(sx-1)/2) > drone_height:                     sight=0                     return sight              if 1<y1 and y1<y_size and 0<x1+(sx-1)/2 and x1+(sx-1)/2<x_size:                 if dy==0 and elevation1(y1,x1+(sx-1)/2)>h and E(y1-1,x1+(sx-1)/2)> drone_height:                     sight=0                     return sight             x1=x1+sx     sight = 1     return sight  

Solving/mitigating the free rider problem without requiring identification?

Is there any algorithm/protocol out there to solve/mitigate the free rider problem without requiring identification?

In a web system, I want to distribute exactly one virtual dollar per day to each person, without requiring identification when people create an account.

A solution of mitigation, would mean for example that one person may get up to $ 2 per day (in case he created more than one account), but not much more.

I also need a solution that distributes to every person about the same amount of money per day. So the ratio between the money distributed to every two different people per day should be around 1.