- 경시대회준비반/BigInteger . . . . 86 matches
* provided that the above copyright notice appear in all copies and
* representations about the suitability of this software for any
enum BigMathERROR { BigMathMEM = 1 , BigMathOVERFLOW , BigMathUNDERFLOW, BigMathINVALIDINTEGER, BigMathDIVIDEBYZERO,BigMathDomain};
void Dump(const char *,enum BigMathERROR);
string& DumpString (char const*,enum BigMathERROR);
// The Size Type
// The Data Type
// The Base Used
// The integer array to hold the number
DATATYPE *TheNumber;
// Start of the location of the number in the array
// End of the location of the number in the array
// True if the number is negative
// deallocates the array
// the array with the `fill' value
// The Destructor
// Returns Number of digits in the BigInteger
// Determines if the number representation is OK or not
// True is the nubmer is zero
// Returns the BigInteger absolute
- MatrixAndQuaternionsFaq . . . . 63 matches
== The Matrix and Quaternions FAQ ==
This FAQ is maintained by "hexapod@netcom.com". Any additional suggestions or related questions are welcome. Just send E-mail to the above address.
Q2. What is the order of a matrix?
Q3. How do I represent a matrix using the C/C++ programming languages?
Q4. What are the advantages of using matrices?
Q6. What is the identity matrix?
Q7. What is the major diagonal matrix of a matrix?
Q8. What is the transpose of a matrix?
Q9. How do I add two matrices together?
Q11. How do I multiply two matrices together?
Q14. What is the determinant of a matrix?
Q15. How do I calculate the determinant of a matrix?
Q17. What is the inverse of a matrix?
Q18. How do I calculate the inverse of an arbitary matrix?
Q19. How do I calculate the inverse of an identity matrix?
Q20. How do I calculate the inverse of a rotation matrix?
Q21. How do I calculate the inverse of a matrix using Kramer's rule?
Q22. How do I calculate the inverse of a 2x2 matrix?
Q23. How do I calculate the inverse of a 3x3 matrix?
Q24. How do I calculate the inverse of a 4x4 matrix?
- WikiTextFormattingTestPage . . . . 33 matches
This page originated on Wiki:WardsWiki, and the most up-to-date copy resides there. This page has been copied here in order to make a quick visual determination of which TextFormattingRules work for this wiki. Currently it primarily determines how text formatted using the original Wiki:WardsWiki text formatting rules is displayed. See http://www.c2.com/cgi/wiki?WikiOriginalTextFormattingRules.
If you want to see how this text appears in the original Wiki:WardsWiki, see http://www.c2.com/cgi/wiki?WikiEngineReviewTextFormattingTest
People reviewing this wiki from the original Wiki:WardsWiki will be referred to this page. If you want to see the review, go to http://www.c2.com/cgi/wiki?WikiEngineReview.
Other places this page appears (perhaps as an older version):
This page contains sample marked up text to make a quick visual determination as to which Wiki:TextFormattingRules work for a given wiki. To use the page, copy the text from the edit window, and paste it in the wiki under test. Then read it.
And, the next logical thing to do is put a page like this on a public wiki running each Wiki:WikiEngine, and link to it from the appropriate Wiki:WikiReview page, as has been done in some cases -- see above.
The next line (4 dashes) should show up as a horizontal rule. In a few wikis, the width of the rule is controlled by the number of dashes. That will be tested in a later section of this test page.
This first section will test the Wiki:WikiOriginalTextFormattingRules.
If a wiki properly interprets the Wiki:WikiOriginalTextFormattingRules, the text will appear as described here.
The original Wiki:WardsWiki text formatting rules make no provision for headings. They can be simulated by applying emphasis. See the next several lines.
The next phrase, even though enclosed in triple quotes, '''will not display in bold because
I've broken the phrase across a line''' boundary by inserting a <return>.
If I don't break the phrase by inserting a <return>, '''the bold portion can start and end on different lines,''' as this does.
Note that the logic seems to be easily confused. In the next paragraph I combine the two sentences (with no other changes). Notice the results. (The portion between the "innermost" set of triple quotes, and nothing else, is bold.)
The next phrase, even though enclosed in triple quotes, '''will not display in bold because
I've broken the phrase across a line''' boundary by inserting a <return>. If I don't break the phrase by inserting a <return>, '''the bold portion can start and end on different lines,''' as this does.
I don't know if Wiki:WardCunningham considers this the desired behavior.
* Tenth level, preceded by <tab><tab><tab><tab><tab><tab><tab><tab><tab><tab>*<space>, appears indented 40 spaces with a solid square bullet. It is left to the reader to determine whether there is a limit to this progression.
This is another bulleted list, formatted the same way but with shortened lines to display the behavior when nested and when separated by blank lines.
* Top level -- these headings should appear with a blank line between them
- EnglishSpeaking/2011년스터디 . . . . 23 matches
1. The Simpsons (심슨네 가족들)의 한 장면을 역할 분담해서 따라하기.
* [EnglishSpeaking/TheSimpsons]
1. Theme Talking
* There are four members in my family: my father, mother, and a younger brother. Well, actually there are five including our dog. My father was a military officer for twenty years. He recently retired from service and now works in a weaponry company. My mother is a typical housewife. She takes care of me and my brother and keeps our house running well. My brother is attending a university in the U.S.A. He just entered the university as a freshman and is adjusting to the environment. I miss the memory of fighting over things with him. The last member of my family is my dog named Joy. She is a Maltese terrier and my mother named her Joy to bring joy into our family. That's about it for the introduction of my family members.
1. The Simpsons
* [EnglishSpeaking/TheSimpsons/S01E01]
1. Theme Talking
* [김수경] - 오늘 처음으로 심슨 대사를 따라해봤습니다. 지원언니께서 네명이 같이 연습할만한 장면들을 미리 골라두셨는데 막상 오늘 온 사람이 두명이라 다른 장면을 연습했습니다. 40초도 채 안 되는 짧은 대화인데 참 어렵더라구요. 한 문장씩 듣고 따라하고, 받아쓰기도 하고, 외워서 해보는 등 한 장면을 가지고 여러번 연습한 것은 매우 좋았습니다. ''You tell me that all the time.''이나 ''Let me be honest with you.''가 어려운 문장은 아니지만 막상 말하려면 딱 생각이 안 났을 것 같은데 오늘 이후로는 좀 더 유려하게 말할 수 있을 것 같아요. 앞으로 매주 진행하면 이런 표현들이 늘어나겠죠 ㅋㅋㅋ
* [송지원] - 혹시나 했지만 역시나 현지 영어 따라하기는 쉽지 않습니다. 짧은 몇 줄 문장을 외워서 따라하기는 어렵지만 많이 하면 실력이 늘 거라는 생각은 들어요. Free Talking은 제가 하고 싶은 말을 나름 자유롭게 구사해서 만족했는데 Theme Talking에서는 한계를 느끼고 한국어를 섞어서 그 점이 좀 아쉬웠어요. 다음 주에는 The Simpsons.. 정말 4명이 함께 하기를 (온 성의를 다해 대본을 준비하는 만큼;ㅁ;)
1. The Simpsons
* [EnglishSpeaking/TheSimpsons/S01E02]
1. Theme Talking
* [김수경] - 이번주 영상은 문장이 단어 조금 바꾸면 여기저기 가져다 쓸만한 것이 많아 재미있었어요. 가위바위보로 역할을 분담했는데 ''Along with the ego and the superego, one of three components of the psyche.''라는 문장을 외워보고 싶어서 리사를 선택했습니다. 그런데 리사 분량이 제일 적어서 본의아니게(?) 가장 날로먹었네요 ㅋㅋ
1. The Simpsons
* [EnglishSpeaking/TheSimpsons/S01E03]
1. Theme Talking
1. The Simpsons
* [EnglishSpeaking/TheSimpsons/S01E04]
1. Theme Talking
* Theme : 자신의 ''Role Model''.
- MoreEffectiveC++/Appendix . . . . 21 matches
So your appetite for information on C++ remains unsated. Fear not, there's more — much more. In the sections that follow, I put forth my recommendations for further reading on C++. It goes without saying that such recommendations are both subjective and selective, but in view of the litigious age in which we live, it's probably a good idea to say it anyway. ¤ MEC++ Rec Reading, P2
There are hundreds — possibly thousands — of books on C++, and new contenders join the fray with great frequency. I haven't seen all these books, much less read them, but my experience has been that while some books are very good, some of them, well, some of them aren't. ¤ MEC++ Rec Reading, P4
What follows is the list of books I find myself consulting when I have questions about software development in C++. Other good books are available, I'm sure, but these are the ones I use, the ones I can truly recommend. ¤ MEC++ Rec Reading, P5
A good place to begin is with the books that describe the language itself. Unless you are crucially dependent on the nuances of the °official standards documents, I suggest you do, too. ¤ MEC++ Rec Reading, P6
* '''''The Annotated C++ Reference Manual''''', Margaret A. Ellis and Bjarne Stroustrup, Addison-Wesley, 1990, ISBN 0-201-51459-1. ¤ MEC++ Rec Reading, P7
* '''''The Design and Evolution of C++''''', Bjarne Stroustrup, Addison-Wesley, 1994, ISBN 0-201-54330-3. ¤ MEC++ Rec Reading, P8
These books contain not just a description of what's in the language, they also explain the rationale behind the design decisions — something you won't find in the official standard documents. The Annotated C++ Reference Manual is now incomplete (several language features have been added since it was published — see Item 35) and is in some cases out of date, but it is still the best reference for the core parts of the language, including templates and exceptions. The Design and Evolution of C++ covers most of what's missing in The Annotated C++ Reference Manual; the only thing it lacks is a discussion of the Standard Template Library (again, see Item 35). These books are not tutorials, they're references, but you can't truly understand C++ unless you understand the material in these books
For a more general reference on the language, the standard library, and how to apply it, there is no better place to look than the book by the man responsible for C++ in the first place: ¤ MEC++ Rec Reading, P10
* '''''The C++ Programming Language (Third Edition)''''', Bjarne Stroustrup, Addison-Wesley, 1997, ISBN 0-201-88954-4. ¤ MEC++ Rec Reading, P11
Stroustrup has been intimately involved in the language's design, implementation, application, and standardization since its inception, and he probably knows more about it than anybody else does. His descriptions of language features make for dense reading, but that's primarily because they contain so much information. The chapters on the standard C++ library provide a good introduction to this crucial aspect of modern C++. ¤ MEC++ Rec Reading, P12
If you're ready to move beyond the language itself and are interested in how to apply it effectively, you might consider my other book on the subject: ¤ MEC++ Rec Reading, P13
A book pitched at roughly the same level as my Effective C++ books, but covering different topics, is ¤ MEC++ Rec Reading, P16
Murray's book is especially strong on the fundamentals of template design, a topic to which he devotes two chapters. He also includes a chapter on the important topic of migrating from C development to C++ development. Much of my discussion on reference counting (see Item 29) is based on the ideas in C++ Strategies and Tactics.
If you're the kind of person who likes to learn proper programming technique by reading code, the book for you is ¤ MEC++ Rec Reading, P19
Each chapter in this book starts with some C++ software that has been published as an example of how to do something correctly. Cargill then proceeds to dissect — nay, vivisect — each program, identifying likely trouble spots, poor design choices, brittle implementation decisions, and things that are just plain wrong. He then iteratively rewrites each example to eliminate the weaknesses, and by the time he's done, he's produced code that is more robust, more maintainable, more efficient, and more portable, and it still fulfills the original problem specification. Anybody programming in C++ would do well to heed the lessons of this book, but it is especially important for those involved in code inspections. ¤ MEC++ Rec Reading, P21
One topic Cargill does not discuss in C++ Programming Style is exceptions. He turns his critical eye to this language feature in the following article, however, which demonstrates why writing exception-safe code is more difficult than most programmers realize: ¤ MEC++ Rec Reading, P22
If you are contemplating the use of exceptions, read this article before you proceed. ¤ MEC++ Rec Reading, P24
Once you've mastered the basics of C++ and are ready to start pushing the envelope, you must familiarize yourself with ¤ MEC++ Rec Reading, P25
I generally refer to this as "the LSD book," because it's purple and it will expand your mind. Coplien covers some straightforward material, but his focus is really on showing you how to do things in C++ you're not supposed to be able to do. You want to construct objects on top of one another? He shows you how. You want to bypass strong typing? He gives you a way. You want to add data and functions to classes as your programs are running? He explains how to do it. Most of the time, you'll want to steer clear of the techniques he describes, but sometimes they provide just the solution you need for a tricky problem you're facing. Furthermore, it's illuminating just to see what kinds of things can be done with C++. This book may frighten you, it may dazzle you, but when you've read it, you'll never look at C++ the same way again. ¤ MEC++ Rec Reading, P27
If you have anything to do with the design and implementation of C++ libraries, you would be foolhardy to overlook ¤ MEC++ Rec Reading, P28
- Celfin's ACM training . . . . 18 matches
|| 1 || 1 || 110101/100 || The 3n+1 Problem || . || [3n 1/Celfin] ||
|| 3 || 1 || 110103/10137 || The Trip || . || [The Trip/Celfin] ||
|| 6 || 6 || 110606/10254 || The Priest Mathmatician || . || [http://165.194.17.5/wiki/index.php?url=zeropage&no=4132&title=ThePriestMathematician/하기웅&login=processing&id=&redirect=yes The Priest Mathmatician/Celfin] ||
|| 11 || 10 || 111007/10249 || The Grand Dinner || 1 hour || [http://165.194.17.5/wiki/index.php?url=zeropage&no=4188&title=TheGrandDinner/하기웅&login=processing&id=celfin&redirect=yes The Grand Dinner/Celfin] ||
|| 16 || 13 || 111303/10195 || The Knights of the Round Table || 1 hour || [http://165.194.17.5/wiki/index.php?url=zeropage&no=4263&title=TheKnightsOfTheRoundTable/하기웅&login=processing&id=&redirect=yes TheKnightsOfTheRoundTable/Celfin] ||
|| 17 || 13 || 111306/10215 || The Largest/Smallest Box || 40 mins || [http://165.194.17.5/wiki/index.php?url=zeropage&no=4264&title=TheLagestSmallestBox/하기웅&login=processing&id=&redirect=yes TheLargestSmallestBox/Celfin] ||
|| 20 || 1 || 110107/10196 || Check the Check || 4 hours || [CheckTheCheck/Celfin] ||
- 영호의바이러스공부페이지 . . . . 18 matches
get erased so you have a psycological problem with viruses, erase these
001...........................Virus Spotlight, The Tiny virus
Co-Editor, Theory Consultant - Bionic Slasher
The first virus I would like to spotlight is the Tiny virus, lets see
The 163 COM Virus, or Tiny Virus, was isolated by Fridrik Skulason
The first time a file infected with the 163 COM Virus is executed,
the virus will attempt to infect the first .COM file in the
be COMMAND.COM. After the first .COM file is infected,each time
an infected program is executed another .COM file will attempt to
be infected. Files are infected only if their original length is
date/time stamps in the directory changed to the date/time the
This virus currently does nothing but replicate, and is the
The Tiny Virus may or may not be related to the Tiny Family.
^like she'd know the difference!
OK, Theres the run down on the smallest MS-DOS virus known to man. As for
Here is a dissasembly of the virus, It can be assembled under Turbo Assembler
jc loc_6 ;no files found? then quit
mov ah,4Fh ;find the next file
mov ax,4200h ;set the file pointer
je loc_3 ;same? then find another file
- DPSCChapter1 . . . . 16 matches
Welcome to ''The Design Patterns Smalltalk Companion'' , a companion volume to ''Design Patterns Elements of Reusable Object-Oriented Software'' by Erich Gamma, Richard Helm, Ralph Johnson, and Jogn Vlissides(Gamma, 1995). While the earlier book was not the first publication on design patterns, it has fostered a minor revolution in the software engineering world.Designers are now speaking in the language of design patterns, and we have seen a proliferation of workshops, publications, and World Wide Web sites concerning design patterns. Design patterns are now a dominant theme in object-oriented programming research and development, and a new design patterns community has emerged.
''The Design Patterns Smalltalk Companion'' 의 세계에 오신걸 환영합니다. 이 책은 ''Design Patterns Elements of Reusable Object-Oriented Software''(이하 DP) Erich Gamma, Richard Helm, Ralph Johnson, and Jogn Vlissides(Gamma, 1995). 의 편람(companion, 보기에 편리하도록 간명하게 만든 책) 입니다. 앞서 출간된 책(DP)이 디자인 패턴에 관련한 책에 최초의 책은 아니지만, DP는 소프트웨어 엔지니어링의 세계에 작은 혁명을 일으켰습니다. 이제 디자이너들은 디자인 패턴의 언어로 이야기 하며, 우리는 디자인 패턴과 관련한 수많은 workshop, 출판물, 그리고 웹사이트들이 폭팔적으로 늘어나는걸 보아왔습니다. 디자인 패턴은 객체지향 프로그래밍의 연구와 개발에 있어서 중요한 위치를 가지며, 그에 따라 새로운 디자인 패턴 커뮤니티들이 등장하고 있습니다.(emerge 를 come up or out into view 또는 come to light 정도로 해석하는게 맞지 않을까. ''이제 디자인 패턴은 객체지향 프로그래밍의 연구와 개발에 있어서 중요한 위치를 가지고 있으며, 디자인 패턴 커뮤니티들이 새로이 등장하고 있는 추세입니다.'' 그래도 좀 어색하군. -_-; -- 석천 바꿔봤는데 어때? -상민 -- DeleteMe)gogo..~ 나중에 정리시 현재 부연 붙은 글 삭제하던지, 따로 밑에 빼놓도록 합시다.
''Design Patterns'' describes 23 design patterns for applications implemented in an object-oriented programming language. Of course, these 23 patterns do not capture ''all'' the design knowledge an object-oriented designer will ever need. Nonetheless, the patterns from the "Gang of Four"(Gamma et al.) are a well-founded starting point. They are a design-level analog to the base class libraries found in Smalltalk development environments. They do not solve all problems but provide a foundation for learning environments. They do not solve all problems but provide a foundation for learning about design patterns in general and finding specific useful architectures that can be incorporated into the solutions for a wide variety of real-world design problems. They capture an expert level of design knowledge and provide the foundation required for building elegant, maintainable, extensible object-oriented programs.
In the Smalltalk Companion, we do not add to this "base library" of patterns;rather, we present them for the Smalltalk designer and programmer, at times interpreting and expanding on the patterns where this special perspective demands it. Our goal is not to replace Design Patterns; you should read the Smalltalk Companion with Design Patterns, not instead of it. We have tried not to repeat information that is already well documented by the Gang of Four book. Instead, we refer to it requently;you should too.
Another)
Learning an object-oriented language after programming in another paradigm, such as the traditional procedural style, is difficult. Learning to program and compose application in Smalltalk requires a complex set of new skills and new ways of thinking about problems(e.g Rosson & Carroll, 1990; Singley, & Alpert, 1991). Climbing the "Smalltalk Mountain" learning curve is cetainly nontrivial. Once you have reached that plateau where you feel comfortable building simple Smalltalk applications, there is still a significant distance to the expert peak.
* The low-level details of the syntax and semantics of the Smalltalk language
* What is available in the form of classes, methods, and functionality in the existing base class libraries
* How to use the specific tools of the Smalltalk interactive development environment to find and reuse existing functionality for new problems, as well as understanding programs from both static and runtime perspective
* How to define and implement behavior in new classes and where these classes ought to reside in the existing class hierarchy
* Which classes work well together as frameworks
* Recurring patterns of object configurations and interactions and the sorts of problems for which these cooperating objects provide (at least partial) solutions
This is by no means an exhaustive list, and even novices understand and use much of the knowledge. But some items, especially the last -- recurring patterns of software design, or design patterns -- are the province of design expert.
A '''design pattern''' is a reusable implementation model or architecture that can be applied to solve a particular recurring class of problem. The pattern sometimes describes how methods in a single class or subhierarchy of classes work together; more often, it shows how multiple classes and their instances collaborate. It turns out that particular architectures reappear in different applications and systems to the extent that a generic pattern template emerges, one that experts reapply and customize to new application - and domain-specific problems. Hence, experts know how to apply design patterns to new problems to implement elegant and extensible solutions.
In general, designers -- in numerous domains, not just software -- apply their experience with past problems and solution to new, similar problems. As Duego and Benson(1996) point out, expert designers apply what is known in cognitive psychology and artificial intelligence as '''case-based reasoning''', remembering past cases and applying what they learned there. This is the sort of reasoning that chess masters, doctors, lawyers, and architects empoly to solve new problems. Now, design patterns allow software designers to learn from and apply the experiences of other designers as well. As in other domains, a literature of proven patterns has emerged. As a result, we can "stand on the shoulders of giants" to get us closer to the expert peak. As John Vlissies (1997) asserts, design patterns "capture expertise and make it accessible to non-experts" (p. 32).
디자이너들-소프트웨어에만 국한하지 않은 수많은 분야에서-은 그들의 과거의 문제와, 해법에 경험을 비슷한 문제에 적용 시킨다. '''''Duego와 Genson(1996)은 전문 디자이너들이 사례를 기반으로 경험에서 인지한 지혜안에서 과거의 사례를 기억하고 그들이 배운것을 적용시키는 것에 주목한다. (생략 및 의역) ''''' 이것은 체스의 고수, 의사, 변호사 그리고 건축가들이 새로운 문제에 대응하는 추론 방식의 한 방식이다. 현재, 디자인 패턴은 소프트웨어 디자이너들이 배워온것들과 다른 분야의 디자이너(other designer)들의 경험들 모두를 감안한다. 이런 노력들은 결과적으로, "거인의 어깨에 올라서 있는것" 같은 방법으로 우리를 훌륭한 디자인에 이끌수 있다. John Vlissies(1997)은 디자인 패턴은 "전문 지식을 잡고 비전문가들이 그것을 이용하기 쉽게 해주는 것이라고 평한다. (p. 32).
Design patterns also provide a succinct vocabulary with which to describe new designs and retrospectively explain existing ones. Patterns let us understand a design at a high level before drilling down to focus on details. They allow us to envision entire configurations of objects and classes at a large grain size and communicate these ideas to other designers by name. We can say, "Implement the database access object as a Singleton," rather than, "Let's make sure the database access class has just one instance. The class should include a class variable to keep track of the singl instance. The class should make the instance globally available but control access to it. The class should control when the instance is created and ..." Which would you prefer?
Christopher Alexander and his colleagues have written extensively on the use of design patterns for living and working spaces-homes, buildings, communal areas, towns. Their work is considered the inspiration for the notion of software design patterns. In ''The Timeless Way of Building''(1979) Alexander asserts, "Sometimes there are version of the same pattern, slightly different, in different cultures" (p.276). C++ and Smalltalk are different languages, different environments, different cultures-although the same basic pattern may be viable in both languages, each culture may give rise to different versions.
Christopher Alexander와 그의 친구, 동료들은 디자인 패턴이 공간활용과, 건축, 공동체의 구성방법 까지 확장되는 것에 관한 글을 써왔다. 여기에서 그들이 추구하는 바는 이런 분야에 적용을 통하여, 소프트웨어 디자인 패턴을 위한 또 다른 새로운 창조적 생각 즉, 영감을 얻기위한 일련의 작업(궁리)이다. ''The Timeless Way of Building''(1979) 에?? Alexander는 "때로는 서로다른 문화권에서 아주 약간은 다르게 같은 패턴의 버전들이 존재하걸 볼수 있다"(p.276) 라고 언급한다. C++과 Samlltalk는 비록 같은 기본적인 패턴에서의 출발을 해도 다른 언어, 다른 개발환경, 다른 문화로 말미암아 각자 다른 모양새를 보여준다.
The Gang of Four's ''Design Patterns'' presents design issues and solutions from a C+ perspective. It illustrates patterns for the most part with C++ code and considers issues germane to a C++ implementation. Those issue are important for C++ developres, but they also make the patterns more difficult to understand and apply for developers using other languages.
- DataCommunicationSummaryProject/Chapter8 . . . . 15 matches
= The Air Link =
=== The Home Location Register(HLR) ===
=== The Visitors' Location Register(VLR) ===
=== The Equipment Identity Register(EIR) ===
=== The Authentication Center(AuC) ===
=== The Messaging Center ===
* The Gateway Mobile Switching Center (GMSC)는 스위칭 체계의 최 상위에 있다.
== The GPRS Backbone ==
== The Gateway Node ==
* The Point-to-Multipoint Service Center(PTM SC), Qos 문제를 다루는 서버이다. 돈을 더 많이 낸 고객에게 통신에서 우선권을 준다. 그리고 소리와 그림과 같이 데이터의 종류에 따라 우선권을 달리 준다.(소리가 더 속도에 민감하다.)
* The Border Gateway(BG), roaming을 다룬다. 이것은 주로 필터링을 통해서 원하지 않는 연결을 막는 방화벽에 연결되어 있다.
* The GPRS Charging Gateway(GCG), 요금 지불 옵션을 전문적으로 하기 위해서 필요하다.
* The Lawful Interception Gateway(LIG), 당국이 GPRS 네트워크에 있는 이동 데이터를 중간에서 엿보는것을 허락한다.
= The Internet =
== The IP Address Shortage ==
- RSSAndAtomCompared . . . . 15 matches
feed formats. As of mid-2005, the two
The purpose of this page is to summarize, as clearly and simply as possible, the differences between the RSS 2.0 and Atom 1.0 syndication languages.
The RSS 2.0 specification is copyrighted by Harvard University and is frozen. No significant changes can be made and it is intended that future work be done under a different name; Atom is one example of such work.
The Atom 1.0 specification (in the course of becoming an
IETF standards track RFC) represents the consensus of the
within the [http://www.ietf.org/ IETF], as reviewed and approved by the IETF community and the
[http://www.ietf.org/iesg.html Internet Engineering Steering Group]. The specification is structured in such a way that the IETF could conceivably issue further versions or revisions of this specification without breaking existing deployments, although there is no commitment, nor currently expressed interest, in doing so.
See the Extensibility section below for how each can be extended without changing the specifications themselves.
There are two popular protocols widely used with RSS, [http://www.xmlrpc.com/metaWeblogApi MetaWeblog]
and [http://www.blogger.com/developers/api/ Blogger]. There are frequent
The Atompub working group is in the late stages of developing the
[http://ietfreport.isoc.org/idref/draft-ietf-atompub-protocol/ Atom Publishing Protocol], which is closely integrated with the Atom feed format and is based on the experience with the existing protocols.
RSS 2.0 requires feed-level title, link, and description. RSS 2.0 does not require that any of the fields of individual items in a feed be present.
RSS 2.0 may contain either plain text or escaped HTML, with no way to indicate which of the two is provided. Escaped HTML is ugly (for example, the string AT&T would be expressed as “AT&T”) and has been a source of difficulty for implementors. RSS 2.0 cannot contain actual well-formed XML markup, which reduces the re-usability of content.
* plain text, with no markup (the default)
* some other XML vocabulary (There is no guarantee that the recipient will be able to do anything useful with such content)
* a pointer to Web content not included in the feed
RSS 2.0 has a “description” element which is commonly used to contain either the full text of an entry or just a synopsis (sometimes in the same feed), and which sometimes is absent. There is no built-in way to signal whether the contents are complete.
Atom has separate “summary” and “content” elements. The summary is encouraged for accessibility reasons if the content is non-textual (e.g. audio) or non-local (i.e. identified by pointer).
[http://diveintomark.org/archives/2002/06/02/important_change_to_the_link_tag autodiscovery] has been implemented several times in different ways and has never been standardized. This is a common source of difficulty for non-technical users.
- [Lovely]boy^_^/EnglishGrammer/Passive . . . . 15 matches
ex) Two hundred people are employed by the company.
B. When we use the passive, who or what causes the action is often unknown or unimportant.(그리니까 행위주체가 누군지 모를때나 별로 안중요할때 수동태 쓴대요)
ex) A lot of money was stolen in the robbery.
If we want to say who does or what causes the action, we use by(수동태에서 누가 했는지 알고 싶으면 by 쓰래요)
ex) This house was built by my grandfather.
active) Somebody will clean the room later.
passive) The room will be cleaned later.
ex) The music was very loud and could be heard from a long way away.
active) Somebody should have cleaned the room.
passive) The room should have been cleaned.
ex) I haven't received the letter yet. It might have been sent to the wrong address.
active) The room looks nice. Somebody has cleaned it.
passive) The room looks nice. It has been cleaned.
active) The room looked nice. Somebody had cleaned it.
passive) The room looked nice. It had been cleaned.
active) Somebody is cleaning the room right now.
passive) The room is being cleaned right now.
active) Somebody was cleaning the room when I arrived.
passive) The room was being cleaned when I arrived.
ex) We gave the police the information. (We gave the information to the police.)
- AutomatedJudgeScript . . . . 14 matches
The answer is: 10
The answer is: 5
The answer is: 10
The answer is: 5
The answer is: 10
The answer is: 5
The answer is: 10
The answer is: 15
The answer is: 10
The answer is: 5
The answer is: 10
The answer is: 5
The judges are mean!
The judges are good!
- MoreEffectiveC++/Techniques1of3 . . . . 14 matches
== Item 26: Limiting the number of objects of a class ==
friend Printer& thePrinter(); // 이 friend 함수가 유일한 객체 하나를 유지 시키고
Printer& thePrinter()
static Printer p; // 단일의 Printer 객체(the single printer object)
해당 디자인은 세가지의 중점으로 이해 하면 된다. '''첫번째''' Printer클래스의 생성자를 private(사역)인자로 설정한다. 이는 객체 생성을 제한한다. '''두번째''' 전역 함수인 thePrinter를 Printer클래스의 friend로 선언한다. 그래서 이 thePrinter가 첫번째에서의 제한에 상관없이 관여 가능하도록 만든다. '''마지막으로(세번째)''' 전역함수인 thePrinter 내부에 정적(static) Printer 객체를 만든다. 이는 오직 하나만의 객체를 thePrinter내부에 유지시킨다.
thePrinter().reset();
thePrinter().submitJob(buffer); // 상수 참조(const reference)라서,
하지만 이렇게 구현시에는 thePrinter가 "'''전역 공간을 사용해야 한다.'''" 것으로 코드를 약하게 만든다. 알다 시피, 전역 공간의 사용은 되도록이면 피해야 하는 방법이며, thePrinter를 Printer클래스 내부에 숨기기를 추천하다. thePrinter를 Printer클래스 내부 메소드로 넣어 버리고, friend를 삭제해 보자.
static Printer& thePrinter(); // 외부에서 호출 가능하도록 static으로 선언하고
Printer& Printer::thePrinter() // friend만 없앴지 마찬가지 방법을 제시한다.
Printer::thePrinter().reset();
Printer::thePrinter().submitJob(buffer);
friend Printer& thePrinter();
Printer& thePrinter() // 이 friend 함수 역시 전역이 아닌
그리고 thePrinter를 호출하려면 이제는 이렇게 해야 한다.
PrintingStuff::thePrinter().reset();
PrintingStuff::thePrinter().submitJob(buffer);
using PrintingStuff::thePrinter; // thePrinter를 현재의 namespace안에서
thePrinter().reset(); // 그리고 사용하는 과정
thePrinter().submitJob(buffer);
- MySQL 설치메뉴얼 . . . . 14 matches
A more detailed version of the preceding description for installing a
These commands add the `mysql' group and the `mysql' user. The
different versions of Unix, or they may have different names such
You might want to call the user and group something else instead
of `mysql'. If so, substitute the appropriate name in the
2. Pick the directory under which you want to unpack the distribution
and change location into it. In the following example, we unpack
the distribution under `/usr/local'. (The instructions, therefore,
`/usr/local'. If that directory is protected, you must perform the
3. Obtain a distribution file using the instructions in *Note
platforms are built from the same MySQL source distribution.
4. Unpack the distribution, which creates the installation directory.
Then create a symbolic link to that directory:
The `tar' command creates a directory named `mysql-VERSION-OS'.
The `ln' command makes a symbolic link to that directory. This
lets you refer more easily to the installation directory as
You can replace the first line with the following alternative
command to uncompress and extract the distribution:
5. Change location into the installation directory:
You will find several files and subdirectories in the `mysql'
- 서지혜/단어장 . . . . 14 matches
명령적인 : 1. imperative programming. 2. We use the Imperative for direct orders and suggestions and also for a variety of other purposes
당황하게 하다 : The thing that baffles me is that the conversations do not center around the adults but almost exclusively about their respective kids
(세금)추가 부담금 : he does not object to paying the levy
음절 : 1. Don't breathe a syllable(word) about it to anyone. 2. He explained it in words of one syllable. 3. He couldn't utter a syllable in reply(그는 끽소리도 못했다)
The wrangler rounded the drove toward the tents.
관리하다 : The pension funds are administered by commercial banks.
집행하다 : It is no basis on which to administer law and order that people must succumb to the greater threat of force.
무릎을 꿇다 : The town succumbed after a short siege.
포위 작전 : Our army is laying siege to the enemy.
인용 : The forms of citations generally subscribe to one of the generally excepted citations systems, such as Oxford, Harvard, and other citations systems, as their syntactic conventions are widely known and easily interrupted by readers.
The study of history of words, their origins, and how their form and meaning have changed over time.
Density is physical intrinsic property of any physical object, whereas weight is an extrinsic property that varies depending on the strength of the gravitational field in which the respective object is placed.
식별하다 : The computer program was unable to discriminate between letters and numbers.
What is the difference between ethnicity and race?
The traditional definition of race and ethnicity is related to biological and sociological factors respectively.
invariably the reply came back, "Not now!"
밀도 : Moore's law has effectively predicted the density of transistors in silicon chips.
진단의 : Medical diagnosticians see a patient once or twice, make an assessment in an effort to solve a particularly difficult case, and then move on.
고이다, 썩다 : The water in the pond was stagnating.
방대한 : He spends a lot of his own time checking up on his patients, taking extensive notes on what he's thinking at the time of diagnosis, and checking back to see how accurate he is.
- MoinMoinFaq . . . . 13 matches
The term ''Wiki'' is a shortened form of Wiki''''''Wiki''''''Web. A Wiki
A Moin''''''Moin is a wiki provided by the python wiki program Moin''''''Moin.
ideas, etc. for people to comment on. Some pages just sit there and
convey information. Other pages are an open invitation for discussion
value derives from the use to which it is put. For instance, a page in
a wiki can serve the same purpose as a discussion thread. You could
Wikis are used internally by the guys who write [http://www.zope.org/ Zope]
to manage their ideas and projects.
=== What are the major features of a Wiki? ===
* ability to see the change history for a document
=== How does this compare to other collaboration tools, like Notes? ===
A Wiki can accomplish certain things very easily, but there are
some things it cannot do. The biggest missing
'''NO''' security. (That's right!) Because of this, the
of part of all of the wiki.
There are two main ways to devalue a wiki. One is through erasure
and the other is through corruption. Dealing with erasure is not terribly
difficult, because there is a change log (and back versions) of every page
quickly), pages can be restored quite easily to their previous good state.
corruption is more difficult to deal with. The possibility exists that someone
- UML . . . . 13 matches
In software engineering, Unified Modeling Language (UML) is a non-proprietary, third generation modeling and specification language. However, the use of UML is not restricted to model software. It can be used for modeling hardware (engineering systems) and is commonly used for business process modeling, organizational structure, and systems engineering modeling. The UML is an open method used to specify, visualize, construct, and document the artifacts of an object-oriented software-intensive system under development. The UML represents a compilation of best engineering practices which have proven to be successful in modeling large, complex systems, especially at the architectural level.
This diagram describes the functionality of the (simple) Restaurant System. The Food Critic actor can Eat Food, Pay for Food, or Drink Wine. Only the Chef Actor can Cook Food. Use Cases are represented by ovals and the Actors are represented by stick figures. The box defines the boundaries of the Restaurant System, i.e., the use cases shown are part of the system being modelled, the actors are not.
The OMG defines a graphical notation for [[use case]]s, but it refrains from defining any written format for describing use cases in detail. Many people thus suffer under the misapprehension that a use case is its graphical notation; when in fact, the true value of a use case is the written description of scenarios regarding a business task.
This diagram describes the structure of a simple Restaurant System. UML shows [[Inheritance_(computer_science)|Inheritance]] relationships with a [[triangle]]; and containers with [[rhombus|diamond shape]]. Additionally, the role of the relationship may be specified as well as the cardinality. The Restaurant System has any number of Food dishes(*), with one Kitchen(1), a Dining Area(contains), and any number of staff(*). All of these objects are associated to one Restaurant.
This diagram describes the sequences of messages of the (simple) Restaurant System. This diagram represents a Patron ordering food and wine; drinking wine then eating the food; finally paying for the food. The dotted lines extending downwards indicate the timeline. The arrows represent messages (stimuli) from an actor or object to other objects. For example, the Patron sends message 'pay' to the Cashier. Half arrows indicate asynchronous method calls.
Above is the collaboration diagram of the (simple) Restaurant System. Notice how you can follow the process from object to object, according to the outline below:
A Collaboration diagram models the interactions between objects in terms of sequenced messages. Collaboration diagrams represent a combination of information taken from [[#UML_Class Diagram|Class]], [[#UML_Sequence_Diagram|Sequence]], and [[#UML_Use_Case_Diagram|Use Case Diagrams]] describing both the static structure and dynamic behavior of a system.
Collaboration and sequence diagrams describe similiar information, and as typically implemented, can be transformed into one another without difficulty.
However, collaboration diagrams use the free-form arrangement of objects and links as used in Object diagrams. In order to maintain the ordering of messages in such a free-form diagram, messages are labeled with a chronological number and placed near the link the message is sent over. Reading a Collaboration diagram involves starting at message 1.0, and following the messages from object to object.
In UML 2.0, the Collaboration diagram has been simplified and renamed the Communication diagram.
Activity diagrams represent the business and operational workflows of a system. An Activity diagram is a variation of the state diagram where the "states" represent operations, and the transitions represent the activities that happen when the operation is complete.
This activity diagram shows the actions that take place when completing a (web) form.
The user starts by filling out the form, then it is checked; the result of the check determines if the form has to be filled out again or if the activity is completed.
Deployment diagrams serve to model the hardware used in system implementations and the associations between those components. The elements used in deployment diagrams are nodes (shown as a cube), components (shown as a rectangular box, with two rectangles protruding from the left side) and associations.
This deployment diagram shows the hardware used in a small office network. The application server (node) is connected to the database server (node) and the database client (component) is installed on the application server. The workstation is connected (association) to the application server and to a printer.
Although UML is a widely recognized and used standard, it is criticized for having imprecise semantics, which causes its interpretation to be subjective and therefore difficult for the formal test phase. This means that when using UML, users should provide some form of explanation of their models.
Another problem is that UML doesn't apply well to distributed systems. In such systems, factors such as serialization, message passing and persistence are of great importance. UML lacks the ability to specify such things. For example, it is not possible to specify using UML that an object "lives" in a [[server]] process and that it is shared among various instances of a running [[process]].
At the same time, UML is often considered to have become too bloated, and fine-grained in many aspects. Details which are best captured in source code are attempted to be captured using UML notation. The [[80-20 rule]] can be safely applied to UML: a small part of UML is adequate for most of the modeling needs, while many aspects of UML cater to some specialized or esoteric usages.
(However, the comprehensive scope of UML 2.0 is appropriate for [[model-driven architecture]].)
A third problem which leads to criticism and dissatisfaction is the large-scale adoption of UML by people without the required skills, often when management forces UML upon them.
- 데블스캠프2005/java . . . . 13 matches
The Java platform and language began as an internal project at Sun Microsystems in the December 1990 timeframe. Patrick Naughton, an engineer at Sun, had become increasingly frustrated with the state of Sun's C++ and C APIs and tools. While considering moving to NeXT, Patrick was offered a chance to work on new technology and thus the Stealth Project was started.
The Stealth Project was soon renamed to the Green Project with James Gosling and Mike Sheridan joining Patrick Naughton. They, together with some other engineers, began work in a small office on Sand Hill Road in Menlo Park, California to develop a new technology. The team originally considered C++ as the language to use, but many of them as well as Bill Joy found C++ and the available APIs problematic for several reasons.
Their platform was an embedded platform and had limited resources. Many members found that C++ was too complicated and developers often misused it. They found C++'s lack of garbage collection to also be a problem. Security, distributed programming, and threading support was also required. Finally, they wanted a platform that could be easily ported to all types of devices.
According to the available accounts, Bill Joy had ideas of a new language combining the best of Mesa and C. He proposed, in a paper called Further, to Sun that its engineers should produce an object-oriented environment based on C++. James Gosling's frustrations with C++ began while working on Imagination, an SGML editor. Initially, James attempted to modify and extend C++, which he referred to as C++ ++ -- (which is a play on the name of C++ meaning 'C++ plus some good things, and minus some bad things'), but soon abandoned that in favor of creating an entirely new language, called Oak named after the oak tree that stood just outside his office.
Like many stealth projects working on new technology, the team worked long hours and by the summer of 1992, they were able to demo portions of the new platform including the Green OS, Oak the language, the libraries, and the hardware. Their first attempt focused on building a PDA-like device having a highly graphical interface and a smart agent called Duke to assist the user.
The device was named Star7 after a telephone feature activated by *7 on a telephone keypad. The feature enabled users to answer the telephone anywhere. The PDA device itself was demonstrated on September 3, 1992.
In November of that year, the Green Project was spun off to become a wholly owned subsidiary of Sun Microsystems: FirstPerson, Inc. The team relocated to Palo Alto. The FirstPerson team was interested in building highly interactive devices and when Time Warner issued an RFP for a set-top box, FirstPerson changed their target and responded with a proposal for a set-top box platform. However, the cable industry felt that their platform gave too much control to the user and FirstPerson lost their bid to SGI. An additional deal with The 3DO Company for a set-top box also failed to materialize. FirstPerson was unable to generate any interest within the cable TV industry for their platform. Following their failures, the company, FirstPerson, was rolled back into Sun.
- 영호의해킹공부페이지 . . . . 13 matches
about the way the world works-should be unlimited and total.
Always yield to the Hands-On imperative!
4. Hackers should be judged by their hacking, not bogus criteria such
6. Computers can change (your) life for the better.
manner of exploiting daemons - The Buffer Overflow.
The remote buffer overflow is a very commonly found and exploited bug in badly
coded daemons - by overflowing the stack one can cause the software to execute
a shell equal to its current UID - thus if the daemon is run as root, like
A buffer is a block of computer memory that holds many instances of the same
up over the top, or breaking their boundaries.
A stack has the property of a queue of objects being placed one on top of the
other, and the last object placed on the stack will be the first one to be
to the stack (PUSH) and removed (POP). A stack is made up of stack frames,
The stack pointer (SP) always points to the top of the stack, the bottom of it
is static. PUSH and POP operations manipulate the size of the stack
dynamically at run time, and its growth will either be down the memory
addresses, or up them. This means that one could address variables in the
stack by giving their offsets from SP, but as POP's and PUSH's occur these
offsets change around. Another type of pointer points to a fixed location
within a frame (FP). This can be used for referencing variables because their
- TheKnightsOfTheRoundTable . . . . 12 matches
=== TheKnightsOfTheRoundTable ===
{{| The radius of the round table is: r |}}
{{| The radius of the round table is: 2.828 |}}
|| 하기웅 || C++ || 1시간 || [TheKnightsOfTheRoundTable/하기웅] ||
|| 김상섭 || C++ || 엄청 || [TheKnightsOfTheRoundTable/김상섭] ||
|| 문보창 || C++ || 10분 || [TheKnightsOfTheRoundTable/문보창] ||
|| 허준수 || C++|| ? || [TheKnightsOfTheRoundTable/허준수] ||
- BabyStepsSafely . . . . 11 matches
This article outlines the refactoring of an algorithm that generate the prime numbers up to a user specified maximum. This algorithm is called the Sieve of Eratosthenes. This article demonstrates that the granularity of the changes made to the source code are very small and rely completely on the ability to recompile and test the code after every change no matter how small. The step where the code is tested insures that each step is done safely. It is important to note that the execution of tests do not actually guarantee that the code is correct. The execution of the tests just guarantees that it isn't any worse that it used to db, prior to the change. This is good enough for the purposes of refactoring since we are tring to not damage anything thay may have worked before Therefore for each change in the code we will be recompilling the code and running the tests.
The code that is to be refactored has existed in the system for awhile. It has undergone a couple of transformations. Initially it returned an array of int variables that are the prime numbers. When the new collection library was introduced in Java2 the interface was changed to return a List of Integer objects. Going forward the method that returns a List is the preferred method, so the method that returns an array has been marked as being deprecated for the last couple of releases. During this release the array member function will be removed. Listing1, "Class GeneratePrimes," contains the source code for both methods.
The algorithm is quite simple. Given an array of integers starting at 2.Cross out all multiples of 2. Find the next uncrossed integer, and cross out all of its multiples. Repeat until you have passed the square root of the maximum value. This algorithm is implemented in the method generatePrimes() in Listing1. "Class GeneratePrimes,".
/** @param maxValue is the generation limit.
if(maxValue >= 2) // the only valid case
// how many primes are there?
// move the primes into the result
// return the primes
The test cases for the GeneratePrimes class are implemented using the JUnit testing framework. The tests are contained in class called TestGeneratePrames. There are a 5 tests for each return type (array and List), which appear to be similiar. Our first step to insure보증하다, 책임지다 that we are starting from a stable base is to make sure what we have works.
Therefore, recompile the both GeneratePrimes and TestGeneratePrime and run the tests.
Our first activity is to refactor the tests. [We might need some justification정당화 for refactoring the tests first, I was thinking that it should tie동여매다 into writing the tests first] The array method is being removed so all the test cases for this method need to be removed as well. Looking at Listing2. "Class TestsGeneratePrimes," it appears that the only difference in the suite of tests is that one tests a List of Integers and the other tests an array of ints. For example, testListPrime and testPrime test the same thing, the only difference is that testListPrime expects a List of Integer objects and testPrime expects and array of int variables. Therefore, we can remove the tests that use the array method and not worry that they are testing something that is different than the List tests.
- Gof/FactoryMethod . . . . 11 matches
A potential disadvantage of factory methods is that clients might have to subclass the Creator class just to create a particular ConcreteProduct object. Subclassing is fine when the client has to subclass the Creator class anyway, but otherwise the client now must deal with another point of evolution.
Here are two additional consequences of the Factory Method pattern:
예를 들어서 sub클래스 MyCreator는 MyProduct와 YouProduct를 바꾸고, 새로운 TheirProduct Sub클래스를 지원할수 있다.
if (id == THEIRS) return new TheirProduct; // 새로운 product 추가
DeleteMe 모호)마지막 부분에서 부모 클래스의 인자를 수행하는 것을 주목해라. MyCreator::Create는 오직 YOURS, MINE, THEIRS를 잡을수 있고, 부모클래스는 잡지 못한다. 다른 클래스는 이를 수행하지 못한다. 그러므로, MyCreator는 생성된 product의 한 종류를 확장하고, 그것은 생성에 대한 책임을 연기한다. 하지만, product가 그것의 부모인것은 적다.
MyCreator::Create handles only YOURS, MINE, and THEIRS differently than the parent class. It isn't interested in other classes. Hence MyCreator extends the kinds of products created, and it defers responsibility for creating all but a few products to its parent.
You can avoid this by being careful to access products solely through accessor operations that create the product on demand. Instead of creating the concrete product in the constructor, the constructor merely initializes it to 0. The accessor returns the product. But first it checks to make sure the product exists, and if it doesn't, the accessor creates it. This technique is sometimes called lazy initialization. The following code shows a typical implementation:
4. Using templates to avoid subclassing. As we've mentioned, another potential problem with factory methods is that they might force you to subclass just to create the appropriate Product objects. Another way to get around this in C++ is to provide a template subclass of Creator that's parameterized by the Product
return new TheProduct;
With this template, the client supplies just the product class?no subclassing of Creator is required.
5. Naming conventions. It's good practice to use naming conventions that make it clear you're using factory methods. For example, the MacApp Macintosh application framework [App89] always declares the abstract operation that defines the factory method as Class* DoMakeClass(), where Class is the Product class.
The function CreateMaze (page 84) builds and returns a maze. One problem with this function is that it hard-codes the classes of maze, rooms, doors, and walls. We'll introduce factory methods to let subclasses choose these components.
First we'll define factory methods in MazeGame for creating the maze, room, wall, and door objects:
Each factory method returns a maze component of a given type. MazeGame provides default implementations that return the simplest kinds of maze, rooms, walls, and doors.
Now we can rewrite CreateMaze to use these factory methods:
Door* theDoor = MakeDoor(r1, r2);
r1->SetSide(East, theDoor);
r2->SetSide(West, theDoor);
Different games can subclass MazeGame to specialize parts of the maze. MazeGame subclasses can redefine some or all of the factory methods to specify variations in products. For example, a BombedMazeGame can redefine the Room and Wall products to return the bombed varieties:
Factory methods pervade toolkits and frameworks. The preceding document example is a typical use in MacApp and ET++ [WGM88]. The manipulator example is from Unidraw.
- LearningToDrive . . . . 11 matches
I can remeber clearly the day I first began learning to drive. My mother and I were driving up Interstate 5 near Chico, California, a horizon. My mom had me reach over from the passenger seat and hold the steering wheel. She let me get the feel of how motion of the wheel affected the dirction of the car. Then she told me, "Here's how you drive. Line the car up in the middle of the lane, straight toward the horizon."
I very carefully squinted straight down the road. I got the car smack dab in the middle of the lane, pointed right down the middle of the road. I was doing great. My mind wandered a little...
I jerked back to attention as the car hit the gravel. My mom (her courage now amazes me) gently got the car back straight on the road. The she actually taught me about driving. "Driving is not about getting the car goint in the right direction. Driving is about constantly paying attention, making a little correction this way, a little correction that way."
This is the paradigm for XP. There is no such thing as straight and level. Even if things seem to be going perfectly, you don't take your eyes off the road. Change is the only constant. Always be prepared to move a little this way, a little that way. Sometimes maybe you have to move in a completely different direction. That's life as a programmer.
Everythings in software changes. The requirements change. The design changes. The business changes. The technology changes. The team changes. The team members change. The problem isn't change, per se, because change is going to happen; the problem, rather, is the inability to cope with change when it comes.
The driver of a software project is the customer. If the software doesn't do what they want it to do, you have failed. Of course, they don't know exactly what the software should do. That's why software development is like steering, not like getting the car pointed straight down the road. Out job as programmers is to give the customer a steering wheel and give them feedback about exactly where we are on the road.
소프트웨어 개발을 운전을 배우는 것에 비유한 설명이 재미있네요. software project 의 Driver 는 customer 라는 말과.. Programmer 는 customer 에게 운전대를 주고, 그들에게 우리가 정확히 제대로 된 길에 있는지에 대해 feedback 을 주는 직업이라는 말이 인상적이여서. 그리고 customer 와 programmer 와의 의견이 수렴되어가는 과정이 머릿속으로 그려지는 것이 나름대로 인상적인중. 그리고 'Change is the only constant. Always be prepared to move a little this way, a little that way. Sometimes maybe you have to move in a completely different direction. That's life as a programmer.' 부분도.. 아.. 부지런해야 할 프로그래머. --;
- ReadySet 번역처음화면 . . . . 11 matches
Software development projects require a lot of "paperwork" in the form of requirements documents, design documents, test plans, schedules, checklists, release notes, etc. It seems that everyone creates the documents from a blank page, from the documents used on their last project, or from one of a handful of high-priced proprietary software engineering template libraries. For those of us who start from a blank page, it can be a lot of work and it is easy to forget important parts. That is not a very reliable basis for professional engineering projects.
'''* What is the goal of this project?'''
ReadySET is an open source project to produce and maintain a library of reusable software engineering document templates. These templates provide a ready starting point for the documents used in software development projects. Using good templates can help developers work more quickly, but they also help to prompt discussion and avoid oversights.
'''* What are some key features that define the product?'''
'''*What makes this product different from others?'''
This is an open source project that you are welcome to use for free and help make better. Existing packages of software engineering templates are highly costly and biased by the authorship of only a few people, by vendor-client relationships, or by the set of tools offered by a particular vendor.
These templates are in pure XHTML with CSS, not a proprietary file format. That makes them easier to edit and to track changes using freely available tools and version control systems. The templates are designed to always be used on the web; they use hyperlinks to avoid duplicating information.
The templates are not burdened with information about individual authorship or document change history. It is assumed that professional software developers will keep all project documents in version control systems that provide those capabilities.
These templates are not one-size-fits-all and they do not attempt to provide prescriptive guidance on the overall development process. We are developing a broad library of template modules for many purposes and processes. The templates may be filled out in a suggested sequence or in any sequence that fits your existing process. They may be easily customized with any text or HTML editor.
'''*What is the scope of this project?'''
'''*What are the high-level assumptions or ground rules for the project?'''
I assume that the user takes ultimate responsibility for the content of all their actual project documents. The templates are merely starting points and low-level guidance.
This project does not attempt to provide powerful tools for reorganizing the templates, mapping them to a given software development process, or generating templates from a underlying process model. This project does not include any application code for any tools, users simply use text editors to fill in or customize the templates.
Yes. It is part of the Tigris.org mission of promoting open source software engineering. It is also the first product in a product line that will provide even better support to professional software developers. For more information, see [http://www.readysetpro.com ReadySET Pro] .
'''*What is the status of this project?'''
These templates are based on templates originally used to teach software engineering in a university project course. They are now being enhanced, expanded, and used more widely by professionals in industry.
The template set is fairly complete and ready for use in real projects. You can [http://readyset.tigris.org/servlets/ProjectDocumentList download] recent releases. We welcome your feedback.
For the latest news, see the [http://readyset.tigris.org/servlets/ProjectNewsList Project Announcements].
ReadySET is aimed at software engineers who wish that their projects could go more smoothly and professionally. ReadySET can be used by anyone who is able to use an HTML editor or edit HTML in a text editor.
*2. [http://readyset.tigris.org/servlets/ProjectDocumentList Download] the templates and unarchive
- TwistingTheTriad . . . . 11 matches
http://www.object-arts.com/Papers/TwistingTheTriad.PDF
http://www.esug.org/summerschools/2000_Southampton/twistingTheTriad/twistingTheTriad.pdf
with a widget-based system it is easy to avoid having to think about the (required) separation between the user interface and the application domain objects, but it is all too easy to allow one's domain code to become inextricably linked with the general interface logic.
it was much more that the widget system was just not flexible enought. We didn't know at the time, but were just starting to realise, that Smalltalk thrives on plugability and the user interface components in out widget framework were just not fine-grained enough.
One example of this deficiency surfaced in SmalltalkWorkspace widget. This was originally designed as a multiline text-editing component with additional logic to handle user interface commands such as Do-it, Show-it, Inspect-it etc. The view itself was a standard Windows text control and we just attached code to it to handle the workspace functionality. However, we soon discovered that we also wanted to have a rich text workspace widget too. Typically the implementation of this would have required the duplication of the workspace logic from the SmalltalkWorkspace component or, at least, an unwarranted refactoring session. It seemed to us that the widget framework could well do with some refactoring itself!
In MVC, most of the application functionality must be built into a model class known as an Application Model. It is the reponsibility of the application model to be the mediator between the true domain objects and the views and their controllers. The views are responsible for displaying the domain data while the controller handle the raw usr gestures that will eventually perform action on this data. So the application model typically has method to perform menu command actions, push buttons actions and general validation on the data that it manages. Nearly all of the application logic will reside in the application model classes. However, because the application model's role is that of a go-between, it is at times necessary for it to gain access to the user interface directly but, because of the Observer relationship betweeen it and the view/controller, this sort of access is discouraged.
For example, let's say one wants to explicitly change the colour of one or more views dependent on some conditions in the application model. The correct way to do this in MVC would be to trigger some sort of event, passing the colour along with it. Behaviour would then have to be coded in the view to "hang off" this event and to apply the colour change whenever the event was triggered. This is a rather circuitous route to achieving this simple functionality and typically it would be avoided by taking a shoutcut and using #componentAt : to look up a particular named view from the application model and to apply the colour change to the view directly. However, any direct access of a view like this breaks the MVC dictum that the model should know nothing about the views to which it is connected. If nothing else, this sort of activity surely breaks the possibility of allowing multiple views onto a model, which must be the reason behind using the Observer pattern in MVC in the first place.
=== TwistingTheTriad : ModelViewPresenter ===
This is the data upon which the user interface will operate. It is typically a domain object and the intention is that such objects should have no knowledge of the user interface. Here the M in MVP differs from the M in MVC. As mentioned above, the latter is actually an Application Model, which holds onto aspects of the domain data but also implements the user interface to manupulate it. In MVP, the model is purely a domain object and there is no expectation of (or link to) the user interface at all.
The behaviour of a view in MVP is much the same as in MVC. It is the view's responsibility to display the contents of a model. The model is expected to trigger appropriate change notification whenever its data is modified and these allow the view to "hang off" the model following the standard Observer pattern. In the same way as MVC does, this allows multiple vies to be connected to a single model.
One significant difference in MVP is the removal of the controller. Instead, the view is expected to handle the raw user interface events generated by the operating system (in Windows these come in as WM_xxxx messages) and this way of working fits more naturally into the style of most modern operating systems. In some cases, as a TextView, the user input is handled directly by the view and used to make changes to the model data. However, in most cases the user input events are actually routed via the presenter and it is this which becomes responsible for how the model gets changed.
While it is the view's responsibility to display model data it is the presenter that governs how the model can be manipulated and changed by the user interface. This is where the heart of an application's behaviour resides. In many ways, a MVP presenter is equivalent to the application model in MVC; most of the code dealing with how a user interface works is built into a presenter class. The main difference is that a presenter is ''directly'' linked to its associated view so that the two can closely collaborate in their roles of supplying the user interface for a particular model.
Compared with our orignnal widget framework, MVP offers a much greater separation between the visual presentation of an interface and the code required to implement the interface functionality. The latter resides in one or more presenter classes that are coded as normal using a standard class browser.
- FortuneCookies . . . . 10 matches
* "It seems strange to meet computer geeks who're still primarily running Windows... as if they were still cooking on a wood stove or something." - mbp
* "Heck, I'm having a hard time imagining the DOM as civilized!" -- Fred L. Drake, Jr.
* Some men are discovered; others are found out.
* Take care of the luxuries and the necessities will take care of themselves.
* Words are the voice of the heart.
* The universe is laughing behind your back.
* The best prophet of the future is the past.
* Even the boldest zebra fears the hungry lion.
* Money will say more in one moment than the most eloquent lover can in years.
* You will overcome the attacks of jealous associates.
* You have the power to influence all with whom you come in contact.
* You will step on the soil of many countries.
* You are secretive in your dealings but never to the extent of trickery.
* He who invents adages for others to peruse takes along rowboat when going on cruise.
* You are tricky, but never to the point of dishonesty.
* Of all forms of caution, caution in love is the most fatal.
* The person you rejected yesterday could make you happy, if you say yes.
* You are dishonest, but never to the point of hurting a friend.
* The Tree of Learning bears the noblest fruit, but noble fruit tastes bad.
* Mistakes are oft the stepping stones to failure.
- TheJavaMan . . . . 10 matches
[TheJavaMan/스네이크바이트] - 민수
[TheJavaMan/테트리스] - 수민
[TheJavaMan/지뢰찾기] - 세환
[TheJavaMan/숫자야구] - 휘동, 원명 - 종료
[TheJavaMan/달력] - 세환 - 종료
[TheJavaMan/로보코드] - 참여를 바랍니다.ㅜㅜ
[TheJavaMan/비행기게임] - 휘동, 민수, 원명, 수민, 세환
* [http://java.sun.com/docs/books/tutorial/java/index.html The Java Tutorial]
* [TheJavaMan/설치] - 자바설치랑 Hello출력
- [TheJavaMan/로보코드]로 하면 되지 않을까?ㅋㅋ 로보코드 폐인을 위해 -[Leonardong]
- [Lovely]boy^_^/Diary/2-2-9 . . . . 10 matches
* 신촌 7시 민토신관 컴퓨터고전스터디 The Mythical Man Month Chapter 3&4
* ["TheWarOfGenesis2R"] 시작
* TheMythicalManMonth 5,6장 읽었다. 5장은 대충 감은 오는데.. 정확히는 무슨 내용인지 알수가 없다.--; 클났군.. 6장은 피곤해서 조금 읽다 말았다. 낼 일찍 일어나서 읽어야겠다.
* The computer classic study - The Mythical Man Month Chapter 3&4 - meeting is on today P.M. 7 O'clock, at SinChon Min.To.
* I borrow the SmallTalk by Example.
* I borrow the UML for beginner. Translator is Kwak Yong Jae.(His translation is very good)
* I'll never advance arcanoid.--; It's bored. I'll end the refactoring instantly, and do documentaion.
* My arcanoid running is not same any computer. Some computers are running this game very well, others are blinking screen, anothers are not able to move the bar.
* ["TheWarOfGenesis2R"] Start
* If my page is helpful to some person, It's very delightful. I feel that feeling these days.
* I'll delight The AcceleratedC++, that I summary on wiki pages is helpful for beginner of C++.
* I read the TheMythicalManMonth Chapter5,6. I feel chapter5's contents a bit.. I can't know precision contents.--; It's shit.. I read a chapter6 not much, because I'm so tired. I'll get up early tomorrow, and read chapter6.
* The computer classic study - The Mythical Man Month Chapter 5&6 - meeting is on today P.M. 5 O'clock, at SinChon Min.To.
- [Lovely]boy^_^/EnglishGrammer/PresentAndPast . . . . 10 matches
This means) She is driving now, at the time of speaking. The action is not finished.
B. I am doing something = I'm in the middle of doing something; I've started doing it and I haven't finished yet.
Often the action is happening at the time of speaking.
But the action is not necessarily happening at the time of speaking.
ex) I'm reading an interesting book at the moment. I'll lend it to you when I've finished it.
This means) Tom is not reading the book at the time of speaking.
He means that he has started it but has not finished it yet. He is in the middle of reading it.
C. We use the present continuous when we talk about things happening in a period around now. (today / this week / tonight, etc..)
We use the present contunuous when we talk about changes happening now or around now.
ex) The population of the world is rising very fast.
B. We use the simple present to talk about things in general. We use it to say that something happens all the time
or repeateldy or that something is true in general. It is not important whether the action is happening at the time of speaking
In the following examples do is also the main verb( do가 메인 동사로 쓰일때도 있다. )
D. We use the simple present when we say how often we do things ( 빈도를 나타내는 문장을 만들때는 단순 현재를 쓴다. )
ex) In the summer Hohn usually plays tennis once or twice a week.
Note the position of always/never/usually, etc... (before the main verb, after be verb) ( 위치 주의 )
We use the present continuous for something that is happening at or around the time of speaking.
The action is not finished. sometimes, Use the Present continuous for temporary situations.
We use the simple present for things in general or things that happen repeatedly.
Sometimes, Use the simple present for permanent situations.
- Garbage collector for C and C++ . . . . 8 matches
# This causes the collector to assume that all inaccessible
# Finalization and the test program are not usable in this mode.
# (Clients should also define GC_SOLARIS_THREADS and then include
# -DALL_INTERIOR_POINTERS allows all pointers to the interior
# -DSMALL_CONFIG tries to tune the collector for small heap sizes,
# -DLARGE_CONFIG tunes the collector for unusually large heaps.
# causes all objects to be padded so that pointers just past the end of
# an object can be recognized. This can be expensive. (The padding
# -DDONT_ADD_BYTE_AT_END disables the padding.
# the GC process. This is no less correct than many malloc
# -DNO_EXECUTE_PERMISSION may cause some or all of the heap to not
# code from the heap. Currently this only affects the incremental
# -DGC_NO_OPERATOR_NEW_ARRAY declares that the C++ compiler does not support
# the new syntax "operator new[]" for allocating and deleting arrays.
# See gc_cpp.h for details. No effect on the C part of the collector.
# Unless the following macros are defined, realloc is also redirected
# Calloc and strdup are redefined in terms of the new malloc. X should
# be either GC_malloc or GC_malloc_uncollectable, or
# GC_debug_malloc_replacement. (The latter invokes GC_debug_malloc
# It requires that the following two macros also be used.)
- OperatingSystemClass/Exam2002_2 . . . . 8 matches
4. Consider a paging system with the page table stored in memory.
* If we add associative registers and 75 percent of all page-table references are found in the associative regsters, what is the effective memory time? (Assume that finding a page-table entry in the associative registers takes zero time, if the entry is there)
5. Consider the following page reference string:
How many page faults would occur for the following replacement algorithm, assuming one, three, five, seven frames? Remember all frames are initially empty, so your first unique pages will all cost one fault each.
6. Consider a file currently consisting of 100 blocks. Assume that the file control block(and the index block, in the case of indexed allocation) is already in memory, Calculate how many disk I/O operations are required for contiguous, linked and indexed (single-level) allocation strategies, if for one block, the following conditions hold. In the contiguous allocation case, assume that there is no room to grow in the beginning, but there is room to grow in the end. Assume that the block information to be added in stored in memory.
* The block is added at the beginning.
* The block is added in the middle.
* The block is added at the end.
* The block is removed from the beginning.
* The block is removed from the middle.
* The block is removed from the end.
7. Suppose that a disk drive has 5000 cylinders, numbered 0 to 4999. The drive is currently serving a request at cylinder 143, and the previous requrest was at cylinder 125. The queue of pending requests, in FIFO order, is
Starting from the current head position, what is the total distance (in cylinders) that the disk arm moves to satisfy all the pending requrests, for each of the following disk scheduling algorithms?
- ReleasePlanning . . . . 8 matches
A release planning meeting is used to create a release plan, which lays out the overall project. The release plan is then used to create iteration plans for each individual iteration.
It is important for technical people to make the technical decisions and business people to make the business decisions. Release planning has a set of rules that allows everyone involved with the project to make their own decisions. The rules define a method to negotiate a schedule everyone can commit to.
The essence of the release planning meeting is for the development team to estimate each user story in terms of ideal programming weeks. An ideal week is how long you imagine it would take to implement that story if you had absolutely nothing else to do.
No dependencies, no extra work, but do include tests. The customer then decides what story is the most important or has the highest priority to be completed.
User stories are printed or written on cards. Together developers and customers move the cards around on a large table to create a set
of stories to be implemented as the first (or next) release. A useable, testable system that makes good business sense delivered early is desired.You may plan by time or by scope. The project velocity is used to determine either how many stories can be implemented before a given date (time) or how long a set of stories will take to finish (scope). When planning by time multiply the number of iterations by the project velocity to determine how many user stories can be completed. When planning by scope divide the total weeks of estimated user stories by the project velocity to determine how many iterations till the release is ready.
Individual iterations are planned in detail just before each iteration begins and not in advance. The release planning meeting was called the planning game and the rules can be found at the Portland Pattern Repository.
When the final release plan is created and is displeasing to management it is tempting to just change the estimates for the user stories. You must not do this. The estimates are valid and will be required as-is during the iteration planning meetings. Underestimating now will cause problems later. Instead negotiate an acceptable release plan. Negotiate until the developers, customers, and managers can all agree to the release plan.
The base philosophy of release planning is that a project may be quantified by four variables; scope, resources, time, and quality. Scope is how much is to be done. Resources are
how many people are available. Time is when the project or release will be done. And quality is how good the software will be and how well tested it will be.
Management can only choose 3 of the 4 project variables to dictate, development always gets the remaining variable. Note that lowering quality less than excellent has unforeseen impact on the other 3. In essence there are only 3 variables that you actually want to change. Also let the developers moderate the customers desire to have the project done immediately by hiring too many people at one time.
- SmalltalkBestPracticePatterns/DispatchedInterpretation . . . . 8 matches
Back in the days when data was separated from computation, and seldom the twain should meet, encoding decisions were critical. Any encoding decision you made was propagated to many different parts of the computation. If you got the encoding wrong, the cost of change was enormous. The longer it took to find the mistake, the more ridiculous the bill.
과거로 돌아가서 데이타가 연산으로부터 불리되었을 때, 그리고 종종 그 둘이 만나야 했을 때, 인코딩 결정은 중대한 것이었다. 너의 어떠한 인코딩 결정은 연산의 많은 다른 부분들을 점차적으로 증가시켜나아갔다. 만약 잘못된 인코딩을 한다면, 변화의 비용은 막대하다. The longer it took to find the mistake, the more ridiculous the bill.
Objects change all this. How you distribute responsibility among objects is the critical decision, encoding is a distant second. For the most part, in well factored programs, only a single object is interested in a piece of information. That object directly references the information and privately performs all the needed encoding and decoding.
Sometimes, however, information in one object must influence the behavior of another. When the uses of the information are simple, or the possible choices based on the information limited, it is sufficient to send a message to the encoded object. Thus, the fact that boolean values are represented as instances of one of two classes, True and False, is hidden behind the message #ifTrue:ifFalse:.
We could encode boolean values some other way, and as long as we provided the same protocol, no client would be the wiser.
Sets interact with their elements like this. Regardless of how an object is represented, as long it can respond to #=and #hash, it can be put in a Set.
Sometimes, encoding decisions can be hidden behind intermediate objects. And ASCII String encoded as eight-bit bytes hides that fact by conversing with the outside world in terms of Characters:
When there are many different types of information to be encoded, and the behavior of clients changes based on the information, these simple strategies won't work. The problem is that you don't want each of a hundred clients to explicitly record in a case statement what all the types of information are.
For example, consider a graphical Shape represented by a sequence of line, curve, stroke, and fill commands. Regardless of how the Shape is represented internally, it can provide a message #commandAt: anInteger that returns a Symbol representing the command and #argumentsAt: anInteger that returns an array of arguments. We could use these messages to write a PostScriptShapePrinter that would convert a Shape to PostScript:
Every client that wanted to make decisions based on what commands where in a Shape would have to have the same case statement, violating the "once and only once" rule. We need a solution where the case statement is hidden inside of the encoded objects.
* ''Have the client send a message to the encoded object. PAss a parameter to which the encoded object will send decoded messages.''
The simplest example of this is Collection>>do:. By passing a one argument Block(or any other object that responds to #value:), you are assured that the code will work, no matter whether the Collection is encoded as a linear list, an array, a hash table, or a balanced tree.
This is a simplified case of Dispatched Interpretation because there is only a single message coming back. For the most part, there will be several messages. For example, we can use this pattern with the Shape example. Rather than have a case statement for every command, we have a method in PostScriptShapePrinter for every command, For example:
Rather than Shapes providing #commandAt: and #argumentsAt:, they provide #sendCommantAt: anInteger to: anObject, where #lineFrom:to: is one of the messages that could be sent back. Then the original display code could read:
This could be further simplified by giving Shapes the responsibility to iterate over themselves:
The name "dispatched interpretation" comes from the distribution of responsibility. The encoded object "dispatches" a message to the client. The client "interprets" the message. Thus, the Shape dispatches message like #lineFrom:to: and #curveFrom:mid:to:. It's up to the clients to interpret the messages, with the PostScriptShapePrinter creating PostScript and the ShapeDisplayer displaying on the screen.
- DesignPatternsAsAPathToConceptualIntegrity . . . . 7 matches
During our discussions about the organization of design patterns there was a comment about the difficulty of identifying the “generative nature” of design patterns. This may be a good property to identify, for if we understood how design patterns are used in the design process, then their organization may not be far behind. Alexander makes a point that the generative nature of design patterns is one of the key benefits. In practice, on the software side, the generative nature seems to have fallen away and the more common approach for using design patterns is characterized as “when faced with problem xyz…the solution is…” One might say in software a more opportunistic application of design patterns is prevalent over a generative use of design patterns.
The source of this difference may be the lack of focus on design patterns in the design process. In fact, we seldom see discussions of the design process associated with design patterns. It is as though design patterns are a tool that is used independent of the process. Let’s investigate this further:
· The existence of an architecture, on top of any object/class design
· The internal regularity (….or conceptual integrity) of the architectural design
This is what Brooks wrote 25 years ago. "… Conceptual integrity is the most important consideration in system design."[Brooks 86] He continues: “The dilemma is a cruel one. For efficiency and conceptual integrity, one prefers a few good minds doing design and construction. Yet for large systems one wants a way to bring considerable manpower to bear, so that the product can make a timely appearance. How can these two needs be reconciled?”
One approach would be to identify and elevate a single overriding quality (such as adaptability or isolation of change) and use that quality as a foundation for the design process. If this overriding quality were one of the goals or even a specific design criteria of the process then perhaps the “many” could produce a timely product with the same conceptual integrity as “a few good minds.” How can this be accomplished and the and at least parts of the “cruel dilemma” resolved?
The following summary is from “Design Patterns as a Litmus Paper to Test the Strength of Object-Oriented Methods” and may provide some insight:
1. Some O-O design methodologies provide a systematic process in the form of axiomatic steps for developing architectures or micro-architectures that are optimality partitioned (modularized) according to a specific design criteria.
2. The following methodologies are listed according to their key design criteria for modularization:
a. Booch in OOSE relies heavily on expert designers and experience to provide the system modularization principle.
b. OMT, Coad-Yourdon, Shaer-Mellor are data driven and as such raise data dependency as the system modularization principle.
c. Wirfs-Brock with Responsibility Driven Design (RDD) raises contract minimization as the system modularization principle.
d. Snoeck with Event Driven Design (EDD) raises existence dependency as the system modularization principle.
3. According to the authors only RDD and EDD have axiomatic rules for OO design and therefore are strong OO design methods.
4. Design patterns provide guidance in designing micro-architectures according to a primary modularization principle: “encapsulate the part that changes.”
5. EDD and RDD will generate different design patterns that meet the primary modularization principle “encapsulate the part that changes.” in different ways when applied according to their axiomatic rules. For example RDD generates Mediator, Command, Template Method and Chain of responsibility (mostly behavior) where as EDD generates Observer, Composite, and Chain of responsibility (mostly structure).
Now putting this together with the earlier discussion about conceptual integrity we can propose some questions for discussion:
· Will strong O-O design methods produce results for the “many” with the same conceptual integrity as “a few good minds.”
· Does the product have conceptual integrity?
· Along what principle (experience, data, existence dependency, contract minimization, or some unknown principle) is the application partitioned?
- Gof/Adapter . . . . 7 matches
We'll give a brief sketch of the implementation of class and object adapters for the Motivation example beginning with the classes Shape and TextView.
Shape assumes a bounding box defined by its opposing corners. In contrast, TextView is defined by an origin, height, and width. Shape also defines a CreateManipulator operation for creating a Manipulator object, which knowns how to animate a shape when the user manipulates it. TextView has no equivalent operation. The class TextShape is an adapter between these different interfaces.
A class adapter uses multiple inheritance to adapt interfaces. The key to class dapters is to use one inheritance branch to inherit the interface and another branch to inherit the implementation. The usual way to make this distinction in C++ is to inherit the interface publicly and inherit the implementation privately. We'll use this convention to define the TextShape adapter.
The BoundingBox operation converts TextView's interface to conform to Shape's.
The IsEmpty operations demonstrates the direct forwarding of requests common in adapter implementations:
The object adapter uses object composition to combine classes with different interfaces. In this approach, the adapter TextShape maintains a pointer to TextView.
TextShape must initialize the pointer to the TextView instance, and it does so in the constructor. It must also call operations on its TextView object whenever its own operations are called. In this example, assume that the client creates the TextView object and passes it to the TextShape constructor.
CreateManipulator's implementation doesn't change from the class adapter version, since it's implemented from scratch and doesn't reuse any existing TextView functionality.
Compare this code the class adapter case. The object adapter requires a little more effort to write, but it's more flexible. For example, the object adapter version of TextShape will work equally well with subclasses of TextView -- the client simply passes an instance of a TextView subclass to the TextShape constructor.
- SolarSystem/상협 . . . . 7 matches
// Calculate The Aspect Ratio Of The Window
glMatrixMode(GL_MODELVIEW); // Select The Modelview Matrix
MessageBox(NULL,"Failed To Register The Window Class."
if(MessageBox(NULL,"The Requested FUllscreen Mode is Not Supported By\n Your video Card. Use Windowed Mode Instead?","NeHeGl",MB_YESNO|
MessageBox(NULL,"Can't Set The PixelFormat"
MessageBox(NULL,"Can't Activate The GL Rendering Context"
- UML/CaseTool . . . . 7 matches
''Diagramming'' in this context means ''creating'' and ''editing'' UML [[diagram]]s; that is diagrams that follow the graphical notation of the Unified Modeling Language.
The diagramming part of the Unified Modeling Language seems to be a lesser debated part of the UML, compared to code generation.
The UML diagram notation evolved from elderly, previously competing notations. UML diagrams as a means to draw diagrams of - mostly - [[Object-oriented programming|object oriented]] software is less debated among software developers. If developers draw diagrams of object oriented software, there is widespread consensus ''to use the UML notation'' for that task. On the other hand, it is debated, whether those diagrams are needed at all, on what stage(s) of the software development process they should be used and whether and how (if at all) they should be kept up-to date, facing continuously evolving program code.
''[[Code generation]]'' in this context means, that the user creates UML diagrams, which have some connoted model data, from which the UML tool derives (through a conversion process) parts or all of the [[source code]] for the software system that is to be developed. Often, the user can provide some skeleton of the program source code, in the form of a source code [[template]] where predefined tokens are then replaced with program source code parts, emitted by the UML tool during the code generation process.
There is some debate among software developers about how useful code generation as such is. It certainly depends on the specific problem domain and how far code generation should be applied. There are well known areas where code generation is an established practice, not limited to the field of UML. On the other hand, the idea of completely leaving the "code level" and start "programming" on the UML diagram level is quite debated among developers, and at least, not in such widespread use compared to other [[software development]] tools like [[compiler]]s or [[Configuration management|software configuration management systems]]. An often cited criticism is that the UML diagrams just lack the detail which is needed to contain the same information as is covered with the program source. There are developers that even state that "the Code ''is'' the design" (articles [http://www.developerdotstar.com/mag/articles/reeves_design_main.html] by Jack W. Reeves [http://www.bleading-edge.com/]).
''Reverse engineering'' in this context means, that the UML tool reads program source code as input and ''derives'' model data and corresponding graphical UML diagrams from it (as opposed to the somewhat broader meaning described in the article "[[Reverse engineering]]").
Reverse engineering encloses the problematic, that diagram data is normally not contained with the program source, such that the UML tool, at least in the initial step, has to create some ''random layout'' of the graphical symbols of the UML notation or use some automatic ''layout algorithm'' to place the symbols in a way that the user can understand the diagram. For example, the symbols should be placed at such locations on the drawing pane that they don't overlap. Usually, the user of such a functionality of an UML tool has to manually edit those automatically generated diagrams to attain some meaningfulness. It also often doesn't make sense to draw diagrams of the whole program source, as that represents just too much detail to be of interest at the level of the UML diagrams. There are also language features of some [[programming language]]s, like ''class-'' or ''function templates'' of the programming language [[C plus plus|C++]], which are notoriously hard to convert automatically to UML diagrams in their full complexity.
There are UML tools that use the attribute ''round trip'' (sometimes also denoted as ''round trip engineering'') to connote their ability to keep the ''source code'', the ''model data'' and the corresponding ''UML diagrams'' ''in sync''.
This means that the user should be able to change either the ''model data'' (together with the corresponding diagrams) or the ''program source code'' and then the UML tool updates the other part automatically.
Rational Software Architect, Together가 유명하고, 오픈 소스로는 Argo, Violet 이 유명하다.
- ACM_ICPC/2011년스터디 . . . . 6 matches
|| [권순의] || 1298 || The Hardest Problem Ever ||The Easiest Problem Ever -ㅅ- ||
|| [정의정] || 2970 || The lazy programmer ||물론 제가 게으르다는 말은 아닙니다. ||
* [TheHardestProblemEver/권순의]
* PIGS(1149)와 The lazy programmer(2970) 중에서 하나 풀어오기
* 그래서 [정진경]군이 157번[http://koistudy.net/?mid=prob_page&NO=157 The tower of Hanoi]문제를 풀고, 설명한 후 [Mario]문제(선형적인 문제)를 풀게하여 연습을 한 후 다시 파닭문제에 도전하게 되었습니다.
- DebuggingSeminar_2005/AutoExp.dat . . . . 6 matches
; While debugging, Data Tips and items in the Watch and Variable
; windows are automatically expanded to show their most important
; elements. The expansion follows the format given by the rules
; in this file. You can add rules for your types or change the
; For good examples, read the rules in this file.
; To find what the debugger considers the type of a variable to
; be, add it to the Watch window and look at the Type column.
; An AutoExpand rule is a line with the name of a type, an equals
; sign, and text with replaceable parts in angle brackets. The
; part in angle brackets names a member of the type and an
; AutoExpand rules use the following syntax. The equals sign (=),
; type Name of the type (may be followed by <*> for template
; types such as the ATL types listed below).
; text Any text.Usually the name of the member to display,
; or a shorthand name for the member.
; format Watch format specifier. One of the following:
; For details of other format specifiers see Help under:
; The special format <,t> specifies the name of the most-derived
; type of the object. This is especially useful with pointers or
; If there is no rule for a class, the base classes are checked for
- HowToStudyDesignPatterns . . . . 6 matches
''We were not bold enough to say in print that you should avoid putting in patterns until you had enough experience to know you needed them, but we all believed that. I have always thought that patterns should appear later in the life of a program, not in your early versions.''
''The other thing I want to underscore here is how to go about reading Design Patterns, a.k.a. the "GoF" book. Many people feel that to fully grasp its content, they need to read it sequentially. But GoF is really a reference book, not a novel. Imagine trying to learn German by reading a Deutsch-English dictionary cover-to-cover;it just won't work! If you want to master German, you have to immerse yourself in German culture. You have to live German. The same is true of design patterns: you must immerse yourself in software development before you can master them. You have to live the patterns.
Read Design Patterns like a novel if you must, but few people will become fluent that way. Put the patterns to work in the heat of a software development project. Draw on their insights as you encounter real design problems. That’s the most efficient way to make the GoF patterns your own.''
''...but I always teach Composite Pattern, Strategy Pattern, Template Method Pattern, and Factory Method Pattern before I teach Singleton Pattern. They are much more common, and most people are probably already using the last two. ... ''
* 패턴이 어떻게 생성되었는지 그 과정을 보여주지 못한다. 즉, 스스로 패턴을 만들어내는 데에 전혀 도움이 안된다. (NoSmok:LearnHowTheyBecameMasters)
알렉산더가 The Timeless Way of Building의 마지막에서 무슨 말을 하는가요?
||''At this final stage, the patterns are no longer important ... [[BR]][[BR]]The patterns have taught you to be receptive to what is real.''||
- LawOfDemeter . . . . 6 matches
within our class can we just starting sending commands and queries to any other object in the system will-
nilly? Well, you could, but that would be a bad idea, according to the Law of Demeter. The Law of Demeter
What that means is that the more objects you talk to, the more you run the risk of getting broken when one
of them changes. So not only do you want to say as little as possible, you don't want to talk to more
objects than you need to either. In fact, according to the Law of Demeter for Methods, any method of an
any parameters that were passed in to the method.
Specifically missing from this list is methods belonging to objects that were returned from some other
()). Direct access of a child like this extends coupling from the caller farther than it needs to be. The
caller is depending on these facts:
Now the caller is only depending on the fact that it can add a foo to thingy, which sounds high level
The disadvantage, of course, is that you end up writing many small wrapper methods that do very little but
delegate container traversal and such. The cost tradeoff is between that inefficiency and higher class
The higher the degree of coupling between classes, the higher the odds that any change you make will break
Depending on your application, the development and maintenance costs of high class coupling may easily
Now back to to the ask vs. tell thing. To ask is a query, to tell is a command. I subscribe to the notion
of maintaining these as separate methods. Why bother?
It helps to maintain the "Tell, Don't Ask" principle if you think in terms of commands that perform a very
tossing data out, you probably aren't thinking much in the way of invariants).
If you can assume that evaluation of a query is free of any side effects, then you can:
use queries from within a debugger without affecting the process under test.
- NamedPipe . . . . 6 matches
A named pipe is a named, one-way or duplex pipe for communication between the pipe server and one or more pipe clients. All instances of a
named pipe share the same pipe name, but each instance has its own buffers and handles, and provides a separate conduit for client-server communication. The use of instances enables multiple pipe clients to use the same named pipe simultaneously.
Any process can access named pipes, subject to security checks, making named pipes an easy form of communication between related or unrelated processes. Named pipes can be used to provide communication between processes on the same computer or between processes on different computers across a network.
Any process can act as both a server and a client, making peer-to-peer communication possible. As used here, the term pipe server refers to a process that creates a named pipe, and the term pipe client refers to a process that connects to an instance of a named pipe.
// The main loop creates an instance of the named pipe and
// then waits for a client to connect to it. When the client
// with that client, and the loop is repeated.
// Wait for the client to connect; if it succeeds, // 클라이언트를 연결을 기다린다.
// the function returns a nonzero value. If the function returns // 접속이 될 경우 0 아닌 값이 리턴 되며
// The client could not connect, so close the pipe.
// The thread's parameter is a handle to a pipe instance.
// Read client requests from the pipe.
// Write the reply to the pipe.
// Flush the pipe to allow the client to read the pipe's contents
// before disconnecting. Then disconnect the pipe, and close the
// Break if the pipe handle is valid.
// Exit if an error other than ERROR_PIPE_BUSY occurs.
// The pipe connected; change to message-read mode.
// Send a message to the pipe server.
// Read from the pipe.
- PyUnit . . . . 6 matches
widget = Widget("The widget")
self.widget = Widget("The widget")
self.widget = Widget ("The widget")
self.widget = Widget ("The widget")
suite1 = module1.TheTestSuite ()
suite2 = module2.TheTestSuite ()
- TheTrip/황재선 . . . . 6 matches
=== TheTrip ===
==== {{{~cpp TheTrip.java}}} ====
* TODO To change the template for this generated file go to
public class TheTrip {
TheTrip trip = new TheTrip();
TheTrip
- ZP도서관 . . . . 6 matches
|| Swing || Matthew Robinson, Pavel Vorobiev || Manning || ["혀뉘"] || 원서 ||
|| The C Programming Language 2nd Ed. || Kernighan, Ritchie || Prentice Hall || ["zennith"] || 원서 ||
|| The Standard ANSI C Library || . || . || ["혀뉘"],["nautes"]|| 원서 ||
|| Understanding The Linux || Bovet&Cesati ||.|| ["fnwinter"] || 원서(비쌈)||
|| The Blue Day Book || 브래들리 트레버 그리브 || 물푸 || 교양 ||
|| C언어 프로그래밍(원서명: The C Programming Language) || Brian W.Kernighan, Dennis M.Ritchie || Prentice-Hall || 도서관 소장(대영사 번역판본) || 프로그래밍언어 ||
|| The Art of Assembly 2nd Edition || Randall Hyde || Not printed yet || http://webster.cs.ucr.edu/ || 프로그래밍언어 ||
- [Lovely]boy^_^/영작교정 . . . . 6 matches
* [[HTML(<STRIKE>)]] He is appointed a most prestigious duty in the University. [[HTML(</STRIKE>)]]
* He was appointed to the most prestigious duty in the University.
* Do you foresee some problems in the new system?
* The detective uncovered so many new proofs.
* [[HTML(<STRIKE>)]] The train conveied us to arrival point. [[HTML(</STRIKE>)]]
* The train conveyed us to the arrival point.
* [[HTML(<STRIKE>)]] We must curb the far right's effect power.[[HTML(</STRIKE>)]]
* We must curb the far right's power.
* [[HTML(<STRIKE>)]] He will terminate the argument at there.[[HTML(</STRIKE>)]]
* He will terminate the argument there.
* It is refreshing to meet with a man who has the same thingking.
* I am reluctant in getting involved in the event.
* [[HTML(<STRIKE>)]] Childs were very suprised that sound so they screamed.[[HTML(</STRIKE>)]]
* Children were very suprised at that sound so they screamed.
* [[HTML(<STRIKE>)]] The prisoner's action shows that why he is a danger to sociery. [[HTML(</STRIKE>)]]
* The prisoner's action shows why he is a danger to society.
* I tried desperately to prevent the disaster.
* [[HTML(<STRIKE>)]] The Iraq backed off becauseit was enforced by air strikes.[[HTML(</STRIKE>)]]
- 알고리즘3주숙제 . . . . 6 matches
from [http://www.csc.liv.ac.uk/~ped/teachadmin/algor/d_and_c.html The university of liverpool of Computer Science Department]
Consider the following problem: one has a directory containing a set of names and a telephone number associated with each name.
The directory is sorted by alphabetical order of names. It contains n entries which are stored in 2 arrays:
Given a name and the value n the problem is to find the number associated with the name.
A set of n points in the plane.
The distance between the two points that are closest.
Note: The distance DELTA( i, j ) between p(i) and p(j) is defined by the expression:
The (2n)-digit decimal representation of the product x*y = z
Note: The algorithm below works for any number base, e.g. binary, decimal, hexadecimal, etc. We use decimal simply for convenience.
- 지금그때2004 . . . . 6 matches
|| wiki:NowThen2004/패널토의 ||
|| wiki:NowThen2004/OST종합 = wiki:NowThen2004/복수전공 + wiki:NowThen2004/시간관리 + ? ||
wiki:NowThen2004/지금그때2004 에서 활동을 정리하세요.
wiki:NowThen2004/지금그때2004/후기 에서 후기를 기록해 주세요.
Berkeley Visionaries Prognosticate About the Future http://netshow01.eecs.berkeley.edu/CS-day-004/Berkeley_Visionaries.wmv 이걸 보면 대충 감이 올겁니다. 이 동영상의 경우 뛰어난 패널진에 비해 진행자가 그리 좋은 질문을 하지 못해서 아쉽기는 합니다. 좋은 질문을 하려면 서점이나 도서관에서 [질문의 힘]이라는 책을 읽어보세요. 그리고 04학번 눈높이의 질문에 대한 고학번들의 생각을 들어보는 것도 중요하지만 04학번이 전혀 생각 못하는 질문을 대신 물어주는 것도 중요합니다. 고객과 요구사항을 뽑는 것과 비슷할 수 있겠죠. "그들이 원하는 것"은 물론 "그들이 필요로 하는 것"(주로, 나중에 그들이 원할만한 것)을 이야기해야 하니까요 -- 또 종종 그들은 자신이 뭘 원하는지 모르는 경우도 많습니다.
- ASXMetafile . . . . 5 matches
* <Abstract>: Provides a brief description of the media file.
* <Title>: Title of the media file.
* <Author>: The author's name .
* <MoreInfo href = "path of the source" / >: Adds hyperlinks to the Windows Media Player interface in order to provide additional resources on the content.
* <Duration value = "00:00:00">: Sets the value attribute for the length of time a streaming media file is to be played.
* <Logo href = "path of the logo source" Style = "a style" / >: Adds custom graphics to the Windows Media player by choosing either a watermark or icon style. The image formats that Windows Media Player supports are GIF, BMP, and JPEG.
o MARK: The logo appears in the lower right corner of the video area while Windows Media Player is connecting to a server and opening a piece of content.
o ICON: The logo appears as an icon on the display panel, next to the title of the show or clip.
* <Banner href = "path of the banner source">: Places a banner (82 pixels × 30 pixels) image at the bottom of the video display area.
* <Ref href = "path of the source" / >: Specifies a URL for a content stream.
* How to define the path of source:
o ASX files, on the other hand, are small text files that can always sit on an HTTP server. When the browser interprets the ASX file, it access the streaming media file that is specified inside the ASX file, from the proper HTTP, mms, or file server.
* ?sami="path of the source": Defines the path of a SAMI caption file within the <ref href> tag for media source.
<Abstract>: This text will show up as a Tooltip and in the Properties dialog box
<Title> Global title of the show </Title>
<Author> The name of the author </Author>
<Abstract> This is the description for this clip. </Abstract>
=== Other Resources ===
- DPSCChapter2 . . . . 5 matches
Before launching into our descriptions of specific design patterns, we present a case study of sorts, involving multiple patterns. In the Design Pattern preface, the Gang of Four speak about moving from a "Huh?" to an "Aha!" experience with regard to understanding design patterns. We present here a little drama portraying such a transition. It consists of three vignettes: three days in the life of two Smalltalk programmers who work for MegaCorp Insurance Company. We are listening in on conversations between Don (an object newbie, but an experienced business analyst) and Jane (an object and pattern expert). Don comes to Jane with his design problems, and they solve them together. Although the characters are fictitious, the designs are real and have all been part of actual systems written in Smalltalk. Our goal is to demonstrate how, by careful analysis, design patterns can help derive solutions to real-world problems.
Jane : That's all right. I don't mind at all. What's the problem?
Don : It's this claims-processing workflow system I've been asked to design. I just can't see how the objects will work together. I think I've found the basic objects in the system, but I don't understand how to make sense from their behaviors.
Don : Here, let me show you the section of the requirements document I've got the problem with:
1. Data Entry. This consists of various systems that receive health claims from a variety of different sources. All are logged by assigning a unique identifier. Paper claims and supporting via OCR (optical character recognition) to capture the data associated with each form field.
2. Validation. The scanned and entered forms are validated to ensure that the fields are consistent and completely filled in. Incomplete or improperly filled-in forms are rejected by the system and are sent back to the claimant for resubmittal.
3. Provider/Plan Match. An automated process attempts to mach the plan (the contract unser which the claim is being paid) and the health care provider (e.g., the doctor) identified on the claim with the providers with which the overall claim processing organization has a contract. If there is no exact match, the program identifies the most likely matches based on soundex technology (an algorithm for finding similar-sounding words). The system displays prospective matches to knowledge workers in order of the likeinhood of the match, who then identify the correct provider.
4. Automatic Adjudication. The system determines whether a claim can be paid and how much to pay if and only if there are no inconsistencies between key data items associated with the claim. If there are inconsistencies, the system "pends" the claim for processing by the appropriate claims adjudicator.
5. Adjudication of Pended Claims. The adjudicator can access the system for a claim history or a representation of the original claim. The adjudicator either approves the claim for payment, specifying the proper amount to pay, or generates correspondence denying the claim.
- EffectiveC++ . . . . 5 matches
* ''생성자 및 소멸자와 적절히 상호동작하기 때문에. they are clearly the superior choice.''
=== Item 5: Use the same form in corresponding uses of new and delete ===
* ''Initialization of the pointer in each of the constructors. If no memory is to be allocated to the pointer in a particular constructor, the pointer should be initialized to 0 (i.e., the null pointer). - 생성자 각각에서 포인터 초기화''
* ''Deletion of the existing memory and assignment of new memory in the assignment operator. - 포인터 멤버에 다시 메모리를 할당할 경우 기존의 메모리 해제와 새로운 메모리의 할당''
* ''Deletion of the pointer in the destructor. - 소멸자에서 포인터 삭제''
// fails, call the global
// (if there is one)
X::set_new_handler(0); // set the X-specific
// immediately. (There is
size = 1; // by treating them as
if (the allocation was successful)
return (a pointer to the memory);
if (rawMemory == 0) return; // do nothing if the null
// deallocate the memory pointed to by rawMemory;
return; // delete handle the request
// deallocate the memory pointed to by rawMemory;
=== Item 9: Avoid hiding the "normal" form of new ===
String s = "The Truth Is Out There";
=== Item 13: List members in an initialization list in the order in which they are declared ===
The C++ language standard is unusually clear on this topic. 베이스 클래스에 대한 포인터를 사용해서 계승된 클래스를 [[BR]]
- FeedBack . . . . 5 matches
'''The American Heritage(r) Dictionary of the English Language, Fourth Edition'''[[BR]]
a. The return of a portion of the output of a process or system to the input, especially when used to maintain performance or to control a system or process.
* The portion of the output so returned.
* Sound created when a transducer such as a microphone or electric guitar picks up sound from a speaker connected to an amplifier and regenerates it back through the amplifier.
*. The return of information about the result of a process or activity; an evaluative response: asked the students for feedback on the new curriculum.
*. The process by which a system, often biological or ecological, is modulated, controlled, or changed by the product, output, or response it produces.
- MoinMoinNotBugs . . . . 5 matches
The main, rectangular background, control and data area of an application. <p></ul>
A temporary, pop-up window created by the application, where the user can
'''The HTML being produced is invalid:''' ''Error: start tag for "LI" omitted, but its declaration does not permit this.'' That is, UL on its lonesome isn't permitted: it must contain LI elements.
Also worth noting that ''Error: Missing DOCTYPE declaration at start of document'' comes up at the HEAD tag; and ''Error: document type does not allow element "FONT" here'' for a FONT tag that's being used inside a PRE element.
''Indeed the <ul> should be a <dl> or so for pure indents. I'll add HTML conformity checking as a todo.''
Please note also that to be "identical," the second P tag should ''follow'' the /UL, not precede it. The implication as-is is that the P belongs to the UL block, when it doesn't. It may be worth using closing paragraph tags, as an aide to future XHTML compatibility, and to make paragraph enclosures wholly explicit.
This is not an Opera bug. The HTML is invalid. '''The blocks are overlapping, when they are not allowed to:''' P UL P /UL UL P /UL is not a sensible code sequence. (It should be P UL /UL P UL /UL P... giddyupgiddyup?)
I suspect this problem is pervasive, and I also suspect that the solution is almost moot; probably a one-off counting problem, or a mis-ordered "case" sort of sequence. If the /UL closing tag were to precede the P opening tag, all would be well.
Hey! That ToC thing happening at the top of this page is *really* cool!
''This issue will be resolved in the course of XML formatting -- after all, XML is much more strict than any browser.''
- RSS . . . . 5 matches
The technology behind RSS allows you to subscribe to websites that have provided RSS feeds, these are typically sites that change or add content regularly. To use this technology you need to set up some type of aggregation service. Think of this aggregation service as your personal mailbox. You then have to subscribe to the sites that you want to get updates on. Unlike typical subscriptions to pulp-based newspapers and magazines, your RSS subscriptions are free, but they typically only give you a line or two of each article or post along with a link to the full article or post.
The RSS formats provide web content or summaries of web content together with links to the full versions of the content, and other meta-data. This information is delivered as an XML file called RSS feed, webfeed, RSS stream, or RSS channel. In addition to facilitating syndication, RSS allows a website's frequent readers to track updates on the site using a news aggregator.
Before RSS, several similar formats already existed for syndication, but none achieved widespread popularity or are still in common use today, and most were envisioned to work only with a single service. For example, in 1997 Microsoft created Channel Definition Format for the Active Channel feature of Internet Explorer 4.0. Another was created by Dave Winer of UserLand Software. He had designed his own XML syndication format for use on his Scripting News weblog, which was also introduced in 1997 [1].
RDF Site Summary, the first version of RSS, was created by Dan Libby of Netscape in March 1999 for use on the My Netscape portal. This version became known as RSS 0.9. In July 1999 Netscape produced a prototype, tentatively named RSS 0.91, RSS standing for Rich Site Summary, this was a compromise with their customers who argued the complexity introduced (as XML namespaces) was unnecessary. This they considered a interim measure, with Libby suggesting an RSS 1.0-like format through the so-called Futures Document [2].
Soon afterwards, Netscape lost interest in RSS, leaving the format without an owner, just as it was becoming widely used. A working group and mailing list, RSS-DEV, was set up by various users to continue its development. At the same time, Winer posted a modified version of the RSS 0.91 specification - it was already in use in their products. Since neither side had any official claim on the name or the format, arguments raged whenever either side claimed RSS as its own, creating what became known as the RSS fork. [3]
The RSS-DEV group went on to produce RSS 1.0 in December 2000. Like RSS 0.9 (but not 0.91) this was based on the RDF specifications, but was more modular, with many of the terms coming from standard metadata vocabularies such as Dublin Core. Nineteen days later, Winer released RSS 0.92, a minor and (mostly) compatible revision of RSS 0.91. The next two years saw various minor revisions of the Userland branch of RSS, and its adoption by major media organizations, including The New York Times.
Winer published RSS 2.0 in 2002, emphasizing "Really Simple Syndication" as the meaning of the three-letter abbreviation. RSS 2.0 remained largely compatible with RSS 0.92, and added the ability to add extension elements in their own namespaces. In 2003, Winer and Userland Software assigned ownership of the RSS 2.0 specification to his then workplace, Harvard's Berkman Center for the Internet & Society.
- RelationalDatabaseManagementSystem . . . . 5 matches
A relational database management system (RDBMS) is a database management system (DBMS) that is based on the relational model as introduced by Edgar F. Codd.
The fundamental assumption of the relational model is that all data are represented as mathematical relations, i.e., a subset of the Cartesian product of n sets. In the mathematical model, reasoning about such data is done in two-valued predicate logic (that is, without NULLs), meaning there are two possible evaluations for each proposition: either true or false. Data are operated upon by means of a relational calculus and algebra.
The relational data model permits the designer to create a consistent logical model of information, to be refined through database normalization. The access plans and other implementation and operation details are handled by the DBMS engine, and should not be reflected in the logical model. This contrasts with common practice for SQL DBMSs in which performance tuning often requires changes to the logical model.
The basic relational building block is the domain, or data type. A tuple is an ordered multiset of attributes, which are ordered pairs of domain and value. A relvar (relation variable) is a set of ordered pairs of domain and name, which serves as the header for a relation. A relation is a set of tuples. Although these relational concepts are mathematically defined, they map loosely to traditional database concepts. A table is an accepted visual representation of a relation; a tuple is similar to the concept of row.
The basic principle of the relational model is the Information Principle: all information is represented by data values in relations. Thus, the relvars are not related to each other at design time: rather, designers use the same domain in several relvars, and if one attribute is dependent on another, this dependency is enforced through referential integrity.
- User Stories . . . . 5 matches
User stories serve the same purpose as use cases but are not the same. They are used to create time estimates for the release planning meeting. They are also used instead of a large requirements document. User Stories are written by the customers as things that the system needs to do for them. They are similar to usage scenarios, except that they are not limited to describing a user interface. They are in the format of about three sentences of text written by the customer in the customers terminology without techno-syntax.
User stories also drive the creation of the acceptance tests. One or more automated acceptance tests must be created to verify the user story has been correctly implemented.
One of the biggest misunderstandings with user stories is how they differ from traditional requirements specifications. The biggest
difference is in the level of detail. User stories should only provide enough detail to make a reasonably low risk estimate of how long the story will take to implement. When the time comes to implement the story developers will go to the customer and receive a detailed description of the requirements face to face.
Developers estimate how long the stories might take to implement. Each story will get a 1, 2 or 3 week estimate in "ideal development time". This ideal development time is how long it would take to implement the story in code if there were no distractions, no other assignments, and you knew exactly what to do. Longer than 3 weeks means you need to break the story down further. Less than 1 week and you are at too detailed a level, combine some stories. About 80 user stories plus or minus 20 is a perfect number to create a release plan during release planning.
Another difference between stories and a requirements document is a focus on user needs. You should try to avoid details of specific technology, data base layout, and algorithms. You should try to keep stories focused on user needs and benefits as opposed to specifying GUI layouts.
- WikiSlide . . . . 5 matches
* '''Simple''' - ''Content over Form'' (content counts, not the super-pretty appearance)
== The First Steps ==
* SiteNavigation: A list of the different indices of the Wiki
* FindPage: Searching the Wiki by various methods
* TitleIndex: A list of all pages in the Wiki
* WordIndex: A list of all words in page titles (i.e. a list of keywords/concepts in the Wiki)
== Using the Editor ==
To edit a page, just click on [[Icon(edit)]] or on the link "`EditText`" at the end of the page. A form will appear enabling you to change text and save it again. A backup copy of the previous page's content is made each time.
You can check the appearance of the page without saving it by using the preview function - ''without'' creating an entry on RecentChanges; additionally there will be an intermediate save of the page content, if you have created a homepage ([[Icon(home)]] is visible).
<!> After editing pages, please leave the edit form by "`Save Changes`" since otherwise your edits will be lost!
== Tips on the Editor ==
"`Check spelling`" examines the text for unknown words.
Within the editor, the usual hotkeys work:
(!) If you discover an interesting format somewhere, just use the "raw" icon to find out how it was done.
(!) In UserPreferences, you can set up the editor to open when you double click a page.
(!) You can subscribe to pages to get a mail on every change of that page. Just click on the envelope [[Icon(subscribe)]] at top right of the page.
To add special formatting to text, just enclose it within markup. There are special notations which are automatically recognized as internal or external links or as embedded pictures.
Headlines are placed on a line of their own and surrounded by one to five equal signs denoting the level of the headline. The headline is in between the equal signs, separated by a space. Example: [[BR]] `== Second Level ==`
(!) A common error is to insert an additional blank after the ending equal signs!
Paragraphs are lines separated by empty lines or other block structures. This means
- [Lovely]boy^_^/EnglishGrammer/PresentPerfectAndPast . . . . 5 matches
The present perfect : have/has + past participle (have/has + 과거분사)
B. When we use the peresent perfect, there is a connection with now. The action in the past has a result now.
We often use the present perfect to give new information or to announce a recent happening.(새로운 정보나, 최근의 사건을 보도할때도 쓰인답니다.)
ex1) The road is closed. There's been an accident.
ex2) (from the news) The police have arrested two men in connection with the robbery.
We also use the simple past some situations.( ... 어쩌라는 거야..ㅠ.ㅠ 쓸거면 확실하게 한군데만 쓰던지..;;)
C. We ofte use the present perfect with just, already, and yet. You can also use the simple past.
Yet = until now. It shows that the speaker is expecting something to happen. Use yet only in questions and negative sentences.
ex2) I wrote the letter, but I haven't mailed it yet. (역시 simple past 가능)
D. Don't use the present perfect when you talk about a finished time.(이미 끝난일 가지고 현재 완료 쓰지말란다. 당연한 얘기)
A. When we talk about a period of time that continues from the past until now, we use the present perfect.(앞에 나온말)
ex) I've never been to China. Have you been there?
Here are more examples of speakers talking about a period that continues until now(recently/ in the last few days/ so far/ since breakfast, etc.)
B. We use the present perfect with today/ this morning/ this evening, etc. when these periods are not finished at the time of speaking.(그렇대요;;)
C. We say, "It's the first time something has happened."(present perfect) (이건 뭐하자는 건지..;;)
ex) Sarah has lost her passport again. It's the second time this has happened.(not happens)
- [Lovely]boy^_^/EnglishGrammer/ReportedSpeech . . . . 5 matches
A. You want to tell somebody else what Tom said. There are two ways of doing this :
B. When we use reported speech, the main verb of the sentence is usually past. The rest of the sentence is usually past, too :
C. The simple past can usually stay the same in reported speech, or you can change it to the past perfect.
A. It is not always necessary yo change the verb when you use reported speech. If you report something and it is still true, you do not need to change the verb.
reported : Tom said that New York is more exciting than London. (New York is stlll more exciting. The situation hasn't changed.)
Is is also correct to change the verb into the past.(--;)
But you must use a past form when there is a difference between what was said and what is really true.(--; 결국은 과거 쓰란 얘기자나)
Otherwise use say ( Say somebody(X) )
We also use the infinitive(to do/ to stay, etc...) in reported speech, especially with tell and ask(for orders and requests)
ex1) direct : "Stay in bed for a few days," the doctor said to me.
reported : The doctor told me to stay in bed for a few days.
- 경시대회준비반 . . . . 5 matches
|| [ThePriestMathematician] ||
|| [TheGrandDinner] ||
|| [TheKnightsOfTheRoundTable] ||
|| [TheLargestSmallestBox] ||
- ACM_ICPC . . . . 4 matches
* [http://icpckorea.org/2019/regional/scoreboard/ 2019년 스탠딩] - TheOathOfThePeachGarden Rank 81(CAU - Rank 52, including Abroad team)
* team 'TheOathOfThePeachGarden' 본선 81위(학교 순위 52위) : [한재현], [김영기], [오준석]
- BookShelf/Past . . . . 4 matches
1. [TheElementsOfProgrammingStyle] - 20051018
1. [TheElementsOfStyle] - 20060304
1. [IntroductionToTheTheoryOfComputation]
- DoItAgainToLearn . . . . 4 matches
제가 개인적으로 존경하는 전산학자 Robert W. Floyd는 1978년도 튜링상 강연 ''[http://portal.acm.org/ft_gateway.cfm?id=359140&type=pdf&coll=GUIDE&dl=GUIDE&CFID=35891778&CFTOKEN=41807314 The Paradigms of Programming]''(일독을 초강력 추천)에서 다음과 같은 말을 합니다. --김창준
Seminar:TheParadigmsOfProgramming DeadLink? - 저는 잘나오는데요. 네임서버 설정이 잘못된건 아니신지.. - [아무개]
In my own experience of designing difficult algorithms, I find a certain technique most helpfult in expanding my own capabilities. After solving a challenging problem, I solve it again from scratch, retracing only the ''insight'' of the earlier solution. I repeat this until the solution is as clear and direct as I can hope for. Then I look for a general rule for attacking similar problems, that ''would'' have led me to approach the given problem in the most efficient way the first time. Often, such a rule is of permanent value. ...... The rules of Fortran can be learned within a few hours; the associated paradigms take much longer, both to learn and to unlearn. --Robert W. Floyd
Even fairly good students, when they have obtained the solution of the problem and written down neatly the argument, shut their books and look for something else. Doing so, they miss an important and instructive phase of the work. ... A good teacher should understand and impress on his students the view that no problem whatever is completely exhausted. --George Polya
- Fmt . . . . 4 matches
The unix fmt program reads lines of text, combining
72 characters long as possible. The rules for combining and breaking
1. A new line may be started anywhere there is a space in the input.
If a new line is started, there will be no trailing blanks at the
end of the previous line or at the beginning of the new line.
2. A line break in the input may be eliminated in the output, provided
it is not followed by a space or another line break. If a line
The unix fmt program reads lines of text, combining and breaking lines
72 characters long as possible. The rules for combining and breaking
1. A new line may be started anywhere there is a space in the input.
If a new line is started, there will be no trailing blanks at the end of
the previous line or at the beginning of the new line.
2. A line break in the input may be eliminated in the output,
provided it is not followed by a space or another line break. If a line
- MoinMoinBugs . . . . 4 matches
Tables don't work right if there are trailing spaces.
''Yes, by design, just like headings don't accept trailing spaces. In the case of headings, it is important because "= x =" is somewhat ambiguous. For tables, the restriction could be removed, though.''
And as a fun sidenote, the UserPreferences cookie doesn't seem to work. The cookie is in my ~/.netscape/cookies file still. My EfnetCeeWiki and XmlWiki cookies are duplicated!? It is kind of like the bug you found when I, ChristianSunesson, tried this feature with netscape just after you deployed it.
Hehe, and my changes are not logged to the RecentChanges database, I'll hope you find these changes this year. :) BUG BUG BUG!
''Well, Netscape suxx. I send the cookies with the CGI'S path, w/o a hostname, which makes it unique enough. Apparently not for netscape. I'll look into adding the domain, too.''
Hmmm...I use NetScape, MsIe, MoZilla and Galeon. I haven't had a problem but some other's using MoinMoin 0.8 have intermittently lost cookies. Any ideas?
* Solve the problem of the Windows filesystem handling a WikiName case-indifferent (i.e. map all deriatives of an existing page to that page).
* Check whether the passed WikiName is valid when editing pages (so no pages with an invalid WikiName can be created); this could also partly solve the case-insensitive filename problem (do not save pages with a name only differing in case)
* InterWiki links should either display the destination Wiki name or generate the A tag with a TITLE attribute so that (at least in IE) the full destination is displayed by floating the cursor over the link. At the moment, it's too hard to figure out where the link goes. With that many InterWiki destinations recognised, we can't expect everyone to be able to recognise the URL.
* Hover over the interwiki icon and you'll already get a tooltip, I'll look into the title attribute stuff.
* RecentChanges can tell you if something is updated, or offer you a view of the diff, but not both at the same time.
* If you want the ''latest'' diff for an updated page, click on "updated" and then on the diff icon (colored glasses) at the top.
* That's what I'm doing for the time being, but by the same rationale you don't need to offer diffs from RecentChanges at all.
* The intent is to not clutter RecentChanges with functions not normally used. I do not see a reason you want the lastest diff when you have the much better diff to your last visit.
* It'd be really nice if the diff was between now and the most recent version saved before your timestamp (or, failing that, the oldest version available). That way, diff is "show me what happened since I was last here", not just "show me what the last edit was."
* Hmmm, that '''is''' so. :) Take a look at the message at the top of the diff page after clicking on "updated", it'll often show text like "spanning x versions". You need the current CVS version for that, though.
* Oh, okay. Is this MoinMoin CVS enabled? Reason being: I did a few updates of a page, and was only being shown the last one. I'll try that some more and get back to you.
* Not CVS, but versioning all the same. I mean you have to get the most recent code from the SourceForge CVS archive for some features to work, if you test on a ''local'' wiki.
With 0.3, TitleIndex is broken if first letter of Japanese WikiName is multibyte character. This patch works well for me but need to be fixed for other charsets.
''Differently broken. :) I think we can live with the current situation, the worst edges are removed (before, chopping the first byte out of an unicode string lead to broken HTML markup!). It will stay that way until I buy the [wiki:ISBN:0201616335 Unicode 3.0] book.''
- MoniWikiPo . . . . 4 matches
msgid "Upload new Attachment \"%s\" on the \"%s\""
msgid "<b>horizontal rule</b> ---- is not applied on the blog mode."
msgid "Difference between yours and the current"
msgid "Difference between r%s and the current"
msgid "There are no changes found"
msgid "Update with these Keywords"
msgid "These pages share a similar word..."
msgid "These pages share an initial or final title word..."
msgid "Others"
"your email address in the UserPreferences."
msgid "Please contact the system administrator for htaccess based logins."
"If you want to subscribe this page please contact the WikiMaster to activate "
"the e-mail notification"
"email address in the UserPreferences."
#: ../plugin/theme.php:23
msgid "Theme cleared. Goto UserPreferences."
#: ../plugin/theme.php:63
msgid "Please select a theme properly."
msgid "Send TrackBack Ping to another Blog:"
msgid "not acceptable character found in the password!"
- MoniWikiTheme . . . . 4 matches
=== 임의의 Theme 설정 및 지원 ===
http://chemie.skku.ac.kr/wiki/wiki.php/TwinPages?action=theme&theme=kz
http://chemie.skku.ac.kr/wiki/wiki.php/TwinPages?action=theme&theme=blog
http://chemie.skku.ac.kr/wiki/wiki.php/TwinPages?action=theme&theme=samplehome
{{{[[Theme]]}}}매크로를 이용하여 지원 가능한 Theme목록을 볼 수 있다.
[[Theme]]
- MoreEffectiveC++/Miscellany . . . . 4 matches
== Item 32: Program in the Future tense ==
원문:As software developers, we may not know much, but we do know that things will change. We don't necessarily know what will change, how the changes will be brought about, when the changes will occur, or why they will take place, but we do know this: things will change.
좋은 소프트웨어는 변화를 잘 수용한다. 새로운 기능을 수용하고, 새로운 플랫폼에 잘 적용되고, 새로운 요구를 잘 받아 들이며, 새로운 입력을 잘 잡는다. 이런 소프트웨어는 유연하고, 강하고, 신뢰성있고, 돌발 상황(사고)에 의해 죽지 않는다. 이런 소프트웨어는 미래에 필요한 요소를 예상하고, 오늘날 구현시에 포함시키는 프로그래머들에 의해서 디자인된다. 이러한 종류의 소프트웨어는-우아하게 변화하는 소프트웨어- ''program in the future tens''(매래의 프로그램:이하 영문 직접 사용)을 감안하는 사람들이 작성한다.
"변화한다.", 험난한 소프트웨어의 발전에 잘 견디는 클래스를 작성하라. (원문:Given that things will change, writeclasses that can withstand the rough-and-tumble world of software evolution.) "demand-paged"의 가상 함수를 피하라. 다른 이가 만들어 놓지 않으면, 너도 만들 방법이 없는 그런 경우를 피하라.(모호, 원문:Avoid "demand-paged" virtual functions, whereby you make no functions virtual unless somebody comes along and demands that you do it) 대신에 함수의 ''meaning''을 결정하고, 유도된 클래스에서 새롭게 정의할 것인지 판단하라. 그렇게 되면, 가상(virtual)으로 선언해라, 어떤 이라도 재정의 못할지라도 말이다. 그렇지 않다면, 비가상(nonvirtual)으로 선언해라, 그리고 차후에 그것을 바꾸어라 왜냐하면 그것은 다른사람을 편하게 하기 때문이다.;전체 클래스의 목적에서 변화를 유지하는지 확신을 해라.
== Item 34: Understand how to combine C++ and C in the same program ==
== Item 35: Familiarize yourself with °the language standard. ==
출반된 1990년 이후, ''The Annotated C++ Reference Manual''은 프로그래머들에게 C++에 정의에 참고문서가 되어 왔다. ARM기 나온 이후에 몇년간 ''ISO/ANSI committe standardizing the language'' 는 크고 작게 변해 왔다. 이제 C++의 참고 문서로 ARM은 더 이상 만족될수 없다.
''The Design and Evolution of C++''에 거의 모든 변화가 언급되어 있다. 현재 C++ 참고서(1994년 이후에 쓰여진것들)도 이 내용을 포함하고 있을 것이다. (만약 당신이 찾지 못하면 그거 버려라) 덧붙여 ''More Effective C++''(이책이다.)는 이러한 새로운 부분에 관한 대부분의 사용 방법이 언급되어 있다. 만약 당신이 이것에 리스트를 알고 싶다면, 이 책의 인덱스를 살펴보아라.
표준 라이브러리에 일어나는 것들에 대한것에서 C++의 정확한 규정의 변화가 있다. 개다가 표준 라이브러리의 개선은 언어의 표준 만큼이나 알려지지 않는다. 예를 들어서 ''The Design and Evolution of C++'' 거의 표준 라이브러리에 관한 언급이 거의 없다. 그 책의 라이브러리에 과한 논의라면 때때로 있는 데이터의 출력이다. 왜냐하면, 라이브러리는 1994년에 실질적으로 변화되었기 때문이다.
Fortunately, this syntactic administrivia is automatically taken care of when you #include the appropriate headers.
=== The Standard Template Library : 표준 템플릿 라이브러리 ===
int *firstFive = find(values, // search the range
5); // for the value 5
int *firstValue = find(values+10, // search the range
age); // for the value in age
그렇지만 이 템플릿은 좋다, 개다가 일반화 까지 할수 있다. 시작과 끝에 연산자를 보아라. 사용된 연산자는 다르다는 것, dereferencing, prefix증가(Item 6참고), 복사(함수의 반환 값을 위해서? Item 9참고)를 위해서 쓰였다. 모든 연산자는 우리가 overload할수 있다. (DeleteMe 모호) 그래서 왜 포인터 사용하여 찾기를 제한하는가? 왜 허용하지 않는가 포인터 추가에서 이러한 연산자를 지원하기 위한 어떤 객체도 허용할수 없을까? (hy not allow any object that supports these operations to be used in addition to pointers?) 그래서 이렇게 하는것은 포인터 연산자의 built-in 의미를 찾기함수(find function)을 자유롭게 할것이다. 예를 들어서 우리는 리스트 에서 다음 리스트로의 이동을 해주는 prefix increment 연산자의 linked list객체와 비슷한 pointer를 정의할수 있다.
- NSIS/예제2 . . . . 4 matches
ComponentText "This will install the less simple example2 on your computer. Select which optional things you want installed."
; The text to prompt the user to enter a directory
; Set output path to the installation directory.
; The text to prompt the user to enter a directory
; It will install notepad.exe into a directory that the user selects,
ComponentText "This will install the less simple example2 on your computer. Select which optional things you want installed."
; The text to prompt the user to enter a directory
; The stuff to install
; Set output path to the installation directory.
ComponentText: "This will install the less simple example2 on your computer. Select which optional things you want installed." "" ""
- Robbery/조현태 . . . . 4 matches
이전의 경우 도둑이 특정시간에 존재할 수 없는경우 "The robber has escaped." 를 출력했으나, 지금은 모든 시간의 움직임을 고려해서 존재하지 않으면 "The robber has escaped."를 출력하도록 수정하였다. (사실 소스상에선 그다지 바뀐건 없다..^^)
cout << "The robber has escaped." << endl;
cout << "Time step " << i + 1 << ": The robber has been at " << g_maxPoints[0][i].x + 1 << "," << g_maxPoints[0][i].y + 1 << "." << endl;
- TheGrandDinner . . . . 4 matches
=== About [TheGrandDinner] ===
|| [조현태] || C++ || ??? || [TheGrandDinner/조현태] ||
|| [김상섭] || C++ || 많이..ㅡㅜ || [TheGrandDinner/김상섭] ||
|| [하기웅] || C++ || 생각은 많이. 코딩 시작해서는 1시간 || [TheGrandDinner/하기웅] ||
- TheKnightsOfTheRoundTable/문보창 . . . . 4 matches
// 10195 - The Knights of the Round Table
printf("The radius of the round table is: %.3f\n", r);
[TheKnightsOfTheRoundTable]
- TheKnightsOfTheRoundTable/허준수 . . . . 4 matches
cout << "The radius of the round table is: 0.000" <<endl;
cout << "The radius of the round table is: "
[TheKnightsOfTheRoundTable]
- ThePriestMathematician . . . . 4 matches
=== About [ThePriestMathematician] ===
|| 김상섭 || C++ || . || [ThePriestMathematician/김상섭] ||
|| 문보창 || C++ || 1차(실패), 2차(5시간) || [ThePriestMathematician/문보창] ||
|| 하기웅 || C++ || 2시간 30분 || [ThePriestMathematician/하기웅] ||
- eXtensibleStylesheetLanguageTransformations . . . . 4 matches
Extensible Stylesheet Language Transformations, or XSLT, is an XML-based language used for the transformation of XML documents. The original document is not changed; rather, a new document is created based on the content of an existing one. The new document may be serialized (output) by the processor in standard XML syntax or in another format, such as HTML or plain text. XSLT is most often used to convert data between different XML schemas or to convert XML data into web pages or PDF documents.
XSLT was produced as a result of the Extensible Stylesheet Language (XSL) development effort within W3C during 1998–1999, which also produced XSL Formatting Objects (XSL-FO) and the XML Path Language, XPath. The editor of the first version (and in effect the chief designer of the language) was James Clark. The version most widely used today is XSLT 1.0, which was published as a Recommendation by the W3C on 16 November 1999. A greatly expanded version 2.0, under the editorship of Michael Kay, reached the status of a Candidate Recommendation from W3C on 3 November 2005.
- radiohead4us/SQLPractice . . . . 4 matches
1. Find the names of all branches in the loan relation. (4.2.1 The select Clause)
2. Find all loan numbers for loans made at the Perryridge branch with loan amounts greater that $1200. (4.2.2 The where Clause)
3. For all customers who have a loan from the bank, find their names, loan numbers and loan amount. (4.2.3 The from Clause)
4. Find the customer names, loan numbers, and loan amounts for all loans at the Perryridge branch. (4.2.3 The from Clause)
5. For all customers who have a loan from the bank, find their names, loan numbers, and loan amount. (4.2.5 Tuple Variables)
6. Find the names of all branches that have assets greater than at least one branch located in Brooklyn. (4.2.5 Tuple Variables)
7. Find the names of all customers whose street address includes the substring 'Main'. (4.2.6 String Operations)
8. Find the average account balance at each branch. (4.4 Aggregate Functions)
9. Find the number of depositors for each branch. (4.4 Aggregate Functions)
10. Find the average balance for all accounts. (4.4 Aggregate Functions)
11. Find the average balance for each customer who lives in Harrison and has at least three accounts. (4.4 Aggregate Functions)
12. Find all customers who have both a loan and an account at the bank. (4.6.1 Set Membership)
13. Find all customers who have both an account and a loan at the Perryridge branch. (4.6.1 Set Membership)
14. Find the names of all branches that have assets greater than those of at least one branch located in Brooklyn. (4.6.2 Set Comparison)
15. Find the branch that has the highest average balance. (4.6.2 Set Comparison)
16. Find all customers who have both an account and a loan at the bank. (4.6.3 Test for Empty Relations)
17. Find all customers who have an account at all the branches located in Brooklyn. (4.6.3 Test for Empty Relations)
18. Find all customers who have at most one account at the Perryridge branch. (4.6.4 Test for the Absence of Duplicate Tuples)
19. Find all customers who have at least two accounts at the Perryridge branch. (4.6.4 Test for the Absence of Duplicate Tuples)
- 기술적인의미에서의ZeroPage . . . . 4 matches
The zero page instructions allow for shorter code and excution times by only feching the
second byte of the instruction and assumming a zero high address byte.
Careful use of the zero page can result in significant increase in code efficient.
The zero page is the memory address page at the absolute beginning of a computer's address space (the lowermost page, covered by the memory address range 0 ... page size?1).
In early computers, including the PDP-8, the zero page had a special fast addressing mode, which facilitated its use for temporary storage of data and compensated for the relative shortage of CPU registers. The PDP-8 had only one register, so zero page addressing was essential.
Possibly unimaginable by computer users after the 1980s, the RAM of a computer used to be faster than or as fast as the CPU during the 1970s. Thus it made sense to have few registers and use the main memory as substitutes. Since each memory location within the zero page of a 16-bit address bus computer may be addressed by a single byte, it was faster, in 8-bit data bus machines, to access such a location rather than a non-zero page one.
For example, the MOS Technology 6502 has only six non-general purpose registers. As a result, it used the zero page extensively. Many instructions are coded differently for zero page and non-zero page addresses:
예를 들자면 the MOS Technology 6502 는 오직 6개의 non-general 목적을 가진 레지스터를 가지고 있었다. 결과적으로 이는 것은 제로페이지라는 개념을 폭넓게 사용하였다. 많은 명령어들이 제로페이지와 제로페이지가 아닌 어드레씽을 위해서 다르게 쓰여졌다.
The above two instructions both do the same thing; they load the value of $00 into the A register. However, the first instruction is only two bytes long and also faster than the second instruction. Unlike today's RISC processors, the 6502's instructions can be from one byte to three bytes long.
상기의 2개의 명령어 모두 동일한 일을 한다; 이것들은 A레지스터에 $00라는 값을 로드한다. 하지만 첫번째 명령어는 단지 2바이트길이 이고 두번째 명령어보다 더욱 빠르다. 오늘날의 RISC 프로세서와 다르게 the 6502의 명령어들은 1바이트에서 부터 3바이트의 길이가 되는 것이 가능하다.
Zero page addressing now has mostly historical significance, since the developments in integrated circuit technology have made adding more registers to a CPU less expensive, and have made CPU operations much faster than RAM accesses. Some computer architectures still reserve the beginning of address space for other purposes, though; for instance, the Intel x86 systems reserve the first 512 words of address space for the interrupt table.
- 데블스캠프2009/목요일/연습문제/MFC/서민관 . . . . 4 matches
// IDM_ABOUTBOX must be in the system command range.
// Set the icon for this dialog. The framework does this automatically
// when the application's main window is not a dialog
return TRUE; // return TRUE unless you set the focus to a control
// If you add a minimize button to your dialog, you will need the code below
// to draw the icon. For MFC applications using the document/view model,
// this is automatically done for you by the framework.
// Draw the icon
// The system calls this to obtain the cursor to display while the user drags
// the minimized window.
// NOTE: the ClassWizard will add member initialization here
// NOTE: the ClassWizard will add DDX and DDV calls here
// IDM_ABOUTBOX must be in the system command range.
// Set the icon for this dialog. The framework does this automatically
// when the application's main window is not a dialog
return TRUE; // return TRUE unless you set the focus to a control
// If you add a minimize button to your dialog, you will need the code below
// to draw the icon. For MFC applications using the document/view model,
// this is automatically done for you by the framework.
// Draw the icon
- 임인택/내손을거친책들 . . . . 4 matches
* The Haskell School of Expression
* IPv6, The New Internet Protocol
* TheElementsOfStyle + TheElementsOfProgrammingStyle
- 1002/Journal . . . . 3 matches
읽기 준비 전 Seminar:ThePsychologyOfComputerProgramming 이 어려울 것이라는 생각이 먼저 들어서, 일단 영어에 익숙해져야겠다는 생각이 들어서 Alice in wonderland 의 chapter 3,4 를 들었다. 단어들이 하나하나 들리는 정도. 아직 전체의 문장이 머릿속으로 만들어지진 않는 것 같다. 단어 단위 받아쓰기는 가능하지만, 문장단위 받아쓰기는 힘든중.
10 (화): Prometheus 리팩토링 (계속진행중. 일주일째 진행중이던가. -_-a)
http://zeropage.org/~reset/zb/data/prometheus_struct0.jpg
7 (토): Prometheus Test Code 추가 대장정
Prometheus 리팩토링중. 기간을 잡지 않고 하니 엄청나게 늘어지는 것 같다. 다시 할일 목록을 구체적으로 잡고 해야겠다.
기존의 AcceptanceTest 들이 작동을 못한다. (Python 에서 정규표현식 이용. 데이터 파싱 & 추출. Prometheus UI 가 바뀌면 다시 바뀜) 전에 구경한 것처럼 XPath 를 이용하는 방법을 궁리해보거나, Prometheus 쪽에서 XML + XSLT 를 이용하는 방법을 궁리했다. 하지만, 그러기엔 현재 Prometheus 의 JSP 부분을 전부 바꾸는데 부담이 크리라 판단, Servlet Controller 중 Service 클래스 부분에 대해 테스트 코드를 붙이는 방법을 생각해 냈다. 하지만, 막상 작성해보고 나니 그 또한 테스트 코드의 크기가 크긴 하다.
ProjectPrometheus Refactoring 궁리하기
그리고, 이전에 ProjectPrometheus 작업할때엔 서블릿 테스팅 방법을 몰랐다. 그래서 지금 ProjectPrometheus 코드를 보면 서블릿 부분에 대해 테스트가 없다. WEB Tier 에 대한 테스팅을 전적으로 AT 에 의존한다. 이번에 기사를 쓸때 마틴 파울러의 글을 인용, "WIMP Application 에 대해서 WIMP 코드를 한줄도 복사하지 않고 Console Application 을 만들수 있어야 한다" 라고 이야기했지만, 이는 WEB 에서도 다를 바가 없다고 생각한다.
2 (월): ProjectPrometheus 소스 리뷰 & 리팩토링. audio book MP3 뜨기
Prometheus 를 보면 테스트가 통과했다 안했다를 반복한다. 학교 도서관 시스템의 안정성이 그리 뛰어나지 않기 때문이다. (바꾸고 난 뒤 오히려 맨날 문제를 일으킨다. 똑같은 조건식에서 한번은 검색이 되고 한번은 검색이 안되니.. 쩝)
28 (목): 하드 소스 & 문서 정리. ProjectPrometheus 버그 수정
Prometheus 코드를 다시 checkout 하고 UnitTest 깨진 부분을 보면서 기존의 TDD 진행 보폭이 얼마나 컸는지가 보였다. (다시 Green Bar 를 보이게끔 하기에 진행해야 할일이 많았으니까. Extractor Remote Test 가 no matched (정규표현식에서 매칭 실패)로 깨졌을때 생각해야 할 일이 두가지이다. 하나는 HTML 이 제대로 받아졌는가(또는 HTML 이 도서관에서의 에러코드를 반환하는가), 하나는 extractor 가 그 구실을 제대로 하는가. 그런데, 테스트 코드를 보면 저 두가지가 묶여있다.
그리고 정규표현식을 이용한 extract 가 과연 'The Simplest Thing' 일까라는 생각을 하게 되었다. 올바른 정규표현식을 찾아내야 하고, 그러다보면 데이터 코드와 정규표현식이 일종의 Duplication 을 만들어낸다. (파싱하려는 문서의 일부가 정규표현식에 들어가므로) 그리고 RE 는 RE 문법을 아는 사람이라면 모르겠지만, 그렇지 않고 막연한 경우에 TDD 할 경우 Try and Error 식으로 접근해버릴 수 있다. (나의 경우는 이걸 점진적으로 하기 위해 표본이 되는 데이터를 작게 시작한다.) extract 의 'Simplest Thing' 는 find & substring 일것이란 생각을 해본다.
http://www.utdallas.edu/~chung/patterns/conceptual_integrity.doc - Design Patterns as a Path to Conceptual Integrity 라는 글과 그 글과 관련, Design Patterns As Litmus Paper To Test The Strength Of Object Oriented Methods 라는 글을 보게 되었는데, http://www.econ.kuleuven.ac.be/tew/academic/infosys/Members/Snoeck/litmus2.ps 이다. 디자인패턴의 생성성과 관련, RDD 와 EDD 가 언급이 되는 듯 하다.
* ProjectPrometheus
3일 (수): ["ProjectPrometheus/Journey"]
if (theApp == null) {
theApp = new Application ();
theApp.init ();
return theApp;
- AOI/2004 . . . . 3 matches
|| [TheTrip] || . || X || O || O || O || O || . || O ||
|| [CheckTheCheck] || . || . || O || . || . || . || . || O ||
|| [TheArcheologist'sDilemma]|| . || . || X || . || . || . || . || . ||
- CheckTheCheck . . . . 3 matches
=== About [CheckTheCheck] ===
|| 문보창 || C++ || . || [CheckTheCheck/문보창] ||
|| 곽세환 || C++ || . || [CheckTheCheck/곽세환] ||
- CivaProject . . . . 3 matches
/** The value is used for character storage. */
/** The offset is the first index of the storage that is used. */
/** The count is the number of characters in the String. */
/** Cache the hash code for the string */
- ErdosNumbers/차영권 . . . . 3 matches
bool isThere(Author *p, int n);
if (isThere(author[i], saveBound[i]))
bool isThere(Author *author, int n)
- FocusOnFundamentals . . . . 3 matches
When I began my EE education, I was surprised to find that my well-worn copy of the "RCA
Tube Manual" was of no use. None of my lecturers extolled the virtues of a particular tube or type
of tube. When I asked why, I was told that the devices and technologies that were popular then
would be of no interest in a decade. Instead, I learned fundamental physics, mathematics, and a
Clearly, practical experience is essential in every engineering education; it helps the students to
learn how to apply what they have been taught. I did learn a lot about the technology of that day in
laboratory assignments, in my hobby (amateur radio), as well as in summer jobs, but the lectures
Readers familiar with the software field will note that today's "important" topics are not
The many good ideas that underlie these approaches and tools must be taught. Laboratory exercises
and other projects should provide students with the opportunity to use the most popular tools and
to experiment with some new ones. However, we must remember that these topics are today's
replacements for earlier fads and panaceas and will themselves be replaced. It is the responsibility
the fundamentals that will be valid and useful over that period and emphasise those principles in
the lectures. Many programmes lose sight of the fact that learning a particular system or language
Students usually demand to be taught the language that they are most likely to use in the world outside (FORTRAN or C). This is a mistake. A well taught student (viz. one who has been taught a clean language) can easily pick up the languages of the world, and he [or she] will be in a far better position to recognize their bad features as he [or she] encounters them.
A: Most students who are studying computer science really want to study software engineering but they don't have that choice. There are very few programs that are designed as engineering programs but specialize in software.
I would advise students to pay more attention to the fundamental ideas rather than the latest technology. The technology will be out-of-date before they graduate. Fundamental ideas never get out of date. However, what worries me about what I just said is that some people would think of Turing machines and Goedel's theorem as fundamentals. I think those things are fundamental but they are also nearly irrelevant. I think there are fundamental design principles, for example structured programming principles, the good ideas in "Object Oriented" programming, etc.
- GofStructureDiagramConsideredHarmful . . . . 3 matches
There's a mistake that's repeated throughout the Design Patterns book, and unfortunately, the mistake is being repeated by new patterns authors who ape the GoF style.
Each GoF pattern has a section called "Structure" that contains an OMT (or for more recent works, UML) diagram. This "Structure" section title is misleading because it suggests that there is only one Structure of a Pattern, while in fact there are many structures and ways to implement each Pattern.
But inexperienced Patterns students and users don't know this. They read the Patterns literature too quickly, often thinking that they understand a Pattern merely by understanding it's single "Structure" diagram. This is a shortcoming of the GoF Form, one which I believe is harmful to readers.
What about all those important and subtle Implementation notes that are included with each GoF Pattern? Don't those notes make it clear that a Pattern can be implemented in many ways? Answer: No, because many folks never even read the Implementation notes. They much prefer the nice, neat Structure diagrams, because they usually only take up a third of a page, and you don't have to read and think a lot to understand them.
Diagrams are seductive, especially to engineers. Diagrams communicate a great deal in a small amount of space. But in the case of the GoF Structure Diagrams, the picture doesn't say enough. It is far more important to convey to readers that a Pattern has numerous Structures, and can be implemented in numerous ways.
I routinely ask folks to add the word "SAMPLE" to each GoF Structure diagram in the Design Patterns book. In the future, I'd much prefer to see sketches of numerous structures for each Pattern, so readers can quickly understand that there isn't just one way to implement a Pattern. But if an author will take that step, I'd suggest going even further: loose the GoF style altogether and communicate via a pattern language, rich with diagrams, strong language, code and stories.
- HighResolutionTimer . . . . 3 matches
If a high-resolution performance counter exists on the system, the QueryPerformanceFrequency function can be used to express the frequency, in counts per second. The value of the count is processor dependent. On some processors, for example, the count might be the cycle rate of the processor clock.
The '''QueryPerformanceCounter''' function retrieves the current value of the high-resolution performance counter (if one exists on the system). By calling this function at the beginning and end of a section of code, an application essentially uses the counter as a high-resolution timer. For example, suppose that '''QueryPerformanceFrequency''' indicates that the frequency of the high-resolution performance counter is 50,000 counts per second. If the application calls '''QueryPerformanceCounter''' immediately before and immediately after the section of code to be timed, the counter values might be 1500 counts and 3500 counts, respectively. These values would indicate that .04 seconds (2000 counts) elapsed while the code executed.
- HowToBuildConceptMap . . . . 3 matches
1. Identify a focus question that addresses the problem, issues, or knowledge domain you wish to map. Guided by this question, identify 10 to 20 concepts that are pertinent to the question and list these. Some people find it helpful to write the concept labels on separate cards or Post-its so taht they can be moved around. If you work with computer software for mapping, produce a list of concepts on your computer. Concept labels should be a single word, or at most two or three words.
* Rank order the concepts by placing the broadest and most inclusive idea at the top of the map. It is sometimes difficult to identify the boradest, most inclusive concept. It is helpful to reflect on your focus question to help decide the ranking of the concepts. Sometimes this process leads to modification of the focus question or writing a new focus question.
* Work down the list and add more concepts as needed.
* Begin to build your map by placing the most inclusive, most general concept(s) at the top. Usually there will be only one, two, or three most general concepts at the top of the map.
* Next selet the two, three or four suboncepts to place under each general concept. Avoid placing more than three or four concepts under any other concept. If there seem to be six or eight concepts that belong under a major concept or subconcept, it is usually possible to identifiy some appropriate concept of intermediate inclusiveness, thus creating another level of hierarchy in your map.
* Connect the concepts by lines. Label the lines with one or a few linking words. The linking words should define the relationship between the two concepts so that it reads as a valid statement or proposition. The connection creates meaning. When you hierarchically link together a large number of related ideas, you can see the structure of meaning for a given subject domain.
* Rework the structure of your map, which may include adding, subtracting, or changing superordinate concepts. You may need to do this reworking several times, and in fact this process can go on idenfinitely as you gain new knowledge or new insights. This is where Post-its are helpful, or better still, computer software for creating maps.
* Look for crosslinks between concepts in different sections of the map and label these lines. Crosslinks can often help to see new, creative relationships in the knowledge domain.
* Specific examples of concepts can be attached to the concept labels (e.g., golden retriver is a specific example of a dog breed).
* Concept maps could be made in many different forms for the same set of concepts. There is no one way to draw a concept map. As your understanding of relationships between concepts changes, so will your maps.
- JavaScript/2011년스터디/김수경 . . . . 3 matches
// Call the inherited version of dance()
// The base Class implementation (does nothing)
// Instantiate a base class (but only create the instance,
// don't run the init constructor)
// Copy the properties over onto the new prototype
// Add a new ._super() method that is the same method
// but on the super-class
// The method only need to be bound temporarily, so we
// The dummy class constructor
// All construction is actually done in the init method
// Enforce the constructor to be what we expect
- Kongulo . . . . 3 matches
# modification, are permitted provided that the following conditions are
# * Redistributions of source code must retain the above copyright
# notice, this list of conditions and the following disclaimer.
# * Redistributions in binary form must reproduce the above
# copyright notice, this list of conditions and the following disclaimer
# in the documentation and/or other materials provided with the
# * Neither the name of Google Inc. nor the names of its
# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
# LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
# A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
# THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
# (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
# OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- Knows basic and digest HTTP authentication
Requires Python 2.4 and the win32all extensions for Python 2.4 on Windows.
# Digs out the text of an HTML document's title.
error codes that Kongulo always checks explicitly rather than catching them
'''A very simple password store. The user can supply usernames using the
-p flag on the command line, and will be prompted for the password for
'''Given an options object as used by Kongulo, ask the user for the
- LIB_3 . . . . 3 matches
/* Init The Scheduler List
/* Create The Task
// Init The Stack
// Init the TCB by argument <----- 함수에서 얻은 변수들로... 초기화...ok???
/* Delete the Task
/* Find Ready Task & Run the Task
- Linux/필수명령어/용법 . . . . 3 matches
The Oct 1 15:57:23 KST 1996
- $ echo "The RedHat !"
- The RedHat !
- $ ln project theplan ,,두 개의 이름은 같은 문서를 의미한다.
- then
- echo "It's changed to the blade.room"
- ModelViewPresenter . . . . 3 matches
TwistingTheTriad
ConnectingTheDots
Model-View-Presenter or MVP is a next generation programming model for the C++ and Java programming languages. MVP is based on a generalization of the classic MVC programming model of Smalltalk and provides a powerful yet easy to understand design methodology for a broad range of application and component development tasks. The framework-based implementation of these concepts adds great value to developer programs that employ MVP. MVP also is adaptable across multiple client/server and multi-tier application architectures. MVP will enable IBM to deliver a unified conceptual programming model across all its major object-oriented language environments.
- MoinMoinTodo . . . . 3 matches
This is a list of things that are to be implemented. If you miss a feature, have a neat idea or any other suggestion, please put it on MoinMoinIdeas.
To discuss the merit of the planned extensions, or new features from MoinMoinIdeas, please use MoinMoinDiscussion.
A list of things that are added to the current source in CVS are on MoinMoinDone.
MoinMoinRelease describes how to build a release from the SourceForge repository.
Things to do in the near future:
* add a nice progress page, while the dictionary cache is built
* add a means to build the dict.cache file from the command line
* Macro that lists all users that have an email address; a click on the user name sends the re-login URL to that email (and not more than once a day).
* Send a timestamp with the EditPage link, and then compare to the current timestamp; warn the user if page was edited since displaying.
* Now that we can identify certain authors (those who have set a user profile), we can avoid to create a backup copy if one author makes several changes; we have to remember who made the last save of a page, though.
* Implement the update script (copying new images etc.) described elsewhere on this page or MoinMoinIdeas.
* Replace SystemPages by using the normal "save page" code, thus creating a backup copy of the page that was in the system. Only replace when diff shows the page needs updating.
* Other things like color, icons, menu?
* On request, send email containing an URL to send the cookie
* a CSS switch (needs more work on the formatter issue to really work)
* create a dir per page in the "backup" dir; provide an upgrade.py script to adapt existing wikis
* or go all the way, and store pages as data/pages/<firstletter>/<pagename>/(current|meta|...|<timestamp>)
* Add a link to Wiki:EditThePageSimultaneously (or a link to a local copy) to the edit conflict message.
* [[SiteMap]]: find the hotspots and create a hierarchical list of all pages (again, faster with caching)
* Remember when someone starts to edit a page, and warn when someone else opens the same page for editing
- PersonalHistory . . . . 3 matches
* [TheJavaMan] - 2004년 3월 2일 종료
* [TheJavaMan/비행기게임] - 2004년 3월 2일 종료
* [TheJavaMan/숫자야구] - 2004년 1/26일 종료
- ProgrammingLanguageClass/2006/Report3 . . . . 3 matches
treat the actual parameters as thunks. Whenever a formal parameter is referenced in a
subprogram, the corresponding thunk compiled for that parameter is executed. Even
though it is difficult to avoid run-time overhead in the execution of thunks, sometimes it
required to prefix the keyword name just in front of both the actual and formal
Of course, if a C program with the call statement above is to be compiled by a
conventional compiler, syntax errors should occur since it violates the syntactical rules
You are required to implement C preprocessor that supports the pass-by-name
parameter-passing method. The preprocessor should transform C programs with name
parameters into pure C programs so that the transformed programs manage to handle
parameters prefixed with name as if they were called by name without causing any
3) You have to show off the robustness of your program by checking various
cf) Jensen's Device, Man Boy Test 는 Compiler Theory 의 한 항목들입니다.
You should follow the guideline suggested later. To be specific, your report is
The external documentation should explain your program in detail so that we can
understand what kind of data structures have been used, the characteristics and general
as well as unique features of your program, etc. An internal documentation means the
- PythonForStatement . . . . 3 matches
These represent finite ordered sets indexed by non-negative numbers. The built-in function len() returns the number of items of a sequence. When the length of a sequence is n, the index set contains the numbers 0, 1, ..., n-1. Item i of sequence a is selected by a[i].
{{|There are six sequence types: strings, Unicode strings, lists, tuples, buffers, and xrange objects|}}
- RandomWalk/임인택 . . . . 3 matches
int board[40][20]; // maximum size of the board is : 40x20
// prevent the roach moves outside of the board
cout << "input size of the board" << endl;
cout << "Size of the board : ";
// initizlize the vector
// prevent the roach moves outside of the board
cout << "Size of the board : ";
// if the roach moved outside of the board ignore that case.
public void putOnTheBoard(Board board) {
int roaX, roaY; // watch position of the roach
// because the roach doesn't know his position
myRoach.putOnTheBoard(myBoard);
// if the roach visited all cells..
else if( msg.killMessage) { // if the cell received kill message
} else { // when the roach is on walking~~~
System.out.println("There are" + _numOfVisited + " arrivals");
// if here is the starting point, then send kill signal to others.
} else { // else, relay to the first point.
// if this is not the last point relay to the last point
- SmallTalk/문법정리 . . . . 3 matches
* 모든 스몰토크 표현식이 다음과 같은 양식을 따른다.All Smalltalk expressions follow the form:
"The message sent is #squared"
"The message sent is #asUppercase"
"The message sent is #factorial"
* 선택자는 단일 식별자이며, 인수는 없다.(the selector is a single Identifier, there are no arguments)
* 선택자는 특정한 기호(하나나 둘이상의 문자, 숫자가 아님)이고, 인수가 딱 하나만 있다.(the selector is one or two non-alphanumeric characters, followed by exactly one argument object)
"argument is the Integer object 5"
"argument is the String 'xyz'"
"argument is the Integer object 20"
* 각 키워드에 인수가 있을 때, 선택자는 하나 이상의 키워드이다.(the selector is one or more keywords, when called each keyword is followed by an argument object) -> 세번째 예시 참고
Point x: 4 y: 200. "receiver is the object Point"
* Unary 메세지는 가장 높은 우선 순위를 가진다. messages have the highest precedence.
* Binary 메세지는 그 다음의 우선 순위를 가진다. Binary message have the next precedence.
* Keyword 메세지는 가장 낮은 우선 순위를 가진다.Keyword message have the lowest precedence.
- TAOCP . . . . 3 matches
* Title : TheArtOfComputerProgramming
* TheArtOfComputerProgramming(TAOCP) vol1. FundamentalAlgorithms을 읽는다.
[TAOCP/NotesOnTheExercises]
- TCP/IP_IllustratedVol1 . . . . 3 matches
= TCP/IP Illustrated, Volume 1 : The Protocols =
W. Richard Stevens 라고 책 겉 표지에, 부제인 'The Protocols' 만큼이나 크게 적혀있다.
* "'''''The word illustrated distinguishes this bool from its may rivals.'''''" 이 책의 뒷커버에 적혀있는 말이다. 이말이 이 책을 가장 멋지게 설명해준다고 생각한다.
- TheElementsOfProgrammingStyle . . . . 3 matches
TheElementsOfStyle 에 대한 글을 이곳 저곳에서 보면 항상같이 언급되는 책이다. 중앙도서관에 구입신청을 했지만 폐간되어서 입수를 못하고.. 아마존에는 brandnew는 없고 used book만 있다. 각 대학 중앙도서관을 뒤지던 중 연세대와 한양대 중앙도서관에 있음을 알게됨. 우리학교엔 왜 없었던 걸까.
학생들이 TheElementsOfProgrammingStyle 을 공부하면서 TheElementsOfStyle을 언급하였으면 좋겠다. - [임인택]
- TheJavaMan/설치 . . . . 3 matches
System.out.println("Hello!!! The Java Man");
앞의 과정을 잘 따라했다면 ''System.out.println("Hello!!! The Java Man");''
Hello!!! The Java Man
- TheWarOfGenesis2R . . . . 3 matches
[TheWarOfGenesis2R/일지]
[TheWarOfGenesis2R/ToDo]
|| ["TheWarOfGenesis2R/Temp"] ||
- WikiWikiWeb . . . . 3 matches
The [wiki:Wiki:FrontPage first ever wiki site] was founded in 1994 as an automated supplement to the Wiki:PortlandPatternRepository. The site was immediately popular within the pattern community, largely due to the newness of the internet and a good slate of Wiki:InvitedAuthors. The site was, and remains, dedicated to Wiki:PeopleProjectsAndPatterns.
Wiki:WardCunnigham created the site and the WikiWikiWeb machinery that operates it. He chose wiki-wiki as an alliterative substitute for quick and thereby avoided naming this stuff quick-web. An early page, Wiki:WikiWikiHyperCard, traces wiki ideas back to a Wiki:HyperCard stack he wrote in the late 80's.
See also one of these links:
* get some answers on the Wiki:WikiWikiWebFaq
* get to know more about the Wiki:WikiHistory
- WindowsTemplateLibrary . . . . 3 matches
{{|The Windows Template Library (WTL) is an object-oriented Win32 encapsulation C++ library by Microsoft. The WTL supports an API for use by programmers. It was developed as a light-weight alternative to Microsoft Foundation Classes. WTL extends Microsoft's ATL, another lightweight API for using COM and for creating ActiveX controls. Though created by Microsoft, it is unsupported.
In an uncharacteristic move by Microsoft—an outspoken critic of open source software—they made the source code of WTL freely available. Releasing it under the open-source Common Public License, Microsoft posted the source on SourceForge, an Internet open-source repository. The SourceForge version is 7.5.
Being an unsupported library, WTL has little formal documentation. However, most of the API is a direct mirror of the standard Win32 calls, so the interface is familiar to most Windows programmers.|}}
- 고전모으기 . . . . 3 matches
* StructuredProgramming, TheElementsOfProgrammingStyle, SICP, SmalltalkByExample, SmalltalkBestPracticePatterns
* TheArtOfComputerProgramming
TheElementsOfStyle, WomenFireAndDangerousThings, MetaphorsWeLiveBy
- 정모/2011.7.25 . . . . 3 matches
* 지난주에 못 풀었던 PIGS와 TheLazyProgrammer에 재도전
* The Lazy Programmer는 진경이가 풀어내었음!!
* The Simpsons 1시즌 1화 대사 따라하기 (Marge, Homer의 대화 40초)
- 포항공대전산대학원ReadigList . . . . 3 matches
“Introduction to Automata Theory, Languages, and Computation”, J. E. Hopcroft, R. Motwani,
“Computer Organization, The HW/SW interface”, D. Patterson and J. Hennesey, Morgan Kaufman, 1994.
“Types and Programming Languages”, Benjamin C. Pierce, The MIT Press.
- 프로젝트 . . . . 3 matches
* [TheJavaMan] - 2004년 3월 2일 종료
* [TheJavaMan/비행기게임] - 2004년 3월 2일 종료
* [TheJavaMan/숫자야구] - 2004년 1/26일 종료
- 3n 1/이도현 . . . . 2 matches
2005-12-30 14:39:20 Accepted 3.256 436 56031 C++ 100 - The 3n + 1 problem
// The 3n + 1 problem
- AcceleratedC++/Chapter5 . . . . 2 matches
=== 5.2.4 The meaning of students.erase(students.begin() + i) ===
== 5.5 The list type ==
=== 5.5.2 Why bother? ===
- ActiveTemplateLibrary . . . . 2 matches
{{|The Active Template Library (ATL) is a set of template-based C++ classes that simplify the programming of Component Object Model (COM) objects. The COM support in Visual C++ allows developers to easily create a variety of COM objects, Automation servers, and ActiveX controls.
- Ajax . . . . 2 matches
* The Document Object Model manipulated through JavaScript to dynamically display and interact with the information presented
* The XMLHttpRequest object to exchange data asynchronously with the web server. (XML is commonly used, although any text format will work, including preformatted HTML, plain text, and JSON)
Like DHTML, LAMP, or SPA, Ajax is not a technology in itself, but a term that refers to the use of a group of technologies together. In fact, derivative/composite technologies based substantially upon Ajax, such as AFLAX are already appearing.
Ajax applications use web browsers that support the above technologies as a platform to run on. Browsers that support these technologies include Mozilla Firefox, Microsoft Internet Explorer, Opera, Konqueror and Apple Safari.
- Atom . . . . 2 matches
Atom is an XML-based document format and HTTP-based protocol designed for the syndication of Web content such as weblogs and news headlines to Web sites as well as directly to user agents. It is based on experience gained in using the various versions of RSS. Atom was briefly known as "Pie" and then "Echo".
The completed Atom syndication format specification was submitted to the IETF for approval in June 2005, the final step in becoming an RFC Internet Standard. In July, the Atom syndication format was declared ready for implementation[1]. The latest Atom data format and publishing protocols are linked from the Working Group's home page.
Before the Atom work entered the IETF process, the group produced "Atom 0.3", which has support from a fairly wide variety of syndication tools both on the publishing and consuming side. In particular, it is generated by several Google-related services, namely Blogger and Gmail.
As well as syndication format, the Atom Project is producing the "Atom Publishing Protocol", with a similar aim of improving upon and standarizing existing publishing mechanisms, such as the Blogger API and LiveJournal XML-RPC Client/Server Protocol.
- BlueZ . . . . 2 matches
The overall goal of this project is to make an implementation of the Bluetooth™ wireless standards specifications for Linux. The code is licensed under the GNU General Public License (GPL) and is now included in the Linux 2.4 and Linux 2.6 kernel series.
// bind socket to port 1 of the first available
// read data from the client
// set the connection parameters (who to connect to)
// bind socket to port 0x1001 of the first available
// read data from the client
// set the connection parameters (who to connect to)
- Boost/SmartPointer . . . . 2 matches
// The original code for this example appeared in the shared_ptr documentation.
// argument, so would not work as intended. At that point the code was
// The application will produce a series of
// This example demonstrates the handle/body idiom (also called pimpl and
// several other names). It separates the interface (in this header file)
// from the implementation (in shared_ptr_example2.cpp).
// is still valid because the type is complete where it counts - in the
- BoostLibrary/SmartPointer . . . . 2 matches
// The original code for this example appeared in the shared_ptr documentation.
// argument, so would not work as intended. At that point the code was
// The application will produce a series of
// This example demonstrates the handle/body idiom (also called pimpl and
// several other names). It separates the interface (in this header file)
// from the implementation (in shared_ptr_example2.cpp).
// is still valid because the type is complete where it counts - in the
- C++ . . . . 2 matches
C++ (pronounced "see plus plus") is a general-purpose computer programming language. It is a statically typed free-form multi-paradigm language supporting procedural programming, data abstraction, object-oriented programming, and generic programming. During the 1990s, C++ became one of the most popular commercial programming languages.
Bell Labs' Bjarne Stroustrup developed C++ (originally named "C with Classes") during the 1980s as an enhancement to the C programming language. Enhancements started with the addition of classes, followed by, among many features, virtual functions, operator overloading, multiple inheritance, templates, and exception handling. The C++ programming language standard was ratified in 1998 as ISO/IEC 14882:1998, the current version of which is the 2003 version, ISO/IEC 14882:2003. New version of the standard (known informally as C++0x) is being developed.
In C and C++, the expression x++ increases the value of x by 1 (called incrementing). The name "C++" is a play on this, suggesting an incremental improvement upon C.|}}
- CarmichaelNumbers . . . . 2 matches
The number 1729 is a Carmichael number.
The number 561 is a Carmichael number.
- CarmichaelNumbers/문보창 . . . . 2 matches
Carmichael Numbers를 찾는 Theorem이 있는 듯하다. 그러나 때려맞추기(?)로 문제를 풀어도 풀린다. 그러나 속도는 떨어진다.
cout << "The number " << n << " is a Carmichael number.\n";
- CollaborativeFiltering . . . . 2 matches
협업 (상호협동) 필터링, Recommender System이라고도 불림. ProjectPrometheus에서 사용한다.
* The Spearman rank correlation
* The Vector similarity
* [http://wwwbroy.in.tum.de/~pretschn/papers/personalization/personalization.html Personalization on the Web]
- ComponentObjectModel . . . . 2 matches
{{|Component Object Model, or COM, is a Microsoft technology for software componentry. It is used to enable cross-software communication and dynamic object creation in many of Microsoft's programming languages. Although it has been implemented on several platforms, it is primarily used with Microsoft Windows. COM is expected to be replaced to at least some extent by the Microsoft .NET framework. COM has been around since 1993 - however, Microsoft only really started emphasizing the name around 1997.
The COM platform has largely been superseded by the Microsoft .NET initiative and Microsoft now focuses its marketing efforts on .NET. To some extent, COM is now deprecated in favour of .NET.
Despite this, COM remains a viable technology with an important software base – for example the popular DirectX 3D rendering SDK is based on COM. Microsoft has no plans for discontinuing COM or support for COM.
There exists a limited backward compatibility in that a COM object may be used in .NET by implementing a runtime callable wrapper (RCW), and .NET objects may be used in COM objects by calling a COM callable wrapper. Additionally, several of the services that COM+ provides, such as transactions and queued components, are still important for enterprise .NET applications.
COM is a feature of Windows. Each version of Windows has a support policy described in the Windows Product Lifecycle.
COM is a planned feature of the coming version of Windows, code-named "Longhorn".
- ConcreteMathematics . . . . 2 matches
== Concrete Mathematics ==
1. Look at small cases. This gives us insight into the problem and helps us in stages 2 and 3.
2. Find and prove a mathematical expression for the quantity of interest. (Induction so on..)
3. Find and prove a closed form for our mathematical expression.
[The Tower of Hanoi]
[Lines In The Plane]
- CuttingSticks . . . . 2 matches
The minimum cutting is 200.
The minimum cutting is 22.
- Debugging/Seminar_2005 . . . . 2 matches
* ask the code
* fully implemented and fully debugged, before the developer(s) responsible for that feature move on to the next feature -> debugging The development Process
* Study The source with debugger
- DirectDraw/Example . . . . 2 matches
// SimpleDX.cpp : Defines the entry point for the application.
TCHAR szTitle[MAX_LOADSTRING]; // The title bar text
TCHAR szWindowClass[MAX_LOADSTRING]; // The title bar text
// PURPOSE: Registers the window class.
// to be compatible with Win32 systems prior to the 'RegisterClassEx'
// so that the application will get 'well formed' small icons associated
// In this function, we save the instance handle in a global variable and
// create and display the main program window.
// PURPOSE: Processes messages for the main window.
// WM_COMMAND - process the application menu
// WM_PAINT - Paint the main window
// Parse the menu selections:
- EdsgerDijkstra . . . . 2 matches
* [http://www.cs.utexas.edu/users/EWD/ewd03xx/EWD340.PDF TheHumbleProgrammer]
위의 Stepwise Program Construction과 The Humble Programmer는 초강력 추천. 감동의 물결. 아마 그 글을 읽고 몇 주 동안은 여러가지 실험을 해보며 흥미진진하게 보내게 될 것이며, 몇 몇은 프로그래밍에 획기적인 전환점을 맞이할 수 있을 것이라 믿음. --김창준
- EightQueenProblemDiscussion . . . . 2 matches
def testIsAttackableOthers (self):
self.assertEquals (self.bd.IsAttackableOthers (3,3),1)
self.assertEquals (self.bd.IsAttackableOthers (7,1),0)
self.assertEquals (self.bd.IsAttackableOthers (4,4),1)
자신에게 항상 "What is the simplest thing that could possibly work?"라는 질문을 하면서 TestDrivenDevelopment를 했나요? 테스트/코드 사이클을 진행하면서 스텝을 작게 하려고 노력했나요? 중간에 진척이 별로 없는 경우, 어떤 액션을 취했나요? 그 때 테스트 사이클의 스텝을 더 작게하려고 했나요? 만약 다시 같은 문제를 새로 푼다면 어떤 순서로 테스트를 하고 싶나요? (직접 다시 한번 새로 시작하는 것도 강력 추천) 왜 다른 사람들에 비해 시간이 상대적으로 많이 걸렸을까요? 테스트 코드를 사용한 것이 그 시간만큼의 이득이 있었나요? TestDrivenDevelopment를 해내가면서 현재 패스하려고 하는 테스트 케이스에서 무엇을 배웠나요? 켄트벡이 말하는 것처럼 사고의 도구가 되어 주었나요? 참고로 저는 EightQueenProblem을 파이썬으로 약 30분 정도 시간에 50 라인 이내로(테스트 코드 제외) 풀었습니다. TestDrivenDevelopment로요. --김창준
사고의 도구로써는 연습장과 TFP 둘 다 이용했지만, 순수하게 적용하지는 않았습니다. (위의 Queen을 놓는 부분에 대한 재귀호출부분에서는 적용못함) 테스트작성시간/코드작성시간 등에 대한 관리는 하지 않았습니다. (이 부분에 대해서는 반성을. ^^;) 흠.. 그리고 'The Simplest Thing'을 찾아나갔다기 보다도, 이미 해당 문제에 대해서 의사코드를 생각하고, 해당 코드에 대해 Top-Down 형태로 모듈을 나눈뒤에 모듈에 대해 테스트를 만들어갔다는 생각이 드네요. --석천
When the program is run, one has to give a number n (smaller than 32), and the program will return in how many ways n Queens can be put on a n by n board in such a way that they cannot beat each other.
Note that the d=(e-=d)&-e; statement can be compiled wrong on certain compilers. The inner assignment should be executed first. Otherwise replace it with e-=d,d=e&-e;.
- EnglishSpeaking/TheSimpsons/S01E05 . . . . 2 matches
= Bart the General =
Friend : Nelson's at the Elm Street Video Arcade.
Bart : Intelligence indicates he shakes down kids for quarters at the arcade.
Herman : Then he heads to the Quick-E-Mart for a cherry Squishy.
Then that's where we'll hit him.
When he leaves the Quick-E-Mart,
we start the saturation bombing.
We got the water balloons?
Is it okay if they say "Happy Birthday" on the side?
Herman : Well, I'd rather they say " Death From Above," but I guess we're stuck.
One will circle around this way to cut off the enemy's retreat,
the other will drive in this way, closing the trap.
Friend : Nelson's at the arcade, General.
I thought I'd never hear the screams of pain...
or see the look of terror in a young man's eyes.
- Expat . . . . 2 matches
Expat is a stream-oriented XML 1.0 parser library, written in C. Expat was one of the first open source XML parsers and has been incorporated into many open source projects, including the Apache HTTP Server, Mozilla, Perl, Python and PHP.
James Clark released version 1.0 in 1998 while serving as technical lead on the XML Working Group at the World Wide Web Consortium. Clark released two more versions, 1.1 and 1.2, before turning the project over to a group led by Clark Cooper, Fred Drake and Paul Prescod in 2000. The new group released version 1.95.0 in September 2000 and continues to release new versions to incorporate bug fixes and enhancements. Expat is hosted as a SourceForge project. Versions are available for most major operating systems.
To use the Expat library, programs first register handler functions with Expat. When Expat parses an XML document, it calls the registered handlers as it finds relevant tokens in the input stream. These tokens and their associated handler calls are called events. Typically, programs register handler functions for XML element start or stop events and character events. Expat provides facilities for more sophisticated event handling such as XML Namespace declarations, processing instructions and DTD events.
Expat's parsing events are similar to the events defined in the Simple API for XML (SAX), but Expat is not a SAX-compliant parser. Projects incorporating the Expat library often build SAX and DOM parsers on top of Expat.
- FromDuskTillDawn . . . . 2 matches
각 테스트 케이스에 대해 일단 테스트 케이스 번호를 출력한 다음, 그 다음 줄에 "Vladimir needs # litre(s) of blood." 또는 "There is no route Vladimir can take."를 출력한다 (출력 예 참조).
There is no route Vladimir can take.
- GDBUsage . . . . 2 matches
The GNU Debugger, usually called just GDB, is the standard debugger for the GNU software system. It is a portable debugger that runs on many Unix-like systems and works for many programming languages, including C, C++, and FORTRAN.
GDB is free software, covered by the GNU General Public License, and you are
Type "show copying" to see the conditions.
There is absolutely no warranty for GDB. Type "show warranty" for details.
Editing targets can be specified in these ways:
FUNCTION, to edit at the beginning of that function,
*ADDRESS, to edit at the line containing that address.
Dynamically load FILE into the running program, and record its symbols
Execute the rest of the line as a shell command.
- Gnutella-MoreFree . . . . 2 matches
== The Gnutella Protocol Document ==
The Gnutella Protocol Document
// Add hosts to the download list
// Extract results from the packet
- Gof/Visitor . . . . 2 matches
- declares a Visit operations for each class of ConcreteElement in the object structure. The operation's name and signature identifies the class that sends the Visit request to the visitor. That lets the visitor determine the concrete class of the element being visited. Then the visitor can access the element directly through its particular interface.
- implements each operation declared by Visitor. Each operation implements a fragment of the algorithm defined for the corresponding class of object in the structure. ConcreteVisitor provides the context for the algorithm and stores its local state. This state often accumulates result during the traversal of the structure.
- may provide a high-level interface to allow the visitor to visit its elements. [[BR]]
- may either be a composite (See CompositePattern) or a collection such as a list or a set. [[BR]]
// and so on for other concrete elements
// and so on for other concrete subclasses of Equipment
- HowToStudyRefactoring . . . . 2 matches
* Separate The What From The How : "어떻게"와 "무엇을"을 분리하도록 하라. 어떤 리팩토링이 창발하는가?
- HowToStudyXp . . . . 2 matches
* The Timeless Way of Building : 패턴 운동을 일으킨 Christopher Alexander의 저작. On-site Customer, Piecemeal Growth, Communication 등의 아이디어가 여기서 왔다.
* The Psychology of Computer Programming (Gerald M. Weinberg) : 프로그래밍에 심리학을 적용한 고전. Egoless Programming이 여기서 나왔다.
*Michael Feathers
- InterMap . . . . 2 matches
NowThen http://zeropage.org/wikis/nowthen/
NowThen2004 http://zeropage.org/wikis/nowthen2004/ #지금그때2004 후의 위키 정리 페이지
- InterWikiIcons . . . . 2 matches
The InterWiki Icon is the cute, little picture that appears in front of a link instead of the prefix established by InterWiki. An icon exists for some, but not all InterMap references.
* Others?
InterWikiIcon also used in the Unreal:Unreal Wiki.
The gimp :)
- InternalLinkage . . . . 2 matches
[MoreEffectiveC++]의 Item 26 'Limiting the number of objects of a class. 를 보면 다음과 같은 부분이 있다.
The second subtlety has to do with the interaction of inlining and static objects inside functions. Look again at the code for the non-member version of thePrinter: ¤ Item M26, P17
Printer& thePrinter()
Except for the first time through this function (when p must be constructed), this is a one-line function — it consists entirely of the statement "return p;". If ever there were a good candidate for inlining, this function would certainly seem to be the one. Yet it's not declared inline. Why not? ¤ Item M26, P18
Consider for a moment why you'd declare an object to be static. It's usually because you want only a single copy of that object, right? Now consider what inline means. Conceptually, it means compilers should replace each call to the function with a copy of the function body, but for non-member functions, it also means something else. It means the functions in question have internal linkage.
You don't ordinarily need to worry about such linguistic mumbo jumbo, but there is one thing you must remember: functions with internal linkage may be duplicated within a program (i.e., the object code for the program may contain more than one copy of each function with internal linkage), and this duplication includes static objects contained within the functions. The result? If you create an inline non-member function containing a local static object, you may end up with more than one copy of the static object in your program! So don't create inline non-member functions that contain local static data.(9)
9) In July 1996, the °ISO/ANSI standardization committee changed the default linkage of inline functions to external, so the problem I describe here has been eliminated, at least on paper. Your compilers may not yet be in accord with °the standard, however, so your best bet is still to shy away from inline functions with static data. ¤ Item M26, P61
Object& theObject() // 이 함수는 클래스의 정적 메소드나
Object& theObject()
와 같은 의미가 된다. 이것은 inline 으로 선언할거리가 될것 같기도 하지만 inline 으로 선언되지 않았다. 왜일까? (Except for the first time through this function (when p must be constructed), this is a one-line function — it consists entirely of the statement "return p;". If ever there were a good candidate for inlining, this function would certainly seem to be the one. Yet it's not declared inline. Why not? )
- InvestMulti - 09.22 . . . . 2 matches
print '3. Move to another Nation '
print '3. Move to another Nation '
print 'This Nation has these items :: ' ,items.keys()[0] ,' , ', items.keys()[1]
print 'The Market price is ' , nation[user[NATION]] , ' bytes '
print 'This Nation has these items :: ' ,items.keys()[0] ,' , ', items.keys()[1]
print '3. Move to another Nation '
print 'This Nation has these items :: ' ,items.keys()[0] ,' , ', items.keys()[1]
print 'The Market price is ' , nation[user[NATION]]
print 'This Nation has these items :: ' ,items.keys()[0] ,' , ', items.keys()[1]
- JavaScript/2011년스터디/URLHunter . . . . 2 matches
* The Hunter.html
<title>The Hunter</title>
You should kill all the monsters.<br>
Your gun point is 'O' and Others are Monsters.
- MoinMoinDone . . . . 2 matches
* Strip closing punctuation from URLs, so that e.g. (http://www.python.org) is recognized properly. Closing punctuation is characters like ":", ",", ".", ")", "?", "!". These are legal in URLs, but if they occur at the very end, you want to exclude them. The same if true for InterWiki links, like MeatBall:InterWiki.
* Check for a (configurable) max size in bytes of the RecentChanges page while building it
* Inline code sections (triple-brace open and close on the same line, {{{~cpp like this}}} or {{{~cpp ThisFunctionWhichIsNotaWikiName()}}})
* SGML-Entities were replaced when saving them a second time, i.e. & #160; without the space had a problem.
* Added a means to add meta tags to the page header, like: {{{~cpp
- NetworkDatabaseManagementSystem . . . . 2 matches
The network model is a database model conceived as flexible way of representing objects and their relationships. Its original inventor was Charles Bachman, and it was developed into a standard specification published in 1969 by the CODASYL Consortium. Where the hierarchical model structures data as a tree of records, with each record having one parent record and many children, the network model allows each record to have multiple parent and child records, forming a lattice structure.
The chief argument in favour of the network model, in comparison to the hierarchic model, was that it allowed a more natural modeling of relationships between entities. Although the model was widely implemented and used, it failed to become dominant for two main reasons. Firstly, IBM chose to stick to the hierarchical model in their established products such as IMS and DL/I. Secondly, it was eventually displaced by the relational model, which offered a higher-level, more declarative interface. Until the early 1980s the performance benefits of the low-level navigational interfaces offered by hierarchical and network databases were persuasive for many large-scale applications, but as hardware became faster, the extra productivity and flexibility of relational systems won the day.
- NotToolsButConcepts . . . . 2 matches
> Visual Basic , but i don't find it interesting, sorry for the vb
> languages, I saw there Python, and took a look at some python sites. I
> saw some snippets and read some docs and liked the language a lot. But I
> don't know if this language is well-accepted in the market and if having
As for the job market, Python isn't among the buzzwords that you'll find in
job descriptions most of the time. But software development isn't that much
about particular technologies, the important part is learning concepts. If
There's a lot more concepts that you can learn while using Python, as you
Learn concepts, not tools. At least in the long run, this will make you
more attractive to employers who have a clue about what's important in the
There are some more skills that are especially important:
- Team work: dividing up tasks. Defining the interfaces up front to avoid
blocking other team members who wait for you. Using a source code control
the client or writing an email - I've had problems with this myself in
the past, I guess that's not an uncommon problem for developers.
Teach them skepticism about tools, and explain how the state of the software development art (in terms of platforms, techniques, and paradigms) always runs slightly ahead of tool support, so those who aren't dependent on fancy tools have an advantage. --Glenn Vanderburg, see Seminar:AgilityForStudents
- Plugin/Chrome/네이버사전 . . . . 2 matches
// Copyright (c) 2012 The Chromium Authors. All rights reserved.
// found in the LICENSE file.
"sort=relevance&" + // another good one is "interestingness-desc"
"description": "The first extension that I made.",
- PragmaticVersionControlWithCVS . . . . 2 matches
The Pragmatic Programmers 시리즈. 첫인상은 개념보다는 실용서라는 느낌이 확연하게 들고, 아마존 서평도 꽤 좋은 편이다.
|| ch5 || [PragmaticVersionControlWithCVS/AccessingTheRepository] ||
- PreviousFrontPage . . . . 2 matches
A WikiWikiWeb is a collaborative hypertext environment, with an emphasis on easy access to and modification of information. This wiki is also part of the InterWiki space.
MoinMoin is a Python WikiClone, based on PikiPiki. The name is a common German slang expression explained on the MoinMoin page. If you run a Wiki using MoinMoin, please add it to the MoinMoinWikis page.
You are encouraged to add to the MoinMoinIdeas page, and edit the WikiSandBox whichever way you like. Please try to restrain yourself from adding unrelated stuff, as I want to keep this clean and part of the project documentation.
You can edit any page by pressing the link at the bottom of the page. Capitalized words joined together form a WikiName, which hyperlinks to another page. The highlighted title searches for all pages that link to the current page. Pages which do not yet exist are linked with a question mark: just follow the link and you can add a definition.
To learn more about what a WikiWikiWeb is, read about WhyWikiWorks and the WikiNature. Also, consult the WikiWikiWebFaq.
* MoinMoinTodo: discussion about the improvement of MoinMoin
* FindPage: search or browse the database in various ways
- ProgrammingPearls . . . . 2 matches
|| ["ProgrammingPearls/Column1"] || Cracking The Oyster ||
|| ["ProgrammingPearls/Column7"] || The Back of the Envelope ||
- ProgrammingPearls/Column4 . . . . 2 matches
=== The shallange of binary search ===
=== Writing the Program ===
=== Understanding the Program ===
=== The Roles of Program Verification ===
- ProgrammingPearls/Column5 . . . . 2 matches
=== The art of assertion ===
=== The Complete Program ===
- RandomWalk/황재선 . . . . 2 matches
cout << "\n(2)The final count array:" << endl;
cout << "\n(1)The total number of legal moves: " << count << endl;
- Refactoring/MakingMethodCallsSimpler . . . . 2 matches
The name of a method does not reveal its purpose.
''Change the name of the method''
A parameter is no longer used by the method body.
You have a method that returns a value but also changes the state of an object.
''Create two methods, one for the query and one for the modification''
Several methods do similar things but with different values contained in the method body.
''Create one method that uses a parameter for the different values''
You have a method that runs different code depending on the values of an enumerated parameter.
''Create a separate method for each value of the parameter''
void setHeight (int arg) {
You are getting several values from an object and passing these values as parameters in a method call.
''Send the whole object instead''
An object invokes a method, then passes the result as a parameter for a method. The receiver can also invoke this method.
''Remove the parameter and let the receiver invoke the method''
You have a group of parameters that naturally go together.
''Replace them with an object''
A method is not used by any other class.
''Make the method private''
''Replace the constructor with a factory method''
''Move the downcast to within the method''
- ReplaceTempWithQuery . . . . 2 matches
이러한 방법을 사용하면서 부가적으로 얻을 수 있는 장점이 하나 더 있다. 실제로 도움이 될지 안될지 모르는 최적화를 하는데 쏟는 시간을 절약할 수 있다. 임시변수 사용뿐 아니라 이러한 미세한 부분의 조정은, 해놓고 보면 별로 위대해보이지 않는 일을, 할때는 알지 못하고 결국 시간은 낭비한게 된다. 돌이켜보면 나의 이러한 노력이 제대로 효과가 있었는지도 모른다. '''왜?''' 프로파일링 해보지 않았으니까. 단순히 ''시스템을 더 빨리 돌릴 수 '''있을지도''' 모른다''는 우려에서 작성한 것이었으니까. [http://c2.com/cgi/wiki?DoTheSimplestThingThatCouldPossiblyWork DoTheSimplestThingThatCouldPossiblyWork]
I do not know what I may appear to the world, but to myself I seem to
have been only a boy playing on the seashore, and diverting myself in
now and then finding a smoother pebble or a prettier shell than
ordinary. Whilst the great ocean of truth lay all undiscovered before me.
- RoboCode . . . . 2 matches
||[TheJavaMan/로보코드]|| 휘동 ||
[TheJavaMan/로보코드]와 [JavaStudy2004/로보코드]를 여기로 합치면 좋지 않을까요?--[Leonardong]
- StandardWidgetToolkit . . . . 2 matches
The most succinct description of the Standard Widget Toolkit component is this:
The SWT component is designed to provide efficient, portable access to the user-interface facilities of the operating systems on which it is implemented.
- StructuredText . . . . 2 matches
symbology to indicate the structure of a document. For the next generation of structured text, see [http://dev.zope.org/Members/jim/StructuredTextWiki/StructuredTextNG here].
as the minimum indentation of the paragraph. A paragraph is a
sub-paragraph of another paragraph if the other paragraph is the last
* A paragraph with a first line that contains some text, followed by some white-space and '--' is treated as a descriptive list element. The leading text is treated as the element title.
* Sub-paragraphs of a paragraph that ends in the word 'example' or the word 'examples', or '::' is treated as example code and is output as is.
* Text enclosed single quotes (with white-space to the left of the first quote and whitespace or puctuation to the right of the second quote) is treated as example code.
* Text surrounded by '*' characters (with white-space to the left of the first '*' and whitespace or puctuation to the right of the second '*') is emphasized.
* Text surrounded by '**' characters (with white-space to the left of the first '**' and whitespace or puctuation to the right of the second '**') is made strong.
* Text surrounded by '_' underscore characters (with whitespace to the left and whitespace or punctuation to the right) is made underlined.
* Text enclosed in brackets which consists only of letters, digits, underscores and dashes is treated as hyper links within the document. For example:
Is interpreted as '... by Smith <a href="#12">[12]</a> this ...'. Together with the next rule this allows easy coding of references or end notes.
* Text enclosed in brackets which is preceded by the start of a line, two periods and a space is treated as a named link. For example:
Is interpreted as '<a name="12">[12]</a> "Effective Techniques" ...'. Together with the previous rule this allows easy coding of references or end notes.
* A paragraph that has blocks of text enclosed in '||' is treated as a table. The text blocks correspond to table cells and table rows are denoted by newlines. By default the cells are center aligned. A cell can span more than one column by preceding a block of text with an equivalent number of cell separators '||'. Newlines and '|' cannot be a part of the cell text. For example:
- TFP예제/WikiPageGather . . . . 2 matches
=== WikiPageGatherTestCase.py ===
from WikiPageGather import *
class WikiPageGatherTestCase (unittest.TestCase):
self.pageGather = WikiPageGather ()
self.pageGather = None
self.assertEquals (self.pageGather.WikiPageNameToMoinFileName ('''한글테스트'''), '''_c7_d1_b1_db_c5_d7_bd_ba_c6_ae''')
self.assertEquals (self.pageGather.WikiPageNameToMoinFileName ("FrontPage"), "FrontPage")
self.pageGather.SetPage ("FrontPage")
self.assertEquals (self.pageGather.GetPageNamesFromPage (), ["LearningHowToLearn", "ActiveX", "Python", "XPInstalled", "TestFirstProgramming", "한글테스트", "PrevFrontPage"])
self.assertEquals (self.pageGather.GetPageNamesFromString (strings), ["TestFirstIn", "TestFi", "StringIn"])
strings = '''["Testing"] ["Testing The Program"] higu TestFirst twet'''
self.assertEquals (self.pageGather.GetPageNamesFromString (strings), ["Testing", "Testing The Program", "TestFirst"])
self.assertEquals (self.pageGather.IsHeadTagLine (strings), 1)
self.assertEquals (self.pageGather.IsHeadTagLine (strings), 0)
self.assertEquals (self.pageGather.RemoveHeadLine (strings), "testing.. -_-a\nfwe\n")
self.assertEquals (self.pageGather.GetWikiPage ("FrontPage"), '=== Reading ===\n' +
suite = unittest.makeSuite (WikiPageGatherTestCase, "test")
=== WikiPageGather.py ===
class WikiPageGather:
pageGather = WikiPageGather ()
- TeachYourselfProgrammingInTenYears . . . . 2 matches
프로그램을 쓰는 것.학습하는 최고의 방법은,실천에 의한 학습이다.보다 기술적으로 표현한다면, 「특정 영역에 있어 개인이 최대한의 퍼포먼스를 발휘하는 것은, 장기에 걸치는 경험이 있으면 자동적으로 실현된다고 하는 것이 아니고, 매우 경험을 쌓은 사람이어도, 향상하자고 하는 진지한 노력이 있기 때문에, 퍼포먼스는 늘어날 수 있다」(p. 366) 것이며, 「가장 효과적인 학습에 필요한 것은, 그 특정의 개인에게 있어 적당히 어렵고, 유익한 피드백이 있어, 게다가 반복하거나 잘못을 정정하거나 할 기회가 있는, 명확한 작업이다」(p. 20-21)의다(역주3).Cambridge University Press 로부터 나와 있는 J. Lave 의「Cognition in Practice: Mind, Mathematics, and Culture in Everyday Life」(역주4)라고 하는 책은, 이 관점에 대한 흥미로운 참고 문헌이다.
만약 그러한 있고 것이라면, 4년간 대학에서(혹은 대학원에 가, 더욱) 배우는 것.그러면 성적 증명서를 필요로 하는 일자리에 접근하고, 그 분야에 도착해보다 깊은 이해를 얻게 된다.하지만, 학교를 즐길 수 없다고 한다면, (열의가 있으면) 일을 하는 과정에서 같은 체험을 얻을 수 있다.어느 경우이든, 책에 의한 학습만으로는 충분하지 않다.「컴퓨터·사이언스의 교육으로 누군가를 프로의 프로그래머로 하려고 하는 것은, 브러쉬나 그림도구에 대해 배우게 해 프로의 화가로 하는 것 같은 정도 어렵다」라고 The New Hacker's Dictionary(역주5) 의 저자인 Eric Raymond 는 말한다.내가 지금까지 고용한 중에서 최고의 프로그래머의 한 명(역주6)은, 고등학교까지 밖에 나오지 않았다.그렇지만, 그는 많은훌륭한소프트웨어를 만들어, 지금은 자신의뉴스·그룹까지 가지고 있어, 스톡옵션 덕분에, 틀림없이 내가 일생 걸려 벌 수 있는 것보다 좀 더 부자다.
Lave, Jean, Cognition in Practice: Mind, Mathematics, and Culture in Everyday Life, Cambridge University Press, 1988.
* 역주 5 - ASCII BOOKS 로부터 「학카즈 대사전」(후쿠사키 타카히로역)로서 국역이 나와 있다.덧붙여 본문에 인용되고 있는 ESR 의 문장이 어느 문장으로부터의 인용인가는 몰랐다.본문에서는 ESR 는 The New Hacker's Dictionary 의 저자로서 이름을 들 수 있지만, 현재의 Jargon File 에는 해당 문장은 없었다.
- TellVsAsk . . . . 2 matches
Alec Sharp, in the recent book Smalltalk by Example [SHARP], points up a very valuable lesson in few words:
Procedural code gets information then makes decisions. Object-oriented code tells objects to do things.
''then 에서 than 이 되어야 하는 것이 아닐까요? 제가 원문을 못봐서 함부로 고치기는 힘들군요.''
''맞는 지적인데. 원문도 then 이군. 내가 해석을 than 으로 읽고 실수했네. Thanks.~''
That is, you should endeavor to tell objects what you want them to do; do not ask them questions about their state,
make a decision, and then tell them what to do.
The problem is that, as the caller, you should not be making decisions based on the state of the called object
that result in you then changing the state of the object. The logic you are implementing is probably the called object's
responsibility, not yours. For you to make decisions outside the object violates its encapsulation.
object and then calling different methods based on the results. But that may not be the best way to go about doing it. Tell the object
It is easier to stay out of this trap if you start by designing classes based on their responsibilities,
you can then progress naturally to specifying commands that the class may execute, as opposed to queries
that inform you as to the state of the object.
- TestSuiteExamples . . . . 2 matches
return unittest.defaultTestLoader.loadTestsFromNames( ('ThePackage.test_file1','ThePackage.subpack.test_file2'))
- TheGrandDinner/조현태 . . . . 2 matches
== TheGrandDinner/조현태 ==
bool DeSort(SNumberAndPosition one, SNumberAndPosition another)
return one.number > another.number;
[TheGrandDinner]
- TheKnightsOfTheRoundTable/김상섭 . . . . 2 matches
cout << "The radius of the round table is: 0.000" << endl;
cout << "The radius of the round table is: " << temp << endl;
- TheKnightsOfTheRoundTable/하기웅 . . . . 2 matches
cout << "The radius of the round table is: 0.000"<<endl;
cout << "The radius of the round table is: " << 1.0*sqrt(halfSum*(halfSum-a)*(halfSum-b)*(halfSum-c))/halfSum << endl;
- TheLargestSmallestBox/문보창 . . . . 2 matches
// 10215 - TheLagestSmallestBox
[TheLargestSmallestBox] [문보창]
- TheOthers . . . . 2 matches
PL 마지막 팀 프로젝트 "The Others"팀의 프로젝트 페이지
-- TheOthers
- ThePriestMathematician/문보창 . . . . 2 matches
// 10254 - The Priest Mathematician
[ThePriestMathematician]
- TheTrip/Leonardong . . . . 2 matches
class TheTripTestCase(unittest.TestCase):
[TheTrip], [AOI]
- TheTrip/문보창 . . . . 2 matches
// no10137 - The Trip
[TheTrip] [문보창]
- TheTrip/이승한 . . . . 2 matches
= TheTrip/이승한 =
[겨울과프로젝트] [AOI] [TheTrip]
- ToastOS . . . . 2 matches
The war was brief, but harsh. Rising from the south the mighty RISC OS users banded together in a show of defiance against the dominance of Toast OS. They came upon the Toast OS users who had grown fat and content in their squalid surroundings of Toast OS Town. But it was not to last long. Battling with SWIs and the mighty XScale sword, the Toast OS masses were soon quietened and on the 3rd November 2002, RISC OS was victorious. Scroll to the bottom for further information.
== And now... introducing the better alternative... RISC OS ==
RISC OS OWNS YOU ALL! http://www.hashriscos.org LET THE RISC OS VERSUS TOAST OS WAR COMMENCE!
Get the butter.. this could get messy
- ToyProblems . . . . 2 matches
ToyProblems를 풀게 하되 다음 방법을 이용한다. Seminar:TheParadigmsOfProgramming [http://www.jdl.ac.cn/turing/pdf/p455-floyd.pdf (pdf)]을 학습하게 하는 것이다.
* The Art and Craft of Problem Solving
- TugOfWar/강희경 . . . . 2 matches
def InputTheWeight(aN):
print MakeTwoTeams(InputTheWeight(InputPeopleNumber()))
- UML서적관련추천 . . . . 2 matches
수업시간에 나갈 때의 어찌 하다보니, 주된 스타일은 'All it together' 그리고 그 이후의 단계별 접근으로 진행이 되었습니다. 해당 단계들에 대해서 처음에는 전체적인 부분을 한꺼번에 진행하고, 그리고 각 단계들을 보게 되었습니다.
UML Distilled: A Brief Guide to the Standard Object Modeling Language,3rd Edition
The Unified Modeling Language User Guide 2/E
The Unified Modeling Language Reference Manual (2/E)
- UglyNumbers/곽세환 . . . . 2 matches
* 답은 ''The 1500'th ugly number is <숫자>.'' 형식이어야 한다.
cout << "The 1500'th ugly number is " << temp << "." << endl;
- UglyNumbers/남훈 . . . . 2 matches
print "The " + `goal` + "(st/nd/th) ugly number is " + `ugly2(goal)`
print "The " + `goal` + "(st/nd/th) ugly number is " + `ugly3(goal)`
- VMWare/OSImplementationTest . . . . 2 matches
[ORG 0x7C00] ; The BIOS loads the boot sector into memory location
lgdt [gdt_desc] ; Load the GDT descriptor
mov eax, cr0 ; Copy the contents of CR0 into EAX
mov cr0, eax ; Copy the contents of EAX into CR0
mov ds, ax ; Move a valid data segment into the data segment register
mov ss, ax ; Move a valid data segment into the stack segment register
mov esp, 090000h ; Move the stack pointer to 090000h
gdt: ; Address for the GDT
gdt_end: ; Used to calculate the size of the GDT
gdt_desc: ; The GDT descriptor
dd gdt ; Address of the GDT
times 510-($-$$) db 0 ; Fill up the file with zeros
- [Lovely]boy^_^/Diary/12Rest . . . . 2 matches
* I read a Programming Pearls Chapter 6 a little, because I can't understand very well--;. So I read Chapter 7,8,9,10 roughly. In my opinion, there is no very serious contents.
* The DInput's message priority is maybe so high... It's very very fast.--; I can't control it.
* I saw a very good sentence in 'The Fighting'. It's "Although you try very hard, It's no gurantee that you'll be success. But All succecssfull man have tried."
- [Lovely]boy^_^/Diary/2-2-16 . . . . 2 matches
* I completely destroy the marriage and family final-exam.--;
* I borrow the Role Playing Game with DirectX.
* I read a novel named the Brain all day. Today's reading amount is about 600 pages. It's not so interesting as much as the price of fame.
* '''When I am given a motive, I can do the things extreme.'''
* '''There is no man nicer than a man who has a target, and rushs towards it.'''
* I studied Grammar in Use Chapter 39,40. I have not done study this book since then summer.--;
* I read a little Power Reading. Today's reading's principle content is using a regulator(ex) pen, pinger. etc). but this method is what I have used all the time.--; I should read a lot more.
* I studied ProgrammingPearls chapter 3. When I was reading, I could find familiar book name - the Mythical Man Month, and Code Complete.
* '''The more general problem may be easier to solve.'''
* '''Keeping the code simple is usually the key to correctness.'''
- snowflower . . . . 2 matches
||[TheWarOfGenesis2R]||창세기전2 리메이크 프로젝트|| _ ||
||["SRPG제작"]||SRPG에 대한 대략적인 계획 - 현재는 ["TheWarOfGenesis2R"]과 함께|| _ ||
- 강희경/도서관 . . . . 2 matches
|| 4 || NoSmoke:TheArtOfComputerProgramming || 카누스 || [강희경] || [TAOCP] ||
|| 1 || NoSmoke:TheArtOfComputerProgramming || 카누스 || [강희경] || [TAOCP] ||
- 강희경/메모장 . . . . 2 matches
/*[[ The contents of score array ]]
printf("\n[[ The contents of score array ]]\n\n");
if 0.3 then 0.673899088
if 0.3000000001 then 0.076831721
theserverside.com
- 데블스캠프2006/목요일/winapi . . . . 2 matches
"The Hello Program", // window caption
"The Hello Program", // window caption
- 데블스캠프2009/목요일/연습문제/MFC/김태욱 . . . . 2 matches
// IDM_ABOUTBOX must be in the system command range.
// Set the icon for this dialog. The framework does this automatically
// when the application's main window is not a dialog
return TRUE; // return TRUE unless you set the focus to a control
// If you add a minimize button to your dialog, you will need the code below
// to draw the icon. For MFC applications using the document/view model,
// this is automatically done for you by the framework.
// Draw the icon
// The system calls this to obtain the cursor to display while the user drags
// the minimized window.
// TODO: If this is a RICHEDIT control, the control will not
// send this notification unless you override the CDialog::OnInitDialog()
// with the ENM_CHANGE flag ORed into the mask.
- 데블스캠프2009/목요일/연습문제/MFC/박준호 . . . . 2 matches
// IDM_ABOUTBOX must be in the system command range.
// Set the icon for this dialog. The framework does this automatically
// when the application's main window is not a dialog
return TRUE; // return TRUE unless you set the focus to a control
// If you add a minimize button to your dialog, you will need the code below
// to draw the icon. For MFC applications using the document/view model,
// this is automatically done for you by the framework.
// Draw the icon
// The system calls this to obtain the cursor to display while the user drags
// the minimized window.
- 데블스캠프2009/목요일/연습문제/MFC/송지원 . . . . 2 matches
// Microsoft Visual C++ will insert additional declarations immediately before the previous line.
// IDM_ABOUTBOX must be in the system command range.
// Set the icon for this dialog. The framework does this automatically
// when the application's main window is not a dialog
return TRUE; // return TRUE unless you set the focus to a control
// If you add a minimize button to your dialog, you will need the code below
// to draw the icon. For MFC applications using the document/view model,
// this is automatically done for you by the framework.
// Draw the icon
// The system calls this to obtain the cursor to display while the user drags
// the minimized window.
// TODO: If this is a RICHEDIT control, the control will not
// send this notification unless you override the CDialog::OnInitDialog()
// with the ENM_CHANGE flag ORed into the mask.
- 데블스캠프2009/목요일/연습문제/MFC/정종록 . . . . 2 matches
// IDM_ABOUTBOX must be in the system command range.
// Set the icon for this dialog. The framework does this automatically
// when the application's main window is not a dialog
return TRUE; // return TRUE unless you set the focus to a control
// If you add a minimize button to your dialog, you will need the code below
// to draw the icon. For MFC applications using the document/view model,
// this is automatically done for you by the framework.
// Draw the icon
// The system calls this to obtain the cursor to display while the user drags
// the minimized window.
// TODO: If this is a RICHEDIT control, the control will not
// send this notification unless you override the CDialog::OnInitDialog()
// with the ENM_CHANGE flag ORed into the mask.
- 무엇을공부할것인가 . . . . 2 matches
SeparationOfConcerns로 유명한 데이비드 파르나스(David L. Parnas)는 FocusOnFundamentals를 말합니다. (see also ["컴퓨터고전스터디"]) 최근 작고한 다익스트라(NoSmok:EdsgerDijkstra )는 수학과 언어적 능력을 말합니다. ''Besides a mathematical inclination, an exceptionally good mastery of one's native tongue is the most vital asset of a competent programmer. -- NoSmok:EdsgerDijkstra '' 참고로 다익스트라는 자기 밑에 학생을 받을 때에 전산학 전공자보다 수학 전공자에게 더 믿음이 간다고 합니다.
As for the job market, Python isn't among the buzzwords that you'll find in
job descriptions most of the time. But software development isn't that much
about particular technologies, the important part is learning concepts. If
There's a lot more concepts that you can learn while using Python, as you
Learn concepts, not tools. At least in the long run, this will make you
more attractive to employers who have a clue about what's important in the
There are some more skills that are especially important:
- Team work: dividing up tasks. Defining the interfaces up front to avoid
blocking other team members who wait for you. Using a source code control
the client or writing an email - I've had problems with this myself in
the past, I guess that's not an uncommon problem for developers.
- 미로찾기/영동 . . . . 2 matches
//Push the starting point into the stack
{//Is in the end point?
//Push the last movement to stack
{//The next position is available
cout<<"There is no path in maze\n";
{//Insert the element into the stack
{//Take the element from the stack
{//Is the stack empty?
{//Show the maze and current position
- 새싹교실/2012/열반 . . . . 2 matches
* The if selection statement랑The if...else selection statement배웠는데 잘모르겟어요..[김민규]
- 새싹교실/2013/케로로반/실습자료 . . . . 2 matches
Social Executive of Computer Science and Engineering will hold a bar event. There are many pretty girls and handsome guys. It will be great day for you. Just come to the bar event and drink. There are many side dishes and beer. Please enjoy the event. but DO NOT drink too much, or FBI will come to catch you. Thank you.
- 스터디/Nand 2 Tetris . . . . 2 matches
* A-Instruction : @value // Where value is either a non-negative decimal number or a symbol referring to such number.
* C-Instruction : dest=comp;jump // Either the dest or jump fields may be empty.
// If dest is empty, the "=" is omitted;
// if jump is empty, the ";" is omitted;
* The Hack Computer
The instruction memory and the data memory are physically separate
- 알고리즘8주숙제 . . . . 2 matches
Given the denominations of coins for a newly founded country, the Dairy Republic, and some monetary amount, find the smallest set of coins that sums to that amount. The Dairy Republic is guaranteed to have a 1 cent coin.
Give a greedy method, which is heuristic, to solve the 0/1 knapsack problem and also give an example to show that it does not always yield an optimal solution.
The kanpsack problem is defined as follows:
Give a greedy method to find an optimal solution of the knapsack problem and prove its correctness.
Consider the problem of scheduling n jobs on one machine. Describe an algorithm to find a schedule such that its average completion time is minimum. Prove the correctness of your algorithm.
alph 3 beta 7 theta 10 |}}
{{| alph beta theta
- 오페라의유령 . . . . 2 matches
소설이 먼저였지만, 개인적으로 Webber 와 Sarah 의 노래를 엄청나게 좋아하는 관계로. 소설을 읽는 내내 머릿속에서 Think of Me, The Music of Night, Wishing you were somehow here again 가 배경음악으로 깔리었다.
웨버아저씨에게 상상력을 선사해준 소설이란? 원작에 상관없이 자신스타일로 작품을 만들어내는 웨버아저씨여서 (그래봤자 본건 하나뿐이지만; 한편은 대본읽음). 개인적인 결론은 해당 소설로부터 자신의 주제의식을 뽑아낸 웨버아저씨 멋져요 이긴 하지만, 이 소설이 태어나지 않았더라면 Phantom of the opera 가 나타나지 않았을 것이란 생각이 들기에. (소설의 구성 등을 떠나서, Phantom 이라는 캐릭터를 볼때)
뮤지컬의 이미지때문인지 (한번도 안본 뮤지컬에 대해 이미지를 떠올리는것도 우스운 일이다. OST와 Sarah 의 뮤직비디오는 많이 보긴 했지만) 크리스틴을 볼때마다 사라아주머니의 젊었을때의 사진을 떠올렸고, Phantom 이 등장할때엔 그 Main Theme (Phantom 의 그 멋진 웃음소리와도 같게 들리는...) 를 떠올렸다.
* EBS 에선가 Joseph and the Amazing Technicolor Dreamcoat를 방영해줬던 기억이 난다. 성경에서의 요셉이야기를 이렇게 표현할 수 있을까; 형 왈 '아마 성경을 이렇게 가르친다면 교회에서 조는 사람들 없을꺼야;' 어떻게 보면 '아아 꿈많고 성공한 사람. 우리도 요셉처럼 성공하려면 꿈을 가져야해;' 이런식이였지만, 아주 신선했던 기억이 난다.
* 암튼 Phantom of the opera 에서 가장 멋진 목소리는 Phantom 이라 생각. 그리고 당근 Sarah 아주머니; Phantom 이라는 캐릭터 이미지가 맘에 들어서. 그리고 노래도.
* 소설에서의 Angle of the music 은 Phantom 을 이야기하는것 같은데, 왜 Webber 의 노래에선 크리스틴을 지칭할까.
- 위시리스트/130511 . . . . 2 matches
* 모기향: The Summer is Comming... - [권순의]
* The C# Programming Language (Fourth Edition) 한국어판 - [김민재]
- 정모/2011.7.18 . . . . 2 matches
* 해결이 안 된 PIGS와 The lazy programmer를 다같이 풀기로 함.
* Free talking과 Theme talking으로 나누어 진행.
- 지금그때/OpeningQuestion . . . . 2 matches
see Seminar:DontLetThemDecideYourLife, [http://zeropage.org/wiki/%C0%E7%B9%CC%C0%D6%B0%D4%B0%F8%BA%CE%C7%CF%B1%E2 재미있게공부하기]
NoSmok:피터드러커 교수의 [이노베이터의조건]나, TheNextSociery 를 보면, 지식 노동자와 지식 기술자의 정의가 있습니다. 고등학교때 배웠던 정보화 사회는 현재에서 이미 도래했습니다. 그는 책에서 대중적 직업을 크게 지식 기술자와 지식 노동자로 나뉩니다. 지식 기술자는 '''General 한 주제'''을 가지면서 '''한 주제에 특화된 능력'''을 가진 사람이고, 둘다 부족하거나, 한 주제에 전문가 인점을 빼면 지식 노동자로 구분합니다. 정보화 사회의 중기에는 이 두계층의 구분이 거의 없는 반면, 지식 직업들이 늘어나면서 이는 확연히 구분됩니다. 앞으로 더 심해 질것입니다.
- 최대공약수/조현태 . . . . 2 matches
cout << "The GCD of " << number_a << " and " << number_b << " is ";
cout << "The GCD of " << number_a << " and " << number_b << " is "<< get_GCM(number_a,number_b) << "\n";
- 페이지제목띄어쓰기토론 . . . . 2 matches
영문제목의 경우 대문자 단위로 붙여 쓰면 {{{~cpp (ex: TheWikiName) }}} 페이지 표시해줄때 {{{~cpp The Wiki Name}}} 식으로 알아서 띄어서 찍어준다. 하지만 한글제목의 경우는 지원하지 않는다.
- 프로그래밍언어와학습 . . . . 2 matches
The fatal metaphor of progress, which means leaving things behind us, has utterly obscured the real idea of growth, which means leaving things inside us.
--G. K. Chesterton (1874-1936), British author. Fancies Versus Fads, "The Romance of Rhyme" (1923).
- 황현/Objective-P . . . . 2 matches
+(int)tellMeTheTruth {
public static function tellMeTheTruth() {
- .bashrc . . . . 1 match
if [ -f /etc/bashrc ]; then
if [ -z ${DISPLAY:=""} ]; then
if [ -n "$DISPLAY" ]; then
if [ -x /usr/games/fortune ]; then
xtitle The $(basename $1|tr -d .[:digit:]) manual
if [ "$(gnuclient -batch -eval t 2>&-)" == "t" ]; then
if [ "$#" -gt 2 ]; then
if [ "$nf" != "$filename" ]; then
if [ "$#" -lt 1 ] || [ "$#" -gt 2 ]; then
if [ $# = 2 ]; then sig=$1 ; fi
then kill $sig $pid
if [ "${BASH_VERSION%.*}" \< "2.05" ]; then
# if we want an option, return the possible posix options
if [ -f makefile ]; then
elif [ -f Makefile ]; then
if [[ ${COMP_WORDS[i]} == -*f ]]; then
if [ -n "$2" ]; then gcmd='grep "^$2"' ; else gcmd=cat ; fi
# if we don't want to use *.mk, we can take out the cat and use
if [ $COMP_CWORD -eq 1 ] || [ "${prev:0:1}" = "-" ]; then
# get a list of processes (the first sed evaluation
- 1002/TPOCP . . . . 1 match
Seminar:ThePsychologyOfComputerProgramming 맡은 챕터 정리궁리중.
Variations in the programming task
What the programmer is trying to do
- 2002년도ACM문제샘플풀이/문제C . . . . 1 match
Means Ends Analysis라고 하는데 일반적인 문제 해결 기법 중 하나다. 하노이 탑 문제가 전형적인 예로 사용되지. 인지심리학 개론 서적을 찾아보면 잘 나와있다. 1975년도에 튜링상을 받은 앨런 뉴엘과 허버트 사이먼(''The Sciences of the Artificial''의 저자)이 정립했지. --JuNe
- 2011년독서모임 . . . . 1 match
* 이와 관련해서 외국 음악이랑 외국 영화에 나오는 한국에 대해 찾아보려 했는데요,, 급 귀차니즘 때문에 외국 음악에 나오는 한국 관련된 것만 찾았다는...; 뭐,, 그래서 찾은 것이 Gary Moore의 Murder in the skies 라는 노래인데, 이 노래는 1983년 9월 1일에 뉴욕에서 출발한 한국행 비행기가 소련의 영공에 침범 했나(? -_-;; 죄송;;) 그래서 소련의 전투기가 Kal기를 격추시키는 일이 발생하였는데, 그것을 내용으로 소련의 만행으로 무고한 사람들이 죽음을 당했다는 것을 비판한 노래라 소개 했었고, 또 하나 찾아봤었던게 Deftones의 Korea라는 노래인데... 알고보니까 그냥 노래 내용이 어떤 소녀에 대한 이야기인데 그 소녀의 이름이 한국인 성과 비슷해서 그냥 그렇게 썻다고 해서 패스했습니다.
* [송지원] - 선물 The Present
- 2012년독서모임 . . . . 1 match
* [박한기] - The Goal
- 2dInDirect3d/Chapter2 . . . . 1 match
== Present The Scene ==
- 3N 1/김상섭 . . . . 1 match
4358392 2006-02-24 00:56:30 Accepted 2.207 4360 28565 C++ 100 - The 3n + 1 problem
- 3N+1/김상섭 . . . . 1 match
4358392 2006-02-24 00:56:30 Accepted 2.207 4360 28565 C++ 100 - The 3n + 1 problem
- 3N+1Problem/문보창 . . . . 1 match
// no100 - The 3n+1 Problem
- 3학년강의교재/2002 . . . . 1 match
|| 데이터통신 || The Essential Guide to Wireless Communications Applications || Andy Dornan || Prentice-Hall ||
- ACM_ICPC/2012년스터디 . . . . 1 match
- Matroid Theory (이것도 꼭 알 필요는 없습니다)
- ACM_ICPC/2013년스터디 . . . . 1 match
* dynamic programming - [http://211.228.163.31/30stair/eating_together/eating_together.php?pname=eating_together 끼리끼리]
* [http://stackoverflow.com/questions/2631726/how-to-determine-the-longest-increasing-subsequence-using-dynamic-programming Time Complexity O(n log n) 의 Up Sequence]
* Consonants, Pogo, The Great Wall
then 겹침
- AcceleratedC++/Chapter11 . . . . 1 match
== 11.1 The Vec class ==
== 11.2 Implementing the Vec class ==
iterator data; // first element in the `Vec'
iterator avail; // (one past) the last element in the `Vec'
iterator limit; // (one past) the allocated memory
// allocate and initialize the underlying array
// destroy the elements in the array and free the memory
// destroy (in reverse order) the elements that were constructed
// return all the space that was allocated
// reset pointers to indicate that the `Vec' is empty again
// allocate new space and copy existing elements to the new space
// return the old space
// reset pointers to point to the newly allocated space
// free the array in the left-hand side
// copy elements from the right-hand to the left-hand side
// destroy (in reverse order) the elements that were constructed
// return all the space that was allocated
// reset pointers to indicate that the `Vec' is empty again
// allocate new space and copy existing elements to the new space
// return the old space
- AcceleratedC++/Chapter4 . . . . 1 match
=== 4.2.1 Keeping all of a student's data together ===
=== 4.2.3. Generating the report ===
== 4.3. Putting it all together ==
== 4.4. Partitioning the grading program ==
== 4.5. The revised grading program ==
- AcceleratedC++/Chapter9 . . . . 1 match
== 9.4 The Student_info class ==
// clear the stream so that input will work for the next student
== 9.6 Using the Student_info class ==
// read and store the data
// alphabetize the student records
// write the names and grades
cout << students[i].name() // this and the next line changed
- ActiveXDataObjects . . . . 1 match
{{|Microsoft ADO (ActiveX Data Objects) is a Component object model object for accessing data sources. It provides a layer between programming languages and databases, which allows a developer to write programs which access data, without knowing how the database is implemented. No knowledge of SQL is required to access a database when using ADO, although one can use ADO to execute arbitrary SQL commands. The disadvantage of this is that this introduces a dependency upon the database.
{{|In the newer programming framework of .NET, Microsoft also present an upgraded version of ADO called ADO.NET, its object structure is quite different from that of traditional ADO. But ADO.NET is still not quite popular and mature till now.
- Adapter . . . . 1 match
우리는 Tailored Adapter안에서 메세지를 해석을 위하여 해당 전용 메소드를 만들수 있다. 왜냐하면 디자인 시간에 Adapter와 Adaptee의 프로토콜을 알고 있기 때문이다. The Adapter class는 유일한 상황의 해석을 위해서 만들어 진다. 그리고 각각의 Adapter의 메소드는 Adaptee에 대한 알맞은 메세지들에 대하여 hard-codes(전용 함수 정도의 의미로 생각) 이다
- Ajax/GoogleWebToolkit . . . . 1 match
The Google Web Toolkit is a free toolkit by Google to develop AJAX applications in the Java programming language. GWT supports rapid client/server development and debugging in any Java IDE. In a subsequent deployment step, the GWT compiler translates a working Java application into equivalent JavaScript that programatically manipulates a web brower's HTML DOM using DHTML techniques. GWT emphasizes reusable, efficient solutions to recurring AJAX challenges, namely asynchronous remote procedure calls, history management, bookmarking, and cross-browser portability.
- AnalyzeMary . . . . 1 match
주변에서 남들과 비슷하게 일을 하는 듯 하면서 늘 더 나은 성과를 보이는 사람들이 있다. 대부분은 "메리에겐 뭔가 특별한 것이 있다"(There is something about Mary) 수준의 감탄사를 외치는 데에서 끝난다. 그러면서 나는 왜 그들처럼 될 수 없을까 한탄하고, 곧 까맣게 잊는다.
- Athena . . . . 1 match
|| http://zeropage.org/~mulli2/Athena/Logo.bmp ||
DeleteMe 이름은 좋습니다. 하지만 ["Athena"] 라는 이름의 페이지에는 여신 아테나에 대한 정의와 소개가 들어 있는 것이 올바른 것이겠지요. 그래서 ["ProjectPrometheus"], ["ProjectZephyrus"] 라고 한거랍니다. ;; --["neocoin"]
* 5.6.2 Thereshold
- BarMacro . . . . 1 match
The statement:
We use it in conjunction with the [DueDate Macro] like this:
- Basic알고리즘 . . . . 1 match
{{| " 그래서 우리는 컴퓨터 프로그래밍을 하나의 예술로 생각한다. 그것은 그 안에 세상에 대한 지식이 축적되어 있기 때문이고, 기술(skill) 과 독창성(ingenuity)을 요구하기 때문이고 그리고 아름다움의 대상(objects of beauty)을 창조하기 때문이다. 어렴풋하게나마 자신을 예술가(artist)라고 의식하는 프로그래머는 스스로 하는 일을 진정으로 즐길 것이며, 또한 남보다 더 훌륭한 작품을 내놓을 것이다. |}} - The Art Of Computer Programming(Addison- wesley,1997)
- BaysianFiltering . . . . 1 match
그리고 PatternClassification 관련한 여러 알고리즘에도 BayesTheory 를 기본으로 하는게 상당히 많다.
- BigBang . . . . 1 match
* [http://thenine.egloos.com/430823 main 함수의 리턴값]
* 참고 : http://www.hackerschool.org/HS_Boards/data/Lib_system/The_Mystery_of_Format_String_Exploitation.pdf
- BookShelf . . . . 1 match
1. [TheElementsOfStyle] 4e
- BusSimulation . . . . 1 match
Discrete Event Simulation이 되겠군요. 사람이 몇 명이 기다리느냐, 길 막힘 상태 등은 이산 확률 분포를 사용하면 될 것입니다. NoSmok:TheArtOfComputerProgramming 에서 NoSmok:DonaldKnuth 가 자기 학교 수학과 건물 엘레베이터를 몇 시간 관찰해서 데이타를 수집한 것과 비슷하게 학생들이 직접 84번, 85-1번 등의 버스를 타고 다니면서 자료 수집을 해서 그걸 시뮬레이션 실험하면 아주 많은 공부가 될 것입니다 -- 특히, 어떻게 실세계를 컴퓨터로 옮기느냐 등의 모델링 문제에 관해. 실제로 NoSmok:DonaldKnuth 는 TAOCP에서 이런 연습문제를 만들어 놨습니다. 제가 학부생 때 누군가 이런 숙제를 내줬다면 아마 한 두 계단(see also ["축적과변화"]) 올라설 계기가 되지 않았을까 하고 아쉬울 때가 있습니다. 이 문제에 드는 시간은 하루나 이틀 정도가 되겠지만 여기서 얻은 경험과 지혜는 십 년도 넘게 자신의 프로그래밍 인생에 도움이 될 것이라 믿어 의심치 않습니다. (팀으로 문제 해결을 하면 더 많은 공부가 되겠지요) see also ProgrammingPartyAfterwords 참고자료 --JuNe
- C++Analysis . . . . 1 match
* The C++ Programming Language Special Edition
- C++Seminar03/SimpleCurriculum . . . . 1 match
* 강의주제 : {{{~cpp The Little Man Computer}}}, 프로그래밍 개론
- C99표준에추가된C언어의엄청좋은기능 . . . . 1 match
The new variable-length array (VLA) feature is partially available. Simple VLAs will work. However, this is a pure coincidence; in fact, GNU C has its own variable-length array support. As a result, while simple code using variable-length arrays will work, a lot of code will run into the differences between the older GNU C support for VLAs and the C99 definition. Declare arrays whose length is a local variable, but don't try to go much further.
- CMM . . . . 1 match
* Wiki:XpAndTheCmm
- CarmichaelNumbers/조현태 . . . . 1 match
printf("The number %d is a Carmichael number.\n",number);
- CauGlobal/Interview . . . . 1 match
* 수업이 한국에서와의 다른점은? ( ex Theory 위주인지? Practical 위주인지? )
- CheckTheCheck/곽세환 . . . . 1 match
[CheckTheCheck]
- CheckTheCheck/문보창 . . . . 1 match
// no10196 - Check the Check
[CheckTheCheck] [문보창]
- Classes . . . . 1 match
[http://www.yes24.com/Goods/FTGoodsView.aspx?goodsNo=1949638&CategoryNumber=002001026004 Advanced Engineering Mathematics 9/E]
[http://www.xper.org/wiki/seminar/TheDragonBook]
[http://ocw.mit.edu/OcwWeb/Mathematics/18-06Spring-2005/CourseHome/index.htm Linear Algebra]
[http://kangcom.com/common/bookinfo/bookinfo.asp?sku=200302180005 Understanding the Linux Kernel (2nd Edition)]
- ClassifyByAnagram/김재우 . . . . 1 match
/// The main entry point for the application.
- CleanCode . . . . 1 match
* [http://oddpoet.net/blog/2010/08/02/a-new-look-at-test-driven-development-kr/ BDD, Given/When/Then]
var array = stringObject.match(/regexp/); // if there is no match, then the function returns null, if not returns array.
var array = stringObject.match(/regexp/) || []; // if the function returns null, then substitute empty array.
- CompilerTheory/ManBoyTest . . . . 1 match
if k <= 0 then A := x4 + x5 else B
[CompilerTheory]
- ConstructorMethod . . . . 1 match
static Point* makeFromRnTheta(int r, int theta)
return makeFromXnY(r*cos(theta),r*sin(theta));
- CuttingSticks/김상섭 . . . . 1 match
cout << "The minimum cutting is " <<store[0][tokennum] << ".\n";
- CuttingSticks/문보창 . . . . 1 match
cout << "The minimum cutting is " << result << ".\n";
- CuttingSticks/하기웅 . . . . 1 match
cout << "The minimum cutting is "<<calculate()<<"."<<endl;
- DebuggingSeminar_2005/DebugCRT . . . . 1 match
// include crtdbg.h after all other headers.
//turn on the full heap checking
참조) [http://zeropage.org/wiki/AcceleratedC_2b_2b_2fChapter11#line287 The rule of Three]
- DirectDraw/DDUtil . . . . 1 match
["TheWarOfGenesis2R"]페이지의 개설에 따라 사용법을 모읍니다.
- DocumentObjectModel . . . . 1 match
Document Object Model (DOM) is an application programming interface to access HTML and XML documents. It is programming language and platform independent. Behind the interface the document is represented with an object-oriented model.
Different variants of DOMs were initially implemented by web browsers to manipulate elements in an HTML document. This prompted the World Wide Web Consortium (W3C) to come up with a series of standard specifications for DOM (hence called W3CDOM).
DOM puts no restrictions on the document's underlying data structure. A well-structured document can take the tree form using DOM.
Most XML parsers (e.g., Xerces) and XSL processors (e.g., Xalan) have been developed to make use of the tree structure. Such an implementation requires that the entire content of a document be parsed and stored in memory. Hence, DOM is best used for applications where the document elements have to be randomly accessed and manipulated. For XML-based applications which involve a one-time selective read/write per parse, DOM presents a considerable overhead on memory. The SAX model is advantageous in such a case in terms of speed and memory consumption.
- EightQueenProblem/용쟁호투 . . . . 1 match
$PBExportHeader$eightqueenproblem.sra
IF il_limit >= 30000 THEN
If wf_chack_attack(li_x, li_y) Then CONTINUE;
IF il_attack[ai_x,ai_y] = 1 THEN RETURN TRUE
IF li_x > li_y THEN
ELSEIF li_x < li_y THEN
IF li_x > li_y THEN
ELSEIF li_x < li_y THEN
IF NOT wf_create_queen() THEN GOTO NS
- Emacs . . . . 1 match
;; *This enalbes the database and idle repasitiory
=== color-theme plugin ===
emacs 배경색, 글자색 theme를 제공하는 플러그인이다.
emacs wiki에 color-theme 라고 검색하면 압축파일이 제공된다.
emacs 설정파일이 있는 디렉토리에 color-theme압축파일의 압축을 푼다.
;;Color Theme plugin load
(add-to-list 'load-path "color theme 폴더 경로를 적어준다.")
(require 'color-theme)
(eval-after-load "color-theme"
(color-theme-initialize)
(color-theme-hober)))
- English Speaking/The Simpsons/S01E04 . . . . 1 match
= There's no disgrace like home =
Homer : Another beer, Moe.
Moe : What's-a matter, Homer? Bloodiest fight of the year.
You're sitting there like a thirsty bump on a log.
who's been terrorizing the neighborhood.
Let the nice people enjoy their beers.
Ah, don't worry. This dog has the scent.
Homer : You can't talk that way about my kids! Or at least two of them.
- EnglishSpeaking/TheSimpsons . . . . 1 match
[[pagelist(^EnglishSpeaking/TheSimpsons/S01)]]
- EnglishSpeaking/TheSimpsons/S01E01 . . . . 1 match
Marge : Hmm. I get the feeling there's something you haven't told me, Homer.
Marge : You tell me that all the time.
Homer : Well, I would- I- I wanna do the Christmas shopping this year.
[EnglishSpeaking/TheSimpsons]
- EnglishSpeaking/TheSimpsons/S01E02 . . . . 1 match
= Bart the Genius =
Homer : Hmm. How could anyone make a word out of these lousy letters?
Marge : We could look this "id" thing up in the dictionary.
Marge : I think it's under the short leg of the couch.
Lisa : "Id: Along with the ego and the superego
one of three components of the psyche."
Bart : Uh-oh. Kwyjibo on the loose.
[EnglishSpeaking/TheSimpsons]
- EnglishSpeaking/TheSimpsons/S01E03 . . . . 1 match
Lisa : Here's a good job at the fireworks factory.
Lisa : How 'bout this? Supervising technician at the toxic waste dump.
Marge : There, there, Homer. You'll find a job.
- EnglishSpeaking/TheSimpsons/S01E04 . . . . 1 match
= There's no disgrace like home =
Homer : Another beer, Moe.
Moe : What's-a matter, Homer? Bloodiest fight of the year.
You're sitting there like a thirsty bump on a log.
who's been terrorizing the neighborhood.
Let the nice people enjoy their beers.
Ah, don't worry. This dog has the scent.
Homer : You can't talk that way about my kids! Or at least two of them.
- ExploringWorld/20040308-시간여행 . . . . 1 match
집으로 돌아와 MakeAnotherWorld 라는 세상을 만든다는 거창한 은유법보다, 여행을 한다는 느낌의 은유로 시작하면 재미있겠다는 생각이 들었다. 그래서 WalkingAroundWorld 나, CyclingWorld 같은 여행이라는 은유의 제목이 더 그럴싸한것 같은데, 너희들은 어때? --NeoCoin
탐험하는것은 어때요? Exploring(The)World 같은... --세환
- ExtremeProgramming . . . . 1 match
* ThePlanningGame: 개발자는 UserStory들에 대해서 구현, 예측, 지시들에 대해 토론한다.
- ExtremeProgrammingExplained . . . . 1 match
ExtremeProgramming 의 철학을 소개한 서적. 저자 KentBeck. TheThreeExtremos 중 한명. 얼마전에 2판이 나왔다.
- FooBarBaz . . . . 1 match
* ''Baz! The return key on my keyboard is stuck!''
- FromDuskTillDawn/변형진 . . . . 1 match
else echo "There is no route Vladimir can take.<br>";
- FromDuskTillDawn/조현태 . . . . 1 match
cout << "There is no route Vladimir can take." << endl;
- Functor . . . . 1 match
A function object, often called a functor, is a computer programming construct allowing an object to be invoked or called as if it were an ordinary function, usually with the same syntax. The exact meaning may vary among programming languages. A functor used in this manner in computing bears little relation to the term functor as used in the mathematical field of category theory.
- GTK+ . . . . 1 match
GTK+ is free software and part of the GNU Project. However, the licensing terms for GTK+, the GNU LGPL, allow it to be used by all developers, including those developing proprietary software, without any license fees or royalties.
GTK+ is based on three libraries developed by the GTK+ team:
GLib is the low-level core library that forms the basis of GTK+ and GNOME. It provides data structure handling for C, portability wrappers, and interfaces for such runtime functionality as an event loop, threads, dynamic loading, and an object system.
Pango is a library for layout and rendering of text, with an emphasis on internationalization. It forms the core of text and font handling for GTK+-2.0.
The ATK library provides a set of interfaces for accessibility. By supporting the ATK interfaces, an application or toolkit can be used with such tools as screen readers, magnifiers, and alternative input devices.
GTK+ has been designed from the ground up to support a range of languages, not only C/C++. Using GTK+ from languages such as Perl and Python (especially in combination with the Glade GUI builder) provides an effective method of rapid application development.
- Gof/Command . . . . 1 match
Command Pattern은 request 를 객체화함으로서 toolkit 객체로 하여금 불특정한 어플리케이션 객체에 대한 request를 만들게 한다. 이 객체는 다른 객체처럼 저장될 수 있으며 pass around 가능하다. 이 pattern의 key는 수행할 명령어에 대한 인터페이스를 선언하는 추상 Command class에 있다. 이 인터페이스의 가장 단순한 형태에서는 추상적인 Execute operation을 포함한다. 구체화된 Command subclass들은 request에 대한 receiver를 instance 변수로 저장하고 request를 invoke하기 위한 Execute operation을 구현함으로서 receiver-action 짝을 구체화시킨다. The receiver has the knowledge required to carry out the request.
- Gof/Composite . . . . 1 match
cout << "The net price is " << chassis->NetPrice () << endl;
Another subclass, RegisterTransferSet, is a Composite class for representing assignments that change several registers at once.
Another example of this pattern occurs in the financial domain, where a portfolio aggregates individual assets. You can support complex aggregations of assets by implementing a portfolio as a Composite that conforms to the interface of an individual asset [BE93].
* FlyweightPattern lets you share components, but they can no longer refer to their parents.
- Gof/Singleton . . . . 1 match
Smalltalk에서 unique instance를 리턴하는 functiond은 Singleton 클래스의 class method로 구현된다. 단일 인스턴스가 만들어지는 것을 보장하기 위해서 new operation을 override한다. The resulting Singleton class might have the following two class methods, where SoleInstance is a class variable that is not used anywhere else:
// Lookup returns 0 if there's no such singleton
static MySingleton theSingleton;
// ... other possible subclasses
POSITION position = m_ContainerOfSingleton->GetHeadPosition();
- Gof/Strategy . . . . 1 match
// prepare the arrays with the desired component sizes
// determine where the breaks are:
* The Booch components - template arguments. - memory allocation strategies.
- GotoStatementConsideredHarmful . . . . 1 match
SeeAlso : PPR:GotoConsideredTheBestProgrammingPracticeEverInvented PPR:GotoStillConsideredHarmful PPR:GotoConsideredHarmful
- Hacking/20041028두번째모임 . . . . 1 match
[http://khdp.org/docs/trans_doc/phrack-51-11.txt Phrack 51호 The art of scanning 번역]
- HelloWorld . . . . 1 match
프로그래밍의 첫걸음으로 HelloWorld를 출력하는 관습은 1978년에 출판된, 브라이언 커니핸과 데니스 리치가 쓴 "The C Programming Language"라는 책에서 비롯되었다.
- HelpIndex . . . . 1 match
The following is a list of all help pages:
- IntelliJ . . . . 1 match
4. Checkout - 이는 CVSROOT의 modules 에 등록된 project 들만 가능하다. CVS 관리자는 CVSROOT 의 modules 화일에 해당 프로젝트 디렉토리를 추가해준다.([http://cvsbook.red-bean.com/cvsbook.html#The_modules_File module file]) 그러면 IntelliJ 에 있는 CVS의 Checkout 에서 module 을 선택할 수 있다. Checkout 한다.
- JUnit/Ecliipse . . . . 1 match
Example 3-1. The Ch03_01.java
- JavaStudy2002/세연-2주차 . . . . 1 match
void isTheGameFinished(){
- KnowledgeManagement . . . . 1 match
* Theoretical
- LIB_1 . . . . 1 match
// Show the task delay , usage and
// create The Sample Task 1,2
- Lines In The Plane . . . . 1 match
==== Recurrent Problems - Lines In The Plane ====
What is the maximum number L<sub>n</sub> of regions defined by lines("unfolding" or "unwinding") in the plane?
===== mathematical expression =====
- LinkedList/영동 . . . . 1 match
int enterData(); //Function which enter the data of node
void displayList(Node * argNode); //Function which displays the elements of linked list
Node * firstAddress=new Node(enterData());//Create the first address to linked list
Node * currentNode;//Create temporary node which indicates the last node of linked list
//Create the next node to linked list
else //Go to the next node if there is next node
int enterData(); //Function which enter the data of node
void displayList(Node * argNode); //Function which displays the elements of linked list
Node * reverseList(Node * argNode);//Function which reverses the sequence of the list
void eraseLastNode(Node * argNode, Node ** argFreeNode, int * argNumberOfList, int * argNumberOfFreeSpace);//Function which deletes the last node of the list
void getNode(Node * argNode, Node ** argFreeNode, int * argNumberOfList, int * argNumberOfFreeSpace);//Function which takes the node from free space list
Node * firstAddress=new Node(enterData());//Create the first address to linked list
Node * currentNode;//Create temporary node which indicates the last node of linked list
//Create the next node to linked list
displayList(firstAddress);//Display the linked list with modified data
displayList(firstAddress);//Display the linked list with data which are taken from free space list
displayList(freeSpaceList);//Display the empty free space list
cout<<"Sorry... There is no node to display.\n";
else //Go to the next node if there is next node
cout<<"Please input the data to the node.";
- LinuxSystemClass . . . . 1 match
학교 수업공부를 하거나 레포트를 쓰는 경우 위의 학교 교재와 함께 'The Design of the Unix Operating System' 을 같이 보면 도움이 많이 된다. 해당 알고리즘들에 대해서 좀 더 구체적으로 서술되어있다. 단, 책이 좀 오래된 감이 있다.
- LispLanguage . . . . 1 match
* For the beginners:
[http://www.peter-herth.de/ltk/ The Lisp Toolkit]
* Common Lisp the Language, 2nd Edition by Guy L. Steele Jr. : 역시 책이라서 체계적으로 잘 나와 있다.
- MajorMap . . . . 1 match
== Instructions:language of the Computer ==
InstructionSetArchtecture(ISA) is an abstract interface between the hardware and the lowest-level sogtware. Also called simply architecture.
Registers are a limited number of special locations built directly in hardware. On major differnce between the variables of a programming language and registers is the limited number of registers, typically 32(64?) on current computers.
Memory is the storage area in which programs are kept when they are runngin and that contains the data needed by the running programs. Address is a value used to delineate the location of a specific data element within a memory array.
ALU is is a part of the execution unit, a core component of all CPUs. ALUs are capable of calculating the results of a wide variety of basic arithmetical computations such as integer and floating point arithmetic operation(addition, subtraction, multiplication, and division), bitwise logic operation, and bit shitf operation. Therefore the inputs to the ALU are the data to be operated on (called operands) and a code from the control unit indicating which operation to perform. Its output is the result of the computation.--from [http://en.wikipedia.org/wiki/ALU]
Two's complement is the most popular method of representing signed integers in computer science. It is also an operation of negation (converting positive to negative numbers or vice versa) in computers which represent negative numbers using two's complement. Its use is ubiquitous today because it doesn't require the addition and subtraction circuitry to examine the signs of the operands to determine whether to add or subtract, making it both simpler to implement and capable of easily handling higher precision arithmetic. Also, 0 has only a single representation, obviating the subtleties associated with negative zero (which is a problem in one's complement). --from [http://en.wikipedia.org/wiki/Two's_complement]
- Memo . . . . 1 match
self.conn.send("I'm the Boss")
printf( "I have to answer the next question. %sn", question);
printf( "I sent an answer. The answer is %srn", msg);
theCompany = HanguryeNewsCompany(reporter)
theCompany.correctNews("He is still alive")
self.assertEquals( reporter.news, theCompany.news )
anotherReporter = Reporter()
anotherReporter.collectNews( "She.." )
company.hire( anotherReporter )
anotherReporter.notify()
- Metaphor . . . . 1 match
Choose a system metaphor to keep the team on the same page by naming classes and methods consistently. What you name your objects is very important for understanding the overall design of the system and code reuse as well. Being able to guess at what something might be named if it already existed and being right is a real time saver. Choose a system of names for your objects that everyone can relate to without specific, hard to earn knowledge about the system. For example the Chrysler payroll system was built as a production line. At Ford car sales were structured as a bill of materials. There is also a metaphor known as the naive metaphor which is based on your domain itself. But don't choose the naive metaphor unless it is simple enough.
- MoinMoin . . . . 1 match
"Moin" meaning "Good Morning", and "MoinMoin" being an emphasis, i.e. "A ''Very'' Good Morning". The name was obviously chosen for its WikiWikiNess.
''No! Originally "MoinMoin" does '''not''' mean "Good Morning". "Moin" just means "good" or "nice" and in northern Germany it is used at any daytime, so "Good day" seems more appropriate.'' --MarkoSchulz
Mmmmh , seems that I can enrich so more info: "Moin" has the meaning of "Good Morning" but it is spoken under murmur like "mornin'" although the Syllable is too short alone, so it is spoken twice. If you shorten "Good Morning" with "morn'" it has the same effect with "morn'morn'". --Thomas Albl
We use it all day in the south too. I always thought it just morphed from a morning greeting to an all-day one. -- J
- MoinMoinDiscussion . . . . 1 match
Talk about the things on MoinMoinTodo and MoinMoinIdeas in this space...
'''A''': See the {{{~cpp [[Icon]]}}} macro; besides that, fully qualified URLs to the wiki server work, too.
* '''R''': The Icon macro worked well. I wanted to avoid the fully qualified URL because to access the Wiki in question requires password authentication. Including an image using the full URL caused my webserver (Apache 1.3.19) to reprompt for authentication whenever the page was viewed or re-edited. Perhaps a default {{{~cpp [[Image]]}}} macro could be added to the distribution (essentially identical to {{{~cpp [[Icon]]}}} ) which isn't relative to the data/img directory. (!) I've actually been thinking about trying to cook up my own "upload image" (or upload attachment) macro. I need to familiarize myself with the MoinMoin source first, but would others find this useful?
* '''Note:''' Regarding the upload feature - pls note that the PikiePikie also implemented in Python already has this feature, see http://pikie.darktech.org/cgi/pikie?UploadImage ... so I guess you could borrow some code from there :) -- J
- MoinMoinMailingLists . . . . 1 match
There are two mailing lists for MoinMoin:
- MoinMoinWikis . . . . 1 match
* [http://www.bioinformatics.org/piperwiki/moin.cgi Wiki for the Piper project]
* [http://compsoc.dur.ac.uk/~tsp/cgi-bin/triki.cgi TrikiWiki] (private wiki for the Transformers holiday - uses a mildly hacked MoinMoin)
* [http://lightingwiki.com/FrontPage The Lighting Wiki]
For more wikis, see the InterWiki list.
- MoniWikiOptions . . . . 1 match
`'''$theme='테마이름';'''`
* 테마를 지정한다. See also MoniWikiTheme
`'''$theme_css'''`
* 기본 css의 경로를 설정한다. 기본값은 `$url_prefix.'/css/default.css'` $theme를 설정한 경우는 이 값이 자동 설정된다.
- MoreEffectiveC++/Basic . . . . 1 match
Pointers use the "*" and "->" operators, references use "." [[BR]]
'''*(array+ ( i *sizeof(an object in the array) )''' [[BR]]
for( int i = the number of elements in the array -1; i>0; --i)
* '''첫번째 문제는 해당 클래스를 이용하여 배열을 생성 할때이다. . ( The first is the creation of arrays )'''
- MoreEffectiveC++/Efficiency . . . . 1 match
== Item 16:Remember the 80-20 rule. ==
첫번째 operator[]는 문자열을 읽는 부분이다,하지만 두번째 operator[]는 쓰기를 수행하는 기능을 호출하는 부분이다. 여기에서 '''읽기와 쓰기를 구분'''할수 있어야 한다.(distinguish the read all from the write) 왜냐하면 읽기는 refernce-counting 구현 문자열로서 자원(실행시간 역시) 지불 비용이 낮고, 아마 저렇게 스트링의 쓰기는 새로운 복사본을 만들기 위해서 쓰기에 앞서 문자열 값을 조각내어야 하는 작업이 필요할 것이다.
== Item 18: Amortize the cose of expected computations. ==
이번 아이템에서의 나의 충고-caching과 prefetching을 통해서 over-eager의 전략으로 예상되는 값들의 미리 계산 시키는것-은 결코 item 17의 lazy evaluation(늦은 계산)과 반대의 개념이 아니다. lazy evaluation의 기술은 당신이 항상 필요하기 않은 어떠한 결과에대한 연산을 반드시 수행해야만 할때 프로그램의 효율성을 높이기 위한 기술이다. over-eager evaluation은 당신이 거의 항상 하는 계산의 결과 값이 필요할때 프로그램의 효율을 높여 줄것이다. 양쪽 모두다 eager evaluation(즉시 계산)의 run-of-the-mill(실행의 비용) 적용에 비해서 사용이 더 어렵다. 그렇지만 둘다 프로그램 많은 노력으로 적용하면 뚜렷한 성능 샹항을 보일수 있다.
== Item 19:Understand the orgin of temporary objects. ==
cout << "There are " << countChar(buffer, c)
<< " occurrences of the charcter " << c
임시 객체의 밑바탕의 생각은 비용이 발생하다. 이다. 그래서 당신은 가능한한 그것을 없애기를 원할 것이다. 하지만 이보다 더 중요한 것은, 이러한 임시 객체의 발생에 부분에 대한 통찰력을 기르는 것이다. reference-to-const(상수참조)를 사용한때는 임시 객체가 인자로 전달될수 있는 가능성이 존재 하는 것이다. 그리고 객체로 함수 값을 반환 할때는 임시 인자(temporary)는 아마도 만들어질것이다.(그리고 파괴되어 진다.) 그러한 생성에 대해 예측하고, 당신이 "behind the scences"(보이지 않는 부분) 에서의 컴파일러가 지불하는 비용에 대한 눈을 배워야 한다.
== Item 20: Facilitate the return value optimization ==
== Item 24: Understand the costs of virtual functions, multiple ingeritance, virtual base classes, and RTTI ==
- MoreEffectiveC++/Techniques2of3 . . . . 1 match
// if we're sharing a value with other String objects,
// break off a separate copy of the value for ourselves
=== Putting it All Together : 지금까지의 방법론 정리 ===
* '''Object values are expensive to create or destroy, or they use lots of memory.'''
String& theString; // 프록시에서 문자열을 참조할 경우가 필요할시
: theString(str), charIndex(index) {}
return theString.value->data[charIndex];
if (theString.value->isShared()) {
theString.value = new StringValue(theString.value->data);
theString.value->data[charIndex]
= rhs.theString.value->data[rhs.charIndex];
The second CharProxy assignment operator is almost identical: ¤ Item M30, P58
if (theString.value->isShared()) {
theString.value = new StringValue(theString.value->data);
theString.value->data[charIndex] = c;
return &(theString.value->data[charIndex]);
if (theString.value->isShared()) {
theString.value = new StringValue(theString.value->data);
theString.value->markUnshareable();
return &(theString.value->data[charIndex]);
- MoreMFC . . . . 1 match
Create (NULL, _T ("The Hello Application"));
- MySQL . . . . 1 match
위의 PHP 버전은 어떻게 만들었을까? 바로.. MySQL 코드를 보고 만들었다고 한다.- UseTheSourceLuke --[1002]
- MythicalManMonth . . . . 1 match
This simple rule, consistently applied, would, within two years, double the
See Also Moa:TheMythicalManMonth, Moa:ConceptualIntegrity , ["성당과시장"]
- NSIS/예제1 . . . . 1 match
; The text to prompt the user to enter a directory
DirText "This will install the very simple example1 on your computer. Choose a directory"
Section "ThisNameIsIgnoredSoWhyBother?"
DirText: "This will install the very simple example1 on your computer. Choose a directory" "" ""
Section: "ThisNameIsIgnoredSoWhyBother?"
- NumberBaseballGame/jeppy . . . . 1 match
printf("You lose~\nThe answer is %c%c%c", hidden_num[0], hidden_num[1], hidden_num[2]);
- OOP . . . . 1 match
Object-oriented programming is based in the principle of recursive design.
2. Objects perform computation by making requests of each other through the passing of messages.
3. Every object has it's own memory, which consists of other objects.
5. The class is the repository for behabior associated with an object.
Program consists of objects interacting with eachother Objects provide services.
- ObjectOrientedDatabaseManagementSystem . . . . 1 match
Malcolm Atkinson을 비롯한 여러 사람들이 그들의 영향력 있는 논문인 The Object-Oriented Database Manifesto에서, OODBMS에 대해 다음과 같이 정의하였다.
- ObjectOrientedProgramming . . . . 1 match
Object-oriented programming is based in the principle of recursive design.
2. Objects perform computation by making requests of each other through the passing of messages.
3. Every object has it's own memory, which consists of other objects.
5. The class is the repository for behabior associated with an object.
- OurMajorLangIsCAndCPlusPlus/string.h . . . . 1 match
|| void * memmove(void * dest, const void * scr, size_t count) || Moves one buffer to another. ||
|| char * strncpy(char * strDestination, const char * strSource, size_t count) || Copy characters of one string to another ||
|| int strcmpi(const char *stirng1, const char *string2) || Compares two strings to determine if they are the same. The comparison is not case-sensitive. ||
|| size_t strlen(const char *string) || Get the length of a string. ||
|| char * strrchr(const char *string, int c) || Scan a string for the last occurrence of a character. ||
|| size_t strspn(const char *string, const char *strCharSet) || Find the first substring. 포함개수?||
|| char * strtok(char *strToken, const char *strDelimit) || Find the next token in a string. ||
- PairProgramming토론 . . . . 1 match
Strengthening the Case for Pair-Programming(Laurie Williams, ...)만 읽어보고 쓰는 글입니다. 위에 있는 왕도사와 왕초보 사이에서 Pair-Programming을 하는 경우 생각만큼 좋은 성과를 거둘 수 없을 것이라고 생각합니다. 문서에서는 Pair-Programming에서 가장 중요한 것을 pair-analysis와 pair-design이라고 보고 말하고 있습니다.(좀 큰 프로젝트를 해 본 사람이라면 당연히 가장 중요하다고 느끼실 수 있을 것입니다.) 물론 pair-implementation도 중요하다고는 말하고 있으나 앞서 언급한 두가지에 비하면 택도 없지요. 그러니 왕도사와 왕초보와의 결합은 아주 미미한 수준의 이점만 있을뿐 실제 Pair-Programming이 주창하는 Performance는 낼 수 없다고 생각됩니다. 더군다가 이 경우는 왕도사의 Performance에 영향을 주어 Time dependent job의 경우 오히려 손실을 가져오지 않을까 생각이 됩니다. Performance보다는 왕초보를 왕도사로 만들기 위한 목적이라면 왕초보와 왕도사와의 Pair-Programming이 약간의 도움이 되기는 할 것 같습니다. 그러나 우리가 현재 하는 방식에 비해서 얼마나 효율이 있을까는 제고해봐야 할 것 같습니다. - 김수영
제가 여러번 강조했다시피 넓게 보는 안목이 필요합니다. 제가 쓴 http://c2.com/cgi/wiki?RecordYourCommunicationInTheCode 나 http://c2.com/cgi/wiki?DialogueWhilePairProgramming 를 읽어보세요. 그리고 사실 정말 왕초보는 어떤 방법론, 어떤 프로젝트에도 팀에게 이득이 되지 않습니다. 하지만 이 왕초보를 쓰지 않으면 프로젝트가 망하는 (아주 희귀하고 괴로운) 상황에서 XP가 가장 효율적이 될 수 있다고 봅니다.
pair-anaysis와 pair-design의 중요성을 문서에서는 ''"Unanimously, pair-programmers agree that pair-analysis and pair-design is '''critical''' for their pair success."'' 이와 같이 말하고 있습니다. 또 다시 보시면 아시겠지만.. 제가 쓴 문장은 "물론 pair-implementation도 중요하다고는 말하고 있으나 앞서 언급한 두가지에 비하면 택도 없지요."입니다. 택도 없다는 표현은 당연히 제 생각이라는 것이 나타나 있다고 생각되는데....
- ParserMarket . . . . 1 match
This is a marketplace for your parsers. Please state your name, your email, and the release your parser is developed for (if you used a CVS snapshot, also state the revision number).
Use a special pagename {{{~cpp ["parser/yourParser.py"]}}} and start your parser with the line {{{~cpp
This way, the parser can directly be put on the page without any modification, and as easily copied from that page. See the examples below.
There are also some UtilityScripts.
If you are not familiar with Python and/or the MoinMoin code base, but have a need or an idea for a parser, this is the place to ask for it. Someone might find it useful, too, and implement it.
- PragmaticVersionControlWithCVS/CommonCVSCommands . . . . 1 match
|| [PragmaticVersionControlWithCVS/AccessingTheRepository] || [PragmaticVersionControlWithCVS/UsingTagsAndBranches] ||
Directory /home/CVSHOME/sesame/template2 added to the repository
work> cvs add DataFormat.doc #<-- forgot the -kb option
work> cvs add -kb DataFormat.doc #<-- use the option
work> # reset the flag in the repository
work> # then reset the flags in our workspace
work> # and save this back in the repository
- PragmaticVersionControlWithCVS/HowTo . . . . 1 match
|| [PragmaticVersionControlWithCVS/Getting Started] || [PragmaticVersionControlWithCVS/AccessingTheRepository] ||
- PragmaticVersionControlWithCVS/UsingTagsAndBranches . . . . 1 match
== Merging The Experimental Branch ==
- ProgrammingLanguageClass/2006/EndTermExamination . . . . 1 match
up to ... (1) <어느 위치·정도·시점이> …까지(에), …에 이르기까지;<지위 등이> …에 이르러:up to this time[now] 지금껏, 지금[이 시간]까지는/I am up to the ninth lesson. 나는 제 9과까지 나가고 있다./He counted from one up to thirty. 그는 1에서 30까지 세었다./He worked his way up to company president. 그는 그 회사의 사장으로까지 출세했다. (2) [대개 부정문·의문문에서] 《구어》 <일 등>을 감당하여, …을 할 수 있고[할 수 있을 정도로 뛰어나]:You’re not up to the job. 너는 그 일을 감당하지 못한다./This novel isn’t up to his best. 이 소설은 그의 최고작에는 미치지 못한다./This camera is not up to much. 《구어》 이 카메라는 별로 대단한 것은 아니다./Do you feel up to going out today? 오늘은 외출할 수 있을 것 같습니까? 《병자에게 묻는 말》 (3) 《구어》 <나쁜 짓>에 손을 대고;…을 꾀하고:He is up to something[no good]. 그는 어떤[좋지 않은] 일을 꾀하고 있다./What are they up to? 그들은 무슨 짓을 하려는 것인가? (4) 《구어》 <사람이> 해야 할, …나름인, …의 의무인:It’s up to him to support his mother. 그야말로 어머니를 부양해야 한다./I’ll leave it up to you. 그것을 네게 맡기마./It’s up to you whether to go or not. 가고 안가고는 네 맘에 달려 있다./The final choice is up to you. 마지막 선택은 네 손에 달려 있다.
- ProgrammingLanguageClass/Report2002_2 . . . . 1 match
1. To find out the maximum length of a variable name
1. To assess the type-compatibility rule adopted by the Compilers;
1. To evaluate the security of pointers in the Compilers;
1. To check the evaluation order of operands in the Compilers by raising the functional side-effects if possible;
1. To identify a situation in which the “add” operator would not be associative;
1. To determine the largest and smallest positive floating point number in Intel Pentium processor.
The output should be a sequence of test programs with the results generated from them. Your grade will be highly dependent on the quality of your test programs.
As usual, you shall submit a floppy diskette with a listing of your program and a set of test data of your own choice, and the output from running your program on your test data set.
Be sure to design carefully your test data set to exercise your program completely. You are also recommended in your documentation to include the rationale behind your test programs.
In order words, explain why you design them in such a way and what you intend to demonstrate
- ProgrammingPartyAfterwords . . . . 1 match
* NoSmok:TheArtOfComputerProgramming 에 나온 어셈블리어로 구현된 엘리베이터 시뮬레이션 (NoSmok:DonaldKnuth 가 직접 엘리베이터를 몇 시간 동안 타보고, 관찰하면서 만든 알고리즘이라고 함. 자기가 타고 다니는 엘리베이터를 분석, 고대로 시뮬레이션 해보는 것도 엄청난 공부가 될 것임)
- ProgrammingPearls/Column3 . . . . 1 match
* 이러면서 우리의 "The Mythical Man Month"의 구절이 나온다.
- ProjectEazy . . . . 1 match
[TheChild'sAcquisitionOfLanguage], [아동언어습득이론] - 아동이 언어를 습득해서 문장을 만드는 과정
- ProjectPrometheus/BugReport . . . . 1 match
Prometheus 의 버그 보고 페이지
* WAR 알아보기. ProjectPrometheus 배포가 편하도록.
* '''The Goal''' View Book 시 DB에 들어가지 않음.
우리는 여기에서 frequent release(give workable system to the customer every week)가 얼마나 중요한가 새삼 확인할 수 있다. --JuNe
- ProjectSemiPhotoshop/요구사항 . . . . 1 match
* Thereshold Binary Image (O 흑백)
- ProjectVirush/Prototype . . . . 1 match
printf( "I have to answer the next question. %s\n", question);
printf( "I sent an answer. The answer is %s\r\n", msg);
- ProjectZephyrus/간단CVS사용설명 . . . . 1 match
# description: The cvspsever serves CVS Passowrd Server sessions; it uses \
# unencrypted username/password pairs for authentication.
- REFACTORING . . . . 1 match
특별히 때를 둘 필요는 없다. 틈나는 대로. Don Robert 의 The Rule of Three 원칙을 적용해도 좋을 것 같다.
- Refactoring/BuildingTestCode . . . . 1 match
== The Value of Self-testing Code ==
- Refactoring/ComposingMethods . . . . 1 match
* You have a code fragment that can be grouped together.[[BR]]''Turn the fragment into a method whose name explains the purpose of the method.''
* A method's body is just as clear as its name. [[BR]] ''Put the method's body into the body of its callers and remove the method.''
* You have a temp that is assigned to once twith a simple expression, and the temp is getting in the way of other refactorings. [[BR]] ''Replace all references to that temp with the expression.''
* You have a complicated expression. [[BR]] ''Put the result of the expression, or parts of the expression,in a temporary variagle with a name that explains the purpose.''
* The code assigns to a parameter. ''Use a temporary variagle instead.''
''Turn the method into ints own object so that all the local variagles become fields on that object. You can then decompose the method into other methods on the same object.''
* You want to replace an altorithm with one that is clearer. [[BR]] ''Replace the body of the method with the new altorithm.''
- Refactoring/DealingWithGeneralization . . . . 1 match
* Two subclasses have the same field.[[BR]]''Move the field to the superclass.''
* You have methods with identical results on subclasses.[[BR]]''Move them to the superclass''
* You have constructors on subclasses with mostly identical bodies.[[BR]]''Create a superclass constructor; class this from the subclass methods.''
* A field is used only by some subclasses.[[BR]]''Move the field to those subclasses.''
* You have two classes with similar features.[[BR]]''Create a superclass and move the common features to the superclass.''
* Several clients use the same subset of a class's interface, or two classes have part of their interfaces in common.[[BR]]''Extract the subset into an interface.''
* A superclass and subclass are not very different.[[BR]]''Merge them together.''
* You have two methods in subclasses that perform similar steps in the same order, yet the steps are different.[[BR]]''Get the steps into methods with the same signature, so that the original methods become the same. Then you call pull them up.''
* A subclass uses only part of a superclasses interface or does not want to inherit data.[[BR]]''Create a field for the superclass, adjust methods to delegate to the superclass, and remove the subclassing.''
* You're using delegation and are ofter writing many simple delegations for the entire interface.[[BR]]''Make the delegating class a subclass of the delegate.''
- Refactoring/OrganizingData . . . . 1 match
* You are accessing a field directly, but the coupling to the field is becoming awkward. [[BR]] ''Create getting and setting methods for the field and use only those to access the field.''
* You have a data item that needs additional data or behavior. [[BR]] ''Turn the data item into an object.''
* You have a class with many equal instances that you want to replace with a single object. [[BR]] ''Turn the object into a reference object.''
* You have an array in which certain elements mean different things. [[BR]]''Replace the array with an object that has a field for each element.''
* You have domain data available only in a GUI control, and domain methods need access. [[BR]] ''Copy the data to a domain object. Set up an observer to synchronize the two pieces of data.''
* You have two classes that need to use each other's features, but there is only a one-way link.[[BR]]''Add back pointers, and change modifiers to update both sets.''
* You have a two-way associational but one class no longer needs features from the other. [[BR]]''Drop the unneeded end of the association.''
* You have a literal number with a paricular meaning. [[BR]] ''Crate a constant, name it after the meaning, and replace the number with it.''
* There is a public field. [[BR]] ''Make it private and provide accessors.''
* You need to interface with a record structure in a traditional programming environment. [[BR]]''Make a dumb data object for the record.''
* A class has a numeric type code that does not affect its behavior. [[BR]] ''Replace the number with a new class.''
* You have an immutable type code that affects the bahavior of a class. [[BR]] ''Replace the type code with subclasses.''
* You have a type code that affects the behavior of a class, but you cannot use subclassing. [[BR]] ''REplace the type code with a state object.''
* You have subclasses that vary only in methods that return constant data.[[BR]]''Change the mehtods to superclass fields and eliminate the subclasses.''
- Refactoring/RefactoringReuse,andReality . . . . 1 match
== why Are Developers Reluctant to Refactor Their Programs? ==
=== Reducing the Overhead of Refactoring ===
- Refactoring/SimplifyingConditionalExpressions . . . . 1 match
* You have a complicated conditional (if-then-else) statement. [[BR]] ''Extract methods from the condition, then part, and else parts.''
* You have a sequence of conditional tests with the same result. [[BR]]''Combine them into a single conditional expression and extract it.''
// compute the disability amount
// compute the disability amount;
* The same fragment of code is in all branches of a conditional expression. [[BR]]''Move it outside of the expression.''
* A method has conditional behavior that does not make clear the normal path of execution [[BR]] ''Use guard clauses for all the special cases.''
* You have a conditional that chooses different behavior depending on the type of and object [[BR]] ''Move each leg of the conditional to an overriding method in a subclass. Make the orginal method abstract.''
* You have repeated checks for a null value[[BR]] ''Replace the null value with a null object.''
* A section of code assumes something about the state of the program. [[BR]]''Make the assumption explicit with an assertion.''
- STL/참고사이트 . . . . 1 match
The Code Project, C++/STL/MFC 에 대한 소개 http://www.codeproject.com/cpp/stlintroduction.asp
C++ Standard Template Library, another great tutorial, by Mark Sebern http://www.msoe.edu/eecs/cese/resources/stl/index.htm
- SeminarHowToProgramIt . . . . 1 match
* ["CrcCard"] (Index Card -- The finalist of Jolt Award for "design tools" along with Rational Rose Enterprise Edition)
* White Board -- Communicate with the Board
- SeminarHowToProgramItAfterwords . . . . 1 match
* '테스트코드의 보폭을 조절하라. 상황에 따라 성큼성큼 보폭을 늘릴수도 있지만, 상황에 따라서는 보폭을 좁혀야 한다. 처음 TDD를 하는 사람은 보폭을 좁혀서 걸어가기가 오히려 더 힘들다' wiki:Wiki:DoTheSimplestThingThatCouldPossiblyWork. 이것이 훈련이 아직 덜된, TDD를 하는 사람에게는 얼마나 힘든지는 이번 RDP 짜면서 느꼈었는데. 열심히 훈련하겠습니다.
- SgmlEntities . . . . 1 match
To support international characters even on generic (US) keyboards, SgmlEntities know from HTML are a good way. These can also be used to escape the WikiMarkup characters.
- StringOfCPlusPlus/상협 . . . . 1 match
String Test("The reverse function work well in English");
- TAOCP/BasicConcepts . . . . 1 match
C - 명령어 코드(the poeration code)
F - 명령어의 변경(a modification of the operation code). (L:R)이라면 8L+R = F
±AA - 메모리 주소(the address)
I - 인덱스(the index specification). 값이 1~6으로 rI1~rI6에 있는 내용과 메모리 주소를 더함
M이 가리키는 메모리 셀로 점프한다. JSJ를 빼면 점프를 하면서 점프 명령어 다음 위치를 rJ에 저장한다. the comparison indicator를 이용하거나(JL, JE, JG, JGE, JLE, JNE) , 레지스터(JrN, JrZ, JrP, JrNN, JrNZ, JrNP)를 이용한다.
HLT 명령은 기계를 멈춘다(The machine stops.)
=== Another Approach(Algorithm B) ===
- TddRecursiveDescentParsing . . . . 1 match
''먼저 "1"을 넣으면 "1"을 리턴하는 프로그램을 만듭니다. 다음 "314"를 넣으면 "314"를 리턴하게 합니다. 다음엔, "1 + 0"을 넣으면 "1"을 리턴하게 합니다. 다음, "1 + 314"를 넣으면 "315"를 리턴합니다. 다음, "1 + 2 + 314"를 하면 "317"을 리턴합니다. 다음, "1 - 0"을 하면 "1"을 리턴합니다. 다음, "1 - 1"을 하면 "0"을 리턴합니다. 다음, "314 - 1 + 2"를 하면 "315"를 리턴합니다. 다음, "- 1"을 넣으면 "-1"을 리턴합니다. 다음, "( 1 )"을 넣으면 "1"을 리턴합니다. ...... AST는 아직 생각하지 말고 당장 현재의 테스트를 패스하게 만드는데 필요한 것만 만들어 나가고 OAOO를 지키면서(테스트코드와 시스템코드 사이, 그리고 시스템 코드 간) 리팩토링을 지속적으로 합니다 -- 그렇다고 파싱 이론을 전혀 이용하지 말라는 말은 아니고 YAGNI를 명심하라는 것입니다. 그러면 어느 누가 봐도 훌륭한 디자인의 파서를 만들 수 있습니다. DoTheSimplestThingThatCouldPossiblyWork. --김창준''
- TestFirstProgramming . . . . 1 match
ex) ["TFP예제/Omok"], ["TFP예제/Queue"], ["TFP예제/WikiPageGather"]
wiki:Wiki:DoTheSimplestThingThatCouldPossiblyWork
- The Tower of Hanoi . . . . 1 match
==== Recurrent Problems - The Tower of Hanoi ====
T<sub>n</sub> is the minimum number of moves that will transfer n disks from one peg to another under Lucas's rules.
===== mathematical expression =====
- TheBookOpenSources . . . . 1 match
Moa:TheBookOpenSources 에서 자유롭게 볼 수 있는 온라인책 관련 링크가 있다.
- TheJavaMan/로보코드 . . . . 1 match
[TheJavaMan]
- TheJavaMan/비행기게임 . . . . 1 match
[TheJavaMan]
- TheJavaMan/숫자야구 . . . . 1 match
* To change the template for this generated file go to
* To change the template for this generated type comment go to
* To change the template for this generated file go to
* To change the template for this generated type comment go to
* To change the template for this generated file go to
* To change the template for this generated type comment go to
* To change the template for this generated file go to
* To change the template for this generated type comment go to
[TheJavaMan]
- TheJavaMan/스네이크바이트 . . . . 1 match
buff=createImage(getWidth(), getHeight());
gb.clearRect(0,0, getWidth(), getHeight());
TheJavaMan
- TheJavaMan/테트리스 . . . . 1 match
[TheJavaMan]
- TheLargestSmallestBox/허준수 . . . . 1 match
[TheLargestSmallestBox]
- ThePracticeOfProgramming . . . . 1 match
[TheElementsOfProgrammingStyle] 에 대해 문의사항이 있어 저자중 한명에게 메일을 보냈더니, 이 책을 언급하였다. TEOPS 의 중요한 내용들을 이책의 첫 챕터에 수록하였다는 말과 함께. -_-a
- ThePragmaticProgrammer . . . . 1 match
SeeAlso : PPR:ThePragmaticProgrammer
- TheSkylineProblem . . . . 1 match
=== The Problem ===
- TheTrip/곽세환 . . . . 1 match
[TheTrip]
- TheTrip/허아영 . . . . 1 match
//TheTrip 10137
- TheWarOfGenesis2R/ToDo . . . . 1 match
[TheWarOfGenesis2R]
- TheWarOfGenesis2R/일지 . . . . 1 match
[TheWarOfGenesis2R]
- ThinkRon . . . . 1 match
aka {{{~cpp WhatTheyWouldDoInMyShoes}}}
Let me tell a brief story about how that came about. Our president, at the time was Bob Doherty. Doherty came from General Electric via Yale, and had been one of the bright young men who were taken under the wing of the famous engineer Stiglitz. Every Saturday, Stiglitz would hold a session with these talented young men whom General Electric had recruited and who were trying to learn more advanced engineering theory and problem-solving techniques. Typically, Bob Doherty would sometimes get really stuck while working on a problem. On those occasions, he would walk down the hall, knock on Stiglitz’s door, talk to him — and by golly, after a few minutes or maybe a quarter of an hour, the problem would be solved.
One morning Doherty, on his way to Stiglitz’s office, said to himself, "Now what do we really talk about? What’s the nature of our conversation?" And his next thought was, "Well Stiglitz never says anything; he just asks me questions. And I don’t know the answer to the problem or I wouldn’t be down there; and yet after fifteen minutes I know the answer. So instead of continuing to Stiglitz’s office, he went to the nearest men’s room and sat down for a while and asked himself, "What questions would Stiglitz ask me about this?" And lo and behold, after ten minutes he had the answer to the problem and went down to Stiglitz’s office and proudly announced that he knew how to solve it.
- ToeicStudy . . . . 1 match
== The Goal ==
- TopicMap . . . . 1 match
TopicMap''''''s are pages that contain markup similar to ['''include'''] (maybe ['''refer'''] or ['''toc''']), but the normal page layout and the ''print layout'' differ: expansion of the includes only happens in the print view. The net result is that one can extract nice papers from a Wiki, without breaking its hyper-linked nature.
''Nice idea. But i would just make it the normal behavior for external links. That way you don't clutter MoinMoin with too many different features. --MarkoSchulz''
I plan to use [ ] with a consistent syntax for such things. How do you mean the external link thing? Including other web pages, or "only" other Wiki pages?
OK, for the simple stuff (i.e. local links), how about this:
* [ include:WikiName] always includes the referred page
Could you provide a more involved example markup and its corresponding rendering? As far as I understand it, you want to serialize a wiki, correct? You should ask yourself what you want to do with circular references. You could either disallow them or limit the recursion. What does "map" do? See also wiki:MeatBall:TransClusion''''''. -- SunirShah
This is useable for navigation in the '''normal''' view. Now imagine that if this is marked as a TopicMap, the ''content'' of the WikiName''''''s that appear is included ''after'' this table of contents, in the '''print''' view.
- UDK/2012년스터디/소스 . . . . 1 match
// Event occured when character logged in(or creation). There are existing function PreLogin, PostLogin functions.
// @todo fixmesteve. If FindSpot fails, then (rarely does) camera pinned continously.
- UglyNumbers . . . . 1 match
The 1500'th ugly number is <number>.
- UglyNumbers/JuNe . . . . 1 match
print "The 1500'th ugly number is",ugly(1500)[-1]
- UglyNumbers/김회영 . . . . 1 match
cout<<"The "<<situation<<"번째 심술쟁이수는 "<<number;
- UglyNumbers/문보창 . . . . 1 match
cout << "The 1500'th ugly number is " << num[1499] << ".\n";
- UglyNumbers/송지원 . . . . 1 match
cout << "The " << num << "th ugly number is " << uglyNum(num) << endl;
- UglyNumbers/이동현 . . . . 1 match
System.out.println("The 1500'th ugly number is "+new BigDecimal(((Double)arr.get(0)).doubleValue()));// + " " + arr.size());
- UglyNumbers/황재선 . . . . 1 match
print "The 1500'th ugly number is <" + str(num) + ">."
- UserPreferences . . . . 1 match
[[Theme]]
- ViImproved/설명서 . . . . 1 match
▶Vi 저자 vi와 ex는 The University of California, Berkeley California computer Science Division, Department of Electrical Engineering and Computer Science에서 개발
- VisualStudio . . . . 1 match
예제 : ProjectTheCell (현재 진행중인 Othello Project)
- WOWAddOn/2011년프로젝트/초성퀴즈 . . . . 1 match
http://www.wowwiki.com/Getting_the_current_interface_number
if count > 10000 then
if baseName ~= nil then
if(calc >= 0 and calc <= 127) then return 1
elseif(calc >= 192 and calc <= 223) then return 2
elseif(calc >= 224 and calc <= 239) then return 3
elseif(calc >= 240 and calc <= 247) then return 4
elseif(calc >= 248 and calc <= 251) then return 5
elseif(calc >= 252 and calc <= 253) then return 6
if len ~= 0 then -- 이거 안좋은데..
if v.type == 3 then
if string.find(msg,"시작") then
if flag == false then
if x then
elseif msg:find("종료") then
if flag == true then
if (event == "CHAT_MSG_CHANNEL") then
if (event == "CHAT_MSG_CHANNEL" or event == "CHAT_MSG_SAY") then
The game engine will call your OnUpdate function once each frame. This is (in most cases) extremely excessive.
Ctrl + R to see the FPS on screen.
- WikiNature . . . . 1 match
The WikiNature is typing in a bunch of book titles and coming back a day later and finding them turned into birds in the Amazon.
Writing on Wiki is like regular writing, except I get to write so much more than I write, and I get to think thoughts I never thought (like being on a really good Free Software project, where you wake up the next morning to find your bugs fixed and ideas improved).
It reminds us of minimalist Japanese brushstroke drawings; you provide the few, elegant slashes of ink, and other minds fill in the rest.
- WikiWikiWebFaq . . . . 1 match
'''A:''' A set of pages of information that are open and free for anyone to edit as they wish. The system creates cross-reference hyperlinks between pages automatically. See WikiWikiWeb for more info.
- ZIM/EssentialUseCase . . . . 1 match
ShowMeTheExample~
- ZPHomePage/레이아웃 . . . . 1 match
= Thead =
- ZeroPageHistory . . . . 1 match
* AOI, The Art Of Computer Programming
* C, C++, Java, Data Structure, Engineering Mathematics, ACM, 3D, Lucene, 영상처리
* OS, MIDI, Engineering Mathematics, AI, Algorithm, PHP, MySQL
- ZeroPage성년식/거의모든ZP의역사 . . . . 1 match
* AOI, The Art Of Computer Programming
* C, C++, Java, Data Structure, Engineering Mathematics, ACM, 3D, Lucene, 영상처리
* OS, MIDI, Engineering Mathematics, AI, Algorithm, PHP, MySQL
- [Lovely]boy^_^/Diary/2-2-10 . . . . 1 match
* I read the SBPP's preface, introduction. And I change a first smalltalk source to a C++ source. I gradually know smalltalk grammar.
* The XB Project starts really. A customer is Jae-dong. So we determine to programm network othelo, that Jae-dong's preparation. At first, we start hopefully, but..--; after all integration is failed. In our opinion, we start beginner's mind. but we learned much, and interested it. And new customer is Hye-sun. Since now, our project begins really. Since tomorrow, during 2 weeks, we'll focus on TDD and pair programming with simple programming.
* I read the SBPP's 2nd chapter - Patterns -.
- [Lovely]boy^_^/Diary/2-2-11 . . . . 1 match
* 선호랑 ["TheWarOfGenesis2R"]의 일환으로 타일 에디터를 만들었다. BMP 파일 약간 개조해서 뒤에다가 타일 데이터를 덧붙였다.
- eXtensibleMarkupLanguage . . . . 1 match
The Extensible Markup Language (XML) is a W3C-recommended general-purpose markup language for creating special-purpose markup languages, capable of describing many different kinds of data. In other words XML is a way of describing data and an XML file can contain the data too, as in a database. It is a simplified subset of Standard Generalized Markup Language (SGML). Its primary purpose is to facilitate the sharing of data across different systems, particularly systems connected via the Internet. Languages based on XML (for example, Geography Markup Language (GML), RDF/XML, RSS, Atom, MathML, XHTML, SVG, and MusicXML) are defined in a formal way, allowing programs to modify and validate documents in these languages without prior knowledge of their form.
- iruril . . . . 1 match
* [TheJavaMan]
- ljh131 . . . . 1 match
- 항상 마들만 사귀는 The O
- pragma . . . . 1 match
Each implementation of C and C++ supports some features unique to its host machine or operating system. Some programs, for instance, need to exercise precise control over the memory areas where data is placed or to control the way certain functions receive parameters. The #pragma directives offer a way for each compiler to offer machine- and operating-system-specific features while retaining overall compatibility with the C and C++ languages. Pragmas are machine- or operating-system-specific by definition, and are usually different for every compiler.
- 겨울과프로젝트 . . . . 1 match
= Theread =
- 곽세환 . . . . 1 match
* [TheJavaMan]
- 김동준/Project/Data_Structure_Overview/Chapter1 . . . . 1 match
printf("The sum is: %f\n", answer);
- 논문번역/2012년스터디/김태진 . . . . 1 match
완전한 영어 문장들로 학습/인식을 위한 데이터를 제공했는데, 각각은 Lancaster-Oslo/Bergen corpus에 기초한다. 글쓴이에 상관없는 형태와 마찬가지로 다수의 저자에 의한 실험은 the Institute of Informatics and Applied Mathe- matics (IAM)에서 수집한 손글씨 형태를 사용했다. 전체 데이터는 다양한 텍스트 영역들을 가지고 있고,500명보다 많은 글쓴이들이 쓴 1200개보다 많은 글씨를 가지고 있다. 우리는 250명의 글쓴이가 쓴 글쓴이-독립적인 실험에서 만들어진 카테고리들의 형태를 사용하고, 6명의 글쓴이가 쓴 c03 형태로 여러 글쓴이 모드를 적용해본다.
주어진 손글씨 문서에 대한 이미지에 대해 처음 전체 이미지를 삐뚤게 쓴 것은(?) 글쓰는 것에 대한 지속적인 "drift"(흐름) - 지속적으로 계속되는 것이거나 스캔하는 동안 부정확하게 놓여진 것(가지런하게 두지 않아서..)에 의한 오류들을 수정하기 위해 고쳤다. 그래서, 그 이미지는 2진화된 이미지를 수직 밀집 히스토그램에서 최소한의 엔트로피가 될때까지 반복한다. 이러한 전처리는 IAM 데이터베이스에 대한 공식을 사용하지 않았는데, 글쓴이들이 스캔하는 동한 정확하게 ???????because the writers were asked to use rulers on a second sheet put below the form and the formulars itself are aligned precisely during scanning.
더 많은 문서 작업을 위해, 개인의 손글씨 각 줄들을 추출했다. 이것은 글씨들을 핵심 위치들 사이로 이미지를 쪼개는 것으로 할 수 있었다. 핵심 위치란, 글씨의 아래위 선사이의 영역과 같은 것인데, 핵심 위치에 존재하는 줄에서 필요한 전체 픽셀들의 최소 갯수를 말하는 한계점을 응용하여(?)찾을 수 있다. 이러한 한계점은 2진화된 손글씨 영역에 대한 수직적인 밀집 히스토그램(the horizontal density histogram of the binarized handwriting-area)을 사용한 Otsu method를 사용하여 자동적으로 만들 수 있다. 검은색 픽셀들의 갯수는 수평적 투영 히스토그램에 각각의 줄을 합한 갯수이고, 그 이미지는 이 히스토그램의 최소화를 따라 핵심 위치들 사이로 조각 내었다.
Theorem 7
- 데블스캠프2006/화요일/tar/김준석 . . . . 1 match
else printf("There is no serching!");
- 데블스캠프2009/월요일/Scratch . . . . 1 match
* The mysterious ticking noise - [http://enochbible.intra.zeropage.org/sc/sample3.sb]
- 데블스캠프2009/화요일 . . . . 1 match
|| 변형진 || The Abstractionism || 컴퓨터공학의 발전과 함께한 노가다의 지혜 || attachment:/DevilsCamp2009/Abstractionism.ppt ||
- 디자인패턴 . . . . 1 match
* http://www.econ.kuleuven.ac.be/tew/academic/infosys/Members/Snoeck/litmus2.ps - Design Patterns As Litmus Paper To Test The Strength Of Object Oriented Methods
- 레밍딜레마 . . . . 1 match
* Title : 레밍 딜레마 ( The Lemming Dilemma )
- 로그인없이ssh접속하기 . . . . 1 match
Enter file in which to save the key (/home/a/.ssh/id_rsa):
The key fingerprint is:
- 말없이고치기 . . . . 1 match
누군가가 별 말 없이 삭제나 수정을 한 것을 봤다면 흥분하지 말고, 차분히 왜그랬을까를 생각해 본다(NoSmok:ToDoIsToSpeak). 고친 사람도 최소 나만큼 이성적인 인간일 것이라는 가정하에. (NoSmok:TheyAreAsSmartAsYouAre)
- 문원명 . . . . 1 match
* [TheJavaMan]
- 문제풀이게시판 . . . . 1 match
* The Algorithm Design Manual
- 박성현 . . . . 1 match
* [http://wiki.kldp.org/wiki.php/DocbookSgml/Ask-TRANS How To Ask Questions The Smart Way]
- 사람들이모임에나오지않는다 . . . . 1 match
"Reform the environment, stop trying to reform the people. They will reform themselves if the environment is right." --NoSmok:BuckminsterFuller
- 새싹교실/2011/學高/4회차 . . . . 1 match
* The sum of your integers plus 7 is 19
- 새싹교실/2011/앞반뒷반그리고App반 . . . . 1 match
* [The C Programming Language]. 일단은.
- 소수구하기 . . . . 1 match
NumberTheory를 공부해라. --JuNe
723만자리짜리 소수가 발견되었다네요 [http://ucc.media.daum.net/uccmix/news/foreign/others/200406/08/hani/v6791185.html?u_b1.valuecate=4&u_b1.svcid=02y&u_b1.objid1=16602&u_b1.targetcate=4&u_b1.targetkey1=17161&u_b1.targetkey2=6791185&nil_profile=g&nil_NewsImg=4 관련기사] - [임인택]
- 시간관리하기 . . . . 1 match
'''The Simplest Thing That Could Possibly Work'''
- 알고리즘2주숙제 . . . . 1 match
From Concrete Mathematics, Chapter 7. Generating Function
1. (Warm up) An eccentric collector of 2 x n domino tilings pays $4 for each vertical domino and $1 for each horizontal domino. How many tiling are worth exactly $m by this criterion? For example, when m = 6 there are three solutions.
3. (Basic)Solve the recurrence
From Discrete mathematics
6~8 Give a generating fuction for the sequence {a<sub>n</sub>}.
6. Let a<sub>r</sub> be the number of ways to select r balls from 3 red balls, 2 green balls, and 5 white balls.
7. Let a<sub>r</sub> be the number of ways r cents worth of postage can be placed on a letter using only 5c, 12c, and 25c stamps. The positions of the stamps on the letter do not matter.
8. Let a<sub>r</sub> be the number of ways to pay for an item costing r cents with pennies, nickels, and dimes.
- 영어학습방법론 . . . . 1 match
=== 질문 2. 히어링. 특히 단어 자체의 발음을 외우다가 문장내에서 연음사이에 그런 단어들을 어떻게 알 수 있는가? 전치사(on, of 등등)과 관사 (a, the, these)등 발음을 확실하게 하지 않는 단어들을 어떻게 알 수 있는가? ===
* ex) I feel like go into the.. (X) : 의미로 모른다[[BR]]
I feel like going to the.. (O) : 의미를 안다.[[BR]]
* The Longman Dictionary of Contemporary English (Addison Wesley Longman, 3rd Edition이상)
- 예수는신화다 . . . . 1 match
* Title :예수는 神話다 - 기독교 탄생의 역사를 새로 쓰는 충격보고(The Jesus Mysteries)
- 위시리스트 . . . . 1 match
* [http://books.google.co.kr/books?id=oowq_6bAgloC&printsec=frontcover&dq=go+lang&hl=ko&sa=X&ei=5f-WU8rTCM_-8QXu5oGwAw&redir_esc=y#v=onepage&q=go%20lang&f=false the way to go]
The art of computer programming 1 ~ 4A
- 유용한팁들 . . . . 1 match
Enter file in which to save the key (/home/a/.ssh/id_rsa):
The key fingerprint is:
- 유혹하는글쓰기 . . . . 1 match
작가에게 고마운 점이 하나 더 있다. 책을 읽는 동안 [TheElementOfStyle]을 읽고 싶은 충동을 참을 수 없었다. 드디어 때가 온 것이다!
- 이영호/개인공부일기장 . . . . 1 match
☆ 구입해야할 책들 - Advanced Programming in the UNIX Environment, Applications for Windows, TCP/IP Illustrated Volume 1, TCP/IP Protocol Suite, 아무도 가르쳐주지않았던소프트웨어설계테크닉, 프로젝트데드라인, 인포메이션아키텍쳐, 초보프로그래머가꼭알아야할컴퓨터동작원리, DirectX9Shader프로그래밍, 클래스구조의이해와설계, 코드한줄없는IT이야기, The Art of Deception: Controlling the Human Element of Security, Advanced Windows (Jeffrey Ritcher), Windows95 System Programming (Matt Pietrek)
- 임민수 . . . . 1 match
* [TheJavaMan]
- 임인책/북마크 . . . . 1 match
* [http://zeropage.org/~dduk/ace/Addison.Wesley.The.ACE.Programmers.Guide.chm ACE Programmer's Guide] ([http://zeropage.org/~dduk/ace/APG.zip example code])
- 임인택/책 . . . . 1 match
The elements of programming style
- 정모/2004.1.20 . . . . 1 match
* TheJavaMan 모임 일요일 2시로 변경
- 정모/2004.1.6 . . . . 1 match
* 자바 스터디 ( TheJavaMan ) :
- 정모/2004.2.17 . . . . 1 match
* OneWiki:TheJavaMan 진행중.
- 정모/2004.2.3 . . . . 1 match
* TheJavaMan 은 프로젝트 참여자 전원이 참여하는 프로젝트인 비행기 게임 만들기를 새로 시작
- 정모/2004.3.2 . . . . 1 match
* TheJavaMan - 종료
- 정모/2007.1.29 . . . . 1 match
3. 영자 신문 놀이( The play of English paper)
- 정모/2012.1.27 . . . . 1 match
* Devils Camp with another univ.
* [고한종] 학우의 '''새해복 많이 받으세요''' 부제 : Theorem of Aggro // 세뱃돈
- 정모/2012.3.12 . . . . 1 match
당장 학우들이 학교에서 배우는 버전은 아마도 Java SE 5.0과 6일 것이므로 혼란을 피하기 위해 JLS 3e 기준으로 설명했습니다. Java SE 7의 JLS SE7e 에서는 The Diamond <>를 이용한 Type inference가 추가된 것이 가장 큰 특징이지요. 이를테면,
- 정수민 . . . . 1 match
printf("n== LOTTO RANDOM NUMBER GENERATOR ==nnEnter the game count : ");
printf("n[ The contents of score array ]n");
- 졸업논문/요약본 . . . . 1 match
Web environment has became a standalone platform. Object-oriented languages, such as python, are suitable for web. Django is a web application framework written by python, and helps web developers writting web application more agile by abstracting database. Django provides high level abstraction on database, higher than CLI which uses ODBC. Django, for instance, creates database tables when developer writes classes in python, and modifies tables when developer modifies classes in python. In addition, django helps developers using database on host-language(python) level by abstracting insertion, deletion, update, retrieving of recodes to class method. Therefore, web developers make programs more agile.
- 지금그때2003 . . . . 1 match
주제가 어떤거지? 현재 지어진 제목을 보면 '미래를 예측하는 방법'에 관한 내용인것 같고, [지금알고있는걸그때도알았더라면]은 '어떤것에 초점을 두어야 하는가'라는거 같은데.. 전자라면.. 앨런 케이의 말을 살짝 인용하며 정말 멋질것 같은데.. "The best way to predict the future is to invent it." - Alan Kay --[sun]
- 지금그때2006/홍보 . . . . 1 match
Upload:NowThen2006ContactList.xls
- 최대공약수 . . . . 1 match
The GCD of 4 and 8 is 4
- 최대공약수/문보창 . . . . 1 match
System.out.println("The GCD of " + bigInteger1 + " and " + bigInteger2 + " is " + gcdNum);
- 최대공약수/허아영 . . . . 1 match
printf("The GCD of %d and %d is %d\n", x, y, x2);
- 최소정수의합/송지훈 . . . . 1 match
cout << "The smallest 'n' for making the number what we want" << endl;
|otherwise = x + little_sum xs (y-x)
- 컴퓨터고전스터디 . . . . 1 match
* 2004년 여름방학 현재 TheArtOfComputerProgramming으로 진행
- 코바예제/시계 . . . . 1 match
return ("The current time is : " + current_time);
- 프로그래밍은습관이다 . . . . 1 match
프로그래밍은 습관이다. 그래서 학습과 반(反)학습 모두 쉽지 않다. 특히 NoSmok:UnlearnTheLearned 가 어렵다. 세살 버릇 여든 가기에, 나쁜 프로그래밍 습관은 프로그래밍 언어가 바뀌어도 유지된다.
- 허아영 . . . . 1 match
[TheTrip/허아영]
- 허아영/C코딩연습 . . . . 1 match
Enter the game count : 5
[[ The contents of score array ]]
- 후각발달특별세미나 . . . . 1 match
프로젝트 때문에 빠르게 진행한게 아니라 선전부 모임때문에... 여튼 간결하게 하는 건 중요하다. 시간 되면 {{{~cpp The One Page Proposal}}}을 읽어보도록 해. --재동
Found 421 matching pages out of 7544 total pages (5000 pages are searched)
You can also click here to search title.
