• Title/Summary/Keyword: random changing process

Search Result 28, Processing Time 0.035 seconds

Employees' Intention to Leave Job: The Case of Micro Finance Institution

  • Rabin Subedi;Surendra Neupane;Raju Ram Adhikari
    • Journal of Information Technology Applications and Management
    • /
    • v.28 no.5
    • /
    • pp.51-60
    • /
    • 2021
  • The main purpose of this study is to examine the factors that influence the employee's intention to leave the current job. A descriptive survey design was conducted and primary data were collected by using questionnaire. The study was based on random sampling; a sample of 200 was drawn from the employees who work in different micro finance institutions in Nepal. For the data analysis percentage analysis and chi square-test were used. The study revealed that salary, working condition, career growth, supervisor behavior and outstation influence the job quitting process. The study also defined the association between the reasons for leaving job such as salary, working condition, career growth supervisor behaviour & outstation and satisfaction, time spent in the organisation, training & development facility, frequency of changing job & encourage from immediate boss. This study establishes the importance of intentions of employees to quit job and provides further evidence in revealing the intentions to quit among the employees.

Theoretical analysis of the lightwave localization phenomenon on the random transmission line (part 1) : localization characteristics of the solution of propagation equation (랜덤 선로상의 광 국재현상에 관한 해석(1) : 해의 국재성에 대한 이론적 고찰)

  • 최영규
    • Korean Journal of Optics and Photonics
    • /
    • v.14 no.4
    • /
    • pp.429-433
    • /
    • 2003
  • We try to analyse the localization phenomenon of a lightwave in random media by means of considering the solution of the propagation equation on a transmission line in which the propagation constants are randomly distributed. Lightwave localization is generated at the turning point where the solution is changed suddenly from an increase to a decrease. First, in order to investigate the changing process of the solution, we have derived the approximated one-dimensional Schrodinger equation from the two-dimensional wave equation by using the Brags condition. Considering the many types of solutions of the wave equation, we have investigated the conditions that allow the solutions to exist. Also, we have investigated the relationships between the localization of the solution and the variation of the propagation constant. In case of the exponential solution, we know that the permittivity $\varepsilon$=(0,0$\varepsilon$$_{0}$) is a very important parameter to influence the phase of the lightwave and to generate the localization.

Performance Analysis of Scheduling Rules in Semiconductor Wafer Fabrication (반도체 웨이퍼 제조공정에서의 스케줄링 규칙들의 성능 분석)

  • 정봉주
    • Journal of the Korea Society for Simulation
    • /
    • v.8 no.3
    • /
    • pp.49-66
    • /
    • 1999
  • Semiconductor wafer fabrication is known to be one of the most complex manufacturing processes due to process intricacy, random yields, product diversity, and rapid changing technologies. In this study we are concerned with the impact of lot release and dispatching policies on the performance of semiconductor wafer fabrication facilities. We consider several semiconductor wafer fabrication environments according to the machine failure types such as no failure, normal MTBF, bottleneck with low MTBF, high randomness, and high MTBF cases. Lot release rules to be considered are Deterministic, Poisson process, WR(Workload Regulation), SA(Starvation Avoidance), and Multi-SA. These rules are combined with several dispatching rules such as FIFO (First In First Out), SRPT (Shortest Remaining Processing Time), and NING/M(smallest Number In Next Queue per Machine). We applied the combined policies to each of semiconductor wafer fabrication environments. These policies are assessed in terms of throughput and flow time. Basically Weins fabrication setup was used to make the simulation models. The simulation parameters were obtained through the preliminary simulation experiments. The key results throughout the simulation experiments is that Multi-SA and SA are the most robust rules, which give mostly good performance for any wafer fabrication environments when used with any dispatching rules. The more important result is that for each of wafer fabrication environments there exist the best and worst choices of lot release and dispatching policies. For example, the Poisson release rule results in the least throughput and largest flow time without regard to failure types and dispatching rules.

  • PDF

Thermal Process Effects on Grain Size and Orientation in (Bi1La1)4Ti3O12 Thin Film Deposited by Spin-on Method (스핀 코팅법으로 증착한 (Bi1La1)4Ti3O12 박막의 후속 열공정에 따른 입자 크기 및 결정 방향성 변화)

  • Kim, Young-Min;Kim, Nam-Kyeong;Yeom, Seung-Jin;Jang, Gun-Eik;Ryu, Sung-Lim;Sun, Ho-Jung;Kweon, Soon-Yong
    • Journal of the Korean Institute of Electrical and Electronic Material Engineers
    • /
    • v.20 no.7
    • /
    • pp.575-580
    • /
    • 2007
  • A 16 Mb 1T1C FeRAM device was integrated with BLT capacitors. But a lot of cells were failed randomly during the measuring the bit-line signal distribution of each cell. The reason was revealed that the grain size and orientation of the BLT thin film were severely non-uniform. And the grain size and orientation were severely affected by the process conditions of post heat treatment, especially nucleation step. The optimized annealing temperature at the nucleation step was $560^{\circ}C$. The microstructure of the BLT thin film was also varied by the annealing time at the step. The longer process time showed the finer grain size. Therefore, the uniformity of the grain size and orientation could be improved by changing the process conditions of the nucleation step. The FeRAM device without random bit-fail cell was successfully fabricated with the optimized BLT capacitor and the sensing margin in bit-line signal distribution of it was about 340 mV.

Random Forest Method and Simulation-based Effect Analysis for Real-time Target Re-designation in Missile Flight (유도탄의 실시간 표적 재지정을 위한 랜덤 포레스트 기법과 시뮬레이션 기반 효과 분석)

  • Lee, Han-Kang;Jang, Jae-Yeon;Ahn, Jae-Min;Kim, Chang-Ouk
    • Journal of the Korea Society for Simulation
    • /
    • v.27 no.2
    • /
    • pp.35-48
    • /
    • 2018
  • The study of air defense against North Korean tactical ballistic missiles (TBM) should consider the rapidly changing battlefield environment. The study for target re-designation for intercept missiles enables effective operation of friendly defensive assets as well as responses to dynamic battlefield. The researches that have been conducted so far do not represent real-time dynamic battlefield situation because the hit probability for the TBM, which plays an important role in the decision making process, is fixed. Therefore, this study proposes a target re-designation algorithm that makes decision based on hit probability which considers real-time field environment. The proposed method contains a trajectory prediction model that predicts the expected trajectory of the TBM from the current position and velocity information by using random forest and moving window. The predicted hit probability can be calculated through the trajectory prediction model and the simulator of the intercept missile, and the calculated hit probability becomes the decision criterion of the target re-designation algorithm for the missile. In the experiment, the validity of the methodology used in the TBM trajectory prediction model was verified and the superiority of using the hit probability through the proposed model in the target re-designation decision making process was validated.

Design and Implementation of Security Technique in Electronic Signature System (전자결재 시스템에서 보안기법 설계 및 구현)

  • 유영모;강성수;김완규;송진국
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2001.10a
    • /
    • pp.491-498
    • /
    • 2001
  • IN this Paper we propose an encryption algorithm for security in data communication. this algorithm acts encryption operation after the compression of data in order to reduce the transmission time and storage an encryption key is generated by using a parameter. as soon as key value is generated the parameter is transmitted and key is recreated every 26 times of parameter changing. the random number which is a constituent unit of encryption key is stored in a table the table is reorganized when the key is generated 40 times in order to intensity the security of encryption key. the encryption of data is made through the operation process of the generated key and sour data and the decryption performs the revers operation of encryption after getting decryption key by searching the transmitted parameter. as this algorithm is performed lastly it is possible to be used in practice.

  • PDF

An Optimal Design of pilot type relief valve by Genetic Algorithm (파일럿형 압력 릴리프 밸브의 최적설계)

  • 김승우;안경관;양순용;이병룡;윤소남
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2003.06a
    • /
    • pp.1006-1011
    • /
    • 2003
  • In this study, a novel systematic design procedure by Genetic Algorithm of a two stage relief valve is proposed. First of all, a mathematical model describing the dynamics of a balanced piston type relief valve has been derived. Governing equations such as dynamic equations for the main spool and the pilot spool and flow equations for each orifice are established. The mathematical model is verified by comparing the results of simulation with that of experiments. Furthermore, influences of the parameters on the dynamic characteristics of a relief valve have been investigated by simulation of the proposed model. Major design parameters on the valve response are determined, which affect the system response significantly. And then, using the determined parameters, the optimization of the two stage relief valve by Genetic Algorithm, which is a random search algorithm can find the global optimum without converging local optimum, is performed. The optimal design process of a two stage relief valve is presented to determine the major design parameters. Fitness function reflects the changing pressure according to parameters. It is shown that the genetic algorithms satisfactorily optimized the major design parameters of the two stage relief valve.

  • PDF

An Optimal Design of a two stage relief valve by Genetic Algorithm (유전자 알고리즘을 이용한 2단 릴리프 밸브의 최적설계)

  • 김승우;안경관;이병룡
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2002.10a
    • /
    • pp.501-506
    • /
    • 2002
  • In this study, a novel systematic design procedure by Genetic Algorithm of a two stage relief valve is proposed. First of all. a mathematical model describing the dynamics of a balanced piston type relief valve has been derived. Governing equations such as dynamic equations for the main spool and the pilot spool and flow equations for each orifice are established. The mathematical model is verified by comparing the results of simulation with that of experiments. Furthermore, influences of the parameters on the dynamic characteristics of a relief valve have been investigated by simulation of the proposed model. Major design parameters on the valve response are determined, which affect the system response significantly. And then, using the determined parameters, the optimization of the two stage relief valve by Genetic Algorithm, which is a random search algorithm can find the global optimum without converging local optimum, is performed. The optimal design process of a two stage relief valve is presented to determine the major design parameters. Fitness function reflects the changing pressure according to parameters. It is shown that the genetic algorithms satisfactorily optimized the major design parameters of the two stage relief valve.

  • PDF

A Watermarking Scheme for Shapefile-Based GIS Digital Map Using Polyline Perimeter Distribution

  • Huo, Xiao-Jiao;Lee, Suk-Hwan;Kwon, Seong-Geun;Moon, Kwan-Seok;Kwon, Ki-Ryong
    • Journal of Korea Multimedia Society
    • /
    • v.14 no.5
    • /
    • pp.595-606
    • /
    • 2011
  • This paper proposes a robust watermarking scheme for GIS digital map by using the geometric properties of polyline and polygon, which are the fundamental components in vector data structure. In the proposed scheme, we calculate the lengths and the perimeters of all polylines and polygons in a map and cluster them to a number of groups. Then we embed the binary watermark by changing the mean of lengths and perimeters in an embedding group. For improving the safety and robustness, we permute the binary watermark through PRNS(pseudo-random number sequence) processing and embed it repeatedly in a model. Experimental results verified that our scheme has a good invisibility, safety and robustness to various geometric attacks and also our scheme needs not the original map in the extracting process of watermark.

DL-RRT* algorithm for least dose path Re-planning in dynamic radioactive environments

  • Chao, Nan;Liu, Yong-kuo;Xia, Hong;Peng, Min-jun;Ayodeji, Abiodun
    • Nuclear Engineering and Technology
    • /
    • v.51 no.3
    • /
    • pp.825-836
    • /
    • 2019
  • One of the most challenging safety precautions for workers in dynamic, radioactive environments is avoiding radiation sources and sustaining low exposure. This paper presents a sampling-based algorithm, DL-RRT*, for minimum dose walk-path re-planning in radioactive environments, expedient for occupational workers in nuclear facilities to avoid unnecessary radiation exposure. The method combines the principle of random tree star ($RRT^*$) and $D^*$ Lite, and uses the expansion strength of grid search strategy from $D^*$ Lite to quickly find a high-quality initial path to accelerate convergence rate in $RRT^*$. The algorithm inherits probabilistic completeness and asymptotic optimality from $RRT^*$ to refine the existing paths continually by sampling the search-graph obtained from the grid search process. It can not only be applied to continuous cost spaces, but also make full use of the last planning information to avoid global re-planning, so as to improve the efficiency of path planning in frequently changing environments. The effectiveness and superiority of the proposed method was verified by simulating radiation field under varying obstacles and radioactive environments, and the results were compared with $RRT^*$ algorithm output.