[WTS] Get your super fast OpenVZ VPS starting from $5.83: Bulgaria, USA, Canada locations.

NEW! Budget Linux VPS as low as $5.83 per month:

Locations:
Germany, Switzerland, Netherlands, Bulgaria (100 Gbps DDoS Protection), USA – Miami (FL), USA – New York (NY), Canada (480 Gbps DDoS Protection).

************************************************** ********************************
Here is the promo:

XMASQH25OFFHOST -25% SHARED RESELLER VPS AND COMODO POSITIVE SSL –
Recurring 2 more times!

—-
XMASQH12OFFDEDI -12% – any billing cycle, Lifetime recurring discount on
ALL SWITZERLAND AND USA DEDICATED SERVERS!

Please note the discount is visible on the Review & Checkout step.
And Comodo Positive SSL certificate!
************************************************** ********************************
Linux OpenVZ (Budget) VPS (LE)

OpenVZ Light Edition VPS
1 GB Dedicated memory
20 GB Disk space
500 GB Bandwidth
Full Root access
1 IP address
CentOS/Debian/Ubuntu
$5.83 PER MONTH
(applies to annual payment)
ORDER NOW

Need another Linux VPS? Check here: https://click.pstmrk.it/2ts/www.QHos…Awe/lF-7kUdPWS

Desiderate Instant Managed VPS? Here you are: http://www.qhoster.com/cpanel-managed-vps.html

Current promotions:

***********************************************
Discounts for all hosting and all VPS plans and Comodo Positive SSL certificate:

QHSPRING33
Recurring 33% OFF!
(applies to any billing cycle)

***********************************************
QHoster payment options:

WebMoney, Perfect Money, Bitcoin, NETELLER, Payza (formerly Alertpay), Skrill (formerly Moneybookers), Litecoin, Darkcoin (DRK), SolidTrust Pay, cashU, Ukash, Payeer, OKPAY, EgoPay, paysafecard, Alipay, MoneyGram, Western Union, SOFORT Banking, QIWI, Alfa Click, Sberbank Rossii, Promsvyazbank (PSB), Svyaznoy, Przelewy24, Interac, Boleto Bancario, MercadoPago, PagSeguro, OneCard, DaoPay, Fortumo.

Learn More about Payment options here:
http://www.qhoster.com/payment-methods.html

Windows 7 & 2003/2008 Server in Minutes
Choose your payment option, choose your server location and get your best Windows VPS!

Instant Setup! Ready in 20 minutes!

Visit QHoster now.

cPanel Shared Webhosting
CR2QS5B85D30% OFF!
Applies to all shared and VPS plans, 3+ month period of order!

VPS and Dedicated Server
Personal voucher for $50
GHR8WY5P4P
(applies to annual billing cycles)

Windows RDP VPS
– Managed & Scalable – Instant RDP VPS Upgrades – CPU, RAM etc.
– Full Adminstrator Access to Your Windows RDP VPS
– Use Windows Server & 7 Remotely Like Your Desktop Computer
– Choice: UK,USA,Canada,France,Germany,Netherlands,Switzerla nd

Windows VPS RDP (1)
2 CPU Cores (Intel Xeon)
1.5 GB Dedicated Memory
60 GB Disk Space
1 TB Monthly Bandwidth
1 GBit/s Internet Port
1 IP (additional 64 IPs)
Price $19.96/mo
ORDER HERE

Windows VPS RDP (2)
3 CPU Cores (Intel Xeon)
3 GB Dedicated Memory
120 GB Disk Space
2 TB Monthly Bandwidth
1 GBit/s Internet Port
1 IP (additional 64 IPs)
Price $39.92/mo
ORDER HERE

Windows VPS RDP (3)
4 CPU Cores (Intel Xeon)
4.5 GB Dedicated Memory
180 GB Disk Space
3 TB Monthly Bandwidth
1 GBit/s Internet Port
1 IP (additional 64 IPs)
Price $59.88/mo
ORDER HERE

Windows KVM Servers

Windows RDP VPS – KVM 1
1.5 GB Dedicated memory
60 GB Disk space
1000 GB Bandwidth
Administrator RDP access
1 IP address
Windows Server 2008/2012/2016
$24.95/m
ORDER HERE

Windows RDP VPS – KVM 2
3 GB Dedicated memory
120 GB Disk space
2000 GB Bandwidth
Administrator RDP access
1 IP address
Windows Server 2008/2012/2016
$49.90/m
ORDER HERE

Have questions?
Feel free to contact us:
https://www.qhoster.com/clients/subm…tep=2&deptid=1

.(tagsToTranslate)webmaster forum(t)internet marketing(t)search engine optimization(t)web designing(t)seo(t)ppc(t)affiliate marketing(t)search engine marketing(t)web hosting(t)domain name(t)social media

How do I make formulas effective only starting from tomorrow in Google Sheets?

I made a google sheet for insulin-dependent diabetics, to calculate insulin units based on their meal content and glucose reading inputs. Each day has its own block of cells for the patient. When I edit the governing formulas in another sheet called ‘factors’, how do I make them effective starting from tomorrow, leaving previously calculated cells unchanged, to get back to as a history?

Here is the formula I’m using in a C5 calculating cell:

=if(C4=””,””,(C4-factors!C$7)/factors!C$5+C3/factors!C$3)

And Here is an example of the sheet

data structures – Dijkstra Algorithm error (always starting at index 0)

I am currently doing my last assignment for Data Structures and Algorithms. One of the programming questions in my assignment is based on Dijkstra Algorithm. I refer to this link to aid my assignment: https://algorithms.tutorialhorizon.com/print-all-paths-in-dijkstras-shortest-path-algorithm/. However, I noticed a bug in this program implementation. Allow me to explain:

import java.util.Comparator;
import java.util.LinkedList;
import java.util.PriorityQueue;
import javafx.util.Pair;

public class Graph {

int vertices;
LinkedList<Edge>() adjacencylist;

Graph(int vertices) {
  this.vertices = vertices;
  adjacencylist = new LinkedList(vertices);
  //initialize adjacency lists for all the vertices
  for (int i = 0; i <vertices ; i++) {
      adjacencylist(i) = new LinkedList<>();
}
}

public void addEdge(int source, int destination, int weight) {
    Edge edge = new Edge(source, destination, weight);
    adjacencylist(source).addFirst(edge);

    edge = new Edge(destination, source, weight);
    adjacencylist(destination).addFirst(edge); //for undirected graph
}

public void dijkstra_PrintPaths(int sourceVertex){

boolean() SPT = new boolean(vertices);
//distance used to store the distance of vertex from a source
int () distance = new int(vertices);

int () parentVertex = new int(vertices);

//parent of the source vertex will be -1
parentVertex(0) = -1;

//Initialize all the distance to infinity
for (int i = 0; i <vertices ; i++) {
    distance(i) = Integer.MAX_VALUE;
}
//Initialize priority queue
//override the comparator to do the sorting based keys
   PriorityQueue<Pair<Integer, Integer>> pq = new PriorityQueue<>(vertices, new 
   Comparator<Pair<Integer, Integer>>() {
    @Override
    public int compare(Pair<Integer, Integer> p1, Pair<Integer, Integer> p2) {
        //sort using distance values
        int key1 = p1.getKey();
        int key2 = p2.getKey();
        return key1-key2;
    }
});
//create the pair for for the first index, 0 distance 0 index
distance(0) = 0;
Pair<Integer, Integer> p0 = new Pair<>(distance(0),0);
//add it to pq
pq.offer(p0);

//while priority queue is not empty
while(!pq.isEmpty()){
    //extract the min
    Pair<Integer, Integer> extractedPair = pq.poll();

    //extracted vertex
    int extractedVertex = extractedPair.getValue();
    if(SPT(extractedVertex)==false) {
        SPT(extractedVertex) = true;

        //iterate through all the adjacent vertices and update the keys
        LinkedList<Edge> list = adjacencylist(extractedVertex);
        for (int i = 0; i < list.size(); i++) {
            Edge edge = list.get(i);
            int destination = edge.destination;
            //only if edge destination is not present in mst
            if (SPT(destination) == false) {
                ///check if distance needs an update or not
                //means check total weight from source to vertex_V is less than
                //the current distance value, if yes then update the distance
                int newKey =  distance(extractedVertex) + edge.weight ;
                int currentKey = distance(destination);
                if(currentKey>newKey){
                    Pair<Integer, Integer> p = new Pair<>(newKey, destination);
                    pq.offer(p);
                    distance(destination) = newKey;
                    parentVertex(destination) = extractedVertex;
                }
            }
        }
    }
}
//print Shortest Path Tree
printDijkstra(parentVertex, distance, sourceVertex);
}

     public void printDijkstra(int() parent, int () distance, int sourceVertex){
       System.out.println("Dijkstra Algorithm: (With all paths)");
       for (int i = 0; i <vertices ; i++) {
          System.out.print(" " + sourceVertex + "--> " +   + i + ": distance="+distance(i) + "  Path : ");
          printPathUtil(parent, i);
          System.out.println();
}
}

public void printPathUtil(int parent(), int destination){
   //if vertex is source then stop recursion
   if(parent(destination) == -1) {
      System.out.print("0 ");
       return;
  }
  printPathUtil(parent, parent(destination));
  System.out.print(destination + " ");
 }

public static void main(String() args) {
   int vertices = 6;
   Graph graph = new Graph(vertices);
   graph.addEdge(0, 1, 5);
   graph.addEdge(0, 2, 3);
   graph.addEdge(1, 2, 1);
   graph.addEdge(1, 3, 2);
   graph.addEdge(2, 3, 4);
   graph.addEdge(3, 4, 2);
   graph.addEdge(4, 5, 6);
   graph.dijkstra_PrintPaths(0);

   System.out.println();

   graph.dijkstra_PrintPaths(3);
}

Edge class:

public class Edge {

int source;
int destination;
int weight;

public Edge(int source, int destination, int weight) {
   this.source = source;
   this.destination = destination;
   this.weight = weight;
 }
 }

for the main method in graph class, I called the dijkstra_PrintPaths function 2 times to print paths starting from different nodes.

Output:

Dijkstra Algorithm: (With all paths)
0--> 0: distance=0  Path : 0 
0--> 1: distance=4  Path : 0 2 1 
0--> 2: distance=3  Path : 0 2 
0--> 3: distance=6  Path : 0 2 1 3 
0--> 4: distance=8  Path : 0 2 1 3 4 
0--> 5: distance=14  Path : 0 2 1 3 4 5 

Dijkstra Algorithm: (With all paths)
3--> 0: distance=0  Path : 0 
3--> 1: distance=4  Path : 0 2 1 
3--> 2: distance=3  Path : 0 2 
3--> 3: distance=6  Path : 0 2 1 3 
3--> 4: distance=8  Path : 0 2 1 3 4 
3--> 5: distance=14  Path : 0 2 1 3 4 5 

This is where the bug manifests, as seen in the second chunk of the output. It is to start at 3 but the paths printed out are those similar to 0. It only makes sense that the path starts at 3 and goes to node to node till the destination. I hope you guys can help, thanks.

[WTS] Affordable SSD VPS accounts starting at $49.99/M.

KVC Hosting was started in 2010 with the sole purpose of creating a host company that was affordable to all. Since its inception, the company has had steady growth due to our practical business model, so much so that we’ve increased the size of our data center in order to meet the demands of our clients. Putting customers first is what drives us, and this has led to us winning multiple awards for providing quality technology at a great price. We focus on providing cost-effective web hosting solutions, and our extensive experience in the industry assures that you will receive high quality and economical web hosting options that can be customized to suit your needs. We are proud of the trust that our partners and customers have placed in us and welcome all to give our company a try.
Be in charge of your own Virtual Private Server (VPS Hosting)! It will work just as if you have your own machine.

Our virtual private servers are affordable and powerful, offering you your own mail server and greater security control. SSD VPS Hosting is a great fit for businesses that are anticipating quick growth, huge website traffic, or who run highly dynamic, interactive websites.

SSD VPS HOSTING

Enterprise Cloud SSD VPS
P1
8 GB DDR3 RAM
100 GB SSD RAID 10
4 CPU XEON@ 2.13 GHz (8.52GHz)
6 TB Premium Bandwidth
$49.99/M
ORDER NOW

P5
24 GB DDR3 RAM
300 GB SSD RAID 10
8 CPU XEON@ 2.13 GHz (17.0GHz)
22 TB Premium Bandwidth
$169.99/M
ORDER NOW

REGULAR VPS

VPS K
Disk Space – 75 GB
Bandwidth – 200 GB
RAM – 4 GB
CPANEL/WHM – Free
$25.99/M
ORDER NOW!

VPS O
Disk Space – 225 GB
Bandwidth – 3 TB
RAM – 10 GB
CPANEL/WHM – Free
$79.99/M
ORDER NOW!

Have a question?
Please feel free to contact us: sales at kvchosting.net

.(tagsToTranslate)webmaster forum(t)internet marketing(t)search engine optimization(t)web designing(t)seo(t)ppc(t)affiliate marketing(t)search engine marketing(t)web hosting(t)domain name(t)social media

[WTS] QHoster.com: Linux OpenVZ Budget VPS starting from $5.83 per month!

NEW! Budget Linux VPS as low as $5.83 per month:

Locations:
Germany, Switzerland, Netherlands, Bulgaria (100 Gbps DDoS Protection), USA – Miami (FL), USA – New York (NY), Canada (480 Gbps DDoS Protection).

************************************************** ********************************
Here is the promo:

XMASQH25OFFHOST -25% SHARED RESELLER VPS AND COMODO POSITIVE SSL –
Recurring 2 more times!

—-
XMASQH12OFFDEDI -12% – any billing cycle, Lifetime recurring discount on
ALL SWITZERLAND AND USA DEDICATED SERVERS!

Please note the discount is visible on the Review & Checkout step.
And Comodo Positive SSL certificate!
************************************************** ********************************
Linux OpenVZ (Budget) VPS (LE)

OpenVZ Light Edition VPS
1 GB Dedicated memory
20 GB Disk space
500 GB Bandwidth
Full Root access
1 IP address
CentOS/Debian/Ubuntu
$5.83 PER MONTH
(applies to annual payment)
ORDER NOW

Need another Linux VPS? Check here: https://click.pstmrk.it/2ts/www.QHos…Awe/lF-7kUdPWS

Desiderate Instant Managed VPS? Here you are: http://www.qhoster.com/cpanel-managed-vps.html

Current promotions:

***********************************************
Discounts for all hosting and all VPS plans and Comodo Positive SSL certificate:

QHSPRING33
Recurring 33% OFF!
(applies to any billing cycle)

***********************************************
QHoster payment options:

WebMoney, Perfect Money, Bitcoin, NETELLER, Payza (formerly Alertpay), Skrill (formerly Moneybookers), Litecoin, Darkcoin (DRK), SolidTrust Pay, cashU, Ukash, Payeer, OKPAY, EgoPay, paysafecard, Alipay, MoneyGram, Western Union, SOFORT Banking, QIWI, Alfa Click, Sberbank Rossii, Promsvyazbank (PSB), Svyaznoy, Przelewy24, Interac, Boleto Bancario, MercadoPago, PagSeguro, OneCard, DaoPay, Fortumo.

Learn More about Payment options here:
http://www.qhoster.com/payment-methods.html

Windows 7 & 2003/2008 Server in Minutes
Choose your payment option, choose your server location and get your best Windows VPS!

Instant Setup! Ready in 20 minutes!

Visit QHoster now.

cPanel Shared Webhosting
CR2QS5B85D30% OFF!
Applies to all shared and VPS plans, 3+ month period of order!

VPS and Dedicated Server
Personal voucher for $50
GHR8WY5P4P
(applies to annual billing cycles)

Windows RDP VPS
– Managed & Scalable – Instant RDP VPS Upgrades – CPU, RAM etc.
– Full Adminstrator Access to Your Windows RDP VPS
– Use Windows Server & 7 Remotely Like Your Desktop Computer
– Choice: UK,USA,Canada,France,Germany,Netherlands,Switzerla nd

Windows VPS RDP (1)
2 CPU Cores (Intel Xeon)
1.5 GB Dedicated Memory
60 GB Disk Space
1 TB Monthly Bandwidth
1 GBit/s Internet Port
1 IP (additional 64 IPs)
Price $19.96/mo
ORDER HERE

Windows VPS RDP (2)
3 CPU Cores (Intel Xeon)
3 GB Dedicated Memory
120 GB Disk Space
2 TB Monthly Bandwidth
1 GBit/s Internet Port
1 IP (additional 64 IPs)
Price $39.92/mo
ORDER HERE

Windows VPS RDP (3)
4 CPU Cores (Intel Xeon)
4.5 GB Dedicated Memory
180 GB Disk Space
3 TB Monthly Bandwidth
1 GBit/s Internet Port
1 IP (additional 64 IPs)
Price $59.88/mo
ORDER HERE

Windows KVM Servers

Windows RDP VPS – KVM 1
1.5 GB Dedicated memory
60 GB Disk space
1000 GB Bandwidth
Administrator RDP access
1 IP address
Windows Server 2008/2012/2016
$24.95/m
ORDER HERE

Windows RDP VPS – KVM 2
3 GB Dedicated memory
120 GB Disk space
2000 GB Bandwidth
Administrator RDP access
1 IP address
Windows Server 2008/2012/2016
$49.90/m
ORDER HERE

Have questions?
Feel free to contact us:
https://www.qhoster.com/clients/subm…tep=2&deptid=1

.(tagsToTranslate)webmaster forum(t)internet marketing(t)search engine optimization(t)web designing(t)seo(t)ppc(t)affiliate marketing(t)search engine marketing(t)web hosting(t)domain name(t)social media

boot loop – Nexus 7 2013 – stuck at android is starting optimizing apps. trying adb to get the data

I have a 2013 model Nexus 7.
It is running 6.0.1, unmodified with locked bootloader. USB debugging is on.

Battery drained to 0. Charged then the device is stuck on boot loop .. android is optimizing app X of x.
I don’t wanna lose the data so I’ve avoided hard reset.

  • I’ve wiped cache more than once.

  • I tried ADB Commands .. and while on the android is starting I can list the device and I can list the directoies ..

  • Tried adb pull /
    and it return this message.

    c:Adb>adb pull /

    • daemon not running; starting now at tcp:5037
    • daemon started successfully adb: warning: stat failed for path /proc/self/task/1208/root/proc/self/task/1208/root/proc/self/task/1208/root/proc/self/task/1208/root/proc/self/task/1208/root/proc/self/task/1208/root/proc/self/task/1208/root/proc/self/task/1208/root/proc/self/task/1208/root/proc/self/task/1208/root/proc/self/task/1208/root/proc/self/task/1208/root/proc/self/task/1208/root/proc/self/task/1208/root/proc/self/task/1208/root/proc/self/task/1208/root/proc/self/task/1208/root/proc/self/task/1208/root/proc/self/task/1208/root/proc/self/task/1208/root/proc/222/task/1208/fd/15:
      Protocol not available

Tried shell to see if I can list folders and

Adb shell ls /sdcard/sdcard
it returns the same message.

c:Adb>adb shell ls /mnt

asec

expand

media_rw

obb

runtime

sdcard *******************

secure

user

c:Adb>adb shell ls /mnt/sdcard/
/mnt/sdcard/: No such file or directory

Is there any way that I can retrieve the data before hard resetting .. through adb or custom recovery .. or whatever.

Starting with OOP | Python

I’m not very experienced with OOP and Python and I’ve been wanting to kind of professionalize my way of writing code, etc.

I have a pretty big project but I can’t post it all here, it’s a bit much so I have taken two classes. My question is; in what departments can I improve?

from datetime import datetime

from pycoingecko import CoinGeckoAPI

import config


def raise_type_error(message):
    # Raises a type error
    raise TypeError(message)


class CoinClient:
    # Response object keys (per coin)
    # prices
    # market_caps
    # total_volumes

    def __init__(self, ticker):
        self.ticker = ticker
        self.cg = CoinGeckoAPI()
        self.response_dict = dict()

    # Gets raw data between start and end date (UNIX time format)
    def get_between(self, start_date: float, end_date: float):
        # Returns one CoinGecko response object for coin specified
        if isinstance(self.ticker, str):
            return False, self.cg.get_coin_market_chart_range_by_id(self.ticker, config.currency, start_date, end_date)

        # Returns a dict of CoinGecko response objects for coins specified
        elif isinstance(self.ticker, list):
            for c in self.ticker:
                self.response_dict(c) = self.cg.get_coin_market_chart_range_by_id(c, config.currency, start_date,
                                                                                  end_date)

            return True, self.response_dict
        # Raise TypeError is self.ticker isn't a string or list.
        else:
            raise_type_error(
                "Ticker must either be a string or list of strings.")

class RawResponse:
    # Turns CoinClient response object into readable (UNIX -> DATETIME)
    def __init__(self, data):
        self.data = data
        self.response_dict = dict()

    def __iterate(self, ls):
        # Iterate over the array with values (unix, value)
        arr = list()
        for i in ls:
            # Return an array in the same format as the original object.
            arr.append((datetime.fromtimestamp(i(0) / 1000).date(), i(1)))
        return arr

    def beautify_between(self):
        l, data = self.data(0), self.data(1)
        if isinstance(data, dict):
            # Check if data is a list or not, if yes it iterates over the names of the coins
            if l:
                self.response_dict('multiple') = True
                for c in data:
                    self.response_dict(c) = {}
                    for k in data(c):
                        # Update dict_key(coin) with k(price, total_volumes, market_caps) with ((datetime, value), etc.)
                        self.response_dict(c).update(
                            {k: self.__iterate(data(c)(k))})
            else:
                self.response_dict('multiple') = False
                for k in data:
                    # Update k(price, total_volumes, market_caps) with ((datetime, value), etc.)
                    self.response_dict.update({k: self.__iterate(data(k))})
        else:
            # Raise type error, data is not a dict.
            raise_type_error("Data must either be of type dict")

        # Return response dict
        return self.response_dict

For the full project, the repo is here: https://github.com/victorbip/crypto-data-visualize (it is not finished yet and not 100% functional, am just interested in some advice along the way)

This is my first real attempt at programming in an object oriented manner, so even general information is much appreciated.

networking – Ubuntu Server 20.04 network-manager not starting VPN automatically

I am getting desperate here. I need to connect a Ubuntu Server Machine on a VPS to a network to monitor several machines. I can only connect to the network with L2TP over IPsec.

I have tried installing the GUI on the Ubuntu Server, changing Netplan to use Network Manager as renderer, but this way I can’t manage to get the VPN connection starting automatically on boot. I cannot start the GUI tool sudo nmcli-connection-editorfrom VNC because it fails to start a GUI applet with privileges.
The only option I have found is to use nmcli editor over ssh with sudo nmcli c edit netplan-01-eth0 and trying to set the connection.secondaries value to the UUID of the “myvpn” connection.

This doesn’t work as rebooting the VPS just removes the value of connection.secondaries back to an empty value.

I need a solution to keep the VPN always up, regardless of disconnections from the VPN Server (similar to DPD in Strongswan) and to reboot.

I would love to use strongswan, but I cannot make swanctl to work.