• Proceedings of the Korean Statistical Society Conference
• /
• 2003.05a
• /
• pp.85-90
• /
• 2003

In this paper we develop a method for finding optimal ordering of K statistical models. This is based on a dependent paired comparison experimental arrangement whose results can naturally be represented by a completely oriented graph (also so called tournament graph). Introducing preference probabilities, strong transitivity conditions, and an optimal criterion to the graph, we show that a Hamiltonian path obtained from row sum ranking is the optimal ordering. Necessary theories involved in the method and computation are provided. As an application of the method, generalized variances of K multivariate normal populations are compared by a Bayesian approach.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.15 no.3
• /
• pp.60-67
• /
• 2016

In cumulative transfer functions, as number of transfer increase, the impact of individual transfer to transfer cost increase linearly or non linearly. This function can effectively explain various passengers's travel behavior who choose their travel routes in integrated transit line networks including bus and railway modes. Using the function, it is possible to simulate general situations such that even though more travel times are expected, less number of transfer routes are preferred. However, because travel cost with cumulative transfer function is known as non additive cost function types in route search algorithms, finding an optimal route in integrated transit networks is confronted by the insolvable enumeration of all routes in many cases. This research proposes a methodology for finding an optimal path considering cumulative transfer function. For this purpose, the reversal phenomenon of optimal path generated in route search process is explained. Also a heuristic methodology for selecting an optimal route among multiple routes predefined by the K path algorithm. The incoming link based entire path deletion method is adopted for finding K ranking path thanks to the merit of security of route optimality condition. Through case studies the proposed methodology is discussed in terms of the applicability of real situations.

• Journal of KIISE:Databases
• /
• v.33 no.5
• /
• pp.538-550
• /
• 2006

XML Keyword search enables us to get information easily without knowledge of structure of documents and returns specific and useful partial document results instead of whole documents. Element level query processing makes it possible, but computational complexity, as the number of documents grows, increases significantly overhead costs. In this paper, we present document-level ranking scheme over XML documents which predicts results of element-level processing to reduce processing cost. To do this, we propose the notion of 'keyword proximity' - the correlation of keywords in a document that affects the results of element-level query processing using path information of occurrence nodes and their resemblances - for document ranking process. In benefit of document-centric view, it is possible to reduce processing time using ranked document list or filtering of low scored documents. Our experimental evaluation shows that document-level processing technique using ranked document list is effective and improves performance by the early termination for top-k query.

• The Journal of Society for e-Business Studies
• /
• v.18 no.3
• /
• pp.93-105
• /
• 2013

Much Interest has focused on social network services such as Facebook and Twitter. Previous research conducted on social network often emphasized the architecture of the social network that is the existence of path between any objects on network and the centrality of the object in the network. However, studies on the semantic association in the network are rare. Studies on searching semantic associations between entities are necessary for future business enhancements. In this research, the ontology based social network analysis is performed. A new method to search and rank relation sequences that consist of several relations between entities is proposed. In addition, several heuristics to measure the strength of the relation sequences are proposed. To evaluate the proposed method, an experiment was performed. A group of social relationships among the university and organizations are constructed. Some social connections are searched using the proposed ranking method. The proposed method is expected to be used to search the association among entities in ontology based knowledge base.

• Journal of the Korean Society of School Health
• /
• v.6 no.1
• /
• pp.78-92
• /
• 1993

The purpose of this study is to find out the stress causes of the primary students in Korea, through the three major methods, life event score, multiple regression about stress causes and G.H.Q. path-diagram. A survey was made of 889 students who were selected among students of six primary schools in seoul and Ka-pyeng, from Sep. 28 to Oct. 2. 1992. The results of this study are summarized as follows : 1. Life event score Among the children's life events, (deaths of family) (degrade of school record) (the increase of absence days) (divorce of parents) (trouble with relationship) are high ranking in life event score. Besides, (scolded by teacher and parents) (beginning of extracurricular work) are spread stress causes. In conclusion, these stress causes are shown by two aspects, home, school, and so children are under stress circumstance in both places. These stress causes vary with area and sex. 2. Multiple regression about stress causes and G.H.Q. This study analysed how a stress caused by home life affects the children's health of mind and body. The most influential factors are , and these factors vary with area and sex. 3. Path-diagram This study proved that socio-psychological school environment raises children to secede from school, and this secession that operates as a stress cause affects children's health of mind and body. This serial process is analysed by path analysis, and made out a path-diagram. In conclusion, as expected socio-psychological,school environment affects the children's health of mind and body. This is shown by two aspects : positive, negative. This stress causes vary with area and sex.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.7
• /
• pp.2892-2913
• /
• 2016

Network virtualization promises to play a dominant role in shaping the future Internet by overcoming the Internet ossification problem. However, due to the injecting of additional virtualization layers into the network architecture, several new security risks are introduced by the network virtualization. Although traditional protection mechanisms can help in virtualized environment, they are not guaranteed to be successful and may incur high security overheads. By performing the virtual network (VN) embedding in a security-aware way, the risks exposed to both the virtual and substrate networks can be minimized, and the additional techniques adopted to enhance the security of the networks can be reduced. Unfortunately, existing embedding algorithms largely ignore the widespread security risks, making their applicability in a realistic environment rather doubtful. In this paper, we attempt to address the security risks by integrating the security factors into the VN embedding. We first abstract the security requirements and the protection mechanisms as numerical concept of security demands and security levels, and the corresponding security constraints are introduced into the VN embedding. Based on the abstraction, we develop three security-risky modes to model various levels of risky conditions in the virtualized environment, aiming at enabling a more flexible VN embedding. Then, we present a mixed integer linear programming formulation for the VN embedding problem in different security-risky modes. Moreover, we design three heuristic embedding algorithms to solve this problem, which are all based on the same proposed node-ranking approach to quantify the embedding potential of each substrate node and adopt the k-shortest path algorithm to map virtual links. Simulation results demonstrate the effectiveness and efficiency of our algorithms.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.2
• /
• pp.522-541
• /
• 2016

Network virtualization provides an effective way to overcome the Internet ossification problem. As one of the main challenges in network virtualization, virtual network embedding refers to mapping multiple virtual networks onto a shared substrate network. However, existing heuristic embedding algorithms evaluate the embedding potential of the nodes simply by the product of different resource attributes, which would result in an unbalanced embedding. Furthermore, ignoring the hops of substrate paths that the virtual links would be mapped onto may restrict the ability of the substrate network to accept additional virtual network requests, and lead to low utilization rate of resource. In this paper, we introduce and extend five node attributes that quantify the embedding potential of the nodes from both the local and global views, and adopt the technique for order preference by similarity ideal solution (TOPSIS) to rank the nodes, aiming at balancing different node attributes to increase the utilization rate of resource. Moreover, we propose a novel two-stage virtual network embedding algorithm, which maps the virtual nodes onto the substrate nodes according to the node ranks, and adopts a shortest path-based algorithm to map the virtual links. Simulation results show that the new algorithm significantly increases the long-term average revenue, the long-term revenue to cost ratio and the acceptance ratio.

• Journal of the Korean Institute of Oriental Medical Informatics
• /
• v.15 no.1
• /
• pp.1-10
• /
• 2009

In these days everyone search the information easily with the Internet as the rapid distribution and active usage of the Internet. The search engines were developed specially to accuracy of information retrieval. User search the information more quickly and variously with them. The search portal system will be embossed with representation and basic services. The Internet user needs the result of text, image and video, knowledge search. The keyword based search is used generally for getting result of the information retrieval and another method is category based search. This paper investigates the classification of knowledge search structure for oriental medicine in market leader of search portal system by ranking web site. As a result, each classification system is unified and there is a possibility of getting up a many confusion to the user who approaches with classification systematic search method. This treatise proposed the improved oriental medicine classification system of internet information retrieval in knowledge search area. if the service provider amends about the classification system, there will be able to guarantee the compatibility of data. Also the proper access path of the knowledge which seeks is secured to user.

• Journal of KIISE
• /
• v.42 no.12
• /
• pp.1522-1534
• /
• 2015

This work presents a new method that can predict, without the use of training data, whether an input essay is written on a given topic. ConceptNet is a common-sense knowledge base that is generated automatically from sentences that are extracted from a variety of document types. An essay prompt is the topic that an essay should be written about. The method that is proposed in this paper uses ConceptNet and an essay prompt to decide whether or not an input essay is off-topic. We introduce a way to find the shortest path between two nodes on ConceptNet, as well as a way to calculate the semantic similarity between two nodes. Not only an essay prompt but also a student's essay can be represented by concept nodes in ConceptNet. The semantic similarity between the concepts that represent an essay prompt and the other concepts that represent a student's essay can be used for a calculation to rank "on-topicness" ; if a low ranking is derived, an essay is regarded as off-topic. We used eight different essay prompts and a student-essay collection for the performance evaluation, whereby our proposed method shows a performance that is better than those of the previous studies. As ConceptNet enables the conduction of a simple text inference, our new method looks very promising with respect to the design of an essay prompt for which a simple inference is required.