• Journal of applied mathematics & informatics
• /
• v.30 no.3_4
• /
• pp.613-622
• /
• 2012

In this paper, we propose a new algorithm to modify the standard Mann' process to have strong convergence for $k$-strictly pseudo-contractive non-self mapping in Hilbert spaces.

• Journal of Computing Science and Engineering
• /
• v.8 no.2
• /
• pp.87-93
• /
• 2014

Coronary artery disease (CAD) is currently a prevalent disease from which many people suffer. Early detection and treatment could reduce the risk of heart attack. Currently, the golden standard for the diagnosis of CAD is angiography, which is an invasive procedure. In this article, we propose an algorithm that uses data mining techniques, a fuzzy expert system, and the imperialist competitive algorithm (ICA), to make CAD diagnosis by a non-invasive procedure. The ICA is used to adjust the fuzzy membership functions. The proposed method has been evaluated with the Cleveland and Hungarian datasets. The advantage of this method, compared with others, is the interpretability. The accuracy of the proposed method is 94.92% by 11 rules, and the average length of 4. To compare the colonial competitive algorithm with other metaheuristic algorithms, the proposed method has been implemented with the particle swarm optimization (PSO) algorithm. The results indicate that the colonial competition algorithm is more efficient than the PSO algorithm.

• Transactions of the Korean Society of Machine Tool Engineers
• /
• v.11 no.3
• /
• pp.80-85
• /
• 2002

The free curve gear is a non-circular gear without any relating center, which can perform free curve motion for complicated mechanisms, and minimize the work area. In this study, an algorithms for tooth profile generation of free curve involute gear is developed. The algorithm uses the involute gear creating principle in which a gear can be generated by rolling with another standard involute one. Cycloid me and third polynomial curve gears were designed and verified by computer graphics. These gears are manufactured in the wire-cut EDM and examined in engagement with a standard spur gear. The results showed that the proposed algorithm is successful to design and to manufacture the free curve gear with concave and convex profiles.

• Journal of computational fluids engineering
• /
• v.7 no.1
• /
• pp.1-9
• /
• 2002

In this paper, a modification of PISO algorithm based on standard k-ε turbulence model was proposed. The numerical technique used in this research is finite volume method, hybrid scheme for discretizing convection term, Euler implicit scheme for discretizing time term, and non-staggered grid. The basic idea of the modification of PISO algorithm is to perform an additional corrector stage for turbulence kinetic energy and dissipation rate to correct the inconsistence of flow and turbulence. In order to validate this algorithm, simulation of flow around a square cylinder (Re=3000) was performed in two-dimensional case. The results obtained from the proposed scheme show better agreement with those from the experiment than using original PISO algorithm in coherent velocity field.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.45 no.3
• /
• pp.40-48
• /
• 2022

An automated material handling system (AMHS) has been emerging as an important factor in the semiconductor wafer manufacturing industry. In general, an automated guided vehicle (AGV) in the Fab's AMHS travels hundreds of miles on guided paths to transport a lot through hundreds of operations. The AMHS aims to transfer wafers while ensuring a short delivery time and high operational reliability. Many linear and analytic approaches have evaluated and improved the performance of the AMHS under a deterministic environment. However, the analytic approaches cannot consider a non-linear, non-convex, and black-box performance measurement of the AMHS owing to the AMHS's complexity and uncertainty. Unexpected vehicle congestion increases the delivery time and deteriorates the Fab's production efficiency. In this study, we propose a Q-Learning based dynamic routing algorithm considering vehicle congestion to reduce the delivery time. The proposed algorithm captures time-variant vehicle traffic and decreases vehicle congestion. Through simulation experiments, we confirm that the proposed algorithm finds an efficient path for the vehicles compared to benchmark algorithms with a reduced mean and decreased standard deviation of the delivery time in the Fab's AMHS.

• Structural Engineering and Mechanics
• /
• v.27 no.5
• /
• pp.575-588
• /
• 2007

In this paper, two algorithms are presented for the optimum design of geometrically nonlinear steel space frames using tabu search. The first algorithm utilizes the features of short-term memory (tabu list) facility and aspiration criteria and the other has long-term memory (back-tracking) facility in addition to the aforementioned features. The design algorithms obtain minimum weight frames by selecting suitable sections from a standard set of steel sections such as American Institute of Steel Construction (AISC) wide-flange (W) shapes. Stress constraints of AISC Allowable stress design (ASD) specification, maximum drift (lateral displacement) and interstorey drift constraints were imposed on the frames. The algorithms were applied to the optimum design of three space frame structures. The designs obtained using the two algorithms were compared to each other. The comparisons showed that the second algorithm resulted in lighter frames.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.1
• /
• pp.202-215
• /
• 2023

This paper proposes a non-orthogonal multiple access (NOMA) based low-complexity relaying approach for multiuser cellular two-way relay channels (CTWRCs). In the proposed scheme, the relay detects the signal using successive interference cancellation (SIC) and re-generates the transmit signal with zero-forcing (ZF) transmit precoding. The achievable data rates of the NOMA-based multiuser two-way relaying (TWR) approach is analyzed. We further study the power allocation among different data streams to maximize the weighted sum-rate (WSR). We re-form the resultant non-convex problem into a standard monotonic program. Then, we design a polyblock outer approximation algorithm to sovle the WSR problem.The proposed optimal power allocation algorithm converges fast and it is shown that the NOMA-TWR-OPA scheme outperforms a NOMA benchmark scheme and conventional TWR schemes.

• Korean Journal of Biological Psychiatry
• /
• v.27 no.1
• /
• pp.1-8
• /
• 2020

Objectives In electroconvulsive therapy (ECT) research and practice, the precise determination of seizure duration is important in the evaluation of clinical relevance of the ECT-induced seizure. In this study, we have developed computerized algorithms to assess the duration of ECT-induced seizure. Methods Subjects included 5 males and 6 females, with the mean age of 33.1 years. Total 55 ECT sessions were included in the analysis. We analyzed the standard deviation of a finite block of electroencephalography (EEG) data and the change in the local slope of RR intervals in electrocardiography (ECG) signals during ECT-induced seizure. And then, we compared the calculated seizure durations from EEG recording (EEG algorithm) and ECG recording (ECG algorithm) with values determined by consensus of clinicians based on the recorded EEG (EEG consensus), as a gold standard criterion, in order to testify the computational validity of our algorithms. Results The mean seizure durations calculated by each method were not significantly different in sessions with abrupt flattened postictal suppression and in sessions with non-abrupt flattened postictal suppression. The intraclass correlation coefficients (95% confidence interval) of the three methods (EEG algorithm, ECG algorithm, EEG consensus) were significant in the total sessions [0.79 (0.70-0.86)], the abrupt flattened postictal suppression sessions [0.84 (0.74-0.91)], and the non-abrupt flattened postictal suppression sessions [0.67 (0.45-0.84)]. Correlations between three methods were also statistically significant, regardless of abruptness of transition. Conclusions Our proposed algorithms could reliably measure the duration of ECT-induced seizure, even in sessions with non-abrupt transitions to flat postictal suppression, in which it is typically difficult to determine the seizure duration.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.5
• /
• pp.33-39
• /
• 2010

In this paper, we propose an improved anti-collision algorithm. We have designed an anti-collision unit using this algorithm for the 18000-6 Type C Class 1 Generation 2 standard (Gen2). The Gen2 standard uses a Q-algorithm for incremental method on the Dynamic Slot-Aloha algorithm. It has basically enhanced performance over the Slot-Aloha algorithm. Unfortunately, there are several non-clarified parts: initial value. If an incorrect value is selected, it causes degradation in performance. To increase throughput and system efficiency, and to decrease tag identification time, we propose an improved anti-collision algorithm. prorosed Q algorithm has an increment of 5% of system efficiency and a decrement of 9% of tag identification time.

• Journal of information and communication convergence engineering
• /
• v.12 no.4
• /
• pp.252-256
• /
• 2014

Traditional block cipher Advanced Encryption Standard (AES) is widely used in the field of network security, but it has high overhead on each operation. In the 15th international workshop on information security applications, a novel lightweight and low-power encryption algorithm named low-power encryption algorithm (LEA) was released. This algorithm has certain useful features for hardware and software implementations, that is, simple addition, rotation, exclusive-or (ARX) operations, non-Substitute-BOX architecture, and 32-bit word size. In this study, we further improve the LEA encryptions for cloud computing. The Web-based implementations include JavaScript and assembly codes. Unlike normal implementation, JavaScript does not support unsigned integer and rotation operations; therefore, we present several techniques for resolving this issue. Furthermore, the proposed method yields a speed-optimized result and shows high performance enhancements. Each implementation is tested using various Web browsers, such as Google Chrome, Internet Explorer, and Mozilla Firefox, and on various devices including personal computers and mobile devices. These results extend the use of LEA encryption to any circumstance.