Learn from me. Amoma.com is a scam. (2017)

Learn from me. Amoma.com is a scam. (2017)

Thirty minutes later the Manager called me back with the following news:
· They could not locate my reservation
· The reason they could not locate my reservation was because Amoma.com has zero access to Hotel Abri’s internal booking system
· This means that Amoma.com is literally just selling . pdfs with no redeemable value
· This is not the first time it has happened; they have repeatedly demanded that Amoma quit selling fake reservations to their hotel
Opening a Dispute Claim Against Amoma.com
After being on hold with their customer service number for 75 minutes, reaching out to silence on social media, I filed a fraud claim with American Express. Conclusion
American Express has been very helpful in resolving the dispute
Hotel Abri was very helpful in trying to track down the fake reservation
Amoma.com is a garbage company with a scammy business model and you should avoid them like the plague

Source: medium.com

Show HN: G-Fu – a pragmatic Lisp embedded in Go

Show HN: G-Fu – a pragmatic Lisp embedded in Go

Functions are created using ; which accepts an optional name to bind in the current environment, a list of arguments and a body; and returns the function. The next example is taken from the standard library, and expands recursively to a nested series of calls using previous result as first argument. Tasks are first class, preemptive green threads (or goroutines) that run in separate environments and interact with the outside world using channels.

Source: github.com

Smarking (YC W15) is hiring a Back end Engineer ($10K referral bonus)

Smarking (YC W15) is hiring a Back end Engineer ($10K referral bonus)

Smarking is a tech startup leveraging data analytics and machine learning to help parking managers solve parking problems in major urban areas. Founded by MIT PhDs and backed by Y Combinator and Khosla Ventures, we’ve brought real-time data dashboards, predictive analytics, and dynamic pricing to thousands of parking locations for more than 50 clients including cities (Miami, Houston, etc.), airports (Boston, Edmonton, etc.), universities (MIT, Washington University, etc.), real-estate owners, and parking operators. Our data infrastructure, machine learning, and backend services are built with Python.

Source: jobs.lever.co

Memo and Task App

Memo and Task App

Uranus is a hierarchical Memo & Task app. In order to use Uranus, please install Docker in advance. If you want to build Uranus from source code, please install Maven in advance.

Source: github.com

Algorithm Solves Graph Isomorphism in Record Time (2015)

Algorithm Solves Graph Isomorphism in Record Time (2015)

Last month, László Babai, of the University of Chicago, announced that he had come up with a new algorithm for the “graph isomorphism” problem, one of the most tantalizing mysteries in computer science. On the other hand, graph isomorphism is what computer scientists call a “universal” problem: Every possible problem about whether two “combinatorial structures” are isomorphic — for example, the question of whether two different Sudoku puzzles are really the same underlying puzzle — can be recast as a graph isomorphism problem. In 2012, William Gasarch, a computer scientist at the University of Maryland, College Park, informally polled theoretical computer scientists about the graph isomorphism problem and found that 14 people believed it belongs to P, while six believed that it does not.

Source: www.quantamagazine.org

Show HN: Create thousands of videos from a Google sheet

Show HN: Create thousands of videos from a Google sheet

It’s encouraging to see the increase in large companies approaching us to help them solve their challenge to produce ever increasing numbers of video content. Whether that be via templates used in our Quick Edit forms to large volumes of video content based on product data. Think of this as Mail Merge for Video – just like you can produce personalized emails to each client, you can now personalize videos per client, per product, and so on.

Source: www.moovly.com

Pip3 install videoflow – new Python library to do computer vision on video

Pip3 install videoflow – new Python library to do computer vision on video

The output of the application is an annotated video:

A flow application usually consists of three parts:

In the first part of the application you define a directed acyclic graph of computation nodes. Producer nodes create data (commonly they will get the data from a source that is external to the flow). Starting the flow means that the producers start putting data into the flow and processors and consumers start receiving data.

Source: github.com

Is There a Crisis in Capitalism?

Is There a Crisis in Capitalism?

Collier says we’re experiencing three big rifts: 1) a spatial divide between booming cities and struggling small towns; 2) a class divide between people who have a college education and those who don’t;  and 3) a global divide between high- and middle-income countries on the one hand, and fragile states on the other. As a result of the three trends, Collier says, capitalism is delivering for some people but leaving others behind. Similarly, Collier makes a good case for raising taxes on the unearned income of high-wage workers in cities (like when the value of their land goes up simply because they can afford to live in a place where other well-off people want to live).

Source: www.gatesnotes.com

Algorithm Solves Graph Isomorphism in Record Time (2015/2017)

Algorithm Solves Graph Isomorphism in Record Time (2015/2017)

Last month, László Babai, of the University of Chicago, announced that he had come up with a new algorithm for the “graph isomorphism” problem, one of the most tantalizing mysteries in computer science. On the other hand, graph isomorphism is what computer scientists call a “universal” problem: Every possible problem about whether two “combinatorial structures” are isomorphic — for example, the question of whether two different Sudoku puzzles are really the same underlying puzzle — can be recast as a graph isomorphism problem. In 2012, William Gasarch, a computer scientist at the University of Maryland, College Park, informally polled theoretical computer scientists about the graph isomorphism problem and found that 14 people believed it belongs to P, while six believed that it does not.

Source: www.quantamagazine.org