• Journal of Service Research and Studies
• /
• v.12 no.3
• /
• pp.70-92
• /
• 2022

Project risk assessment is the most important activity performed at the beginning of a project because it can judge the performance of the project in advance. In this study, We were evaluated risk with traditional risk factors such as technology and schedule, etc, and Indirect risks factors such as financial, strategic, and special risks. and then, we analyzed what kind of relationship these risk evaluation factors have on business performance and customer satisfaction. As a result of the research, it was found that the risk evaluation items had a relationship with performance and customer satisfaction. However, It is possible that the performance may differ depending on how risks are managed after risk assessment. Therefore, follow-up studies should be conducted, including information on risk management practices. This study is meaningful that presenting practical risk evaluation items and at the same time identifying the relationship with performance. We plan to further the study in future studies including the evaluation of risk management process.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.26 no.5D
• /
• pp.739-746
• /
• 2006

The bus probe-based link travel times were more readily available due to bus' fixed route schedule and it was different from that of taxi-based one in its value for the same link. At the same time, the bus-based one showed less accurate information than the taxi-based link travel time, in terms of reliability expressed by 1-RMSE(%) measure. The purpose of this thesis is to develop a heuristic algorithm for mixing both sources-based link travel times. The algorithm used both real-time and historical profile travel times. Real-time source used 4 consecutive periods' average and historical source used average value of link travel time for various congestion levels. The algorithm was evaluated for Seoul urban arterial network 3 corridors and 20 links. The results based on the developed algorithm were superior than the mere fusion based link travel times and the reliability amounted up to 71.45%. Some limitation and future research agenda have also been discussed.

• International Journal of Computer Science & Network Security
• /
• v.23 no.10
• /
• pp.37-43
• /
• 2023

The hospital situation, timing, and patient restrictions have become obstacles to an optimum therapy session. The crowdedness of the hospital might lead to a tight schedule and a shorter period of therapy. This condition might strike a post-stroke patient in a dilemma where they need regular treatment to recover their nervous system. In this work, we propose an in-house and uncomplex serious game system that can be used for physical therapy. The Kinect camera is used to capture the depth image stream of a human skeleton. Afterwards, the user might use their hand gesture to control the game. Voice recognition is deployed to ease them with play. Users must complete the given challenge to obtain a more significant outcome from this therapy system. Subjects will use their upper limb and hands to capture the 3D objects with different speeds and positions. The more substantial challenge, speed, and location will be increased and random. Each delegated entity will raise the scores. Afterwards, the scores will be further evaluated to correlate with therapy progress. Users are delighted with the system and eager to use it as their daily exercise. The experimental studies show a comparison between score and difficulty that represent characteristics of user and game. Users tend to quickly adapt to easy and medium levels, while high level requires better focus and proper synchronization between hand and eye to capture the 3D objects. The statistical analysis with a confidence rate(α:0.05) of the usability test shows that the proposed gaming is accessible, even without specialized training. It is not only for therapy but also for fitness because it can be used for body exercise. The result of the experiment is very satisfying. Most users enjoy and familiarize themselves quickly. The evaluation study demonstrates user satisfaction and perception during testing. Future work of the proposed serious game might involve haptic devices to stimulate their physical sensation.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.24 no.3
• /
• pp.139-145
• /
• 2024

Since COVID-19, most of people's main living spaces have been moved indoors. Due to this influence, many people's interest in companion plants continues to rise. People who raise companion plants often raise them for the purpose of emotional stability or air purification. In fact, plants have the effect of giving people a sense of emotional stability and the ability to purify indoor air is excellent depending on what kind of plant they are. However, if you do not have knowledge of plants, you will not know which plants have excellent air purification effects, and even if you grow them, you will face a problem that withers quickly. Therefore, in this paper, we develop an app that provides users who do not have prior knowledge to store and manage their MBTI and member information in a database using databases and MBTI, and based on this, recommend plant data that fits their preferences with the user and manage their schedules through calendars.

• Asia pacific journal of information systems
• /
• v.18 no.1
• /
• pp.145-162
• /
• 2008

One of the big concerns in e-society is privacy issue. In special, in developing robust ubiquitous smart space and corresponding services, user profile and preference are collected by the service providers. Privacy issue would be more critical in context-aware services simply because most of the context data themselves are private information: user's current location, current schedule, friends nearby and even her/his health data. To realize the potential of ubiquitous smart space, the systems embedded in the space should corporate personal privacy preferences. When the users invoke a set of services, they are asked to allow the service providers or smart space to make use of personal information which is related to privacy concerns. For this reason, the users unhappily provide the personal information or even deny to get served. On the other side, service provider needs personal information as rich as possible with minimal personal information to discern royal and trustworthy customers and those who are not. It would be desirable to enlarge the allowable personal information complying with the service provider's request, whereas minimizing service provider's requiring personal information which is not allowed to be submitted and user's submitting information which is of no value to the service provider. In special, if any personal information required by the service provider is not allowed, service will not be provided to the user. P3P (Platform for Privacy Preferences) has been regarded as one of the promising alternatives to preserve the personal information in the course of electronic transactions. However, P3P mainly focuses on preserving the buyers' personal information. From time to time, the service provider's business data should be protected from the unintended usage from the buyers. Moreover, even though the user's privacy preference could depend on the context happened to the user, legacy P3P does not handle the contextual change of privacy preferences. Hence, the purpose of this paper is to propose a mutual P3P-based negotiation mechanism. To do so, service provider's privacy concern is considered as well as the users'. User's privacy policy on the service provider's information also should be informed to the service providers before the service begins. Second, privacy policy is contextually designed according to the user's current context because the nomadic user's privacy concern structure may be altered contextually. Hence, the methodology includes mutual privacy policy and personalization. Overall framework of the mechanism and new code of ethics is described in section 2. Pervasive platform for mutual P3P considers user type and context field, which involves current activity, location, social context, objects nearby and physical environments. Our mutual P3P includes the privacy preference not only for the buyers but also the sellers, that is, service providers. Negotiation methodology for mutual P3P is proposed in section 3. Based on the fact that privacy concern occurs when there are needs for information access and at the same time those for information hiding. Our mechanism was implemented based on an actual shopping mall to increase the feasibility of the idea proposed in this paper. A shopping service is assumed as a context-aware service, and data groups for the service are enumerated. The privacy policy for each data group is represented as APPEL format. To examine the performance of the example service, in section 4, simulation approach is adopted in this paper. For the simulation, five data elements are considered: $\cdot$ UserID $\cdot$ User preference $\cdot$ Phone number $\cdot$ Home address $\cdot$ Product information $\cdot$ Service profile. For the negotiation, reputation is selected as a strategic value. Then the following cases are compared: $\cdot$ Legacy P3P is considered $\cdot$ Mutual P3P is considered without strategic value $\cdot$ Mutual P3P is considered with strategic value. The simulation results show that mutual P3P outperforms legacy P3P. Moreover, we could conclude that when mutual P3P is considered with strategic value, performance was better than that of mutual P3P is considered without strategic value in terms of service safety.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.34 no.2
• /
• pp.597-604
• /
• 2014

In this study, we investigate to show the limitations of current bus arrival time estimation model based on each bus route, and to propose a bus arrival time estimation model based on a bus stop to overcome these limitations. Using the characteristic of bus arrival time calculated on travel time between two bus stops, we develop a model to estimate bus arrival times with the data of all buses traveling the same section regardless of bus route numbers. In the proposed model, an estimated arrival time is calculated by weighted moving average method, and verification between observed value and estimated time is performed on the basis of RMSE. Error was reduced by up to 20% compared to the existing models and the data update period was reduced by more than half that is related to the accuracy of bus arrival time information. We expect to solve the following problems with the suggested method: sudden increase or decrease in arrival time of the bus, the difference of the expected arrival times at the same stop between two or more buses having different route numbers, and impossibility of offering information of a bus if the bus is not operated with the designated schedule.

• Korean Chemical Engineering Research
• /
• v.58 no.3
• /
• pp.346-355
• /
• 2020

This study proposed a new optimization-based decision model for an enterprise resource planning and production scheduling of a pharmaceutical intermediates manufacturing plant. To do this work, we first define the inflow and outflow information as well as the model structure, and develop an optimization model to minimize the production time (i.e., makespan) using a mixed integer linear programing (MILP). The unique feature of the proposed model is that the optimal process scheduling is established based on real-time resource logistics information using a radio frequency identification (RFID) technology, thereby theoretically requiring no material inventories. essential information for process operation, such as the required amount of raw materials and estimated arrival timing to manufacturing plant, is used as logistics constraints in the optimization model to yield the optimal manufacturing scheduling to satisfy final production demands. We illustrated the capability of the proposed decision model by applying the optimization model to two scheduling problems in a real pharmaceutical intermediates manufacturing process. As a result, the optimal production schedule and raw materials order timing were identified to minimize the makespan while satisfying all the product demands.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.7B
• /
• pp.685-696
• /
• 2004

Real-time multimedia applications that require large amount of bandwidth need resource reservation before starting service for providing the QoS(i.e., Quality of Service). To reserve resources in advance, each reservation request has to notify its expectation on the required amount of resources and service duration. Using this information, a resource manager can schedule advance reservations. However, most existing resource management systems are adopting straightforward call admission control process (i.e., only immediate reservation) by checking currently available resources without considering the service duration. Hence, the resource management system that supports advance reservation has to manage confliction caused by indefinite service duration of immediate reservation. Even though the separation of resource pool according to type of reservation can prevent the confliction, it causes low resource utilization. In this paper, we propose an effective resource management scheme that supports both immediate and advance reservations by sharing resources dynamically. Using network cost function, the proposed scheme determines and adaptively adjusts resource boundary according to the confliction rate by varying weight parameters. And also, we define user utility function to quantify user satisfaction based on how well the reserved resource is guaranteed during service time. Simulation results using NS-2 network simulator show that the proposed scheme can achieve better resource utilization with preferable QoS than other schemes like static resource partitioning.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.3
• /
• pp.59-67
• /
• 2013

Reed-Solomon (RS) codes are powerful error-correcting codes used in diverse applications. Recently, algebraic soft-decision decoding algorithm for RS codes that can correct the errors beyond the error correcting bound has been proposed. The algorithm requires very intensive computations for interpolation, therefore an efficient VLSI architecture, which is realizable in hardware with a moderate hardware complexity, is mandatory for various applications. In this paper, we propose an efficient architecture with low hardware complexity for interpolation in soft-decision list decoding of Reed-Solomon codes. The proposed architecture processes the candidate polynomial in such a way that the terms of X degrees are processed in serial and the terms of Y degrees are processed in parallel. The processing order of candidate polynomials adaptively changes to increase the efficiency of memory access for coefficients; this minimizes the internal registers and the number of memory accesses and simplifies the memory structure by combining and storing data in memory. Also, the proposed architecture shows high hardware efficiency, since each module is balanced in terms of latency and the modules are maximally overlapped in schedule. The proposed interpolation architecture for the (255, 239) RS list decoder is designed and synthesized using the DongbuHitek $0.18{\mu}m$ standard cell library, the number of gate counts is 25.1K and the maximum operating frequency is 200 MHz.

• Korean journal of communication and information
• /
• v.54
• /
• pp.58-75
• /
• 2011

This study explores the management of cable local channel and its related issue of renewed license. Programming of the local channel is the special obligation duty on the cable system operators(SO) under the article 70 (3) of the Broadcast Act. The law provides that SO should operate a local channel which produce, program and transmit the local information, a broadcast program guide and the official announcement items etc. under the conditions as prescribed by Presidential Decree. And the article 55 of the Enforcement Decree defines the scope of broadcast program which transmit through the local channels. And the Korea Communications Commission(KCC) grants a renewed licence 3-5 years based on the level of contribution to the development of local community under the article 31 of the Broadcasting Act and the Rules of Broadcast Evaluation. However, the management of local channel does not give the operators real benefit for the investment of a significant cost, and it could be a reason why the local channel programming has not been vitalizing despite of the legal coercion. To solve the several research questions, this study used in-depth interviews with the experts concerned and literature review for the government documents. The result shows that each SO local channel schedule almost 24 hour a day, but much of them is the repeat programming. In addition to that, the outcome reveals that the scale of the cost investment on the local channel is decreasing and the evaluation score of its management is not so positive figures. These result indicates that the policy of the cable local channel needs revised policy alternatives or paradigm on the basis of realistic goals.