• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.4
• /
• pp.847-856
• /
• 2013

This paper presents an AP placement technique considering indoor location-awareness and examines its performance. The proposed AP placement technique is addressed from three performance metrics: location-awareness and AP-based wireless network performance as well as its cost. The proposed AP placement technique consists of meta-heuristic algorithms that yield a near optimal AP configuration for given performance metrics, and deterministic algorithms that improve the fast convergence of the near optimal AP configuration. The performance of the AP placement technique presented in this paper is measured under the environments simulating indoor space, and numerical results obtained by experimental evaluation yield the fast convergence of a near-optimal solution to a given performance metric.

• Journal of Veterinary Clinics
• /
• v.21 no.4
• /
• pp.406-408
• /
• 2004

A nine-month-old male Jindo with non weight-bearing on the right forelimb in flexed position, pain and edema of the elbow, and resist elbow extension was brought to the Veterinary Teaching Hospital, Chungbuk National University. Elbow radiographs showed loss of humeroradial joint space and lateral displacement of the radius and ulna. Closed reduction was reported the best therapy in most cases of luxation of the elbow but conservative reduction was impossible. Open reduction of the luxated elbow was performed and ruptured collateral ligaments were identified. Displaced elbow was required bloody surgical operation and gentle reduction to restore elbow joint. Internal reduction of choice for elbow luxation with rupture of collateral ligament in the dog was a double locking-loop suture pattern. To ensure secure grasping of parallel bundles of ligament fibers to transverse bites of each suture were placed superficial to the longitudinal bites. All ligaments were repaired with 3-metric (size 2 USP) monofilament polypropylene suture. No complications have been noted during a five-month follow up.

• The KIPS Transactions:PartA
• /
• v.9A no.4
• /
• pp.581-588
• /
• 2002

In implementing interactive multimedia systems, real-time visualization plays an important role. This paper presents efficient data structures and algorithms for real-time terrain navigation. Terrain data set is usually too huge to display as is. Therefore LOD (levels of detail) methods and view frustum culling are essential tools. This paper describes in detail compact hierarchical data structures, fast view frustum culling, and efficient LOD construction/rendering algorithms. Unlike previous works, we use a precise screen-space error metric for vertex removal and a strict error threshold allowing sub-pixel -sized errors only. Nevertheless, we can achieve 22 fps on average in a PC platform. The methods presented in this paper also satisfy almost all of the requirements for interactive real-time terrain Visualization.

• Nonlinear Functional Analysis and Applications
• /
• v.27 no.4
• /
• pp.709-730
• /
• 2022

We consider the nonlinear matrix equation (NMEs) of the form 𝓤 = 𝓠 + Σ^k_i=1 𝓐^*_iℏ(𝓤)𝓐_i, where 𝓠 is n × n Hermitian positive definite matrices (HPDS), 𝓐₁, 𝓐₂, . . . , 𝓐_m are n × n matrices, and ~ is a nonlinear self-mappings of the set of all Hermitian matrices which are continuous in the trace norm. We discuss a sufficient condition ensuring the existence of a unique positive definite solution of a given NME and demonstrate this sufficient condition for a NME 𝓤 = 𝓠 + 𝓐^*₁(𝓤²/900)𝓐₁ + 𝓐^*₂(𝓤²/900)𝓐₂ + 𝓐^*₃(𝓤²/900)𝓐₃. In order to do this, we define 𝓕𝓖_w-contractive conditions and derive fixed points results based on aforesaid contractive condition for a mapping in extended Branciari b-metric distance followed by two suitable examples. In addition, we introduce weak well-posed property, weak limit shadowing property and generalized Ulam-Hyers stability in the underlying space and related results.

• The KIPS Transactions:PartA
• /
• v.12A no.5 s.95
• /
• pp.451-460
• /
• 2005

We present a methodology to design energy-efficient data paths using FPGAs. Our methodology integrates domain specific modeling, coarse-grained performance evaluation, design space exploration, and low-level simulation to understand the tradeoffs between energy, latency, and area. The domain specific modeling technique defines a high-level model by identifying various components and parameters specific to a domain that affect the system-wide energy dissipation. A domain is a family of architectures and corresponding algorithms for a given application kernel. The high-level model also consists of functions for estimating energy, latency, and area that facilitate tradeoff analysis. Design space exploration(DSE) analyzes the design space defined by the domain and selects a set of designs. Low-level simulations are used for accurate performance estimation for the designs selected by the DSE and also for final design selection We illustrate our methodology using a family of architectures and algorithms for matrix multiplication. The designs identified by our methodology demonstrate tradeoffs among energy, latency, and area. We compare our designs with a vendor specified matrix multiplication kernel to demonstrate the effectiveness of our methodology. To illustrate the effectiveness of our methodology, we used average power density(E/AT), energy/(area x latency), as themetric for comparison. For various problem sizes, designs obtained using our methodology are on average $25\%$ superior with respect to the E/AT performance metric, compared with the state-of-the-art designs by Xilinx. We also discuss the implementation of our methodology using the MILAN framework.

• Tunnel and Underground Space
• /
• v.33 no.6
• /
• pp.508-518
• /
• 2023

This paper presents a new approach for the automatic mapping of discontinuities in a tunnel face based on its 3D digital model reconstructed by LiDAR scan or photogrammetry techniques. The main idea revolves around the identification of discontinuity areas in the 3D digital model of a tunnel face by segmenting its 2D projected images using a deep-learning semantic segmentation model called U-Net. The proposed deep learning model integrates various features including the projected RGB image, depth map image, and local surface properties-based images i.e., normal vector and curvature images to effectively segment areas of discontinuity in the images. Subsequently, the segmentation results are projected back onto the 3D model using depth maps and projection matrices to obtain an accurate representation of the location and extent of discontinuities within the 3D space. The performance of the segmentation model is evaluated by comparing the segmented results with their corresponding ground truths, which demonstrates the high accuracy of segmentation results with the intersection-over-union metric of approximately 0.8. Despite still being limited in training data, this method exhibits promising potential to address the limitations of conventional approaches, which only rely on normal vectors and unsupervised machine learning algorithms for grouping points in the 3D model into distinct sets of discontinuities.

• Journal of The Korean Astronomical Society
• /
• v.35 no.4
• /
• pp.197-208
• /
• 2002

Five contemporary pre-main sequence (PMS) evolution model grids are compared with the photo-metric data for a nearly complete sample of low-mass members in NGC 2264. From amongst the grids compared, the models of Baraffe et al. (1998) prove to be the most reliable in mass-age distribution. To overcome the limited mass range of the models of Baraffe et al. we derived a simple transformation relation between the mass of a PMS star from Swenson et al. (1994) and that from Baraffe et al., and applied it to the PMS stars in NGC 2264 and the Orion nebula cluster (ONC). The resulting initial mass function (IMF) of the ONC shows that the previous interpretation of the IMF is not a real feature, but an artifact caused by the evolution models adopted. The IMFs of both clusters are in a good agreement with the IMF of the field stars in the solar neighborhood. This result supports the idea proposed by Lada, Strom, & Myers (1993) that the field stars originate from the stars that are formed in clusters and spread out as a result of dynamical dissociation. Nevertheless, the IMFs of OB associations and young open clusters show diverse behavior. For the low-mass regime, the current observations suffer from difficulties in membership assignment and sample incompleteness. From this, we conclude that a more thorough study of young open clusters is necessary in order to make any definite conclusions on the existence of a universal IMF.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.11
• /
• pp.2577-2596
• /
• 2013

In this paper, we present an Energy-Aware Self-Stabilizing Distributed Clustering protocol based on message-passing model for Ad Hoc networks. The latter does not require any initialization. Starting from an arbitrary configuration, the network converges to a stable state in a finite time. Our contribution is twofold. We firstly give the formal proof that the stabilization is reached after at most n+2 transitions and requires at most $n{\times}log(2n+{\kappa}+3)$ memory space, where n is the number of network nodes and ${\kappa}$ represents the maximum hops number in the clusters. Furthermore, using the OMNeT++ simulator, we perform an evaluation of our approach. Secondly, we propose an adaptation of our solution in the context of Wireless Sensor Networks (WSNs) with energy constraint. We notably show that our protocol can be easily used for constructing clusters according to multiple criteria in the election of cluster-heads, such as nodes' identity, residual energy or degree. We give a comparison under the different election metrics by evaluating their communication cost and energy consumption. Simulation results show that in terms of number of exchanged messages and energy consumption, it is better to use the Highest-ID metric for electing CHs.

• Journal of KIISE:Software and Applications
• /
• v.36 no.9
• /
• pp.749-757
• /
• 2009

A Internet user can easily access to the target information by web searching using some key-words or categories in the present Internet environment. When some meta-data which represent attributes of several data structures well are used, then more accurate result which is matched with the intention of users can be provided. This study proposes a multiple dimensional vector tagging method for the small web user group who interest in maintaining and sharing the bookmark for common interesting topics. The proposed method uses vector tag method for increasing the effect of categorization, management, and retrieval of target information. The vector tag composes with two or more components of the user defined priority. The basic vector space is created time of information and reference value. The calculated vector value shows the usability of information and became the metric of ranking. The ranking accuracy of the proposed method compares with that of a simply link structure, The proposed method shows better results for corresponding the intention of users.

• The KIPS Transactions:PartD
• /
• v.10D no.3
• /
• pp.547-558
• /
• 2003

From the viewpoint of that music melody has the similar features to time-series data, music melody is transformed to a time-series data with normalization and corrections and the similarity between melodies is defined as the Euclidean distance between the transformed time-series data. Then, based the similarity between melodies of a music object, melodies are clustered and the representative of each cluster is extracted as one of theme melodies for the music. To construct the theme melody index, a theme melody is represented as a point of the multidimensional metric space of M-tree. For retrieval of user's query melody, the query melody is also transformed into a time-series data by the same way of indexing phase. To retrieve the similar melodies to the query melody given by user from the theme melody index the range query search algorithm is used. By the implementation of the prototype system using the proposed theme melody index we show the effectiveness of the proposed methods.