• The Korean Journal of Applied Statistics
• /
• v.30 no.6
• /
• pp.1015-1025
• /
• 2017

Bayesian personalized ranking (BPR) is a state-of-the-art recommendation system techniques for implicit feedback data. Unfortunately, there might be a loss of information because the BPR model considers only the binary transformation of implicit feedback that is non-binary data in most cases. We propose a modified BPR method using a level of confidence based on the size or strength of implicit feedback to overcome this limitation. The proposed method is useful because it still has a structure of interpretable models for underlying personalized ranking i.e., personal pairwise preferences as in the BPR and that it is capable to reflect a numerical size or the strength of implicit feedback. We propose a computation algorithm based on stochastic gradient descent for the numerical implementation of our proposal. Furthermore, we also show the usefulness of our proposed method compared to ordinary BPR via an analysis of steam video games data.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.7 no.1
• /
• pp.22-31
• /
• 2008

RT/IMPOST is an effective algorithm that can realize real-time internal metering policy (IMP) using queue information from loop detector and signal control strategies. In this paper, an investigation was made to adopt the IMP methodology within COSMOS environments in terms of communication environment and control time point. Through the analysis of the communication environment of COSMOS and communication and control steps in RT/IMPOST, a set of applicable alternative were developed and evaluated. Then, one of the alternatives was selected, and performance of the alternative was compared with RT/IMPOST system using a simulation technique. Results showed that two techniques produced the similar performance. Therefore, the method suggested in this paper was evaluated as a practically viable alternative.

• Geophysics and Geophysical Exploration
• /
• v.10 no.4
• /
• pp.259-267
• /
• 2007

An efficient algorithm for inverting static-shifted magnetotelluric (MT) data has been proposed to produce a three-dimensional (3D) resistivity model. In the Gauss-Newton approach, computational costs associated with construction of a full sensitivity matrix usually make 3D MT inversion impractical. This computational difficulty may be overcome by using approximate sensitivities. We use four kinds of sensitivities in particular orders in the inversion process. These sensitivities are computed 1) analytically for an initial, homogeneous earth, 2) exactly for a current model, 3) approximately by the Broyden method, and 4) approximately using the previous adjoint fields. Inversion experiments with static-shifted synthetic and field MT data indicate that inversion results are highly dependent on characteristics of data and thus applying various combinations of sensitivities is helpful in obtaining a good image of the subsurface structure with reasonable computation time.

• The Journal of the Convergence on Culture Technology
• /
• v.6 no.4
• /
• pp.477-482
• /
• 2020

Currently, suggesting directions for strengthening publicity of social services is thinking in the direction of each person's advantage from the stakeholder's perspective. The position of the service provider and the position of the user shows different opinions on the definition and evaluation of publicity of the city or province as the management entity. Therefore, this study combines opinions on publicity focusing on community service, derives consensus on the definition and evaluation of publicity, and evaluates different indicators or factors that cannot be quantified at the same time. The goal is to solve the problem of publicity by applying the Analytic Hierarchy Process(AHP) as a possible technique. In addition, in order to achieve the research objectives according to the designed frame, an empirical study was conducted by conducting a pairwise comparison questionnaire for experts and users. Through the AHP evaluation model" developed in this study, as a result of measuring the relative satisfaction of major factors, service utilization rate (0.470), facility management (0.210), and other project implementations (0.073) appeared in order. Here, the service utilization rate was evaluated as the most important.

• Korean Journal of Crystallography
• /
• v.6 no.1
• /
• pp.43-48
• /
• 1995

The crystal structure of P-toluenesulfonanilide, C13H13NO2S is monoclinic, space group P21/c, a=8.777(1)Å, b=9.784(2)Å, c=15.139(2)Å, β=99.00(1)°, Z=4, V=1284.0(6)Å3, Dc=1.28g/cm33, λ(Mo-Kα)=0.71069Å, μ=2.3cm-1, F(000)=520, Temperature : 293±3K, R=0.038 for 711 Fo<3.0σ unique observed reflection. The structure was determuned by direct method and refined by full-matrix least squares refinement. Two benzene rings have the dihedral angle of 68.4°. Moleculs are accumulated according to the c axis with two fold screw and contacted by van der Walls force.

• Journal of Korean Society of Transportation
• /
• v.19 no.6
• /
• pp.131-142
• /
• 2001

Previous OD matrix estimation methods from link traffic counts have focused on the formulation of mathematical model and its solution algorithm. Thereby those methods have assumed that true or real OD is similar to the target OD and paid little attention to the properties of the change of OD structure. Although it is general situation that each OD pair increases or decreases due to significant land use and to large time variation between target OD with real OD, those methods have set unrealistic assumptions that target OD increases or decreases uniformly and that the OD structure does not change. Therefore those methods have showed poor performance of OD estimation in general situation. To cope with the problem. this paper suggests a new concept of OD matrix structure and shows the shortcomings of previous method′s dependancy on target OD matrix. We divide "OD trips" into "OD scale" and "OD structure". Where OD scale is a quantitative magnitude of OD trips and "OD structure" is ordinal OD scale. This paper use the same solution algorithm developed by Baek et al. (2000) for analysing the OD structure. Results of numerical examples show that the performance of the method is better than that of previous methods, while the previous methods have better performance in estimation only when OD trips increase or decrease. In addition to, if OD structure does not change, the results show that the error of estimation is low relatively regardless of the large difference of trips between target OD and real OD. This paper also shows that the model performance on OD structure and on OD trips is low as the number of origins that OD structure is changed increase. From the results we suggest that the change of OD structure can be more important information than the difference between target OD and real OD in OD estimation steps.

• Journal of Korean Society of Transportation
• /
• v.15 no.1
• /
• pp.175-192
• /
• 1997

첨단 교통정보 시스템(ATIS)의 핵심요소라고 할 수 있는 동적경로안내 시스템 (Dynamic Route Guidance System)은 운전자가 목적지에 도착하기까지 실시간 교통정보를 토대로 최적경로를 안내해줌으로써 날로 심화되고 있는 교통혼잡을 최소화 할 수 있으리라 기대를 모으고 있다. 특히 교통사고나 긴급 도로공사 등으로 인해 발생하는 돌발적 교통혼잡하에서는 DRGS의 역할이 더욱 커질 것으로 예상되고 있다. 본 논문은 돌발적 교통혼잡하에서 보다 효과적인 DRGS의 경로안내 전략을 수립하고 평가하는데 그 목적이 있다. 이를 위해 우선 하부구조기반 DRGS와 개인차량기반 DRGS의 장단점을 비교하고 시스템 아키텍쳐와 경로안내전략의 관계를 규명하였다. 또한 효율적인 경로안내를 위해 사용자평형 (User Equilibrium) 경로안내전략과 시스템 최적화(System Optimal) 경로안내 전략을 이상형교통망 (Idealized Network)을 통해 비교 분석하였다. 그리고 돌발적 교통 혼잡하에서 사용자평형 경로 안내를 사용할 경우 야기될 수 있는 Braess Paradox 문제와 시스템 최적경로안내를 사용할 경우 일어날 수 있는 사용자 호응도(User Compliance) 문제를 동시에 감안한 적응 형 경로안내 전략을 개발하였다. 이 방법은 위의 경로 안내 전략들이 가지고 있는 장단점을 상황에 따라 평가하여 경로안내 전략을 선택하는 과정을 수행시간을 절약하지 못할 것으로 평가되면 사용자 호응도를 고려하여 사용자 평형 전략을 선택하도록 하였다. 돌발적 교통 혼잡하에서 통행 시간을 동적으로 예측하기 위해서는 이산 확정적 대기행렬모형 (Discrete Deterministic Queueing Model)이 적용되었다. 한편, 적응형 전략의 효율성을 평가하기 위 해 이상형교통망과 실제 미국 Virginia 주의 Fairfax Country에 소재한 주간 고속도로 66번 과 인접 교통망을 대상으로 각종 돌발교통혼잡상황을 전제로 한 Traffic Simulation과 정보 제공 시나리오를 INTEGRATION Model을 사용하여 실행하였다. 그 결과 적응형전략이 단지 사용자평형 경로안내전략만 사용하는 경우에 비해 교통 혼잡도와 유고상황의 체류정도에 따라 3%에서 10%정도까지 전체통행시간을 절약할 수 있다는 결론을 얻었다.

• Journal of Korean Society of Transportation
• /
• v.17 no.1
• /
• pp.105-112
• /
• 1999

Image Processing Technique has been used as an efficient method to collect traffic information on the road such as vehicle counts, speed, queues, congestion and incidents. Most of the current methods which have been used to detect vehicles by the image processing are based on point processing, dealing with the local gray level of each pixel in the small window. However, these methods have some drawbacks. Firstly, detection is restricted by image quality. Secondly, they can not deal with occlusion and perspective projection problems, In this research, a new method which possibly deals with occlusion and perspective problems will be proposed. It extracts spatial information such as the position, the relationship of vehicles in 3-dimensional space, as well as vehicle detection in the image. The main algorithm used in this research is based on an extension of the Hough Transform. The Hough Transform which is proposed to estimates parameters of vertices and directed edges analytically on the Hough Space, is a valuable method for the 3-dimensional analysis of static scenes, motion detection and the estimation of viewing parameters.

• The Journal of the Korea Contents Association
• /
• v.19 no.4
• /
• pp.79-90
• /
• 2019

As an increasing number of cloud service providers begin to provide cloud computing services, they form a competitive market to compete for users. Due to different resource configurations and service workloads, users may observe different response times for their service requests and experience different levels of service quality. To compete for cloud users, it is crucial for each cloud service provider to determine an optimal price that best corresponds to their service qualities while also guaranteeing maximum profit. To achieve this goal, the underlying rationale and characteristics in this competitive market must be clarified. In this paper, we analyze price competition in the multimedia cloud service market with two service providers. We characterize the nature of non-cooperative games in a duopoly multimedia cloud service market with the goal of capturing how each cloud service provider determines its optimal price to compete with the other and maximize its own profit. To do this, we introduce a queueing model to characterize the service process in a multimedia cloud data center. Based on performance measures of the proposed queueing model, we suggest a price competition problem in a duopoly multimedia cloud service market. By solving this problem, we can obtain the optimal equilibrium prices.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.45 no.4
• /
• pp.53-60
• /
• 2022

In a group-testing method, instead of testing a sample, for example, blood individually, a batch of samples are pooled and tested simultaneously. If the pooled test is positive (or defective), each sample is tested individually. However, if negative (or good), the test is terminated at one pooled test because all samples in the batch are negative. This paper considers a queueing system with a two-stage group-testing policy. Samples arrive at the system according to a Poisson process. The system has a single server which starts a two-stage group test in a batch whenever the number of samples in the system reaches exactly a predetermined size. In the first stage, samples are pooled and tested simultaneously. If the pooled test is negative, the test is terminated. However, if positive, the samples are divided into two equally sized subgroups and each subgroup is applied to a group test in the second stage, respectively. The server performs pooled tests and individual tests sequentially. The testing time of a sample and a batch follow general distributions, respectively. In this paper, we derive the steady-state probability generating function of the system size at an arbitrary time, applying a bulk queuing model. In addition, we present queuing performance metrics such as the offered load, output rate, allowable input rate, and mean waiting time. In numerical examples with various prevalence rates, we show that the second-stage group-testing system can be more efficient than a one-stage group-testing system or an individual-testing system in terms of the allowable input rates and the waiting time. The two-stage group-testing system considered in this paper is very simple, so it is expected to be applicable in the field of COVID-19.