• Title/Summary/Keyword: full-information

Search Result 3,672, Processing Time 0.028 seconds

Initialization Problem of Service Robots with Artificial Stars

  • Park, Young-Chul;Im, Jae-Myung;Kim, Jin-Oh
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2005.06a
    • /
    • pp.2042-2047
    • /
    • 2005
  • Many service robots which is interacting with human at home and in buildings have been developed. Few of them are shown in of the United States and of Japan. These robots are supposed to have a powerful indoor navigation performance in places where human beings live and work. The overall capability of service robots to move around in this environment is called environment correspondence, in which localization problem to find the accurate position and orientation is the most critical problem. While users set up a proper or a best environment for industrial robots, but for services robots at home and in buildings, it is very difficult to change the environment for robots. The expanded workspace due to mobility is difficult to be covered by means of those used for industrial robots because the cost increases and human beings do not want their environment to be changed for robots. This fact has made many researchers study efficient and effective environment correspondence problems. Among these problems, localization is the most difficult. Goal of localization study includes (1) Accurate detection of position and orientation (2) Minimum cost of the additional devices (3) Minimum change of human environment. In this study, as a solution of the above, we propose "Artificial Stars" which are attached on room ceiling as landmarks. In addition, we solve an adoption problem raised when a robot is delivered to a customer site and before it can perform its full navigation capability. We call this as "Initialization Problem" of service robots. We solve the initialization problem for both cases of environment with the map and without map. The proposed system is experimented and has shown how well it handles the initialization problem.

  • PDF

A Study on the Economic Contribution of IT Labor (IT 근로자의 부가가치 창출에 대한 기여도 분석)

  • Lee, Kang-Bae
    • The Journal of Information Systems
    • /
    • v.20 no.3
    • /
    • pp.187-207
    • /
    • 2011
  • As the IT labor captures an increasing proportion of the total labor, it is important to analyze the contribution of IT labor to national economy. Although there has been abundant research about the effect of IT investments, it is difficult to find a research about IT labor's economic contribution. Most prior studies on the effect of IT investment have focused on the effect of IT capital investment. This paper empirically explores whether and how IT labor makes contribution to Korean economy. And also this paper examines the economic contribution of IT experts and semi-experts in Korean industries over the 2000 to 2007 period, using production function framework and panel data set for 24 industries constructed from 'Input-Output table' and 'Research on Wage Structure Survey'. Based on the full sample of 120 observations, this study finds that a 1% increase in IT labor wage is associated with 0.042190% increase in added value. In the case of non-manufacturing industries on the sample of 50 observations, this study finds that a 1% increase in IT labor wage is associated with 0.074908% increase in added value. And in the case of IT experts (separated from IT semi-experts), this study finds that a 1% increase in IT expert's labor wage is associated with 0.013957% increase in added value of all industry. This study provides implication for policy makers and managers. The results suggests that non-manufacturing industries can capture further benefits by increasing investment in IT labor. Building on this study, future research should examine the impact of IT labor at a more detailed industry level and the firm level.

Improving Accuracy and Completeness in the Collaborative Staging System for Stomach Cancer in South Korea

  • Lim, Hyun-Sook;Won, Young-Joo;Boo, Yoo-Kyung
    • Asian Pacific Journal of Cancer Prevention
    • /
    • v.15 no.21
    • /
    • pp.9529-9534
    • /
    • 2014
  • Background: Cancer staging enables planning for the best treatments, evaluation of prognosis, and predictions for survival. The Collaborative Stage (CS) system makes it possible to significantly reduce the proportion of patients labeled at an "unknown" stage as well as discrepancies among different staging systems. This study aims to analyze the factors that influence the accuracy and validity of CS data. Materials and Methods: Data were randomly selected (233 cases) from stomach cancer cases enrolled for CS survey at the Korea Central Cancer Registry. Two questionnaires were used to assess CS values for each case and to review the cancer registration environment for each hospital. Data were analyzed in terms of the relationships between the time spent for acquisition and registration of CS information, environments relating to cancer registration in the hospitals, and document sources of CS information for each item. Results: The time for extracting and registering data was found to be shorter when the hospitals had prior experience gained from participating in a CS pilot study and when they were equipped with full-time cancer registrars. Evaluation of the CS information according to medical record sources found that the percentage of items missing for Site Specific Factor (SSF) was 30% higher than for other CS variables. Errors in CS coding were found in variables such as "CS Extension," "CS Lymph Nodes," "CS Metastasis at Diagnosis," and "SSF25 Involvement of Cardia and Distance from Esophagogastric Junction (EGJ)." Conclusions: To build CS system data that are reliable for cancer registration and clinical research, the following components are required: 1) training programs for medical records administrators; 2) supporting materials to promote active participation; and 3) format development to improve registration validity.

Development of Electronic Portfolio Assessment Processing Model in Elementary ICT Application Education (초등 ICT 활용교육에의 전자 포트폴리오 평가 절차 모형 개발)

  • Lee, Jeong-Min;Jun, Woo-Chun
    • Journal of The Korean Association of Information Education
    • /
    • v.10 no.1
    • /
    • pp.1-12
    • /
    • 2006
  • Sometimes the quantitative evaluation method does not explain students' full capacity in educational fields. In this point of view, performance assessment has been adapted widely since the assessment provides a comprehensive qualitative evaluation as well as quantitative evaluation. Portfolio is one of the most effective methods in performance assessment. However, the portfolio requires longer time in evaluation, physical space for storing data gathered from students. Electronic portfolio can overcome the above disadvantages of the traditional portfolio and increase students' ICT application capacity. The purpose of this study is to develop electronic portfolio assessment processing model and present concrete activities for each stage in the model. Our model consists of four stages, Preparation, Activity, Evaluation, and Application, respectively. Especially, our model is designed to provide different activities for students and teachers in each stage. Our model is expected to provide a good guidance to students, teachers and parents in understanding and utilizing portfolio assessment. Particularly our model will provide the comprehensive guidance to teachers in assessment process.

  • PDF

Side-Channel Attacks on LEA with reduced masked rounds (축소 마스킹이 적용된 경량 블록 암호 LEA-128에 대한 부채널 공격)

  • Park, Myungseo;Kim, Jongsung
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.25 no.2
    • /
    • pp.253-260
    • /
    • 2015
  • The side-channel attack is widely known as an attack on implementations of cryptographic algorithms using additional side-channel information such as power traces, electromagnetic waves and sounds. As a countermeasure of side channel attack, the masking method is usually used, however full-round masking makes the efficiency of ciphers dramatically decreased. In order to avoid such a loss of efficiency, one can use reduced-round masking. In this paper, we describe a side channel attack on the lightweight block cipher LEA with the first one~six rounds masked. Our attack is based on differentials and power traces which provide knowledge of Hamming weight for the intermediate data computed during the enciphering of plaintexts. According to our experimental result, it is possible to recover 25 bits of the first round key in LEA-128.

Scalable and Robust Data Dissemination Scheme for Large-Scale Wireless Sensor Networks (대규모 무선 센서 네트워크를 위한 확장성과 강건성이 있는 데이터 전송 방안)

  • Park, Soo-Chang;Lee, Eui-Sin;Park, Ho-Sung;Lee, Jeong-Cheol;Oh, Seung-Min;Jung, Ju-Hyun;Kim, Sang-Ha
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.12B
    • /
    • pp.1359-1370
    • /
    • 2009
  • In wireless sensor networks, data dissemination is based on data-centric routing that well matches the publish/subscribe communication paradigm. The publish/subscribe paradigm requires decoupling properties: space, time, and synchronization decoupling. For large-scale applications, the three decoupling properties provide scalability and robust communication. However, existing data dissemination schemes for wireless sensor networks do not achieve full decoupling. Therefore, we propose a novel data dissemination scheme that fully accomplishes the three decoupling, called ARBIETER. ARBITER constructs an independent network structure as a logical software bus. Information interworking between publishers and subscribers is indirectly and asynchronously performed via the network structure. ARBITER also manages storage and mapping of queries and data on the structure because of supporting different time connection of publishers and subscribers. Our simulation proves ARBITER show better performance in terms of scalability, network robustness, data responsibility, mobility support, and energy efficiency.

An Implementation of Pattern Recognition Algorithm for Fast Paper Currency Counting (고속 지폐 계수를 위한 패턴 인식 알고리즘 구현)

  • Kim, Seon-Gu;Kang, Byeong-Gwon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39B no.7
    • /
    • pp.459-466
    • /
    • 2014
  • In this paper, we suggest an efficient image processing method for fast paper currency counting with pattern recognition. The patterns are consisted of feature data in each note object extracted from full reflection image of notes and a general contact image sensor(CIS) is used to aggregate the feature images. The proposed pattern recognition algorithm can endure image variation when the paper currency is scanned because it is not sensitive to changes of image resulting in successful note recognition. We tested 100 notes per denomination and currency of several countries including Korea, U.S., China, EU, Britain and Turkey. To ensure the reliability of the result, we tested a total of 10 times per each direction of notes. We can conclude that this algorithm will be applicable to commercial product because of its successful recognition rates. The 100% recognition rates are obtained in almost cases with exceptional case of 99.9% in Euro and 99.8% in Turkish Lira.

A Study on Motion Estimator Design Using Bit Plane (비트 플레인을 이용한 움직임 추정기 설계에 관한 연구)

  • 박종진;이권철;김은원;조원경
    • The Journal of Information Technology
    • /
    • v.3 no.2
    • /
    • pp.39-47
    • /
    • 2000
  • Among the compression methods of moving picture information, a motion estimation method is used to remove time-repeating. The Block Matching Algorithm in motion estimation methods is the commonest one. In recent days, it is required the more advanced high quality in many image processing fields, for example HDTV, etc. Therefore, we have to accomplish not by means of Partial Search Algorithm, but by means of Full Search Algorithm in Block Matching Algorithm. In this paper, it is suggested a structure that reduce total calculation quantity and size, because the structure using Bit Plane select and use only 3bit of 8bit luminance signal.

  • PDF

Development of a Mini-OCS System for Voluntary Medical Services in the Challenged Regions

  • Park, Junghun;Oh, Dongik;Shin, Wonhan
    • Journal of Internet Computing and Services
    • /
    • v.19 no.5
    • /
    • pp.97-105
    • /
    • 2018
  • In this paper, we present our recent effort on the development of a portable OCS system (SCH-mOCS), which provides minimal but essential functionalities of conventional OCS systems. SCH-mOCS is targeted for the environment where Internet connection is not available and fast processing of essential patient information is needed. The main usage could be found at the outdoor environment, such as voluntary medical services at challenged regions. The target of the first usage of the system is in the rural area of Cambodia where medical service and ICT infrastructure is poor. We have been conducting voluntary medical services for 15 years in Cambodia, where the services usually run for 3 days and include outpatient diagnosis/consultation, medication, and simple surgeries. This medical service started in 2002, where about 20 SoonChunHyang University Bucheon Hospital staffs (doctors, nurses, and pharmacists) participated. We realized that a system like SCH-mOCS is needed: we have to consult many patients in a short period, so that a prompt response and prescription to the patients are very important. However, the conventional OCS system is not suitable, because the service is usually conducted outdoor environment where Internet connected computers cannot be installed. Moreover, since the service needs only a subset of the conventional hospital information system and fast system response, application of a full OCS is not practical. The adequate system is a bare minimal OCS system, with very simple and quickly manageable patient admission, consultation, and prescription functionalities. In this paper, we describe hardware as well as the software aspect of a mini-OCS we have developed for the purpose. We named the system SCH-mOCS (SoonChunHyang mini-OCS). We also describe the usage scenario of SCH-mOCS in order to demonstrate that the system is general enough to apply for other similarly challenged regions.

Propagation Models for Structural Parameters in Online Social Networks (온라인 소셜 네트워크에서 구조적 파라미터를 위한 확산 모델)

  • Kong, Jong-Hwan;Kim, Ik Kyun;Han, Myung-Mook
    • Journal of Internet Computing and Services
    • /
    • v.15 no.1
    • /
    • pp.125-134
    • /
    • 2014
  • As the social media which was simple communication media is activated on account of twitter and facebook, it's usability and importance are growing recently. Although many companies are making full use of its the capacity of information diffusion for marketing, the adverse effects of this capacity are growing. Because social network is formed and communicates based on friendships and relationships, the spreading speed of the spam and mal-ware is very swift. In this paper, we draw parameters affecting malicious data diffusion in social network environment, and compare and analyze the diffusion capacity of each parameters by propagation experiment with XSS Worm and Koobface Worm. In addition, we discuss the structural characteristics of social network environment and then proposed malicious data propagation model based on parameters affecting information diffusion. n this paper, we made up BA and HK models based on SI model, dynamic model, to conduct the experiments, and as a result of the experiments it was proved that parameters which effect on propagation of XSS Worm and Koobface Worm are clustering coefficient and closeness centrality.