• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.3 no.2
• /
• pp.121-135
• /
• 1999

This paper studies the problem of inverting minimal path sets to obtain minimal cut sets for complex system. We describe efficiency of inversion algorithm by the use of boolean algebra and we develop inclusion-exclusion algorithm and pivotal decomposition algorithm for reliability calculation of complex system. Several examples are illustrated and the computation speeds between the two algorithms are undertaken.

• Proceedings of the Safety Management and Science Conference
• /
• 2001.05a
• /
• pp.173-178
• /
• 2001

This paper studies the structure and reliability of homogeneous s-coherent multistate system. We describe efficiency of inclusion-exclusion algorithm and pivotal decomposition algorithm for reliability calculation of 2-states system which developed in (Lee 1999) ［10］. We extend our method, applied in ［10］, to the case when components of the system are given multi-states. As an application, the high pressure injection system of a pressurized water reactor is modeled as a multistate system composed of homogeneous s-coherent multistate subsystems. And Several examples are illustrated.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.23 no.4
• /
• pp.165-170
• /
• 2023

This paper proposes an algorithm that can obtain a solution with linear time for a set cover problem(SCP) in which there is no polynomial time algorithm as an NP-complete problem so far. Until now, only heuristic greed algorithms are known to select sets that can be covered to the maximum. On the other hand, the proposed algorithm is a competitive algorithm that applies an inclusion-exclusion principle rule to N nodes up to 2nd or 3rd in the maximum number of elements to obtain a set covering all k nodes, and selects the minimum cover set among them. The proposed algorithm compensated for the disadvantage that the greedy algorithm does not obtain the optimal solution. As a result of applying the proposed algorithm to various application cases, an optimal solution was obtained with a polynomial time of O(kn²).

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.3
• /
• pp.93-101
• /
• 2013

This paper suggests optimal location algorithm of new firm $A(F_A)^{\prime}s$ p(p$B(F_B)$ already operating q outlets of sports in the market. This algorithm selects top q nodes among $V=V{\backslash}F_B$ nodes that covers maximum nodes based on the shortest distance. Then, q nodes choose next node that has a maximum cover with inclusion-exclusion principle. At the time of same number of cardinality in q sets to pre-defined q, we select the maximum cover node set. This algorithm called by competitive algorithm. The competitive algorithm simply decides the optimal location of the outlets p=1,2,3,4 for q=5. Also, we show that the market share of competitive algorithm can be maximize.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.5
• /
• pp.2338-2356
• /
• 2019

Vehicular ad-hoc network (VANET) is the name of technology, which uses 'mobile internet' to facilitate communication between vehicles. The aim is to ensure road safety and achieve secure communication. Therefore, the reliability of this type of networks is a serious concern. The reliability of VANET is dependent upon proper communication between vehicles within a given amount of time. Therefore a new formula is introduced, the terms of the new formula correspond 1 by 1 to a class special ST route (SRORT). The new formula terms are much lesser than the Inclusion-Exclusion principle. An algorithm for the Source-to-Terminal reliability was presented, the algorithm produced Source-to-Terminal reliability or computed a Source-to-Terminal reliability expression by calculating a class of special networks of the given network. Since the architecture of this class of networks which need to be computed was comparatively trivial, the performance of the new algorithm was superior to the Inclusion-Exclusion principle. Also, we introduce a mobility metric called universal speed factor (USF) which is the extension of the existing speed factor, that suppose same speed of all vehicles at every time. The USF describes an exact relation between the relative speed of consecutive vehicles and the headway distance. The connectivity of vehicles in different mobile situations is analyzed using USF i.e., slow mobility connectivity, static connectivity, and high mobility connectivity. It is observed that $p_c$ probability of connectivity is directly proportional to the mean speed ${\mu}_{\nu}$ till specified threshold ${\mu}_{\tau}$, and decreases after ${\mu}_{\tau}$. Finally, the congested network is connected strongly as compared to the sparse network as shown in the simulation results.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.10
• /
• pp.141-148
• /
• 2013

This paper proposes an EMS algorithm designed to determine the optimal locations for Emergency Medical Service centers that both satisfy the maximum ambulance response time T in case of emergency and cover the largest possible number of residents given a limited number of emergency medical services p in a city divided into different zones. This methodology generally applies integer programming whereby cases are categorized into 1 if the distance between two zones is within the response time and 0 if not and subsequently employs linear programming to obtain the optimal solution. In this paper, where p=1, the algorithm determines a node with maximum coverage. In cases where $p{\geq}2$, the algorithm selects top 5 nodes with maximum coverage. Based on inclusion-exclusion method, this selection entails repeatedly selecting a node with the maximum coverage when nodes with lower numbers are deleted. Among these 5 selected nodes, the algorithm selects a single node set with the greatest coverage and thereby as the optimal EMS location. The proposed algorithm has proven to accurately and expeditiously obtain the optimal solutions for 12-node network, 21-node network, and Swain's 55-node network.

• Communications for Statistical Applications and Methods
• /
• v.28 no.3
• /
• pp.251-265
• /
• 2021

This paper discusses the pricing of autocallable structured product with knock-in (KI) feature using the exit probability with the Brownian Bridge technique. The explicit pricing formula of autocallable ELS derived in the existing paper handles the part including the minimum of the Brownian motion using the inclusion-exclusion principle. This has the disadvantage that the pricing formula is complicate because of the probability with minimum value and the computational volume increases dramatically as the number of autocall chances increases. To solve this problem, we applied an efficient and robust simulation method called the Brownian Bridge technique, which provides the probability of touching the predetermined barrier when the initial and terminal values of the process following the Brownian motion in a certain interval are specified. We rewrite the existing pricing formula and provide a brief theoretical background and computational algorithm for the technique. We also provide several numerical examples computed in three different ways: explicit pricing formula, the Crude Monte Carlo simulation method and the Brownian Bridge technique.

• The Journal of Korea Robotics Society
• /
• v.19 no.2
• /
• pp.213-220
• /
• 2024

Fall detection and prevention technologies play a pivotal role in ensuring the well-being of individuals, particularly those living independently, where falls can result in severe consequences. This paper addresses the challenge of accurate and quick fall detection by proposing a Bayesian probability-based measure applied to surface electromyography (sEMG) signals. The proposed algorithm based on a Bayesian filter that divides the sEMG signal into transient and steady states. The ratio of posterior probabilities, considering the inclusion or exclusion of the transient state, serves as a scale to gauge the dominance of the transient state in the current signal. Experimental results demonstrate that this approach enhances the accuracy and expedites the detection time compared to existing methods. The study suggests broader applications beyond fall detection, anticipating future research in diverse human-robot interface benefiting from the proposed methodology.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.2
• /
• pp.203-209
• /
• 2019

We will be establish the new $q(1{\leq}q{\leq}p-1)$ stores of firm $F_B$ to gain pop/(p+q) over rival firm $F_A$ that has already operate with p stores in a city of population pop. Han proposes inclusion-exclusion algorithm(IEA) that searches maximal pop top 5 location and select the maximum location take account of locate variation with increasing of $q=1,2,{\cdots},p-1$. This paper reduced the orignal graph into partial graph initially and search only q=1 node continually reduced in accordance with increasing $q=1,2,{\cdots},p-1$. If the final result is shown in the case of steel customer between q, the q locations farther separate in order to improve of solution. For the eleven experimental data, this algorithm is a relative simplicity and more optimal solution than Han's IEA.

• Archives of Plastic Surgery
• /
• v.48 no.4
• /
• pp.404-409
• /
• 2021

Background To date, there are no consensus guidelines for management of lymphatic leak in groin vascular reconstruction patients. The goal of this study is to review the relevant literature to determine alternatives for treatment and to design an evidence-based algorithm to minimize cost and morbidity and maximize efficacy. Methods A systematic review of the literature was conducted per Preferred Reporting Items for Systematic Reviews and Meta-Analyses (PRISMA) protocol. Two independent reviewers applied agreed-upon inclusion and exclusion criteria to eligible records. Studies that included patients who underwent groin dissection for oncologic diagnoses and level 5 data were excluded. Interventions were then categorized by efficacy using predetermined criteria. Results Our search yielded 333 records, of which eight studies were included. In four studies, the success of lymphatic ligation ranged from 75% to 100%, with average days to resolution ranging from 0 to 9. Conservative management in the form of elevation, compression, and bedrest may prolong time to resolution of lymphatic leak (14-24 days) and therefore cost. Conclusions The majority of patients should be offered early operative intervention in the form of lymphatic ligation with or without a primary muscle flap. If the patient is not an operative candidate, a trial of conservative management should be attempted before other nonsurgical interventions.