• International Journal of Computer Science & Network Security
• /
• 제22권10호
• /
• pp.137-144
• /
• 2022

Wireless community networks (WCNs) are considered another form of ownership of internet protocol (IP) networks, where community members manage and own every piece of equipment in a decentralized way, and routing for traffic is done in a cooperative manner. However, the current routing protocols for WCNs suffer from stability and scalability issues. In this paper, an enhanced routing protocol is proposed based on the optimized link state routing (OLSR) protocol to meet the standards of efficiency in terms of stability and scalability. The proposed routing protocol is enhanced through two phases: multicasting expansion and multipoint relay (MPR) selection based on an analytical hierarchical process (AHP). The experimental results demonstrate that the proposed routing protocol outperforms the OLSR protocol in terms of network control overhead and packet delivery ratio by 18% and 1% respectively.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2011년도 한국컴퓨터종합학술대회논문집 Vol.38 No.1(C)
• /
• pp.168-171
• /
• 2011

One important issue in semantic web is identification and selection of domain concepts for domain ontology learning when several hundreds or even thousands of terms are extracted and available from relevant text documents shared among the members of a domain. We present a novel domain concept acquisition and selection approach for ontology learning that uses affinity propagation algorithm, which takes as input semantic and structural similarity between pairs of extracted terms called data points. Real-valued messages are passed between data points (terms) until high quality set of exemplars (concepts) and cluster iteratively emerges. All exemplars will be considered as domain concepts for learning domain ontologies. Our empirical results show that our approach achieves high precision and recall in selection of domain concepts using less number of iterations.

• 대한인간공학회지
• /
• 제34권5호
• /
• pp.401-410
• /
• 2015

Objective: The present study was to improve the graphic user interface (GUI) of a military computer-based training (CBT) system in terms of usability. Background: Existing studies have focused on usability evaluation of a particular GUI type such as sequence, hierarchy, or context type; however, few research has been conducted which identifies preferred GUI features based on a comparative analysis of different GUI types. Method: A comparative evaluation was conducted by 9 CBT design experts using a 7-point scale (1: very low, 4: neutral, and 7: very high) on hierarchy and context GUI types of a military CBT system in terms of 10 usability criteria. Then, preferred features of the hierarchy and context types being accommodated, a new GUI was developed and validated by 22 CBT users. Results: While the hierarchy type was found preferred by 1.6 times in terms of controllability to the context type, the opposite was found in terms of attractiveness, simplicity, and responsiveness by 0.6, 0.8, and 0.8 times, respectively. The proposed GUI was found superior to the hierarchy and context types in terms of accessibility and informativeness by more than 1.5 times, but inferior to the hierarchy and context type in terms of simplicity by 0.6 and 0.9 times, respectively. Conclusion: The new GUI developed by accommodating the preferred features of the hierarchy and context types improves usability in terms of accessibility and informativeness except simplicity. Application: The comparative analysis of various GUIs can be applied to develop an improved GUI in a systematic manner based on preferred features of the existing GUIs.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제11권4호
• /
• pp.238-246
• /
• 2011

This paper proposes a new semantic representation and its associated similarity measure. The representation expresses textual context observed in a context of a certain term as a network where nodes are terms and edges are the number of cooccurrences between connected terms. To compare terms represented in networks, a graph kernel is adopted as a similarity measure. The proposed representation has two notable merits compared with previous semantic representations. First, it can process polysemous words in a better way than a vector representation. A network of a polysemous term is regarded as a combination of sub-networks that represent senses and the appropriate sub-network is identified by context before compared by the kernel. Second, the representation permits not only words but also senses or contexts to be represented directly from corresponding set of terms. The validity of the representation and its similarity measure is evaluated with two tasks: synonym test and unsupervised word sense disambiguation. The method performed well and could compete with the state-of-the-art unsupervised methods.

• 한국정보관리학회:학술대회논문집
• /
• 한국정보관리학회 1994년도 제1회 학술대회 논문집
• /
• pp.151-154
• /
• 1994

Historical background of computer files is briefly outlined. Descriptive examples of phisical area of computer files revealed in existing cataloging rules and manuals are examined and analyzed in terms of consistency identification and term standardization. An analysis of examples may provide the basis for enhancing organizing computer file.

• 한국지능시스템학회논문지
• /
• 제11권7호
• /
• pp.659-665
• /
• 2001

Relevance feedback is the most popular query reformulation strategy in a relevance feedback cycle, the user is presented with a list of the retrieved documents and, after examining them, marks those which are relevant. In practice, only the top 10(or 20) ranked documents need to be examined. The main idea consists of selecting important terms, or expressions, attached to the documents that have been identified as relevant by the user, and of enhancing the importance of these terms in a new query formulation. The expected effect is that the new query will be moved towards the relevant documents and away from the non-relevant ones. Local analysis techniques are interesting because they take advantage of the local context provided with the query. In this regard, they seem more appropriate than global analysis techniques. In a local strategy, the documents retrieved for a given query q are examined at query time to determine terms for query expansion. This is similar to a relevance feedback cycle but might be done without assistance from the user.

• East Asian mathematical journal
• /
• 제37권4호
• /
• pp.499-521
• /
• 2021

This research is devoted to investigate Omar Khayyām's geometric solution for the cubic equation using conic sections in the Medieval Islam as a useful alternative connecting logic geometry with analytic geometry at a secondary school. We also introduce Omar Khayyām's 25 cases classification of the cubic equation with all positive coefficients. Moreover we study 6 cases with 4 terms of 25 cubic equations and in particular we reinterpret geometric methods of solving in 2015 secondary Mathematics curriculum and visualize them by means of dynamic geometry software.

• Journal of the Korean Statistical Society
• /
• 제18권2호
• /
• pp.97-106
• /
• 1989

We consider two semiparametric regression lines where the density of the error terms are unknown. We give simultaneous estimatros of the differences of intercepts and slopes which turn out to be asymptotically minimax as well as efficient in semiparametric sense.

• 호남수학학술지
• /
• 제26권3호
• /
• pp.331-339
• /
• 2004

The aim of this paper is to show the difference between the notion of digital continuity and that of computer continuity. More precisely, for digital images $(X,\;k_0){\subset}Z^{n_0}$ and $(Y,\;k_1){\subset}Z^{n_1}$, $if(k_0,\;k_1)=(3^{n_0}-1,\;3^{n_1}-1)$, then the equivalence between digital continuity and computer continuity is proved. Meanwhile, if $(k_0,\;k_1){\neq}(3^{n_0}-1,\;3^{n_1}-1)$, then the difference between them is shown in terms of the uniform continuity property.

• Journal of Yeungnam Medical Science
• /
• 제36권3호
• /
• pp.225-230
• /
• 2019

Background: It is not possible to measure how much activity is required to understand and code a medical data. We introduce an assessment method in clinical coding, and applied this method to neurosurgical terms. Methods: Coding activity consists of two stages. At first, the coders need to understand a presented medical term (informational activity). The second coding stage is about a navigating terminology browser to find a code that matches the concept (code-matching activity). Systematized Nomenclature of Medicine - Clinical Terms (SNOMED CT) was used for the coding system. A new computer application to record the trajectory of the computer mouse and record the usage time was programmed. Using this application, we measured the time that was spent. A senior neurosurgeon who has studied SNOMED CT has analyzed the accuracy of the input coding. This method was tested by five neurosurgical residents (NSRs) and five medical record administrators (MRAs), and 20 neurosurgical terms were used. Results: The mean accuracy of the NSR group was 89.33%, and the mean accuracy of the MRA group was 80% (p=0.024). The mean duration for total coding of the NSR group was 158.47 seconds, and the mean duration for total coding of the MRA group was 271.75 seconds (p=0.003). Conclusion: We proposed a method to analyze the clinical coding process. Through this method, it was possible to accurately calculate the time required for the coding. In neurosurgical terms, NSRs had shorter time to complete the coding and higher accuracy than MRAs.