• 제목/요약/키워드: Agreement Algorithm

Search Result 479, Processing Time 0.025 seconds

Design of the Coaxially Fed Circularly Polarized Rectangular Microstrip Antenna Using the Genetic Algorithm (유전자 앨거리즘을 이용한 동축선 급전 원형 편파 마이크로스트립 안테나 설계)

  • 이동근;이상설
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.11 no.4
    • /
    • pp.642-648
    • /
    • 2000
  • We introduce a new application of the genetic algorithm for design of the coaxial fed circularly polarized rectangular microstrip antenna. The GA shows excellent results for the design of the microstrip antenna which have a very complex objective function including the input impedance, the effective loss tangent and the axial ratio. The objective function is derived from the cavity model, and the size and the feeding point are optimized by the genetic algorithm. The experimental results show good agreement with the simulated results.

  • PDF

Development and Applications on Power Electronic Circuit Analysis Program PECAP (전력전자회로 해석프로그램 PECAP 개발과 응용)

  • 정태경;차귀수;함송엽
    • The Transactions of the Korean Institute of Electrical Engineers
    • /
    • v.32 no.10
    • /
    • pp.335-340
    • /
    • 1983
  • The analysis of static power converter circuit using state-space method is presented. Semiconductors are modeled in two-state resistors depending on their ON or OFF states. Then the modes of circuit are determined according to the conducting states of semiconductors and different describing matrices are given automatically for each mode. Newton-Raphson algorithm is used as an iterative method for obtaining steady-state solution and an adjoint network is introduced for the efficient and accurate evaluation of the Jacobi matrix in the algorithm. Using the porogram exploited from the above algorithm, it is shown through examples that the results are in good agreement with the analytic solutions and computation time is considerably reduced for obtaining the steady-state solutions.

  • PDF

A Robust Pair-wise Key Agreement Scheme based on Multi-hop Clustering Sensor Network Environments (멀티홉 클러스터 센서 네트워크 환경 기반에서 견고한 키 교환)

  • Han, Seung-Jin
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.3
    • /
    • pp.251-260
    • /
    • 2011
  • In this paper, we proposed a scheme that it safely exchanges encrypted keys without Trust Third Party (TTP) and Pre-distributing keys in multi-hop clustering sensor networks. Existing research assume that it exists a TTP or already it was pre-distributed a encrypted key between nodes. However, existing methods are not sufficient for USN environment without infrastructure. Some existing studies using a random number Diffie-Hellman algorithm to solve the problem. but the method was vulnerable to Replay and Man-in-the-middle attack from the malicious nodes. Therefore, authentication problem between nodes is solved by adding a ��TESLA. In this paper, we propose a modified Diffie-Hellman algorithm that it is safe, lightweight, and robust pair-wise agreement algorithm by adding One Time Password (OTP) with timestamp. Lastly, authentication, confidentiality, integrity, non-impersonation, backward secrecy, and forward secrecy to verify that it is safe.

Profit-Maximizing Virtual Machine Provisioning Based on Workload Prediction in Computing Cloud

  • Li, Qing;Yang, Qinghai;He, Qingsu;Kwak, Kyung Sup
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.12
    • /
    • pp.4950-4966
    • /
    • 2015
  • Cloud providers now face the problem of estimating the amount of computing resources required to satisfy a future workload. In this paper, a virtual machine provisioning (VMP) mechanism is designed to adapt workload fluctuation. The arrival rate of forthcoming jobs is predicted for acquiring the proper service rate by adopting an exponential smoothing (ES) method. The proper service rate is estimated to guarantee the service level agreement (SLA) constraints by using a diffusion approximation statistical model. The VMP problem is formulated as a facility location problem. Furthermore, it is characterized as the maximization of submodular function subject to the matroid constraints. A greedy-based VMP algorithm is designed to obtain the optimal virtual machine provision pattern. Simulation results illustrate that the proposed mechanism could increase the average profit efficiently without incurring significant quality of service (QoS) violations.

Design, Development and Analysis of Embedded Systems for Condition Monitoring of Rotating Machines using FFT Algorithm

  • Dessai, Sanket;Naaz, Zakiyaunnissa Alias Naziya
    • Journal of international Conference on Electrical Machines and Systems
    • /
    • v.3 no.4
    • /
    • pp.428-432
    • /
    • 2014
  • Rotating machines are an integral part of large electrical power machinery in most of the industries. Any degradation or outages in the rotating electric machinery can result in significant losses in productivity. It is critical to monitor the equipment for any degradation's so that it can serve as an early warning for adequate maintenance activities and repair. Prior research and field studies have indicated that the rotating machines have a particular type of signal structure during the initial start-up transient. A machine performance can be studied based on the effect of degradation in signal parameters. In this paper a data-acquisition system and the FFT algorithm has been design and model using the MATLAB and Simulink. The implementation had been carried out on the TMS320 DSP Processor and various testing and verification of the machine performance had been carried out. The results show good agreement with expected results for both simulated and real-time data. The real-time data from AC water pumps which have rotating motors built-in were collected and analysed. The FFT algorithm provides frequency response and based on this frequency response performance of the machine had been measured.The FFT algorithm provides only approximation about the machine performances.

Development of Objective Algorithm for Cloudiness using All-Sky Digital Camera (전천 카메라 영상을 이용한 자동 운량 분석)

  • Kim, Yun Mi;Kim, Jhoon;Cho, Hi Ku
    • Atmosphere
    • /
    • v.18 no.1
    • /
    • pp.1-14
    • /
    • 2008
  • The cloud amount, one of the basic parameter in atmospheric observation, have been observed by naked eyes of observers, which is affected by the subjective view. In order to ensure reliable and objective observation, a new algorithm to retrieve cloud amount was constructed using true color images composed of red, green and blue (RGB). The true color image is obtained by the Skyview, an all-sky imager taking pictures of sky, at the Science Building of Yonsei University, Seoul for a year in 2006. The principle of distinguishing clear sky from cloudy sky lies in the fact that the spectral characteristics of light scattering is different for air molecules and cloud. The result of Skyview's algorithm showed about 77% agreement between the observed cloud amount and the calculated, for the error range, the difference between calculated and observed cloudiness, within ${\pm}2$. Seasonally, the best accuracy of about 83% was obtained within ${\pm}2$ range in summer when the cloud amounts are higher, thus better signal-to-noise ratio. Furthermore, as the sky turbidity increased, the error also increased because of increased scattering which can explain the large error in spring. The algorithm still need to be improved in classifying sky condition more systematically with other complimentary instruments to discriminate thin cloud from haze to reduce errors in detecting clouds.

A Modified Multiple Depth First Search Algorithm for Grid Mapping Using Mini-Robots Khepera

  • El-Ghoul, Sally;Hussein, Ashraf S.;Wahab, M. S. Abdel;Witkowski, U.;Ruckert, U.
    • Journal of Computing Science and Engineering
    • /
    • v.2 no.4
    • /
    • pp.321-338
    • /
    • 2008
  • This paper presents a Modified Multiple Depth First Search algorithm for the exploration of the indoor environments occupied with obstacles in random distribution. The proposed algorithm was designed and implemented to employ one or a team of Khepera II mini robots for the exploration process. In case of multi-robots, the BlueCore2 External Bluetooth module was used to establish wireless networks with one master robot and one up to three slaves. Messages are sent and received via the module's Universal Asynchronous Receiver/Transmitter (UART) interface. Real exploration experiments were performed using locally developed teleworkbench with various autonomy features. In addition, computer simulation tool was also developed to simulate the exploration experiments with one master robot and one up to ten slaves. Computer simulations were in good agreement with the real experiments for the considered cases of one to one up to three networks. Results of the MMDFS for single robot exhibited 46% reduction in the needed number of steps for exploring environments with obstacles in comparison with other algorithms, namely the Ants algorithm and the original MDFS algorithm. This reduction reaches 71% whenever exploring open areas. Finally, results performed using multi-robots exhibited more reduction in the needed number of exploration steps.

Vibration Ride Quality Optimization of a Suspension Seat System Using Genetic Algorithm (유전자 알고리즘을 이용한 SUSPENSION SEAT SYSTEM의 진동 승차감 최적화)

  • Park, S.K.;Choi, Y.H.;Choi, H.O.;Bae, B.T.
    • Proceedings of the KSME Conference
    • /
    • 2001.06b
    • /
    • pp.584-589
    • /
    • 2001
  • This paper presents the dynamic parameter design optimization of a suspension seat system using the genetic algorithm. At first, an equivalent 1-D.O.F. mass-spring-damper model of a suspension seat system was constructed for the purpose of its vibration analysis. Vertical vibration response and transmissibility of the equivalent model due to base excitations, which are defined in the ISO's seat vibration test codes, were computed. Furthermore, seat vibration test, that is ISO's damping test, was carried out in order to investigate the validity of the equivalent suspension seat model. Both analytical and experimental results showed good agreement each other. For the design optimization, the acceleration transmissibility of the suspension seat model was adopted as an object function. A simple genetic algorithm was used to search the optimum values of the design variables, suspension stiffness and damping coefficient. Finally, vibration ride performance test results showed that the optimum suspension parameters gives the lowest vibration transmissibility. Accordingly the genetic algorithm and the equivalent suspension seat modelling can be successfully adopted in the vibration ride quality optimization of a suspension seat system.

  • PDF

Verification of multilevel octree grid algorithm of SN transport calculation with the Balakovo-3 VVER-1000 neutron dosimetry benchmark

  • Cong Liu;Bin Zhang;Junxia Wei;Shuang Tan
    • Nuclear Engineering and Technology
    • /
    • v.55 no.2
    • /
    • pp.756-768
    • /
    • 2023
  • Neutron transport calculations are extremely challenging due to the high computational cost of large and complex problems. A multilevel octree grid algorithm (MLTG) of discrete ordinates method was developed to improve the modeling accuracy and simulation efficiency on 3-D Cartesian grids. The Balakovo-3 VVER-1000 neutron dosimetry benchmark is calculated to verify and validate this numerical technique. A simplified S2 synthetic acceleration is used in the MLTG calculation method to improve the convergence of the source iterations. For the triangularly arranged fuel pins, we adopt a source projection algorithm to generate pin-by-pin source distributions of hexagonal assemblies. MLTG provides accurate geometric modeling and flexible fixed source description at a lower cost than traditional Cartesian grids. The total number of meshes is reduced to 1.9 million from the initial 9.5 million for the Balakovo-3 model. The numerical comparisons show that the MLTG results are in satisfactory agreement with the conventional SN method and experimental data, within the root-mean-square errors of about 4% and 10%, respectively. Compared to uniform fine meshing, approximately 70% of the computational cost can be saved using the MLTG algorithm for the Balakovo-3 computational model.

Dose Calculation of Photon Beam with Wedge Filter for Radiation Therapy Planning System

  • Cheong, Kwang-Ho;Suh, Tae-Suk;Lee, Hyoung-Koo;Choe, Bo-Young
    • Proceedings of the Korean Society of Medical Physics Conference
    • /
    • 2003.09a
    • /
    • pp.41-41
    • /
    • 2003
  • Purpose: Even if the wedge filter is widely used for the radiation therapy to modify the photon beam intensity, the wedged photon beam dose calculation is not so easy. Radiation therapy planning systems (RTPS) have been used the empirical or semi-analytical methods such as attenuation method using wedge filter parameters or wedge filter factor obtained from measurement. However, these methods can cause serious error in penumbra region as well as in edge region. In this study, we propose the dose calculation algorithm for wedged field to minimize the error especially in the outer beam region. Materials and Method: Modified intensity by wedge filter was calculated using tissue-maximum ratio (TMR) and scatter-maximum ratio (SMR) of wedged field. Profiles of wedged and non-wedged direction was also used. The result of new dose calculation was compared with measurement and the result from attenuation method. Results: Proposed algorithm showed the good agreement with measurement in the high dose-gradient region as well as in the inner beam region. The error was decreased comparing to attenuation method. Conclusion: Although necessary beam data for the RTPS commissioning was increased, new algorithm would guarantee the improved dose calculation accuracy for wedged field. In future, this algorithm could be adopted in RTPS.

  • PDF