• 제목/요약/키워드: Space Segment

Search Result 370, Processing Time 0.026 seconds

Dynamic Threshold based Even-wear Leveling Policies (동적 임계값을 이용한 메모리 소거)

  • Park, Je-Ho
    • Journal of the Semiconductor & Display Technology
    • /
    • v.6 no.2 s.19
    • /
    • pp.5-10
    • /
    • 2007
  • According to the advantageous features of flash memory, its exploitation and application in mobile and ubiquitous related devices as well as voluminous storage devices is being increased rapidly. The inherent properties that are determined by configuration of flash memory unit might restrict the promising expansion in its utilization. In this paper, we study policies based on threshold values, instead of using global search, in order to satisfy our objective that is to decrease the necessary processing cost or penalty for recycling of flash memory space at the same time minimizing the potential degradation of performance. The proposed cleaning methods create partitions of candidate memory regions, to be reclaimed as free, by utilizing global or dynamic threshold values. The impact of the proposed policies is evaluated through a number of experiments, the composition of the optimal configuration featuring the methods is tested through experiments as well.

  • PDF

Object Tracking Algorithm for Multimedia System

  • Kim, Yoon-ho;Kwak, Yoon-shik;Song, Hag-hyun;Ryu, Kwang-Ryol
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2002.11a
    • /
    • pp.217-221
    • /
    • 2002
  • In this paper, we propose a new scheme of motion tracking based on fuzzy inference (FI)and wavelet transform (WT) from image sequences. First, we present a WT to segment a feature extraction of dynamic image . The coefficient matrix for 2-level DWT tent to be clustered around the location of important features in the images, such as edge discontinuities, peaks, and corners. But these features are time varying owing to the environment conditions. Second, to reduce the spatio-temporal error, We develop a fuzzy inference algorithm. Some experiments are peformed to testify the validity and applicability of the proposed system. As a result, proposed method is relatively simple compared with the traditional space domain method. It is also well suited for motion tracking under the conditions of variation of illumination.

  • PDF

Ray tracing simulation of SCOTS test for GMT secondary mirror

  • Kim, Ki-Won;Kim, Sug-Whan;Kim, Young-Soo
    • The Bulletin of The Korean Astronomical Society
    • /
    • v.37 no.2
    • /
    • pp.204.1-204.1
    • /
    • 2012
  • We present SCOTS test simulation for on axis segment of the GMT secondary mirror that is ellipsoidal shape surface of 1.064m in diameter, 4.166747m in radius of curvature, -0.7154 in conic constant and $18.023{\mu}m$ P-V in asphericity. SCOTS test comprises a screen(diffusing sinusoidal fringe source), test surface(GMT secondary mirror), and a camera(CCD detector). We report ray tracing simulation result that is distorted sinusoidal fringe pattern detected at the camera. This simulation is to be used for analysis of experimental design, sensitivity from uncertainty, errors on fabrication and design.

  • PDF

A Column-Aware Index Management Using Flash Memory for Read-Intensive Databases

  • Byun, Si-Woo;Jang, Seok-Woo
    • Journal of Information Processing Systems
    • /
    • v.11 no.3
    • /
    • pp.389-405
    • /
    • 2015
  • Most traditional database systems exploit a record-oriented model where the attributes of a record are placed contiguously in a hard disk to achieve high performance writes. However, for read-mostly data warehouse systems, the column-oriented database has become a proper model because of its superior read performance. Today, flash memory is largely recognized as the preferred storage media for high-speed database systems. In this paper, we introduce a column-oriented database model based on flash memory and then propose a new column-aware flash indexing scheme for the high-speed column-oriented data warehouse systems. Our index management scheme, which uses an enhanced $B^+$-Tree, achieves superior search performance by indexing an embedded segment and packing an unused space in internal and leaf nodes. Based on the performance results of two test databases, we concluded that the column-aware flash index management outperforms the traditional scheme in the respect of the mixed operation throughput and its response time.

Penetrating Chest Trauma in Autopneumonectomy Status due to Pulmonary Tuberculosis : 1 Case Report (폐결핵에 의한 전폐자가절제 환자에서의 흉부 자상 치험 1례-)

  • Hong, Yoon Joo
    • The Korean Journal of Emergency Medical Services
    • /
    • v.9 no.1
    • /
    • pp.89-93
    • /
    • 2005
  • Penetrating chest trauma by stab injury may result in massive hemothorax from damage to single or multiple intrathoracic organs such as heart, aorta, internal mammary artery, intercostal artery or pulmonary parenchyme. Prognosis of massive hemothorax necessitating emergency thoracotomy is fatal especially so if there exists concomitant underlying compromise of cardiopulmonary function. A 56 year old man with destroyed left lung due to old pulmonary tuberculosis was stabbed in right parasternal lesion through third intercostal space. Intubation with cardiopulmonary resuscitation and closed thoracostomy were performed to resuscitate from cardiac asystole from hemorrhagic shock and acute respiratory distress. Midsternotomy was made to expose active bleeding foci in right mammary artery, subclavian vein, intercostal artery and anterior segment of right upper lung showing severe bullous change and pleural adhesion. Postoperative care included ventilator support, inotropic instillation and cautious, balance fluid therapy ; successful extubation was done on third postoperative day and patient was discharged on tenth postoperative day without any complication.

  • PDF

A Simplified Model to Extract GPS based Trajectory Traces (간소화된 GPS 기반 궤적 추적 모델)

  • Saleem, Muhammad Aamir;Go, Byunggill;Lee, Y.K;Lee, S.Y.
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2013.05a
    • /
    • pp.472-473
    • /
    • 2013
  • The growth in number and efficiency of smart devices such as GPS enabled smart phones and PDAs present an unparalleled opportunity for diverse areas of life. However extraction of GPS traces for provision of services demand a huge storage space as well as computation overhead. This is a challenging task especially for the applications which provide runtime services. In this paper we provide a simplified model to extract GPS traces of moving objects at runtime. Road segment partitioning and measure of deviation in angle of trajectory path is incorporated to identify the significant data points. The number of these data points is minimized by our proposed approach in an efficient manner to overwhelm the storage and computation overhead. Further, the competent reconstruction of complete itinerary based on gathered data, is also ensured by proposed method.

MHSC for the Automatic Image Segmentation (영상의 자동분할을 위한 MHSC 및 후처리)

  • Bae, Young Lae;Cho, Dong Uk;Choi, Byung Uk
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.24 no.1
    • /
    • pp.60-66
    • /
    • 1987
  • This paper proposes an automatic image segmentation system for machine vision. In this an algorithm using the topological property on the multidimensional feature space for thresholding each primary segment in the image without prior information is presented. Also an effective filter for the removal of regional noises in a code valued image which are artifacts of the thresholding is presented. This method also may be applied for image enhancement or classification, which we show the possibility and the efficiency through computer simulation.

  • PDF

COUNTING OF FLOWERS BASED ON K-MEANS CLUSTERING AND WATERSHED SEGMENTATION

  • PAN ZHAO;BYEONG-CHUN SHIN
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.27 no.2
    • /
    • pp.146-159
    • /
    • 2023
  • This paper proposes a hybrid algorithm combining K-means clustering and watershed algorithms for flower segmentation and counting. We use the K-means clustering algorithm to obtain the main colors in a complex background according to the cluster centers and then take a color space transformation to extract pixel values for the hue, saturation, and value of flower color. Next, we apply the threshold segmentation technique to segment flowers precisely and obtain the binary image of flowers. Based on this, we take the Euclidean distance transformation to obtain the distance map and apply it to find the local maxima of the connected components. Afterward, the proposed algorithm adaptively determines a minimum distance between each peak and apply it to label connected components using the watershed segmentation with eight-connectivity. On a dataset of 30 images, the test results reveal that the proposed method is more efficient and precise for the counting of overlapped flowers ignoring the degree of overlap, number of overlap, and relatively irregular shape.

Exacanthomysis marsailiae and Nipponomysis neolingvura, two new species of mysid (crustacea: mysida: mysidae) from the east coast of Korea

  • Hyung Seop Kim;Soo-Gun Jo
    • Fisheries and Aquatic Sciences
    • /
    • v.27 no.3
    • /
    • pp.137-144
    • /
    • 2024
  • Exacanthomysis marsailiae and Nipponomysis neolingvura are described as new species based on specimens collected with a light trap off the East Sea coast of Korea. E. marsailiae is closely related to Exacanthomysis alaskensis (Banner, 1954) and Exacanthomysis borealis (Banner, 1954). However, E. marsailiae can be distinguished from these species by having slightly grouped spines on lateral margins near the telson apex, and the exopod of male's fourth pleopod more than twice as long as the endopod. N. neolingvura can be distinguished from its closest relative, Nipponomysis lingvura (Murano, 1977), in that the lateral sides of the telson are all armed with spines without any empty space, and that the second segment of the fourth male pleopod is longer than the third one. The report of E. marsailiae from the East Sea of Korea extends the distribution range of the genus Exacanthomysis from the high-latitude North Pacific southward to the mid-latitude waters of the western Pacific. The morphological characteristics of the two current new species are also compared with those of their congeners.

Index based on Constraint Network for Spatio-Temporal Aggregation of Trajectory in Spatial Data Warehouse

  • Li Jing Jing;Lee Dong-Wook;You Byeong-Seob;Oh Young-Hwan;Bae Hae-Young
    • Journal of Korea Multimedia Society
    • /
    • v.9 no.12
    • /
    • pp.1529-1541
    • /
    • 2006
  • Moving objects have been widely employed in traffic and logistic applications. Spatio-temporal aggregations mainly describe the moving object's behavior in the spatial data warehouse. The previous works usually express the object moving in some certain region, but ignore the object often moving along as the trajectory. Other researches focus on aggregation and comparison of trajectories. They divide the spatial region into units which records how many times the trajectories passed in the unit time. It not only makes the storage space quite ineffective, but also can not maintain spatial data property. In this paper, a spatio-temporal aggregation index structure for moving object trajectory in constrained network is proposed. An extended B-tree node contains the information of timestamp and the aggregation values of trajectories with two directions. The network is divided into segments and then the spatial index structure is constructed. There are the leaf node and the non leaf node. The leaf node contains the aggregation values of moving object's trajectory and the pointer to the extended B-tree. And the non leaf node contains the MBR(Minimum Bounding Rectangle), MSAV(Max Segment Aggregation Value) and its segment ID. The proposed technique overcomes previous problems efficiently and makes it practicable finding moving object trajectory in the time interval. It improves the shortcoming of R-tree, and makes some improvement to the spatio-temporal data in query processing and storage.

  • PDF