Tuesday, January 29, 2008

Reflection between S/W Architecture and its codes

[http://swevol.egloos.com/category/%EC%95%84%ED%82%A4%ED%85%8D%EC%B2%98/page/1]

Noticeable Papers about Software Evolution

[http://swevol.egloos.com/]

Noticeable Papers about Software Evolution
1. M. Petrenko, D. Poshyvanyk, V. Rajlich, and J. Buchta, Teaching Software Evolution in Open Source, IEEE Computer, Nov., 2007.저자 중 한 명인 Rajlich의 Software Evolution에 대한 Article (IEEE Computer or Software)을 읽어볼 필요 있음

2. A. Grosskurth and M. W. Godfrey, Architecture and evolution of the modern web browser, Procs. of the 21th IEEE International Conf. on Software Maintenance (ICSM'05), Sep., 2005.(http://grosskurth.ca/papers/browser-archevol-20060619.pdf)Godfrey의 Hierarchical Reflexion Model에 대한 Paper 도 참고

3. A. Mockus, R. T. Fielding and J. D. Herbsleb, Two Case Studies of Open Source Software Development: Apache and Mozilla, ACM Trans. on Software Engineering and Methodology (TOSEM) Vol. 11, No. 3, Jul. 2002.이 Paper도 Open Source에 관련된 것으로, 전자 회사의 대부분의 소프트웨어 개발 방식도 새로 개발하는 부분 보다 이전 소스를 Modify해서 개발한다는 점에서 Open Source Development와 비슷. 물론, Open Source Development처럼 한 곳에서 관리되고 있지 않음

4. J. C. Duenas, H. A. Parada G., F. Cuadrado, and M. Santillan, Apache and Eclipse: Comparing Open Source Project Incubators, IEEE Software, Nov/Dec. 2007.

5. C. L. Nehaniv, J. Hewitt, B. Christianson, and P. Wernick, What Software Evolution and Biological Evolution Don't Have in Common, Procs. of 2nd International IEEE Workshop on Software Evolvability (SE'06), 2006.

나머지는 시간되는 대로 추가할 예정 ...--------------------------------------------------------------

6. F. Loesch and E. Ploedereder, Restructuring Variability in Software Product Lines using Concept Analysis of Product Configurations, Procs. of the 11th European Conf. on Software Maintenance and Reengineering (CSMR '07), 2007.

7. P. Frenzel, R. Koschke, A. P. J. Breu and K. ANgstmann, Extending the Reflexion Model for Consolidating Software Variants into Product Lines, ?, ?Reflection Model

8. J. klein, “How Does the Architect’s Role Change as the Software Ages?,” Proc. Of the 5th Working IEEE/IFIP Conf. on Software Architecture (WICSA’05), 2005

Monday, January 28, 2008

SBS-IF Smart Battery System Implementers Forum

SBS-IF Smart Battery System Implementers Forum

The Smart Battery System Implementers Forum (SBS-IF) has been creating, promoting, and supporting open standards for smart battery systems for more than a decade.
SBS-IF specifications, which include those for the popular System Management Bus (SMBus), are widely adopted in the industry.
The SBS-IF is now part of the System Management Interface Forum (SMIF), Inc., a non-profit industry group incorporated in Texas.

Monday, January 21, 2008

GTK+ RC files and Themes

There are also a lot of resources for learning about RC files andthemes with GTK+ found at http://art.gnome.org.

Thursday, January 17, 2008

SQLite

Atomic Commit In SQLite

X Windows for Embedded Systems

Tiny-X is a small footprint X Window server implementation for embedded systems. It was originally developed by Keith Packard of the XFree86 Core Team, sponsored by SuSE. The goal was to create something that would work well in a small memory footprint and, importantly, be robust in near out-of-memory situations. Typical X servers based on Tiny-X can fit in less than 1MB on x86 CPUs.The project has since forked into several projects, including KDrive, SmallX, and Integrated Tiny-X.

Performace

* X Window : x11perf
* GTK : http://gtkperf.sourceforge.net/
* X.Org Wiki - Development/Documentation/Performance : http://www.x.org/wiki/Development/Documentation/Performance?highlight=%28performance%29

Tuesday, January 08, 2008

Sunday, January 06, 2008

DP: Insertion Sort

foldr ins [] xs
where
ins x [] = [x]
ins x (z:zs) = min x z : ins (max x z) zs

toterm [] = []
toterm (x:xs) = I x p n f : toterm xs

sem [] = []
sem (I x p n f : ts) = ins x (sem ts)
sem (C x p n f : ts) = x : sem ts

I x p n f
=> C x p' n' f' if n = Nil
=> I x p' n' f' if n = I _ _ _ _
=> C (min x y) p' n' f' if n = C y _ _ _

C x p n f
=> C x p' n' f' if p = Nil
=> I (max x y) p' n' f' if p = I y _ _ _
=> C x p' n' f' if p = C _ _ _ _

foldr ins [] xs = sem $ (map (=>) ) ^ n $ toterm $ xs

foldr ins [] [10,1,5,2]
= ins 10 (ins 1 (ins 5 (ins 2 [])))
= ins 10 (ins 1 (ins 5 (cons 2 [])))
= ins 10 (ins 1 (cons 2 (ins 5 [])))
= ins 10 (cons 1 (ins 2 (cons 5 [])))
= cons 1 (ins 10 (cons 2 (ins 5 [])))
= cons 1 (cons 2 (ins 10 (cons 5 [])))
= cons 1 (cons 2 (cons 5 (ins 10 [])))
= cons 1 (cons 2 (cons 5 (cons 10 [])))

* 방향
- 병렬성이나 Lazy Evaluation이 연관된 증명이 매우 어려워 보임.
- 우선 Equational Equality를 보이는데 중점.
- 병렬성은 map 함수로 설명
- pure functional context는 lazy evaluation으로 설명

Web Service List API web services xml web services & API list.

Web Service List API web services xml web services & API list.

모바일 기기 업체 ‘콘텐츠 전쟁’ 돌입

모바일 기기 업체 ‘콘텐츠 전쟁’ 돌입

- Nokia
- Amazon
- Samsung, LG
- Nintendo