With CollabNet TeamForge it is now possible to use feature branch workflow in addition to standard gerrit workflow to work on your changes. In this presentation you will learn how it works, why we have decided to implement it, how was it implemented and what were the choices we have made and challenges along the way.
[IMQA] 빠른 웹페이지 만들기 - 당신의 웹페이지는 몇 점인가요?IMQA
웹 성능을 개선하기 위해 알아야 할 세 가지 지표 LCP(Largest Contentful Paint), FID(First Input Delay), CLS(Cumulative Layout Shift)에 대해 자세히 소개하고, Lighthouse로 개선하는 방법에 대해 살펴봅니다.
1. 웹 성능 개선은 무엇을 의미할까요?
2. 웹 성능 알아보기
3. Core Web Vitals
4. Lighthouse란?
5. Lighthouse로 개선하기
모바일 성능 모니터링, 웹 서버 성능 진단 및 부하테스트 컨설팅에 관심이 있으신 분은 아래 연락처로 연락해주시면, 전문 컨설턴트가 안내해드리겠습니다.
- 홈페이지: https://imqa.io
- 메일: support@imqa.io
- 전화: 02-6395-7730
- 채팅: https://imqa.channel.io/
İlk haftanın konusu Python'la programlama temelleri,mikroişlemci ve denetleyiciler arasında ki farklar , arduino & stm32 ve raspberry farkları ve birkaç projenin gösterilmesi, sensörler (analog,dijital) farkları , birkaç sensörün nasıl çalıştığının anlaşılması ve geliştirme kartlarıyla sensörlerin nasıl ilişkilenmesiydi.
With CollabNet TeamForge it is now possible to use feature branch workflow in addition to standard gerrit workflow to work on your changes. In this presentation you will learn how it works, why we have decided to implement it, how was it implemented and what were the choices we have made and challenges along the way.
[IMQA] 빠른 웹페이지 만들기 - 당신의 웹페이지는 몇 점인가요?IMQA
웹 성능을 개선하기 위해 알아야 할 세 가지 지표 LCP(Largest Contentful Paint), FID(First Input Delay), CLS(Cumulative Layout Shift)에 대해 자세히 소개하고, Lighthouse로 개선하는 방법에 대해 살펴봅니다.
1. 웹 성능 개선은 무엇을 의미할까요?
2. 웹 성능 알아보기
3. Core Web Vitals
4. Lighthouse란?
5. Lighthouse로 개선하기
모바일 성능 모니터링, 웹 서버 성능 진단 및 부하테스트 컨설팅에 관심이 있으신 분은 아래 연락처로 연락해주시면, 전문 컨설턴트가 안내해드리겠습니다.
- 홈페이지: https://imqa.io
- 메일: support@imqa.io
- 전화: 02-6395-7730
- 채팅: https://imqa.channel.io/
İlk haftanın konusu Python'la programlama temelleri,mikroişlemci ve denetleyiciler arasında ki farklar , arduino & stm32 ve raspberry farkları ve birkaç projenin gösterilmesi, sensörler (analog,dijital) farkları , birkaç sensörün nasıl çalıştığının anlaşılması ve geliştirme kartlarıyla sensörlerin nasıl ilişkilenmesiydi.
Momenti Seminar - 5 Years of RosettaStoneChris Ohk
Momenti Seminar에서 진행했던 "하스스톤 시뮬레이터 RosettaStone 개발 5년 간의 기록"의 발표 자료를 공유드립니다. 5년 동안 오픈 소스 프로젝트를 진행하면서 경험했던 일들을 정리하며 어떤 교훈을 얻었는지 생각해보는 시간이었습니다. 많은 분들에게 도움이 되었으면 합니다.
Kernel Recipes 2017 - Overview of Generic PM Domains (genpd) - Kevin HilmanAnne Nicolas
The generic PM domains (genpd) framework in the kernel provides a way of grouping devices together that have common power management (PM) operations. It is commonly used to represent hardware power domains (a.k.a power islands) that share a common voltage rail, but can also be used more generically. The genpd framework is also tighly coupled with the runtime power-management framework (runtime PM) which manages idle power states of individual devices.
This talk will give an overview of genpd, its common uses, how it interacts with hardware power domains, runtime PM, and how device driver writers interact with it through the runtime PM framework.
Kevin Hilman, Baylibre
P2P ネットワークにおいて重要な機能の1つは,あるデータを検索し,そのデータを持つノードを特定することである.この際,目的のノードに到達するまでの遅延時間をできるだけ小さくできることが望ましいが,従来の多くの手法では,局所的な情報のみを利用して経路を決定するため,必ずしも最短経路が選ばれるわけではない.この問題を解決するため,本稿では,経路ごとの遅延時間を空間効率良く保持できるデータ構造である Distance Bloom Filter,ならびに,これを用いて高い確率で最短経路を選択可能な手法を提案する.また,提案手法を構造化 P2P ネットワークの1つである Skip graph に適用したシミュレーションを行い,その有効性を確認した.
One of the key functions of P2P networks is locating a node that stores target data. This is performed by routing a search message with the key corresponding to the data over the overlay network. Minimizing the latency of this process is not fully achieved by most P2P systems since they only use local information to determine the route. This paper proposes a novel routing method for P2P systems that finds the shortest path to the destination with high probability. Distance Bloom Filter as a space-efficient data structure to store distance information is introduced to support the method. Simulation results of the method applied to skip graphs, a structured P2P network, are also reported.
Momenti Seminar - 5 Years of RosettaStoneChris Ohk
Momenti Seminar에서 진행했던 "하스스톤 시뮬레이터 RosettaStone 개발 5년 간의 기록"의 발표 자료를 공유드립니다. 5년 동안 오픈 소스 프로젝트를 진행하면서 경험했던 일들을 정리하며 어떤 교훈을 얻었는지 생각해보는 시간이었습니다. 많은 분들에게 도움이 되었으면 합니다.
Kernel Recipes 2017 - Overview of Generic PM Domains (genpd) - Kevin HilmanAnne Nicolas
The generic PM domains (genpd) framework in the kernel provides a way of grouping devices together that have common power management (PM) operations. It is commonly used to represent hardware power domains (a.k.a power islands) that share a common voltage rail, but can also be used more generically. The genpd framework is also tighly coupled with the runtime power-management framework (runtime PM) which manages idle power states of individual devices.
This talk will give an overview of genpd, its common uses, how it interacts with hardware power domains, runtime PM, and how device driver writers interact with it through the runtime PM framework.
Kevin Hilman, Baylibre
P2P ネットワークにおいて重要な機能の1つは,あるデータを検索し,そのデータを持つノードを特定することである.この際,目的のノードに到達するまでの遅延時間をできるだけ小さくできることが望ましいが,従来の多くの手法では,局所的な情報のみを利用して経路を決定するため,必ずしも最短経路が選ばれるわけではない.この問題を解決するため,本稿では,経路ごとの遅延時間を空間効率良く保持できるデータ構造である Distance Bloom Filter,ならびに,これを用いて高い確率で最短経路を選択可能な手法を提案する.また,提案手法を構造化 P2P ネットワークの1つである Skip graph に適用したシミュレーションを行い,その有効性を確認した.
One of the key functions of P2P networks is locating a node that stores target data. This is performed by routing a search message with the key corresponding to the data over the overlay network. Minimizing the latency of this process is not fully achieved by most P2P systems since they only use local information to determine the route. This paper proposes a novel routing method for P2P systems that finds the shortest path to the destination with high probability. Distance Bloom Filter as a space-efficient data structure to store distance information is introduced to support the method. Simulation results of the method applied to skip graphs, a structured P2P network, are also reported.
21. 例1
A -> (A->B) ->B の証明
Coq < Lemma S1 : forall A B :Prop, A ->(A->B) ->B.
1 subgoal
============================
forall A B : Prop, A -> (A -> B) -> B
S1 < intros.
1 subgoal
A : Prop
B : Prop
H : A
H0 : A -> B
============================
B
Goalから、forallを消す。
→の前提部分を仮説に移す。
introsは、複数のintroを同時に適用する。
Γ1 新しい仮定
新しいゴール
機械証明
ニューラル・ネットワーク技術の特徴
42. Geoffrey E. Hinton
Geoffrey E. Hinton Yann LeCun,
Yoshua Bengio Andrew Ng
http://www.cs.toronto.edu/~hinton/ http://yann.lecun.com/
http://goo.gl/fOjkIC http://www.andrewng.org/
53. Alex Krizhevsky, Ilya Sutskever, Geoffrey E. Hinton
"ImageNet Classification with Deep Convolutional Neural Networks"
http://goo.gl/HCZ65W
Alex Krizhevsky
60. Power of Data
Googleの言語へのアプローチ (2006年)
Ben Jai “What’s Google Doing” から
http://life.math.ntu.edu.tw/sites/
life.math.ntu.edu.tw/files/
Fall-2006-Campus-Talk-TW.pdf
2006年
73. 無限性 Recursion
I ate a banana
I know I ate a banana
I think I know I ate a banana
I declare I think I know I ate a banana
What do you declare I think I know I ate?
This is the banana I declare I think I know I
ate
There are more bananas I declare I think I
know I ate than bananas that still grow on the
tree
This is the cat that caught the rat that ate the
cheese that... http://bit.ly/1uc4Taj
80. Timothy T. Rogers, James L. McClelland
"Parallel Distributed Processing at 25:
Further Explorations in the Microstructure of Cognition"
http://goo.gl/e4CgJ8
Rumelhartは、
2011年に逝去
2014年
87. “An example of what recurrent neural nets
can now do” WikiPedia で学習したもの
The meaning of life is the tradition of the
ancient human reproduction: it is less
favorable to the good boy for when to remove
her bigger. In the show’s agreement
unanimously resurfaced. The wild pasteured
with consistent street forests were
incorporated by the 15th century BE. In 1996
the primary rapford undergoes an effort that
the reserve conditioning, written into Jewish
cities, sleepers to incorporate the .St Eurasia
that activates the population.
http://goo.gl/vHRHSn
英語に見えるが
意味が、まったく
通じない。
88. “An example of what recurrent neural nets
can now do” New York Timesで学習
while he was giving attention to the second
advantage of school building a 2-for-2 stool
killed by the Cultures saddled with a halfsuit
defending the Bharatiya Fernall ’s office . Ms .
Claire Parters will also have a history temple
for him to raise jobs until naked Prodiena to
paint baseball partners , provided people to
ride both of Manhattan in 1978 , but what was
largely directed to China in 1946 , focusing on
the trademark period is the sailboat yesterday
and comments on whom they obtain overheard
within the 120th anniversary , where ......
http://goo.gl/vHRHSn
英語に見えるが
意味が、まったく
通じない。
89. "The Unreasonable Effectiveness
of Recurrent Neural Networks”
Andrej Karpathy
http://karpathy.github.io/2015/05/21/rnn-effectiveness/
RNNの驚くべき能力
90. Andrej Karpathy
"The Unreasonable Effectiveness of Recurrent Neural Networks”
http://karpathy.github.io/2015/05/21/rnn-effectiveness/
94. Recursive Deep Models for Semantic
Compositionality Over a Sentiment
Treebank
Richard Socher et al.
http://nlp.stanford.edu/~socherr/EMNLP2013_RNTN.pdf
文法をニューラル・ネットで!
96. 文 “This film does’nt care about cleverness wit or
any other kind of intelligenct humor” の解析
Socher, et al. http://goo.gl/bPAQ68
文法構造をニューラル・
ネットで表現する!
97. “Show, Attend and Tell:
Neural Image Caption Generation
with Visual Attention”
Kelvin Xu, Bengio et al.
イメージにキャプションをつける
http://arxiv.org/pdf/1502.03044v2.pdf
Kelvin Xu
https://github.com/kelvinxu
98. “Show, Attend and Tell: Neural Image Caption Generation with Visual Attention”
http://arxiv.org/pdf/1502.03044v2.pdf
「女性が公園でフリスビーを投げている」 「幼い子がテディベアを持ってベッドに座っている」
「一群の人たちが野外マーケットでショッピングをしている」
「フルーツスタンドにはたくさんの野菜がある」
イメージからテキストへ