Hacker Newsnew | past | comments | ask | show | jobs | submit | Feanim's commentslogin

Shameless plug: I wrote a small service to monitor the status of many cloud services (github included) in one page http://isserviceup.com


Can you provide stats of the best services availability ?


next step: notify (email/slack/twitter/chrome extension/sms) subscribers when a service is back (or down?)


btw: login with github, unlucky today


Is that not an extended variation of the https://cachethq.io logo?


I don't think it can really be considered copying another company when both companies' logos are basically a Font Awesome icon[1,2].

No offense to either company; their logos are pragmatic.

1. http://fontawesome.io/icon/check-circle-o/

2. http://fontawesome.io/icon/check-square-o/


As a weekend project, I created a service to monitor the status of many services (Github included) in one single page http://isserviceup.com/ . You can register with your Github account and star the services you use to receive notifications through Slack when their status change. It's all free and open source, let me know your thoughts!

p.s. I just posted a Show HN here https://news.ycombinator.com/item?id=13117856


You're missing slack status (they're down right now).


isServiceUp looks great.

One suggestion, bubble to the top any services that isn't operational ... that way you can easily see at the top all servics which are down.


by the way, here the link to the github repository https://github.com/marcopaz/is-service-up


Strange. It works fine in my early 2008 MBP.


Plex for iOS and Android is just a front end, you need the server-side of the software to convert video. XBMC can convert video on-the-fly, to do this on iOS it uses private API for hardware acceleration (and that's why you need to jailbreak your device to install it)


1°: s is the sum of the numbers in the array, x = n(n+1)/2-s

2°: s sum, p product, solve the linear system {n(n+1)/2-x+y=s; n!y = px}


The second solution works in linear time only if one assumes that multiplication is a constant time operation. But is it really? If you look at how a processor does multiplication it becomes clear it is a O(log n) operation where n is one of the numbers being multiplied. Thus, the second solution is probably a O(nlogn) solution.


It also requires one to assume n! can be computed. Factorials get huge very quickly.


Sorry, can you expand on what you meant by that?


Sum of first n natural numbers is n(n+1)/2. The sum of the array, represented by s, is n(n+1)/2 - x + y (subtract x - the missing number and add y - the duplicated number) gives:

1: n(n+1)/2 - x + y = s

Product of first n natural numbers is represented as: n! The product of the numbers in array is p.

2: p x / y = n!

(multiply by x - add missing number to product and divide by y - remove duplicated number from product).


If a is duplicated and b missing, computing the sum and the product of all the numbers can give you a-b and a/b, from which you can deduce a and b.




That's an interesting link.

The email subjectline keywords are intersting. Almost all are commerce related: travel, save, prices, markdowns, store, itunes, department, etc.

As if personal email is small minority of their email traffic.


$('body > div').toggle();


That's already the very latest. "Generated by Joel on 2012-01-17 using his domain-profiler software"


  % cloc linux-3.2.1
    37595 text files.
    37127 unique files.
     3995 files ignored.

  http://cloc.sourceforge.net v 1.53  T=355.0 s (93.8 files/s, 39819.0 lines/s)
  --------------------------------------------------------------------------------
  Language                      files          blank        comment           code
  --------------------------------------------------------------------------------
  C                             16577        1555942        1573561        8036765
  C/C++ Header                  13614         316003         537441        1648074
  Assembly                       1252          41013          52412         252626
  XML                             142           2881            739          40365
  make                           1509           6296           6821          23851
  Perl                             41           3268           2592          15131
  Bourne Shell                     67            685           1552           3885
  yacc                              5            455            323           2979
  Python                           19            561            269           2605
  C++                               1            208             57           1524
  lex                               5            204            237           1328
  awk                               8             90             79            714
  Bourne Again Shell               30             75             56            450
  HTML                              2             58              0            378
  NAnt scripts                      1             93              0            372
  Lisp                              1             63              0            218
  ASP                               1             33              0            137
  m4                                1             15              1             84
  XSLT                              6             13             27             70
  sed                               1              0              3             30
  vim script                        1              3             12             27
  Teamcenter def                    1              0              2              5
  --------------------------------------------------------------------------------
  SUM:                          33285        1927959        2176184       10031618
  --------------------------------------------------------------------------------


Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: