• 제목/요약/키워드: determining set

검색결과 612건 처리시간 0.026초

Mode shape identification using response spectrum in experimental modal analysis

  • Babakhani, Behrouz;Rahami, Hossein;Mohammadi, Reza Karami
    • Structural Monitoring and Maintenance
    • /
    • 제5권3호
    • /
    • pp.345-361
    • /
    • 2018
  • The set of processes performed to determine the dynamic characteristics of the constructed structures is named experimental modal analysis. Using experimental modal analysis and interpreting its results, structural failure can be assessed and then it would be possible to plan for their repair and maintenance. The purpose of the experimental modal analysis is to determine the resonance frequencies, mode shapes and Mode damping for the structure. Diverse methods for determining the shape of the mode by various researchers have been presented. There are pros and cons for each of these methods. This paper presents a method for determining the mode shape of the structures using the response spectrum in the experimental modal analysis. In the first part, the principles of the proposed method are described. Then, to check the accuracy of the results obtained from the proposed method, single and multiple degrees of freedom models were numerically and experimentally investigated.

고속탈출유도로 최소 갯수 및 위치 결정 모형 (A Model for Determining the Minimum Number of High Speed Exits and Their Locations for Airports)

  • 김병종
    • 대한교통학회지
    • /
    • 제13권3호
    • /
    • pp.53-65
    • /
    • 1995
  • Proposed are model and its solution algorithm for determining the minimum number of high speed exits and their locations. While the previous researches on exit location aimed to minimize the average runway occuancy time (ROT) of an aircraft mix, the proposed approach is to find the minimum number of exits required to meet maximum allowable ROT. The rationale behind the approach is that the capacity of a runway increases as the ROT decreases down to some value, but not any more even though the ROT keep decreasing below the value. Hence, a maximum allowable ROT might be set up without declining the capacity. The problem is transformed into a shortest path problem on a specially constructed network and Dijkstra's labeling algorithms is employed to solve the problem A hypothetical example is provided to illustrate how the algorithms solves the problem.

  • PDF

무선 센서 네트워크에서 빠른 코드분배를 위한 다수분배자 선정 방법 (A Multiple-Disseminators Determining Mechanism for Fast Code Dissemination in Wireless Sensor Networks)

  • 김미희;홍준석
    • 한국IT서비스학회지
    • /
    • 제10권2호
    • /
    • pp.247-257
    • /
    • 2011
  • In this paper, we propose a multiple-disseminators determining mechanism for Efficient Code Dissemination with low-delay(ECoDi) for wireless sensor networks (WSN). Code dissemination is in the spotlight as an important research issue since sensor nodes are necessary for updating new software remotely or fixing bugs dynamically. In particular, the time factor for code dissemination is the most important factor in order that the normal operation of nodes can be continuously performed as soon as finishing the dissemination. For this factor, ECoDi determines the set of disseminators through regression analysis based on the size of distributed code and the time of past unicasts and broadcasts. Then it transmits the entire code as a unicast to multiple disseminators, and the disseminators broadcast the code to the remaining neighbor nodes. Performance results on a testbed show that ECoDi reduces dissemination time significantly compared to a conventional scheme.

Bayesian Approach for Determining the Order p in Autoregressive Models

  • Kim, Chansoo;Chung, Younshik
    • Communications for Statistical Applications and Methods
    • /
    • 제8권3호
    • /
    • pp.777-786
    • /
    • 2001
  • The autoregressive models have been used to describe a wade variety of time series. Then the problem of determining the order in the times series model is very important in data analysis. We consider the Bayesian approach for finding the order of autoregressive(AR) error models using the latent variable which is motivated by Tanner and Wong(1987). The latent variables are combined with the coefficient parameters and the sequential steps are proposed to set up the prior of the latent variables. Markov chain Monte Carlo method(Gibbs sampler and Metropolis-Hasting algorithm) is used in order to overcome the difficulties of Bayesian computations. Three examples including AR(3) error model are presented to illustrate our proposed methodology.

  • PDF

오프셋 인쇄 잉크의 유화 속도에 영향을 미치는 인자에 관한 연구 (A Study on the Factors Determining the Emulsion Velocity of Off-Set Ink)

  • 김인겸;김성빈;김종래
    • 한국인쇄학회지
    • /
    • 제19권1호
    • /
    • pp.28-41
    • /
    • 2001
  • Rheological properties of ink and Ink-Water balance are the important factors in lithographic printing. Laboratory test method which determines the emulsification rate of dampening solution and ink has been described. The emulsification theory and laboratory test method deduced from Surland and it has become a useful tool for the industry. The effects of pH value and surface tension of dampening solution on the emulsification rate has been tested by many researcher. In this paper we focused on the factors which influence in the emulsification such as pH and surface tension of dampening solution and emulsifying temperature. To study on the factors determining the emulsion velocity, we have measured water pickup and calculated emulsion velocity constant 'k' and activation energy.

  • PDF

데이터 분포에 기반한 유사 군집 선택법 (Neighborhood Selection with Intrinsic Partitions)

  • 김계현;최승진
    • 한국정보과학회:학술대회논문집
    • /
    • 한국정보과학회 2007년도 가을 학술발표논문집 Vol.34 No.2 (C)
    • /
    • pp.428-432
    • /
    • 2007
  • We present a novel method for determining k nearest neighbors, which accurately recognizes the underlying clusters in a data set. To this end, we introduce the "tiling neighborhood" which is constructed by tiling a number of small local circles rather than a single circle, as existing neighborhood schemes do. Then we formulate the problem of determining the tiling neighborhood as a minimax optimization, leading to an efficient message passing algorithm. For several real data sets, our method outperformed the k-nearest neighbor method. The results suggest that our method can be an alternative to existing for general classification tasks, especially for data sets which have many missing values.

  • PDF

한국어의 변이음 규칙과 변이음의 결정 요인들 (Allophonic Rules and Determining Factors of Allophones in Korean)

  • 이호영
    • 대한음성학회지:말소리
    • /
    • 제21_24호
    • /
    • pp.144-175
    • /
    • 1992
  • This paper aims to discuss determining factors of Korean allophones and to formulate and classify Korean allophonic rules systematically. The relationship between allophones and coarticulation, the most. influential factor of allophonic variation, is thoroughly investigated. Other factors -- speech tempo and style, dialect, and social factors such as age, set, class etc. -- are also briefly discussed. Allophonic rules are classified into two groups -- 3) those relevant to coarticulation and 2) those irrelevant to coarticulation. Rules of the first group are further classified into four subgroups according to the directionality of the coarticulation. Each allophonic nile formulation is explained and discussed in detai1. The allophonic rules formulated and classified in this paper are 1) Devoicing of Voiced Consonants, 2) Devoicing of Vowels, 3) Nasal Approach and Lateral Approach, 4) Uvularization, 5) Palatalization, 6) Voicing of Voiceless Lax Consonants, 7) Frication, 8) Labialization, 9) Nasalization, 10) Release Withholding and Release Masking, 11) Glottalization, 12) Flap Rule, 13) Vowel Weakening, and 14) Allophones of /ㅚ, ㅟ, ㅢ/ (which are realized as diphthongs or as monophthongs depending on phonetic contexts).

  • PDF

A Framework for Determining Minimum Load Shedding for Restoring Solvability Using Outage Parameterization

  • Hwachang Song;Lee, Byongjun
    • KIEE International Transactions on Power Engineering
    • /
    • 제4A권2호
    • /
    • pp.73-78
    • /
    • 2004
  • This paper proposes a framework for determining the minimum load shedding for restoring solvability. The framework includes a continuation power flow (CPF) and an optimal power flow (OPF). The CPF parameterizes a specified outage from a set of multiple contingencies causing unsolvable cases, and it traces the path of solutions with respect to the parameter variation. At the nose point of the path, sensitivity analysis is performed in order to achieve the most effective control location for load shedding. Using the control location information, the OPF for locating the minimum load shedding is executed in order to restore power flow solvability. It is highlighted that the framework systematically determines control locations and the proper amount of load shedding. In a numerical simulation, an illustrative example of the proposed framework is shown by applying it to the New England 39 bus system.

ON THE STUDY OF SOLUTION UNIQUENESS TO THE TASK OF DETERMINING UNKNOWN PARAMETERS OF MATHEMATICAL MODELS

  • Avdeenko, T.V.;Je, Hai-Gon
    • East Asian mathematical journal
    • /
    • 제16권2호
    • /
    • pp.251-266
    • /
    • 2000
  • The problem of solution uniqueness to the task of determining unknown parameters of mathematical models from input-output observations is studied. This problem is known as structural identifiability problem. We offer a new approach for testing structural identifiability of linear state space models. The approach compares favorably with numerous methods proposed by other authors for two main reasons. First, it is formulated in obvious mathematical form. Secondly, the method does not involve unfeasible symbolic computations and thus allows to test identifiability of large-scale models. In case of non-identifiability, when there is a set of solutions to the task, we offer a method of computing functions of the unknown parameters which can be determined uniquely from input-output observations and later used as new parameters of the model. Such functions are called parametric functions capable of estimation. To develop the method of computation of these functions we use Lie group transformation theory. Illustrative example is given to demonstrate applicability of presented methods.

  • PDF

A Study on the Optimum Scheme for Determination of Operation Time of Line Feeders in Automatic Combination Weighers

  • Keraita James N.;Kim Kyo-Hyoung
    • Journal of Mechanical Science and Technology
    • /
    • 제20권10호
    • /
    • pp.1567-1575
    • /
    • 2006
  • In an automatic combination weigher, the line feeders distribute the product to several weighing hoppers. The ability to supply appropriate amount of product to the weighing hoppers for each combination operation is crucial for the overall performance. Determining the right duration of operating a line feeder to supply a given amount of product becomes very challenging in case of products which are irregular in volume or specific gravity such as granular secondary processed foods. In this research, several schemes were investigated to determine the best way for a line feeder to approximate the next operating time in order to supply a set amount of irregular goods to the corresponding weighing hopper. Results obtained show that a weighted least squares method (WLS) employing 10 data points is the most effective in determining the operating times of line feeders.