sane-find-scanner does not detect Brother DS-720D but simple scan and xsane does

I have Brother DS-720D and connected it on a newly installed ubuntu 16.04. I installed the drivers libsane-dsseriesfrom Brother’s website. The scanner works and xsane and simple scan detects it. However using sudo sane-find-scanner does not detect it and simply outputs the #No USB scanners found. I verified that the files are in the /usr/lib/x86_64/sane folder. I tried other solutions like:

  1. Reinstalling the drivers
  2. Verifying that from lsusb it is detected
  3. Editing the /etc/udev/rules.d/60-libsane.rules and adding the lines:

    #Brother ATTRS{idVendor}=="04f9", ENV{libsane_matched}="yes"

Fast and simple way to read long time series (raw sqlite v ORM)?

I started off using sqlite for reading and writing time series data. However read operation was taking too long, even after creating an index.

I therefore added a Peewee ORM on top (something I used in past for ensuring persistence in case of server reboot). The logic was that ORM would keep data in-memory, allowing quicker access than reading from DB on disk directly. However I timed the read duration and it seems identical.

Was my assumption that ORM would load everything in-memory on object creation incorrect? Is it then just nothing more than a fancy alternative to using the sqlite driver directly?

“Wrong answer” for extremely small, simple problem on codechef

ATM: Problem Code: HS08TEST from codechef.

Pooja would like to withdraw X $ US from an ATM. The cash machine will only accept the transaction if X is a multiple of 5, and Pooja’s account balance has enough cash to perform the withdrawal transaction (including bank charges). For each successful withdrawal the bank charges 0.50 $ US. Calculate Pooja’s account balance after an attempted transaction.


  • Positive integer $ 0 < X \leq 2000$ – the amount of cash which Pooja wishes to withdraw.

  • Nonnegative number $ 0 \leq Y \leq 2000$ with two digits of precision – Pooja’s initial account balance.


  • Output the account balance after the attempted transaction, given as a number with two digits of precision. If there is not enough money in the account to complete the transaction, output the current bank balance.

Example – Successful Transaction


30 120.00



Example – Incorrect Withdrawal Amount (not multiple of 5)


42 120.00



My solution in C++ is:

#include <bits/stdc++.h> using namespace std; int main() {   float bal;   int w;   cin>>w>>bal;   if(w+.5> bal  || w%5!= 0)     cout<<bal<<".00";   else     cout<<fixed<<setprecision(2)<< bal-w-.5;     return 0; } 

Simple money making method- $200 in 24hrs

I recently discovered one of the best methods there are to make money. You don't need to have any type of special abilities in order to do this method. While it's not going to get you 6 figures, it will help you get money easily and quickly. It is an insanely simple method. To do this method, all you need to do is download the pdf below. It will give you instructions. Have fun!!qbZQwCKL!AqUCgLzLfY5jlvAwUERTPghbudoLhLmeDX7-YzRLFAc

Best way to implement a simple HTTP server for user interface in Python?

I’m making a web scraping tool and I want to be able to harness the power of HTML, CSS, JavaScript, etc. I was a freelance web developer before and I’m way more comfortable making a web page than designing a GUI.

So far it looks like trying to implement my own simple HTTP server is gonna be a mess of code and take longer to make than the actual scraper itself. Are there any good options out there specifically for this type of thing?

I can edit your photos and make it look awesome with Photoshop and Lightroom with simple charges. for $4

I am a professional Photoshop artist. I can edit your photos and make it awesome. I use Adobe Photoshop and Lightroom to edit photos. I have very good experience in this field and i edited so much photos for Instagram and Facebook posts. Which looks amazing. I am sure that my work well definitely satisfies you. This is some example of my work.

by: Hiren249
Created: —
Category: Art & Design
Viewed: 116

Simple hamilton cycle reduction


  • Input: A undirected graph G and 2 nodes s, t

  • Question: Does G contain a hamilton path from s to t?


  • Input: A undirected graph G and a nodes s

  • Question: Does G contain a hamilton cycle starting at s?

I wish to show HAMCYCLE is NP-hard

I’ll show this by doing $ HAMPATH \leq_p HAMCYCLE$ since HAMPATH is known to be NP-COMPLETE

Reduction is as follows

$ (G, s, t) \to (G’, s’)$

where $ s’ = s$ and for $ G’$ I will add one edge from $ t$ to $ s’$

This is polynomial time because we are adding only an edge

if $ (G, s, t) \in HAMPATH$ , then we know there is a hamilton path from s to t, our graph G’ will be $ (s’, \dots, t)$ but since we added a edge from $ t$ to $ s’$ then

$ (s’, \dots, t, s’)$ , a cycle, thus $ (G’,s’) \in HAMCYCLE$

Now doing the converse, if $ (G’, s’) \in HAMCYCLE$ then there exist a hamilton cycle from $ (s’, …, s’)$ that visits every node and comes back to s’ meaning there is a node $ t$ right before $ s$ to make this a hamilton path, thus $ (G, s, t) \in HAMPATH$

Above is my entire attempt. I was wondering if I could call on $ t$ in my reduction since its not used as a input in HAMCYCLE ?