• The Transactions of the Korea Information Processing Society
• /
• v.5 no.5
• /
• pp.1151-1161
• /
• 1998

In this paper, we are considering a heterogeneous processor system in which each processor may have different performance and reliability characteristics. In other to fully utilize this diversity of processing power it is advantageous to assign the program modules of a distributed program to the processors in such a way that the execution time of the entire program is minimized. This assignment of tasks to processors to maximize performance is commonly called load balancing, since the overloaded processors can perform their own processing with the performance degradation. For the task assignment problem, we propose a new objective function which formulates this imbalancing cost. Thus the task assignment problem is to be carried out so that each module is assigned to a processor whose capabilities are most appropriate for the module, and the total cost is minimized that sum of inter-processor communication cost and execution cost and imbalance cost of the assignment. To find optimal assignment is known to be NP-hard, and thus we proposed an efficient heuristic algorithm with time complexity $O(n^2m)$ in case of m task modules and n processors.

• Journal of Korean Society of Transportation
• /
• v.24 no.2 s.88
• /
• pp.169-178
• /
• 2006

Traffic assignment has been used both for predicting travel demands and for evaluating the tools for alleviating congestion on road network in advance. Some assignment models have been proposed such as equivalent mathematical minimization method, variational inequality problem, nonlinear complementary problem and fixed point method, in following the principle of Wardrop (1952) that no driver can not Improve his travel cost by unilaterally changing his route. Recently Jin(2005a) presented a traffic assignment model based on dynamic process. This paper proposes a solution algorithm for the model of Jin and assesses the performances. Compared to the Frank-Wolfe method, which has been wildly used for solving the existing assignment models, the proposed algorithm is expected to be more efficient because it does not need to evaluate the objective function. Two numerical examples are used for assessing the algorithm, and they show that the algorithm converges to user equilibrium of Wardrop.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.12
• /
• pp.5633-5638
• /
• 2011

Kim(2011) showed that the team-based teaching method which is focusing on the individual job assignment solves the backlash effects of peer-evaluation method and suggested that it should be studied if the job assignment teaching method does not worsen the learning outcomes[1]. To analyse the learning outcomes of the job assignment teaching method is the purpose of this paper. This paper evaluates the improvement of the learning outcomes which are resulted from a variance of education style that each member of project team was given his specific task. Firstly, all the students evaluate a learning satisfaction and quality of outcomes by themselves. Secondly, an instructor and some professionals evaluate all the outputs. The results showed that the learning outcomes evaluated by students and instructors are improved significantly. The suggested method in this paper, which focuses on the job assignment of team project, could improve the learning outcomes of team project in engineering education.

• Journal of the Korean Society for Railway
• /
• v.11 no.6
• /
• pp.550-561
• /
• 2008

The purpose of this paper is to propose a new transit assignment model for intercity rail networks. The characteristics of intercity rail are different from that of public transit in urban area. Line selection probability on route section is introduced to include the characteristics of intercity rail into transit assignment model. Network expansion is more simplified by a assumption line selection probability is externally given. The generalized cost is used to decide the volume of each transit line in most of existing transit assignment models. But, many variables have influence on the volume of each line such as time schedule of transit lines, inter-station distance, passengers' income, seasonal variation of demand and regional characteristics. The influence of these variables can be considered to decide the volume of each line by introducing line selection probability on route section. The tests on a small scale network show that the model proposed in this paper is superior to existing models for predicting intercity rail demand. Proposed model is suitable to consider the complicated fare structure of intercity rail and to draw inter-station demand directly as a result of assignment procedure.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.44 no.4
• /
• pp.43-52
• /
• 2021

In weapon assignment studies to defend against threats such as ballistic missiles and long range artillery, threat assessment was partially lacking in analysis of various threat attributes, and considering the threat characteristics of warheads, which are difficult to judge in the early flight stages, it is very important to apply more reliable optimal solutions than approximate solution using LP model, Meta heuristics Genetic Algorithm, Tabu search and Particle swarm optimization etc. Our studies suggest Generic Rule based threat evaluation and weapon assignment algorithm in the basis of various attributes of threats. First job of studies analyzes information on Various attributes such as the type of target, Flight trajectory and flight time, range and intercept altitude of the intercept system, etc. Second job of studies propose Rule based threat evaluation and weapon assignment algorithm were applied to obtain a more reliable solution by reflection the importance of the interception system. It analyzes ballistic missiles and long-range artillery was assigned to multiple intercept system by real time threat assessment reflecting various threat information. The results of this study are provided reliable solution for Weapon Assignment problem as well as considered to be applicable to establishing a missile and long range artillery defense system.

• Asian-Australasian Journal of Animal Sciences
• /
• v.27 no.5
• /
• pp.616-627
• /
• 2014

The Lanyu is a miniature pig breed indigenous to Lanyu Island, Taiwan. It is distantly related to Asian and European pig breeds. It has been inbred to generate two breeds and crossed with Landrace and Duroc to produce two hybrids for laboratory use. Selecting sets of informative genetic markers to track the genetic qualities of laboratory animals and stud stock is an important function of genetic databases. For more than two decades, Lanyu derived breeds of common ancestry and crossbreeds have been used to examine the effectiveness of genetic marker selection and optimal approaches for individual assignment. In this paper, these pigs and the following breeds: Berkshire, Duroc, Landrace and Yorkshire, Meishan and Taoyuan, TLRI Black Pig No. 1, and Kaohsiung Animal Propagation Station Black pig are studied to build a genetic reference database. Nineteen microsatellite markers (loci) provide information on genetic variation and differentiation among studied breeds. High differentiation index ($F_{ST}$) and Cavalli-Sforza chord distances give genetic differentiation among breeds, including Lanyu's inbred populations. Inbreeding values ($F_{IS}$) show that Lanyu and its derived inbred breeds have significant loss of heterozygosity. Individual assignment testing of 352 animals was done with different numbers of microsatellite markers in this study. The testing assigned 99% of the animals successfully into their correct reference populations based on 9 to 14 markers ranking D-scores, allelic number, expected heterozygosity ($H_E$) or $F_{ST}$, respectively. All miss-assigned individuals came from close lineage Lanyu breeds. To improve individual assignment among close lineage breeds, microsatellite markers selected from Lanyu populations with high polymorphic, heterozygosity, $F_{ST}$ and D-scores were used. Only 6 to 8 markers ranking $H_E$, $F_{ST}$ or allelic number were required to obtain 99% assignment accuracy. This result suggests empirical examination of assignment-error rates is required if discernible levels of co-ancestry exist. In the reference group, optimum assignment accuracy was achievable achieved through a combination of different markers by ranking the heterozygosity, $F_{ST}$ and allelic number of close lineage populations.

• Journal of Korean Society of Transportation
• /
• v.22 no.5
• /
• pp.123-137
• /
• 2004

The study on traffic assignment is actively being performed which reflect networks status using time. Its background is increasing social needs to use traffic assignment models in not only hardware area of road network plan but also software area of traffic management or control. In addition, multi-class traffic assignment model is receiving study in order to fill a gap between theory and practice of traffic assignment model. This model is made up of two, one of which is multi-driver class and the other multi-vehicle class. The latter is the more realistic because it can be combined with dynamic model. On this background, this study is to build multidynamic model combining the above-mentioned two areas. This has been a theoretic pillar of ITS in which dynamic user equilibrium assignment model is now made an issue, therefore more realistic dynamic model is expected to be built by combining it with multi-class model. In case of multi-vehicle, FIFO would be violated which is necessary to build the dynamic assignment model. This means that it is impossible to build multi-vehicle dynamic model with the existing dynamic assignment modelling method built under the conditions of FIFO. This study builds dynamic network model which could relieve the FIFO conditions. At the same time, simulation method, one of the existing network loading method, is modified to be applied to this study. Also, as a solution(algorithm) area, time dependent shortest path algorithm which has been modified from existing shortest path algorithm and the existing MSA modified algorithm are built. The convergence of the algorithm is examined which is built by calculating dynamic user equilibrium solution adopting the model and algorithm and grid network.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.1
• /
• pp.37-47
• /
• 2008

Exploitation of address generation units which are typically provided in DSPs plays an important role in DSP code generation since that perform fast address computation in parallel to the central data path. Offset assignment is optimization of memory layout for program variables by taking advantage of the capabilities of address generation units, consists of memory layout generation and address pointer assignment steps. In this paper, we propose an effective address pointer assignment method to minimize the number of address calculation instructions in DSP code generation. The proposed approach reduces the time complexity of a conventional address pointer assignment algorithm with fixed memory layouts by using minimum cost-nodes breaking. In order to contract memory size and processing time, we employ a powerful pruning technique. Moreover our proposed approach improves the initial solution iteratively by changing the memory layout for each iteration because the memory layout affects the result of the address pointer assignment algorithm. We applied the proposed approach to about 3,000 sequences of the OffsetStone benchmarks to demonstrate the effectiveness of the our approach. Experimental results with benchmarks show an average improvement of 25.9% in the address codes over previous works.

• 대한공업교육학회지
• /
• v.43 no.2
• /
• pp.61-78
• /
• 2018

The purposes of this study are to importance and performance of performance goal of workforce training project of SMB Specialized Vocational High Schools by existence of teaching staff's assignment and compare difference of the priority for performance goal of two groups by IPA. Research problems for them are as follows. First, how about differences of the importance for performance goal of workforce training project of SMB Specialized Vocational High Schools by existence of teaching staff's assignment? Second, how about differences of the performance for performance goal of workforce training project of SMB Specialized Vocational High Schools by existence of teaching staff's assignment? Third, how about differences of the priority for performance goal of workforce training project of SMB Specialized Vocational High Schools by existence of teaching staff's assignment? Results obtained by this study are as follows. First, performance goal of workforce training project of SMB Specialized Vocational High Schools that teaching staffs recognize the most importantly regardless of the existence of assignment was 'improvement of students' adaptation to the filed' in area of 'employment competency strengthening'. Second, performance goal of workforce training project of SMB Specialized Vocational High Schools that teaching staffs recognize the degree of high performance regardless of the existence of assignment was 'expansion of SMB employment opportunity' in area of 'employment connection'. Third, regardless of the existence of teaching staff's assignment, areas of high priority in performance goal of workforce training project of SMB Specialized Vocational High Schools were 'improvement of teaching staff's understanding for SMB' and 'improvement of SMB understanding for Specialized Vocational High School' in area of 'improvement of SMB mind for Specialized Vocational high School'.

• 제어로봇시스템학회:학술대회논문집
• /
• 1988.10a
• /
• pp.603-607
• /
• 1988

On this paper, the application of Eiganstructure assignment to flight control system design is presents. Both output feedback and constrained output feedback are considered. The computer implimentation of the algorithm is discussed including the utilization of real arithmetic for complex conjugate eigenvalue. And the example include a stability augementation system, an autopilot decoupled mode control.