• Journal of Korean Society of Transportation
• /
• v.22 no.7 s.78
• /
• pp.91-98
• /
• 2004

This study focuses on the development of dynamic assignment for evaluation and application for dynamic route guidance strategy. Travelers are classified according to information contents which they received pre/on trip. The first group have no traffic information, so they travel with fixed route. The second group have real-time shortest path and travel according to it. The last group have car navigation system or individual method(cellular phone, PDA-two way communication available) for traffic information on trip. And then they are assigned in accordance with the proposed multiclass dynamic assignment model. At this time the last group is gotten under control with DFS(decentralized feedback strategy). In use of this Process we expect that various traffic information strategy can be tested and also be the key factor for success of ITS, location of VMS(variable message sign), cycle of information, area of traffic information, etc).

• THE INTERNATIONAL COMMERCE & LAW REVIEW
• /
• v.73
• /
• pp.21-42
• /
• 2017

A BPO is an irrevocable undertaking given by an Obligor Bank acting on behalf of the buyer to a Recipient Bank acting on behalf of the seller to pay on satisfaction of certain specified conditions. There have been a Trade Service Utility(TSU), a Transaction Matching Application(TMA) and ISO 20022 TSMT messages that core electronic technical systems linked to the BPO. As a key usefulness of the BPO, it brings to market an alternative means of satisfying the risk mitigation, financing and information management needs of banks and businesses engaged in trade. That is, corporates can spread the risk among multiple Obligor Banks by requesting multiple BPOs for the same trade transaction not to exceed the value of the initial transaction. Since the BPO replaces the manual document checking process with the electronic matching of data, buyers and sellers will benefit from significantly increased accuracy and objectivity. By using BPO, buyers and sellers can become trusted counterparties by demonstrating reliability and giving sellers the assurance of being paid on time as per the payment terms and conditions agreed. When compared to L/C, the BPO requires submission of data only. This requires a change of practice of those accustomed to dealing with physical documentation. The beneficiary of a BPO is the Recipient Bank which is always the Seller's Bank. In the meantime, banks will need to agree between themselves that the URBPO 750 will be applied, modified or excluded. However, customers of banks will face low transactional costs due to a fully automated process and standardized data formats used in international trade documentation. There is no amendment and cancellation rules in the URBPO 750s, but only have Assignment of Proceeds rules. As a result, the BPO is likely to enable new business opportunities, lower costs, fast transaction process and strengthen key customer relationships.

• Journal of Veterinary Science
• /
• v.22 no.3
• /
• pp.37.1-37.14
• /
• 2021

Background: Ticks are one of the most common external parasites in dogs, and are associated with the transmission of a number of major zoonoses, which result in serious harm to human health and even death. Also, the increasing number of pet dogs and pet owners in China has caused concern regarding human tick-borne illnesses. Accordingly, studies are needed to gain a complete understanding of the bacterial composition and diversity of the ticks that parasitize dogs. Objectives: To date, there have been relatively few reports on the analysis of the bacterial community structure and diversity in ticks that parasitize dogs. The objective of this study was to investigate the microbial composition and diversity of parasitic ticks of dogs, and assessed the effect of tick sex and geographical region on the bacterial composition in two tick genera collected from dogs in China. Methods: A total of 178 whole ticks were subjected to a 16S ribosomal RNA (rRNA) next generation sequencing analysis. The Illumina MiSeq platform targeting the V3-V4 region of the 16S rRNA gene was used to characterize the bacterial communities of the collected ticks. Sequence analysis and taxonomic assignment were performed using QIIME 2 and the GreenGene database, respectively. After clustering the sequences into taxonomic units, the sequences were quality-filtered and rarefied. Results: After pooling 24 tick samples, we identified a total of 2,081 operational taxonomic units, which were assigned to 23 phyla and 328 genera, revealing a diverse bacterial community profile. The high, moderate and low prevalent taxa include 46, 101, and 182 genera, respectively. Among them, dominant taxa include environmental bacterial genera, such as Psychrobacter and Burkholderia. Additionally, some known tick-associated endosymbionts were also detected, including Coxiella, Rickettsia, and Ricketssiella. Also, the potentially pathogenic genera Staphylococcus and Pseudomonas were detected in the tick pools. Moreover, our preliminary study found that the differences in microbial communities are more dependent on the sampling location than tick sex in the tick specimens collected from dogs. Conclusions: The findings of this study support the need for future research on the microbial population present in ticks collected from dogs in China.

• International Journal of Internet, Broadcasting and Communication
• /
• v.12 no.4
• /
• pp.102-108
• /
• 2020

One of the key features of a mobile crowd-sensing (MCS) system is task allocation, which aims to recruit workers efficiently to carry out the tasks. Due to various constraints of the tasks (such as specific sensor requirement and a probabilistic guarantee of task completion) and workers heterogeneity, the task allocation become challenging. This assignment problem becomes more intractable because of the deadline of the tasks and a lot of possible task completion order or moving path of workers since a worker may perform multiple tasks and need to physically visit the tasks venues to complete the tasks. Therefore, in this paper, a hybrid search algorithm for task allocation called HST is proposed to address the problem, which employ a traveling salesman problem heuristic to find the task completion order. HST is developed based on the tabu search algorithm and exploits the premature convergence avoiding concepts from the genetic algorithm and simulated annealing. The experimental results verify that our proposed scheme outperforms the existing methods while satisfying given constraints.

• Journal of the Korean housing association
• /
• v.21 no.6
• /
• pp.91-98
• /
• 2010

The purpose of this study is to develop the feasibility of movable partition wall components that are able to correspond changes of structure system and spatial configuration by the needs of residents for the activation of long-life housing. The key element of various movable partition wall components, a movable partition wall, was analyzed for problems through both as-is analysis and field installation in Korea and Japan, and then its feasibility was verified. The movable partition wall can break the uniformity of a fixed one, can integrate and separate limited space by changes in the demands of residents, can be easy to separate, and can be independent. The development of the movable partition wall is important for the realization of diverse residential space, ease of remodeling, environment adaptation, promotion of modularization, etc. It is comprised of surfacing materials, core materials, structural materials, and movable parts. The domestic movable partition wall was verified regarding the feasibility of an apartment house through on-site inspections and sound insulation tests by KOHP21, KICT. In conclusion, the construction of long-life housing that has sustainable values in the use of housing is nationally an important assignment, so as to secure good housing stock.

• Journal of Korean Institute of Industrial Engineers
• /
• v.37 no.1
• /
• pp.19-29
• /
• 2011

Cellular network is comprised of several base stations which serve cellular shaped service area and each base station (BS) is connected to the mobile switching center (MSC). In this paper, the configuration modeling and algorithm of a cellular mobile network with the aim of minimizing the overall cost of operation (handover) and network installation cost (cabling cost and installing cost of mobile switching center) are considered. Handover and cabling cost is one of the key considerations in designing cellular telecommunication networks. For real-world applications, this configuration study covers in an integrated framework for two major decisions: locating MSC and assigning BS to MSC. The problem is expressed in an integer programming model and a heuristic algorithm based on Lagrangian relaxation is proposed to resolve the problem. Searching for the optimum solution through exact algorithm to this problem appears to be unrealistic considering the large scale nature and NP-Completeness of the problem. The suggested algorithm computes both the bound for the objective value of the problem and the feasible solution for the problem. A Lagrangian heuristics is developed to find the feasible solution. Numerical tests are performed for the effectiveness and efficiency of the proposed heuristic algorithm. Computational experiments show that the performance of the proposed heuristics is satisfactory in the quality of the generated solution.

• Knowledge Management Research
• /
• v.11 no.1
• /
• pp.129-146
• /
• 2010

As knowledge has become the most important means of production for a company to survive in a "knowledge-based society", knowledge management has become the key issue in the corporate sector. Despite its growing significance, there are limited numbers of research that describe how companies actually develop, share and practice their knowledge. From this perspective, this study used a qualitative approach to explore on the actual process of knowledge management implementation. In-depth interviews with eleven senior managers, who were working at S global corporation, were conducted. The results show that there are differences between how the participants perceive and how they actually perform in managing knowledge. While the participants tend to conceptualize knowledge management as building a technical system, their performance has shown that knowledge has been developed and shared through active interaction among the members in the company. The factors that impede knowledge management were caused by the individualized job assignment and inapplicable exercises that result in obscuring information flow and utilizing inadequate and low quality of knowledge. The findings of this study imply that knowledge management is not a matter of formality but a paradigm that assures for the flow and share of knowledge.

• Communications for Statistical Applications and Methods
• /
• v.23 no.1
• /
• pp.1-20
• /
• 2016

Causal inference methodologies have been developed for the past decade to estimate the unconfounded effect of an exposure under several key assumptions. These assumptions include, but are not limited to, the stable unit treatment value assumption, the strong ignorability of treatment assignment assumption, and the assumption that propensity scores be bounded away from zero and one (the positivity assumption). Of these assumptions, the first two have received much attention in the literature. Yet the positivity assumption has been recently discussed in only a few papers. Propensity scores of zero or one are indicative of deterministic exposure so that causal effects cannot be defined for these subjects. Therefore, these subjects need to be removed because no comparable comparison groups can be found for such subjects. In this paper, using currently available causal inference methods, we evaluate the effect of arbitrary cutoffs in the distribution of propensity scores and the impact of those decisions on bias and efficiency. We propose a tree-based method that performs well in terms of bias reduction when the definition of positivity is based on a single confounder. This tree-based method can be easily implemented using the statistical software program, R. R code for the studies is available online.

• Journal of Korea Multimedia Society
• /
• v.9 no.1
• /
• pp.119-126
• /
• 2006

The task scheduling in multiprocessor system is one of the key elements in the effective utilization of multiprocessor systems. The optimal assignment of tasks to multiprocessor is, in almost practical cases, an NP-hard problem. Consequently algorithms based on various modern heuristics have been proposed for practical reason. This paper proposes a new task scheduling algorithm using Genetic Algorithm which combines simulated annealing (GA+SA) in multiprocessor environment. In solution algorithms, the Genetic Algorithm (GA) and the simulated annealing (SA) are cooperatively used. In this method, the convergence of GA is improved by introducing the probability of SA as the criterion for acceptance of new trial solution. The objective of proposed scheduling algorithm is to minimize makespan. The effectiveness of the proposed algorithm is shown through simulation studies. In simulation studies, the result of proposed algorithm is better than that of any other algorithms.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.23 no.3
• /
• pp.135-151
• /
• 1998

The demand of large capacity in coming cellular systems makes inevitable the deployment of small cells, rendering more frequent handoff occurrences of calls than in the conventional system. The key issue is then how effectively to reduce the chance of unsuccessful handoffs, since the handoff failure is less desirable than that of a new call attempt. In this study, we consider the control policies which give priority to handoff calls by limiting channel assignment for the originating new calls, and allow queueing the new calls which are rejected at their first attempts. On this system. we propose the problem of finding an optimal call control strategy which optimizes the objective function value, while satisfying the requirements on the handoff/new call blocking probabilities and the new call delay. The objective function takes the most general form to include such well-known performance measures as the weighted average carried traffic and the handoff call blocking probability. The problem is formulated into two different linear programming (LP) models. One is based on the direct employment of steady state equations, and the other uses the theory of semi-Markov decision process. Two LP formulations are competitive each other, having its own strength in the numbers of variables and constraints. Extensive experiments are also conducted to show which call control strategy is optimal under various system environments having different objective functions and traffic patterns.