• The korean journal of orthodontics
• /
• v.46 no.5
• /
• pp.331-342
• /
• 2016

Objective: To evaluate the accuracy and reliability of the diagnostic tools available for assessing maxillary transverse deficiencies. Methods: An electronic search of three databases was performed from their date of establishment to April 2015, with manual searching of reference lists of relevant articles. Articles were considered for inclusion if they reported the accuracy or reliability of a diagnostic method or evaluation technique for maxillary transverse dimensions in mixed or permanent dentitions. Risk of bias was assessed in the included articles, using the Quality Assessment of Diagnostic Accuracy Studies tool-2. Results: Nine articles were selected. The studies were heterogeneous, with moderate to low methodological quality, and all had a high risk of bias. Four suggested that the use of arch width prediction indices with dental cast measurements is unreliable for use in diagnosis. Frontal cephalograms derived from cone-beam computed tomography (CBCT) images were reportedly more reliable for assessing intermaxillary transverse discrepancies than posteroanterior cephalograms. Two studies proposed new three-dimensional transverse analyses with CBCT images that were reportedly reliable, but have not been validated for clinical sensitivity or specificity. No studies reported sensitivity, specificity, positive or negative predictive values or likelihood ratios, or ROC curves of the methods for the diagnosis of transverse deficiencies. Conclusions: Current evidence does not enable solid conclusions to be drawn, owing to a lack of reliable high quality diagnostic studies evaluating maxillary transverse deficiencies. CBCT images are reportedly more reliable for diagnosis, but further validation is required to confirm CBCT's accuracy and diagnostic superiority.

• Journal of Digital Convergence
• /
• v.17 no.1
• /
• pp.203-208
• /
• 2019

In this paper, we propose a real-time virtual model synchronization algorithm using object feature detection. The proposed algorithm may be useful to synchronize between real objects and their corresponding virtual models through object feature search in two-dimensional images. It consists of an algorithm to classify objects with colors individually, and an algorithm to analyze the orientation of objects with angles. We can synchronize the motion of the real object with the virtual model by providing the environment of moving the virtual object through the hand without specific controllers. The future research will include the algorithm to synchronize real object with unspecified shapes, colors, and directions to the corresponding virtual object.

• Mycobiology
• /
• v.49 no.6
• /
• pp.604-606
• /
• 2021

In our ongoing search for new secondary metabolites from fungal strains, one novel compound (1) and nine known compounds (2-10) were isolated from the EtOAc-soluble layer of the culture broth of Panus rudis. The culture broth of P. rudis was extracted in acetone and fractionated by solvent partition; column chromatography using silica gel, Sephadex LH-20, and Sephadex G-10; MPLC; and HPLC. The structures of isolated compounds were elucidated by one- and two-dimensional NMR and LC-ESI-mass measurements. One new compound, panepoxydiol (1), and nine known compounds, (E)-3-(3-hydroxy-3-methylbut-1-en-1-yl)-7-oxabicyclo[4.1.0]hept-3-ene-2,5-diol (2), isopanepoxydone (3), neopanepoxydone (4), panepoxydone (5), panepophenanthrin (6), 4-hydroxy-2,2-dimethyl-6-methoxychromane (7), 6-hydroxy-2,2-dimethyl-3-chromen (8), 2,2-dimethyl-6-methoxychroman-4-one (9), 3,4-dihydroxy-2,2-dimethyl-6-methoxychromane (10), were isolated from the culture broth of P. rudis. This is the first report of isolation of a new compound panepoxydiol (1) and nine other chemical constituents (2-5, 7-10) from the culture broth of P. rudis.

• Journal of KIISE:Databases
• /
• v.30 no.6
• /
• pp.651-665
• /
• 2003

To reduce cache misses emerges as the most important issue in today's situation of main memory databases, in which CPU speeds have been increasing at 60% per year, and memory speeds at 10% per year. Recent researches have demonstrated that cache-conscious index structure such as the CR-tree outperforms the R-tree variants. Its search performance can be poor than the original R-tree, however, since it uses a lossy compression scheme. In this paper, we propose alternatively a cache-conscious version of the R-tree, which we call MR-tree. The MR-tree propagates node splits upward only if one of the internal nodes on the insertion path has empty room. Thus, the internal nodes of the MR-tree are almost 100% full. In case there is no empty room on the insertion path, a newly-created leaf simply becomes a child of the split leaf. The height of the MR-tree increases according to the sequence of inserting objects. Thus, the HeightBalance algorithm is executed when unbalanced heights of child nodes are detected. Additionally, we also propose the CCMR-tree in order to build a more cache-conscious MR-tree. Our experimental and analytical study shows that the two-dimensional MR-tree performs search up to 2.4times faster than the ordinary R-tree while maintaining slightly better update performance and using similar memory space.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.3
• /
• pp.568-576
• /
• 2003

This paper proposes a moving object tracking algorithm by using hierarchical search method in dynamic scenes. Proposed algorithm is based on two main steps: generation step of initial model from different pictures, and tracking step of moving object under the time-yawing scenes. With a series of this procedure, tracking process is not only stable under far distance circumstance with respect to the previous frame but also reliable under shape variation from the 3-dimensional(3D) motion and camera sway, and consequently, by correcting position of moving object, tracking time is relatively reduced. Partial Hausdorff distance is also utilized as an estimation function to determine the similarity between model and moving object. In order to testify the performance of proposed method, the extraction and tracking performance have tested using some kinds of moving car in dynamic scenes. Experimental results showed that the proposed algorithm provides higher performance. Namely, matching order is 28.21 times on average, and considering the processing time per frame, it is 53.21ms/frame. Computation result between the tracking position and that of currently real with respect to the root-mean-square(rms) is 1.148. In the occasion of different vehicle in terms of size, color and shape, tracking performance is 98.66%. In such case as background-dependence due to the analogy to road is 95.33%, and total average is 97%.

• Journal of KIISE:Databases
• /
• v.30 no.3
• /
• pp.320-335
• /
• 2003

Location-Based Services(LBS) give rise to location-based queries of which results depend on the locations of moving objects. One of important applications of LBS is to examine tracks of continuously moving objects. Moving objects databases need to provide 3-dimensional indexing for efficiently processing range queries on the movement of continuously changing positions. An extension of the 2-dimensional R-tree to include time dimension shows low space utilization and poor search performance, because of high overlap of index nodes and their dead space. To solve these problems, we propose a new R-tree based indexing technique, namely TR-tree. To increase storage utilization, we assign more entries to the past node by using the unbalanced splitting policy. If two nodes are highly overlapped, these nodes are forcibly merged. It is the forced merging policy that reduces the dead space and the overlap of nodes. Since big line segments can also affect the overlap of index nodes to be increased, big line segments should be clipped by the clipping policy when splitting overfull nodes. The TR-tree outperforms the 3DR-tree and TB-tree in all experiments. Particularly, the storage utilization of the TR-tree is higher than the R-tree and R*-tree.

• Archives of design research
• /
• v.16 no.1
• /
• pp.35-44
• /
• 2003

In the past era, acquisition and utilization of useful information was the main origin of competition. Nowadays, unlike that era, is the era of knowledge information(management) in which we should create a new knowledge on the basis of information and apply it to the field of practice. And more acquisition of information is no more the competitive power of any person, any company and any nation because in such the era of knowledge management, anyone can access and get the information he needs, utilizing internet-based searching system. Such demands of the times of knowledge management change rapidly in each field through knowledge management system and researches about knowledge management are actively processed in various academic branches. However, in our field of design, researches about those demands(knowledge management) still remain on the level of one-dimensional searching service for general data about design. Therefore, in this study, we developed building database of researches on form, color, aesthetical elements, preference image word, satisfaction etc. about CI/BI of home electronics goods, living goods, apparels, and food goods companies, also suggesting searching system through which you can obtain useful data and information helpful for designers to process CI/BI works of new product by using that database. Especially, in case of developing specific CI/BI, various search results through help of suggested system will supply a useful design concept. And more, cross table which is the result of analysis two-dimensional categorical data about existing design factors(such as form, color, aesthetical elements, preference image word, and satisfaction) will make contribution for designers to create a new design knowledge.

• Journal of the Institute of Convergence Signal Processing
• /
• v.8 no.4
• /
• pp.237-243
• /
• 2007

In this paper, we propose the Real-time Dead-Pixel Detection and Compensation System for mobile camera and its hardware architecture. The CMOS image sensors as image input devices are becoming popular due to the demand for miniaturized, low-power and cost-effective imaging systems. However a conventional Dead-Pixel Detection Algorithm is disable to detect neighboring dead pixels and it degrades image quality by wrong detection and compensation. To detect dead pixels the proposed system is classifying dead pixels into Hot pixel and Cold pixel. Also, the proposed algorithm is processing line-detector and $5{\times}5$ window-detector consecutively. The line-detector and window-detector can search dead pixels by using one-dimensional(only horizontal) method in low frequency area and two-dimensional(vertical and diagonal) method in high frequency area, respectively. The experimental result shows that it can detect 99% of dead pixels. It was designed in Verilog hardware description language and total gate count is 23K using TSMC 0.25um ASIC library.

• Bulletin of the Society of Naval Architects of Korea
• /
• v.26 no.3
• /
• pp.51-61
• /
• 1989

Recently, the growth in the propulsion power and propeller size of typical energy saving ships has resulted in severe damages of the oil-lubricated stern tube bearing. Consequently, a more rational analytical method for the design of the shafting system is required. In this paper an analytical method applicable to the design of the oil-lubricated stern tube bearing and shafting system is presented. The method consists of the finite element analysis of the shafting system and the oil film hydrodynamics. The shafting system is modeled as a three-dimensional problem using beam elements taking account for the steady components of thrust, lateral forces and moments of the propeller as well as the elastic foundation effects. The oil film hydrodynamics is modeled as a two-dimensional problem. Equal and retangular elements employing hourglass control method are used for the construction of the oil film fluidity matrix. To search the quasi-static equilibrium position between the propeller shaft and the oil film, an optimization technique is employed. Some numerical results based on the proposed method are compared with some measured and numerical data available. They show acceptable agreements with the data.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.2
• /
• pp.27-37
• /
• 2009

Sensor nodes forming a sensor network have limited energy capacity such as small batteries and when these nodes are placed in a specific field, it is important to research minimizing sensor nodes' energy consumption because of difficulty in supplying additional energy for the sensor nodes. Clustering has been in the limelight as one of efficient techniques to reduce sensor nodes' energy consumption in sensor networks. However, energy saving results can vary greatly depending on election of cluster heads, the number and size of clusters and the distance among the sensor nodes. /This research has an aim to find the optimal set of clusters which can reduce sensor nodes' energy consumption. We use a Genetic Algorithm(GA), a stochastic search technique used in computing, to find optimal solutions. GA performs searching through evolution processes to find optimal clusters in terms of energy efficiency. Our results show that GA is more efficient than LEACH which is a clustering algorithm without evolution processes. The two-dimensional GA (2D-GA) proposed in this research can perform more efficient gene evolution than one-dimensional GA(1D-GA)by giving unique location information to each node existing in chromosomes. As a result, the 2D-GA can find rapidly and effectively optimal clusters to maximize lifetime of the sensor networks.