• International Journal of Advanced Culture Technology
• /
• 제5권2호
• /
• pp.98-105
• /
• 2017

Smartphones are fast growing in the IT market and are the most influential devices in our daily life. Smartphones are being studied for their use in body sensor networks with excellent processing power and wireless communication technology. In this paper, we propose a coordinator design that provides data collection, classification, and display using based on Android-smartphone in multiple sensor nodes. The coordinator collects data of sensor nodes that measure biological patterns using wireless communication technologies such as Bluetooth and NFC. The coordinator constructs a network using a multiple-level scheduling algorithm for efficient data collection at multiple sensor nodes. Also, to support different protocols between heterogeneous sensors, a data sheet recording wireless communication protocol information is used. The designed coordinator used Arduino to test the performance of multiple sensor node environments.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2009년도 춘계학술발표대회
• /
• pp.846-848
• /
• 2009

The interest in the access and integration of distributed massive data resources has increased recently. This paper presents the Advanced Collection Manager(CM) service with OGSA-DAI component which can access and integrate the distributed data resources. The Advanced CM service supports the data resource of various types. And it can provide the query, updating, transforming and delivering data via cooperating with other services in Grid Information Retrieval(Grid-IR or GIR) System. As a result, it can access and manage the data resource more flexible and efficient.

• Journal of Positioning, Navigation, and Timing
• /
• 제12권2호
• /
• pp.91-100
• /
• 2023

The existing indoor localization method using Wi-Fi fingerprinting has a high collection cost and relatively low accuracy, thus requiring integrated correction of convergence with other technologies. This paper proposes a new method that significantly reduces collection costs compared to existing methods using Wi-Fi fingerprinting. Furthermore, it does not require labeling of data at collection and can estimate pedestrian travel paths even in large indoor spaces. The proposed pedestrian movement path estimation process is as follows. Data collection is accomplished by setting up a feature area near an indoor space intersection, moving through the set feature areas, and then collecting data without labels. The collected data are processed using Kernel Linear Discriminant Analysis (KLDA) and the valley point of the Euclidean distance value between two data is obtained within the feature space of the data. We build learning data by labeling data corresponding to valley points and some nearby data by feature area numbers, and labeling data between valley points and other valley points as path data between each corresponding feature area. Finally, for testing, data are collected randomly through indoor space, KLDA is applied as previous data to build test data, the K-Nearest Neighbor (K-NN) algorithm is applied, and the path of movement of test data is estimated by applying a correction algorithm to estimate only routes that can be reached from the most recently estimated location. The estimation results verified the accuracy by comparing the true paths in indoor space with those estimated by the proposed method and achieved approximately 90.8% and 81.4% accuracy in two experimental spaces, respectively.

• 한국문헌정보학회지
• /
• 제8권
• /
• pp.233-263
• /
• 1981

The purpose of this study is to bring out the most reasonable and feasible evaluation methods of research library collection in Korea. At the very outset, writer tried to define the purpose and the necessity of collection evaluation. Writer described a collection evaluation is to gain the data for decision making on selection policy, weeding and storage project, and explained it is one of the procedures of a collection development system operation of being explained as repeated three procedures through a collection development plan, an implimentation of the set plan(selection process) and a collection evaluation. Writer also pointed out the fact many libraries in Korea are apt to by pass or overlook this important process. Writer then defined the criteria of a collection evaluation as the measurement of the proportion of library holding's capability to meet users' demands and that of the degree of total collection's utilization. Writer introduced and analysed seven existing collection evaluation methods and concluded the method by a survey of users' needs and opinion and the method by a circulation survey are the most feasible and reasonable methods that can be applied. Writer also added that using above two evaluation methods together can enhance the effectiveness of collection evaluation.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2006년도 Proceedings of ISRS 2006 PORSEC Volume II
• /
• pp.788-790
• /
• 2006

The algorithm of calculating NUC table, based on Image data collection, is based on two basic assumptions. These basic assumptions are as follow: one is the NUC is of a linear nature. The other is all pixel see the same statistical distribution for large number of lines. We generated NUC tables for a radiometric calibration & validation of KOMPSAT-2 using a dark cal. Data.

• 국제학술발표논문집
• /
• The 3th International Conference on Construction Engineering and Project Management
• /
• pp.27-29
• /
• 2009

Real-time control of on-site construction, based on high quality data, is essential to identify discrepancies between actual and planned performances. Additionally, real-time control enables timely corrective measures to be taken when needed to reduce the damages caused by the discrepancies. The focus of the presentation will be on our work, which uses automated data technologies to collect data needed for real time control.

• 한국문헌정보학회지
• /
• 제44권2호
• /
• pp.333-356
• /
• 2010

작은도서관은 일반적인 공공도서관에 비해서 장서의 양과 다양성이 부족하므로 실증적인 분석에 기초하여 장서를 평가하고 개발해야할 필요성이 더욱 절실하다. 이 연구에서는 전통적으로 장서평가에 사용하는 소장 데이터와 대출 데이터 이외에 작은도서관에서 특히 활발한 상호대차 데이터를 함께 분석하여 작은도서관을 위한 장서평가방법을 사례와 함께 제시하고자 하였다. 자료 수집과 분석은 한 지역 내에서 상호대차가 운영되는 작은도서관 14개관을 대상으로 하였고 장서량과 이용량(대출 + 상호대차)을 비교하여 각 도서관의 특징을 파악하였다. 또한 KDC의 강 단위로 구분한 주제별 장서 통계와 이용 통계에 대한 분석을 통해 작은도서관에서 활발히 이용되는 주제 분야와 정책적인 대처가 필요한 주제 분야를 파악할 수 있었다.

• 한국디자인학회:학술대회논문집
• /
• 한국디자인학회 1999년도 추계 학술발표대회 논문집
• /
• pp.48-49
• /
• 1999

인터넷을 사용한 설문조사는 대상층이 인터넷을 사용하는 계층으로 한정되어 있다는 약점을 가지고 있음에도 불구하고 쉽고 빠르게 많은 양의 데이터를 얻을 수 있다는 장점 때문에 많이 사용되어지고 있다. (중략)

• 한국정보과학회논문지:시스템및이론
• /
• 제37권3호
• /
• pp.161-171
• /
• 2010

임베디드 시스템이 모놀리식(monolithic) 커널을 사용하면서, NAND 플래시 메모리는 가상 메모리 시스템의 스왑(swap) 공간을 위해 사용되고 있다. 플래시 메모리는 저전력 소비, 충격 내구성, 비 휘발성의 장점을 가지지만, '쓰기 전 삭제'의 특징 때문에 가비지 컬렉션(GC) 작업이 필요하다. GC 기법의 효율성은 플래시 메모리 성능에 큰 영향을 미친다. 본 논문에서는 플래시 메모리를 기반으로 하는 가상 메모리 시스템에서 메인 메모리와 플래시 메모리 사이에 중복된 데이터를 활용한 새로운 GC 기법을 제안한다. 제안된 기법은 GC 부하를 최소화하기 위해 데이터의 지역성을 고려한다. 실험 결과는 제안된 GC 기법이 이전의 기법과 비교하여 평균적으로 37%의 성능을 향상시킴을 보여준다.

• 인터넷정보학회논문지
• /
• 제5권6호
• /
• pp.1-10
• /
• 2004

A web robot is a software that has abilities of tracking and collecting web documents on the Internet(l), The performance scalability of recent web robots reached the limit CIS the number of web documents on the internet has increased sharply as the rapid growth of the Internet continues, Accordingly, it is strongly demanded to study on the performance scalability in searching and collecting documents on the web. 'Design of web robot based on Multi-Agent to speed up documents collection ' rather than 'Sequentially executing Web Robot based on the existing Fork-Join method' and the results of analysis on its performance scalability is presented in the thesis, For collection speedup, a Multi-Agent based web robot performs the independent process for inactive URL ('Dead-links' URL), which is caused by overloaded web documents, temporary network or web-server disturbance, after dividing them into each agent. The agents consist of four component; Loader, Extractor, Active URL Scanner and inactive URL Scanner. The thesis models a Multi-Agent based web robot based on 'Amdahl's Law' to speed up documents collection, introduces a numerical formula for collection speedup, and verifies its performance improvement by comparing data from the formula with data from experiments based on the formula. Moreover, 'Dynamic URL Partition algorithm' is introduced and realized to minimize the workload of the web server by maximizing a interval of the web server which can be a collection target.