• Korean Journal of Fisheries and Aquatic Sciences
• /
• v.29 no.4
• /
• pp.474-480
• /
• 1996

Physicochemical changes of milt during the spermiation period were investigated in black seabream (Acanthopagrus schlegeli) reared in recirculating seawater system. The spermiation period for the milt collection in cultured brood stock was from 11 April to 4 June. During the spermiation period, average milt volume (ml/100 g body weight) was $0.70{\pm}0.33\;ml$ and maintained high level from 2 May to 4 June. The total number of stripping spermatozoa per 100 g body weight reached the maximum value $(3.32{\times}10^{10})$ in 9 May, then decreased rapidly thereafter. Spermatozoa concentration per ml reached the minimum value in 2 May. There was no change in spermatocrit for the spermiation period. Total protein, total lipid, glucose and Na concentration in spermatozoa and seminal fluid were lower than those in plasma. Total protein, total lipid and K concentration in spermatozoa were higher than those in seminal fluid. The glucose concentration in spermatozoa and seminal fluid in April and May were significantly higher than those in June.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.21 no.1
• /
• pp.148-154
• /
• 2020

This study examines room assignments to improve accessibility in a university dormitory depending on the student grade, taking into account frequency of using a certain common space. An integer programming model is presented to minimize the total moving distance from the common space to the students' rooms for accessibility. The model also constrains the maximum capacity of a room, and disallows different grade students to be assigned to the same room. This model is similar to a facility location problem used widely in the supply chain management field. Applying our optimization model to a small group at the dormitory of Unversity A as the case study, our results indicate that lower grade students are assigned rooms closer to the common space due to their higher frequency of using that space to guarantee high accessibility. Moreover, if higher grade students are prioritized to select their rooms, we suggest an objective function that imposes a penalty in cases when lower grade students select rooms with priority. Based on the results obtained, we propose assigning rooms to students in a dormitory by considering their complex requirements and convenience to use the common space.

• Journal of Korean Society of Transportation
• /
• v.26 no.4
• /
• pp.205-215
• /
• 2008

As static traffic assignment has reached its limitation with ITS policy applications and due to the increase of interest in studies of ITS policies since the late 1980's, dynamic traffic assignment has been considered a tool to overcome such limitations. This study used the Dynameq program, which simulates route choice behavior by macroscopic modeling and dynamic network loading and traffic flow by microscopic modeling in consideration of the feasibility of the analysis of practical traffic policy. The essence of this study is to evaluate the feasibility for analysis in practical transportation policy of using the dynamic traffic assignment technique. The study involves the verification of the values estimated from the dynamic traffic assignment with South Korea's expressway network and dynamic O/D data by comparing results with observed link traffic volumes. This study used dynamic O/D data between each toll booth, which can be accurately obtained from the highway Toll Collection System. Then, as an example of its application, exclusive bus-lane policies were analyzed with the dynamic traffic assignment model while considering hourly variations.

• Aerospace Industry
• /
• v.61
• /
• pp.14-16
• /
• 1998

며칠 전 졸업반 4학년 학생들을 인솔하고 산업체 현장 견학을 다녀왔다. 지난해말 한국을 강습한 IMF 한파 이후 처음 있는 현장 방문이라 여러 가지 면에서 감회가 새로웠다. 일차적으로 김포공항에서 탑승한 부산행 항공기의 현격한 승객 감소가 피부로 와 다았다. 예년 같으면 아침 시간에 좌석배정 카운터가 매우 혼잡할 텐데 별로 힘들지 않게 좌석 배정을 받고 탑승할 수 있었다. 위축된 기업환경과 가계로 인하여 비싼 항공출장과 관광 승객이 대폭 줄은 탓 같았다.

• Journal of Korean Society of Transportation
• /
• v.19 no.3
• /
• pp.101-113
• /
• 2001

Since late 1970s. one of the principal research areas in transportation problem is dynamic traffic assignment (DTA). Although many models have been developed regarding DTA, yet they have some limits of describing real traffic patterns. This reason comes from the fact that DTA model has the time varying constraints such as state equation, flow propagation constraint, first in first out(FIFO) rule and queuing evolution. Thus, DTA model should be designed to satisfy these constraints as well as dynamic route choice condition, dynamic user equilibrium. In this respect, link-based DTA models have difficulty in satisfying such constraints because they have to satisfy the constraints for each link, while path-based DTA models may easily satisfy them. In this paper we develop a path-based DTA model. The model includes point queue theory to describe the queue evolution and simulation loading method for depicting traffic patterns in more detail. From a numerical test, the model shows promising results.

• Journal of KIISE:Information Networking
• /
• v.35 no.6
• /
• pp.521-528
• /
• 2008

Such conventional maritime communication technologies as radio have short some comings in their transmission quality. It can be overcome by wireless channels provided by satellites such as INMARSAT, which nevertheless suffer from the high costs. In this paper, we propose a novel technology resolving the above problems, featuring in the establishment of maritime communication networks with multi-hop structures. The inter vessel and ship-to- shore networks previously modeled after MANET are remodeled by SANET (Ship Ad Hoc Networks) in the present work. Fan-shaped Search Zone Routing (FSR) protocol also is presented, which utilizes not only static geographical information including the locations of ports and the navigations of courses but also the unique characteristics of ships in terms of mobile nodes. The FSR finds the fan-shaped search zone on which the shortest path is located. The performance of LAR protocol is compared with that of FSR in several ways. First, FSR does not make use of a type of control packets as beaconing data, resulting in a full utilization of the bandwidth of the wireless channels. Second, the delivery rate by the FSR is 100% for the fan-shaped search zone includes at least one route between source and destination nodes on its border line, where as that of LAR has been turned out to be 64%. Third, the optimality of routes searched by the FSR is on a 97% level. Of all, the FSR shows a better performance than LAR by about 50%.

• Journal of Korean Society of Transportation
• /
• v.27 no.1
• /
• pp.143-155
• /
• 2009

A dynamic traffic assignment (DTA) has recently been implemented in many practical projects. The core of dynamic model is the inclusion of time scale. If excluding the time dimension from a DTA model, the framework of a DTA model is similar to that of static model. Similar to static model, with given exogenous travel demand, a DTA model loads vehicles on the network and finds an optimal solution satisfying a pre-defined route choice rule. In most DTA models, the departure pattern of given travel demand is predefined and assumed as a fixed pattern, although the departure pattern of driver is changeable depending on a network traffic condition. Especially, for morning peak commute where most drivers have their preferred arrival time, the departure time, therefore, should be modeled as an endogenous variable. In this paper, the authors point out some shortcomings of current DTA model and propose an alternative approach which could overcome the shortcomings of current DTA model. The authors substitute a traditional definition for time-dependent OD table by a new definition in which the time-dependent OD table is defined as arrival time-based one. In addition, the authors develop a new DTA model which is capable of finding an equilibrium departure pattern without the use of schedule delay functions. Three types of objective function for a new DTA framework are proposed, and the solution algorithms for the three objective functions are also explained.

• Journal of Korean Society of Transportation
• /
• v.17 no.5
• /
• pp.69-78
• /
• 1999

This paper defines the reliable based route choice Principle and formulates the reliability based equilibrium traffic assignment using the Principle. The reliability is defined as the difference of travel demand and capacity using the interference theory of the system engineering. An efficient solution a1gorithm based on Frank-Wo1fe algolithm is Presented to calculate and compare the reliability based traffic assignment with conventional travel time based assignment using small and large scaled road networks. The results show that reliability based traffic assignment converges to equilibrium solution in a reasonable computing time. The equilibrium link flows between reliability and travel time based traffic assignment differ each other in the sense that reliability based assignment is assigned based on the maximum difference of travel demand and link capacity whilst travel time based is assigned on the shortest travel time.

• Journal of the Korea Computer Industry Society
• /
• v.9 no.4
• /
• pp.171-176
• /
• 2008

Most booking techniques make a reservation without customer's preference on internet. These techniques have booking problems not to improve customer's preference in the service industry. We have tried to apply object-based scheduling technique to performing art reservation. For customer's satisfaction, we have considered customer's preferences in the reservation scheduling. The scheduling technique for performing art reservation proposed in this thesis is based on object-oriented concepts. To consider the over all satisfaction, the events of every object are alloted to the sitting plan board along its priority. To minimize backtracking or not to fail the allotment of events, we have scheduled to rise customer's preference in the scheduling.

• Journal of IKEEE
• /
• v.7 no.1 s.12
• /
• pp.80-87
• /
• 2003

This paper proposes a routing scheme for multi-hop LEO satellite networks with inter-satellite links aiming for reducing the number of link handovers while keeping the efficient use of network resource. The proposed routing scheme controls the link handovers by taking account of the deterministic LEO satellite system dynamics, geographical location of a ground terminal and statistic information of call duration. The performance of the proposed routing scheme has been evaluated and compared with previous routing schemes in terms of average number of link handovers during a call, the call blocking and dropping probability, and the network utilization.