• Proceedings of the Korea Multimedia Society Conference
• /
• 2003.05b
• /
• pp.555-558
• /
• 2003

본 연구는 이동 전화나 PDA와 같은 모바일 단말기를 이용하는 무선 인터넷 환경에서 데이터베이스 테이블로부터 Java 객체를 생성하여 이들 중간 형태인 XML 문서로 출력하고, 이러한 XML 문서들을 다시 XML 파서와 XSLT 처리기를 통해 무선 단말기에 적합한 마크업 언어 파일을 생성하여 단말기로 전송한다. 이를 통해 기존의 유선 인터넷상의 HTML 컨덴츠뿐만 아니라 데이터베이스 등 다른 정보들도 실시간으로 접근할 수 있는 장점을 제공한다. 향후에는 편리한 GUI, 매핑 규칙 선택 도구, previewer 제공 등을 위한 연구가 진행되어야 한 것이다.

• Korean Journal of Mathematics
• /
• v.31 no.3
• /
• pp.269-294
• /
• 2023

The purpose of this paper is to introduce a new three-step iterative process and show that our iteration scheme is faster than other existing iteration schemes in the literature. We provide a numerical example supported by graphs and tables to validate our proofs. We also prove convergence and stability results for the approximation of fixed points of the contractive-like mapping in the framework of uniformly convex Banach space. In addition, we have established some weak and strong convergence theorems for nonexpansive mappings.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.1
• /
• pp.1-16
• /
• 1996

In this paper, by combining the motion compensated transform coding with the sub-band decomposition technique, we present a motion compensated sub-band coding technique(MCSBC) for image sequence coding. Several problems related to the MCSBC, such as a scheme for motion compensation in each sub-band and the efficient VWL coding of the DCT coefficients in each sub-band are discussed. For an efficient coding, the motion estimation and compensation is performed only on the LL sub-band, but the discrete cosine transform(DCT) is employed to encode all sub-bands in our approach. Then, the transform coefficients in each sub-band are scanned in a different manner depending on the energy distributions in the DCT domain, and coded by using separate 2-D Huffman code tables, which are optimized to the probability distributions in the DCT domain, and coded by using separate 2-D Huffman code tables, which are optimized to the probability distribution of each sub-band. The performance of the proposed MCSBC technique is intensively examined by computer simulations on the HDTV image sequences. The simulation results reveal that the proposed MCSBC technique outperforms other coding techniques, especially the well-known motion compensated transform coding technique by about 1.5dB, in terms of the average peak signal to noise ratio.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.6C
• /
• pp.824-833
• /
• 2004

Due to the bandwidth and storage limitations, medical images are needed to be compressed before transmission and storage. DICOM (Digital Imaging and Communications in Medicine) specification, which is the medical images standard, provides a mechanism for supporting the use of JPEG still image compression standard. In this paper, we explain a method for compressing medical images by JPEG standard and propose two methods for JPEG compression. First, because medical images differ from natural images in optical feature, we propose a method to design adaptively the quantization table using spectrum analysis. Second, because medical images have higher pixel depth than natural images do, we propose a method to design Huffman table which considers the probability distribution feature of symbols. Therefore, we propose methods to design a quantization table and Huffman table suitable for medical images. Simulation results show the improved performance compared to the quantization table and the adjusted Huffman table of JPEG standard. Proposed methods which are satisfied JPEG Standard, can be applied to PACS (Picture Archiving and Communications System).

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.12A
• /
• pp.982-990
• /
• 2009

The IEEE 802.15.4 wireless sensor network is composed of the unique sensor devices to monitor and collect physical or environmental conditions. The interests in a positioning technology, which is one of the environment monitoring technologies, are gradually increased according to the development of the sensor technology and IT infrastructure. Generally, it is difficult for the positioning system using RSSI (Received Signal Strength Indication) based implementation to get accurate position because of obstacles, RF wave's delay and multipath. Therefore, in this paper, we investigate the improved positioning technologies for RSSI-based positioning system. This paper also proposes the enhanced scheme to improve the accuracy of positioning system by applying the Gaussian Filter algorithm, which is widely used for enhancing the performance of image processing system. For the implementation of proposed scheme, we firstly make a look-up tables, which represent the distance between target node and master node and corresponding RSSI value of each target node which are recorded as an average value after investigating the characteristics of attenuation of transmitted signal By applying the pre-determined look-up tables and Gaussian Filtering in the proposed scheme, we analyzed the positioning performance and compared with other conventional RSSI-based positioning algorithms.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.1
• /
• pp.13-21
• /
• 2008

In general, data communication among sensor nodes requires more energy than internal processing or sensing activities. In this paper, we propose a noble technique to reduce the number of packet transmissions necessary for sending/receiving queries/results among neighboring nodes with the help of context-aware routing tables. The important information maintained in the context-aware routing table is which physical properties can be measured by descendent nodes reachable from the current node. Based on the information, the node is able to eliminate unnecessary packet transmission by filtering out the child nodes for query dissemination or result relaying. The simulation results show that up to 80% of performance gains can be achieved with our technique.

• The Bulletin of The Korean Astronomical Society
• /
• v.40 no.1
• /
• pp.84.2-84.2
• /
• 2015

There are probabilistic forecast models for solar flare occurrence, which can be evaluated by various skill scores (e.g. accuracy, critical success index, heidek skill score, true skill score). Since these skill scores assume that two types of forecast errors (i.e. false alarm and miss) are equal or constant, which does not take into account different situations of users, they may be unrealistic. In this study, we make an evaluation of a probabilistic flare forecast model (Lee et al. 2012) which use sunspot groups and its area changes as a proxy of flux emergence. We calculate daily solar flare probabilities from 1996 to 2014 using this model. Overall frequencies are 61.08% (C), 22.83% (M), and 5.44% (X). The maximum probabilities computed by the model are 99.9% (C), 89.39% (M), and 25.45% (X), respectively. The skill scores are computed through contingency tables as a function of forecast probability, which corresponds to the maximum skill score depending on flare class and type of a skill score. For the critical success index widely used, the probability threshold values for contingency tables are 25% (C), 20% (M), and 4% (X). We use a value score with cost/loss ratio, relative importance between the two types of forecast errors. We find that the forecast model has an effective range of cost/loss ratio for each class flare: 0.15-0.83(C), 0.11-0.51(M), and 0.04-0.17(X), also depending on a lifetime of satellite. We expect that this study would provide a guideline to determine the probability threshold for space weather forecast.

• Journal of the Korean Society of Propulsion Engineers
• /
• v.15 no.5
• /
• pp.60-65
• /
• 2011

The development of an air data acquisition algorithm has been described in the supersonic flow at the preliminary design stage with pressure data acquisition device composed of major three total pressure sensors and two static pressure sensors which are installed on the surface of a cone type supersonic inlet. Through this algorithm, Mach number, angle of attack and sideslip angle can be very easily derived with simple interpolation algorithm and predefined data tables. The available range of Mach number is 1.6 to 4.0, angle of attack, $-12^{\circ}$ to $12^{\circ}$ and sideslip angle, $-12^{\circ}$ to $12^{\circ}$. In preliminary design stage, the data tables applied to the developed algorithm are constructed with data driven by Taylor Maccoll equation. The present algorithm would be useful to get supersonic flow air data for the various aerial vehicles and their flight tests.

• Smart Structures and Systems
• /
• v.20 no.4
• /
• pp.427-440
• /
• 2017

One of the suitable structural damage detection methods using vibrational characteristics are damage-index-based methods. In this study, a damage index for identifying damages in plate structures using frequency response function (FRF) data has been provided. One of the significant challenges of identifying the damages in plate structures is high number of degrees of freedom resulting in decreased damage identifying accuracy. On the other hand, FRF data are of high volume and this dramatically decreases the computing speed and increases the memory necessary to store the data, which makes the use of this method difficult. In this study, FRF data are compressed using two-dimensional principal component analysis (2D-PCA), and then converted into damage index vectors. The damage indices, each of which represents a specific condition of intact or damaged structures are stored in a database. After computing damage index of structure with unknown damage and using algorithm of lookup tables, the structural damage including the severity and location of the damage will be identified. In this study, damage detection accuracy using the proposed damage index in square-shaped structural plates with dimensions of 3, 7 and 10 meters and with boundary conditions of four simply supported edges (4S), three clamped edges (3C), and four clamped edges (4C) under various single and multiple-element damage scenarios have been studied. Furthermore, in order to model uncertainties of measurement, insensitivity of this method to noises in the data measured by applying values of 5, 10, 15 and 20 percent of normal Gaussian noise to FRF values is discussed.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.9
• /
• pp.1786-1792
• /
• 2015

Random linear network coding (RLNC) is widely employed to enhance the reliability of wireless multicast. In RLNC encoding/decoding, Galois Filed (GF) arithmetic is typically used since all the operations can be performed with symbols of finite bits. Considering the architecture of commercial computers, the complexity of arithmetic operations is constant regardless of the dimension of GF m, if m is smaller than 32 and pre-calculated tables are used for multiplication/division. Based on this, we show that the complexity of RLNC inversely proportional to m. Considering additional overheads, i.e., the increase of header length and memory usage, we determine the practical value of m. We implement RLNC in a commercial computer and evaluate the codec throughput with respect to the type of the tables for multiplication/division and the number of original packets to encode with each other.