• Title/Summary/Keyword: Forward simulation

Search Result 994, Processing Time 0.044 seconds

Flight Envelope Load Factor Limit Logic Design for Helicopter Fly-By-Wire Controller (전자식 조정장치 헬리콥터의 하중 비행영역 제한 로직 설계)

  • Choi, In-Ho
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.17 no.1
    • /
    • pp.159-164
    • /
    • 2016
  • This paper reports the load factor logic design for a fly-by-wire helicopter flight envelope protection. As a helicopter is very complex system with a rotor, fuselage, engine, etc., there are many constraints on the flight region. Because of these constraints, pilots should consider them carefully and have a heavy workload, which causes controllability degradation. In this respect, automatic logic is needed to free the pilot from these considerations. As one of these logics, the flight envelope protection logic for the load factor of a FBW helicopter was designed. The flight to exceed the load factor is caused by an abrupt pitch cyclic stick change. In this scheme, the load factor limit logic was added between the pilot stick command block and pitch attitude command block. From the current load value, the available attitude range was calculated dynamically and simulated on the helicopter simulator model to verify the performance. A comparison of the simulation results at the hovering and forward speed region with and without applying the load limiting logic showed that the load factor limit was exceeded more than 20% when the logic was not applied, whereas with the load factor limit logic the load factor was within the limit. In conclusion, a dynamically allocated limitation logic to helicopter FBW controller was verified by simulation.

A Study on the Change of Hire Payment Method to Reduce the FFA Basis Risk (FFA 베이시스위험 축소를 위한 용선료 지급기준 변경의 타당성 검토)

  • Lee, Seung-Cheol;Yun, Heesung
    • Journal of Navigation and Port Research
    • /
    • v.46 no.4
    • /
    • pp.359-366
    • /
    • 2022
  • While the Forward Freight Agreement (FFA) has emerged as an effective hedging tool since early 1990, the basis risk and cash flow distortions have been addressed as obstacles to the active use of FFAs. This research analyses the basis risk of FFAs and provides a feasible suggestion to reduce it. Basis risk is divided into timing basis, route basis, size basis, and low liquidity basis. The timing basis is defined as the difference between the physical hire, fixed on the specific contract date and the FFA settlement price, calculated by averaging spot rates for a certain period. Timing basis is considered the worst in eroding the effectiveness of FFAs. This paper suggests a change of hire payment criterion from contract date to 15-day moving average, as a means of mitigating the basis risk, and analyzed the effectiveness through historical simulation. The result revealed that the change is effective in mitigating the timing basis. This study delivers a meaningful implication to shipping practice in that the change of hire payment criterion mitigates the basis risk and eventually activates the use of FFAs in the future.

Efficient Content Sharing using the Selection of Minimum Forwarding Peers in an Ad Hoc Network (최소의 Forwarding Peer 선택을 통한 애드 혹 네트워크에서의 효율적 콘텐츠 분배 방법)

  • Kang, Seung-Seok
    • Journal of the Korea Society for Simulation
    • /
    • v.18 no.4
    • /
    • pp.165-173
    • /
    • 2009
  • Recent portable devices are so versatile that they have multiple communication channels and play several multimedia formats. Especially, many services are under development for users who connect Internet or nearby devices via WWAN (Wireless Wide Area Network) and/or WLAN (Wireless LAN). In case of paying the telecommunication cost proportional to the amount of data downloaded, it is necessary to reduce the cost by constructing a special ad hoc network in which each participating peer downloads a specific portion of the want-to-be-shared content over the payable WWAN channel and exchanges the remaining portion with other peers using the cost-free WLAN channel. If all peers participate in forwarding packets, some transmissions are redundant which results in the unnecessary consumption of bandwidth as well as the delayed content distribution time. In order to reduce the redundant transmission, this paper proposes both the excluding method which discourages some peers not to forward redundant packets, and the minimum cover set method in which only the minimum number of peers are in charge of forwarding packets. These two methods obviate redundant packet forwarding, and result in reduction of content distribution time by up to around 29%.

Monte Carlo Simulations of Selection Responses for Improving High Meat Qualities Using Real Time Ultrasound in Korean Cattle (초음파측정 활용 고급육형 한우개량을 위한 선발반응 Monte Carlo 모의실험)

  • Lee, D. H.
    • Journal of Animal Science and Technology
    • /
    • v.45 no.3
    • /
    • pp.343-354
    • /
    • 2003
  • Simulation studies were carried out to investigate the responses of selection for three carcass traits (longissimus muscle area: EMA, fat thickness: BF, and marbling score: MS) based on either adjusted phenotypes (APH) or estimated breeding values (EBV) in multivariate animal model with different breeding schemes. Selection responses were estimated and compared on six different models with respect to breeding schemes using either carcass measurements or real time ultrasonic (RTU) scans generated by Monte Carlo computer simulation supporting closed breeding population. From the base population with 100 sires and 2000 dams, 20 sires and 1000 dams by each generation were selected by either APH or EBV for 10 generations. Relative economic weights were equal of three traits as EMA(1): BF(-1) : MS(1) for standardized either APH or EBV. For first two models which were similarly designed with current progeny-test program in Korean cattle, three carcass traits with records either only on male progenies (Model 1) or on male and female progenies (Model 2) were used for selecting breeding stocks. Subsequently, generation intervals on males were assumed as 6${\sim}$10 years in these two models. The other two models were designed with tools of selection by RTU rather than carcass measurements with genetic correlations of 0.81${\sim}$0.97 between RTU and corresponding carcass traits in addition to whether with records (Model 4) or without records (Model 3) on female. In these cases, generation intervals on males were assumed as 2${\sim}$4 years. The remaining last two models were designed as similar with Models 3 and 4 except genetic correlations of 0.63${\sim}$0.68 between RTU and corresponding carcass traits with records (Model 6) and without records (Model 5) on females. The results from 10 replicates on each model and selecting methods suggested that responses indirect selection for carcass traits in Model 4 were 1.66${\sim}$2.44 times efficient rather than those in Model 1. Otherwise, in Model 6 with assuming moderate genetic correlations, those efficiencies were 1.18${\sim}$2.08 times with comparing to responses in Model 1. However, selection response for marbling score was the smallest among three carcass traits because of small variation of measurements. From these results, this study suggested that indirect selection using RTU technology for improving high meat qualities in Korean cattle would be valuable with modifying measuring rules of marbling score forward to large variation or modifying relative economic weight for selection.

A hybrid algorithm for the synthesis of computer-generated holograms

  • Nguyen The Anh;An Jun Won;Choe Jae Gwang;Kim Nam
    • Proceedings of the Optical Society of Korea Conference
    • /
    • 2003.07a
    • /
    • pp.60-61
    • /
    • 2003
  • A new approach to reduce the computation time of genetic algorithm (GA) for making binary phase holograms is described. Synthesized holograms having diffraction efficiency of 75.8% and uniformity of 5.8% are proven in computer simulation and experimentally demonstrated. Recently, computer-generated holograms (CGHs) having high diffraction efficiency and flexibility of design have been widely developed in many applications such as optical information processing, optical computing, optical interconnection, etc. Among proposed optimization methods, GA has become popular due to its capability of reaching nearly global. However, there exits a drawback to consider when we use the genetic algorithm. It is the large amount of computation time to construct desired holograms. One of the major reasons that the GA' s operation may be time intensive results from the expense of computing the cost function that must Fourier transform the parameters encoded on the hologram into the fitness value. In trying to remedy this drawback, Artificial Neural Network (ANN) has been put forward, allowing CGHs to be created easily and quickly (1), but the quality of reconstructed images is not high enough to use in applications of high preciseness. For that, we are in attempt to find a new approach of combiningthe good properties and performance of both the GA and ANN to make CGHs of high diffraction efficiency in a short time. The optimization of CGH using the genetic algorithm is merely a process of iteration, including selection, crossover, and mutation operators [2]. It is worth noting that the evaluation of the cost function with the aim of selecting better holograms plays an important role in the implementation of the GA. However, this evaluation process wastes much time for Fourier transforming the encoded parameters on the hologram into the value to be solved. Depending on the speed of computer, this process can even last up to ten minutes. It will be more effective if instead of merely generating random holograms in the initial process, a set of approximately desired holograms is employed. By doing so, the initial population will contain less trial holograms equivalent to the reduction of the computation time of GA's. Accordingly, a hybrid algorithm that utilizes a trained neural network to initiate the GA's procedure is proposed. Consequently, the initial population contains less random holograms and is compensated by approximately desired holograms. Figure 1 is the flowchart of the hybrid algorithm in comparison with the classical GA. The procedure of synthesizing a hologram on computer is divided into two steps. First the simulation of holograms based on ANN method [1] to acquire approximately desired holograms is carried. With a teaching data set of 9 characters obtained from the classical GA, the number of layer is 3, the number of hidden node is 100, learning rate is 0.3, and momentum is 0.5, the artificial neural network trained enables us to attain the approximately desired holograms, which are fairly good agreement with what we suggested in the theory. The second step, effect of several parameters on the operation of the hybrid algorithm is investigated. In principle, the operation of the hybrid algorithm and GA are the same except the modification of the initial step. Hence, the verified results in Ref [2] of the parameters such as the probability of crossover and mutation, the tournament size, and the crossover block size are remained unchanged, beside of the reduced population size. The reconstructed image of 76.4% diffraction efficiency and 5.4% uniformity is achieved when the population size is 30, the iteration number is 2000, the probability of crossover is 0.75, and the probability of mutation is 0.001. A comparison between the hybrid algorithm and GA in term of diffraction efficiency and computation time is also evaluated as shown in Fig. 2. With a 66.7% reduction in computation time and a 2% increase in diffraction efficiency compared to the GA method, the hybrid algorithm demonstrates its efficient performance. In the optical experiment, the phase holograms were displayed on a programmable phase modulator (model XGA). Figures 3 are pictures of diffracted patterns of the letter "0" from the holograms generated using the hybrid algorithm. Diffraction efficiency of 75.8% and uniformity of 5.8% are measured. We see that the simulation and experiment results are fairly good agreement with each other. In this paper, Genetic Algorithm and Neural Network have been successfully combined in designing CGHs. This method gives a significant reduction in computation time compared to the GA method while still allowing holograms of high diffraction efficiency and uniformity to be achieved. This work was supported by No.mOl-2001-000-00324-0 (2002)) from the Korea Science & Engineering Foundation.

  • PDF

A Solution for Congestion and Performance Enhancement using Dynamic Packet Bursting in Mobile Ad Hoc Networks (모바일 애드 혹 네트워크에서 패킷 버스팅을 이용한 혼잡 해결 및 성능향상 기법)

  • Kim, Young-Duk;Yang, Yeon-Mo;Lee, Dong-Ha
    • Journal of KIISE:Information Networking
    • /
    • v.35 no.5
    • /
    • pp.409-414
    • /
    • 2008
  • In mobile ad hoc networks, most of on demand routing protocols such as DSR and AODV do not deal with traffic load during the route discovery procedure. To solve the congestion and achieve load balancing, many protocols have been proposed. However, the existing load balancing schemes has only considered avoiding the congested route in the route discovery procedure or finding an alternative route path during a communication session. To mitigate this problem, we have proposed a new scheme which considers the packet bursting mechanism in congested nodes. The proposed packet bursting scheme, which is originally introduced in IEEE 802.11e QoS specification, is to transmit multiple packets right after channel acquisition. Thus, congested nodes can forward buffered packets promptly and minimize bottleneck situation. Each node begins to transmit packets in normal mode whenever its congested status is dissolved. We also propose two threshold values to define exact overloaded status adaptively; one is interface queue length and the other is buffer occupancy time. Through an experimental simulation study, we have compared and contrasted our protocol with normal on demand routing protocols and showed that the proposed scheme is more efficient and effective especially when network traffic is heavily loaded.

Motor Control IP Design and Quality Evaluation from the Viewpoint of Reuse (ICCAS 2004)

  • Lee, Sang-Deok;Han, Sung-Ho;Kim, Min-Soo;Park, Young-Jun
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2004.08a
    • /
    • pp.981-985
    • /
    • 2004
  • In this paper we designed the motor control IP Core and evaluate its quality from the viewpoint of IP reuse. The most attractive merit of this methodology, so called IP-based hardware design, is hardware reuse. Although various vendors designed hardware with the same specification and got the same functional results, all that IPs is not the same quality in the reuse aspect. As tremendous calls for SoC have been increased, associated research about IP quality standard, VSIA(Virtual Socket Interface Alliance) and STARC(Semiconductor Technology Academic Research Center), has been doing best to make the IP quality evaluation system. And they made what conforms to objective IP design standard. We suggest the methodology to evaluate our own designed motor control IP quality with this standard. To attain our goal, we designed motor control IP that could control the motor velocity and position with feedback compensation algorithm. This controller has some IP blocks : digital filter, quadrature decoder, position counter, motion compensator, and PWM generator. Each block's functionality was verified by simulator ModelSim and then its quality was evaluated. To evaluate the core, We use Vnavigator for lint test and ModelSim for coverage check. During lint process, We adapted the OpenMORE's rule based on RMM (Reuse Methodology Manual) and it could tell us our IP's quality in a manner of the scored value form. If it is high, its quality is also high, and vice versa. During coverage check ModelSim-SE is used for verifying how our test circuits cover designs. This objective methods using well-defined commercial coverage metrics could perform a quantitative analysis of simulation completeness. In this manner, We evaluated the designed motor control IP's quality from the viewpoint of reuse. This methodology will save the time and cost in designing SoC that should integrate various IPs. In addition to this, It can be the guide for comparing the equally specified IP's quality. After all, we are continuously looking forward to enhancing our motor control IP in the aspect of not only functional perfection but also IP reuse to prepare for the SoC-Compliant motor control IP design.

  • PDF

Influence of relative distance between heater and quartz crucible on temperature profile of hot-zone in Czochralski silicon crystal growth (쵸크랄스키법 실리콘 성장로에서 핫존 온도분포 경향에 대한 히터와 석영도가니의 상대적 위치의 영향)

  • Kim, Kwanghun;Kwon, Sejin;Kim, Ilhwan;Park, Junseong;Shim, Taehun;Park, Jeagun
    • Journal of the Korean Crystal Growth and Crystal Technology
    • /
    • v.28 no.5
    • /
    • pp.179-184
    • /
    • 2018
  • To lessen oxygen concentrations in a wafer through modifying the length of graphite heaters, we investigated the influence of relative distance from heater to quartz crucible on temperature profile of hot-zone in Czochralski silicon-crystal growth by simulation. In particular, ATC temperature and power profiles as a function of different ingot body positions were investigated for five different heater designs; (a) typical side heater (SH), (b) short side heater-up (SSH-up), (c) short side heater-low (SSH-low), (d) bottom heater without side heater (Only-BH), and (e) side heater with bottom heater (SH + BH). It was confirmed that lower short side heater exhibited the highest ATC temperature, which was attributed to the longest distance from triple point to heater center. In addition, for the viewpoint of energy efficiency, it was observed that the typical side heater showed the lowest power because it heated more area of quartz crucible than that of others. This result provides the possibility to predict the feed-forward delta temperature profile as a function of various heater designs.

Comparison of ELLAM and LEZOOMPC for Developing an Efficient Modeling Technique (효율적인 수치 모델링 기법 개발을 위한 ELLAM과 LEZOOMPC의 비교분석)

  • Suk Hee-Jun
    • Journal of Soil and Groundwater Environment
    • /
    • v.11 no.1
    • /
    • pp.37-44
    • /
    • 2006
  • This study summarizes advantages and disadvantages of numerical methods and compares ELLAM and LEZOOMPC to develop an efficient numerical modeling technique on contaminant transport. Eulerian-Lagrangian method and Eulerian method are commonly used numerical techniques. However Eulerian-Lagrangian method does not conserve mass globally and fails to treat boundary in a straightforward manner. Also, Eulerian method has restrictions on the size of Courant number and mesh Peclet number because of time truncation error. ELLAM (Eulerian Lagrangian Localized Adjoint Method) which has been popularly used for past 10 years in numerical modeling, is known for overcoming these numerical problems of Eulerian-Lagrangian method and Eulerian method. However, this study investigates advantages and disadvantages of ELLAM and suggests a change for the better. To figure out the disadvantages of ELLAM, the results of ELLAM, LEZOOMPC (Lagrangian-Eulerian ZOOMing Peak and valley Capturing), and visual MODFLOW are compared for four examples having different mesh Peclet numbers. The result of ELLAM generates numerical oscillation at infinite of mesh Peclet number, but that of LEZOOMPC yields accurate simulations. The simulation results suggest that the numerical error of ELLAM could be alleviated by adopting some schemes in LEZOOMPC. In other words, the numerical model which combines ELLAM with backward particle tracking, forward particle tracking, adaptively local zooming, and peak/valley capturing of LEZOOMPC can be developed for not only overcoming the numerical error of ELLAM, but also keeping the numerical advantage of ELLAM.

A New Secure Multicast Protocol in Micro-Mobility Environments using Secure Group Key (마이크로 모빌리티 환경에서 보안 그룹키를 이용한 안전한 멀티캐스트 프로토콜)

  • Kang, Ho-Seok;Shim, Young-Chul
    • The KIPS Transactions:PartC
    • /
    • v.15C no.6
    • /
    • pp.573-586
    • /
    • 2008
  • The improved performance and miniaturization of computer and the improvement of wireless communication technology have enabled the emergence of many high quality services. Among them multicast services are receiving much attention and their usage is increasing due to the increase of Internet multimedia services such as video conference, multimedia stream, internet TV, etc. Security plays an important role in mobile multicast services. In this paper, we proposed a secure multicast protocol for a hierarchical micro-mobility environment. The proposed secure multicast protocol provides security services such as authentication, access control, confidentiality and integrity using mechanisms including symmetric/asymmetric key crypto-algorithms and capabilities. To provide forward/backward secrecy and scalability, we used sub-group keys based on the hierarchical micro-mobility environment. With this security services, it is possible to guard against all kinds of security attacks performed by illegal mobile nodes. Attacks executed by internal nodes can be thwarted except those attacks which delete packet or cause network resources to be wasted. We used simulator to measure the performance of proposed protocol. As a result, the simulation showed that effect of these security mechanisms on the multicast protocol was not too high.