• Smart Structures and Systems
• /
• v.23 no.1
• /
• pp.45-60
• /
• 2019

This paper is devoted to proposing a new approach for damage detection of structures. In this technique, the biconjugate gradient method (BCG) is employed. To remedy the noise effects, a new preconditioning algorithm is applied. The proposed preconditioner matrix significantly reduces the condition number of the system. Moreover, based on the characteristics of the damage vector, a new direct search algorithm is employed to increase the efficiency of the suggested damage detection scheme by reducing the number of unknowns. To corroborate the high efficiency and capability of the presented strategy, it is applied for estimating the severity and location of damage in the well-known 31-member and 52-member trusses. For damage detection of these trusses, the time history responses are measured by a limited number of sensors. The results of numerical examples reveal high accuracy and robustness of the proposed method.

• KSTLE International Journal
• /
• v.5 no.1
• /
• pp.23-27
• /
• 2004

The object of the present work is the numerical analysis of the computer hard disk slider. The pressure between slider and disk surfaces is calculated using the Boundary Fitted Coordinate System and Divergence Formulation for the nonlinear Reynolds' equation solution. The optimization scheme is applied to search for the steady state position of the slider. The simplified method is given for the case of the fixed inclined pad. The film thickness ratios and pitching and rolling angles are considered as alternative choice of the slider's coordinates. The behavior of the objective function for the Negative Pressure slider is studied in details. Methods of conjugate directions and feasible directions are applied.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.3 no.1
• /
• pp.5-25
• /
• 2009

In recent years the popularity of multi-hop wireless networks has been growing. Its flexible topology and abundant routing path enables many types of applications. However, the lack of a centralized controller often makes it difficult to design a reliable service in multi-hop wireless networks. While packet routing has been the center of attention for decades, recent research focuses on data discovery such as file sharing in multi-hop wireless networks. Although there are many peer-to-peer lookup (P2P-lookup) schemes for wired networks, they have inherent limitations for multi-hop wireless networks. First, a wired P2P-lookup builds a search structure on the overlay network and disregards the underlying topology. Second, the performance guarantee often relies on specific topology models such as random graphs, which do not apply to multi-hop wireless networks. Past studies on wireless P2P-lookup either combined existing solutions with known routing algorithms or proposed tree-based routing, which is prone to traffic congestion. In this paper, we present two wireless P2P-lookup schemes that strictly build a topology-dependent structure. We first propose the Ring Interval Graph Search (RIGS) that constructs a DHT only through direct connections between the nodes. We then propose the ValleyWalk, a loosely-structured scheme that requires simple local hints for query routing. Packet-level simulations showed that RIGS can find the target with near-shortest search length and ValleyWalk can find the target with near-shortest search length when there is at least 5% object replication. We also provide an analytic bound on the search length of ValleyWalk.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.4A
• /
• pp.352-360
• /
• 2008

Recently Task Group (TG) 4 of the Institute of Electrical and Electronics Engineers (IEEE) 802.15a has been recommended a system with ranging capability in existence of multiple Simultaneous operating piconets (SOPs) as well as low-cost, low-power. According to the ranging service, coherent and non-coherent based ranging schemes using ternary code have been adopted as a standard. However it is hard to estimate an accurate time of arrival (TOA) in case of using direct sequence based TOA estimation method because pulse repetition interval (PRI) offered by TG is more limited than the maximum excess delay (MED) of channel. To mitigate inter pulse interference (IPI) problem, this paper proposes a non-coherent TOA estimation scheme using non-periodic transmission (NPT) pattern. The proposed receiver is based on a non-coherent energy detection considering with motivation of low rate wireless personal area network (LR-WPAN). TOA information is estimated via proper comparison with a prescribed threshold after the sliding correlation and search back window (SBW) process for reducing TOA error. To verify the performance of proposed ranging scheme, two distinct channel models approved by IEEE 802.15.4a TG are considered. According to the simulation results, we could conclude that the proposed scheme have performed better performance than the conventional method on the existence of multiple SOPs.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.39 no.1
• /
• pp.42-48
• /
• 2002

In this paper, a decision method using multiple threshold values for PN code acquisition in Direct Sequence Code Division Multiple Access (DS-CDMA) systems is described. We apply this technique to the conventional double dwell serial search algorithm and analyze it in terms of mean code acquisition time. For the analysis, we present mathematical model of proposed algorithm and also perform the simulation under IMT-2000 channel models. Numerical results show that our proposed scheme outperforms the conventional one by 0.2 - 0.5 sec with respect to the mean code acquisition time because multiple threshold values mitigate the possible decline in search performance caused by the use of a single threshold.

• Journal of Intelligence and Information Systems
• /
• v.20 no.2
• /
• pp.123-136
• /
• 2014

Recently, online shopping has further developed as the use of the Internet and a variety of smart mobile devices becomes more prevalent. The increase in the scale of such shopping has led to the creation of many Internet shopping malls. Consequently, there is a tendency for increasingly fierce competition among online retailers, and as a result, many Internet shopping malls are making significant attempts to attract online users to their sites. One such attempt is keyword marketing, whereby a retail site pays a fee to expose its link to potential customers when they insert a specific keyword on an Internet portal site. The price related to each keyword is generally estimated by the keyword's frequency of appearance. However, it is widely accepted that the price of keywords cannot be based solely on their frequency because many keywords may appear frequently but have little relationship to shopping. This implies that it is unreasonable for an online shopping mall to spend a great deal on some keywords simply because people frequently use them. Therefore, from the perspective of shopping malls, a specialized process is required to extract meaningful keywords. Further, the demand for automating this extraction process is increasing because of the drive to improve online sales performance. In this study, we propose a methodology that can automatically extract only shopping-related keywords from the entire set of search keywords used on portal sites. We define a shopping-related keyword as a keyword that is used directly before shopping behaviors. In other words, only search keywords that direct the search results page to shopping-related pages are extracted from among the entire set of search keywords. A comparison is then made between the extracted keywords' rankings and the rankings of the entire set of search keywords. Two types of data are used in our study's experiment: web browsing history from July 1, 2012 to June 30, 2013, and site information. The experimental dataset was from a web site ranking site, and the biggest portal site in Korea. The original sample dataset contains 150 million transaction logs. First, portal sites are selected, and search keywords in those sites are extracted. Search keywords can be easily extracted by simple parsing. The extracted keywords are ranked according to their frequency. The experiment uses approximately 3.9 million search results from Korea's largest search portal site. As a result, a total of 344,822 search keywords were extracted. Next, by using web browsing history and site information, the shopping-related keywords were taken from the entire set of search keywords. As a result, we obtained 4,709 shopping-related keywords. For performance evaluation, we compared the hit ratios of all the search keywords with the shopping-related keywords. To achieve this, we extracted 80,298 search keywords from several Internet shopping malls and then chose the top 1,000 keywords as a set of true shopping keywords. We measured precision, recall, and F-scores of the entire amount of keywords and the shopping-related keywords. The F-Score was formulated by calculating the harmonic mean of precision and recall. The precision, recall, and F-score of shopping-related keywords derived by the proposed methodology were revealed to be higher than those of the entire number of keywords. This study proposes a scheme that is able to obtain shopping-related keywords in a relatively simple manner. We could easily extract shopping-related keywords simply by examining transactions whose next visit is a shopping mall. The resultant shopping-related keyword set is expected to be a useful asset for many shopping malls that participate in keyword marketing. Moreover, the proposed methodology can be easily applied to the construction of special area-related keywords as well as shopping-related ones.

• Journal of information and communication convergence engineering
• /
• v.7 no.3
• /
• pp.275-280
• /
• 2009

While database(DB) and information retrieval(IR) have been developed independently, there have been emerging requirements that both data management and efficient text retrieval should be supported simultaneously in an information system such as health care, customer support, XML data management, and digital libraries. The great divide between DB and IR has caused different manners in index maintenance for newly arriving documents. While DB has extended its SQL layer to cope with text fields due to lack of intact mechanism to build IR-like index, IR usually treats a block of new documents as a logical unit of index maintenance since it has no concept of integrity constraint. However, In the DB-IR integrations, a transaction on adding or updating a document should include maintenance of the posting lists accompanied by the document. Although DB-IR integration has been budded in the research filed, the issue will remain difficult and rewarding areas for a while. One of the primary reasons is lack of efficient online transactional index maintenance. In this paper, performance of a few strategies for per-document basis transactional index maintenance - direct index update, pulsing auxiliary index and posting segmentation index - will be evaluated. The result shows that the pulsing auxiliary strategy and posting segmentation indexing scheme, can be a challenging candidates for text field indexing in DB-IR integration.

• Journal of Korean Association for Spatial Structures
• /
• v.4 no.2 s.12
• /
• pp.89-97
• /
• 2004

The objective of this study is the development of a scheme and discrete optimum design algorithm, which is based on the genetic algorithm. The algorithm can perform both scheme and size optimum designs of plane trusses. The developed Scheme genetic algorithm was implemented in a computer program. For the optimum design, the objective function is the weight of structures and the constraints are limits on loads and serviceability. The basic search method for the optimum design is the genetic algorithm. The algorithm is known to be very efficient for the discrete optimization. However, its application to the complicated structures has been limited because of the extreme time need for a number of structural analyses. This study solves the problem by introducing the size & scheme genetic algorithm operators into the genetic algorithm. The genetic process virtually takes no time. However, the evolutionary process requires a tremendous amount of time for a number of structural analyses. Therefore, the application of the genetic algorithm to the complicated structures is extremely difficult, if not impossible. The scheme genetic algorithm operators was introduced to overcome the problem and to complement the evolutionary process. It is very efficient in the approximate analyses and scheme and size optimization of plane trusses structures and considerably reduces structural analysis time. Scheme and size discrete optimum combined into the genetic algorithm is what makes the practical discrete optimum design of plane fusses structures possible. The efficiency and validity of the developed discrete optimum design algorithm was verified by applying the algorithm to various optimum design examples: plane pratt, howe and warren truss.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.4
• /
• pp.914-925
• /
• 1998

This paper considers the evaluation of the hybrid acquistion perdformance for the pilot signal in the direct sequence code division multiple access(DS/CDMA) forward link. the hybrid acquisition is introduced by the combination of two schemes, the parallel and serial acquisions. The mean acquisition time of the proposed scheme is derived to consider both the best case(the correct code-phase offsets are included i one subset) and the worst case(the correct code-phase offsets exist at the boundary of two subsets), which are cause by the distribution of the correct code-phase offsets in the subset. Expressions for the detection, false alarm, and miss probabilities are derived for the case of multiple correct code-phase offsets and multipath Rayleigh fading channel. Numerical results present the hybrid acquistion performance with repect to design parameters such as postdetectio integration length in the search and verification modes, subset size, and number of I/Q noncoherent correlators, and compare the hybrid acquistion with the parallel acquistion in terms of the minimum acquistion time under the same hardware complexity.

• Parasites, Hosts and Diseases
• /
• v.61 no.2
• /
• pp.202-209
• /
• 2023

Lophomonas blattarum is an anaerobic protozoan living in the intestine of cockroaches and house dust mites, with ultramicroscopic characteristics such as the presence of a parabasal body, axial filament, and absence of mitochondria. More than 200 cases of Lophomonas infection of the respiratory tract have been reported worldwide. However, the current diagnosis of such infection depends only on light microscopic morphological findings from respiratory secretions. In this study, we attempted to provide more robust evidence of protozoal infection in an immunocompromised patient with atypical pneumonia, positive for Lophomonas-like protozoal cell forms. A direct search of bronchoalveolar lavage fluid via polymerase chain reaction (PCR), transmission electron microscopy (TEM), and metagenomic next-generation sequencing did not prove the presence of protozoal infection. PCR results were not validated with sufficient rigor, while de novo assembly and taxonomic classification results did not confirm the presence of an unidentified pathogen. The TEM results implied that such protozoal forms in light microscopy are actually non-detached ciliated epithelial cells. After ruling out infectious causes, the patient's final diagnosis was drug-induced pneumonitis. These findings underscore the lack of validation in the previously utilized diagnostic methods, and more evidence in the presence of L. blattarum is required to further prove its pathogenicity.