• Title/Summary/Keyword: Neighborhood method

Search Result 509, Processing Time 0.033 seconds

The Relative Influence of Diet and Physical Activity on Obesity in China

  • Cui Zhao-Hui;Li Yan-Ping;Di Yu-Feng;Ba Lei;Hu Xiaoqi;Ma Guan-Sheng
    • Journal of Community Nutrition
    • /
    • v.6 no.3
    • /
    • pp.125-130
    • /
    • 2004
  • The purpose of this study is to investigate the relative influence of diet and physical activity on obesity. The subjects were 155 adults aged 35-52 years from 24 neighborhood committees in 4 urban districts of Beijing (male : 78, female : 77). They were divided into normal weight, overweight and obese groups according to their BMI. The general information of the subjects was collected by interview-administered questionnaire. Dietary intake was obtained by three-day(two weekdays and one weekend day) food weighted method, physical activity was assessed by a validated combination of data obtained from activity monitors, bicycling information and activity records. There were no significant differences of age, gender, height, educational, family economic level, smoking and drinking between different groups. The proportion of flour intake was higher in obese group compared to normal weight and overweight groups, and that of vegetables is lower in obese group. The physical activity (PAL) was not significantly different between two groups of the normal, overweight and obese groups. After the adjustment for confounding factors using logistic regression model, we found that the proportion of flour intake was positively associated with obesity, while the proportion of vegetable intake was inversely associated with obesity. It is concluded that dietary patterns were associated with obesity and diets composed of more vegetables and less staple combined with physical activities could contribute to obesity prevention.

Comparison of RF Property and Network Property for 802.11n WLAN between In-door and Out-door Environment (실내와 실외환경에서의 802.11n WLAN RF 특성 및 Network 특성 비교)

  • Kim, Gap-Young;An, Tea-Ki;Jeon, Bo-Ik;Yang, Se-Hyun
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.11 no.5
    • /
    • pp.1702-1707
    • /
    • 2010
  • As quantities of the data that transmitting by the wireless are more increased, the interest and application are extending about 802.11n that uses by combination two existing 20MHz wireless LAN Channel. 802.11n use dual band of 2.4GHz band and 5.8GHz. So this is expected in mass wireless transmission method because of interference evasion effect in compliance with the radio communication of existing 2GHz neighborhood band. Like this 802.11n uses the radio as well and transmits information there is not only a possibility of undergoing an influence in radio wave environment of circumference. Specially the interior environment and outdoor environment is a possibility of saying that will be defined with each other different modeling as affects in radio communication is different. In this paper, we'll compare the influence to RF feature (802.11n) by (Indoor/Outdoor) environment difference through compared with 802.11n RF feature and Network feature in (Indoor/Outdoor) environment and also examine the correlation between RF feature and Network feature.

Determination of Dairy Cow Food Intake using Simulated Annealing (시뮬레이티드 어닐링을 이용한 젖소의 급이량 산정)

  • 허은영;김동원;한병성;김용준;이수영
    • Journal of Biosystems Engineering
    • /
    • v.27 no.5
    • /
    • pp.433-450
    • /
    • 2002
  • The daily food intake for dairy cows has to be effectively controlled to breed a sound group of cows as well as to enhance the productivity of the cows. But, feed stuffs are fed in the common bulk for a group of cows in most cases despite that the individual food intake has to be varied. To obtain the feed for each cow, both the nutrient requirements and the nutrient composition of fred have to be provided in advance, which are based on the status of cows such as weigh marginal weight amount of milk, fat concentration in milk, growth and milking stages, and rough feed ratio, etc. Then, the mixed ration fur diet would be computed by the nutrient requirements constraints. However, when TMR (Total Mixed Ration) is conventionally supplied for a group of cows, it is almost impossible to get an optimal feed mixed ration meeting the nutrient requirements of each individual cow since the constraints are usually conflicting and over-constrained although they are linear. Hence, addressed in this paper is a simulated annealing (SA) technique to find the food intake for dairy cows, considering the characteristics of individual or grouped cows. Appropriate parameters fur the successful working of SA are determined through preliminary experiments. The parameters include initial temperature, epoch length. cooling scheduling, and stopping criteria. In addition, a neighborhood solution generation method for the effective improvement of solutions is presented. Experimental results show that the final solution for the mixture of feed fits the rough feed ratio and some other nutrient requirements such as rough fiber, acid detergent fiber, and neutral detergent fiber, with 100 percent, while fulfilling net energy for lactating, metabolic energy, total digestible nutrients, crude protein, and undegraded intake protein within average five percent.

Ant Colony Hierarchical Cluster Analysis (개미 군락 시스템을 이용한 계층적 클러스터 분석)

  • Kang, Mun-Su;Choi, Young-Sik
    • Journal of Internet Computing and Services
    • /
    • v.15 no.5
    • /
    • pp.95-105
    • /
    • 2014
  • In this paper, we present a novel ant-based hierarchical clustering algorithm, where ants repeatedly hop from one node to another over a weighted directed graph of k-nearest neighborhood obtained from a given dataset. We introduce a notion of node pheromone, which is the summation of amount of pheromone on incoming arcs to a node. The node pheromone can be regarded as a relative density measure in a local region. After a finite number of ants' hopping, we remove nodes with a small amount of node pheromone from the directed graph, and obtain a group of strongly connected components as clusters. We iteratively do this removing process from a low value of threshold to a high value, yielding a hierarchy of clusters. We demonstrate the performance of the proposed algorithm with synthetic and real data sets, comparing with traditional clustering methods. Experimental results show the superiority of the proposed method to the traditional methods.

Improvement of Domain-specific Keyword Spotting Performance Using Hybrid Confidence Measure (하이브리드 신뢰도를 이용한 제한 영역 핵심어 검출 성능향상)

  • 이경록;서현철;최승호;최승호;김진영
    • The Journal of the Acoustical Society of Korea
    • /
    • v.21 no.7
    • /
    • pp.632-640
    • /
    • 2002
  • In this paper, we proposed ACM (Anti-filler confidence measure) to compensate shortcoming of conventional RLJ-CM (RLJ-CM) and NCM (normalized CM), and integrated proposed ACM and conventional NCM using HCM (hybrid CM). Proposed ACM analyzes that FA (false acceptance) happens by the construction method of anti-phone model, and presumed phoneme sequence in actuality using phoneme recognizer to compensate this. We defined this as anti-phone model and used in confidence measure calculation. Analyzing feature of two confidences measure, conventional NCM shows good performance to FR (false rejection) and proposed ACM shows good performance in FA. This shows that feature of each other are complementary. Use these feature, we integrated two confidence measures using weighting vector α And defined this as HCM. In MDR (missed detection rate) 10% neighborhood, HCM is 0.219 FA/KW/HR (false alarm/keyword/hour). This is that Performance improves 22% than used conventional NCM individually.

MCMC Algorithm for Dirichlet Distribution over Gridded Simplex (그리드 단체 위의 디리슐레 분포에서 마르코프 연쇄 몬테 칼로 표집)

  • Sin, Bong-Kee
    • KIISE Transactions on Computing Practices
    • /
    • v.21 no.1
    • /
    • pp.94-99
    • /
    • 2015
  • With the recent machine learning paradigm of using nonparametric Bayesian statistics and statistical inference based on random sampling, the Dirichlet distribution finds many uses in a variety of graphical models. It is a multivariate generalization of the gamma distribution and is defined on a continuous (K-1)-simplex. This paper presents a sampling method for a Dirichlet distribution for the problem of dividing an integer X into a sequence of K integers which sum to X. The target samples in our problem are all positive integer vectors when multiplied by a given X. They must be sampled from the correspondingly gridded simplex. In this paper we develop a Markov Chain Monte Carlo (MCMC) proposal distribution for the neighborhood grid points on the simplex and then present the complete algorithm based on the Metropolis-Hastings algorithm. The proposed algorithm can be used for the Markov model, HMM, and Semi-Markov model for accurate state-duration modeling. It can also be used for the Gamma-Dirichlet HMM to model q the global-local duration distributions.

Assessing applicability of self-organizing map for regional rainfall frequency analysis in South Korea (Self-organizing map을 이용한 강우 지역빈도해석의 지역구분 및 적용성 검토)

  • Ahn, Hyunjun;Shin, Ju-Young;Jeong, Changsam;Heo, Jun-Haeng
    • Journal of Korea Water Resources Association
    • /
    • v.51 no.5
    • /
    • pp.383-393
    • /
    • 2018
  • The regional frequency analysis is the method which uses not only sample of target station but also sample of neighborhood stations in which are classified as hydrological homogeneous regions. Consequently, identification of homogeneous regions is a very important process in regional frequency analysis. In this study, homogeneous regions for regional frequency analysis of precipitation were identified by the self-organizing map (SOM) which is one of the artificial neural network. Geographical information and hourly rainfall data set were used in order to perform the SOM. Quantization error and topographic error were computed for identifying the optimal SOM map. As a result, the SOM model organized by $7{\times}6$ array with 42 nodes was selected and the selected stations were classified into 6 clusters for rainfall regional frequency analysis. According to results of the heterogeneity measure, all 6 clusters were identified as homogeneous regions and showed more homogeneous regions compared with the result of previous study.

Generation of Pareto Sets based on Resource Reduction for Multi-Objective Problems Involving Project Scheduling and Resource Leveling (프로젝트 일정과 자원 평준화를 포함한 다목적 최적화 문제에서 순차적 자원 감소에 기반한 파레토 집합의 생성)

  • Jeong, Woo-Jin;Park, Sung-Chul;Yim, Dong-Soon
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.43 no.2
    • /
    • pp.79-86
    • /
    • 2020
  • To make a satisfactory decision regarding project scheduling, a trade-off between the resource-related cost and project duration must be considered. A beneficial method for decision makers is to provide a number of alternative schedules of diverse project duration with minimum resource cost. In view of optimization, the alternative schedules are Pareto sets under multi-objective of project duration and resource cost. Assuming that resource cost is closely related to resource leveling, a heuristic algorithm for resource capacity reduction (HRCR) is developed in this study in order to generate the Pareto sets efficiently. The heuristic is based on the fact that resource leveling can be improved by systematically reducing the resource capacity. Once the reduced resource capacity is given, a schedule with minimum project duration can be obtained by solving a resource-constrained project scheduling problem. In HRCR, VNS (Variable Neighborhood Search) is implemented to solve the resource-constrained project scheduling problem. Extensive experiments to evaluate the HRCR performance are accomplished with standard benchmarking data sets, PSPLIB. Considering 5 resource leveling objective functions, it is shown that HRCR outperforms well-known multi-objective optimization algorithm, SPEA2 (Strength Pareto Evolutionary Algorithm-2), in generating dominant Pareto sets. The number of approximate Pareto optimal also can be extended by modifying weight parameter to reduce resource capacity in HRCR.

An elasto-plastic damage constitutive model for jointed rock mass with an application

  • Wang, Hanpeng;Li, Yong;Li, Shucai;Zhang, Qingsong;Liu, Jian
    • Geomechanics and Engineering
    • /
    • v.11 no.1
    • /
    • pp.77-94
    • /
    • 2016
  • A forked tunnel, as a special complicated underground structure, is composed of big-arch tunnel, multi-arch tunnel, neighborhood tunnels and separate tunnels according to the different distances between two separate tunnels. Due to the complicated process of design and construction, surrounding jointed rock mass stability of the big-arch tunnel which belongs to the forked tunnel during excavation is a hot issue that needs special attentions. In this paper, an elasto-plastic damage constitutive model for jointed rock mass is proposed based on the coupling method considering elasto-plastic and damage theories, and the irreversible thermodynamics theory. Based on this elasto-plastic damage constitutive model, a three dimensional elasto-plastic damage finite element code (D-FEM) is implemented using Visual Fortran language, which can numerically simulate the whole excavation process of underground project and perform the structural stability of the surrounding rock mass. Comparing with a popular commercial computer code, three dimensional fast Lagrangian analysis of continua (FLAC3D), this D-FEM has advantages in terms of rapid computing process, element grouping function and providing more material models. After that, FLAC3D and D-FEM are simultaneously used to perform the structural stability analysis of the surrounding rock mass in the forked tunnel considering three different computing schemes. The final numerical results behave almost consistent using both FLAC3D and D-FEM. But from the point of numerically obtained damage softening areas, the numerical results obtained by D-FEM more closely approach the practical behaviors of in-situ surrounding rock mass.

A Tabu Search Algorithm for Node Reprogramming in Wireless Sensor Networks (무선 센서 네트워크에서 노드 재프로그래밍을 위한 타부 서치 알고리즘)

  • Jang, Kil-woong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.23 no.5
    • /
    • pp.596-603
    • /
    • 2019
  • A reprogramming operation is necessary to update the software code of the node to change or update the functionality of the deployed node in wireless sensor networks. This paper proposes an optimization algorithm that minimizes the transmission energy of a node for the purpose of reprogramming a node in wireless sensor networks. We also design an algorithm that keeps energy consumption of all nodes balanced in order to maintain the lifetime of the network. In this paper, we propose a Tabu search algorithm with a new neighborhood generation method for minimizing transmission energy and energy consumption in wireless sensor networks with many nodes. The proposed algorithm is designed to obtain optimal results within a reasonable execution time. The performance of the proposed Tabu search algorithm was evaluated in terms of the node's transmission energy, remaining energy, and algorithm execution time. The performance evaluation results showed better performance than the previous methods.