• 제목/요약/키워드: state sets

검색결과 449건 처리시간 0.027초

3차원 확률분포함수를 고려한 단일전자 기본 논리 셀의 해석 (Analysis of a basic single-electron logic-cell considering three-dimensional joint probability distribution)

  • 유윤섭;황성우
    • 전자공학회논문지A
    • /
    • 제33A권7호
    • /
    • pp.143-148
    • /
    • 1996
  • Detailed analyses have been presentd for a basic single-electron-logic-cell consisting of two single-electron-transistors (SETs) in series. The interconnection between two SETs has been treated as a coulomb island and the joint probability density function of all three coulomb islands (two from the SETs and one form the interconnection) has been exactly calculated. The average number of electrons in each coulomb island and the steady-state ouptut voltage have been calculated and analyzed.

  • PDF

Power Distribution Control Scheme for a Three-phase Interleaved DC/DC Converter in the Charging and Discharging Processes of a Battery Energy Storage System

  • Xie, Bing;Wang, Jianze;Jin, Yu;Ji, Yanchao;Ma, Chong
    • Journal of Power Electronics
    • /
    • 제18권4호
    • /
    • pp.1211-1222
    • /
    • 2018
  • This study presents a power distribution control scheme for a three-phase interleaved parallel DC/DC converter in a battery energy storage system. To extend battery life and increase the power equalization rate, a control method based on the nth order of the state of charge (SoC) is proposed for the charging and discharging processes. In the discharging process, the battery sets with high SoC deliver more power, whereas those with low SoC deliver less power. Therefore, the SoC between each battery set gradually decreases. However, in the two-stage charging process, the battery sets with high SoC absorb less power, and thus, a power correction algorithm is proposed to prevent the power of each particular battery set from exceeding its rated power. In the simulation performed with MATLAB/Simulink, results show that the proposed scheme can rapidly and effectively control the power distribution of the battery sets in the charging and discharging processes.

EPD 신호궤적을 이용한 개별 웨이퍼간 이상검출에 관한 연구 (A Study on Wafer to Wafer Malfunction Detection using End Point Detection(EPD) Signal)

  • 이석주;차상엽;최순혁;고택범;우광방
    • 제어로봇시스템학회논문지
    • /
    • 제4권4호
    • /
    • pp.506-516
    • /
    • 1998
  • In this paper, an algorithm is proposed to detect the malfunction of plasma-etching characteristics using EPD signal trajectories. EPD signal trajectories offer many information on plasma-etching process state, so they must be considered as the most important data sets to predict the wafer states in plasma-etching process. A recent work has shown that EPD signal trajectories were successfully incorporated into process modeling through critical parameter extraction, but this method consumes much effort and time. So Principal component analysis(PCA) can be applied. PCA is the linear transformation algorithm which converts correlated high-dimensional data sets to uncorrelated low-dimensional data sets. Based on this reason neural network model can improve its performance and convergence speed when it uses the features which are extracted from raw EPD signals by PCA. Wafer-state variables, Critical Dimension(CD) and uniformity can be estimated by simulation using neural network model into which EPD signals are incorporated. After CD and uniformity values are predicted, proposed algorithm determines whether malfunction values are produced or not. If malfunction values arise, the etching process is stopped immediately. As a result, through simulation, we can keep the abnormal state of etching process from propagating into the next run. All the procedures of this algorithm can be performed on-line, i.e. wafer to wafer.

  • PDF

유성기어 소음을 고려한 pRMC 프로그램 개발 및 적용에 관한 연구 (Research for the Development of a pRMC Program for the Planetary Gear Noise)

  • 이현구;김무석;서현승;김진호;칼만아멧;하리안또자니;권현식
    • 한국소음진동공학회논문집
    • /
    • 제23권7호
    • /
    • pp.669-674
    • /
    • 2013
  • To design the optimized low noise planetary gear sets, a program called pRMC(planetary run many cases) is developed. The pRMC is especially using a combination analysis method for all gear specifications and also able to analyze any type of planetary gear sets. The pRMC is composed of the 5 sections those are generate, setting, evaluate, combine and analysis. After calculating all candidate gear sets, the pRMC could show many results that represent the character of each gear set including the transmission error which is the main gear noise factor, the contact ratios, the bending stress and so on. By comparing the results objectively, user could predict and select the optimized gear set which has quiet noise level and desired durability. The planetary gear designed by pRMC could have reduced noise and vibration level from 5 to 10 dB than previous-designed one.

다중 에이전트 기반의 고대 국가 형성 시뮬레이션 (The Multi-Agent Simulation of Archaic State Formation)

  • S. Kim;A. Lazar;R.G. Reynolds
    • 한국시뮬레이션학회:학술대회논문집
    • /
    • 한국시뮬레이션학회 2003년도 춘계학술대회논문집
    • /
    • pp.91-100
    • /
    • 2003
  • In this paper we investigate the role that warfare played In the formation of the network of alliances between sites that are associated with the formation of the state in the Valley of Oaxaca, Mexico. A model of state formation proposed by Marcos and Flannery (1996) is used as the basis for an agent-based simulation model. Agents reside in sites and their actions are constrained by knowledge extracted from the Oaxaca Surface Archaeological Survey (Kowalewski 1989). The simulation is run with two different sets of constraint rules for the agents. The first set is based upon the raw data collected in the surface survey. This represents a total of 79 sites and constitutes a minimal level of warfare (raiding) in the Valley. The other site represents the generalization of these constraints to sites with similar locational characteristics. This set corresponds to 987 sites and represents a much more active role for warfare in the Valley. The rules were produced by a data mining technique, Decision Trees, guided by Genetic Algorithms. Simulations were run using the two different rule sets and compared with each other and the archaeological data for the Valley. The results strongly suggest that warfare was a necessary process in the aggregations of resources needed to support the emergence of the state in the Valley.

  • PDF

Constrained Robust Model Predictive Control with Enlarged Stabilizable Region

  • Lee, Young-Il
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2004년도 ICCAS
    • /
    • pp.1-4
    • /
    • 2004
  • The dual-mode strategy has been adopted in many constrained MPC methods. The size of stabilizable regions of states of MPC methods depends on the size of underlying feasible and positively invariant set and number of control moves. These results, however, could be conservative because the definition of positive invariance does not allow temporal leave of states from the set, In this paper, a concept of periodic invariance is introduced in which states are allowed to leave a set temporarily but return into the set in finite steps. The periodic invariance can defined with respect to sets of different state feedback gains. These facts make it possible for the periodically invariant sets to considerably larger than ordinary invariant sets. The periodic invariance can be defined for systems with polyhedral model uncertainties. We derive a MPC method based on these periodically invariant sets. Some numerical examples are given to show that the use of periodic invariance yields considerably larger stabilizable sets than the case of using ordinary invariance.

  • PDF

An Efficient Method on Constructing $ extsc{k}$-Minimal Path Sets for Flow Network Reliability

  • Lee, Seung-Min;Park, Dong-Ho
    • Journal of the Korean Statistical Society
    • /
    • 제29권3호
    • /
    • pp.297-306
    • /
    • 2000
  • An efficient method of constructing $textsc{k}$-minimal path sets to evaluate the reliability of a flow network is presented. The network is considered to be in a functioning state if it can transmit a maximum flow which is greater than or equal to a specified amount of flow, $textsc{k}$say, and a $textsc{k}$-minimal path set is a minimal set of branches that satisfies the given flow constraint. In this paper, under the assumption that minimal path sets of the network are known, we generate composite paths by adding only a minimal set of branches at each iteration to get $textsc{k}$-minimal path sets after possibly the fewest composition, and compute maximum flow of composite paths using only minimal path sets. Thereby we greatly reduce the possible occurrence of redundant composite paths throughout the process and efficiently compute the maximum flow of composite paths generated. Numerical examples illustrate the method.

  • PDF

An Analysis on Observational Surface and upper layer Current in the Yellow Sea and the East China Sea

  • Kui, Lin;Binghuo;Tang, Yuxiang
    • Journal of the korean society of oceanography
    • /
    • 제37권3호
    • /
    • pp.187-195
    • /
    • 2002
  • The characteristics of surface circulation in the Yellow Sea and the East China Sea are discussed by analyzing a great deal of current data observed by 142 sets of mooring buoy and 58 sets of drifters trajectories collected in the Yellow Sea and the East China Sea through domestic and abroad measurements. Some major features are demonstrated as bellow: 1) Tsushima Warm Current flows away from the Kuroshio and has multiple sources in warm half year and comes only from Kuroshio surface water in cold half year. 2) Taiwan Warm Current comes mainly from the Taiwan Strait Water in warm half year and comes from the intruded Kuroshio surface water and branches near 27N in cold half year. 3) The Changjiang Diluted Water turns towards Cheju Island in summer and flows southward along the coastal line in winter. 4) The study sea area is an eddy developing area, especially in the southern area of Cheju Island and northern area of Taiwan.

축구로봇을 위한 계층적 제어기 (A Hierachical Controller for Soccer Robots)

  • 이인재;백승민;손경오;국태용
    • 제어로봇시스템학회논문지
    • /
    • 제6권9호
    • /
    • pp.803-812
    • /
    • 2000
  • In this paper we introduce a model based centralized hierarchical controller for cooperative team of soccerplaying multiple mobile robots. The hierarchical controller is composed of high-level and low-level controllers. Using the coordinates information of objects from the vision are simple models of multiple mobile tobots on the playground. Subsequently, the high level controller selects and action model corresponding to the perceived state transition model and generates subgoal and goal-velocity, from which the low level controller generates trajectory of each wheel velocity of the robot. This two layered simplicity. The feasubility of the control strategy has been demonstrated in an implementation for real soccer games at a MiroSot league.

  • PDF