• 대한의용생체공학회:의공학회지
• /
• 제29권6호
• /
• pp.502-511
• /
• 2008

This study was designed to develop a new algorithm to extract the voluntary EMG and the evoked EMG from a mixed EMG generated when the muscle is stimulated both voluntarily and by electrical stimulation in the FES system. The proposed parallel filter algorithm consists of three phases: (1) Fourier transform of the mixed EMG, (2) multiplication of the transformed signal to two frequency functions, and (3) inverse Fourier transform. Four incomplete spinal cord injured patients participated in the experiments to evaluate the algorithm by measuring the knee extensor torque and the EMG signals from the quadriceps. Two functions of the algorithms were evaluated: (1) extraction of the evoked EMG and (2) the voluntary EMG from the mixed EMG. The results showed that the algorithm enabled us to separate the two EMG components in real time from the mixed EMG. The algorithm can and will be used for estimating the voluntary torque and the evoked torque independently through an artificial neural network based on the two EMG components, and also for generating a trigger signal to control the on/off time of the FES system.

• 대한수학회보
• /
• 제47권4호
• /
• pp.675-685
• /
• 2010

In this paper, we consider a new class of regularized (nonconvex) generalized mixed variational inequality problems in real Hilbert space. We give the concepts of partially relaxed strongly mixed monotone and partially relaxed strongly $\theta$-pseudomonotone mappings, which are extension of the concepts given by Xia and Ding [19], Noor [13] and Kazmi et al. [9]. Further we use the auxiliary principle technique to suggest a two-step iterative algorithm for solving regularized (nonconvex) generalized mixed variational inequality problem. We prove that the convergence of the iterative algorithm requires only the continuity, partially relaxed strongly mixed monotonicity and partially relaxed strongly $\theta$-pseudomonotonicity. The theorems presented in this paper represent improvement and generalization of the previously known results for solving equilibrium problems and variational inequality problems involving the nonconvex (convex) sets, see for example Noor [13], Pang et al. [14], and Xia and Ding [19].

• 한국정보시스템학회지:정보시스템연구
• /
• 제17권3호
• /
• pp.39-58
• /
• 2008

Mixed Chinese Postman Problem (MCPP) is a practical generalization of the classical Chinese Postman Problem (CPP) and it could be applied in many real world. Although MCPP is useful in terms of reality, MCPP has been proved to be a NP-complete problem. To find optimal solutions efficiently in MCPP, we can reduce searching space to be small effective searching space containing optimal solutions. We propose GENIIS methodology, which is a kind of hybrid algorithm combines the approximate algorithms and genetic algorithm. To get good solutions in the effective searching space, GENIIS uses approximate algorithm and genetic algorithm. This paper validates the usefulness of the proposed approach in a simulation. The results of our paper could be utilized to increase the efficiencies of network and transportation in business.

• Journal of Power Electronics
• /
• 제16권1호
• /
• pp.27-37
• /
• 2016

In this paper, a mixed algorithm is proposed to overcome the limitations of the conventional algorithms, which cannot be applied in various driving patterns of drivers. The proposed algorithm based on the coulomb counting method is mixed with reset algorithms that consist of the enhanced OCV reset method and the DCIR iterative calculation method. It has many advantages, such as a simple model structure, low computational overload in various profiles, and a low accumulated SOC error through the frequent SOC reset. In addition, the enhanced parameter based on a mathematical analysis of the second-order RC ladder model is calculated and is then applied to all of the methods. The proposed algorithm is verified by experimental results based on a 27-Ah LiPB. It is observed that the SOC RMSE of the proposed algorithm decreases by about 9.16% compared to the coulomb counting method.

• 호남수학학술지
• /
• 제26권4호
• /
• pp.391-399
• /
• 2004

In this paper, we develop an iterative algorithm for solving a class of nonlinear mixed implicit variational inequalities in Hilbert spaces. The resolvent operator technique is used to establish the equivalence between variational inequalities and fixed point problems. This equivalence is used to study the existence of a solution of nonlinear mixed implicit variational inequalities and to suggest an iterative algorithm for solving variational inequalities. In our results, we do not assume that the mapping is strongly monotone.

• 한국산업정보학회논문지
• /
• 제15권3호
• /
• pp.59-65
• /
• 2010

This paper proposes a modified heuristic mixed model assembly line (MMAL) balancing algorithm that provides consistent station assignments on a model by model basis as well as on a station by station. Basically, some of single model line balancing techniques are modified and incorporated to be fit into the MMAL. The proposed algorithm is based on N.T. Thomopoulos' [8] method and supplemented with several well proven single model line balancing techniques proposed in the literature until recently. Hoffman's precedence matrix [2] is used to indicate the ordering relations among tasks. Arcus' Rule IX [1] is applied to generate rapidly a fairly large number of feasible solutions. Consequently, this proposed algorithm reduces the fluctuations in operation times among the models as well as the stations and the balance delays. A numerical example shows that the proposed algorithm can provide a good feasible solution in a relatively short time and generate relatively better solutions comparing to other three existing methods.

• 산업공학
• /
• 제9권2호
• /
• pp.39-45
• /
• 1996

This paper investigates the problems of grouping N products on an assembly line with an objective of maximizing the option grouping rate. Before developing a mixed model grouping algorithm, simulation studies are committed for developing operating rules and evaluating the layout production systems. A mixed model grouping algorithm is suggested and it is applied to the color selection lane in automobile production system, which reveals a high mixed model grouping rate.

• East Asian mathematical journal
• /
• 제18권1호
• /
• pp.95-109
• /
• 2002

In this paper, we study a class of variational inequalities, which is called the generalized set-valued mixed variational inequality. By using the properties of the resolvent operator associated with a maximal monotone mapping in Hilbert spaces, we have established an existence theorem of solutions for generalized set-valued mixed variational inequalities, suggesting a new iterative algorithm and a perturbed proximal point algorithm for finding approximate solutions which strongly converge to the exact solution of the generalized set-valued mixed variational inequalities.

• 한국공작기계학회:학술대회논문집
• /
• 한국공작기계학회 2004년도 춘계학술대회 논문집
• /
• pp.118-123
• /
• 2004

In this study, genetic algorithm mixed binary and real encoding is proposed to deal with design variables of various types. And that is applied to optimum design of Multi-stage gear drive. Design of pressure vessel which is mixed discrete and continuous variables is applied to verify reasonableness of proposed genetic algorithm. The proposed genetic algorithm is applied for the gear ratio optimization and the volume minimization of geared motor which is used in field. In result, it shows that the volume has decreased about 8% compared with the existing geared motor.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 2002년도 춘계공동학술대회
• /
• pp.930-935
• /
• 2002

This paper presents a new method that can efficiently solve the integrated problem of line balancing and model sequencing in mixed-model U-lines (MMULs). Balancing and sequencing problem are important for an efficient use of MMULs and are tightly related with each other. However, in almost all the existing researches on mixed­model production lines, the two problems have been considered separately. In 1his research, an endosymbiotic evolutionary algorithm, which is a kind of evolutionary algorithm, is adopted as a methodology in order to solve the two problems simultaneously. Some evolutionary search capability, rapidity of convergence and population diversity. The proposed algorithm is compared with the existing evolutionary algorithm in terms of solution quality. The experimental results confirm the effectiveness of our approach.