• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.5
• /
• pp.519-524
• /
• 2010

In this paper, we will introduce our approach for composing operation based on user tasks. It is based on Service Component Architecture (SCA). In addition, we developed ontology based on OWL and the MIT process handbook, called u-TO(universal task ontology), which can be used for users describing and specifying semantically their needs. We represent the hierarchy of tasks, and classify tasks according to views in u-TO. It aims at facilitating the modeling of complex demands or systems without regarding details of technical aspects of underlying infrastructure.

• Journal of information and communication convergence engineering
• /
• v.1 no.2
• /
• pp.82-87
• /
• 2003

We are able to work on the shared virtual space in Web-based Collaborative Design System using only Internet and Web browser. Then the users will share 3D objects and must be able to pick the objects effectively which they want to manipulate. In this paper, picking is implemented not only by computing intersection of mouse pointer with the objects of the virtual world, but also by using capabilities and attributes of scene graph node, by setting bounds intersection testing instead of geometric intersection testing, by limiting the scope of the pick testing, using Java 3D. These methods can reduce the computation of picking and can pick 3D objects effectively and easily using the system of hierarchy.

• International journal of advanced smart convergence
• /
• v.7 no.4
• /
• pp.66-74
• /
• 2018

While new information technology advances have made information access and acquisition methods much more diverse and easier, there are side effects that allow illegal access using diverse and high-performance tools. In order to cope with such threats, there are access control methods in database technology, and various studies are being conducted to extend traditional access control to cope with new computing environments. In this paper, we propose an extended access control with uncertain context-awareness. It enables appropriate security policy enforcement even if the contextual constraints specified by the security policy does not match those accompanied by access request query. We extract semantic implications from context tree, and define the argument that can quantitatively measure the semantic difference between two nodes in the context tree. It is used to semantically enforce the security policy, and to prevent the excessive authorization caused by the implication.

• Journal of the Semiconductor & Display Technology
• /
• v.22 no.3
• /
• pp.142-148
• /
• 2023

In this paper, we identify performance issues in executing compute kernels from PolyBench, which includes compute kernels that are the core computational units of various data-intensive workloads, such as deep learning and data-intensive applications, on Processing-in-Memory (PIM) devices. Therefore, using our in-house simulator, we measured and compared the various performance metrics of workloads based on traditional out-of-order and in-order processors with Processing-in-Memory-based systems. As a result, the PIM-based system improves performance compared to other computing models due to the short-term data reuse characteristic of computational kernels from PolyBench. However, some kernels perform poorly in PIM-based systems without a multi-layer cache hierarchy due to some kernel's long-term data reuse characteristics. Hence, our evaluation and analysis results suggest that further research should consider dynamic and workload pattern adaptive approaches to overcome performance degradation from computational kernels with long-term data reuse characteristics and hidden data locality.

• The Journal of Society for e-Business Studies
• /
• v.20 no.4
• /
• pp.61-76
• /
• 2015

In general, we have utilized the hierarchical concept tree as a crucial data structure for indexing huge amount of textual data. This paper proposes a generality rank-based method that can automatically develop hierarchical concept structures with the Wikipedia data. The goal of the method is to regard each of Wikipedia articles as a concept and to generate hierarchical relationships among concepts. In order to estimate the generality of concepts, we have devised a special ranking function that mainly uses the number of hyperlinks among Wikipedia articles. The ranking function is effectively used for computing the probabilistic subsumption among concepts, which allows to generate relatively more stable hierarchical structures. Eventually, a set of concept pairs with hierarchical relationship is visualized as a DAG (directed acyclic graph). Through the empirical analysis using the concept hierarchy of Open Directory Project, we proved that the proposed method outperforms a representative baseline method and it can automatically extract concept hierarchies with high accuracy.

• Journal of Internet Computing and Services
• /
• v.8 no.5
• /
• pp.81-89
• /
• 2007

In this thesis, we propose ontology based context-aware recommendation system using concept hierarchy(OCARCH), Context-aware recommendation services are useful to provide an user with relevant information and/or services bared on his current context, However several approaches to context-aware recommendation system have been already proposed, each of them provide information without considering level of information concept bared on his current context, For this reason, we propose OCARCH as system capable of helping people to find their way quickly and easily through large amounts of information by determining level of information concept based on his current context, We are also using prefetching algorithm to store recommendation information that the user is likely to need in the near future based on current predictions, Therefore the OCARCH enables users to obtain relevant information efficiently, Several experiments are performed and the experimental results show that the proposed system provides more effective than conventional context-aware recommendation system.

• CRM연구
• /
• v.1 no.1
• /
• pp.3-22
• /
• 2006

As customer relationship management (CRM) has been increasingly adopted by corporations as a core business strategy, measuring performance of CRM is becoming an important managerial issue recently. In this study, we present a conceptual framework formeasuring CRM performance, and provide strategic priorities among the diagnostic perspectives and factors involved in the framework by analyzing their comparative weights. We first derived critical success factors of CRM from an extensive literature review and in-depth interviews with industrial and academic CRM experts, and categorized them into one of four different diagnostic perspectives. Then, we asked a group of CRM experts to evaluate each set of diagnostic factors in a pairwise fashion with respect to each perspective, computing their comparative weights by using the Analytic Hierarchy Process (AHP) technique. In terms of diagnostic perspectives, this study shows that customer perspective was the most critical perspective, whereas infrastructure was the least weighted perspective. The result also discloses that explicit goal and top management's attitude, expanding customer relationship, strengthening customer loyalty, and enhancing customer equity are the most important factors in infrastructure, CRM process, customer, and organizational performance perspective, respectively.

• The KIPS Transactions:PartA
• /
• v.12A no.3 s.93
• /
• pp.215-222
• /
• 2005

The efficient utilization of cache memories is a key factor in achieving high performance for computing large signal transforms. Nonunit stride access in computation of large DFTs causes cache conflict misses, thereby resulting in poor cache performance. It leads to a severe degradation in overall performance. In this paper, we propose a dynamic data layout approach considering the memory hierarchy system. In our approach, data reorganization is performed between computation stages to reduce the number of cache misses. Also, we develop an efficient search algorithm to determine the optimal tree with the minimum execution time among possible factorization trees considering the size of DFTs and the data access stride. Our approach is applied to compute the fast Fourier Transform (FFT). Experiments were performed on Pentium 4, $Athlon^{TM}$ 64, Alpha 21264, UtraSPARC III. Experiment results show that our FFT achieve performance improvement of up to 3.37 times better than the previous FFT packages.

• Journal of the Korean Geographical Society
• /
• v.28 no.3
• /
• pp.200-212
• /
• 1993

Wholesaling is important industry that is remarkable by the function and characteristics of city. This paper aims at examing the recent changes in hierarchy of cities and city classifi-cation by wholesale activities in Korea. In order to grasp the stydy purpose, this paper is to analuze the changes of categories by wholesale industry, and to grasp the change in the city classification with city hierachy of wholesale sales in 1968, 1979, and 1991. The data were obtained from the statistics in the Census of Wholesale and Retail Trade published by the National Statistical Office, in 1969, 1981, and 1992. As the result of examination, the following finding were obtained: 1. Wholesaling has developed form that of production and consumption goods wholesale, especially 'Wholesaling of Farm Products, Foods and Beverages' to that of investment goods that is 'Wholesaling of Machinery and Equipment' and 'Wholesaling of Transport Equipment and Parts'. 2. Wholesaling has developed in the medium and small cities in 1970's, and in the larger cities in 1980's. And the concentration ratio of six larger cities were lower than another cities in terms of wholesale sales, especially Seoul and Pusan. 3. Recently with income increment and a purchasing power, city classification was changed by the increasing number of wholesale establi-shments of 'Automotive Parts and Tyres' in 1970's and of 'Office, Computing and Accounting Machines and Motor Vehicles' in 1980's.

• Journal of Internet Computing and Services
• /
• v.21 no.1
• /
• pp.1-15
• /
• 2020

This study explores reasonable alternatives to internet interconnection policy. Due to the development of information and communication technology, patterns of the Internet usage are changing rapidly, including increase of video streaming services. For this reason, there is a lively discussion of the Internet interconnection policy, which integrates various Internet service operators into one ecosystem. We conducted an Analytic Hierarchy Process(AHP) analysis with 16 experts in government/public, and academic sectors, and alternative selection criteria and their corresponding alternatives and detailed tasks were evaluated. According to the results, the most important alternative selection criteria was a "fair charge against foreign service operators", and the most desirable alternative was "partial revise". Moreover, the experts responded that "reassessment of the principle of the charge" is the most urgent task to improve the Internet interconnection policy.