• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.15 no.3
• /
• pp.153-158
• /
• 2015

Nowadays, automatic keyphrase extraction is considered to be an important task. Most of the previous studies focused only on selecting keyphrases within the body of input documents. These studies overlooked latent keyphrases that did not appear in documents. In addition, a small number of studies on latent keyphrase extraction methods had some structural limitations. Although latent keyphrases do not appear in documents, they can still undertake an important role in text mining because they link meaningful concepts or contents of documents and can be utilized in short articles such as social network service, which rarely have explicit keyphrases. In this paper, we propose a new approach that selects qualified latent keyphrases from input documents and overcomes some structural limitations by using deep belief networks in a supervised manner. The main idea of this approach is to capture the intrinsic representations of documents and extract eligible latent keyphrases by using them. Our experimental results showed that latent keyphrases were successfully extracted using our proposed method.

• Communications of the Korean Mathematical Society
• /
• v.39 no.1
• /
• pp.223-245
• /
• 2024

We study RNA foldings and investigate their topology using a combination of knot theory and embedded rigid vertex graphs. Knot theory has been helpful in modeling biomolecules, but classical knots emphasize a biomolecule's entanglement while ignoring their intrachain interactions. We remedy this by using stuck knots and links, which provide a way to emphasize both their entanglement and intrachain interactions. We first give a generating set of the oriented stuck Reidemeister moves for oriented stuck links. We then introduce an algebraic structure to axiomatize the oriented stuck Reidemeister moves. Using this algebraic structure, we define a coloring counting invariant of stuck links and provide explicit computations of the invariant. Lastly, we compute the counting invariant for arc diagrams of RNA foldings through the use of stuck link diagrams.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.9
• /
• pp.1890-1906
• /
• 1997

A new ER feedback switch control algorithm, called EMRCA(Explicit Max-min Rate Control Algorithm), to control the ABR services traffic in the ATM networks, is proposed in this thesis. This scheme was interpreted the ACR variation residing on between a transient state and a stable state using the two thresholds that is the $TH_{high}$ and $TH_{low}$ in the queue to detect switch nodes congestion, and decreased the difference of minimum and maximum ACR all active connection to enhance the line bandwidth utilization. The proiposed scheme used a minimum and maximum rate of all active connections to select the connection whose the congestion rate inveoked, and uses a congestion detection mechanixm to prevent some potential cogestion by regulating selected contection.s The EMRCA scheme showed ACR variation more stable that the EPRCA scheme, also reduced buffer size of the switch, and achieved higher link utilization than the EPRCA scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.1B
• /
• pp.64-72
• /
• 2004

Multiprotocol Label Switching (MPLS) has been developed as a key technology to enhance the reliability, manageability and overall quality of service of core If networks with connection-oriented tunnel LSP and traffic engineering such as constraint-based routing, explicit routing, and restoration. In this paper, we propose a control bandwidth borrowing scheme that maximizes the utilization of tunnel LSPs or physical links by an extension to the RSVP-TE label distribution protocol. MPLS-based core switching network and VPN services rely on the establishment of connection-oriented tunneled LSPs that are configured or predefined by network management systems. The mechanism of network management system varies from (i) a relatively static LSP establishment accounting, to (ii) a dynamic QoS routing mechanisms. With the use of hierarchical LSPs, the extra bandwidth that is unused by the trunk (outer) LSPs should be fully allocated to their constituent end-to-end user traffic (inner) LSPs in order to maximize their utilization. In order to find out the unused extra bandwidth in tunnel LSP or physical link and redistribute these resources to constituent LSPs, we expend the functionality of RSVP-TE and the found unused extra bandwidth is redistributed with a weight-based recursive redistribution scheme. By the extended RSVP-TE and proposed recursive redistributed scheme, we could achieve the instantaneous maximized utilization of tunnel LSP or physical link suffering from the potential under-utilization problem and guarantee the end-to-end QoS requirements. With the proposed scheme, network manager can manage more effectively the extra available bandwidth of hierarchical LSPs and maximize the instantaneous utilization of the tunneled LSP resources.

• Journal of KIISE:Software and Applications
• /
• v.32 no.3
• /
• pp.202-214
• /
• 2005

The semantic web is the web paradigm that represents not general link of documents but semantics and relation of document. In addition it enables software agents to understand semantics of documents. We propose a semantic search based on inference with ontologies, which has the following characteristics. First, our search engine enables retrieval using explicit ontologies to reason though a search keyword is different from that of documents. Second, although the concept of two ontologies does not match exactly, can be found out similar results from a rule based translator and ontological reasoning. Third, our approach enables search engine to increase accuracy and precision by using explicit ontologies to reason about meanings of documents rather than guessing meanings of documents just by keyword. Fourth, domain ontology enables users to use more detailed queries based on ontology-based automated query generator that has search area and accuracy similar to NLP. Fifth, it enables agents to do automated search not only documents with keyword but also user-preferable information and knowledge from ontologies. It can perform search more accurately than current retrieval systems which use query to databases or keyword matching. We demonstrate our system, which use ontologies and inference based on explicit ontologies, can perform better than keyword matching approach .

• The Transactions of the Korea Information Processing Society
• /
• v.1 no.2
• /
• pp.244-253
• /
• 1994

Computer networks need a variety of services. Some services such as, video, voice and plantcontrol traffic require a real-time communication with explicit timing constraints. In this pater, we introduce a real-time communication technique which use a reservation technique on dualilnk networks. We introduce an enhanced technique that determines priorities of the message based on time constraints when real-time messages are transmitted. A simulation was conducted to compare and to analyze traditional technique. We used the SLAM II language to simulate this technique. Message loss rate were compared and analyzed as a performance criteria in this simulation.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2008.10a
• /
• pp.410-414
• /
• 2008

Providing recommendations is acknowledged as one of important features of a business-to-consumer online storefront. Though there have been many studies on algorithms and operational procedures of personalized recommender systems, there is still a lack of empirical evidence demonstrating relationships between social presence and two important outcome variables of recommender systems: reuse intention and trust. To test the existence of a causal link between social presence and reuse intention, and mediating role of trust between these two variables, this study performed experiments varying level of social presence while providing personalized recommendations to users based on their explicit preferences. This study also compared these effects in two different product contexts: hedonic and utilitarian product. The results show that the provision of higher social presence increases both the reuse intention and trust of the recommender systems. In addition, the influence of social presence on reuse intention in the setting of recommending utilitarian products is less than that in the setting of recommending hedonic products.

• Journal of Information Technology Applications and Management
• /
• v.20 no.4
• /
• pp.191-205
• /
• 2013

Recently, the topic of predicting interpersonal trust in online social networks is receiving considerable attention, because trust plays a critical role in controlling the spread of distorted information and vicious rumors, as well as reducing uncertainties and risk from unreliable users in social networks. Several trust prediction models have been developed on the basis of transitivity and composability properties of trust; however, it is hard to find empirical studies on whether and how transitivity and composability properties of trust are operated in real online social networks. This study aims to predict interpersonal trust between two unknown users in social networks and verify the proposition on whether and how transitivity and composability of trust are operated in social networks. For this purpose, we chose three social network sites called FilmTrust, Advogato, and Epinion, which contain explicit trust information by their users, and we empirically investigated the proposition. Experimental results showed that trust can be propagated farther and farther along the trust link; however, when path distance becomes distant, the accuracy of trust prediction lowers because noise is activated in the process of trust propagation. Also, the composability property of trust is operated as we expected in real social networks. However, contrary to our expectations, when the path is synthesized more during the trust prediction, the reliability of predicted trust did not tend to increase gradually.

• The Journal of Information Technology
• /
• v.8 no.3
• /
• pp.131-142
• /
• 2005

The principles on which the Internet was designed and has evolved were first laid out in an explicit way 20 years age. The basic principle is that in layered communications network such as the Internet, functions should always be implemented at the end systems whenever the option exists. This applies to all functions that can be implemented either in the network or at the end systems. End-to-end arguments have recently been reexamined as the Internet and its uses have evolved, and a new set of requirements has begun to emerge. In addition to these, it add a new, and perhaps more important, requirement to this list in the case of heterogeneous networks: the proliferation of unpredictable wireless networks. Wireless networks must cope with dynamic link conditions not present in wired infrastructures, which place a heavy burden on quality of service management solutions. Managing QoS in the face of constantly changing operating conditions demands dynamic management approaches that span multiple layers in the protocol stack. Such as cross-layer design approaches have recently received attention in the context of cellular and mobile special networks. This article introduce the notion of network predictability and describe its relationship to achievable QoS. This relationship is used to propose a framework for cross layer design that can be used to guide development efforts and direct investment decisions for future networks.

• Journal of Korea Trade
• /
• v.24 no.7
• /
• pp.107-124
• /
• 2020

Purpose - We assess the trade remedies rules in a host of Korea's FTAs to explore the trade policies for the effective implementation of FTA trade remedies rules. Also we develop the strategies of the future FTA negotiations of trade remedies rules. Design/methodology - After we review the key features of FTA trade remedies rules, we examine whether the rules are WTO-consistent or not. Next, we touch upon the WTO-plus characteristics of some provisions. Our main methodology is to compare the trade remedies rules in the numerous Korea's FTAs. Another methodology is to link those rules to the relevant WTO agreements and WTO dispute cases with a view to drawing lessons for trade policies and FTA negotiations. Findings - We find that most of the trade remedies rules are WTO-consistent. Moreover, we find that notification and consultation requirment, mandatory lesser duty rule, explicit prohibition of zeroing method, and public interest clause are WTO-plus. We also find that there are limitiations in the application of some global safeguard exclusion rules because of their non-mandatory nature. Originality/value - While most of previous studies focus mainly on the unique aspects of specific FTAs, our study analyzes comprehensively the trade remedies rules in the various Korea's FTAs. Based on the comprehensive analysis, we figure out the areas to be clarified and improved for the effective implementation of FTAs and the strategies for the future FTA trade remedies negotiations. As a consequence, our paper is expected to contribute to the academic research on FTA policies as well as the national economy.