• Title/Summary/Keyword: Assignment Method

Search Result 831, Processing Time 0.023 seconds

The Effect of Exercise Type on Cardiovascular Disease Risk Index Factors in Male Workers (일부 직장 남성들의 운동형태가 심혈관질환의 위험 예측인자에 미치는 영향)

  • Lee, Suk-In;Kim, Nam-Jin
    • Journal of Preventive Medicine and Public Health
    • /
    • v.39 no.6
    • /
    • pp.462-468
    • /
    • 2006
  • Objectives : The purpose of this study was to gain an understanding of the effects of three exercise types on anthropometric and serum lipids and physiological index factors, which are known to be the three risk factors of cardiovascular disease in male workers. Methods : The experimental study period was 12 weeks. In this study, 30-40's males (N=31) were assigned to 3 experimental groups: regular aerobic(treadmill walking) exercise group, regular anaerobic(muscular endurance) exercise group, irregular aerobic & anaerobic exercise group and a control group using a stratified random assignment method. Results : In relation to anthropometric factors, the regular aerobic & anaerobic exercise groups showed significant decreases in Weight, Broca's index, WC, BMI, WHtR, WHpR and HRrest. With regard to the serum lipid factors, the TC was decreased, but the HDL-c increased among the regular aerobic & anaerobic exercise groups. However, no significant difference was found between the other groups in respect to the LDL-c and TG. Considering the physiological factors, the TC/HD-c, TC-HDL/HDL-c, LDL-C/HDL-c and NON-HDL-c ratios were decreased, but the HDL-c/TC ratio increased among the regular aerobic & anaerobic exercise groups. The TG/HDL-c and HDL-c/LDL-c ratios showed no significant differences between the groups. These results indicated that the positive change for each factor is much larger in the regular exercise groups, especially in the anaerobic exercise group. Conclusions : The results indicate that not only regular aerobic exercise, but also regular anaerobic(muscular endurance) exercise could be utilized in lessening the deleterious effects of the risk index factors for cardiovascular disease.

Intra-session Network Coding for Improving Throughput in Multi-Radio Multi-Channel Multi-Hop Wireless Networks (멀티라디오/멀티채널 멀티 홉 무선 네트워크에서 처리율 향상을 위한 인트라세션 네트워크 코딩)

  • Seo, Kyeong-Su;Yoon, Won-Sik
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.48 no.10
    • /
    • pp.29-34
    • /
    • 2011
  • We present a network coding scheme which is designed for improving throughput in multi-hop wireless network with multi-radio multi-channel. The co-channel interference and unreliability of wireless transmissions cause the wireless network to reduce throughput. In wireless network, multi-radio multi-channel technology shows benefit to cut down channel interferences and contentions. And network coding can reduce the complexity of scheduling and improve throughput by increasing usage of links in wireless network. In this paper, we propose a method of channel assignment and transmission scheduling in intra-session network coding that efficiently improve throughput for multi-hop wireless network by using mathematical modeling and linear programming. Moreover, we evaluate the performance of the intra-session network coding scheme by using AMPL with CPLEX. The simulation results show that intra-session network coding can achieve better throughput than traditional routing.

The Genetic Diversity of Trans-caucasian Native Sheep Breeds

  • Hirbo, Jibril;Muigai, Anne;Naqvi, A.N.;Rege, E.D.;Hanotte, Olivier
    • Asian-Australasian Journal of Animal Sciences
    • /
    • v.19 no.7
    • /
    • pp.943-952
    • /
    • 2006
  • The genetic variation in 10 indigenous Caucasian sheep breeds was studied with 14 micro-satellite loci in order to determine the genetic diversity among and between the breeds. Five breeds from Asia, five breeds from Europe and one breed from Africa, were included in order to study any relationships or influences they may have with the Caucasian sheep analyzed. A Karakul population from Uzbekistan was included in the study to see whether there was any Central Asian influence. All the 14 loci were found to be polymorphic in all the breeds, with the exception of ILST0056, which was monomorphic in Imeretian. A total of 231 alleles were generated from all the 688 individuals of the sheep analyzed. The mean number of alleles (MNA) at each locus was 16.5. The total number of alleles detected in all samples ranged from 13 in several loci to 23 in OarJMP029. Out of total 308 Hardy-Weinberg Equilibrium (HWE) tests, 85 gave significant results. After Bonferroni correction for multiple tests, 30 comparisons still remained significant to the experimental levels. The Gala population was the most diverse and Imeretian the least diverse with a MNA of 8.50 and 5.51, respectively. Gene diversity estimates exhibited the same trend and ranged from 0.803 in Gala and 0.623 in Imeretian, but generally there is higher diversity among the Caucasian breeds in comparison to other eference breeds. The closest breeds were Tushin and Bozakh with Da of 0.113 and most distant breeds were $Djallonk{\acute{e}}$ and North Rondalsy with Da of 0.445. Principal Component (PC) analyses were done. PC1 described 14% of the differences. PC2, which described 13% of the differences, further separated the Caucasian breeds from Asian breeds except Karakul and Awasi, and the two British breeds. PC3 described 10% of the differences, allowing better differentiation of the Caucasian breeds. A moderate degree of reliability was observed for individual-breed assignment from the 14 loci using different approaches among which the Bayesian method proved to be the most efficient. About 72% of individuals analyzed were correctly assigned to their respective breeds.

Optimal Spacings for Urban Arterial Network (도시간선도로망(都市幹線道路網)의 적정간격(適正間隔))

  • Park, Chang Ho
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.2 no.3
    • /
    • pp.33-41
    • /
    • 1982
  • Development is given for an analytical approach that can investigate parameters characterizing road network geometry. A grid transportation network having a hierarchy structure is considered on a homogeneous and isotropic urban plane in which trip origins and destinations are uniformly dispersed and the trip length distribution is independent of the location of the origin. The object is to find the optimal spacings between urban arterials so as to minimize the sum of travel and construction costs, subject to the hypothesis that a trip assignment follows the Wardrop's first principle. The proposed approach is not the genera method for determining an efficient network layout, but can be used as basic concept for generating and evaluating urban road network alternatives. Given an O-D table and cost estimates the approach is able to outline at least in a qualitative sense the optimal spacings of urban arterial roads.

  • PDF

Classification of Land Cover over the Korean Peninsula using MODIS Data (MODIS 자료를 이용한 한반도 지면피복 분류)

  • Kang, Jeon-Ho;Suh, Myoung-Seok;Kwak, Chong-Heum
    • Atmosphere
    • /
    • v.19 no.2
    • /
    • pp.169-182
    • /
    • 2009
  • To improve the performance of climate and numerical models, concerns on the land-atmosphere schemes are steadily increased in recent years. For the realistic calculation of land-atmosphere interaction, a land surface information of high quality is strongly required. In this study, a new land cover map over the Korean peninsula was developed using MODIS (MODerate resolution Imaging Spectroradiometer) data. The seven phenological data set (maximum, minimum, amplitude, average, growing period, growing and shedding rate) derived from 15-day normalized difference vegetation index (NDVI) were used as a basic input data. The ISOData (Iterative Self-Organizing Data Analysis), a kind of unsupervised non-hierarchical clustering method, was applied to the seven phenological data set. After the clustering, assignment of land cover type to the each cluster was performed according to the phenological characteristics of each land cover defined by USGS (US. Geological Survey). Most of the Korean peninsula are occupied by deciduous broadleaf forest (46.5%), mixed forest (15.6%), and dryland crop (13%). Whereas, the dominant land cover types are very diverse in South-Korea: evergreen needleleaf forest (29.9%), mixed forest (26.6%), deciduous broadleaf forest (16.2%), irrigated crop (12.6%), and dryland crop (10.7%). The 38 in-situ observation data-base over South-Korea, Environment Geographic Information System and Google-earth are used in the validation of the new land cover map. In general, the new land cover map over the Korean peninsula seems to be better classified compared to the USGS land cover map, especially for the Savanna in the USGS land cover map.

Solving the test resource allocation using variable group genetic algorithm (가변 그룹 유전자알고리즘 기반의 시험자원할당 문제 해결)

  • Mun, Chang-min
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.20 no.8
    • /
    • pp.1415-1421
    • /
    • 2016
  • There are considerable concern on the methods for the efficient utilization of the test-resources as increasing of the number of the tests for functionality and performance verification of weapon systems. Furthermore, with an increase in the complexity of the resource assignment the decision support is required. Test resource allocation is basically the same problems as conventional NP-hard FJSP(Flexible Job Shop Problem), therefore empirical test resource allocation method that has been used in many decades is limited in the time performance. Although research has been conducted applying the genetic algorithm to the FJSP, it is limited in the test resource allocation domain in which more than one machine is necessary for a single operation. In this paper, a variable group genetic algorithm is proposed. The algorithm is expected to improve the test plan efficiency by automating and optimizing the existing manual based allocation. The simulation result shows that the algorithm could be applicable to the test plan.

Bus and Registor Optimization in Datapath Synthesis (데이터패스 합성에서의 버스와 레지스터의 최적화 기법)

  • Sin, Gwan-Ho;Lee, Geun-Man
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.8
    • /
    • pp.2196-2203
    • /
    • 1999
  • This paper describes the bus scheduling problem and register optimization method in datapath synthesis. Scheduling is process of operation allocation to control steps in order to minimize the cost function under the given circumstances. For that purpose, we propose some formulations to minimize the cost function for bus assignment to get an optimal and minimal cost function in hardware allocations. Especially, bus and register minimization technique are fully considered which are the essential topics in hardware allocation. Register scheduling is done after the operation and bus scheduling. Experiments are done with the DFG model of fifth-order digital ware filter to show its effectiveness. Structural integer programming formulations are used to solve the scheduling problems in order to get the optimal scheduling results in the integer linear programming environment.

  • PDF

A Study on the Improvement of Multitree Pattern Recognition Algorithm (Multitree 형상 인식 기법의 성능 개선에 관한 연구)

  • 김태성;이정희;김성대
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.14 no.4
    • /
    • pp.348-359
    • /
    • 1989
  • The multitree pattern recognition algorithm proposed by [1] and [2] is modified in order to improve its performance. The basic idea of the multitree pattern classification algorithm is that the binary dceision tree used to classify an unknow pattern is constructed for each feature and that at each stage, classification rule decides whether to classify the unknown pattern or to extract the feature value according to the feature ordet. So the feature ordering needed in the calssification procedure is simple and the number of features used in the classification procedure is small compared with other classification algorithms. Thus the algorithm can be easily applied to real pattern recognition problems even when the number of features and that of the classes are very large. In this paper, the wighting factor assignment scheme in the decision procedure is modified and various classification rules are proposed by means of the weighting factor. And the branch and bound method is applied to feature subset selection and feature ordering. Several experimental results show that the performance of the multitree pattern classification algorithm is improved by the proposed scheme.

  • PDF

Dynamic Channel-Time Assignments based on the link status in IEEE 802.15.3 High-rate WPAN (IEEE 802.15.3 고속 무선 PAN(Personal Area Network)에서 링크상태에 따른 동적 채널할당)

  • 곽동원;이승형
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.7A
    • /
    • pp.844-851
    • /
    • 2004
  • Various types of error are caused due to many factors of various environment in air interface channel of wireless communications. In this case, the reliability of the channel is much lower than that of wired case. IEEE 802.15.3 high-rate WPAN, which operates in an ad hoc networking environment, is more susceptible to such errors. The problem has been investigated for wireless LANs, for example, as follows. If the queue size of a certain node is longer than that of other nodes, the node estimates that its channel state is bad and the resource of the node is decreased. However this method has a disadvantage that a central controller must always monitor the status. To avoid this disadvantage, in this paper, a new MAC protocol that the throughput of overall piconet is increased by LDS (Link-status Dependent Scheduling) is proposed.

A Method for IPv6 Address Assignments of the Next Generation Defense Network (차세대 국방정보통신망을 위한 IPv6 주소 할당 방안)

  • Kim, Kwon-Il;Lee, Sang-Hoon
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.14 no.4
    • /
    • pp.441-445
    • /
    • 2008
  • Korean military is propelling the M&S on new warfare concept, such as NCW(Network Centric Warfare) which is the aspect of future war. IPv6 is the essential element of next generation defense network which is supporting the future battlefield. There have been many studies on allocating the IPv6 address for next generation defense network. However, they assigned the address by level on the basis of the military organization or assigned it from the service network, so it had the defect, the big size routing table. This study reviews the topology of next generation defense network and adjusts the position of service network ID on the basis of the network topology. Finally, it improved the efficiency of route aggregation and minimized the routing table size in comparison with the previous studies and it was proved by OPNET simulator.