- 영호의해킹공부페이지 . . . . 68 matches
6. Computers can change (your) life for the better.
Principles of Buffer Overflow explained by Jus
manner of exploiting daemons - The Buffer Overflow.
coded daemons - by overflowing the stack one can cause the software to execute
A buffer is a block of computer memory that holds many instances of the same
A stack has the property of a queue of objects being placed one on top of the
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
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
it can handle. We use this to change the flow of execution of a program -
hopefully by executing code of our choice, normally just to spawn a shell.
We can change the return address of a function by overwriting the entire
contents of the buffer, by overfilling it and pushing data out - this then
means that we can change the flow of the program. By filling the buffer up
This is just a simplified version of what actually happens during a buffer
me +-20 mins to do the whole thing, but at least I was keeping a log of me
save, of course, for the explanations. Next time I'll get human and actually
values of the registers when it dies....
- 김희성/MTFREADER . . . . 41 matches
#define OUT_OF_MEMORY_ERROR 2
long ReadAttribute(FILE* fp, unsigned char* offset, long flag);
ReadFile(hVolume, &boot_block, sizeof(boot_block), &cnt, 0);
unsigned __int64 offset;
ErrorCode=OUT_OF_MEMORY_ERROR;
point=*((unsigned short*)((unsigned char*)$MFT+20));//Offset으로 포인터 이동
ErrorCode=OUT_OF_MEMORY_ERROR;
ULARGE_INTEGER offset;
offset.QuadPart = sector * boot_block.BytesPerSector;
overlap.Offset = offset.LowPart;
overlap.OffsetHigh = offset.HighPart;
unsigned char* offset=0;
offset=(new U8[*((unsigned __int64*)((unsigned char*)point+40))]);
offset=0;
if(offset)
ReadCluster(point+(*(short*)((unsigned char*)point+32)),offset);
offset=point+24+*((unsigned char*)point+9);
if(!offset)
FileTimeToSystemTime((FILETIME*)offset,&time);
FileTimeToSystemTime((FILETIME*)(offset+8),&time);
- RSSAndAtomCompared . . . . 33 matches
#pragma section-numbers off
|| [[TableOfContents]] ||
People who generate syndication feeds have a choice of
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
[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.
[http://www.bblfish.net/blog/page7.html#2005/06/20/22-28-18-208 reports] of problems with interoperability and feature shortcomings.
The Atompub working group is in the late stages of developing the
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.
Atom has a carefully-designed payload container. Content may be explicitly labeled as any one of:
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.
[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.
Atom [http://www.ietf.org/internet-drafts/draft-ietf-atompub-autodiscovery-01.txt standardizes autodiscovery]. Additionally, Atom feeds contain a “self” pointer, so a newsreader can auto-subscribe given only the contents of the feed, based on Web-standard dispatching techniques.
The only recognized form of RSS 2.0 is an <rss> document.
== Differences of Degree ==
RSS 2.0 does not specify the handling of relative URI references, and in practice they cannot be used in RSS feeds.
- NSIS/예제2 . . . . 24 matches
InstallDirRegKey HKLM SOFTWARE\NSIS_Example2 "Install_Dir"
WriteRegStr HKLM SOFTWARE\NSIS_Example2 "Install_Dir" "$INSTDIR"
WriteRegStr HKLM "Software\Microsoft\Windows\CurrentVersion\Uninstall\Example2" "DisplayName" "NSIS Example2 (remove only)"
WriteRegStr HKLM "Software\Microsoft\Windows\CurrentVersion\Uninstall\Example2" "UninstallString" '"$INSTDIR\uninstall.exe"'
WriteRegStr HKLM SOFTWARE\NSIS_Example2 "Install_Dir" "$INSTDIR"
WriteRegStr HKLM "Software\Microsoft\Windows\CurrentVersion\Uninstall\Example2" "DisplayName" "NSIS Example2 (remove only)"
WriteRegStr HKLM "Software\Microsoft\Windows\CurrentVersion\Uninstall\Example2" "UninstallString" '"$INSTDIR\uninstall.exe"'
DeleteRegKey HKLM "Software\Microsoft\Windows\CurrentVersion\Uninstall\Example2"
DeleteRegKey HKLM SOFTWARE\NSIS_Example2
InstallDirRegKey HKLM SOFTWARE\NSIS_Example2 "Install_Dir"
WriteRegStr HKLM SOFTWARE\NSIS_Example2 "Install_Dir" "$INSTDIR"
WriteRegStr HKLM "Software\Microsoft\Windows\CurrentVersion\Uninstall\Example2" "DisplayName" "NSIS Example2 (remove only)"
WriteRegStr HKLM "Software\Microsoft\Windows\CurrentVersion\Uninstall\Example2" "UninstallString" '"$INSTDIR\uninstall.exe"'
DeleteRegKey HKLM "Software\Microsoft\Windows\CurrentVersion\Uninstall\Example2"
DeleteRegKey HKLM SOFTWARE\NSIS_Example2
; eof
MakeNSIS v1.95 - Copyright 1999-2001 Nullsoft, Inc.
InstallRegKey: "HKLM\SOFTWARE\NSIS_Example2\Install_Dir"
WriteRegStr: HKLM\SOFTWARE\NSIS_Example2\Install_Dir=$INSTDIR
WriteRegStr: HKLM\Software\Microsoft\Windows\CurrentVersion\Uninstall\Example2\DisplayName=NSIS Example2 (remove only)
- 새싹교실/2012/아우토반/앞반/5.10 . . . . 24 matches
[[TableOfContents]]
printf("%d %d\n", sizeof(*pA), sizeof(pA));
printf("%d %d\n", sizeof(*pB), sizeof(pB));
printf("%d %d\n", sizeof(*pC), sizeof(pC));
printf("%d %d\n", sizeof(*pD), sizeof(pD));
printf("%d %d\n", sizeof(*pA), sizeof(pA)); //*pa의 문자열은 int(4), pA의 문자열은 int(4)
printf("%d %d\n", sizeof(*pB), sizeof(pB)); // pB의 문자열은 int(4), *pB의 문자열은 int(4)
printf("%d %d\n", sizeof(*pC), sizeof(pC)); // *pC의 문자열은 char(1), pC의(주소값)문자열은 int(4)
printf("%d %d\n", sizeof(*pD), sizeof(pD)); // *pD의 문자열은 double(8), pD의 (주소값)문자열은 int(4)
printf("%d %d\n", sizeof(*pA), sizeof(pA));
printf("%d %d\n", sizeof(*pB), sizeof(pB));
printf("%d %d\n", sizeof(*pC), sizeof(pC));
printf("%d %d\n", sizeof(*pD), sizeof(pD));
- UnixSocketProgrammingAndWindowsImplementation . . . . 17 matches
[[TableOfContents]]
memset((struct sockaddr *)&ina, 0, sizeof(struct sockaddr));
if( bind(sockfd, (struct sockaddr *)&ina, sizeof(struct sockaddr) == -1 )
int sizeof_sockaddr_in;
sizeof_sockaddr_in = sizeof(struct sockaddr_in);
client_sock = accept(server_sock, (struct sockaddr *)&client_addr, &sizeof_sockaddr_in);
if( connect(client_sock, (struct sockaddr *)&client_addr, sizeof(struct sockaddr)) == -1 )
if( send(client_sock, buf1, sizeof(buf), 0) == -1 )
// 성공 시 수신 한 바이트 수(단 EOF만나면 0), 실패 시 -1 리턴
str_len = recv(sockfd, buf1, sizeof(buf1), 0);
str_len = read(sockfd, buf2, sizeof(buf2));
int sizeof_sockaddr_in;
memset((SOCKADDR_IN *)&server_addr, 0, sizeof(SOCKADDR_IN));
if( bind(server_sock, (sockaddr *)&server_addr, sizeof(SOCKADDR_IN)) == -1 )
sizeof_sockaddr_in = sizeof(SOCKADDR_IN);
client_sock = accept(server_sock, (sockaddr *)&client_addr, &sizeof_sockaddr_in);
send(client_sock, msg, sizeof(msg), 0);
- CompleteTreeLabeling/조현태 . . . . 16 matches
[[TableOfContents]]
line=(block**)malloc(sizeof(block*)*number_nodes);
block* temp_block=(block*)malloc(sizeof(block));
temp_block->next=(block**)malloc(sizeof(block*)*input_degree);
line=(block**)malloc(sizeof(block*)*number_nodes);
block* temp_block=(block*)malloc(sizeof(block));
temp_block->next=(block**)malloc(sizeof(block*)*degree);
int number_of_one=get_number_nodes(degree,line[block_number]->deep)-get_number_nodes(degree,line[block_number]->deep-1);
sub_line=(int*)malloc(sizeof(int)*remain);
if (i<number_of_one)
for (int process_combination=0; process_combination<Get_combination(remain,number_of_one); ++process_combination)
for (register int i=0; i<number_of_one; ++i)
for (register int i=number_of_one-1; i>=0; --i)
sub_line=(int*)malloc(sizeof(int)*(get_number_nodes(degree,line[block_number]->deep)-get_number_nodes(degree,line[block_number]->deep-1)));
int gaesu_of_one=0;
++gaesu_of_one;
for (register int k=j+1; k<j+2+gaesu_of_one; ++k )
- WinampPluginProgramming/DSP . . . . 12 matches
// Copyright (C) 1997, Justin Frankel/Nullsoft
// Module header, includes version, description, and address of the module retriever function
winampDSPHeader hdr = { DSP_HDRVER, "Nullsoft DSP demo v0.3 for Winamp 2", getModule };
"Nullsoft Echo v0.2",
"Nullsoft Stereo Voice Removal v0.2",
"Nullsoft Pitch/Tempo Control v0.2",
"Nullsoft Pitch/Tempo Control v0.3 - lower",
"Nullsoft Pitch/Tempo Control v0.3 - higher",
MessageBox(this_mod->hwndParent,"This module is Copyright(C) 1997, Justin Frankel/Nullsoft\n"
" * Voice removal sucks (works about 10% of the time)!\n"
"etc... this is really just a test of the new\n"
// cleanup (opposite of init()). Destroys the window, unregisters the window class
- WindowsTemplateLibrary . . . . 12 matches
{{| [[TableOfContents]] |}}
{{|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.|}}
[http://www.microsoft.com/downloads/details.aspx?FamilyID=128e26ee-2112-4cf7-b28e-7727d9a1f288&DisplayLang=en MS WTL]
- OurMajorLangIsCAndCPlusPlus/XML/조현태 . . . . 11 matches
SReadBlock* newBlock = (SReadBlock*)malloc(sizeof(SReadBlock));
newBlock->name = (char*)malloc(sizeof(char) * (strlen(name) + 1));
newBlock->contents = (char*)malloc(sizeof(char) * (strlen(contents) + 1));
SReadBlock** newNextBlocks = (SReadBlock**)malloc(sizeof(SReadBlock*) * (head->nextBlockNumber + 1));
memcpy(newNextBlocks, head->nextBlocks, sizeof(SReadBlock*) * head->nextBlockNumber);
char* textBuffur = (char*)malloc(sizeof(char) * (nameEndPoint - readData + 1));
char* textBuffur = (char*)malloc(sizeof(char) * (contentsEndPoint - readData + 1));
newBlocks = (SReadBlock**)malloc(sizeof(SReadBlock*) * ((int)(**suchedBlocks) + 2));
memcpy(newBlocks, *suchedBlocks, sizeof(SReadBlock*) * ((int)(**suchedBlocks) + 1));
suchedBlocks = (SReadBlock**)malloc(sizeof(SReadBlock*));
textBuffur = (char*)malloc(sizeof(char) * (suchEndPoint - query + 1));
- DebuggingSeminar_2005 . . . . 9 matches
{{|[[TableOfContents]]|}}
|| [http://www.compuware.com/products/numega.htm NuMega] || [SoftIce] , DevPartner 개발사 ||
|| [http://www.compuware.com/products/devpartner/softice.htm SoftIce for DevPartner] || 데브파트너랑 연동하여 쓰는 SoftIce, [http://www.softpedia.com/get/Programming/Debuggers-Decompilers-Dissasemblers/SoftICE.shtml Freeware Download] ||
|| [http://msdn.microsoft.com/library/default.asp?url=/library/en-us/tools/tools/rebase.asp ReBase MSDN] || Rebase is a command-line tool that you can use to specify the base addresses for the DLLs that your application uses ||
|| [http://msdn.microsoft.com/library/default.asp?url=/library/en-us/vccore/html/_core_viewing_decorated_names.asp undname.exe] || C++ Name Undecorator, Map file 분석툴 ||
|| [http://msdn.microsoft.com/library/default.asp?url=/library/en-us/vsdebug/html/_core_c_run2dtime_library_debugging_support.asp Debug CRT] || VC++4 에서 지원하기 시작한 C런타임 라이브러리 ||
- MoreEffectiveC++/Operator . . . . 9 matches
||[[TableOfContents]]||
== Item 5: Be wary of user-defined conversion functions. ==
== Item 6: Distinguish between prefix and postfix forms of increment and decrement operators. ==
new delete sizeof typeid
== Item 8: Understand the differend meanings of new and delete ==
이 코드는 new operator를 사용한 것이다. new operator는 sizeof 처럼 언어 상에 포함되어 있으며, 개발자가 더 이상 그 의미의 변경이 불가능하다. 이건 두가지의 역할을 하는데, 첫째로 해당 객체가 들어갈 만한 메모리를 할당하는 것이고, 둘째로 해당 객체의 생성자를 불러주는 역할이다. new operator는 항상 이 두가지의 의미라 작동하며 앞에서 언급한듯 변경은 불가능하다.
void *rawMemory = operator new(sizeof(string));
void *memory = operator new(sizeof(string));
void * buffer = operator new(50*iszeof(char));
void *shareMemory = mallocShared(sizeof(Widget));
- User Stories . . . . 9 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.
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.
- ThinkRon . . . . 8 matches
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.
- VonNeumannAirport/Leonardong . . . . 8 matches
거리를 계산하는 더 좋은 알고리즘이 있을까? 지금은 O(num of city^2).
def __init__(self, numofGates):
for i in range( numofGates ):
self.matrix.append([0]*numofGates)
def __init__(self, numofGates):
Matrix.__init__(self, numofGates)
def __init__(self, numofGates):
Matrix.__init__(self, numofGates)
- EnglishSpeaking/2011년스터디 . . . . 7 matches
[[TableOfContents]]
* 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.
* [김수경] - 이번주 영상은 문장이 단어 조금 바꾸면 여기저기 가져다 쓸만한 것이 많아 재미있었어요. 가위바위보로 역할을 분담했는데 ''Along with the ego and the superego, one of three components of the psyche.''라는 문장을 외워보고 싶어서 리사를 선택했습니다. 그런데 리사 분량이 제일 적어서 본의아니게(?) 가장 날로먹었네요 ㅋㅋ
- Class/2006Fall . . . . 6 matches
[[TableOfContents]]
* 1st presentation of project is on 28 Sep. - 초기 진행 상황 및 향후 계획
* 2nd presentation of project is on 12 Oct. - 검색 (설계 및 구현)
* 3rd presentation of project is on 31 Oct. - 변경 (설계 및 구현)
* 4th presentation of project is on 14 Nov. - API, 성능평가
* Write answer to one of question in Q&A chapter 6.
* Write answer that consist five or six sentenses to one of question in Q&A chapter 7.
* Offline meeting at 11 a.m. on 10 Nov.
- Linux . . . . 6 matches
[[TableOfContents]]
professional like gnu) for 386(486) AT clones. This has been brewing
(same physical layout of the file-system (due to practical reasons)
PS. Yes - it's free of any minix code, and it has a multi-threaded fs.
[http://www.zeropage.org/pub/Linux/Microsoftware_Linux_Command.pdf 마이크로소프트웨어_고급_리눅스_명령와_중요_시스템_관리]
[http://translate.google.com/translate?hl=ko&sl=en&u=http://www.softpanorama.org/People/Torvalds/index.shtml&prev=/search%3Fq%3Dhttp://www.softpanorama.org/People/Torvalds/index.shtml%26hl%3Dko%26lr%3D 리눅스의 개발자 LinusTorvalds의 소개, 인터뷰기사등]
- PreviousFrontPage . . . . 6 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.
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.
/!\ Please see Wiki:WikiForumsCategorized for a list of wikis by topic.
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.
* MoinMoinTodo: discussion about the improvement of MoinMoin
- Refactoring/ComposingMethods . . . . 6 matches
[[TableOfContents]]
* 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.''
return _numberOfLateDeliveries > 5;
return (_numberOfLateDeliveries>5)?2:1;
* 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.''
if ( (platform.toUpperCase().indexOf("MAC") > -1) &&
(browser.toUpperCase().indexOf("IE") > -1) &&
final boolean isMacOs = platform.toUpperCase().indexOf("MAX") > -1;
final boolean isIEBrowser = browser.toUpperCase().indexOf("IE") > -1);
* You want to replace an altorithm with one that is clearer. [[BR]] ''Replace the body of the method with the new altorithm.''
- C++ . . . . 5 matches
{{|[[TableOfContents]]|}}
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.|}}
- 권영기/web crawler . . . . 5 matches
[[tableofcontents]]
say = "This is a line of text"
part == ['This', 'is', 'a', 'line', 'of', 'text']
2. Eclipse에서, Help > Install New Software > Add > PyDev, Http://pydev.org/updates
* http://www.crummy.com/software/BeautifulSoup/ - 웹분석 라이브러리 BeautifulSoup 이용해보기
- 수학의정석/집합의연산/조현태 . . . . 5 matches
int *numbers=(int*)malloc(sizeof(int)*(*number_gaesu));
int *temp_where=(int*)malloc(sizeof(int)*gaesu);
int gaesu_of_one=0;
++gaesu_of_one;
for (register int k=j+1; k<j+2+gaesu_of_one; ++k )
- ClearType . . . . 4 matches
[[TableOfContents]]
Microsoft 에서 주도한 폰트 보정 기법의 하나로 기존의 안티얼라이징 기법과 최근에 나오고 있는 LCD Display 의 표현적 특성을 조합하여 폰트 이미지의 외관을 가히 극대화하여 표현하는 방식.
* [MicroSoft]에서 개발한 텍스트 벡터드로잉 방법.
* [http://www.microsoft.com/typography/ClearTypeInfo.mspx ClearType기술 홈페이지] - 윈도우 적용 방법이나 기술에대한 자세한 소개.
* [http://www.microsoft.com/typography/cleartype/tuner/Step1.aspx ClearType Tuner]라는 프로그램으로 세부적인 클리어타입 셋팅을 할 수 있다.
- DebuggingSeminar_2005/DebugCRT . . . . 4 matches
''_CRTDBG_ALLOC_MEM_DF 는 기본적으로 on, 기타 플래그는 디폴트 off이므로 bitwise 연산자를 이용해서 적절하게 플래그를 설정해야한다.''
flag &= !_CRTDBG_LEAK_CHECK_DF; // 플래그 off
참조) [http://zeropage.org/wiki/AcceleratedC_2b_2b_2fChapter11#line287 The rule of Three]
[http://msdn.microsoft.com/library/default.asp?url=/library/en-us/vsdebug/html/_core_c_run2dtime_library_debugging_support.asp MSDN]
- 비밀키/김태훈 . . . . 4 matches
ofstream fout ("source_enc.txt");
}while(!(fin.eof()));
ofstream fout("normal.txt");
}while(!(fin.eof()));
- 압축알고리즘/희경&능규 . . . . 4 matches
ofstream fout("output.txt");
ofstream fout("output.txt");
ofstream fout("input.txt");
ofstream fout("input.txt");
- ACM_ICPC/2013년스터디 . . . . 3 matches
[[TableOfContents]]
* graph, dfs - [http://211.228.163.31/30stair/danji/danji.php?pname=danji 단지 번호 붙이기], [http://211.228.163.31/30stair/orders/orders.php?pname=orders orders], [http://211.228.163.31/30stair/bugslife/bugslife.php?pname=bugslife 짝 짓기], [http://211.228.163.31/30stair/sprime/sprime.php?pname=sprime 슈퍼 소수], [http://211.228.163.31/30stair/snail_trails/snail_trails.php?pname=snail_trails 달팽이]
* 곽병학 : Hoffman code - 쓸데없을거 같음..
* proof - [http://prezi.com/fsaynn-iexse/kadanes-algorithm/]
* 위상정렬, critical path에 대해 공부 및 코딩 - 코드 및 해설은 Fundamental of DataStructure를 참고하자.
- Expat . . . . 3 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.
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.
- RUR-PLE/Newspaper . . . . 3 matches
[[TableOfContents]]
turn_off()
turn_off()
turn_off()
- TAOCP/InformationStructures . . . . 3 matches
''새 원소 넣기(inserting an element at the rear of the queue)
하지만 공간낭비가 무한할 수 있다.( F, R이 계속증가하기 때문이다.) 따라서 이런 문제(the problem of the queue overrunning memory)를 해결하려면, M개의 노드(X[1]...X[M])가 순환하도록 한다.
하지만 리스트가 더 많으면 bottom이 움직일 수 있어야 한다.(we must allow the "bottom" elements of the lists to change therir positions.) MIX에서 I번째 한 WORD를 rA에 가져오는 코드는 다음과 같다.
- VisualStudio2005 . . . . 3 matches
2. Visual Studio Professional
http://www.microsoft.com/korea/events/ready2005/vs_main.asp
http://msdn.microsoft.com/vstudio/express/default.aspx
- XsltVersion . . . . 3 matches
<xsl:value-of select="system-property('xsl:vendor')"/>
(<a href="{system-property('xsl:vendor-url')}"><xsl:value-of select="system-property('xsl:vendor-url')"/></a>)
implementing XSLT v<xsl:value-of select="system-property('xsl:version')"/>
- ZeroPage . . . . 3 matches
* 2013 삼성 Software Friendship 선정
* 2015 Samsung Software Friendship 4기 동아리 선정
* 삼성 Software Friendship 동아리 선정
- 오목/곽세환,조재화 . . . . 3 matches
// ohbokView.h : interface of the COhbokView class
// Microsoft Visual C++ will insert additional declarations immediately before the previous line.
// ohbokView.cpp : implementation of the COhbokView class
ASSERT(m_pDocument->IsKindOf(RUNTIME_CLASS(COhbokDoc)));
- 오목/재니형준원 . . . . 3 matches
// OmokView.h : interface of the COmokView class
// Microsoft Visual C++ will insert additional declarations immediately before the previous line.
// omokView.cpp : implementation of the COmokView class
ASSERT(m_pDocument->IsKindOf(RUNTIME_CLASS(COmokDoc)));
- 오목/진훈,원명 . . . . 3 matches
[[TableOfContents]]
// OmokView.h : interface of the COmokView class
// Microsoft Visual C++ will insert additional declarations immediately before the previous line.
// OmokView.cpp : implementation of the COmokView class
ASSERT(m_pDocument->IsKindOf(RUNTIME_CLASS(COmokDoc)));
- 코드레이스/2007/RUR_PLE . . . . 3 matches
[[TableOfContents]]
turn_off()
turn_off()
turn_off()
- 2학기파이선스터디/모듈 . . . . 2 matches
['_StringTypes', '__builtins__', '__doc__', '__file__', '__name__', '_float', '_idmap', '_idmapL', '_int', '_long', 'ascii_letters', 'ascii_lowercase', 'ascii_uppercase', 'atof', 'atof_error', 'atoi', 'atoi_error', 'atol', 'atol_error', 'capitalize', 'capwords', 'center', 'count', 'digits', 'expandtabs', 'find', 'hexdigits', 'index', 'index_error', 'join', 'joinfields', 'letters', 'ljust', 'lower', 'lowercase', 'lstrip', 'maketrans', 'octdigits', 'printable', 'punctuation', 'replace', 'rfind', 'rindex', 'rjust', 'rstrip', 'split', 'splitfields', 'strip', 'swapcase', 'translate', 'upper', 'uppercase', 'whitespace', 'zfill']
- AcceleratedC++/Chapter9 . . . . 2 matches
||[[TableOfContents]]||
// as defined in 9.2.1/157, and changed to read into `n' instead of `name'
// get rid of previous contents
- AncientCipher/정진경 . . . . 2 matches
memset (c1,0,sizeof(c1));
memset (c2,0,sizeof(c2));
- DebuggingSeminar_2005/UndName . . . . 2 matches
Microsoft(R) Windows (R) 2000 Operating System
UNDNAME Version 5.00.2184.1Copyright (C) Microsoft Corp. 1981-1999
- DesignPatterns/2011년스터디/1학기 . . . . 2 matches
1. 한번 짜봐야 할 필요성을 느낀다. Life Game으로 넘어가기전에.
1. 오늘은 LifeGame으로 바로 넘어가기 전에 [임상현]의 SE 과제인 파일 비교 프로그램을 설계해보았다.
- EightQueenProblemSecondTry . . . . 2 matches
* LOC - ''Lines of Code. 보통 SLOC(Source Lines of Code)이라고도 함.''
- Java Study2003/첫번째과제/방선희 . . . . 2 matches
* Java는 보안능력이 뛰어나다. 예를 들어 네트워크를 통해 내 PC로 download된 Java로 개발된 프로그램은 일반적으로 그 능력이 제한된다. 다시 말해 바이러스처럼 작용할 수 없다는 말이다 (이점은 MicroSoft의 Active X와 비교된다).
* MicroSoft windows에서 신나게 실행되는 게임이 Linux에서도 잘 돌까? 아마도 답은 '아니다' 일 것이다. 그러나 만약 그 게임이 Java로 제작되었다면 답은 '예' 이다. 다시 말해 Java로 개발된 프로그램은 PC, Macintosh, Linux등 machine이나 O/S에 종속되지 않는다.
- Linux/필수명령어/용법 . . . . 2 matches
만일 중간에 다른 점을 발견한다면 더 이상의 작업은 중단하고 차이를 발견한 지점을 알려주고는 종료한다. 또한 계속해서 일치해 나가다가 두 파일 중 어느 하나가 끝나는 경우가 있을 수 있다. 다시 말해, 한 파일이 다른 파일의 앞부분에 해당하는 경우이다. 이때는 어느쪽 파일의 end of file 표시를 만나게 되었는지를 알려주고 종료한다.
- Login Name Tty Idle Login Time Office Office Phone
-26) SIGVTALRM 27) SIGPROF 28) SIGWINCH 29) SIGIO
readme.txt의 파일에서 캐리지 리턴 문자와 eof마크를 제거하고 readable파일로 리다이렉션한다.
- STL/참고사이트 . . . . 2 matches
[http://www.halpernwightsoftware.com/stdlib-scratch/quickref.html C++ STL from halper]
Mumits STL 초보 가이드 (약간 오래된 것) http://www.xraylith.wisc.edu/~khan/software/stl/STL.newbie.html
- 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;
- VimSettingForPython . . . . 2 matches
set et ts=4 sw=4 softtabstop=4 smarttab expandtab
set nofen
- WantedPages . . . . 2 matches
A list of non-existing pages including a list of the pages where they are referred to:
- WikiWikiWebFaq . . . . 2 matches
'''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.
- ★강원길★ . . . . 2 matches
== Profile ==
홈페이지 : [http://www.cyworld.com/soffmagil] 원길이 홈페이지 에요
- 개인키,공개키/강희경,조동영 . . . . 2 matches
ofstream fout("output1.txt");
ofstream fout1("output2.txt");
- 김준호 . . . . 2 matches
== Profile ==
# 3월 17일에는 Microsoft Visual Studio 2008 프로그램을 이용하여 기초적인 c언어를 배웠습니다.
- 데블스캠프2005/RUR-PLE/정수민 . . . . 2 matches
turn_off()
turn_off()
- 수업평가 . . . . 2 matches
||SoftwareEngineeringClass || 6 || 6 || 5 || -8 || 9 || 5 ||1.8 ||
||SoftwareEngineeringClass송기원|| 4 || 3 || 2 || 3 || 12 || 2 || 6 ||
- 05학번 . . . . 1 match
//char *p = malloc(sizeof(char)*100);
- Celfin's ACM training . . . . 1 match
|| 9 || 6 || 110602/10213 || How Many Pieces Of Land? || 3 hours || [http://165.194.17.5/wiki/index.php?url=zeropage&no=4143&title=HowManyPiecesOfLand?/하기웅&login=processing&id=celfin&redirect=yes How Many Pieces Of Land?/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] ||
- DevelopmentinWindows . . . . 1 match
[[TableOfContents]]
* MFC (Microsoft Foundation Class library)
- Factorial2 . . . . 1 match
Factorial of Number A 란 A! 식으로 표현하며, A 의 계승이라는 표현을 씁니다.
- FromDuskTillDawn/변형진 . . . . 1 match
if($this->days) echo "Vladimir needs $this->days litre(s) of blood.<br>";
- GarbageCollection . . . . 1 match
[[TableOfContents]]
2번째 경우에 대한 힌트를 학교 자료구조 교재인 Fundamentals of data structure in c 의 Linked List 파트에서 힌트를 얻을 수 있고, 1번째의 내용은 원칙적으로 완벽한 예측이 불가능하기 때문에 시스템에서 객체 참조를 저장하는 식으로 해서 참조가 없으면 다시는 쓰지 않는 다는 식으로 해서 처리하는 듯함. (C++ 참조 변수를 통한 객체 자동 소멸 관련 내용과 관련한 부분인 듯, 추측이긴 한데 이게 맞는거 같음;;; 아닐지도 ㅋㅋㅋ)
- Gof/Facade . . . . 1 match
From GoF.
[[TableOfContents]]
예를 들어, 가상 메모리 framework는 Domain을 facade로서 가진다. Domain은 address space를 나타낸다. Domain은 virtual addresses 와 메모리 객체, 화일, 저장소의 offset에 매핑하는 기능을 제공한다. Domain의 main operation은 특정 주소에 대해 메모리 객체를 추가하거나, 삭제하너가 page fault를 다루는 기능을 제공한다.
- Gof/Mediator . . . . 1 match
[[TableOfContents]]
Here's the succession of events by which a list box's selection passes to an entry field.
- Gof/Singleton . . . . 1 match
[[TableOfContents]]
더욱더 유연한 접근 방법으로 '''registry of singletons''' 이 있다. 가능한 Singleton class들의 집합을 정의하는 Instance operation을 가지는 것 대신, Singleton class들을 잘 알려진 registry 에 그들의 singleton instance를 등록하는 것이다.
CList <CNSingleton*, CNSingleton*>* m_ContainerOfSingleton;
delete m_ContainerOfSingleton;
m_ContainerOfSingleton = new CList <CNSingleton*, CNSingleton*>;
m_ContainerOfSingleton->AddTail(new CNSingleton());
POSITION position = m_ContainerOfSingleton->GetHeadPosition();
delete m_ContainerOfSingleton->GetAt(position);
m_ContainerOfSingleton->GetNext(position);
m_ContainerOfSingleton->RemoveAll();
if (m_Index == m_ContainerOfSingleton->GetCount())
POSITION position = m_ContainerOfSingleton->FindIndex(m_Index);
return m_ContainerOfSingleton->GetAt(position);
- Hacking . . . . 1 match
[[TableOfContents]]
== DDOS(Distributed Denial of Service)의 공격 ==
- KnightTour/재니 . . . . 1 match
// Knight.cpp: implementation of the CKnight class.
- MFC . . . . 1 match
#Redirect MicrosoftFoundationClasses
- MoniWiki/HotKeys . . . . 1 match
||``<ESC>``||Go 'into'/'out of' the 'Go' form|| ||
- Perforce . . . . 1 match
프로그램은 서버, 클라이언트 환경으로 관리되며, 서버는 소스의 모아서 관리한다. 서버 프로그램은 유닉스, 맥, MSWin 버전으로 제공된다. 클라이언트는 GUI, CMD 버전의 툴을 지원하며 다양한 OS 에서 이용가능하다. 또한 IDE 와 연동역시 지원한다. (IDE에는 3dmax, maya, photoshop, office 등을 포괄하는 방대한 시스템)
- ProgrammingContest . . . . 1 match
||[[TableOfContents]]||
http://www.itasoftware.com/careers/programmers.php
- ScaleFreeNetwork/OpenSource . . . . 1 match
[[TableOfContents]]
* Complex Network Metrics and Software Evolvability
- SharedSourceProgram . . . . 1 match
[http://news.naver.com/news/read.php?mode=LSD&office_id=092&article_id=0000002588§ion_id=105&menu_id=105 ZDnet기사부분발췌]
- VendingMachine/세연/재동 . . . . 1 match
char * name[] = {"coke","juice","tea","cofee","milk"};
- WordIndex . . . . 1 match
This is an index of all words occuring in page titles.
- Yggdrasil/가속된씨플플/2장 . . . . 1 match
cout<<"Please input blank of rows and cols:";
- ZeroPageServer/set2002_815 . . . . 1 match
* [[HTML( <STRIKE> .bashrc .bash_profile 한글화</STRIKE> )]]
- [Lovely]boy^_^/Diary/2-2-11 . . . . 1 match
[[TableOfContents]]
== ToDo List of a this week ==
* 선호랑 ["TheWarOfGenesis2R"]의 일환으로 타일 에디터를 만들었다. BMP 파일 약간 개조해서 뒤에다가 타일 데이터를 덧붙였다.
- [Lovely]boy^_^/USACO/WhatTimeIsIt? . . . . 1 match
ofstream fout("clock.out");
- dlaza . . . . 1 match
== profile ==
- fm_jsung . . . . 1 match
== Profile ==
- html5/communicationAPI . . . . 1 match
[[tableofcontents]]
- 김경환 . . . . 1 match
== Profile ==
- 김범준 . . . . 1 match
== Profile ==
- 꿈 . . . . 1 match
== Profile ==
- 데블스캠프2005/RUR-PLE/Harvest/정수민 . . . . 1 match
turn_off()
- 데블스캠프2011/둘째날/Machine-Learning . . . . 1 match
* 자동 분류할 데이터 다운로드 : http://office.buzzni.com/media/svm_data.tar.gz
- 상협/Diary/7월 . . . . 1 match
[[TableOfContents]]
* Designing Object-Oriented Software 이책이랑 Refactoring 책 빌려야징..
- 상협/Diary/8월 . . . . 1 match
[[TableOfContents]]
* Designing Object-Oriented Software 이책 다보기 Failure (집에 내려가서 해야징.)
- 송년회 . . . . 1 match
이런 연말모임도 해 보면 좋겠습니다.[http://news.naver.com/news/read.php?mode=LSD&office_id=028&article_id=0000089874§ion_id=103&menu_id=103]--[Leonardong]
- 수 . . . . 1 match
http://prof.cau.ac.kr/~sw_kim/include.htm
- 시간맞추기/조현태 . . . . 1 match
cout << "your time is off." << second;
- 신기훈 . . . . 1 match
로그인할 때 profile만들기?
- 신혜지 . . . . 1 match
== Profile ==
- 우리가나아갈방향 . . . . 1 match
Gof 꺼 올려놨으니 그거 먼저보라니까.. 충고 안듣으시더니. -_-; DPSC가 더 어려울텐데.. 흡. --석천
- 위키로프로젝트하기 . . . . 1 match
[[TableOfContents]]
== Wiki Project Life Cycle ==
* How - 목표를 위한 방법과 일정의 기록이다. Offline 또는 Online 상에서 한 일에 대한 ["ThreeFs"] 를 남겨라.
* 공동 번역 - 영어 원문을 링크를 걸거나 전문을 실은뒤 같이 번역을 해 나가는 방법이다. Offline 으로만으로도 가능한 방법이지만 효율적인 방법으로 다른 방법들을 곁들일 수 있겠다.
* 온라인이라는 잇점이 있다. 시간과 공간의 제약을 덜 받는다. 하지만, 오프라인을 배제해서는 안된다. 각각의 대화수단들은 장단점들이 존재한다. 위키의 프로젝트는 가급적 Offline에서의 프로젝트, 스터디와 이어져야 그 효과가 클 것이다. ZeroPage 의 ["정모"] 때 자신이 하고 있는 일에 대한 상황을 발표하고, 서로 의사소통을 할 수 있겠다.
- 정규표현식/스터디/문자하나찾기/예제 . . . . 1 match
[[tableofcontents]]
- 정렬/장창재 . . . . 1 match
ofstream fout("output.txt");
- 조재화 . . . . 1 match
== Profile ==
- 황세중 . . . . 1 match
== profile ==
Found 100 matching pages out of 7557 total pages (510 pages are searched)
You can also click here to search title.
