• IE interfaces
• /
• v.23 no.1
• /
• pp.24-34
• /
• 2010

In the telecommunication system which is based on the existing PSTN(public switched telephone network), feature interaction has been an important research issue in order to provide seamless services to users. Recently, rapid proliferation of IP-based network and the various types of IP media supply services, the feature interaction from the perspective of application services has become a significant aspect. This paper presents conflict detection and resolution algorithms for designing and operating a variety of services that are provided through IP-based network. The algorithms use explicit service interactions to detect conflicts between a new service and registered services. They then apply various rules to reduce search space in resolving conflicts. The algorithms are applied to a wide range of realistic service provision scenarios to validate that it can detect conflicts between services and resolve in accordance with different rule sets. By applying the algorithms to various scenarios, it is observed that the proposed algorithms can be effectively used in operating an IP-based services network.

• Journal of the Korean Society for Railway
• /
• v.10 no.2 s.39
• /
• pp.179-185
• /
• 2007

In large station with high density traffic, trains can be hardly controlled by CTC but by station dispatcher because CTC has difficulties in monitoring all states of affairs happening within each station such as departures, arrivals of many trains from different lines and shunting of trains to move between yards and platforms, etc. Therefore the station's dispatcher has to make quick decision about how to reschedule the times and routes for all the trains scheduled within a specific time window. And such decision becomes harder when an unexpected delay occurs because a delay occurring in a train propagates other trains as time goes on. Generally, it is called the conflict detection and resolution to adjust beforehand the distorted schedule due to a delay to original schedule. Our research is different from the state of the arts in that ours determines simultaneously the routes and the times of arrival and departure of trains, although others do only the arrival and departure time of the trains without considering the alternative routes and shunting of the station. This study suggests a mathematical approach for how to detect in advance and resolve efficiently the conflicts occurring within a station and it will be shown how to reduce delay using our approach by means of analysing the schedule of ChyungRyangRi station.

• ETRI Journal
• /
• v.29 no.3
• /
• pp.311-321
• /
• 2007

In this paper, we propose a user-centric conflict management method for media services which exploits personal companions for the harmonious detection and resolution of service conflicts. To detect conflicts based on the varying characteristics of individual users, the proposed method exploits the unified context describing all users attempting to access media services. It recommends and mediates users' preferred media contents through a shared screen and personal companions to resolve the detected conflicts. During the recommendation, a list of preferred media contents is displayed on the shared screen, and a personally preferred content list is shown on the user's personal companion comprising the selection of media contents. Mediation assists the selection of a consensual service by gathering the users' selections and highlighting the common media contents. In experiments carried out in a ubiHome, we observed that recommendations and mediation are useful in harmoniously resolving conflicts by encouraging user participation in conflict situations.

• Journal of Advanced Navigation Technology
• /
• v.23 no.1
• /
• pp.1-7
• /
• 2019

Thisstudy presentsthe development of a fast-time airport surface simulator. The simulator usesthe output from a first-come first-served (FCFS) scheduler and has adopted one-dimensional dynamic model to simulate the movement of the aircraft on the surface. Higher collision risks situations in the airport surface traffic are analyzed to classify those situations into six cases. A conflict detection and resolution algorithm is implemented to maintain separation distance and to prevent deadlock. The simulator was tested with a scenario at the Incheon International Airport that contains 72 aircraft. Without the conflict detection and resolution, various conflict situations are identified. When the conflict detection and resolution algorithm is managing the traffic, it is confirmed that the conflicts are removed at the price of additional delays. In the conflict resolution algorithm, three prioritization strategies are implemented, and delayed aircraft count and average additional delays are compared. Prioritization based on remaining time or distance showed smaller total additional delay compared to choosing minimum delay priority for each situation.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2007.04a
• /
• pp.147-150
• /
• 2007

본 논문에서는 토픽맵 기반의 온톨로지 병합 과정에서 발생할 수 있는 충돌의 유형을 트리 구조로 정의하고 충돌 탐지 및 해결을 통하여 두 온톨로지를 하나로 병합하는 기법을 제안한다. 병합충돌은 의미적 대응 요소들의 유사값에 기반하여 엘리먼트기반, 구조기반 임시기반의 트리 구조로 분류되고 이 충돌 트리를 이용하여 두 매핑 요소사이의 병합충돌을 탐지하고 해결한다. 실험을 위해 토픽맵 질의언어 tolog를 사용하여 동서양 철학온톨로지 및 독일 문학온톨로지들의 병합 전과 후의 질의 결과를 비교하고 이를 정확율과 재현율로 병합 성능을 평가하였으며 그 결과 손실없는 병합이 가능함을 보였다.

• Proceedings of the KSR Conference
• /
• 2007.05a
• /
• pp.1466-1474
• /
• 2007

In large station with high density traffic, trains is hardly controlled by CTC but by station dispatcher because CTC has difficulties in monitoring all states of affairs happening within the station such as departs and arrivals of many trains from different lines and shunting trains between yards and platforms, etc. Therefore station dispatcher has to make quick decision about how to schedule all trains including trains to arrive and depart before long. And such decisions become harder when an unexpected delay occurs. This study suggests a mathematical model and algorithm about how to detect in advance and resolve efficiently the conflicts occurring within a station and it will be shown how to reduce delay using our approach by means of analysing the schedule of ChyungRyangRi station.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.2
• /
• pp.454-460
• /
• 2000

In this paper, an architecture is suggested which efficiently detects intrusions in network environments. In the architecture, the Blackboardbased agent coordinates opinions of several independent agents which are performing unique functions, by resolving conflicts and reconfirming notices of intrusion. In the simulation, it was found that conventional agents judge simple resource access activities as 'intrusion' while blakcboard-based agent reserves the judgement until additional information confirms notices of independent agents. Reconfirmation process based on additional questioning will roduce positive errors.

• International Journal of Computer Science & Network Security
• /
• v.21 no.7
• /
• pp.331-340
• /
• 2021

The Internet of Things (IoT) is a rapidly growing physical network that depends on objects, vehicles, sensors, and smart devices. IoT has recently become an important research topic as it autonomously acquires, integrates, communicates, and shares data directly across each other. The centralized architecture of IoT makes it complex to concurrently access control them and presents a new set of technological limitations when trying to manage them globally. This paper proposes a new decentralized access control architecture to manage IoT devices using blockchain, that proposes a solution to concurrency management problems and enhances resource locking to reduce the transaction conflict and avoids deadlock problems. In addition, the proposed algorithm improves performance using a fully distributed access control system for IoT based on blockchain technology. Finally, a performance comparison is provided between the proposed solution and the existing access management solutions in IoT. Deadlock detection is evaluated with the latency of requesting in order to examine various configurations of our solution for increasing scalability. The main goal of the proposed solution is concurrency problem avoidance in decentralized access control management for IoT devices.

• Journal of Advanced Navigation Technology
• /
• v.15 no.6
• /
• pp.977-985
• /
• 2011

Airborne separation assurance is a key requirement for Free Flight Airspace operations, This paper study the feasibility of airborne separation assurance for free flight Airspaces operations by evaluating the efficiency measurement models. Three qualitatively different methods are utilized; one based Ground and Air conflict probability model, other based Dynamic Density model. the other based Direct operating cost model. The evaluation is Direct Operating Cost model and Two metrics are utilized for the efficiency measurements; airborne separation assurance performed quite well in the Free Flight evaluation; (1) 2 scenario of the conflict situations are resolved; (2) The MD-80 flight peformed separation assurance and efficiency, Not only appling for geometric method algorithm is more efficiently than potential method, but also the most efficiently geometric combined method.

• Journal of KIISE:Software and Applications
• /
• v.33 no.9
• /
• pp.787-801
• /
• 2006

Ontology merging describes the process of integrating two ontologies into a new ontology. How this is done best is a subject of ongoing research in the Semantic Web, Data Integration, Knowledge Management System, and other ontology-related application systems. Earlier research on ontology merging, however, has studied for developing effective ontology matching approaches but missed analyzing and solving methods of problems of merging two ontologies given correspondences between them. In this paper, we propose a specific ontology merging process and a generic operator, T-MERGE, for integrating two source ontologies into a new ontology. Also, we define a taxonomy of merging conflicts which is derived from differing representations between input ontologies and a method for detecting and resolving them. Our T-MERGE operator encapsulates the process of detection and resolution of conflicts and merging two entities based on given correspondences between them. We define a data structure, MergeLog, for logging the execution of T-MERGE operator. MergeLog is used to inform detailed results of execution of merging to users or recover errors. For our experiments, we used oriental philosophy ontologies, western philosophy ontologies, Yahoo western philosophy dictionary, and Naver philosophy dictionary as input ontologies. Our experiments show that the automatic merging module compared with manual merging by a expert has advantages in terms of time and effort.