• Journal of the Korean Mathematical Society
• /
• v.38 no.2
• /
• pp.349-363
• /
• 2001

The analytic in mass operator-valued Feynman integral is related to integration with respect to unbounded set functions formed from the semigroup obtained by analytic continuation of the heat semigroup and the spectral measure of multiplication by characteristics functions.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.4
• /
• pp.1033-1043
• /
• 1998

In this paper, we present an improved multicasting path assignment algorithm based on the minimum cost spanning tree. In the method presented in this paper, a multicasting path is assigned preferentially when a node to be received is found among the next degree nodes of the searching node in the multicasting path assignment of the constrained steiner tree (CST). If nodes of the legacy group exist between nodes of the new group, a new path among the nodes of new group is assigned as long as the nodes may be excluded from the new multicasting path assignment taking into consideration characteristics of nodes in the legacy group. In assigning the multicasting path additionally, where the source and destination nodes which can be set for the new multicasting path exist in the domain of identical network (local area network) and conditions for degree constraint are satisfied, a method of producing and assigning a new multicasting path is used. The results of comparison of CST with MCSTOP, MCSTOp algorithm enhanced performance capabilities about the communication cost, the propagation delay, and the computation time for the multicasting assignment paths more than CST algorithm. Further to this, research activities need study for the application of the international standard protocol(multicasting path assignment technology in the multipoint communication service (MCS) of the ITU-T T.120).

• Journal of KIISE:Databases
• /
• v.32 no.4
• /
• pp.452-472
• /
• 2005

We propose XIR-Branching, a novel method for processing partial match queries on heterogeneous XML documents using information retrieval(IR) techniques and novel instance join techniques. A partial match query is defined as the one having the descendent-or-self axis '//' in its path expression. In its general form, a partial match query has branch predicates forming branching paths. The objective of XIR-Branching is to efficiently support this type of queries for large-scale documents of heterogeneous schemas. XIR-Branching has its basis on the conventional schema-level methods using relational tables(e.g., XRel, XParent, XIR-Linear[21]) and significantly improves their efficiency and scalability using two techniques: an inverted index technique and a novel prefix match join. The former supports linear path expressions as the method used in XIR-Linear[21]. The latter supports branching path expressions, and allows for finding the result nodes more efficiently than containment joins used in the conventional methods. XIR-Linear shows the efficiency for linear path expressions, but does not handle branching path expressions. However, we have to handle branching path expressions for querying more in detail and general. The paper presents a novel method for handling branching path expressions. XIR-Branching reduces a candidate set for a query as a schema-level method and then, efficiently finds a final result set by using a novel prefix match join as an instance-level method. We compare the efficiency and scalability of XIR-Branching with those of XRel and XParent using XML documents crawled from the Internet. The results show that XIR-Branching is more efficient than both XRel and XParent by several orders of magnitude for linear path expressions, and by several factors for branching path expressions.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1993.10a
• /
• pp.12-19
• /
• 1993

In general, the line balancing problem is defined as of finding an assignment of the given jobs to the workstations under the precedence constraints given to the set of jobs. Usually, the objective is either minimizing the cycle time under the given number of workstations or minimizing the number of workstations under the given cycle time. In this paper, we present a new type of an assembly line balancing problem which occurs in an electronics company manufacturing home appliances. The main difference of the problem compared to the general line balancing problem lies in the structure of the precedence given to the set of jobs. In the problem, the set of jobs is partitioned into two disjoint subjects. One is called the set of fixed jobs and the other, the set of floating jobs. The fixed jobs should be processed in the linear order and some pair of the jobs should not be assigned to the same workstations. Whereas, to each floating job, a set of ranges is given. The range is given in terms of two fixed jobs and it means that the floating job can be processed after the first job is processed and before the second job is processed. There can be more than one range associated to a floating job. We present a procedure to find an approximate solution to the problem. The procedure consists of two major parts. One is to find the assignment of the floating jobs under the given (feasible) assignment of the fixed jobs. The problem can be viewed as a constrained bin packing problem. The other is to find the assignment of the whole jobs under the given linear precedence on the set of the floating jobs. First problem is NP-hard and we devise a heuristic procedure to the problem based on the transportation problem and matching problem. The second problem can be solved in polynomial time by the shortest path method. The algorithm works in iterative manner. One step is composed of two phases. In the first phase, we solve the constrained bin packing problem. In the second phase, the shortest path problem is solved using the phase 1 result. The result of the phase 2 is used as an input to the phase 1 problem at the next step. We test the proposed algorithm on the set of real data found in the washing machine assembly line.

• Journal of Communications and Networks
• /
• v.7 no.4
• /
• pp.509-524
• /
• 2005

Due to the strict requirements of emerging applications, per-flow admission control is gaining increasing importance. One way to implement per-flow admission control is using an on­path resource reservation protocol, where the admission decision is made hop-by-hop after a new flow request arrives at the network boundary. The next-steps in signaling (NSIS) working group of the Internet engineering task force (IETF) is standardising such an on-path signaling protocol. One of the reservation methods considered by NSIS is reduced-state mode, which, suiting the differentiated service (DiffServ) concept, only allows per-class states in interior nodes of a domain. Although there are clear benefits of not dealing with per-flow states in interior nodes-like scalability and low complexity-, without per-flow states the handling of re-routed flows, e.g., after a failure, is a demanding and highly non-trivial task. To be applied in carrier-grade networks, the protocol needs to be resilient in this situation. In this article, we will explain the consequences of a route failover to resource reservation protocols: Severe congestion and incorrect admission decisions due to outdated reservation states. We will set requirements that handling solutions need to fulfill, and we propose extensions to reduced-state protocols accordingly. We show with a set of simulated scenarios that with the given solutions reduced-state protocols can handle re-routed flows practically as fast and robust as stateful protocols.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.10
• /
• pp.130-137
• /
• 1990

The multipath multistage interconnection network is proposed which has the capability of dynamic rerouting. Construction of the network gets simpler, and the number of stages is reduced to $LOG_{2}$(N), so hardware complexity is reduced. This proposed algorithm makes it possible that destination adresses are used as routing tags, and it is easy to set up the path. Because this proposed network has a dynamic rerouting, backtracking is not necessary to set up another path when conflicts of switch faults are occurred. To estimate a performance, analytic methods are used and it is proved that probability of acceptance is improved in this Multipath MIN.

• Korean Journal of Fisheries and Aquatic Sciences
• /
• v.49 no.3
• /
• pp.376-384
• /
• 2016

Seasonal catch distributions of large purse seines and daily landings of coastal set nets were analyzed to understand the migration path of the Spanish mackerel Scomberomorus niphonius around Korean waters. The Spanish mackerel start to move toward the coastal region in the South and West Sea in May for spawning and stay until July, when spawning finishes. Afterwards, they start to migrate to the East China Sea and the southern East Sea and are found irrespective of the onshore and offshore regions. Therefore, they disappear from the offshore region during the spawning season in June and July, and a new recruitment population of age 0 begins to inflow into the coastal fishing grounds in the South Sea and West Sea in August, one month earlier than in the Japanese coastal region of the East Sea.

• The Korean Journal of Community Living Science
• /
• v.25 no.1
• /
• pp.51-64
• /
• 2014

With a shift in the rural development process toward a bottom-up approach, the need to enhance the endogenous capacity of communities has become the core of rural development. In this regard, scholars have paid close attention to social capital to identify ways to facilitate endogenous rural development but focused mainly on relationships between social capital and local environment. That is, few studies have investigated the relationships between social capital and its various dimensions in the context of rural development initiatives. This study examines the effects of social capital on the problem-solving ability of community residents'rural development initiatives and assesses the types of social capital associated with such initiatives to propose optimal path for improving this ability. To distinguish between major dimensions of social capital, a questionnaire was developed by considering various stages of the rural development process. The survey considered a sample of 59 employees from public rural development institutions. According to the results, four paths were significant at the 5% level. Among these four paths, three set common goals. The effective channel was the path [common goals${\Rightarrow}$network${\Rightarrow}$cooperation${\Rightarrow}$problem-solving ability]. The key factor in improving problem-solving skills, the endogenous ability of community residents to facilitate rural development initiatives. The results suggest that governments should strengthen education and training programs to help residents set their common goals.

• Journal of the Korea Safety Management & Science
• /
• v.13 no.3
• /
• pp.45-53
• /
• 2011

The research proposes seven elimination rules of redundant gates and blocks in Fault Tree Analysis (FTA) and Reliability Block Diagram (RBD). The computational complexity of cut sets and path sets is NP-hard. In order to reduce the complexity of Minimal Cut Set (MCS) and Minimal Path Set (MPS), the paper classifies generation algorithms. Moreover, the study develops six implementation steps which reflect structural importance (SI) and reliability importance (RI) from Reliability Centered Maintenance (RCM) that a priority of using the functional logic among components is to reduce (improve) the system unavailability (or availability). The proposed steps include efficient generation of state structure function by Rare Event Enumeration (REA). Effective use of importance measures, such as SI and ill measures, is presented based on the number and the size of MCS and MPS which is generated from the reference[5] of this paper. In addition, numerical examples are presented for practitioners to obtain the comprehensive understanding of six steps that is proposed in this research.

• Journal of the Korea Safety Management & Science
• /
• v.14 no.1
• /
• pp.225-233
• /
• 2012

The research discusses interrelationship of structural and reliability importance measures which used in the probabilistic safety assessment. The most frequently used component importance measures, such as Birnbaum's Importance (BI), Risk Reduction (RR), Risk Reduction Worth (RRW), RA (Risk Achievement), Risk Achievement Worth (RAW), Fussel Vesely (FV) and Critically Importance (CI) can be derived from two structure importance measures that are developed based on the size and the number of Minimal Path Set (MPS) and Minimal Cut Set (MCS). In order to show an effectiveness of importance measures which is developed in this paper, the three representative functional structures, such as series-parallel, k out of n and bridge are used to compare with Birnbaum's Importance measure. In addition, the study presents the implementation examples of Total Productive Maintenance (TPM) metrics and alternating renewal process models with exponential distribution to calculate the availability and unavailability of component facility for improving system performances. System state structure functions in terms of component states can be converted into the system availability (unavailability) functions by substituting the component reliabilities (unavailabilities) for the component states. The applicable examples are presented in order to help the understanding of practitioners.