• The KIPS Transactions:PartC
• /
• v.10C no.7
• /
• pp.867-878
• /
• 2003

In thls Paper, we Propose a new scheme, protecting information about the location of a mobile user against attacks from inside users of the mobile communication, especially the network providers. There have already been some proposals about how to protect location information of user in mobile communication environments〔1-5〕. Among them, Kesdogan et al.〔2, 3〕 proposed a new method, using so-called temporary pseudonyms and also described protection method against a passive and an active attack of network providers. However, the description of protection method against the active attack between the two is not clear. Moreover, there is an additional load that it should append a reachability manager〔1, 6〕 to the proposed system. Therefore, we propose a new scheme improving the above method of Kesdogan et al. and analyze its security and effectiveness.

• Journal of Information Technology Services
• /
• v.14 no.4
• /
• pp.171-184
• /
• 2015

Nowadays, mobile commerce is having an increasingly profound impact on our daily lives, and offer interesting and advantageous new services. Mobile payment is an emerging and important application of mobile commerce in smart work, enabling users to use their mobile devices (especially mobile phones) for paying goods and services wherever they go. The appearance of m-payment is expected to provide us a convenient and bright future to enjoy. That is the common trend on over the world, but in Vietnam, although the number of smart phone users has been increasing rapidly, the adoption of m-payment system still didn't succeed completely. The research reviewed literature regarding mobile payment services, analyzed the impact of customer characteristics and system characteristics on m-payment adoption in Vietnam. To analyze the adoption behaviors of m-payment users, m-payment research model which consists of three customer-characteristics (m-payment trust, personal innovativeness, m-payment knowledge) and four m-payment system characteristics (mobility, reachability, convenience, compatibility) were studied. The results indicate that perceived usefulness, trust, and compatibility are the important predictors to the intention to use m-payment. This study will assist m-payment services suppliers in implementing appropriate business models and service strategies to successfully attract customer to use m-payment in Vietnam, allowing managers to exert appropriate investment, time, and effort for m-payment system development in designing smart working.

• Journal of Advanced Navigation Technology
• /
• v.23 no.5
• /
• pp.352-360
• /
• 2019

This paper proposes a docking assessment algorithm for an autonomous underwater vehicles (AUVs) with sensor uncertainties. The proposed algorithm consists of two assessments, state assessment and probability assessment. The state assessment verifies the reachability by comparing forward distance to the docking station with expected distance to reach same depth as the docking station and necessity for correcting its route by comparing calculated inaccessible areas based on turning radius of the AUV to position of the docking station. When the AUV and the docking station is close enough and the state assessment is satisfied, the probability assessment is conducted by computing success probability of docking based on the direction angle, relative position to the docking station, and sensor uncertainties of the AUV. The final output of the algorithm is decided by comparing the success probability to threshold whether to try docking or to correct its route. To verify the validation of the suggested algorithm, the scenario that the AUV approaches to the docking station is implemented through Matlab simulation.

• International Journal of Computer Science & Network Security
• /
• v.22 no.6
• /
• pp.131-138
• /
• 2022

Novel Coronavirus (COVID-19) is viewed as one of the main general wellbeing theaters on the worldwide level all over the planet. Because of the abrupt idea of the flare-up and the irresistible force of the infection, it causes individuals tension, melancholy, and other pressure responses. The avoidance and control of the novel Covid pneumonia have moved into an imperative stage. It is fundamental to early foresee and figure of infection episode during this troublesome opportunity to control of its grimness and mortality. The entire world is investing unimaginable amounts of energy to fight against the spread of this lethal infection. In this paper, we utilized machine learning and deep learning techniques for analyzing what is going on utilizing countries shared information and for detecting the climate factors that effect on spreading Covid-19, such as humidity, sunny hours, temperature and wind speed for understanding its regular dramatic way of behaving alongside the forecast of future reachability of the COVID-2019 around the world. We utilized data collected and produced by Kaggle and the Johns Hopkins Center for Systems Science. The dataset has 25 attributes and 9566 objects. Our Experiment consists of two phases. In phase one, we preprocessed dataset for DL model and features were decreased to four features humidity, sunny hours, temperature and wind speed by utilized the Pearson Correlation Coefficient technique (correlation attributes feature selection). In phase two, we utilized the traditional famous six machine learning techniques for numerical datasets, and Dense Net deep learning model to predict and detect the climatic factor that aide to disease outbreak. We validated the model by using confusion matrix (CM) and measured the performance by four different metrics: accuracy, f-measure, recall, and precision.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.8 no.4
• /
• pp.53-64
• /
• 2009

Inter-vehicular communication that propagates information without infrastructures has drawn a lot of interest. However, it is difficult to apply conventional ad-hoc routing protocols directly in inter-vehicular communication due to frequent changes in the network topology caused by high mobility of the vehicles. MMFP(Multi-hop MAC Forwarding) is a unicast forwarding protocol that transport packets based on the reachability information instead of path selection or position information. However, delivering public safety messages informing road conditions such as collision, obstacles and fog through inter-vehicular communication requires broadcast rather than unicast since these messages contain information valuable to most drivers within a close proximity. Flooding is one of the simplest methods for multi-hop broadcast, but it suffers from reduced packet delivery-ratio and high transmission delay due to an excessive number of duplicated packets. This paper presents two multi-hop broadcast protocols for inter-vehicular communication that extend the MMFP. UMHB(Unreliable Multi-Hop Broadcast) mitigates the duplicated packets of MMFP by limiting the number of nodes to rebroadcast packets. UMHB, however, still suffers from low delivery ratio. RMHB(Reliable Multi-Hop Broadcast) uses acknowledgement and retransmission in order to improve the reliability of UMHB at the cost of increase in transmission delay, which we show through simulation is within an acceptable range for collision avoidance application.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.3B
• /
• pp.360-374
• /
• 2004

The OSPF protocol is the most widely used Interior Gateway Routing Protocol. Therefore, for the reliability of behavior of gigabit swiching routers, it is essential to guarantee the interoperability and the safety of the OSPF protocol. In this paper, we analyze the standard document of the OSPF protocol, so that we provide a formal specification that specifies the protocol behaviors by detailed design level using the algebraic formal method. By referring available source codes of the OSPF protocol, we supplement the formal specification to express more detailed behaviors that is not specified definitely in the standard. We also formally verify the interoperability and the safety of the protocol state machine of the specification. By showing that the formal specification specify all of the states and the transition events that appear in the standard document of the OSPF protocol, we prove that the state machine has the completeness, and prove it has the interoperability. To prove that the specification of the protocol has the safety, we formally verify the reachability, the liveness, the livelock-free property, and the deadlock-free property. As a result, we prove the protocol has the consistency. The specification and the validation are also effective to the OSPF Version 3 that inherit the protocol mechanism of the OSPF Version 2.

• The KIPS Transactions:PartB
• /
• v.18B no.1
• /
• pp.29-38
• /
• 2011

In order to derive domain-independent heuristics from the specification of a planning problem, it is required to relax the given problem and then solve the relaxed one. In this paper, we present a new planning graph, Merged Planning Graph(MPG), and GD heuristics for solving contingent planning problems with both uncertainty about the initial state and non-deterministic action effects. The merged planning graph is an extended one to be applied to the contingent planning problems from the relaxed planning graph, which is a common means to get effective heuristics for solving the classical planning problems. In order to get heuristics for solving the contingent planning problems with sensing actions and non-deterministic actions, the new graph utilizes additionally the effect-merge relaxations of these actions as well as the traditional delete relaxations. Proceeding parallel to the forward expansion of the merged planning graph, the computation of GD heuristic excludes the unnecessary redundant cost from estimating the minimal reachability cost to achieve the overall set of goals by analyzing interdependencies among goals or subgoals. Therefore, GD heuristics have the advantage that they usually require less computation time than the overlap heuristics, but are more informative than the max and the additive heuristics. In this paper, we explain the experimental analysis to show the accuracy and the search efficiency of the GD heuristics.

• The KIPS Transactions:PartC
• /
• v.9C no.1
• /
• pp.97-106
• /
• 2002

In 3GPP2 standard, MIP is used and a PDSN performs the function of FA to support macro mobility. When a MS is roaming from a PDSN area to another, the mobility supported is called macro mobility, while it is called micro mobility when a MS is roaming from a RN area to another in a PDSN area. Since a PDSN performs the function of FA in 3GPP2 standard, it is possible to support mobility but its mechanism is actually for supporting macro mobility, not for micro mobility, thus it is weak in processing fast and seamless handoff to support micro mobility. In this paper, we suggest the seamless handoff algorithm barred on multicast group mechanism to support micro mobility. Depending on the moving direction and velocity of a MS, the suggested algorithm constructs a multicast group of RNs on the forecasted MS's moving path, and maximally delays RNs'joining to a multicast group to increase the network efficiency. Moreover, to resolve the buffer overhead problem of the existent multicast scheme, the algorithm suggests that each RN buffers data only after the forecasted handoff time. To prove deadlock freeness and liveness of the algorithm. we use state transition diagrams, a Petri-net modeling and its reachability tree. Then, we evaluate the performance by simulation.

• Journal of KIISE:Software and Applications
• /
• v.28 no.3
• /
• pp.224-238
• /
• 2001

본 논문은 ATM(Abstract Timed Machine)으로 명세된 실시간 시스템을 검증하기 위한 방법을 기술한다. ATM은 임무 위급 시스템인 실시간 시스템을 명세, 분석, 검증하기 위한 정형기법이다. ATM은 모드와 전이, 포트로 구성되어 있으며 모드는 머신의 압축된 상태를 표현한다. 전이는 하나의 모드에서 다른 모드로의 전환을 나타내며 조건과 이벤트로 구성되어 있다. 포트는 ATM간의 상호작용을 위한 진입을 표현한다. 다른 정형기법과 비교하여 ATM은 소프트웨어의 순환공학 과정에서 사용하기 위해 설계되었다. 역공학 측면에서 볼 때 ATM은 계산 논리뿐만 아니라 실시간 시스템의 실제 소스코드에 있는 설계나 환경정보를 표현할 수 있다. 이러한 목적을 위해 ATM의 모드는 계산모드, 추상화 모드, 주제모드로 구분된다. 계산 모드는 코드 상에서의 논리와 계산을 나타내며 추상화 모드는 모드와 전이의 블록을 하나의 ATM으로써 표현한다. 대개의 경우, 이것은 코드 상에서의 블록을 ATM내 하나의 모드로 나타낼 때 사용한다. 주제 모드는 예외나 주기적 동작 등과 같은 다수의 ATM의 주제를 표현한다. 실시간 시스템을 검증하기 위해 시스템의 소스 코드는 역명세 과정을 통하여 ATM으로 표현된다. 검증은 ATM에 대한 도달성 그래프를 생성하는 것에 의해 수행된다. 도달성 그래프는 상태와 시간을 추상화되고 압축된 형태로 표현할 수 있으며 그 결과 시간 속성을 지닌 상태 공간을 감소시킬 수 있다. 또한 시스템의 교착상태를 쉽게 발견할 수 있다. 본 논문은 ATM과 실행 모델, 도달성 그래프, 검증을 위한 속성 등을 기술하며 이들을 다른 정형 방법들과 예제를 통하여 비교한다.수 있다. 모피우스는 헤더나 광고와 같은 불필요한 정보들을 제거하는 별도의 단계를 거치지 않으므로 wrapper를 빠르게 생성한다. 궁극적으로 모피우스는 새로운 웹 상점을 사용자가 자유롭게 추가, 삭제할 수 있는 환경을 제공한다.X>와 반응시킬 경우에는 반응식 c에 의거 진행됨을 예측할 수 있었다.의거 진행됨을 예측할 수 있었다.이 거의 산화되지 않았고, $700^{\circ}C$에서도 ZnS와 ZnO 상이 공존한 것으로 보아 SnO$_2$코팅이 ZnS의 산화를 억제하는 것으로 나타났다.pplied not only to the strike system in the RSC circle, but also to the logistics system in the SLC circle. Thus, the RSLC model can maximize combat synergy effects by integrating the RSC and the SLC. With a similar logic, this paper develops "A Revised System of Systems with Logistics (RSSL)" which combines "A New system of Systems" and logistics. These tow models proposed here help explain several issues such as logistics environment in future warfare, MOE(Measure of Effectiveness( on logistics performance, and COA(Course of Actions)