• 한국정보과학회논문지:컴퓨팅의 실제 및 레터
• /
• 제16권11호
• /
• pp.1071-1075
• /
• 2010

무선 센서 네트워크에 활용되는 센서 노드는 제한된 전력, 메모리 동의 한정된 자원을 지니기 때문에, 제한된 에너지를 효율적으로 관리하기 위한 데이터 집계 기법의 연구가 활발히 진행되어 왔다. 한편, 센서 네트워크는 무선통신을 수행하기 때문에 공격자에게 쉽게 데이터 노출될 수 있다. 따라서, 센서 네트워크에서 데이터 집계를 위한 데이터 보호 기법에 관한 연구가 필수적이다. 그러나, 기존 데이터 집계를 위한 데이터 보호 기법은 네트워크 구성 및 데이터 집계 처리 시, 다수의 연산과 데이터 전송이 발생한다. 이러한 문제점을 해결하기 위하여, 본 논문에서는 데이터 집계를 위한 힐버트 커브(hilbert curve) 기반 데이터 보호 기법을 제안한다. 제안하는 기법은 트리 기반의 라우팅을 구성하여 이웃노드와의 통신을 최소화한다. 또한 seed에 기반한 힐버트 커브 기법을 통해 데이터를 암호화함으로써, 센서 노드간의 통신 시 공격자로부터 데이터를 보호할 수 있다. 마지막으로, 제안하는 기법이 메시지 전송량 및 센서노드 평균 수명 측면에서 기존 연구보다 우수함을 보인다.

• 대한의용생체공학회:의공학회지
• /
• 제28권6호
• /
• pp.791-797
• /
• 2007

This paper proposes a semiautomatic vertebra segmentation method that overcomes limitations of both manual segmentation requiring tedious user interactions and fully automatic segmentation that is sensitive to initial conditions. The proposed method extracts fence surfaces between vertebrae, and segments a vertebra using fence-limited region growing. A fence surface is generated by a deformable model utilizing valley information in a valley emphasized Gaussian image. Fence-limited region growing segments a vertebra using gray value homogeneity and fence surfaces acting as barriers. The proposed method has been applied to ten patient data sets, and produced promising results accurately and efficiently with minimal user interaction.

• 한국가금학회지
• /
• 제8권1호
• /
• pp.25-30
• /
• 1981

This study was conducted to find the method that the least-cost formula can be determined thus allowing a better keeping of raw material supplies under the constraints having to be used some raw materials that are either in limited supply or for other reason in restricted use. In this study, it was considered that three kinds of feed were produced under limited supply of six kinds of raw materials, and data for the analysis were collected from a feed mill in southern part of Korea. According to the result of this study, it was proved better to determine the least-cost formula as the multi-mix problem than as the simple least-cost problem when more than two kinds of feed were produced wilt limited supply of raw materials.

• Journal of Information Technology Applications and Management
• /
• 제22권2호
• /
• pp.1-17
• /
• 2015

In this research, we develop and suggest branch and bound algorithms for a two-machine permutation flowshop scheduling problem with the objective of minimizing makespan. In this scheduling problem, after each job is operated on the machine 1 (first machine), the job has to start its second operation on machine 2 (second machine) within its corresponding limited waiting time. In addition, each job has its corresponding ready time at the machine 1. For this scheduling problem, we develop various dominance properties and three lower bounding schemes, which are used for the suggested branch and bound algorithm. In the results of computational tests, the branch and bound algorithms with dominance properties and lower bounding schemes, which are suggested in this paper, can give optimal solution within shorter CPU times than the branch and bound algorithms without those. Therefore, we can say that the suggested dominance properties and lower bounding schemes are efficient.

• 산업기술연구
• /
• 제29권B호
• /
• pp.33-39
• /
• 2009

The need for end-to-end security has been increased with the widespread use of mobile devices in wireless internet access applications such as mobile commerce. The WAP1.x has an end-to-end security problem that the message transmitted between the mobile device and the Web server is decrypted inside the gateway within a short time. To overcome this problem, several protocols including WAP2.0 has been proposed. These protocols require that the heavy modules such as TLS or data compression modules should be installed on the mobile device with limited resources. This paper proposes a new WTLSW(WTLS-TLS at Web server) protocol and a new WAP2.0 proxy model in order to ensure end-to-end security between the mobile device and the Web server and to be appropriate for mobile devices with limited resources.

• 품질경영학회지
• /
• 제36권1호
• /
• pp.31-39
• /
• 2008

This paper proposes a method of estimating the lifetime distribution at use condition for constant stress accelerated life tests when an infant-mortality failure mode as well as wear-out one exists. General limited failure population model is introduced to describe these failure modes. It is assumed that the log lifetime of each failure mode follows a location-scale distribution and a linear relation exists between the location parameter and the stress. An estimation procedure using the expectation and maximization algorithm is proposed. Specific formulas for Weibull distribution are obtained. An illustrative example and the simulation results are given.

• 한국전산구조공학회:학술대회논문집
• /
• 한국전산구조공학회 2001년도 가을 학술발표회 논문집
• /
• pp.101-108
• /
• 2001

In the previous study, an improved QRD (QR Decomposition)-ILS(Iterative Least-Squares) method is proposed to estimate the structural parameters at the element level using response data alone without using any information of excitation measurements for the assessment of local damages and deterioration in complex and large structural systems. But for a complex and large structural system, where response measurement at every dynamic degree of freedom(DDOF) is not possible, the absence of some observation points of responses and its effect on the proposed SI method must be studied In the paper, a QRD-ILS technique that utilizes the known intact stiffness information estimated based on the visual inspection, field measurements and/or NDT tests is proposed to identify local damages of fracture critical members using measured responses only at limited DDOFs. A numerical example is used to illustrate the application of this technique. The results indicate that the proposed SI technique is very simple but efficient, since no input information are required with only limited observations.

• Journal of Information Processing Systems
• /
• 제18권4호
• /
• pp.480-488
• /
• 2022

Images of tobacco retail licenses have complex unstructured characteristics, which is an urgent technical problem in the robot process automation of tobacco marketing. In this paper, a novel recognition approach using a double attention mechanism is presented to realize the automatic recognition and information extraction from such images. First, we utilized a DenseNet network to extract the license information from the input tobacco retail license data. Second, bi-directional long short-term memory was used for coding and decoding using a continuous decoder integrating dual attention to realize the recognition and information extraction of tobacco retail license images without segmentation. Finally, several performance experiments were conducted using a largescale dataset of tobacco retail licenses. The experimental results show that the proposed approach achieves a correction accuracy of 98.36% on the ZY-LQ dataset, outperforming most existing methods.

• Journal of Information Processing Systems
• /
• 제18권3호
• /
• pp.311-318
• /
• 2022

Tobacco sales enterprises often need to summarize and verify the daily sales bills, which may consume substantial manpower, and manual verification is prone to occasional errors. The use of artificial intelligence technology to realize the automatic identification and verification of such bills offers important practical significance. This study presents a novel multi-branch residual network for tobacco sales bills to improve the efficiency and accuracy of tobacco sales. First, geometric correction and edge alignment were performed on the input sales bill image. Second, the multi-branch residual network recognition model is established and trained using the preprocessed data. The comparative experimental results demonstrated that the correct recognition rate of the proposed method reached 98.84% on the China Tobacco Bill Image dataset, which is superior to that of most existing recognition methods.

• Journal of Information Technology Applications and Management
• /
• 제11권1호
• /
• pp.189-200
• /
• 2004

Recently Flash Memory which is small and low-powered is widely used as a storage of embedded system, because an embedded system requests portability and a fast response. To resolve a difference of access time between a storage and RAM, Linux is using disk caching which copies a part of file on disk into RAM. It is not also an exception on embedded system. A READ access-time of flash memory is similar to RAMs. So, when a process on an embedded system reads data, it is similar to the time to access cached data in RAM and to access directly data on a flash memory. On the embedded system using limited memory, using a disk cache is that wastes much time and memory spaces to manage it and can not reflects the characteristic of a flash memory. This paper proposes the regular file access of limited using a page cache in the file system based on a flash memory and reflects the characteristic of a flash memory. The proposed algorithm minimizes power consumption because access numbers of the RAM are reduced and doesn't waste a memory space because it accesses directly to a flash memory Therefore, the performance improvement of the system applying the proposed algorithm is expected.