Sunday, December 30, 2007
Friday, December 28, 2007
Thursday, December 27, 2007
Wednesday, December 26, 2007
Tuesday, December 25, 2007
Three parallel programming methods.
1. Special libraries
2. Open MP : http://www.openmp.org/
3. Thread building block : http://threadingbuildingblocks.org/
2. Open MP : http://www.openmp.org/
3. Thread building block : http://threadingbuildingblocks.org/
Thursday, December 20, 2007
Tuesday, December 18, 2007
Sunday, December 16, 2007
Wednesday, December 12, 2007
Monday, December 10, 2007
Nokia의 인터넷 서비스
Nokia의 인터넷 서비스
o 오비닷컴
- 사진, 지도, 음악, 게임 (N-Gage) 서비스
o N게이지
- 단말기 : 모바일 게임 서비스
- Symbian Series 60 기반
o "Comes With Music" 프로젝트
- 유니버셜 뮤직과 제휴
- Nokia 단말기 구입 후 1년간 음악 다운로드 무제한 사용 가능
- cf. Apple의 iPod과 iPhone에서의 아이튠즈 서비스
o 디지털 로커 (Avvenu사 : 파일관리 소프트웨어 업체)
- 웹브라우져나 단말기를 통한 원격 PC 상의 파일 접근과 공유 서비스
o 디지털 지도 (나브테크사 : 내비게이션 소프트웨어 업체)
o Mosh (MObilize and SHare)
Sunday, December 09, 2007
Friday, December 07, 2007
Wednesday, December 05, 2007
Tuesday, December 04, 2007
Sunday, December 02, 2007
Maemo
Internet Tablet Devices : http://tablets-dev.nokia.com/
IT OS Sources for Nokia N810, N800, N770
Maemo 4.0 chinook SDK
Maemo 4.0 : http://maemo.org/development/documentation/how-tos/4-x/maemo_architecture.html
SDK : http://maemo.org/development/sdks/
Tools : http://maemo.org/development/tools/
IT OS Sources for Nokia N810, N800, N770
Maemo 4.0 chinook SDK
Maemo 4.0 : http://maemo.org/development/documentation/how-tos/4-x/maemo_architecture.html
SDK : http://maemo.org/development/sdks/
Tools : http://maemo.org/development/tools/
Saturday, December 01, 2007
Wednesday, November 28, 2007
Tuesday, November 27, 2007
mozdev.org - www: notes/l10n/howto-en
How to Localize a Mozilla Extension?
mozdev.org - www: notes/l10n/howto-en
mozdev.org - www: notes/l10n/howto-en
Forum Nokia - The maemo platform
Forum Nokia - The maemo platform
Maemo is a computer architecture platform built on desktop
open source components. It is aimed at enabling applications
and innovative technology for mobile handheld devices.
Maemo is a computer architecture platform built on desktop
open source components. It is aimed at enabling applications
and innovative technology for mobile handheld devices.
Monday, November 26, 2007
XMPP Standards Foundation
XMPP Standards Foundation
the Extensible Messaging and Presence Protocol (XMPP)
an open XML communications technology developed by the Jabber open-source community in 1999,
formalized by the IETF in 2002-2004,
extended through the standards process of the XMPP Standards Foundation.
the Extensible Messaging and Presence Protocol (XMPP)
an open XML communications technology developed by the Jabber open-source community in 1999,
formalized by the IETF in 2002-2004,
extended through the standards process of the XMPP Standards Foundation.
Friday, November 23, 2007
Tuesday, November 20, 2007
Monday, November 19, 2007
Cambridge Dictionaries Online - Cambridge University Press
Omnivore: an animal that is naturally able to eat both plants and meat. Compare carnivore, herbivore.
Sunday, November 18, 2007
Coinduction
Proof Methods for Corecursive Programs
(Jeremy Gibbons and Graham Hutton)
5. Coinduction
A bisimulation
- A relation R on lists
xs R ys if xs = ys = \bot
or xs = ys = []
or \exists v,vs,ws. xs=v:vs and ys=v:ws and vs R ws
The two lists xs and ys are related by a bisimulation. They are
either both undefined, both empty, or both non-empty with heads
that are equal and tails that are themselves releated by the
bisumulation.
xs ~ ys if \exists R. R is a bisimulation and xs R ys
xs and ys are related by such a bisimulation.
Coinduction
- xs = ys iff xs ~ ys
The proof is present in the paper.
A Proof Principle
The problem of proving map f (iterate f x) = iterate f (f x) is
equal to the problem of finding a bisimulation that relates the two
lists.
For example, R = { (map f (iterate f x), iterate f (f x)) f, x of
appropriate types }.
To verify R is a bisimulation is to prove the equality!
(Jeremy Gibbons and Graham Hutton)
5. Coinduction
A bisimulation
- A relation R on lists
xs R ys if xs = ys = \bot
or xs = ys = []
or \exists v,vs,ws. xs=v:vs and ys=v:ws and vs R ws
The two lists xs and ys are related by a bisimulation. They are
either both undefined, both empty, or both non-empty with heads
that are equal and tails that are themselves releated by the
bisumulation.
xs ~ ys if \exists R. R is a bisimulation and xs R ys
xs and ys are related by such a bisimulation.
Coinduction
- xs = ys iff xs ~ ys
The proof is present in the paper.
A Proof Principle
The problem of proving map f (iterate f x) = iterate f (f x) is
equal to the problem of finding a bisimulation that relates the two
lists.
For example, R = { (map f (iterate f x), iterate f (f x)) f, x of
appropriate types }.
To verify R is a bisimulation is to prove the equality!
Saturday, November 17, 2007
Embedded.com - A survey of Linux device drivers
Embedded.com - A survey of Linux device drivers
(번역)
리눅스에서 디바이스 드라이버는 실제 디바이스를 사용자 공간 (user space)나 커널 공간 (kernel space)
(번역)
리눅스에서 디바이스 드라이버는 실제 디바이스를 사용자 공간 (user space)나 커널 공간 (kernel space)
Friday, November 16, 2007
Tuesday, November 13, 2007
Monday, November 12, 2007
Saturday, November 03, 2007
Thursday, November 01, 2007
Monday, October 29, 2007
Tuesday, July 03, 2007
Sunday, June 24, 2007
Friday, June 08, 2007
Subscribe to:
Posts (Atom)