• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.31 no.3
• /
• pp.52-60
• /
• 2008

This paper proposed a service satisfaction index in the service design. We utilize the service blueprint as the basic tool for the service process analysis, construct a service flow fishbone diagram which consists of the encounters representing the interaction between customer and service deliverer. To evaluate the service satisfactions of the service element a service satisfaction function is used. The service satisfaction function has the generic properties of the prospect theory with the probabilistic utility value in order to evaluate the service bundle which Is constructed by tangible and intangible service elements. A numerical example using the A/S service of Electronic Co. is presented for the verification.

• Journal of applied mathematics & informatics
• /
• v.23 no.1_2
• /
• pp.517-523
• /
• 2007

Let R/I be an Artinian algebra of codimension 3 with Hilbert function H such that $h_{d-1}>h_d=h_{d+1}$. Ahn and Shin showed that A cannot be level if ${\beta}_{1,d+2}(Gin(I))={\beta}_{2,d+2}(Gin(I))$ where Gin(I) is a generic initial ideal of I. We prove that some certain graded Artinian algebra R/I cannot be level if either ${\beta}_{1,d}(I^{lex})={\beta}_{2,d}(I^{lex})+1\;or\;{\beta}_{1,d+1}(I^{lex})={\beta}_{2,d+1}(I^{lex})\;where\;I^{lex}$ is a lex-segment ideal associated to I.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.42 no.3
• /
• pp.254-262
• /
• 2014

Radar task scheduling deals with the assignment of task to efficiently enhance the radar performance on the limited resource environment. In this paper, total weighted tardiness is adopted as the objective function of task scheduling in operation of multiple multi-function radars. To take into account real-time implementability, heuristic index-based methods are presented and investigated. Numerical simulations for generic search and track scenarios are performed to evaluate the proposed methods, in particular investigating the effectiveness of multi-radar operation concepts.

• Journal of Korean Medicine Rehabilitation
• /
• v.23 no.4
• /
• pp.95-115
• /
• 2013

Objectives The aim of this review is to provide fundamental data for low back pain scales which can be used in clinical trial. Methods We investigated the latest studies on chronic low back pain via PubMed. And we also investigated domestic studies through "http://oasis.kiom.re.kr". 95 research papers were analyzed. Scales were classified into pain scale, function scale, generic health status scale and psychological scale. Results 1) According to foreign clinical studies, Visual Analog Scale (VAS) and Numerical Rating Scale (NRS) were used 18 times as pain scale. Oswestry Disability Index (ODI) was used 20 times as function scale, Roland-Morris Disability Questionnaire (RMDQ) was 17, and Hannover Functional Ability Questionnaire (HFAQ) was used 3 times. 36-item Short Form Health Survey (SF-36) was used 13 times as generic health status scale, Euroqol-5 Dimentions Questionnaire (EQ-5D) was 11, and 12-item Short Form Health Survey (SF-12) was used 3 times. Fear-Avoidance Beliefs Questionnaire (FABQ) was used 9 times as psychological scale, Pain Catastrophizing Scale (PCS) and Tampa Scale for Kinesiophobia (TSK-R) both were used 3 times. 2) According to domestic clinical studies, VAS was used 37 times as pain scale, NRS was 11, and Short Form McGill Pain Questionnaire (SF-MPQ) was used 6 times. ODI was used 30 times as function scale, RMDQ was 2 times only. SF-36 was used once as generic health status scale and Beck's Depression Inventory (BDI) was used 3 times as psychological scale. Conclusions We recommend VAS or NRS as a measure to evaluate pain, and ODI as a measure to evaluate functional disability. And we also recommend SF-36 or SF-12 and EQ-5D as a measure to evaluate generic health status. Finally, we recommend FABQ for use in measuring psychological scale.

• Proceedings of the KOR-KST Conference
• /
• 2000.02a
• /
• pp.25-47
• /
• 2000

In route guidance systems fastest-path routing has typically been adopted because of its simplicity. However, empirical studies on route choice behavior have shown that drivers use numerous criteria in choosing a route. The objective of this study is to develop computationally efficient algorithms for identifying a manageable subset of the nondominated (i.e. Pareto optimal) paths for real-time vehicle routing which reflect the drivers' preferences and route choice behaviors. We propose two pruning algorithms that reduce the search area based on a context-dependent linear utility function and thus reduce the computation time. The basic notion of the proposed approach is that ⅰ) enumerating all nondominated paths is computationally too expensive, ⅱ) obtaining a stable mathematical representation of the drivers' utility function is theoretically difficult and impractical, and ⅲ) obtaining optimal path given a nonlinear utility function is a NP-hard problem. Consequently, a heuristic two-stage strategy which identifies multiple routes and then select the near-optimal path may be effective and practical. As the first stage, we utilize the relaxation based pruning technique based on an entropy model to recognize and discard most of the nondominated paths that do not reflect the drivers' preference and/or the context-dependency of the preference. In addition, to make sure that paths identified are dissimilar in terms of links used, the number of shared links between routes is limited. We test the proposed algorithms in a large real-life traffic network and show that the algorithms reduce CPU time significantly compared with conventional multi-criteria shortest path algorithms while the attributes of the routes identified reflect drivers' preferences and generic route choice behaviors well.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.6
• /
• pp.201-208
• /
• 2010

The classical iterated hash function is vulnerable to a multi-collision attack. Gauravaram et al. proposed 3C and 3C+ hash functions, in which an accumulation chain is added to usual Merkle-Damgard changing. Their goal is to design composition schemes resistant to generic attacks of Joux's type, but Joscak and Tuma have shown that 3C and 3C+ schemes are not better than Merkle-Damgard scheme in term of security against multi-collision attacks under some mild assumptions. In this dissertation, in order to increase security of 3C hash function, we proposed secure double pipe hash function which was effectively using XOR and XNOR operations per blocks of message. We seek to improve on the work of Lucks in a way. Proposed secure double pipe hash function takes resistance to multi-block collision, fixed point and pre-image attacks.

• Journal of the Korean Data and Information Science Society
• /
• v.25 no.5
• /
• pp.1039-1055
• /
• 2014

The distribution of a test statistic under a null hypothesis depends on the unknown distribution of the data and thus is unknown as well. Conditional tests replace the unknown null distribution by the conditional null distribution, that is, the distribution of the test statistic given the observed data. This approach is known as permutation tests and was developed by Fisher (Fisher, 1935). Theoretical framework for permutation tests was given by Strasser and Weber(1999). The coin package developed by Hothon et al. (2006, 2008) implements a unified approach for conditional inference via the generic independence test. Because convenient functions for the most prominent problems are available, users will not have to use the extremely flexible procedure. In this article we briefly review the underlying theory from Strasser and Weber (1999) and explain how to transform the data to perform the generic function independence test. Finally it was illustrated with a few real data sets.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.1
• /
• pp.58-73
• /
• 2021

Cloud Service Providers (CSPs) enable their users to access Cloud computing and storage services from anywhere in quick and flexible manners through the Internet. With the basis of 'pay-as-you-go' model, it makes the interactions between CSPs and the users play a vital role in shaping the Cloud computing market. A pool of virtualized and dynamically scalable Cloud services that delivered on demand to the users is associated with guaranteed performance and cost-provisioning. It needed a costing scheme for determining suitable charges in order to secure lease pricing of the Cloud services. However, it is hard to meet the satisfied prices for both CSPs and users due to their conflicting needs. Furthermore, there is lack of Service Level Agreements (SLAs) that allowing the users to take part into price negotiating process. The users may lose their interest to use Cloud services while reducing CSPs profit. Therefore, this paper proposes a generic costing scheme for Cloud services using General Equilibrium Theory (GET). GET helps to formulate the price function for various services' factors to match with various demands from the users. It is initially determined by identifying the market circumstances that a general equilibrium will be hold and reached. Specifically, there are two procedures of agreement made in response to (i) established equilibrium supply and demand, and (ii) service price formed and constructed in a price range. The SLAs in our costing scheme is integrated to satisfy both CSPs and users' needs while minimizing their conflicts. The price ranging strategy is deliberated to provide prices' options to the users with respect their budget limit. Meanwhile, the CSPs can adaptively charge based on users' preferences without losing their profit. The costing scheme is testable and analyzed in multi-tenant computing environments. The results from our simulation experiments demonstrate that the proposed costing scheme provides better users' satisfaction while fostering fairness pricing in the Cloud market.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.2
• /
• pp.327-346
• /
• 2013

Researchers as well as network providers are increasingly interested in understanding how a network user's experience changes in relation to different quality of service (QoS) parameters, with many attempts being made to identify the general relationship between quality of experience (QoE) and QoS. Several relations in different function forms have been proposed. There are instances when this variety of proposed functions potentially results in one problem having completely dissimilar solutions at the same time. The question then is which function form is the one that can better explain this relationship. In this paper, three major existing quantitative relationships between QoE and QoS are investigated. After conducting a comprehensive comparative analysis between them, a new definition of QoE-QoS dependency appears. It then results in identifying a new mutual relationship between QoE and QoS. The newly proposed relationship improves the deficiency of previous QoE-QoS relationships along with solving the problem of diversity of simultaneous solutions for one problem.

• Proceedings of the Korean Society of Propulsion Engineers Conference
• /
• 2011.11a
• /
• pp.127-134
• /
• 2011

A genetic algorithm (GA) has been employed to optimize the major design variables of the liquid rocket engine. Pressure of the main combustion chamber, nozzle expansion ratio and O/F ratio have been selected as design variables. The target engine has the open gas generator cycle using the LO2/RP-1 propellant. The gas properties of the combustion chamber have been obtained from CEA2 and the mass has been estimated using reference data. The objective function has been set as multi-objective function with the specific impulse and thrust to weight ratio using the weight method. The result shows about 4% improvement of the specific impulse and 23% increase of the thrust to weight ratio. The Pareto frontier line has been also obtained for various thrust requirements.