• Geomechanics and Engineering
• /
• v.23 no.3
• /
• pp.189-206
• /
• 2020

The accurate modeling of boundary conditions is important in simulations of the discrete element method (DEM) and can affect the numerical results significantly. In conventional triaxial compression (CTC) tests, the specimens are wrapped by flexible membranes allowing to deform freely. To accurately model the boundary conditions of CTC, new flexible boundary algorithms for 2D and 3D DEM simulations are proposed. The new algorithms are computationally efficient and easy to implement. Moreover, both horizontal and vertical component of confining pressure are considered in the 2D and 3D algorithms, which can ensure that the directions of confining pressure are always perpendicular to the specimen surfaces. Furthermore, the boundaries are continuous and closed in the new algorithms, which can prevent the escape of particles from the specimens. The effectiveness of the proposed algorithms is validated by biaxial and triaxial simulations of granular materials. The results show that the algorithms allow the boundaries to deform non-uniformly on the premise of maintaining high control accuracy of confining pressure. Meanwhile, the influences of different lateral boundary conditions on the numerical results are discussed. It is indicated that the flexible boundary is more appropriate for the models with large strain or significant localization than rigid boundary.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.09a
• /
• pp.455-458
• /
• 2003

The variety of document ranking algorithms have developed to provide efficient mining results for user's query on the web environment. The typical ranking algorithms are the Vector-Space Model based on the text, PsgeRank and HITS algorithms based on the hyperlink structures and other several improvement algorithms. All these are for the user's convenience and preference. However, these algorithms are usually developed on then Horizontal and non-hierarchial web environments and are not suitable for the hierarchial web environments such as enterprise and defense networks. Thus, we must consider the special environment factors in order to improve the ranking algorithms. In this paper, we analyze the several typical algorithms used by hyperlink structures on the web environment. We, then suggest a configuration of the hierarchical web environment and also give the relations between agents of the web mining system. Next, we propose an improved ranking algorithm suitable to this kind of special environments. The proposed algorithm is considered both the hyperlink structures of the documents and the location of the user of the hierarchical web.

• Steel and Composite Structures
• /
• v.24 no.1
• /
• pp.93-112
• /
• 2017

Metaheuristic algorithms in general make use of uniform random numbers in their search for optimum designs. Levy Flight (LF) is a random walk consisting of a series of consecutive random steps. The use of LF instead of uniform random numbers improves the performance of metaheuristic algorithms. In this study, three discrete optimum design algorithms are developed for steel skeletal structures each of which is based on one of the recent metaheuristic algorithms. These are biogeography-based optimization (BBO), brain storm optimization (BSO), and artificial bee colony optimization (ABC) algorithms. The optimum design problem of steel skeletal structures is formulated considering LRFD-AISC code provisions and W-sections for frames members and pipe sections for truss members are selected from available section lists. The minimum weight of steel structures is taken as the objective function. The number of steel skeletal structures is designed by using the algorithms developed and effect of LF is investigated. It is noticed that use of LF results in up to 14% lighter optimum structures.

• Journal of Power Electronics
• /
• v.17 no.1
• /
• pp.88-95
• /
• 2017

To reduce common-mode voltage (CMV), various reduced CMV pulse width modulation (RCMV-PWM) algorithms have been proposed, including active zero state PWM (AZSPWM) algorithms, remote state PWM (RSPWM) algorithms, and near state PWM (NSPWM) algorithms. Among these algorithms, AZSPWM algorithms can reduce CMV, but they increase the number of switchings compared to the conventional space vector PWM (CSVPWM). This paper presents a new AZSPWM algorithm for reductions in both the CMV and total number of switchings in BLAC motor drives. Since the proposed AZSPWM algorithm uses only active voltage vectors for motor control, it reduces CMV by 1/3 compared to CSVPWM. The proposed AZSPWM algorithm also reduces the total number of switchings compared to existing AZSPWM algorithms by eliminating the switchings required from one sector to the next. The performance of the proposed algorithm is verified by analyses, simulations, and experimental results.

• ETRI Journal
• /
• v.38 no.2
• /
• pp.326-336
• /
• 2016

We propose and describe new error control algorithms for redundant residue number systems (RRNSs) and residue number system product codes. These algorithms employ search techniques for obtaining error values from within a set of values (that contains all possible error values). For a given RRNS, the error control algorithms have a computational complexity of $t{\cdot}O(log_2\;n+log_2\;{\bar{m}})$ comparison operations, where t denotes the error correcting capability, n denotes the number of moduli, and ${\bar{m}}$ denotes the geometric average of moduli. These algorithms avoid most modular operations. We describe a refinement to the proposed algorithms that further avoids the modular operation required in their respective first steps, with an increase of ${\lceil}log_2\;n{\rceil}$ to their computational complexity. The new algorithms provide significant computational advantages over existing methods.

• Structural Engineering and Mechanics
• /
• v.75 no.2
• /
• pp.175-191
• /
• 2020

In this study, multi-story structures are actively controlled using metaheuristic algorithms. The soil conditions such as dense, normal and soft soil are considered under near-fault ground motions consisting of two types of impulsive motions called directivity effect (fault normal component) and the flint step (fault parallel component). In the active tendon-controlled structure, Proportional-Integral-Derivative (PID) type controller optimized by the proposed algorithms was used to achieve a control signal and to produce a corresponding control force. As the novelty of the study, the parameters of PID controller were determined by different metaheuristic algorithms to find the best one for seismic structures. These algorithms are flower pollination algorithm (FPA), teaching learning based optimization (TLBO) and Jaya Algorithm (JA). Furthermore, since the influence of time delay on the structural responses is an important issue for active control systems, it should be considered in the optimization process and time domain analyses. The proposed method was applied for a 15-story structural model and the feasible results were found by limiting the maximum control force for the near-fault records defined in FEMA P-695. Finally, it was determined that the active control using metaheuristic algorithms optimally reduced the structural responses and can be applied for the buildings with the soil-structure interaction (SSI).

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.4
• /
• pp.373-382
• /
• 2000

The most important metric in wormhole-routed networks is the start-up latency. In this paper, we present new multicast algorithms that reduce node contention so that multiple multicast messages can be implemented with reduced latency. By exploiting available channels evenly as much as possible, these new algorithms show better performance than the existing multicast algorithms for wormhole 2D systems when multiple multicasts are involved. All algorithms presented are proven to be deadlock-free. A simulation study has been conducted that compares the performance of these multicast algorithms under various situations in a 2D mesh. We show that the overall performance of ours are up to 20% better than the previous studies. We observe that reducing the number of the generated multidestination messages closely related to shorter message latency. These proposed algorithms can be easily extended to 3D mesh systems.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.12
• /
• pp.131-137
• /
• 2016

In this paper, the peak finding algorithms corresponding to the Autocorrelation Function (ACF), which are widely exploited for detecting the pitch of voiced signal, are proposed. According to various researchers, it is well known fact that the estimation of fundamental frequency (F0) in speech signal is not only very important task but quite difficult mission. The proposed algorithms, presented in this paper, are implemented by using many characteristics - such as monotonic increasing function - of ACF function. Thus, the proposed algorithms may be able to estimate both reliable and correct the fundamental frequency as long as the autocorrelation function of speech signal is accurate. Since the proposed algorithms may reduce the computational complexity it can be applied to the real-time processing. The speech data, is composed of Korean emotion expressed words, is used for evaluation of their performance. The pitches are measured to compare the performance of proposed algorithms.

• Journal of Korean Academy of Nursing Administration
• /
• v.17 no.3
• /
• pp.336-348
• /
• 2011

Purpose: This methodological study was done to develop a telephone consultation algorithms and practice guidelines for patient discharged with ophthalmic diseases. Methods: The ophthalmic problems of the patients were identified and expert knowledge on managing the problems was acquired. Algorithms and practice guidelines were developed based on the expert knowledge. The content validity of algorithms and practice guidelines was evaluated by the experts. Results: The preliminary algorithms and practice guidelines were developed from 60 detailed signs and symptoms and 45 nursing interventions. The experts agreed that 57 detailed signs and symptoms linked with nursing interventions were valid, with the content validity index over 80%. Meeting with nurse experts and ophthalmologists was convened to review the rest of the 3 detailed signs and symptoms linked with nursing interventions. Finally, 60 detailed signs and symptoms and 46 nursing interventions were confirmed. Conclusion: This study suggests that the algorithms and practice guidelines are effective decision-making tools and utilization of these algorithms and practice guidelines is expected to improve the quality of clinical nursing and patient satisfaction.

• Nuclear Engineering and Technology
• /
• v.53 no.11
• /
• pp.3505-3516
• /
• 2021

During nuclear facility decommissioning, workers are continuously exposed to high-level radiation. Hence, adequate path planning is critical to protect workers from unnecessary radiation exposure. This work discusses recent development in radioactive path planning and the algorithms recommended for the task. Specifically, we review the conventional methods for nuclear decommissioning path planning, analyze the techniques utilized in developing algorithms, and enumerate the decision factors that should be considered to optimize path planning algorithms. As a major contribution, we present the quantitative performance comparison of different algorithms utilized in solving path planning problems in nuclear decommissioning and highlight their merits and drawbacks. Also, we discuss techniques and critical consideration necessary for efficient application of robots and robotic path planning algorithms in nuclear facility decommissioning. Moreover, we analyze the influence of obstacles and the environmental/radioactive source dynamics on algorithms' efficiency. Finally, we recommend future research focus and highlight critical improvements required for the existing approaches towards a safer and cost-effective nuclear-decommissioning project.