• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2002년도 가을 학술발표논문집 Vol.29 No.2 (1)
• /
• pp.376-378
• /
• 2002

가상 메모리 관리에서 가장 근 문제점은 느린 보조기억 장치의 속도와 빠른 주기억장치의 속도 차이에서 나타나는 성능 저하라고 할 수 있다 요구 페이징 기법에서 Page Fault가 일어나면 페이지 교체 정책에 의해 필요 없는 page들을 swap device로 이동을 시킨다. 이때 느린 보조기억장치의 접근 속도로 인한 응답시간의 지연은 전체적인 시스템 성능의 저하를 초래한다. 그래서 Swap Device로의 접근 횟수와 페이지의 크기를 줄일 수 있다면 Page Out되는 응답시간을 높일 수 있을 것이다. 따라서 본 논문에서는 가상 메모리 압축 시스템을 설계하여 Swap Out 되는 시간을 줄여 시스템의 전체적인 성능 향상을 위한 시스템을 구현한다.

• 한국IT서비스학회지
• /
• 제12권4호
• /
• pp.41-57
• /
• 2013

As the usage of SNS has grown dramatically over the last years, it has been used in various sectors not just a tool for communication. In particular, corporate companies actively use Facebook as a tool for corporate marketing. Corporate companies communicate with their customers by providing service or events information. In this study, empirical analysis was carried out on corporate companies that are using Facebook as a marketing tool, thus finding out the influencing factors in continued usage of Facebook Fan Page users. In addition, analysis of the factors will be investigated according to continued usage of the users, where the user's intention will differ depending on how corporate companies operate and deal with the Facebook Fan Page. Factors affecting the user's satisfaction, perceived usefulness, and perceived playfulness were deducted through the analysis of the existing literature study on corporate company's continued intention on the usage of Facebook Fan Page. Accordingly, factor affecting this such as relationship, speed, content diversity, which are the media characteristics of the Facebook were deducted and finally hypothesized. In addition, the type of corporate company's Facebook Fan Page was divided into event type, communication type, information service type. And hence investigated the factors that differed from the continued usage depending on the type. Results analysis shows that perceived usefulness affected only relationship, speed, content diversity. Furthermore, analysis shows that corporate company's Fan Page of communication and event types are the factors that affect the usage intention which meant it only affected the perceived enjoyment. On the basis of this study, we are able to present an implication of value where corporate company use it as a marketing tool, through factors from continued usage of coroporate company's Facebook Fan Page users.

• 한국생물공학회:학술대회논문집
• /
• 한국생물공학회 2005년도 생물공학의 동향(XVI)
• /
• pp.158-162
• /
• 2005

정어리에서 분리한 5개의 균주를 이용하여 antiangiogenesis 효과가 가장 뛰어난 균주를 ${\lambda}-28$이라 명명하고 이를 대량 배양하여 단백질 추출법인 염석과 투석, 동결건조를 통해 시료를 제조하여 이를 SEC를 통해 fraction별로 분리한 후 SDS-PAGE와 antiangiogenesis, cytotoxcity test를 수행하여 ${\lambda}-28$번의 76 fraction에서 control군에 비해 82.7%의 높은 antiangiogenesis 효과를 보였고, 세포독성 실험에서도 낮은 독성을 보였다.

• 한국정보과학회논문지:시스템및이론
• /
• 제35권2호
• /
• pp.66-74
• /
• 2008

내장형 시스템은 민감한 데이타를 다루고 저장하기 때문에 정보를 암호화하여 보호하는 암호화 파일 시스템이 필요하지만, 암호화 파일 시스템 적용은 성능 저하가 크기 때문에 내장형 시스템에는 널리 적용되지 못하였다. 기존의 암호화 파일 시스템은 시스템 구조상 불필요한 성능저하를 가져온다. 본 논문에서 제안하는 ISEA(Indexed and Separated Encryption Approach)는 이러한 불필요한 성능 저하를 제거하고, 시스템이 효율적으로 암복호화를 지원하는 새로운 암복호화 기법이다. ISEA는 암호화와 복호화를 페이지 캐쉬를 기준으로 서로 다른 계층에서 수행한다. 즉, 암호화는 페이지 캐쉬 하위 계층에서 수행하고 복호화는 페이지 캐쉬 상위 계층에서 수행한다. 복호화한 내용은 페이지 캐쉬에 저장하여 후속 I/O 요구에 사용할 수 있게 한다. 또한, ISEA는 페이지를 암호화 블록 단위로 나누어 관리하는 페이지 인덱싱 기법을 제공한다. 페이지 인덱싱은 필요에 따라 페이지를 부분적으로 복호화하여 불필요한 복호화 연산을 제거한다. 페이지 캐쉬 탐색 성공률과 읽기/쓰기 사이즈를 종합한 성능 평가에서 ISEA는 효율적인 성능개선을 보여준다.

• 대한임베디드공학회논문지
• /
• 제9권4호
• /
• pp.205-210
• /
• 2014

Cache based live migration method utilizes a cache, which is accessible to both side (remote and local), to reduce the virtual machine migration time, by transferring only irredundant data. However, address space layout randomization (ASLR) is proved to reduce the memory duplicate ratio between targeted migration memory and the migration cache. In this pager, we analyzed the behavior of ASLR to find out how it changes the physical memory contents of virtual machines. We found that among six virtual memory regions, only the modification to stack influences the page-level memory duplicate ratio. Experiments showed that: (1) the ASLR does not shift the heap region in sub-page level; (2) the stack reduces the duplicate page size among VMs which performed input replay around 40MB, when ASLR was enabled; (3) the size of memory pages, which can be reconstructed from the fresh booted up state, also reduces by about 60MB by ASLR. With those observations, when applying cache-based migration method, we can omit the stack region. While for other five regions, even a coarse page-level redundancy data detecting method can figure out most of the duplicate memory contents.

• 한국정보과학회논문지:시스템및이론
• /
• 제36권6호
• /
• pp.476-487
• /
• 2009

BSD 가상 메모리 시스템(BSD VM)은 페이지-아웃 시 디스크 I/O 횟수를 줄이기 위해 클러스터링 기법을 사용한다. 이 기법은 페이지-아웃 대상 페이지와 가상 메모리 공간에서 인접한 변경 페이지들을 그 대상 페이지와 함께 클러스터(그룹)를 만들어 한 번의 디스크 I/O로 디스크에 저장한다. 하지만 응용 프로그램이 가상 메모리 공간에서 서로 인접하지 않은 다수의 페이지들을 변경하면 클러스터들의 크기가 작아져 클러스터링의 효과가 감소된다. 이 문제점을 해결하기 위해 본 논문에서는 Multiple-Object Clustering(MOC) 기법을 제안한다. MOC는 클러스터별로 디스크 I/O를 하는 대신 여러 클러스터들을 모아 단일 디스크 쓰기로 페이지-아웃시킨다. 따라서 이 페치지-아웃 방식은 디스크 I/O 횟수를 감소시켜 시스틴 성능을 크게 향상시킨다. MOC는 성능 검증을 위해 FreeBSD 6.2 운영체제 커널에서 구현되었다. NS2, Scimark2 SOR, nbench LU 벤치마크를 통한 MOC 성능 측정 결과 기존 BSD VM보다 MOC의 실행 씨간이 9~45% 단축되었다.

• 산업기술연구
• /
• 제15권
• /
• pp.235-244
• /
• 1995

In this paper, we propose a bulk-load algorithm for $B^+-trees$, the most widely used index structures in database systems. The main characteristic of our algorithm is to simultaneously process all the keys to be placed on each $B^+-trees$ page when accessing the page. This avoids the overhead for accessing the same page multiple times, which results from applying the $B^+-trees$ insertion algorithm repeatedly. For performance evaluation, we analyze our algorithm in terms of the number of disk accesses. The results show that the number of disk accesses excluding those in the redistribution process in identical to the number of $B^+-trees$ pages. Considering that the redistribution process is an unavoidable preprocessing step for bulk-loading, our algorithm requires just one disk access per $B^+-trees$ page, and therefore turns out to be optimal. We also present performance tendancy according to the changes of parameter values via simulation.

• 한국언어정보학회:학술대회논문집
• /
• 한국언어정보학회 2007년도 정기학술대회
• /
• pp.285-292
• /
• 2007

The parallel corpus is an important resource in the research field of data-driven natural language processing, but there are only a few parallel corpora publicly available nowadays, mostly due to the high labor force needed to construct this kind of resource. A novel strategy is brought out to automatically fetch parallel text from the web in this paper, which may help to solve the problem of the lack of parallel corpora with high quality. The system we develop first downloads the web pages from certain hosts. Then candidate parallel page pairs are prepared from the page set based on the outer features of the web pages. The candidate page pairs are evaluated in the last step in which the sentences in the candidate web page pairs are extracted and aligned first, and then the similarity of the two web pages is evaluate based on the similarities of the aligned sentences. The experiments towards a multilingual web site show the satisfactory performance of the system.

• Journal of the Korean Physical Society
• /
• 제73권10호
• /
• pp.1420-1430
• /
• 2018

We investigate an entangled system, which is analogous to a composite system of a black hole and Hawking radiation. If Hawking radiation is well approximated by an outgoing particle generated from pair creation around the black hole, such a pair creation increases the total number of states. There should be a unitary mechanism to reduce the number of states inside the horizon for black hole evaporation. Because the infalling antiparticle has negative energy, as long as the infalling antiparticle finds its partner such that the two particles form a separable state, one can trace out such a zero energy system by maintaining unitarity. In this paper, based on some toy model calculations, we show that such a unitary tracing-out process is only possible before the Page time while it is impossible after the Page time. Hence, after the Page time, if we assume that the process is unitary and the Hawking pair forms a separable state, the internal number of states will monotonically increase, which is supported by the Almheiri-Marolf-Polchinski-Sully (AMPS) argument. In addition, the Hawking particles cannot generate randomness of the entire system; hence, the entanglement entropy cannot reach its maximum. Based on these results, we modify the correct form of the Page curve for the remnant picture. The most important conclusion is this: if we assume unitarity, semi-classical quantum field theory, and general relativity, then the black hole should violate the Bekenstein-Hawking entropy bound around the Page time at the latest; hence, the infinite production arguments for remnants might be applied for semi-classical black holes, which seems very problematic.

• Food Science and Biotechnology
• /
• 제15권2호
• /
• pp.324-327
• /
• 2006

The food-borne pathogen Listeria monocytogenes is commonly associated with meats and unpasteurized dairy products. To identify this pathogen in meats more efficiently than has been done in the past, we purchased meats from Korean markets and performed sodium dodecyl sulfate-polyacrylamide gel electrophoresis (SDS-PAGE) and serotyping analysis on Listeria organisms isolated from meat samples. Each Listeria species showed specific protein band patterns on SDS-PAGE. Whole-cell protein SDS-PAGE profiles indicated that the organisms isolated from meats sold in local Korean markets were L. monocytogenes with the serotypes 1/2a, 1/2b, 1/2c, and 4b. We suggest that it is possible to carry out molecular subtyping of L. monocytogenes using SDS-PAGE.