Search Results

Search found 127626 results on 5106 pages for 'http status code 408'.

Page 113/5106 | < Previous Page | 109 110 111 112 113 114 115 116 117 118 119 120  | Next Page >

  • Google Drive SDK: Writing your first Drive app on Android

    Google Drive SDK: Writing your first Drive app on Android If you want to write a Drive app on Android and don't know how to get started, this is the sessions for you. We'll start from the very basics and go through all the steps needed to build an Android app that uses the device camera to take pictures and upload them to Google Drive. From: GoogleDevelopers Views: 0 0 ratings Time: 03:30:00 More in Science & Technology

    Read the article

  • Google I/O Sandbox Case Study: MobileASL

    Google I/O Sandbox Case Study: MobileASL We interviewed MobileASL at the Google I/O Sandbox on May 11, 2011 and they explained to us the benefits of developing their accessibility applications on the Android platform. MobileASL is a video compression project that aims to make sign language communication on mobile phones a reality. For more information on Accessibility Developers, visit: google.com For more information on MobileASL, visit: mobileasl.cs.washington.edu From: GoogleDevelopers Views: 14 0 ratings Time: 01:57 More in Science & Technology

    Read the article

  • Google Games Chat #7

    Google Games Chat #7 The Google Games Chat (official motto: "Now with 30% less swearing") is back! And we're ready to talk about all things Halloween related. Like zombies! And vampires! And things in games that scare us, like corrupt save game files. But we probably won't get Todd to talk about Amnesia: TDD, because he's too scared to play it. What a chicken. From: GoogleDevelopers Views: 0 0 ratings Time: 00:00 More in Gaming

    Read the article

  • Cron job checking for changes in Git repository

    - by HNygard
    We have just moved our server configs to a Git repository. Therefore there should not be any changes in any of the repository folders. I was thinking about how I could set up a cron job to check for any uncommited changes. How could a cron job be set up to check for changes in a Git repository? Greping the output of the git status command might just do it. Grep and cron jobs are not my strong side. Here are some sample outputs from git status: Standing the folder containing the git repository (e.g. /path/gitrepo/) with changed files: $ git status # On branch master # Changes not staged for commit: # (use "git add <file>..." to update what will be committed) # (use "git checkout -- <file>..." to discard changes in working directory) # # modified: apache2/sites-enabled/000-default # # Untracked files: # (use "git add <file>..." to include in what will be committed) # # apache2/conf.d/test no changes added to commit (use "git add" and/or "git commit -a") Standing in the folder when there is no changes: $ git status # On branch master nothing to commit (working directory clean) Update: Synced up with origin is not important. There should be no local changes. Local files that must be in place go into the .gitignore file. In addition to the server configs there are also git repos for content (static web sites, web apps, wordpress, etc). None of the repositories should have local changes. We might use Puppet in the long run since its being used for development of one of the web apps.

    Read the article

  • Google Drive SDK: Sharing files and managing permissions

    Google Drive SDK: Sharing files and managing permissions During this session we'll explain how to use the Google Drive SDK to manage permissions and sharing settings of files. We'll go through the various permission types, roles and values and show to easily embed the Google Drive sharing dialog in your app. From: GoogleDevelopers Views: 0 0 ratings Time: 00:00 More in Science & Technology

    Read the article

  • Apps Script Office Hours - October 18, 2012

    Apps Script Office Hours - October 18, 2012 In this episode Ikai and Arun talk about this week's Apps Script news, a Twillio integration and demo, and answer questions from developers on topics such as: - An issue with Apps Script gadgets on Google Sites with custom domains. - Determining the maximum number of objects that can fit in ScriptDB. - Backing up scripts to an outside file store. From: GoogleDevelopers Views: 30 8 ratings Time: 29:14 More in Science & Technology

    Read the article

  • Web Animations - the next generation

    Web Animations - the next generation The GDL event page for this event: developers.google.com Ask and vote for questions at www.google.com Browser developers are designing the next generation of animation features that will enhance HTML5 with rich, powerful new animation primitives. Designers and web app developers will all benefit from improved methods of animating content. Hear from developers of Google Chrome and Mozilla Firefox how this works, and learn how to try out the new animation features now in your favorite browser. From: GoogleDevelopers Views: 0 3 ratings Time: 30:00 More in Science & Technology

    Read the article

  • Google I/O 2012 - The Web Can Do That!?

    Google I/O 2012 - The Web Can Do That!? Eric Bidelman The web is changing so quickly that it's hard to keep up with what's new in the platform. HTML5's new capabilities allow developers to build a whole new suite of applications - things that were once impossible to do, are now a reality. This session will walk you down the bleeding edge of HTML5 for 2012 by focusing on in-depth techniques, which solve real world challenges. We'll cover media capture, file I/O, advanced usage of websockets, media streaming, device input, multimedia, and modern css design. For all I/O 2012 sessions, go to developers.google.com From: GoogleDevelopers Views: 361 37 ratings Time: 43:07 More in Science & Technology

    Read the article

  • Introducing Dart

    Introducing Dart The Dart project includes a modern scalable language, libraries, and tools to help developers build large complex web applications. Watch this video to learn about the different parts of the Dart project and how it can help you be more productive building high performance web apps. Learn more at dartlang.org From: GoogleDevelopers Views: 2205 69 ratings Time: 04:00 More in Science & Technology

    Read the article

  • Google Games Chat #3!

    Google Games Chat #3! The Google Games Chat is back! Now with a little bit of structure! Come check out the hot new property that Web Pro News raved "a show", and what we here at Google call "45 minutes away from doing real work." We'll be chatting about games, industry trends, and making bold new predictions that will probably look ridiculously wrong in three years. As always, please ask questions in the Google Moderator section below, and we might even get around to answering one or two. From: GoogleDevelopers Views: 0 0 ratings Time: 00:00 More in Science & Technology

    Read the article

  • [JP ???] Chrome+HTML5 Developers Live Japan #6

    [JP 日本語] Chrome+HTML5 Developers Live Japan #6 This program is in Japanese only. 今回の Chrome+HTML5 Developers Live Japan では、Googleの及川 (@takoratta) と共に、モバイルブラウザでの様々なデバッグ方法についてお話します。 【モバイルブラウザ デバッグベストプラクティス】... From: GoogleDevelopers Views: 803 12 ratings Time: 01:05:21 More in Science & Technology

    Read the article

  • [JP ???] Chrome+HTML5 Developers Live Japan #0 :

    [JP 日本語] Chrome+HTML5 Developers Live Japan #0 : This program is in Japanese only. これまで「クロたん」の愛称で親しまれてきた「GoogleのChrome担当者だけど何か質問ある?」ですが、今回から技術的なものはGoogle Developers Liveの一部としてお届けして参ります。その記念すべき第一回目は日本最大の HTML5 コミュニティ - html5j 代表の白石俊平さんをお迎えしてお送りします。 「パララックスでレスポンシブでjQuery Mobileなサイトのつくりかた」 視差スクロール(パララックス)、レスポンシブWebデザイン&レスポンシブイメージ、jQuery Mobile、Lessなど、最近はやりの技術を盛り込みまくって企業サイトを作ってみました。その過程でぶつかった課題や意思決定、学んだノウハウを皆さんと共有したいと思います。 一歩先ゆくWebサイトを作りたい方に贈ります。 From: GoogleDevelopers Views: 0 1 ratings Time: 01:00:00 More in Science & Technology

    Read the article

  • [JP ???] Google Cast SDK ??

    [JP 日本語] Google Cast SDK 概要 Chromecast 向けアプリケーションを開発される皆さんのために Google Cast SDK が公開されました。このエピソードでは、Google Cast SDK の概要についてお話... From: Google Developers Views: 301 10 ratings Time: 05:17 More in Science & Technology

    Read the article

  • ?? ???? ???? ?? ??? ??? ??? ??

    구글 클라우드 플랫폼을 통한 안정된 글로벌 서비스 런칭 글로벌 서비스를 준비하는 많은 기업의 고민인 운영 인프라를 구글의 클라우드 플랫폼을 통해서 보다 효율적이고 안정적으로 구성할 수 있는... From: Google Developers Views: 2 0 ratings Time: 39:51 More in Science & Technology

    Read the article

  • ??? new AdMob?? ???? ???, ??? ??? ???? ?????.

    구글의 new AdMob으로 수익성과 편의성, 그리고 최고의 컨트롤을 확보하세요. AdMob은 개발자들이 수익을 낼 수 있는 가장 손쉬운 수단입니다. 본 강연에서는 new AdMob에서 제공하는 기능과 수익화도구들에 대해 알아보고, 어떻게... From: Google Developers Views: 25 1 ratings Time: 39:01 More in Science & Technology

    Read the article

  • ?? ??? ??? ?? 2

    구글 개발자 지원팀 소개 2 구글 플레이 개발자 지원이 드디어 한국어로도 가능해졌습니다. 문의 가능한 내용부터 주의해야 할 사항 그리고 팁까지 소개될 예정입니다. 수정되... From: Google Developers Views: 5 0 ratings Time: 20:44 More in Science & Technology

    Read the article

  • ?? ?? ????? ??? ?????

    다시 한번 안드로이드 디자인 가이드라인 안드로이드 디자인 가이드라인은 안드로이드 앱을 디자인할 때 바로 참고할 수 있는 첫 번째 자료이며 컨텐츠 중심 / 반응형 디자인과 같은 최신의... From: Google Developers Views: 23 0 ratings Time: 41:59 More in Science & Technology

    Read the article

  • ?? ???, ??? ?? ?? ???

    구글 플레이, 성공을 위한 최적 플랫폼 구글 플레이를 통한 성공의 가능성과 크기를 실제 사례를 통해 알아보고, 이를 위해 구글 플레이팀과 함께 협력하는 방법에 대해 알아봅니다. From: Google Developers Views: 5 0 ratings Time: 31:24 More in Science & Technology

    Read the article

  • ?????? ?? ???

    크롬캐스트와 구글 캐스트 작년에 미국에서 출시한 크롬캐스트는 N 스크린과 스마트 TV 시장에 새로운 화두를 던지고 있으며 타임지가 뽑은 2013년도의 제품을 선정되기도... From: Google Developers Views: 6 0 ratings Time: 15:55 More in Science & Technology

    Read the article

  • ?????? ?? ??? 2

    크롬캐스트와 구글 캐스트 2 작년에 미국에서 출시한 크롬캐스트는 N 스크린과 스마트 TV 시장에 새로운 화두를 던지고 있으며 타임지가 뽑은 2013년도의 제품을 선정되기도... From: Google Developers Views: 25 4 ratings Time: 20:05 More in Science & Technology

    Read the article

  • ?? ??? ??? ??

    구글 개발자 지원팀 소개 구글 플레이 개발자 지원이 드디어 한국어로도 가능해졌습니다. 문의 가능한 내용부터 주의해야 할 사항 그리고 팁까지 소개될 예정입니다. 수정되... From: Google Developers Views: 11 0 ratings Time: 19:21 More in Science & Technology

    Read the article

  • ???? ??? ?? ?? ?? (Start Playing The Distribution Game on YouTube)

    유튜브를 활용한 게임 확산 전략 (Start Playing The Distribution Game on YouTube) 권순선, Sang Kim and Jarek Wilkiewicz. Edited version of a presentation recorded at YouTube Korea, Seoul, Nov 2012 유튜브는 매일 8억명 이상이 방문하며 매달 40억 시간 이상 시청되고 있습니다. 게임은 그중에서도 가장 많은 사람들이 시청하는 분야 중 하나입니다. 여러분의 게임을 유튜브와 결합하시면 그 어떤 미디어들보다도 더 효과적으로 동영상 시청자들을 게이머로 전환하실 수 있습니다. 이번 세션에서는 PC, 콘솔게임 그리고 모바일에서 유튜브와 게임을 결합한 재미있는 사례들을 보여 드립니다. 기술적, 사업적으로 가장 좋은 예제들을 알려 드리고, 저희가 가장 좋아하는 게임 플레이 동영상들도 함께 보여 드립니다! From: GoogleDevelopers Views: 85 3 ratings Time: 01:00:02 More in Gaming

    Read the article

  • How to compile a C++ source code written for Linux/Unix on Windows Vista (code given)

    - by HTMZ
    I have a c++ source code that was written in linux/unix environment by some other author. It gives me errors when i compile it in windows vista environment. I am using Bloodshed Dev C++ v 4.9. please help. #include <iostream.h> #include <map> #include <vector> #include <string> #include <string.h> #include <strstream> #include <unistd.h> #include <stdlib.h> using namespace std; template <class T> class PrefixSpan { private: vector < vector <T> > transaction; vector < pair <T, unsigned int> > pattern; unsigned int minsup; unsigned int minpat; unsigned int maxpat; bool all; bool where; string delimiter; bool verbose; ostream *os; void report (vector <pair <unsigned int, int> > &projected) { if (minpat > pattern.size()) return; // print where & pattern if (where) { *os << "<pattern>" << endl; // what: if (all) { *os << "<freq>" << pattern[pattern.size()-1].second << "</freq>" << endl; *os << "<what>"; for (unsigned int i = 0; i < pattern.size(); i++) *os << (i ? " " : "") << pattern[i].first; } else { *os << "<what>"; for (unsigned int i = 0; i < pattern.size(); i++) *os << (i ? " " : "") << pattern[i].first << delimiter << pattern[i].second; } *os << "</what>" << endl; // where *os << "<where>"; for (unsigned int i = 0; i < projected.size(); i++) *os << (i ? " " : "") << projected[i].first; *os << "</where>" << endl; *os << "</pattern>" << endl; } else { // print found pattern only if (all) { *os << pattern[pattern.size()-1].second; for (unsigned int i = 0; i < pattern.size(); i++) *os << " " << pattern[i].first; } else { for (unsigned int i = 0; i < pattern.size(); i++) *os << (i ? " " : "") << pattern[i].first << delimiter << pattern[i].second; } *os << endl; } } void project (vector <pair <unsigned int, int> > &projected) { if (all) report(projected); map <T, vector <pair <unsigned int, int> > > counter; for (unsigned int i = 0; i < projected.size(); i++) { int pos = projected[i].second; unsigned int id = projected[i].first; unsigned int size = transaction[id].size(); map <T, int> tmp; for (unsigned int j = pos + 1; j < size; j++) { T item = transaction[id][j]; if (tmp.find (item) == tmp.end()) tmp[item] = j ; } for (map <T, int>::iterator k = tmp.begin(); k != tmp.end(); ++k) counter[k->first].push_back (make_pair <unsigned int, int> (id, k->second)); } for (map <T, vector <pair <unsigned int, int> > >::iterator l = counter.begin (); l != counter.end (); ) { if (l->second.size() < minsup) { map <T, vector <pair <unsigned int, int> > >::iterator tmp = l; tmp = l; ++tmp; counter.erase (l); l = tmp; } else { ++l; } } if (! all && counter.size () == 0) { report (projected); return; } for (map <T, vector <pair <unsigned int, int> > >::iterator l = counter.begin (); l != counter.end(); ++l) { if (pattern.size () < maxpat) { pattern.push_back (make_pair <T, unsigned int> (l->first, l->second.size())); project (l->second); pattern.erase (pattern.end()); } } } public: PrefixSpan (unsigned int _minsup = 1, unsigned int _minpat = 1, unsigned int _maxpat = 0xffffffff, bool _all = false, bool _where = false, string _delimiter = "/", bool _verbose = false): minsup(_minsup), minpat (_minpat), maxpat (_maxpat), all(_all), where(_where), delimiter (_delimiter), verbose (_verbose) {}; ~PrefixSpan () {}; istream& read (istream &is) { string line; vector <T> tmp; T item; while (getline (is, line)) { tmp.clear (); istrstream istrs ((char *)line.c_str()); while (istrs >> item) tmp.push_back (item); transaction.push_back (tmp); } return is; } ostream& run (ostream &_os) { os = &_os; if (verbose) *os << transaction.size() << endl; vector <pair <unsigned int, int> > root; for (unsigned int i = 0; i < transaction.size(); i++) root.push_back (make_pair (i, -1)); project (root); return *os; } void clear () { transaction.clear (); pattern.clear (); } }; int main (int argc, char **argv) { extern char *optarg; unsigned int minsup = 1; unsigned int minpat = 1; unsigned int maxpat = 0xffffffff; bool all = false; bool where = false; string delimiter = "/"; bool verbose = false; string type = "string"; int opt; while ((opt = getopt(argc, argv, "awvt:M:m:L:d:")) != -1) { switch(opt) { case 'a': all = true; break; case 'w': where = true; break; case 'v': verbose = true; break; case 'm': minsup = atoi (optarg); break; case 'M': minpat = atoi (optarg); break; case 'L': maxpat = atoi (optarg); break; case 't': type = string (optarg); break; case 'd': delimiter = string (optarg); break; default: cout << "Usage: " << argv[0] << " [-m minsup] [-M minpat] [-L maxpat] [-a] [-w] [-v] [-t type] [-d delimiter] < data .." << endl; return -1; } } if (type == "int") { PrefixSpan<unsigned int> prefixspan (minsup, minpat, maxpat, all, where, delimiter, verbose); prefixspan.read (cin); prefixspan.run (cout); }else if (type == "short") { PrefixSpan<unsigned short> prefixspan (minsup, minpat, maxpat, all, where, delimiter, verbose); prefixspan.read (cin); prefixspan.run (cout); } else if (type == "char") { PrefixSpan<unsigned char> prefixspan (minsup, minpat, maxpat, all, where, delimiter, verbose); prefixspan.read (cin); prefixspan.run (cout); } else if (type == "string") { PrefixSpan<string> prefixspan (minsup, minpat, maxpat, all, where, delimiter, verbose); prefixspan.read (cin); prefixspan.run (cout); } else { cerr << "Unknown Item Type: " << type << " : choose from [string|int|short|char]" << endl; return -1; } return 0; }

    Read the article

< Previous Page | 109 110 111 112 113 114 115 116 117 118 119 120  | Next Page >