• The Transactions of the Korea Information Processing Society
• /
• v.7 no.5S
• /
• pp.1620-1628
• /
• 2000

Existing internet auction systems have adopted the form which gives a win to the auction bidder who proposes the top bid price for the goods posted on the auction board. But they haven't been satisfying the automatical one-step processing for user's convenience because they must require continuous care of user for bidding and checking as well as neglecting the convenience of user interface while participating in the electronic bidding system. The AuctionBot system of Michigan Univ. is known as the representative internet auction system. It has merit allowing the various kids of bidding. But it does not support automatic a process which can replaces what user has to do using an agent. To improve this kind of user interface, we propose an automatic bidding price strategy algorithm which composes the auction system using agent and design for auto-bidding system using agent so that I can replace user's bidding activity. This mechanism gives an auction system the efficient bidding price strategy.

• Journal of the Korea Computer Industry Society
• /
• v.6 no.3
• /
• pp.379-390
• /
• 2005

Intensive studies have been made in the area of VOD server Multimedia files in the VOD sever are characterized with the large volume of data, the requirements of synchronization and real-time playback of streams. The basic goal of the study is to find an efficient mechanism to allow maximum number of users under the limited resources such as Buffer size and disk bandwidth. we propose a efficient $pre\_fetching$ policy for multimedia services with dynamic monitoring and management of VOD sever resources. Simulation results show that the rate of buffer usage and service time of proposed scheme are about $28\%$ performance improved than that of traditional methods. This implies that our method can allow much more users for given resources.

• Journal of the Korea Computer Industry Society
• /
• v.9 no.2
• /
• pp.53-62
• /
• 2008

Intensive studies have been made in the area of IPTV VOD server. The basic goal of the study is to find an efficient mechanism to allow maximum number of users under the limited resources such as Buffer utilization, disk performance and network bandwidth. The overlay multicast that has been recently presented as an alternative for the IP multicast has been getting much persuasion by the system resource and the network bandwidth and the advancement of the network cost. we propose a efficient overlay multi_casting network policy for multimedia services with multi media partition storage. Simulation results show that the rate of service number and service time of proposed scheme are about 23% performance improved than that of traditional methods. This implies that our method can allow much more users for given resources.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.8
• /
• pp.2805-2826
• /
• 2021

In most cases, the routing policy of networks shows a preference for a static one-to-one mapping of communication pairs to routing paths, which offers adversaries a great advantage to conduct thorough reconnaissance and organize an effective attack in a stress-free manner. With the evolution of network intelligence, some flexible and adaptive routing policies have already proposed to intensify the network defender to turn the situation. Routing mutation is an effective strategy that can invalidate the unvarying nature of routing information that attackers have collected from exploiting the static configuration of the network. However, three constraints execute press on routing mutation deployment in practical: insufficient route mutation space, expensive control costs, and incompatibility. To enhance the availability of route mutation, we propose an OpenFlow-based route mutation technique called Polymorphic Path Transferring (PPT), which adopts a physical and virtual path segment mixed construction technique to enlarge the routing path space for elevating the security of communication. Based on the Markov Decision Process, with considering flows distribution in the network, the PPT adopts an evolution routing path scheduling algorithm with a segment path update strategy, which relieves the press on the overhead of control and incompatibility. Our analysis demonstrates that PPT can secure data delivery in the worst network environment while countering sophisticated attacks in an evasion-free manner (e.g., advanced persistent threat). Case study and experiment results show its effectiveness in proactively defending against targeted attacks and its advantage compared with previous route mutation methods.

• International conference on construction engineering and project management
• /
• 2022.06a
• /
• pp.222-229
• /
• 2022

Although stochastic programming and feedback control approaches could efficiently mitigate the overdue risks caused by inherent uncertainties in ground conditions, the lack of formal representations of planners' rationales for resource allocation still prevents planners from applying these approaches due to the inability to consider comprehensive resource allocation policies for hard rock tunnel projects. To overcome the limitations, the authors developed an ontology that represents the project duration estimation rationales, considering the impacts of ground conditions, excavation methods, project states, resources (i.e., given equipment fleet), and resource allocation policies (RAPs). This ontology consists of 5 main classes with 22 subclasses. It enables planners to explicitly and comprehensively represent the necessary information to rapidly and consistently estimate the excavation durations during construction. 10 rule sets (i.e., policies) are considered and categorized into two types: non-progress-related and progress-related policies. In order to provide simplified information about the remaining durations of phases for progress-related policies, the ontology also represents encoding principles. The estimation of excavation schedules is carried out based on a hypothetical example considering two types of policies. The estimation results reveal the feasibility, potential for flexibility, and comprehensiveness of the developed ontology. Further research to improve the duration estimation methodology is warranted.

• International Journal of Computer Science & Network Security
• /
• v.24 no.9
• /
• pp.105-110
• /
• 2024

Nowadays, permutation problems with large state spaces and the path to solution is irrelevant such as N-Queens problem has the same general property for many important applications such as integrated-circuit design, factory-floor layout, job-shop scheduling, automatic programming, telecommunications network optimization, vehicle routing, and portfolio management. Therefore, methods which are able to find a solution are very important. Genetic algorithm (GA) is one the most well-known methods for solving N-Queens problem and applicable to a wide range of permutation problems. In the absence of specialized solution for a particular problem, genetic algorithm would be efficient. But holism and random choices cause problem for genetic algorithm in searching large state spaces. So, the efficiency of this algorithm would be demoted when the size of state space of the problem grows exponentially. In this paper, the new method presented based on genetic algorithm to cover this weakness. This new method is trying to provide partial view for genetic algorithm by locally searching the state space. This may cause genetic algorithm to take shorter steps toward the solution. To find the first solution and other solutions in N-Queens problem using proposed method: dividing N-Queens problem into subproblems, which configuring initial population of genetic algorithm. The proposed method is evaluated and compares it with two similar methods that indicate the amount of performance improvement.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.5
• /
• pp.1036-1057
• /
• 2013

Wireless body area network (WBAN) is a promising candidate for future health monitoring system. Nevertheless, the path to mature solutions is still facing a lot of challenges that need to be overcome. Energy efficient scheduling is one of these challenges given the scarcity of available energy of biosensors and the lack of portability. Therefore, researchers from academia, industry and health sectors are working together to realize practical solutions for these challenges. The main difficulty in WBAN is the uncertainty in the state of the monitored system. Intelligent learning approaches such as a Markov Decision Process (MDP) were proposed to tackle this issue. A Markov Decision Process (MDP) is a form of Markov Chain in which the transition matrix depends on the action taken by the decision maker (agent) at each time step. The agent receives a reward, which depends on the action and the state. The goal is to find a function, called a policy, which specifies which action to take in each state, so as to maximize some utility functions (e.g., the mean or expected discounted sum) of the sequence of rewards. A partially Observable Markov Decision Processes (POMDP) is a generalization of Markov decision processes that allows for the incomplete information regarding the state of the system. In this case, the state is not visible to the agent. This has many applications in operations research and artificial intelligence. Due to incomplete knowledge of the system, this uncertainty makes formulating and solving POMDP models mathematically complex and computationally expensive. Limited progress has been made in terms of applying POMPD to real applications. In this paper, we surveyed the existing methods and algorithms for solving POMDP in the general domain and in particular in Wireless body area network (WBAN). In addition, the papers discussed recent real implementation of POMDP on practical problems of WBAN. We believe that this work will provide valuable insights for the newcomers who would like to pursue related research in the domain of WBAN.

• Journal of Digital Convergence
• /
• v.13 no.6
• /
• pp.185-195
• /
• 2015

This study aims to study the change in the level of awareness of medical personnels regarding the patient safety culture(PSC) before and after the Leadership WalkRounds(LWR). The LWR in this study was based on the IHI and the models of the Patient Safety Rounds(PSRs) at University of Michigan, emphasizing the 5 steps of Preparation--Scheduling--Conducting--Reporting--Resolving. After the LWR the scores for the level of awareness showed a statistically significant increase from 2.63 to 3.36(p<.001). Among the participants, those who are pharmaceutists, women, 30.0~39.9 years old, or had work experience of a year or less showed particularly notable increase in awareness. The effect was significant across all categories of PSC, especially in Safety Accident Reporting(p<.001), then in Communication(p<.001). Therefore the LWR proved an convergent concept for applying new leadership skill and the concept of patient safety management as an method to elevate the frontline staffs' awareness of PSC.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.12
• /
• pp.1476-1484
• /
• 1999

TV 방송 분야에서 다양한 정보와 상호 작용성을 제공하기 위해서 최근 기존 방송 내용인 A/V 스트림 외 부가정보 방송이 시도되고 있다. 데이타 방송에 대한 기존 연구는 대부분 고정된 내용의 데이타를 방송하는 환경을 가정하고 있어서 그 결과가 방송 내용의 변화가 많은 환경에 부적합하다. 본 논문에서는 데이타에 대한 접근이 반복되지 않을 가능성이 높고 사용자 접근 확률을 예상하기 어려운 상황에서 응답 시간을 개선하는 방안으로 수신 데이타를 무조건 캐쉬에 반입하고 교체가 필요한 경우 다음 방송 시각이 가장 가까운 페이지를 축출하는 사용자 단말 시스템에서의 캐슁 정책을 제안하였다. 제안된 캐쉬 관리 정책은 평균적인 캐쉬 접근 실패 비용을 줄임으로써 사용자 응답 시간을 개선하며, 서로 다른 스케줄링 기법을 사용하는 다양한 방송 제공자가 공존하는 환경에서 보편적으로 효과를 가져올 수 있다.Abstract Recently, many television broadcasters have tried to disseminate digital multimedia data in addition to the traditional content (audio-visual stream). The broadcast data need to be cached by a client system, to provide a reasonable response time for a user request. Previous studies assumed the dissemination of a fixed set of items, and the results are not suitable when broadcast items are frequently changed. In this paper, we propose a novel cache management scheme that chooses the replacement victim based on the remaining time to the next broadcast instance. The proposed scheme reduces response time, where it is hard to predict the probability distribution of user accesses. The caching policy we present here significantly reduces expected response time by minimizing expected cache miss penalty, and can be applied without difficulty to different scheduling algorithms.

• Journal of KIISE:Software and Applications
• /
• v.29 no.12
• /
• pp.957-965
• /
• 2002

Garbage collection in the CLDC typically employs a stop-the-world GC algorithm which is performing a complete garbage collection when needed. This technique is unsuitable for the interactive Java embedded system because this can lead to long and unpredictable delays. In this paper, We present a garbage collection algorithm which reduces the average delay time and supports the interactive environment. Our garbage collector is composed of the allocator and the collector. The allocator determines the allocation position of free-list according to object size, and the collector uses an incremental mark-sweep algorithm. The garbage collector is called periodically by the thread scheduling policy and the allocator allocates the objects of marked state during collection cycle. Also, we introduce a color toggle mechanism that changes the meaning of the bit patterns at the end of the collection cycle. We compared the performance of our implementation with stop-the-world mark-sweep GC. The experimental results show that our algorithm reduces the average delay time and that it provides uniformly low response times.